19.17/8.83 YES 19.17/8.83 19.17/8.83 Ultimate: Cannot open display: 19.17/8.83 This is Ultimate 0.1.24-8dc7c08-m 19.17/8.83 [2019-03-29 02:01:45,747 INFO L170 SettingsManager]: Resetting all preferences to default values... 19.17/8.83 [2019-03-29 02:01:45,749 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values 19.17/8.83 [2019-03-29 02:01:45,761 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... 19.17/8.83 [2019-03-29 02:01:45,761 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values 19.17/8.83 [2019-03-29 02:01:45,762 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values 19.17/8.83 [2019-03-29 02:01:45,763 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values 19.17/8.83 [2019-03-29 02:01:45,765 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values 19.17/8.83 [2019-03-29 02:01:45,766 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values 19.17/8.83 [2019-03-29 02:01:45,767 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values 19.17/8.83 [2019-03-29 02:01:45,768 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... 19.17/8.83 [2019-03-29 02:01:45,768 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values 19.17/8.83 [2019-03-29 02:01:45,769 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values 19.17/8.83 [2019-03-29 02:01:45,770 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values 19.17/8.83 [2019-03-29 02:01:45,771 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values 19.17/8.83 [2019-03-29 02:01:45,771 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values 19.17/8.83 [2019-03-29 02:01:45,772 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values 19.17/8.83 [2019-03-29 02:01:45,774 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values 19.17/8.83 [2019-03-29 02:01:45,776 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values 19.17/8.83 [2019-03-29 02:01:45,777 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values 19.17/8.83 [2019-03-29 02:01:45,778 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values 19.17/8.83 [2019-03-29 02:01:45,779 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values 19.17/8.83 [2019-03-29 02:01:45,781 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... 19.17/8.83 [2019-03-29 02:01:45,782 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... 19.17/8.83 [2019-03-29 02:01:45,782 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values 19.17/8.83 [2019-03-29 02:01:45,783 INFO L174 SettingsManager]: Resetting IcfgToChc preferences to default values 19.17/8.83 [2019-03-29 02:01:45,783 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values 19.17/8.83 [2019-03-29 02:01:45,784 INFO L177 SettingsManager]: ReqToTest provides no preferences, ignoring... 19.17/8.83 [2019-03-29 02:01:45,784 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values 19.17/8.83 [2019-03-29 02:01:45,785 INFO L174 SettingsManager]: Resetting ChcSmtPrinter preferences to default values 19.17/8.83 [2019-03-29 02:01:45,786 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values 19.17/8.83 [2019-03-29 02:01:45,786 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values 19.17/8.83 [2019-03-29 02:01:45,787 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... 19.17/8.83 [2019-03-29 02:01:45,788 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values 19.17/8.83 [2019-03-29 02:01:45,788 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... 19.17/8.83 [2019-03-29 02:01:45,788 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... 19.17/8.83 [2019-03-29 02:01:45,789 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values 19.17/8.83 [2019-03-29 02:01:45,790 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values 19.17/8.83 [2019-03-29 02:01:45,790 INFO L181 SettingsManager]: Finished resetting all preferences to default values... 19.17/8.83 [2019-03-29 02:01:45,791 INFO L98 SettingsManager]: Beginning loading settings from /export/starexec/sandbox/solver/bin/./../termcomp2017.epf 19.17/8.83 [2019-03-29 02:01:45,805 INFO L110 SettingsManager]: Loading preferences was successful 19.17/8.83 [2019-03-29 02:01:45,805 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: 19.17/8.83 [2019-03-29 02:01:45,806 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: 19.17/8.83 [2019-03-29 02:01:45,807 INFO L133 SettingsManager]: * Rewrite not-equals=true 19.17/8.83 [2019-03-29 02:01:45,807 INFO L133 SettingsManager]: * Create parallel compositions if possible=false 19.17/8.83 [2019-03-29 02:01:45,807 INFO L133 SettingsManager]: * Minimize states using LBE with the strategy=SINGLE 19.17/8.83 [2019-03-29 02:01:45,807 INFO L133 SettingsManager]: * Use SBE=true 19.17/8.83 [2019-03-29 02:01:45,807 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: 19.17/8.83 [2019-03-29 02:01:45,808 INFO L133 SettingsManager]: * Use old map elimination=false 19.17/8.83 [2019-03-29 02:01:45,808 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false 19.17/8.83 [2019-03-29 02:01:45,808 INFO L133 SettingsManager]: * Buchi interpolant automaton construction strategy=DANDELION 19.17/8.83 [2019-03-29 02:01:45,808 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true 19.17/8.83 [2019-03-29 02:01:45,808 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES 19.17/8.83 [2019-03-29 02:01:45,809 INFO L133 SettingsManager]: * Construct termination proof for TermComp=true 19.17/8.83 [2019-03-29 02:01:45,809 INFO L133 SettingsManager]: * Command for external solver (GNTA synthesis)=z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 19.17/8.83 [2019-03-29 02:01:45,809 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: 19.17/8.83 [2019-03-29 02:01:45,809 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false 19.17/8.83 [2019-03-29 02:01:45,809 INFO L133 SettingsManager]: * Check division by zero=IGNORE 19.17/8.83 [2019-03-29 02:01:45,810 INFO L133 SettingsManager]: * Check if freed pointer was valid=false 19.17/8.83 [2019-03-29 02:01:45,810 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false 19.17/8.83 [2019-03-29 02:01:45,810 INFO L133 SettingsManager]: * How to treat unsigned ints differently from normal ones=IGNORE 19.17/8.83 [2019-03-29 02:01:45,810 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: 19.17/8.83 [2019-03-29 02:01:45,810 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements 19.17/8.83 [2019-03-29 02:01:45,811 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump 19.17/8.83 [2019-03-29 02:01:45,811 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 19.17/8.83 [2019-03-29 02:01:45,811 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: 19.17/8.83 [2019-03-29 02:01:45,811 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles 19.17/8.83 [2019-03-29 02:01:45,811 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL 19.17/8.83 [2019-03-29 02:01:45,811 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true 19.17/8.83 [2019-03-29 02:01:45,837 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp 19.17/8.83 [2019-03-29 02:01:45,850 INFO L259 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized 19.17/8.83 [2019-03-29 02:01:45,853 INFO L215 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. 19.17/8.83 [2019-03-29 02:01:45,855 INFO L271 PluginConnector]: Initializing CDTParser... 19.17/8.83 [2019-03-29 02:01:45,855 INFO L276 PluginConnector]: CDTParser initialized 19.17/8.83 [2019-03-29 02:01:45,856 INFO L430 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /export/starexec/sandbox/benchmark/theBenchmark.c 19.17/8.83 [2019-03-29 02:01:45,925 INFO L221 CDTParser]: Created temporary CDT project at /export/starexec/sandbox/tmp/6ad2a25760fe42cab5bcf80cb8076d21/FLAGd9586e47e 19.17/8.83 [2019-03-29 02:01:46,258 INFO L307 CDTParser]: Found 1 translation units. 19.17/8.83 [2019-03-29 02:01:46,259 INFO L161 CDTParser]: Scanning /export/starexec/sandbox/benchmark/theBenchmark.c 19.17/8.83 [2019-03-29 02:01:46,266 INFO L355 CDTParser]: About to delete temporary CDT project at /export/starexec/sandbox/tmp/6ad2a25760fe42cab5bcf80cb8076d21/FLAGd9586e47e 19.17/8.83 [2019-03-29 02:01:46,652 INFO L363 CDTParser]: Successfully deleted /export/starexec/sandbox/tmp/6ad2a25760fe42cab5bcf80cb8076d21 19.17/8.83 [2019-03-29 02:01:46,664 INFO L297 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### 19.17/8.83 [2019-03-29 02:01:46,665 INFO L131 ToolchainWalker]: Walking toolchain with 7 elements. 19.17/8.83 [2019-03-29 02:01:46,666 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- 19.17/8.83 [2019-03-29 02:01:46,667 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... 19.17/8.83 [2019-03-29 02:01:46,670 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized 19.17/8.83 [2019-03-29 02:01:46,671 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.03 02:01:46" (1/1) ... 19.17/8.83 [2019-03-29 02:01:46,674 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5595276d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.03 02:01:46, skipping insertion in model container 19.17/8.83 [2019-03-29 02:01:46,675 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.03 02:01:46" (1/1) ... 19.17/8.83 [2019-03-29 02:01:46,682 INFO L145 MainTranslator]: Starting translation in SV-COMP mode 19.17/8.83 [2019-03-29 02:01:46,702 INFO L176 MainTranslator]: Built tables and reachable declarations 19.17/8.83 [2019-03-29 02:01:46,866 INFO L206 PostProcessor]: Analyzing one entry point: main 19.17/8.83 [2019-03-29 02:01:46,870 INFO L191 MainTranslator]: Completed pre-run 19.17/8.83 [2019-03-29 02:01:46,892 INFO L206 PostProcessor]: Analyzing one entry point: main 19.17/8.83 [2019-03-29 02:01:46,970 INFO L195 MainTranslator]: Completed translation 19.17/8.83 [2019-03-29 02:01:46,970 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.03 02:01:46 WrapperNode 19.17/8.83 [2019-03-29 02:01:46,970 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- 19.17/8.83 [2019-03-29 02:01:46,971 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- 19.17/8.83 [2019-03-29 02:01:46,971 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... 19.17/8.83 [2019-03-29 02:01:46,972 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized 19.17/8.83 [2019-03-29 02:01:46,982 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.03 02:01:46" (1/1) ... 19.17/8.83 [2019-03-29 02:01:46,988 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.03 02:01:46" (1/1) ... 19.17/8.83 [2019-03-29 02:01:47,010 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- 19.17/8.83 [2019-03-29 02:01:47,011 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- 19.17/8.83 [2019-03-29 02:01:47,011 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... 19.17/8.83 [2019-03-29 02:01:47,011 INFO L276 PluginConnector]: Boogie Preprocessor initialized 19.17/8.83 [2019-03-29 02:01:47,021 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.03 02:01:46" (1/1) ... 19.17/8.83 [2019-03-29 02:01:47,021 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.03 02:01:46" (1/1) ... 19.17/8.83 [2019-03-29 02:01:47,022 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.03 02:01:46" (1/1) ... 19.17/8.83 [2019-03-29 02:01:47,022 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.03 02:01:46" (1/1) ... 19.17/8.83 [2019-03-29 02:01:47,024 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.03 02:01:46" (1/1) ... 19.17/8.83 [2019-03-29 02:01:47,030 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.03 02:01:46" (1/1) ... 19.17/8.83 [2019-03-29 02:01:47,031 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.03 02:01:46" (1/1) ... 19.17/8.83 [2019-03-29 02:01:47,033 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- 19.17/8.83 [2019-03-29 02:01:47,033 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- 19.17/8.83 [2019-03-29 02:01:47,033 INFO L271 PluginConnector]: Initializing RCFGBuilder... 19.17/8.83 [2019-03-29 02:01:47,033 INFO L276 PluginConnector]: RCFGBuilder initialized 19.17/8.83 [2019-03-29 02:01:47,035 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.03 02:01:46" (1/1) ... 19.17/8.83 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 19.17/8.83 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 (exit command is (exit), workingDir is null) 19.17/8.83 Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 19.17/8.83 [2019-03-29 02:01:47,105 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start 19.17/8.83 [2019-03-29 02:01:47,106 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start 19.17/8.83 [2019-03-29 02:01:47,299 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) 19.17/8.83 [2019-03-29 02:01:47,300 INFO L286 CfgBuilder]: Removed 5 assue(true) statements. 19.17/8.83 [2019-03-29 02:01:47,301 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.03 02:01:47 BoogieIcfgContainer 19.17/8.83 [2019-03-29 02:01:47,301 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- 19.17/8.83 [2019-03-29 02:01:47,302 INFO L113 PluginConnector]: ------------------------BlockEncodingV2---------------------------- 19.17/8.83 [2019-03-29 02:01:47,302 INFO L271 PluginConnector]: Initializing BlockEncodingV2... 19.17/8.83 [2019-03-29 02:01:47,305 INFO L276 PluginConnector]: BlockEncodingV2 initialized 19.17/8.83 [2019-03-29 02:01:47,306 INFO L185 PluginConnector]: Executing the observer BlockEncodingObserver from plugin BlockEncodingV2 for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.03 02:01:47" (1/1) ... 19.17/8.83 [2019-03-29 02:01:47,322 INFO L313 BlockEncoder]: Initial Icfg 15 locations, 25 edges 19.17/8.83 [2019-03-29 02:01:47,323 INFO L258 BlockEncoder]: Using Remove infeasible edges 19.17/8.83 [2019-03-29 02:01:47,324 INFO L263 BlockEncoder]: Using Maximize final states 19.17/8.83 [2019-03-29 02:01:47,325 INFO L270 BlockEncoder]: Using Minimize states even if more edges are added than removed.=false 19.17/8.83 [2019-03-29 02:01:47,325 INFO L276 BlockEncoder]: Using Minimize states using LBE with the strategy=SINGLE 19.17/8.83 [2019-03-29 02:01:47,327 INFO L296 BlockEncoder]: Using Remove sink states 19.17/8.83 [2019-03-29 02:01:47,328 INFO L171 BlockEncoder]: Using Apply optimizations until nothing changes=true 19.17/8.83 [2019-03-29 02:01:47,328 INFO L179 BlockEncoder]: Using Rewrite not-equals 19.17/8.83 [2019-03-29 02:01:47,353 INFO L185 BlockEncoder]: Using Use SBE 19.17/8.83 [2019-03-29 02:01:47,373 INFO L200 BlockEncoder]: SBE split 2 edges 19.17/8.83 [2019-03-29 02:01:47,377 INFO L70 emoveInfeasibleEdges]: Removed 1 edges and 0 locations because of local infeasibility 19.17/8.83 [2019-03-29 02:01:47,379 INFO L71 MaximizeFinalStates]: 0 new accepting states 19.17/8.83 [2019-03-29 02:01:47,389 INFO L100 BaseMinimizeStates]: Removed 4 edges and 2 locations by large block encoding 19.17/8.83 [2019-03-29 02:01:47,392 INFO L70 RemoveSinkStates]: Removed 3 edges and 2 locations by removing sink states 19.17/8.83 [2019-03-29 02:01:47,393 INFO L70 emoveInfeasibleEdges]: Removed 0 edges and 0 locations because of local infeasibility 19.17/8.83 [2019-03-29 02:01:47,393 INFO L71 MaximizeFinalStates]: 0 new accepting states 19.17/8.83 [2019-03-29 02:01:47,394 INFO L100 BaseMinimizeStates]: Removed 0 edges and 0 locations by large block encoding 19.17/8.83 [2019-03-29 02:01:47,394 INFO L70 RemoveSinkStates]: Removed 0 edges and 0 locations by removing sink states 19.17/8.83 [2019-03-29 02:01:47,395 INFO L313 BlockEncoder]: Encoded RCFG 11 locations, 21 edges 19.17/8.83 [2019-03-29 02:01:47,395 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 29.03 02:01:47 BasicIcfg 19.17/8.83 [2019-03-29 02:01:47,395 INFO L132 PluginConnector]: ------------------------ END BlockEncodingV2---------------------------- 19.17/8.83 [2019-03-29 02:01:47,396 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- 19.17/8.83 [2019-03-29 02:01:47,396 INFO L271 PluginConnector]: Initializing TraceAbstraction... 19.17/8.83 [2019-03-29 02:01:47,401 INFO L276 PluginConnector]: TraceAbstraction initialized 19.17/8.83 [2019-03-29 02:01:47,401 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.03 02:01:46" (1/4) ... 19.17/8.83 [2019-03-29 02:01:47,402 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4999d360 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.03 02:01:47, skipping insertion in model container 19.17/8.83 [2019-03-29 02:01:47,402 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.03 02:01:46" (2/4) ... 19.17/8.83 [2019-03-29 02:01:47,403 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4999d360 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.03 02:01:47, skipping insertion in model container 19.17/8.83 [2019-03-29 02:01:47,403 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.03 02:01:47" (3/4) ... 19.17/8.83 [2019-03-29 02:01:47,403 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4999d360 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 29.03 02:01:47, skipping insertion in model container 19.17/8.83 [2019-03-29 02:01:47,404 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 29.03 02:01:47" (4/4) ... 19.17/8.83 [2019-03-29 02:01:47,405 INFO L112 eAbstractionObserver]: Analyzing ICFG theBenchmark.c_BEv2 19.17/8.83 [2019-03-29 02:01:47,415 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION 19.17/8.83 [2019-03-29 02:01:47,423 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 0 error locations. 19.17/8.83 [2019-03-29 02:01:47,441 INFO L257 AbstractCegarLoop]: Starting to check reachability of 0 error locations. 19.17/8.83 [2019-03-29 02:01:47,469 INFO L133 ementStrategyFactory]: Using default assertion order modulation 19.17/8.83 [2019-03-29 02:01:47,470 INFO L382 AbstractCegarLoop]: Interprodecural is true 19.17/8.83 [2019-03-29 02:01:47,470 INFO L383 AbstractCegarLoop]: Hoare is true 19.17/8.83 [2019-03-29 02:01:47,471 INFO L384 AbstractCegarLoop]: Compute interpolants for ForwardPredicates 19.17/8.83 [2019-03-29 02:01:47,471 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE 19.17/8.83 [2019-03-29 02:01:47,471 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION 19.17/8.83 [2019-03-29 02:01:47,471 INFO L387 AbstractCegarLoop]: Difference is false 19.17/8.83 [2019-03-29 02:01:47,471 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA 19.17/8.83 [2019-03-29 02:01:47,471 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== 19.17/8.83 [2019-03-29 02:01:47,486 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states. 19.17/8.83 [2019-03-29 02:01:47,492 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. 19.17/8.83 [2019-03-29 02:01:47,495 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 11 states. 19.17/8.83 [2019-03-29 02:01:47,499 INFO L448 ceAbstractionStarter]: For program point L34-1(lines 13 69) no Hoare annotation was computed. 19.17/8.83 [2019-03-29 02:01:47,500 INFO L448 ceAbstractionStarter]: For program point L64-1(lines 13 69) no Hoare annotation was computed. 19.17/8.83 [2019-03-29 02:01:47,500 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. 19.17/8.83 [2019-03-29 02:01:47,500 INFO L448 ceAbstractionStarter]: For program point L29-1(lines 13 69) no Hoare annotation was computed. 19.17/8.83 [2019-03-29 02:01:47,500 INFO L448 ceAbstractionStarter]: For program point L24-1(lines 13 69) no Hoare annotation was computed. 19.17/8.83 [2019-03-29 02:01:47,501 INFO L448 ceAbstractionStarter]: For program point L54-1(lines 13 69) no Hoare annotation was computed. 19.17/8.83 [2019-03-29 02:01:47,501 INFO L448 ceAbstractionStarter]: For program point L19(lines 19 23) no Hoare annotation was computed. 19.17/8.83 [2019-03-29 02:01:47,501 INFO L448 ceAbstractionStarter]: For program point L19-2(lines 13 69) no Hoare annotation was computed. 19.17/8.83 [2019-03-29 02:01:47,501 INFO L448 ceAbstractionStarter]: For program point L49-1(lines 13 69) no Hoare annotation was computed. 19.17/8.83 [2019-03-29 02:01:47,501 INFO L448 ceAbstractionStarter]: For program point L44-1(lines 13 69) no Hoare annotation was computed. 19.17/8.83 [2019-03-29 02:01:47,501 INFO L448 ceAbstractionStarter]: For program point L39-1(lines 13 69) no Hoare annotation was computed. 19.17/8.83 [2019-03-29 02:01:47,504 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 29.03 02:01:47 BasicIcfg 19.17/8.83 [2019-03-29 02:01:47,505 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- 19.17/8.83 [2019-03-29 02:01:47,505 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- 19.17/8.83 [2019-03-29 02:01:47,505 INFO L271 PluginConnector]: Initializing BuchiAutomizer... 19.17/8.83 [2019-03-29 02:01:47,509 INFO L276 PluginConnector]: BuchiAutomizer initialized 19.17/8.83 [2019-03-29 02:01:47,510 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis 19.17/8.83 [2019-03-29 02:01:47,510 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 29.03 02:01:46" (1/5) ... 19.17/8.83 [2019-03-29 02:01:47,511 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@76285597 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 29.03 02:01:47, skipping insertion in model container 19.17/8.83 [2019-03-29 02:01:47,511 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis 19.17/8.83 [2019-03-29 02:01:47,511 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.03 02:01:46" (2/5) ... 19.17/8.83 [2019-03-29 02:01:47,512 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@76285597 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 29.03 02:01:47, skipping insertion in model container 19.17/8.83 [2019-03-29 02:01:47,512 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis 19.17/8.83 [2019-03-29 02:01:47,512 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.03 02:01:47" (3/5) ... 19.17/8.83 [2019-03-29 02:01:47,512 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@76285597 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 29.03 02:01:47, skipping insertion in model container 19.17/8.83 [2019-03-29 02:01:47,512 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis 19.17/8.83 [2019-03-29 02:01:47,512 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 29.03 02:01:47" (4/5) ... 19.17/8.83 [2019-03-29 02:01:47,513 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@76285597 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 29.03 02:01:47, skipping insertion in model container 19.17/8.83 [2019-03-29 02:01:47,513 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis 19.17/8.83 [2019-03-29 02:01:47,513 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 29.03 02:01:47" (5/5) ... 19.17/8.83 [2019-03-29 02:01:47,515 INFO L375 chiAutomizerObserver]: Analyzing ICFG theBenchmark.c_BEv2 19.17/8.83 [2019-03-29 02:01:47,544 INFO L133 ementStrategyFactory]: Using default assertion order modulation 19.17/8.83 [2019-03-29 02:01:47,545 INFO L374 BuchiCegarLoop]: Interprodecural is true 19.17/8.83 [2019-03-29 02:01:47,545 INFO L375 BuchiCegarLoop]: Hoare is true 19.17/8.83 [2019-03-29 02:01:47,545 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates 19.17/8.83 [2019-03-29 02:01:47,545 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE 19.17/8.83 [2019-03-29 02:01:47,545 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION 19.17/8.83 [2019-03-29 02:01:47,546 INFO L379 BuchiCegarLoop]: Difference is false 19.17/8.83 [2019-03-29 02:01:47,546 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA 19.17/8.83 [2019-03-29 02:01:47,546 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== 19.17/8.83 [2019-03-29 02:01:47,550 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 11 states. 19.17/8.83 [2019-03-29 02:01:47,569 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 19.17/8.83 [2019-03-29 02:01:47,570 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 19.17/8.83 [2019-03-29 02:01:47,570 INFO L119 BuchiIsEmpty]: Starting construction of run 19.17/8.83 [2019-03-29 02:01:47,576 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] 19.17/8.83 [2019-03-29 02:01:47,576 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1] 19.17/8.83 [2019-03-29 02:01:47,576 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ 19.17/8.83 [2019-03-29 02:01:47,577 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 11 states. 19.17/8.83 [2019-03-29 02:01:47,578 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 19.17/8.83 [2019-03-29 02:01:47,578 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 19.17/8.83 [2019-03-29 02:01:47,578 INFO L119 BuchiIsEmpty]: Starting construction of run 19.17/8.83 [2019-03-29 02:01:47,579 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] 19.17/8.83 [2019-03-29 02:01:47,579 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1] 19.17/8.83 [2019-03-29 02:01:47,585 INFO L794 eck$LassoCheckResult]: Stem: 5#ULTIMATE.startENTRYtrue [87] ULTIMATE.startENTRY-->L19: Formula: (and (= v_ULTIMATE.start_main_~y~0_1 |v_ULTIMATE.start_main_#t~nondet0_4|) (= v_ULTIMATE.start_main_~z~0_1 |v_ULTIMATE.start_main_#t~nondet1_4|)) InVars {} OutVars{ULTIMATE.start_main_#t~nondet0=|v_ULTIMATE.start_main_#t~nondet0_1|, ULTIMATE.start_main_#t~nondet1=|v_ULTIMATE.start_main_#t~nondet1_1|, ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_1|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_1|, ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_1, ULTIMATE.start_main_~z~0=v_ULTIMATE.start_main_~z~0_1, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_1} AuxVars[|v_ULTIMATE.start_main_#t~nondet1_4|, |v_ULTIMATE.start_main_#t~nondet0_4|] AssignedVars[ULTIMATE.start_main_#t~nondet0, ULTIMATE.start_main_#t~nondet1, ULTIMATE.start_main_#t~nondet2, ULTIMATE.start_main_#res, ULTIMATE.start_main_~y~0, ULTIMATE.start_main_~z~0, ULTIMATE.start_main_~x~0] 13#L19true [107] L19-->L19-2: Formula: (and (< 0 |v_ULTIMATE.start_main_#t~nondet2_3|) (= v_ULTIMATE.start_main_~x~0_4 1)) InVars {ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_3|} OutVars{ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_4, ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet2, ULTIMATE.start_main_~x~0] 9#L19-2true [75] L19-2-->L24-1: Formula: (and (< 0 v_ULTIMATE.start_main_~x~0_7) (= v_ULTIMATE.start_main_~x~0_6 (+ v_ULTIMATE.start_main_~x~0_7 1))) InVars {ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_7} OutVars{ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_6} AuxVars[] AssignedVars[ULTIMATE.start_main_~x~0] 12#L24-1true [92] L24-1-->L29-1: Formula: (and (< 0 v_ULTIMATE.start_main_~x~0_11) (= v_ULTIMATE.start_main_~x~0_10 (+ v_ULTIMATE.start_main_~x~0_11 1))) InVars {ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_11} OutVars{ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_10} AuxVars[] AssignedVars[ULTIMATE.start_main_~x~0] 11#L29-1true [77] L29-1-->L34-1: Formula: (and (= v_ULTIMATE.start_main_~x~0_14 (+ v_ULTIMATE.start_main_~x~0_15 1)) (< 0 v_ULTIMATE.start_main_~x~0_15)) InVars {ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_15} OutVars{ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_14} AuxVars[] AssignedVars[ULTIMATE.start_main_~x~0] 10#L34-1true [90] L34-1-->L39-1: Formula: (and (< 0 v_ULTIMATE.start_main_~x~0_19) (= v_ULTIMATE.start_main_~x~0_18 (+ v_ULTIMATE.start_main_~x~0_19 1))) InVars {ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_19} OutVars{ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_18} AuxVars[] AssignedVars[ULTIMATE.start_main_~x~0] 8#L39-1true [73] L39-1-->L44-1: Formula: (and (< 0 v_ULTIMATE.start_main_~x~0_23) (= v_ULTIMATE.start_main_~x~0_22 (+ v_ULTIMATE.start_main_~x~0_23 1))) InVars {ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_23} OutVars{ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_22} AuxVars[] AssignedVars[ULTIMATE.start_main_~x~0] 7#L44-1true [88] L44-1-->L49-1: Formula: (and (< 0 v_ULTIMATE.start_main_~x~0_27) (= v_ULTIMATE.start_main_~x~0_26 (+ v_ULTIMATE.start_main_~x~0_27 1))) InVars {ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_27} OutVars{ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_26} AuxVars[] AssignedVars[ULTIMATE.start_main_~x~0] 6#L49-1true [103] L49-1-->L54-1: Formula: (and (>= 0 v_ULTIMATE.start_main_~x~0_33) (= v_ULTIMATE.start_main_~x~0_32 (+ v_ULTIMATE.start_main_~x~0_33 (- 1)))) InVars {ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_33} OutVars{ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_32} AuxVars[] AssignedVars[ULTIMATE.start_main_~x~0] 4#L54-1true [104] L54-1-->L64-1: Formula: (and (>= 0 v_ULTIMATE.start_main_~x~0_37) (= v_ULTIMATE.start_main_~x~0_36 (+ v_ULTIMATE.start_main_~x~0_37 (- 1)))) InVars {ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_37} OutVars{ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_36} AuxVars[] AssignedVars[ULTIMATE.start_main_~x~0] 3#L64-1true 19.17/8.83 [2019-03-29 02:01:47,586 INFO L796 eck$LassoCheckResult]: Loop: 3#L64-1true [84] L64-1-->L64-1: Formula: (and (< v_ULTIMATE.start_main_~y~0_8 100) (= v_ULTIMATE.start_main_~z~0_7 (+ v_ULTIMATE.start_main_~z~0_8 (* (- 1) v_ULTIMATE.start_main_~x~0_38))) (= v_ULTIMATE.start_main_~y~0_7 (+ v_ULTIMATE.start_main_~x~0_38 v_ULTIMATE.start_main_~y~0_8)) (< v_ULTIMATE.start_main_~z~0_8 100)) InVars {ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_8, ULTIMATE.start_main_~z~0=v_ULTIMATE.start_main_~z~0_8, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_38} OutVars{ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_7, ULTIMATE.start_main_~z~0=v_ULTIMATE.start_main_~z~0_7, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_38} AuxVars[] AssignedVars[ULTIMATE.start_main_~y~0, ULTIMATE.start_main_~z~0] 3#L64-1true 19.17/8.83 [2019-03-29 02:01:47,592 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 19.17/8.83 [2019-03-29 02:01:47,592 INFO L82 PathProgramCache]: Analyzing trace with hash -1935283229, now seen corresponding path program 1 times 19.17/8.83 [2019-03-29 02:01:47,594 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 19.17/8.83 [2019-03-29 02:01:47,595 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 19.17/8.83 [2019-03-29 02:01:47,655 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 19.17/8.83 [2019-03-29 02:01:47,655 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 19.17/8.83 [2019-03-29 02:01:47,655 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 19.17/8.83 [2019-03-29 02:01:47,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 19.17/8.83 [2019-03-29 02:01:47,754 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 19.17/8.83 [2019-03-29 02:01:47,757 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 19.17/8.83 [2019-03-29 02:01:47,757 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 19.17/8.83 [2019-03-29 02:01:47,762 INFO L799 eck$LassoCheckResult]: stem already infeasible 19.17/8.83 [2019-03-29 02:01:47,762 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 19.17/8.83 [2019-03-29 02:01:47,762 INFO L82 PathProgramCache]: Analyzing trace with hash 115, now seen corresponding path program 1 times 19.17/8.83 [2019-03-29 02:01:47,762 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 19.17/8.83 [2019-03-29 02:01:47,762 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 19.17/8.83 [2019-03-29 02:01:47,764 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 19.17/8.83 [2019-03-29 02:01:47,764 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 19.17/8.83 [2019-03-29 02:01:47,764 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 19.17/8.83 [2019-03-29 02:01:47,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 19.17/8.83 [2019-03-29 02:01:47,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 19.17/8.83 [2019-03-29 02:01:47,848 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. 19.17/8.83 [2019-03-29 02:01:47,848 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 19.17/8.83 [2019-03-29 02:01:47,867 INFO L87 Difference]: Start difference. First operand 11 states. Second operand 3 states. 19.17/8.83 [2019-03-29 02:01:47,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 19.17/8.83 [2019-03-29 02:01:47,953 INFO L93 Difference]: Finished difference Result 19 states and 29 transitions. 19.17/8.83 [2019-03-29 02:01:47,953 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 19.17/8.83 [2019-03-29 02:01:47,957 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 19 states and 29 transitions. 19.17/8.83 [2019-03-29 02:01:47,959 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 2 19.17/8.83 [2019-03-29 02:01:47,963 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 19 states to 19 states and 29 transitions. 19.17/8.83 [2019-03-29 02:01:47,965 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 19 19.17/8.83 [2019-03-29 02:01:47,965 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 19 19.17/8.83 [2019-03-29 02:01:47,966 INFO L73 IsDeterministic]: Start isDeterministic. Operand 19 states and 29 transitions. 19.17/8.83 [2019-03-29 02:01:47,966 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. 19.17/8.83 [2019-03-29 02:01:47,966 INFO L706 BuchiCegarLoop]: Abstraction has 19 states and 29 transitions. 19.17/8.83 [2019-03-29 02:01:47,984 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states and 29 transitions. 19.17/8.83 [2019-03-29 02:01:47,994 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 18. 19.17/8.83 [2019-03-29 02:01:47,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. 19.17/8.83 [2019-03-29 02:01:47,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 28 transitions. 19.17/8.83 [2019-03-29 02:01:47,997 INFO L729 BuchiCegarLoop]: Abstraction has 18 states and 28 transitions. 19.17/8.83 [2019-03-29 02:01:47,997 INFO L609 BuchiCegarLoop]: Abstraction has 18 states and 28 transitions. 19.17/8.83 [2019-03-29 02:01:47,997 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ 19.17/8.83 [2019-03-29 02:01:47,997 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states and 28 transitions. 19.17/8.83 [2019-03-29 02:01:47,998 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 19.17/8.83 [2019-03-29 02:01:47,998 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 19.17/8.83 [2019-03-29 02:01:47,998 INFO L119 BuchiIsEmpty]: Starting construction of run 19.17/8.83 [2019-03-29 02:01:48,000 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] 19.17/8.83 [2019-03-29 02:01:48,000 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1] 19.17/8.83 [2019-03-29 02:01:48,001 INFO L794 eck$LassoCheckResult]: Stem: 42#ULTIMATE.startENTRY [87] ULTIMATE.startENTRY-->L19: Formula: (and (= v_ULTIMATE.start_main_~y~0_1 |v_ULTIMATE.start_main_#t~nondet0_4|) (= v_ULTIMATE.start_main_~z~0_1 |v_ULTIMATE.start_main_#t~nondet1_4|)) InVars {} OutVars{ULTIMATE.start_main_#t~nondet0=|v_ULTIMATE.start_main_#t~nondet0_1|, ULTIMATE.start_main_#t~nondet1=|v_ULTIMATE.start_main_#t~nondet1_1|, ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_1|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_1|, ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_1, ULTIMATE.start_main_~z~0=v_ULTIMATE.start_main_~z~0_1, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_1} AuxVars[|v_ULTIMATE.start_main_#t~nondet1_4|, |v_ULTIMATE.start_main_#t~nondet0_4|] AssignedVars[ULTIMATE.start_main_#t~nondet0, ULTIMATE.start_main_#t~nondet1, ULTIMATE.start_main_#t~nondet2, ULTIMATE.start_main_#res, ULTIMATE.start_main_~y~0, ULTIMATE.start_main_~z~0, ULTIMATE.start_main_~x~0] 43#L19 [107] L19-->L19-2: Formula: (and (< 0 |v_ULTIMATE.start_main_#t~nondet2_3|) (= v_ULTIMATE.start_main_~x~0_4 1)) InVars {ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_3|} OutVars{ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_4, ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet2, ULTIMATE.start_main_~x~0] 46#L19-2 [97] L19-2-->L24-1: Formula: (and (>= 0 v_ULTIMATE.start_main_~x~0_9) (= v_ULTIMATE.start_main_~x~0_8 (+ v_ULTIMATE.start_main_~x~0_9 (- 1)))) InVars {ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_9} OutVars{ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_8} AuxVars[] AssignedVars[ULTIMATE.start_main_~x~0] 47#L24-1 [98] L24-1-->L29-1: Formula: (and (= v_ULTIMATE.start_main_~x~0_12 (+ v_ULTIMATE.start_main_~x~0_13 (- 1))) (>= 0 v_ULTIMATE.start_main_~x~0_13)) InVars {ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_13} OutVars{ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_12} AuxVars[] AssignedVars[ULTIMATE.start_main_~x~0] 51#L29-1 [99] L29-1-->L34-1: Formula: (and (= v_ULTIMATE.start_main_~x~0_16 (+ v_ULTIMATE.start_main_~x~0_17 (- 1))) (>= 0 v_ULTIMATE.start_main_~x~0_17)) InVars {ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_17} OutVars{ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_16} AuxVars[] AssignedVars[ULTIMATE.start_main_~x~0] 56#L34-1 [100] L34-1-->L39-1: Formula: (and (>= 0 v_ULTIMATE.start_main_~x~0_21) (= v_ULTIMATE.start_main_~x~0_20 (+ v_ULTIMATE.start_main_~x~0_21 (- 1)))) InVars {ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_21} OutVars{ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_20} AuxVars[] AssignedVars[ULTIMATE.start_main_~x~0] 54#L39-1 [101] L39-1-->L44-1: Formula: (and (>= 0 v_ULTIMATE.start_main_~x~0_25) (= v_ULTIMATE.start_main_~x~0_24 (+ v_ULTIMATE.start_main_~x~0_25 (- 1)))) InVars {ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_25} OutVars{ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_24} AuxVars[] AssignedVars[ULTIMATE.start_main_~x~0] 52#L44-1 [102] L44-1-->L49-1: Formula: (and (= v_ULTIMATE.start_main_~x~0_28 (+ v_ULTIMATE.start_main_~x~0_29 (- 1))) (>= 0 v_ULTIMATE.start_main_~x~0_29)) InVars {ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_29} OutVars{ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_28} AuxVars[] AssignedVars[ULTIMATE.start_main_~x~0] 53#L49-1 [71] L49-1-->L54-1: Formula: (and (= v_ULTIMATE.start_main_~x~0_30 (+ v_ULTIMATE.start_main_~x~0_31 1)) (< 0 v_ULTIMATE.start_main_~x~0_31)) InVars {ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_31} OutVars{ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_30} AuxVars[] AssignedVars[ULTIMATE.start_main_~x~0] 40#L54-1 [85] L54-1-->L64-1: Formula: (and (< 0 v_ULTIMATE.start_main_~x~0_35) (= v_ULTIMATE.start_main_~x~0_34 (+ v_ULTIMATE.start_main_~x~0_35 1))) InVars {ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_35} OutVars{ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_34} AuxVars[] AssignedVars[ULTIMATE.start_main_~x~0] 39#L64-1 19.17/8.83 [2019-03-29 02:01:48,002 INFO L796 eck$LassoCheckResult]: Loop: 39#L64-1 [84] L64-1-->L64-1: Formula: (and (< v_ULTIMATE.start_main_~y~0_8 100) (= v_ULTIMATE.start_main_~z~0_7 (+ v_ULTIMATE.start_main_~z~0_8 (* (- 1) v_ULTIMATE.start_main_~x~0_38))) (= v_ULTIMATE.start_main_~y~0_7 (+ v_ULTIMATE.start_main_~x~0_38 v_ULTIMATE.start_main_~y~0_8)) (< v_ULTIMATE.start_main_~z~0_8 100)) InVars {ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_8, ULTIMATE.start_main_~z~0=v_ULTIMATE.start_main_~z~0_8, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_38} OutVars{ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_7, ULTIMATE.start_main_~z~0=v_ULTIMATE.start_main_~z~0_7, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_38} AuxVars[] AssignedVars[ULTIMATE.start_main_~y~0, ULTIMATE.start_main_~z~0] 39#L64-1 19.17/8.83 [2019-03-29 02:01:48,002 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 19.17/8.83 [2019-03-29 02:01:48,002 INFO L82 PathProgramCache]: Analyzing trace with hash -578183610, now seen corresponding path program 1 times 19.17/8.83 [2019-03-29 02:01:48,002 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 19.17/8.83 [2019-03-29 02:01:48,002 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 19.17/8.83 [2019-03-29 02:01:48,004 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 19.17/8.83 [2019-03-29 02:01:48,004 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 19.17/8.83 [2019-03-29 02:01:48,004 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 19.17/8.83 [2019-03-29 02:01:48,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 19.17/8.83 [2019-03-29 02:01:48,029 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 19.17/8.83 [2019-03-29 02:01:48,029 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 19.17/8.83 [2019-03-29 02:01:48,029 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 19.17/8.83 [2019-03-29 02:01:48,029 INFO L799 eck$LassoCheckResult]: stem already infeasible 19.17/8.83 [2019-03-29 02:01:48,030 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 19.17/8.83 [2019-03-29 02:01:48,030 INFO L82 PathProgramCache]: Analyzing trace with hash 115, now seen corresponding path program 2 times 19.17/8.83 [2019-03-29 02:01:48,030 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 19.17/8.83 [2019-03-29 02:01:48,030 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 19.17/8.83 [2019-03-29 02:01:48,032 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 19.17/8.83 [2019-03-29 02:01:48,032 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 19.17/8.83 [2019-03-29 02:01:48,032 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 19.17/8.83 [2019-03-29 02:01:48,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 19.17/8.83 [2019-03-29 02:01:48,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 19.17/8.83 [2019-03-29 02:01:48,073 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. 19.17/8.83 [2019-03-29 02:01:48,074 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 19.17/8.83 [2019-03-29 02:01:48,074 INFO L87 Difference]: Start difference. First operand 18 states and 28 transitions. cyclomatic complexity: 11 Second operand 3 states. 19.17/8.83 [2019-03-29 02:01:48,150 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 19.17/8.83 [2019-03-29 02:01:48,150 INFO L93 Difference]: Finished difference Result 20 states and 30 transitions. 19.17/8.83 [2019-03-29 02:01:48,151 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 19.17/8.83 [2019-03-29 02:01:48,152 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 20 states and 30 transitions. 19.17/8.83 [2019-03-29 02:01:48,153 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 2 19.17/8.83 [2019-03-29 02:01:48,154 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 20 states to 20 states and 30 transitions. 19.17/8.83 [2019-03-29 02:01:48,154 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 20 19.17/8.83 [2019-03-29 02:01:48,154 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 20 19.17/8.83 [2019-03-29 02:01:48,154 INFO L73 IsDeterministic]: Start isDeterministic. Operand 20 states and 30 transitions. 19.17/8.83 [2019-03-29 02:01:48,155 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. 19.17/8.83 [2019-03-29 02:01:48,155 INFO L706 BuchiCegarLoop]: Abstraction has 20 states and 30 transitions. 19.17/8.83 [2019-03-29 02:01:48,155 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states and 30 transitions. 19.17/8.83 [2019-03-29 02:01:48,157 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 19. 19.17/8.83 [2019-03-29 02:01:48,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. 19.17/8.83 [2019-03-29 02:01:48,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 29 transitions. 19.17/8.83 [2019-03-29 02:01:48,158 INFO L729 BuchiCegarLoop]: Abstraction has 19 states and 29 transitions. 19.17/8.83 [2019-03-29 02:01:48,158 INFO L609 BuchiCegarLoop]: Abstraction has 19 states and 29 transitions. 19.17/8.83 [2019-03-29 02:01:48,158 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ 19.17/8.83 [2019-03-29 02:01:48,158 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 19 states and 29 transitions. 19.17/8.83 [2019-03-29 02:01:48,159 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 19.17/8.83 [2019-03-29 02:01:48,159 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 19.17/8.83 [2019-03-29 02:01:48,159 INFO L119 BuchiIsEmpty]: Starting construction of run 19.17/8.83 [2019-03-29 02:01:48,160 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] 19.17/8.83 [2019-03-29 02:01:48,160 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1] 19.17/8.83 [2019-03-29 02:01:48,161 INFO L794 eck$LassoCheckResult]: Stem: 86#ULTIMATE.startENTRY [87] ULTIMATE.startENTRY-->L19: Formula: (and (= v_ULTIMATE.start_main_~y~0_1 |v_ULTIMATE.start_main_#t~nondet0_4|) (= v_ULTIMATE.start_main_~z~0_1 |v_ULTIMATE.start_main_#t~nondet1_4|)) InVars {} OutVars{ULTIMATE.start_main_#t~nondet0=|v_ULTIMATE.start_main_#t~nondet0_1|, ULTIMATE.start_main_#t~nondet1=|v_ULTIMATE.start_main_#t~nondet1_1|, ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_1|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_1|, ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_1, ULTIMATE.start_main_~z~0=v_ULTIMATE.start_main_~z~0_1, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_1} AuxVars[|v_ULTIMATE.start_main_#t~nondet1_4|, |v_ULTIMATE.start_main_#t~nondet0_4|] AssignedVars[ULTIMATE.start_main_#t~nondet0, ULTIMATE.start_main_#t~nondet1, ULTIMATE.start_main_#t~nondet2, ULTIMATE.start_main_#res, ULTIMATE.start_main_~y~0, ULTIMATE.start_main_~z~0, ULTIMATE.start_main_~x~0] 87#L19 [80] L19-->L19-2: Formula: (and (= v_ULTIMATE.start_main_~x~0_5 (- 1)) (= 0 |v_ULTIMATE.start_main_#t~nondet2_5|)) InVars {ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_5|} OutVars{ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_5, ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet2, ULTIMATE.start_main_~x~0] 94#L19-2 [97] L19-2-->L24-1: Formula: (and (>= 0 v_ULTIMATE.start_main_~x~0_9) (= v_ULTIMATE.start_main_~x~0_8 (+ v_ULTIMATE.start_main_~x~0_9 (- 1)))) InVars {ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_9} OutVars{ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_8} AuxVars[] AssignedVars[ULTIMATE.start_main_~x~0] 95#L24-1 [98] L24-1-->L29-1: Formula: (and (= v_ULTIMATE.start_main_~x~0_12 (+ v_ULTIMATE.start_main_~x~0_13 (- 1))) (>= 0 v_ULTIMATE.start_main_~x~0_13)) InVars {ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_13} OutVars{ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_12} AuxVars[] AssignedVars[ULTIMATE.start_main_~x~0] 101#L29-1 [99] L29-1-->L34-1: Formula: (and (= v_ULTIMATE.start_main_~x~0_16 (+ v_ULTIMATE.start_main_~x~0_17 (- 1))) (>= 0 v_ULTIMATE.start_main_~x~0_17)) InVars {ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_17} OutVars{ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_16} AuxVars[] AssignedVars[ULTIMATE.start_main_~x~0] 100#L34-1 [100] L34-1-->L39-1: Formula: (and (>= 0 v_ULTIMATE.start_main_~x~0_21) (= v_ULTIMATE.start_main_~x~0_20 (+ v_ULTIMATE.start_main_~x~0_21 (- 1)))) InVars {ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_21} OutVars{ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_20} AuxVars[] AssignedVars[ULTIMATE.start_main_~x~0] 99#L39-1 [101] L39-1-->L44-1: Formula: (and (>= 0 v_ULTIMATE.start_main_~x~0_25) (= v_ULTIMATE.start_main_~x~0_24 (+ v_ULTIMATE.start_main_~x~0_25 (- 1)))) InVars {ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_25} OutVars{ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_24} AuxVars[] AssignedVars[ULTIMATE.start_main_~x~0] 98#L44-1 [102] L44-1-->L49-1: Formula: (and (= v_ULTIMATE.start_main_~x~0_28 (+ v_ULTIMATE.start_main_~x~0_29 (- 1))) (>= 0 v_ULTIMATE.start_main_~x~0_29)) InVars {ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_29} OutVars{ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_28} AuxVars[] AssignedVars[ULTIMATE.start_main_~x~0] 96#L49-1 [71] L49-1-->L54-1: Formula: (and (= v_ULTIMATE.start_main_~x~0_30 (+ v_ULTIMATE.start_main_~x~0_31 1)) (< 0 v_ULTIMATE.start_main_~x~0_31)) InVars {ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_31} OutVars{ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_30} AuxVars[] AssignedVars[ULTIMATE.start_main_~x~0] 84#L54-1 [85] L54-1-->L64-1: Formula: (and (< 0 v_ULTIMATE.start_main_~x~0_35) (= v_ULTIMATE.start_main_~x~0_34 (+ v_ULTIMATE.start_main_~x~0_35 1))) InVars {ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_35} OutVars{ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_34} AuxVars[] AssignedVars[ULTIMATE.start_main_~x~0] 83#L64-1 19.17/8.83 [2019-03-29 02:01:48,161 INFO L796 eck$LassoCheckResult]: Loop: 83#L64-1 [84] L64-1-->L64-1: Formula: (and (< v_ULTIMATE.start_main_~y~0_8 100) (= v_ULTIMATE.start_main_~z~0_7 (+ v_ULTIMATE.start_main_~z~0_8 (* (- 1) v_ULTIMATE.start_main_~x~0_38))) (= v_ULTIMATE.start_main_~y~0_7 (+ v_ULTIMATE.start_main_~x~0_38 v_ULTIMATE.start_main_~y~0_8)) (< v_ULTIMATE.start_main_~z~0_8 100)) InVars {ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_8, ULTIMATE.start_main_~z~0=v_ULTIMATE.start_main_~z~0_8, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_38} OutVars{ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_7, ULTIMATE.start_main_~z~0=v_ULTIMATE.start_main_~z~0_7, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_38} AuxVars[] AssignedVars[ULTIMATE.start_main_~y~0, ULTIMATE.start_main_~z~0] 83#L64-1 19.17/8.83 [2019-03-29 02:01:48,161 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 19.17/8.83 [2019-03-29 02:01:48,161 INFO L82 PathProgramCache]: Analyzing trace with hash 978446635, now seen corresponding path program 1 times 19.17/8.83 [2019-03-29 02:01:48,162 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 19.17/8.83 [2019-03-29 02:01:48,162 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 19.17/8.83 [2019-03-29 02:01:48,163 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 19.17/8.83 [2019-03-29 02:01:48,163 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY 19.17/8.83 [2019-03-29 02:01:48,163 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 19.17/8.83 [2019-03-29 02:01:48,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 19.17/8.83 [2019-03-29 02:01:48,186 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 19.17/8.83 [2019-03-29 02:01:48,186 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 19.17/8.83 [2019-03-29 02:01:48,187 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 19.17/8.83 [2019-03-29 02:01:48,187 INFO L799 eck$LassoCheckResult]: stem already infeasible 19.17/8.83 [2019-03-29 02:01:48,187 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 19.17/8.83 [2019-03-29 02:01:48,187 INFO L82 PathProgramCache]: Analyzing trace with hash 115, now seen corresponding path program 3 times 19.17/8.83 [2019-03-29 02:01:48,188 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 19.17/8.83 [2019-03-29 02:01:48,188 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 19.17/8.83 [2019-03-29 02:01:48,189 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 19.17/8.83 [2019-03-29 02:01:48,189 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 19.17/8.83 [2019-03-29 02:01:48,190 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 19.17/8.83 [2019-03-29 02:01:48,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 19.17/8.83 [2019-03-29 02:01:48,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 19.17/8.83 [2019-03-29 02:01:48,218 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. 19.17/8.83 [2019-03-29 02:01:48,218 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 19.17/8.83 [2019-03-29 02:01:48,218 INFO L87 Difference]: Start difference. First operand 19 states and 29 transitions. cyclomatic complexity: 11 Second operand 3 states. 19.17/8.83 [2019-03-29 02:01:48,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 19.17/8.83 [2019-03-29 02:01:48,276 INFO L93 Difference]: Finished difference Result 20 states and 22 transitions. 19.17/8.83 [2019-03-29 02:01:48,276 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 19.17/8.83 [2019-03-29 02:01:48,277 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 20 states and 22 transitions. 19.17/8.83 [2019-03-29 02:01:48,278 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 2 19.17/8.83 [2019-03-29 02:01:48,279 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 20 states to 20 states and 22 transitions. 19.17/8.83 [2019-03-29 02:01:48,279 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 20 19.17/8.83 [2019-03-29 02:01:48,279 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 20 19.17/8.83 [2019-03-29 02:01:48,279 INFO L73 IsDeterministic]: Start isDeterministic. Operand 20 states and 22 transitions. 19.17/8.83 [2019-03-29 02:01:48,279 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. 19.17/8.83 [2019-03-29 02:01:48,280 INFO L706 BuchiCegarLoop]: Abstraction has 20 states and 22 transitions. 19.17/8.83 [2019-03-29 02:01:48,280 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states and 22 transitions. 19.17/8.83 [2019-03-29 02:01:48,281 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 19. 19.17/8.83 [2019-03-29 02:01:48,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. 19.17/8.83 [2019-03-29 02:01:48,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 21 transitions. 19.17/8.83 [2019-03-29 02:01:48,282 INFO L729 BuchiCegarLoop]: Abstraction has 19 states and 21 transitions. 19.17/8.83 [2019-03-29 02:01:48,282 INFO L609 BuchiCegarLoop]: Abstraction has 19 states and 21 transitions. 19.17/8.83 [2019-03-29 02:01:48,282 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ 19.17/8.83 [2019-03-29 02:01:48,282 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 19 states and 21 transitions. 19.17/8.83 [2019-03-29 02:01:48,283 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 19.17/8.83 [2019-03-29 02:01:48,284 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 19.17/8.83 [2019-03-29 02:01:48,284 INFO L119 BuchiIsEmpty]: Starting construction of run 19.17/8.83 [2019-03-29 02:01:48,284 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] 19.17/8.83 [2019-03-29 02:01:48,284 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1] 19.17/8.83 [2019-03-29 02:01:48,285 INFO L794 eck$LassoCheckResult]: Stem: 130#ULTIMATE.startENTRY [87] ULTIMATE.startENTRY-->L19: Formula: (and (= v_ULTIMATE.start_main_~y~0_1 |v_ULTIMATE.start_main_#t~nondet0_4|) (= v_ULTIMATE.start_main_~z~0_1 |v_ULTIMATE.start_main_#t~nondet1_4|)) InVars {} OutVars{ULTIMATE.start_main_#t~nondet0=|v_ULTIMATE.start_main_#t~nondet0_1|, ULTIMATE.start_main_#t~nondet1=|v_ULTIMATE.start_main_#t~nondet1_1|, ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_1|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_1|, ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_1, ULTIMATE.start_main_~z~0=v_ULTIMATE.start_main_~z~0_1, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_1} AuxVars[|v_ULTIMATE.start_main_#t~nondet1_4|, |v_ULTIMATE.start_main_#t~nondet0_4|] AssignedVars[ULTIMATE.start_main_#t~nondet0, ULTIMATE.start_main_#t~nondet1, ULTIMATE.start_main_#t~nondet2, ULTIMATE.start_main_#res, ULTIMATE.start_main_~y~0, ULTIMATE.start_main_~z~0, ULTIMATE.start_main_~x~0] 131#L19 [80] L19-->L19-2: Formula: (and (= v_ULTIMATE.start_main_~x~0_5 (- 1)) (= 0 |v_ULTIMATE.start_main_#t~nondet2_5|)) InVars {ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_5|} OutVars{ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_5, ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet2, ULTIMATE.start_main_~x~0] 140#L19-2 [97] L19-2-->L24-1: Formula: (and (>= 0 v_ULTIMATE.start_main_~x~0_9) (= v_ULTIMATE.start_main_~x~0_8 (+ v_ULTIMATE.start_main_~x~0_9 (- 1)))) InVars {ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_9} OutVars{ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_8} AuxVars[] AssignedVars[ULTIMATE.start_main_~x~0] 141#L24-1 [98] L24-1-->L29-1: Formula: (and (= v_ULTIMATE.start_main_~x~0_12 (+ v_ULTIMATE.start_main_~x~0_13 (- 1))) (>= 0 v_ULTIMATE.start_main_~x~0_13)) InVars {ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_13} OutVars{ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_12} AuxVars[] AssignedVars[ULTIMATE.start_main_~x~0] 144#L29-1 [99] L29-1-->L34-1: Formula: (and (= v_ULTIMATE.start_main_~x~0_16 (+ v_ULTIMATE.start_main_~x~0_17 (- 1))) (>= 0 v_ULTIMATE.start_main_~x~0_17)) InVars {ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_17} OutVars{ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_16} AuxVars[] AssignedVars[ULTIMATE.start_main_~x~0] 145#L34-1 [100] L34-1-->L39-1: Formula: (and (>= 0 v_ULTIMATE.start_main_~x~0_21) (= v_ULTIMATE.start_main_~x~0_20 (+ v_ULTIMATE.start_main_~x~0_21 (- 1)))) InVars {ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_21} OutVars{ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_20} AuxVars[] AssignedVars[ULTIMATE.start_main_~x~0] 146#L39-1 [101] L39-1-->L44-1: Formula: (and (>= 0 v_ULTIMATE.start_main_~x~0_25) (= v_ULTIMATE.start_main_~x~0_24 (+ v_ULTIMATE.start_main_~x~0_25 (- 1)))) InVars {ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_25} OutVars{ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_24} AuxVars[] AssignedVars[ULTIMATE.start_main_~x~0] 142#L44-1 [102] L44-1-->L49-1: Formula: (and (= v_ULTIMATE.start_main_~x~0_28 (+ v_ULTIMATE.start_main_~x~0_29 (- 1))) (>= 0 v_ULTIMATE.start_main_~x~0_29)) InVars {ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_29} OutVars{ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_28} AuxVars[] AssignedVars[ULTIMATE.start_main_~x~0] 143#L49-1 [103] L49-1-->L54-1: Formula: (and (>= 0 v_ULTIMATE.start_main_~x~0_33) (= v_ULTIMATE.start_main_~x~0_32 (+ v_ULTIMATE.start_main_~x~0_33 (- 1)))) InVars {ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_33} OutVars{ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_32} AuxVars[] AssignedVars[ULTIMATE.start_main_~x~0] 129#L54-1 [104] L54-1-->L64-1: Formula: (and (>= 0 v_ULTIMATE.start_main_~x~0_37) (= v_ULTIMATE.start_main_~x~0_36 (+ v_ULTIMATE.start_main_~x~0_37 (- 1)))) InVars {ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_37} OutVars{ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_36} AuxVars[] AssignedVars[ULTIMATE.start_main_~x~0] 128#L64-1 19.17/8.83 [2019-03-29 02:01:48,285 INFO L796 eck$LassoCheckResult]: Loop: 128#L64-1 [84] L64-1-->L64-1: Formula: (and (< v_ULTIMATE.start_main_~y~0_8 100) (= v_ULTIMATE.start_main_~z~0_7 (+ v_ULTIMATE.start_main_~z~0_8 (* (- 1) v_ULTIMATE.start_main_~x~0_38))) (= v_ULTIMATE.start_main_~y~0_7 (+ v_ULTIMATE.start_main_~x~0_38 v_ULTIMATE.start_main_~y~0_8)) (< v_ULTIMATE.start_main_~z~0_8 100)) InVars {ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_8, ULTIMATE.start_main_~z~0=v_ULTIMATE.start_main_~z~0_8, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_38} OutVars{ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_7, ULTIMATE.start_main_~z~0=v_ULTIMATE.start_main_~z~0_7, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_38} AuxVars[] AssignedVars[ULTIMATE.start_main_~y~0, ULTIMATE.start_main_~z~0] 128#L64-1 19.17/8.83 [2019-03-29 02:01:48,285 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 19.17/8.83 [2019-03-29 02:01:48,285 INFO L82 PathProgramCache]: Analyzing trace with hash 978447646, now seen corresponding path program 1 times 19.17/8.83 [2019-03-29 02:01:48,286 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 19.17/8.83 [2019-03-29 02:01:48,286 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 19.17/8.83 [2019-03-29 02:01:48,287 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 19.17/8.83 [2019-03-29 02:01:48,287 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY 19.17/8.83 [2019-03-29 02:01:48,288 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 19.17/8.83 [2019-03-29 02:01:48,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 19.17/8.83 [2019-03-29 02:01:48,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 19.17/8.83 [2019-03-29 02:01:48,306 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 19.17/8.83 [2019-03-29 02:01:48,306 INFO L82 PathProgramCache]: Analyzing trace with hash 115, now seen corresponding path program 4 times 19.17/8.83 [2019-03-29 02:01:48,307 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 19.17/8.83 [2019-03-29 02:01:48,307 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 19.17/8.83 [2019-03-29 02:01:48,308 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 19.17/8.83 [2019-03-29 02:01:48,308 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 19.17/8.83 [2019-03-29 02:01:48,308 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 19.17/8.83 [2019-03-29 02:01:48,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 19.17/8.83 [2019-03-29 02:01:48,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 19.17/8.83 [2019-03-29 02:01:48,313 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 19.17/8.83 [2019-03-29 02:01:48,313 INFO L82 PathProgramCache]: Analyzing trace with hash 267106038, now seen corresponding path program 1 times 19.17/8.83 [2019-03-29 02:01:48,314 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 19.17/8.83 [2019-03-29 02:01:48,314 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 19.17/8.83 [2019-03-29 02:01:48,315 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 19.17/8.83 [2019-03-29 02:01:48,315 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY 19.17/8.83 [2019-03-29 02:01:48,315 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 19.17/8.83 [2019-03-29 02:01:48,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 19.17/8.83 [2019-03-29 02:01:48,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 19.17/8.83 [2019-03-29 02:01:48,452 INFO L216 LassoAnalysis]: Preferences: 19.17/8.83 [2019-03-29 02:01:48,453 INFO L124 ssoRankerPreferences]: Compute integeral hull: false 19.17/8.83 [2019-03-29 02:01:48,453 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true 19.17/8.83 [2019-03-29 02:01:48,454 INFO L126 ssoRankerPreferences]: Term annotations enabled: false 19.17/8.83 [2019-03-29 02:01:48,454 INFO L127 ssoRankerPreferences]: Use exernal solver: true 19.17/8.83 [2019-03-29 02:01:48,454 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 19.17/8.83 [2019-03-29 02:01:48,454 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false 19.17/8.83 [2019-03-29 02:01:48,454 INFO L130 ssoRankerPreferences]: Path of dumped script: 19.17/8.83 [2019-03-29 02:01:48,454 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration4_Lasso 19.17/8.83 [2019-03-29 02:01:48,455 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank 19.17/8.83 [2019-03-29 02:01:48,455 INFO L282 LassoAnalysis]: Starting lasso preprocessing... 19.17/8.83 [2019-03-29 02:01:48,474 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 19.17/8.83 [2019-03-29 02:01:48,482 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 19.17/8.83 [2019-03-29 02:01:48,484 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 19.17/8.83 [2019-03-29 02:01:48,496 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 19.17/8.83 [2019-03-29 02:01:48,499 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 19.17/8.83 [2019-03-29 02:01:48,502 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 19.17/8.83 [2019-03-29 02:01:48,504 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 19.17/8.83 [2019-03-29 02:01:48,591 INFO L300 LassoAnalysis]: Preprocessing complete. 19.17/8.83 [2019-03-29 02:01:48,592 INFO L412 LassoAnalysis]: Checking for nontermination... 19.17/8.83 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 19.17/8.83 Starting monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 19.17/8.83 Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 19.17/8.83 [2019-03-29 02:01:48,601 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true 19.17/8.83 [2019-03-29 02:01:48,601 INFO L163 nArgumentSynthesizer]: Using integer mode. 19.17/8.83 [2019-03-29 02:01:48,633 INFO L445 LassoAnalysis]: Proved nontermination for one component. 19.17/8.83 [2019-03-29 02:01:48,634 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~false_1=0} Honda state: {v_rep~unnamed0~0~false_1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] 19.17/8.83 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 19.17/8.83 Starting monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 19.17/8.83 Waiting until toolchain timeout for monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 19.17/8.83 [2019-03-29 02:01:48,642 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true 19.17/8.83 [2019-03-29 02:01:48,642 INFO L163 nArgumentSynthesizer]: Using integer mode. 19.17/8.83 [2019-03-29 02:01:48,646 INFO L445 LassoAnalysis]: Proved nontermination for one component. 19.17/8.83 [2019-03-29 02:01:48,646 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#t~nondet0=0} Honda state: {ULTIMATE.start_main_#t~nondet0=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] 19.17/8.83 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 19.17/8.83 Starting monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 19.17/8.83 Waiting until toolchain timeout for monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 19.17/8.83 [2019-03-29 02:01:48,678 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true 19.17/8.83 [2019-03-29 02:01:48,678 INFO L163 nArgumentSynthesizer]: Using integer mode. 19.17/8.83 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 19.17/8.83 Starting monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 19.17/8.83 Waiting until toolchain timeout for monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 19.17/8.83 [2019-03-29 02:01:48,710 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true 19.17/8.83 [2019-03-29 02:01:48,710 INFO L163 nArgumentSynthesizer]: Using integer mode. 19.17/8.83 [2019-03-29 02:01:49,094 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. 19.17/8.83 [2019-03-29 02:01:49,098 INFO L216 LassoAnalysis]: Preferences: 19.17/8.83 [2019-03-29 02:01:49,098 INFO L124 ssoRankerPreferences]: Compute integeral hull: false 19.17/8.83 [2019-03-29 02:01:49,098 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true 19.17/8.83 [2019-03-29 02:01:49,098 INFO L126 ssoRankerPreferences]: Term annotations enabled: false 19.17/8.83 [2019-03-29 02:01:49,098 INFO L127 ssoRankerPreferences]: Use exernal solver: false 19.17/8.83 [2019-03-29 02:01:49,099 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 19.17/8.83 [2019-03-29 02:01:49,099 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false 19.17/8.83 [2019-03-29 02:01:49,099 INFO L130 ssoRankerPreferences]: Path of dumped script: 19.17/8.83 [2019-03-29 02:01:49,099 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration4_Lasso 19.17/8.83 [2019-03-29 02:01:49,099 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank 19.17/8.83 [2019-03-29 02:01:49,099 INFO L282 LassoAnalysis]: Starting lasso preprocessing... 19.17/8.83 [2019-03-29 02:01:49,101 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 19.17/8.83 [2019-03-29 02:01:49,116 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 19.17/8.83 [2019-03-29 02:01:49,119 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 19.17/8.83 [2019-03-29 02:01:49,121 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 19.17/8.83 [2019-03-29 02:01:49,124 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 19.17/8.83 [2019-03-29 02:01:49,126 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 19.17/8.83 [2019-03-29 02:01:49,129 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 19.17/8.83 [2019-03-29 02:01:49,193 INFO L300 LassoAnalysis]: Preprocessing complete. 19.17/8.83 [2019-03-29 02:01:49,199 INFO L497 LassoAnalysis]: Using template 'affine'. 19.17/8.83 [2019-03-29 02:01:49,202 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 19.17/8.83 Termination analysis: LINEAR_WITH_GUESSES 19.17/8.83 Number of strict supporting invariants: 0 19.17/8.83 Number of non-strict supporting invariants: 1 19.17/8.83 Consider only non-deceasing supporting invariants: true 19.17/8.83 Simplify termination arguments: true 19.17/8.83 Simplify supporting invariants: trueOverapproximate stem: false 19.17/8.83 [2019-03-29 02:01:49,203 INFO L339 nArgumentSynthesizer]: Template has degree 0. 19.17/8.83 [2019-03-29 02:01:49,204 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 19.17/8.83 [2019-03-29 02:01:49,204 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 19.17/8.83 [2019-03-29 02:01:49,204 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 19.17/8.83 [2019-03-29 02:01:49,210 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 19.17/8.83 [2019-03-29 02:01:49,210 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 19.17/8.83 [2019-03-29 02:01:49,235 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. 19.17/8.83 [2019-03-29 02:01:49,248 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. 19.17/8.83 [2019-03-29 02:01:49,249 INFO L444 ModelExtractionUtils]: 8 out of 13 variables were initially zero. Simplification set additionally 0 variables to zero. 19.17/8.83 [2019-03-29 02:01:49,252 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... 19.17/8.83 [2019-03-29 02:01:49,254 INFO L440 nArgumentSynthesizer]: Removed 1 redundant supporting invariants from a total of 2. 19.17/8.83 [2019-03-29 02:01:49,255 INFO L518 LassoAnalysis]: Proved termination. 19.17/8.83 [2019-03-29 02:01:49,256 INFO L520 LassoAnalysis]: Termination argument consisting of: 19.17/8.83 Ranking function f(ULTIMATE.start_main_~z~0) = -2*ULTIMATE.start_main_~z~0 + 207 19.17/8.83 Supporting invariants [-1*ULTIMATE.start_main_~x~0 - 9 >= 0] 19.17/8.83 [2019-03-29 02:01:49,259 INFO L297 tatePredicateManager]: 0 out of 1 supporting invariants were superfluous and have been removed 19.17/8.83 [2019-03-29 02:01:49,309 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 19.17/8.83 [2019-03-29 02:01:49,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 19.17/8.83 [2019-03-29 02:01:49,326 INFO L256 TraceCheckSpWp]: Trace formula consists of 34 conjuncts, 11 conjunts are in the unsatisfiable core 19.17/8.83 [2019-03-29 02:01:49,328 INFO L279 TraceCheckSpWp]: Computing forward predicates... 19.17/8.83 [2019-03-29 02:01:49,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 19.17/8.83 [2019-03-29 02:01:49,514 WARN L254 TraceCheckSpWp]: Trace formula consists of 9 conjuncts, 5 conjunts are in the unsatisfiable core 19.17/8.83 [2019-03-29 02:01:49,514 INFO L279 TraceCheckSpWp]: Computing forward predicates... 19.17/8.83 [2019-03-29 02:01:49,515 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 19.17/8.83 [2019-03-29 02:01:49,623 INFO L98 LoopCannibalizer]: 2 predicates before loop cannibalization 2 predicates after loop cannibalization 19.17/8.83 [2019-03-29 02:01:49,626 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.9 stem predicates 2 loop predicates 19.17/8.83 [2019-03-29 02:01:49,627 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 19 states and 21 transitions. cyclomatic complexity: 3 Second operand 10 states. 19.17/8.83 [2019-03-29 02:01:49,832 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 19 states and 21 transitions. cyclomatic complexity: 3. Second operand 10 states. Result 21 states and 23 transitions. Complement of second has 10 states. 19.17/8.83 [2019-03-29 02:01:49,833 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 10 states 9 stem states 0 non-accepting loop states 1 accepting loop states 19.17/8.83 [2019-03-29 02:01:49,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. 19.17/8.83 [2019-03-29 02:01:49,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 24 transitions. 19.17/8.83 [2019-03-29 02:01:49,836 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 24 transitions. Stem has 10 letters. Loop has 1 letters. 19.17/8.83 [2019-03-29 02:01:49,838 INFO L116 BuchiAccepts]: Finished buchiAccepts. 19.17/8.83 [2019-03-29 02:01:49,838 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 24 transitions. Stem has 11 letters. Loop has 1 letters. 19.17/8.83 [2019-03-29 02:01:49,838 INFO L116 BuchiAccepts]: Finished buchiAccepts. 19.17/8.83 [2019-03-29 02:01:49,838 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 24 transitions. Stem has 10 letters. Loop has 2 letters. 19.17/8.83 [2019-03-29 02:01:49,838 INFO L116 BuchiAccepts]: Finished buchiAccepts. 19.17/8.83 [2019-03-29 02:01:49,847 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 21 states and 23 transitions. 19.17/8.83 [2019-03-29 02:01:49,849 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 19.17/8.83 [2019-03-29 02:01:49,849 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 21 states to 11 states and 12 transitions. 19.17/8.83 [2019-03-29 02:01:49,849 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 19.17/8.83 [2019-03-29 02:01:49,849 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 19.17/8.83 [2019-03-29 02:01:49,850 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 12 transitions. 19.17/8.83 [2019-03-29 02:01:49,850 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. 19.17/8.83 [2019-03-29 02:01:49,850 INFO L706 BuchiCegarLoop]: Abstraction has 11 states and 12 transitions. 19.17/8.83 [2019-03-29 02:01:49,850 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states and 12 transitions. 19.17/8.83 [2019-03-29 02:01:49,851 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. 19.17/8.83 [2019-03-29 02:01:49,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. 19.17/8.83 [2019-03-29 02:01:49,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 12 transitions. 19.17/8.83 [2019-03-29 02:01:49,852 INFO L729 BuchiCegarLoop]: Abstraction has 11 states and 12 transitions. 19.17/8.83 [2019-03-29 02:01:49,852 INFO L609 BuchiCegarLoop]: Abstraction has 11 states and 12 transitions. 19.17/8.83 [2019-03-29 02:01:49,852 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ 19.17/8.83 [2019-03-29 02:01:49,852 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 11 states and 12 transitions. 19.17/8.83 [2019-03-29 02:01:49,852 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 19.17/8.83 [2019-03-29 02:01:49,853 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 19.17/8.83 [2019-03-29 02:01:49,853 INFO L119 BuchiIsEmpty]: Starting construction of run 19.17/8.83 [2019-03-29 02:01:49,853 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] 19.17/8.83 [2019-03-29 02:01:49,853 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1] 19.17/8.83 [2019-03-29 02:01:49,854 INFO L794 eck$LassoCheckResult]: Stem: 262#ULTIMATE.startENTRY [87] ULTIMATE.startENTRY-->L19: Formula: (and (= v_ULTIMATE.start_main_~y~0_1 |v_ULTIMATE.start_main_#t~nondet0_4|) (= v_ULTIMATE.start_main_~z~0_1 |v_ULTIMATE.start_main_#t~nondet1_4|)) InVars {} OutVars{ULTIMATE.start_main_#t~nondet0=|v_ULTIMATE.start_main_#t~nondet0_1|, ULTIMATE.start_main_#t~nondet1=|v_ULTIMATE.start_main_#t~nondet1_1|, ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_1|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_1|, ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_1, ULTIMATE.start_main_~z~0=v_ULTIMATE.start_main_~z~0_1, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_1} AuxVars[|v_ULTIMATE.start_main_#t~nondet1_4|, |v_ULTIMATE.start_main_#t~nondet0_4|] AssignedVars[ULTIMATE.start_main_#t~nondet0, ULTIMATE.start_main_#t~nondet1, ULTIMATE.start_main_#t~nondet2, ULTIMATE.start_main_#res, ULTIMATE.start_main_~y~0, ULTIMATE.start_main_~z~0, ULTIMATE.start_main_~x~0] 263#L19 [107] L19-->L19-2: Formula: (and (< 0 |v_ULTIMATE.start_main_#t~nondet2_3|) (= v_ULTIMATE.start_main_~x~0_4 1)) InVars {ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_3|} OutVars{ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_4, ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet2, ULTIMATE.start_main_~x~0] 267#L19-2 [75] L19-2-->L24-1: Formula: (and (< 0 v_ULTIMATE.start_main_~x~0_7) (= v_ULTIMATE.start_main_~x~0_6 (+ v_ULTIMATE.start_main_~x~0_7 1))) InVars {ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_7} OutVars{ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_6} AuxVars[] AssignedVars[ULTIMATE.start_main_~x~0] 268#L24-1 [92] L24-1-->L29-1: Formula: (and (< 0 v_ULTIMATE.start_main_~x~0_11) (= v_ULTIMATE.start_main_~x~0_10 (+ v_ULTIMATE.start_main_~x~0_11 1))) InVars {ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_11} OutVars{ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_10} AuxVars[] AssignedVars[ULTIMATE.start_main_~x~0] 269#L29-1 [77] L29-1-->L34-1: Formula: (and (= v_ULTIMATE.start_main_~x~0_14 (+ v_ULTIMATE.start_main_~x~0_15 1)) (< 0 v_ULTIMATE.start_main_~x~0_15)) InVars {ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_15} OutVars{ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_14} AuxVars[] AssignedVars[ULTIMATE.start_main_~x~0] 266#L34-1 [90] L34-1-->L39-1: Formula: (and (< 0 v_ULTIMATE.start_main_~x~0_19) (= v_ULTIMATE.start_main_~x~0_18 (+ v_ULTIMATE.start_main_~x~0_19 1))) InVars {ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_19} OutVars{ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_18} AuxVars[] AssignedVars[ULTIMATE.start_main_~x~0] 265#L39-1 [73] L39-1-->L44-1: Formula: (and (< 0 v_ULTIMATE.start_main_~x~0_23) (= v_ULTIMATE.start_main_~x~0_22 (+ v_ULTIMATE.start_main_~x~0_23 1))) InVars {ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_23} OutVars{ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_22} AuxVars[] AssignedVars[ULTIMATE.start_main_~x~0] 264#L44-1 [88] L44-1-->L49-1: Formula: (and (< 0 v_ULTIMATE.start_main_~x~0_27) (= v_ULTIMATE.start_main_~x~0_26 (+ v_ULTIMATE.start_main_~x~0_27 1))) InVars {ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_27} OutVars{ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_26} AuxVars[] AssignedVars[ULTIMATE.start_main_~x~0] 261#L49-1 [71] L49-1-->L54-1: Formula: (and (= v_ULTIMATE.start_main_~x~0_30 (+ v_ULTIMATE.start_main_~x~0_31 1)) (< 0 v_ULTIMATE.start_main_~x~0_31)) InVars {ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_31} OutVars{ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_30} AuxVars[] AssignedVars[ULTIMATE.start_main_~x~0] 260#L54-1 [85] L54-1-->L64-1: Formula: (and (< 0 v_ULTIMATE.start_main_~x~0_35) (= v_ULTIMATE.start_main_~x~0_34 (+ v_ULTIMATE.start_main_~x~0_35 1))) InVars {ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_35} OutVars{ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_34} AuxVars[] AssignedVars[ULTIMATE.start_main_~x~0] 259#L64-1 19.17/8.83 [2019-03-29 02:01:49,854 INFO L796 eck$LassoCheckResult]: Loop: 259#L64-1 [84] L64-1-->L64-1: Formula: (and (< v_ULTIMATE.start_main_~y~0_8 100) (= v_ULTIMATE.start_main_~z~0_7 (+ v_ULTIMATE.start_main_~z~0_8 (* (- 1) v_ULTIMATE.start_main_~x~0_38))) (= v_ULTIMATE.start_main_~y~0_7 (+ v_ULTIMATE.start_main_~x~0_38 v_ULTIMATE.start_main_~y~0_8)) (< v_ULTIMATE.start_main_~z~0_8 100)) InVars {ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_8, ULTIMATE.start_main_~z~0=v_ULTIMATE.start_main_~z~0_8, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_38} OutVars{ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_7, ULTIMATE.start_main_~z~0=v_ULTIMATE.start_main_~z~0_7, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_38} AuxVars[] AssignedVars[ULTIMATE.start_main_~y~0, ULTIMATE.start_main_~z~0] 259#L64-1 19.17/8.83 [2019-03-29 02:01:49,854 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 19.17/8.83 [2019-03-29 02:01:49,855 INFO L82 PathProgramCache]: Analyzing trace with hash -1935284240, now seen corresponding path program 1 times 19.17/8.83 [2019-03-29 02:01:49,855 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 19.17/8.83 [2019-03-29 02:01:49,855 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 19.17/8.83 [2019-03-29 02:01:49,857 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 19.17/8.83 [2019-03-29 02:01:49,857 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 19.17/8.83 [2019-03-29 02:01:49,857 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 19.17/8.83 [2019-03-29 02:01:49,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 19.17/8.83 [2019-03-29 02:01:49,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 19.17/8.83 [2019-03-29 02:01:49,870 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 19.17/8.83 [2019-03-29 02:01:49,871 INFO L82 PathProgramCache]: Analyzing trace with hash 115, now seen corresponding path program 5 times 19.17/8.83 [2019-03-29 02:01:49,871 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 19.17/8.83 [2019-03-29 02:01:49,871 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 19.17/8.83 [2019-03-29 02:01:49,872 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 19.17/8.83 [2019-03-29 02:01:49,872 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 19.17/8.83 [2019-03-29 02:01:49,872 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 19.17/8.83 [2019-03-29 02:01:49,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 19.17/8.83 [2019-03-29 02:01:49,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 19.17/8.83 [2019-03-29 02:01:49,876 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 19.17/8.83 [2019-03-29 02:01:49,876 INFO L82 PathProgramCache]: Analyzing trace with hash 135730788, now seen corresponding path program 1 times 19.17/8.83 [2019-03-29 02:01:49,877 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 19.17/8.83 [2019-03-29 02:01:49,877 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 19.17/8.83 [2019-03-29 02:01:49,878 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 19.17/8.83 [2019-03-29 02:01:49,878 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY 19.17/8.83 [2019-03-29 02:01:49,878 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 19.17/8.83 [2019-03-29 02:01:49,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 19.17/8.83 [2019-03-29 02:01:49,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 19.17/8.83 [2019-03-29 02:01:49,996 INFO L216 LassoAnalysis]: Preferences: 19.17/8.83 [2019-03-29 02:01:49,996 INFO L124 ssoRankerPreferences]: Compute integeral hull: false 19.17/8.83 [2019-03-29 02:01:49,996 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true 19.17/8.83 [2019-03-29 02:01:49,996 INFO L126 ssoRankerPreferences]: Term annotations enabled: false 19.17/8.83 [2019-03-29 02:01:49,997 INFO L127 ssoRankerPreferences]: Use exernal solver: true 19.17/8.83 [2019-03-29 02:01:49,997 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 19.17/8.83 [2019-03-29 02:01:49,997 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false 19.17/8.83 [2019-03-29 02:01:49,997 INFO L130 ssoRankerPreferences]: Path of dumped script: 19.17/8.83 [2019-03-29 02:01:49,997 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration5_Lasso 19.17/8.83 [2019-03-29 02:01:49,997 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank 19.17/8.83 [2019-03-29 02:01:49,997 INFO L282 LassoAnalysis]: Starting lasso preprocessing... 19.17/8.83 [2019-03-29 02:01:49,999 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 19.17/8.83 [2019-03-29 02:01:50,003 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 19.17/8.83 [2019-03-29 02:01:50,005 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 19.17/8.83 [2019-03-29 02:01:50,008 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 19.17/8.83 [2019-03-29 02:01:50,011 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 19.17/8.83 [2019-03-29 02:01:50,012 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 19.17/8.83 [2019-03-29 02:01:50,014 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 19.17/8.83 [2019-03-29 02:01:50,080 INFO L300 LassoAnalysis]: Preprocessing complete. 19.17/8.83 [2019-03-29 02:01:50,080 INFO L412 LassoAnalysis]: Checking for nontermination... 19.17/8.83 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 19.17/8.83 Starting monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 19.17/8.83 Waiting until toolchain timeout for monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 19.17/8.83 [2019-03-29 02:01:50,092 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true 19.17/8.83 [2019-03-29 02:01:50,092 INFO L163 nArgumentSynthesizer]: Using integer mode. 19.17/8.83 [2019-03-29 02:01:50,119 INFO L445 LassoAnalysis]: Proved nontermination for one component. 19.17/8.83 [2019-03-29 02:01:50,119 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~false_3=0} Honda state: {v_rep~unnamed0~0~false_3=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] 19.17/8.83 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 19.17/8.83 Starting monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 19.17/8.83 Waiting until toolchain timeout for monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 19.17/8.83 [2019-03-29 02:01:50,126 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true 19.17/8.83 [2019-03-29 02:01:50,127 INFO L163 nArgumentSynthesizer]: Using integer mode. 19.17/8.83 [2019-03-29 02:01:50,130 INFO L445 LassoAnalysis]: Proved nontermination for one component. 19.17/8.83 [2019-03-29 02:01:50,130 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#t~nondet1=0} Honda state: {ULTIMATE.start_main_#t~nondet1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] 19.17/8.83 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 19.17/8.83 Starting monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 19.17/8.83 Waiting until toolchain timeout for monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 19.17/8.83 [2019-03-29 02:01:50,158 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true 19.17/8.83 [2019-03-29 02:01:50,158 INFO L163 nArgumentSynthesizer]: Using integer mode. 19.17/8.83 [2019-03-29 02:01:50,163 INFO L445 LassoAnalysis]: Proved nontermination for one component. 19.17/8.83 [2019-03-29 02:01:50,163 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#t~nondet2=0} Honda state: {ULTIMATE.start_main_#t~nondet2=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] 19.17/8.83 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 19.17/8.83 Starting monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 19.17/8.83 Waiting until toolchain timeout for monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 19.17/8.83 [2019-03-29 02:01:50,194 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true 19.17/8.83 [2019-03-29 02:01:50,194 INFO L163 nArgumentSynthesizer]: Using integer mode. 19.17/8.83 [2019-03-29 02:01:50,222 INFO L445 LassoAnalysis]: Proved nontermination for one component. 19.17/8.83 [2019-03-29 02:01:50,222 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~true_3=1} Honda state: {v_rep~unnamed0~0~true_3=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] 19.17/8.83 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 19.17/8.83 Starting monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 19.17/8.83 Waiting until toolchain timeout for monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 19.17/8.83 [2019-03-29 02:01:50,227 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true 19.17/8.83 [2019-03-29 02:01:50,227 INFO L163 nArgumentSynthesizer]: Using integer mode. 19.17/8.83 [2019-03-29 02:01:50,230 INFO L445 LassoAnalysis]: Proved nontermination for one component. 19.17/8.83 [2019-03-29 02:01:50,231 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#t~nondet0=0} Honda state: {ULTIMATE.start_main_#t~nondet0=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] 19.17/8.83 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 19.17/8.83 Starting monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 19.17/8.83 Waiting until toolchain timeout for monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 19.17/8.83 [2019-03-29 02:01:50,258 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true 19.17/8.83 [2019-03-29 02:01:50,258 INFO L163 nArgumentSynthesizer]: Using integer mode. 19.17/8.83 [2019-03-29 02:01:50,262 INFO L445 LassoAnalysis]: Proved nontermination for one component. 19.17/8.83 [2019-03-29 02:01:50,262 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#res=0} Honda state: {ULTIMATE.start_main_#res=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] 19.17/8.83 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 19.17/8.83 Starting monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 19.17/8.83 Waiting until toolchain timeout for monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 19.17/8.83 [2019-03-29 02:01:50,291 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true 19.17/8.83 [2019-03-29 02:01:50,291 INFO L163 nArgumentSynthesizer]: Using integer mode. 19.17/8.83 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 19.17/8.83 Starting monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 19.17/8.83 Waiting until toolchain timeout for monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 19.17/8.83 [2019-03-29 02:01:50,322 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true 19.17/8.83 [2019-03-29 02:01:50,322 INFO L163 nArgumentSynthesizer]: Using integer mode. 19.17/8.83 [2019-03-29 02:01:50,712 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. 19.17/8.83 [2019-03-29 02:01:50,716 INFO L216 LassoAnalysis]: Preferences: 19.17/8.83 [2019-03-29 02:01:50,716 INFO L124 ssoRankerPreferences]: Compute integeral hull: false 19.17/8.83 [2019-03-29 02:01:50,716 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true 19.17/8.83 [2019-03-29 02:01:50,716 INFO L126 ssoRankerPreferences]: Term annotations enabled: false 19.17/8.83 [2019-03-29 02:01:50,716 INFO L127 ssoRankerPreferences]: Use exernal solver: false 19.17/8.83 [2019-03-29 02:01:50,716 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 19.17/8.83 [2019-03-29 02:01:50,717 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false 19.17/8.83 [2019-03-29 02:01:50,717 INFO L130 ssoRankerPreferences]: Path of dumped script: 19.17/8.83 [2019-03-29 02:01:50,717 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration5_Lasso 19.17/8.83 [2019-03-29 02:01:50,717 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank 19.17/8.83 [2019-03-29 02:01:50,717 INFO L282 LassoAnalysis]: Starting lasso preprocessing... 19.17/8.83 [2019-03-29 02:01:50,719 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 19.17/8.83 [2019-03-29 02:01:50,722 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 19.17/8.83 [2019-03-29 02:01:50,724 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 19.17/8.83 [2019-03-29 02:01:50,725 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 19.17/8.83 [2019-03-29 02:01:50,727 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 19.17/8.83 [2019-03-29 02:01:50,731 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 19.17/8.83 [2019-03-29 02:01:50,733 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 19.17/8.83 [2019-03-29 02:01:50,792 INFO L300 LassoAnalysis]: Preprocessing complete. 19.17/8.83 [2019-03-29 02:01:50,792 INFO L497 LassoAnalysis]: Using template 'affine'. 19.17/8.83 [2019-03-29 02:01:50,793 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 19.17/8.83 Termination analysis: LINEAR_WITH_GUESSES 19.17/8.83 Number of strict supporting invariants: 0 19.17/8.83 Number of non-strict supporting invariants: 1 19.17/8.83 Consider only non-deceasing supporting invariants: true 19.17/8.83 Simplify termination arguments: true 19.17/8.83 Simplify supporting invariants: trueOverapproximate stem: false 19.17/8.83 [2019-03-29 02:01:50,794 INFO L339 nArgumentSynthesizer]: Template has degree 0. 19.17/8.83 [2019-03-29 02:01:50,794 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 19.17/8.83 [2019-03-29 02:01:50,794 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 19.17/8.83 [2019-03-29 02:01:50,794 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 19.17/8.83 [2019-03-29 02:01:50,796 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 19.17/8.83 [2019-03-29 02:01:50,796 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 19.17/8.83 [2019-03-29 02:01:50,799 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 19.17/8.83 [2019-03-29 02:01:50,799 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 19.17/8.83 Termination analysis: LINEAR_WITH_GUESSES 19.17/8.83 Number of strict supporting invariants: 0 19.17/8.83 Number of non-strict supporting invariants: 1 19.17/8.83 Consider only non-deceasing supporting invariants: true 19.17/8.83 Simplify termination arguments: true 19.17/8.83 Simplify supporting invariants: trueOverapproximate stem: false 19.17/8.83 [2019-03-29 02:01:50,800 INFO L339 nArgumentSynthesizer]: Template has degree 0. 19.17/8.83 [2019-03-29 02:01:50,800 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 19.17/8.83 [2019-03-29 02:01:50,801 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 19.17/8.83 [2019-03-29 02:01:50,801 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 19.17/8.83 [2019-03-29 02:01:50,801 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 19.17/8.83 [2019-03-29 02:01:50,801 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 19.17/8.83 [2019-03-29 02:01:50,801 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 19.17/8.83 [2019-03-29 02:01:50,802 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 19.17/8.83 [2019-03-29 02:01:50,802 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 19.17/8.83 Termination analysis: LINEAR_WITH_GUESSES 19.17/8.83 Number of strict supporting invariants: 0 19.17/8.83 Number of non-strict supporting invariants: 1 19.17/8.83 Consider only non-deceasing supporting invariants: true 19.17/8.83 Simplify termination arguments: true 19.17/8.83 Simplify supporting invariants: trueOverapproximate stem: false 19.17/8.83 [2019-03-29 02:01:50,803 INFO L339 nArgumentSynthesizer]: Template has degree 0. 19.17/8.83 [2019-03-29 02:01:50,803 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 19.17/8.83 [2019-03-29 02:01:50,803 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 19.17/8.83 [2019-03-29 02:01:50,803 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 19.17/8.83 [2019-03-29 02:01:50,803 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 19.17/8.83 [2019-03-29 02:01:50,804 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 19.17/8.83 [2019-03-29 02:01:50,804 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 19.17/8.83 [2019-03-29 02:01:50,804 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 19.17/8.83 [2019-03-29 02:01:50,805 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 19.17/8.83 Termination analysis: LINEAR_WITH_GUESSES 19.17/8.83 Number of strict supporting invariants: 0 19.17/8.83 Number of non-strict supporting invariants: 1 19.17/8.83 Consider only non-deceasing supporting invariants: true 19.17/8.83 Simplify termination arguments: true 19.17/8.83 Simplify supporting invariants: trueOverapproximate stem: false 19.17/8.83 [2019-03-29 02:01:50,805 INFO L339 nArgumentSynthesizer]: Template has degree 0. 19.17/8.83 [2019-03-29 02:01:50,805 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 19.17/8.83 [2019-03-29 02:01:50,806 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 19.17/8.83 [2019-03-29 02:01:50,806 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 19.17/8.83 [2019-03-29 02:01:50,806 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 19.17/8.83 [2019-03-29 02:01:50,806 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 19.17/8.83 [2019-03-29 02:01:50,806 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 19.17/8.83 [2019-03-29 02:01:50,807 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 19.17/8.83 [2019-03-29 02:01:50,807 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 19.17/8.83 Termination analysis: LINEAR_WITH_GUESSES 19.17/8.83 Number of strict supporting invariants: 0 19.17/8.83 Number of non-strict supporting invariants: 1 19.17/8.83 Consider only non-deceasing supporting invariants: true 19.17/8.83 Simplify termination arguments: true 19.17/8.83 Simplify supporting invariants: trueOverapproximate stem: false 19.17/8.83 [2019-03-29 02:01:50,808 INFO L339 nArgumentSynthesizer]: Template has degree 0. 19.17/8.83 [2019-03-29 02:01:50,808 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 19.17/8.83 [2019-03-29 02:01:50,808 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 19.17/8.83 [2019-03-29 02:01:50,808 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 19.17/8.83 [2019-03-29 02:01:50,810 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 19.17/8.83 [2019-03-29 02:01:50,810 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 19.17/8.83 [2019-03-29 02:01:50,814 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 19.17/8.83 [2019-03-29 02:01:50,814 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 19.17/8.83 Termination analysis: LINEAR_WITH_GUESSES 19.17/8.83 Number of strict supporting invariants: 0 19.17/8.83 Number of non-strict supporting invariants: 1 19.17/8.83 Consider only non-deceasing supporting invariants: true 19.17/8.83 Simplify termination arguments: true 19.17/8.83 Simplify supporting invariants: trueOverapproximate stem: false 19.17/8.83 [2019-03-29 02:01:50,815 INFO L339 nArgumentSynthesizer]: Template has degree 0. 19.17/8.83 [2019-03-29 02:01:50,815 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 19.17/8.83 [2019-03-29 02:01:50,815 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 19.17/8.83 [2019-03-29 02:01:50,815 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 19.17/8.83 [2019-03-29 02:01:50,815 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 19.17/8.83 [2019-03-29 02:01:50,816 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 19.17/8.83 [2019-03-29 02:01:50,816 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 19.17/8.83 [2019-03-29 02:01:50,816 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 19.17/8.83 [2019-03-29 02:01:50,817 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 19.17/8.83 Termination analysis: LINEAR_WITH_GUESSES 19.17/8.83 Number of strict supporting invariants: 0 19.17/8.83 Number of non-strict supporting invariants: 1 19.17/8.83 Consider only non-deceasing supporting invariants: true 19.17/8.83 Simplify termination arguments: true 19.17/8.83 Simplify supporting invariants: trueOverapproximate stem: false 19.17/8.83 [2019-03-29 02:01:50,817 INFO L339 nArgumentSynthesizer]: Template has degree 0. 19.17/8.83 [2019-03-29 02:01:50,817 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 19.17/8.83 [2019-03-29 02:01:50,818 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 19.17/8.83 [2019-03-29 02:01:50,818 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 19.17/8.83 [2019-03-29 02:01:50,820 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 19.17/8.83 [2019-03-29 02:01:50,820 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 19.17/8.83 [2019-03-29 02:01:50,835 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. 19.17/8.83 [2019-03-29 02:01:50,841 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. 19.17/8.83 [2019-03-29 02:01:50,841 INFO L444 ModelExtractionUtils]: 8 out of 13 variables were initially zero. Simplification set additionally 0 variables to zero. 19.17/8.83 [2019-03-29 02:01:50,842 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... 19.17/8.83 [2019-03-29 02:01:50,844 INFO L440 nArgumentSynthesizer]: Removed 1 redundant supporting invariants from a total of 2. 19.17/8.83 [2019-03-29 02:01:50,844 INFO L518 LassoAnalysis]: Proved termination. 19.17/8.83 [2019-03-29 02:01:50,844 INFO L520 LassoAnalysis]: Termination argument consisting of: 19.17/8.83 Ranking function f(ULTIMATE.start_main_~y~0) = -2*ULTIMATE.start_main_~y~0 + 207 19.17/8.83 Supporting invariants [1*ULTIMATE.start_main_~x~0 - 9 >= 0] 19.17/8.83 [2019-03-29 02:01:50,846 INFO L297 tatePredicateManager]: 0 out of 1 supporting invariants were superfluous and have been removed 19.17/8.83 [2019-03-29 02:01:50,873 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 19.17/8.83 [2019-03-29 02:01:50,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 19.17/8.83 [2019-03-29 02:01:50,880 INFO L256 TraceCheckSpWp]: Trace formula consists of 33 conjuncts, 11 conjunts are in the unsatisfiable core 19.17/8.83 [2019-03-29 02:01:50,881 INFO L279 TraceCheckSpWp]: Computing forward predicates... 19.17/8.83 [2019-03-29 02:01:50,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 19.17/8.83 [2019-03-29 02:01:50,988 WARN L254 TraceCheckSpWp]: Trace formula consists of 9 conjuncts, 5 conjunts are in the unsatisfiable core 19.17/8.83 [2019-03-29 02:01:50,988 INFO L279 TraceCheckSpWp]: Computing forward predicates... 19.17/8.83 [2019-03-29 02:01:50,989 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 19.17/8.83 [2019-03-29 02:01:51,073 INFO L98 LoopCannibalizer]: 2 predicates before loop cannibalization 2 predicates after loop cannibalization 19.17/8.83 [2019-03-29 02:01:51,073 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.9 stem predicates 2 loop predicates 19.17/8.83 [2019-03-29 02:01:51,074 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 11 states and 12 transitions. cyclomatic complexity: 2 Second operand 10 states. 19.17/8.83 [2019-03-29 02:01:51,210 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 11 states and 12 transitions. cyclomatic complexity: 2. Second operand 10 states. Result 12 states and 13 transitions. Complement of second has 10 states. 19.17/8.83 [2019-03-29 02:01:51,210 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 10 states 9 stem states 0 non-accepting loop states 1 accepting loop states 19.17/8.84 [2019-03-29 02:01:51,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. 19.17/8.84 [2019-03-29 02:01:51,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 14 transitions. 19.17/8.84 [2019-03-29 02:01:51,211 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 14 transitions. Stem has 10 letters. Loop has 1 letters. 19.17/8.84 [2019-03-29 02:01:51,211 INFO L116 BuchiAccepts]: Finished buchiAccepts. 19.17/8.84 [2019-03-29 02:01:51,211 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 14 transitions. Stem has 11 letters. Loop has 1 letters. 19.17/8.84 [2019-03-29 02:01:51,211 INFO L116 BuchiAccepts]: Finished buchiAccepts. 19.17/8.84 [2019-03-29 02:01:51,212 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 14 transitions. Stem has 10 letters. Loop has 2 letters. 19.17/8.84 [2019-03-29 02:01:51,212 INFO L116 BuchiAccepts]: Finished buchiAccepts. 19.17/8.84 [2019-03-29 02:01:51,213 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 12 states and 13 transitions. 19.17/8.84 [2019-03-29 02:01:51,214 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 19.17/8.84 [2019-03-29 02:01:51,214 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 12 states to 0 states and 0 transitions. 19.17/8.84 [2019-03-29 02:01:51,214 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 19.17/8.84 [2019-03-29 02:01:51,215 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 19.17/8.84 [2019-03-29 02:01:51,215 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. 19.17/8.84 [2019-03-29 02:01:51,215 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. 19.17/8.84 [2019-03-29 02:01:51,215 INFO L706 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. 19.17/8.84 [2019-03-29 02:01:51,215 INFO L729 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. 19.17/8.84 [2019-03-29 02:01:51,215 INFO L609 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. 19.17/8.84 [2019-03-29 02:01:51,215 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ 19.17/8.84 [2019-03-29 02:01:51,215 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. 19.17/8.84 [2019-03-29 02:01:51,216 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 19.17/8.84 [2019-03-29 02:01:51,216 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true 19.17/8.84 [2019-03-29 02:01:51,222 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 29.03 02:01:51 BasicIcfg 19.17/8.84 [2019-03-29 02:01:51,222 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- 19.17/8.84 [2019-03-29 02:01:51,222 INFO L168 Benchmark]: Toolchain (without parser) took 4558.01 ms. Allocated memory was 649.6 MB in the beginning and 757.1 MB in the end (delta: 107.5 MB). Free memory was 557.8 MB in the beginning and 518.7 MB in the end (delta: 39.1 MB). Peak memory consumption was 146.6 MB. Max. memory is 50.3 GB. 19.17/8.84 [2019-03-29 02:01:51,224 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 649.6 MB. Free memory is still 580.0 MB. There was no memory consumed. Max. memory is 50.3 GB. 19.17/8.84 [2019-03-29 02:01:51,225 INFO L168 Benchmark]: CACSL2BoogieTranslator took 304.45 ms. Allocated memory was 649.6 MB in the beginning and 692.1 MB in the end (delta: 42.5 MB). Free memory was 557.8 MB in the beginning and 658.7 MB in the end (delta: -100.8 MB). Peak memory consumption was 31.6 MB. Max. memory is 50.3 GB. 19.17/8.84 [2019-03-29 02:01:51,225 INFO L168 Benchmark]: Boogie Procedure Inliner took 39.33 ms. Allocated memory is still 692.1 MB. Free memory was 658.7 MB in the beginning and 657.6 MB in the end (delta: 1.1 MB). Peak memory consumption was 1.1 MB. Max. memory is 50.3 GB. 19.17/8.84 [2019-03-29 02:01:51,226 INFO L168 Benchmark]: Boogie Preprocessor took 21.97 ms. Allocated memory is still 692.1 MB. Free memory was 657.6 MB in the beginning and 653.7 MB in the end (delta: 3.9 MB). Peak memory consumption was 3.9 MB. Max. memory is 50.3 GB. 19.17/8.84 [2019-03-29 02:01:51,226 INFO L168 Benchmark]: RCFGBuilder took 268.41 ms. Allocated memory is still 692.1 MB. Free memory was 653.7 MB in the beginning and 637.0 MB in the end (delta: 16.7 MB). Peak memory consumption was 16.7 MB. Max. memory is 50.3 GB. 19.17/8.84 [2019-03-29 02:01:51,227 INFO L168 Benchmark]: BlockEncodingV2 took 93.41 ms. Allocated memory is still 692.1 MB. Free memory was 637.0 MB in the beginning and 631.6 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 50.3 GB. 19.17/8.84 [2019-03-29 02:01:51,227 INFO L168 Benchmark]: TraceAbstraction took 108.59 ms. Allocated memory is still 692.1 MB. Free memory was 630.5 MB in the beginning and 623.8 MB in the end (delta: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 50.3 GB. 19.17/8.84 [2019-03-29 02:01:51,228 INFO L168 Benchmark]: BuchiAutomizer took 3716.59 ms. Allocated memory was 692.1 MB in the beginning and 757.1 MB in the end (delta: 65.0 MB). Free memory was 622.7 MB in the beginning and 518.7 MB in the end (delta: 104.0 MB). Peak memory consumption was 169.0 MB. Max. memory is 50.3 GB. 19.17/8.84 [2019-03-29 02:01:51,232 INFO L337 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### 19.17/8.84 --- Results --- 19.17/8.84 * Results from de.uni_freiburg.informatik.ultimate.plugins.blockencoding: 19.17/8.84 - StatisticsResult: Initial Icfg 19.17/8.84 15 locations, 25 edges 19.17/8.84 - StatisticsResult: Encoded RCFG 19.17/8.84 11 locations, 21 edges 19.17/8.84 * Results from de.uni_freiburg.informatik.ultimate.core: 19.17/8.84 - StatisticsResult: Toolchain Benchmarks 19.17/8.84 Benchmark results are: 19.17/8.84 * CDTParser took 0.16 ms. Allocated memory is still 649.6 MB. Free memory is still 580.0 MB. There was no memory consumed. Max. memory is 50.3 GB. 19.17/8.84 * CACSL2BoogieTranslator took 304.45 ms. Allocated memory was 649.6 MB in the beginning and 692.1 MB in the end (delta: 42.5 MB). Free memory was 557.8 MB in the beginning and 658.7 MB in the end (delta: -100.8 MB). Peak memory consumption was 31.6 MB. Max. memory is 50.3 GB. 19.17/8.84 * Boogie Procedure Inliner took 39.33 ms. Allocated memory is still 692.1 MB. Free memory was 658.7 MB in the beginning and 657.6 MB in the end (delta: 1.1 MB). Peak memory consumption was 1.1 MB. Max. memory is 50.3 GB. 19.17/8.84 * Boogie Preprocessor took 21.97 ms. Allocated memory is still 692.1 MB. Free memory was 657.6 MB in the beginning and 653.7 MB in the end (delta: 3.9 MB). Peak memory consumption was 3.9 MB. Max. memory is 50.3 GB. 19.17/8.84 * RCFGBuilder took 268.41 ms. Allocated memory is still 692.1 MB. Free memory was 653.7 MB in the beginning and 637.0 MB in the end (delta: 16.7 MB). Peak memory consumption was 16.7 MB. Max. memory is 50.3 GB. 19.17/8.84 * BlockEncodingV2 took 93.41 ms. Allocated memory is still 692.1 MB. Free memory was 637.0 MB in the beginning and 631.6 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 50.3 GB. 19.17/8.84 * TraceAbstraction took 108.59 ms. Allocated memory is still 692.1 MB. Free memory was 630.5 MB in the beginning and 623.8 MB in the end (delta: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 50.3 GB. 19.17/8.84 * BuchiAutomizer took 3716.59 ms. Allocated memory was 692.1 MB in the beginning and 757.1 MB in the end (delta: 65.0 MB). Free memory was 622.7 MB in the beginning and 518.7 MB in the end (delta: 104.0 MB). Peak memory consumption was 169.0 MB. Max. memory is 50.3 GB. 19.17/8.84 * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: 19.17/8.84 - AllSpecificationsHoldResult: All specifications hold 19.17/8.84 We were not able to verify any specifiation because the program does not contain any specification. 19.17/8.84 - StatisticsResult: Ultimate Automizer benchmark data 19.17/8.84 CFG has 1 procedures, 11 locations, 0 error locations. SAFE Result, 0.0s OverallTime, 0 OverallIterations, 0 TraceHistogramMax, 0.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: No data available, PredicateUnifierStatistics: No data available, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=11occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 0 LocationsWithAnnotation, 0 PreInvPairs, 0 NumberOfFragments, 0 HoareAnnotationTreeSize, 0 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 0 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: No data available, ReuseStatistics: No data available 19.17/8.84 - StatisticsResult: Constructed decomposition of program 19.17/8.84 Your program was decomposed into 5 terminating modules (3 trivial, 0 deterministic, 2 nondeterministic). One nondeterministic module has affine ranking function -2 * z + 207 and consists of 10 locations. One nondeterministic module has affine ranking function -2 * y + 207 and consists of 10 locations. 3 modules have a trivial ranking function, the largest among these consists of 3 locations. 19.17/8.84 - StatisticsResult: Timing statistics 19.17/8.84 BüchiAutomizer plugin needed 3.6s and 6 iterations. TraceHistogramMax:1. Analysis of lassos took 2.3s. Construction of modules took 0.2s. Büchi inclusion checks took 0.9s. Highest rank in rank-based complementation 3. Minimization of det autom 5. Minimization of nondet autom 0. Automata minimization 0.0s AutomataMinimizationTime, 4 MinimizatonAttempts, 3 StatesRemovedByMinimization, 3 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 19 states and ocurred in iteration 2. Nontrivial modules had stage [2, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 39 SDtfs, 28 SDslu, 0 SDs, 0 SdLazy, 157 SolverSat, 115 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.2s Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc0 concLT0 SILN3 SILU0 SILI0 SILT0 lasso2 LassoPreprocessingBenchmarks: Lassos: inital23 mio100 ax156 hnf94 lsp61 ukn100 mio100 lsp100 div100 bol100 ite100 ukn100 eq180 hnf94 smp100 dnf100 smp100 tf100 neg100 sie111 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: sat Degree: 0 Time: 54ms VariablesStem: 1 VariablesLoop: 5 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 8 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 2 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.9s 19.17/8.84 - TerminationAnalysisResult: Termination proven 19.17/8.84 Buchi Automizer proved that your program is terminating 19.17/8.84 RESULT: Ultimate proved your program to be correct! 19.17/8.84 !SESSION 2019-03-29 02:01:43.429 ----------------------------------------------- 19.17/8.84 eclipse.buildId=unknown 19.17/8.84 java.version=1.8.0_181 19.17/8.84 java.vendor=Oracle Corporation 19.17/8.84 BootLoader constants: OS=linux, ARCH=x86_64, WS=gtk, NL=en_US 19.17/8.84 Framework arguments: -tc ./../AutomizerAndBuchiAutomizerCInlineWithBlockEncoding.xml -s ./../termcomp2017.epf -i /export/starexec/sandbox/benchmark/theBenchmark.c 19.17/8.84 Command-line arguments: -os linux -ws gtk -arch x86_64 -consoleLog -data @user.home/.ultimate -tc ./../AutomizerAndBuchiAutomizerCInlineWithBlockEncoding.xml -s ./../termcomp2017.epf -data /export/starexec/sandbox/tmp -i /export/starexec/sandbox/benchmark/theBenchmark.c 19.17/8.84 19.17/8.84 !ENTRY org.eclipse.core.resources 2 10035 2019-03-29 02:01:51.464 19.17/8.84 !MESSAGE The workspace will exit with unsaved changes in this session. 19.17/8.84 Received shutdown request... 19.17/8.84 Ultimate: 19.17/8.84 GTK+ Version Check 19.17/8.84 EOF