./Ultimate.py --spec /storage/repos/svcomp/c/properties/termination.prp --file /storage/repos/svcomp/c/ldv-regression/ex3_forlist_true-termination.c_true-unreach-call.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 0ed9222f Calling Ultimate with: java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i /storage/repos/svcomp/c/ldv-regression/ex3_forlist_true-termination.c_true-unreach-call.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 35d30cdccac93bddd26c3755048a0b29ad39c8fa ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-0ed9222-m [2019-01-14 03:36:16,175 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-14 03:36:16,176 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-14 03:36:16,200 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-14 03:36:16,200 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-14 03:36:16,202 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-14 03:36:16,203 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-14 03:36:16,205 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-14 03:36:16,207 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-14 03:36:16,208 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-14 03:36:16,208 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-14 03:36:16,209 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-14 03:36:16,210 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-14 03:36:16,211 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-14 03:36:16,212 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-14 03:36:16,212 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-14 03:36:16,213 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-14 03:36:16,215 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-14 03:36:16,217 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-14 03:36:16,219 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-14 03:36:16,220 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-14 03:36:16,221 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-14 03:36:16,224 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-14 03:36:16,224 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-14 03:36:16,224 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-14 03:36:16,225 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-14 03:36:16,226 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-14 03:36:16,227 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-14 03:36:16,228 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-14 03:36:16,229 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-14 03:36:16,230 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-14 03:36:16,230 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-14 03:36:16,231 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-14 03:36:16,231 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-14 03:36:16,232 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-14 03:36:16,233 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-14 03:36:16,233 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2019-01-14 03:36:16,250 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-14 03:36:16,250 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-14 03:36:16,252 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-14 03:36:16,252 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-14 03:36:16,252 INFO L133 SettingsManager]: * Use SBE=true [2019-01-14 03:36:16,252 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-01-14 03:36:16,252 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-01-14 03:36:16,253 INFO L133 SettingsManager]: * Use old map elimination=false [2019-01-14 03:36:16,253 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2019-01-14 03:36:16,253 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2019-01-14 03:36:16,253 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-01-14 03:36:16,253 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-14 03:36:16,254 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-14 03:36:16,254 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-01-14 03:36:16,254 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-14 03:36:16,254 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-14 03:36:16,254 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-14 03:36:16,254 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-01-14 03:36:16,255 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-01-14 03:36:16,255 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-01-14 03:36:16,255 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-14 03:36:16,255 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-14 03:36:16,255 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-01-14 03:36:16,255 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-14 03:36:16,256 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-01-14 03:36:16,256 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-14 03:36:16,256 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-14 03:36:16,256 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-01-14 03:36:16,256 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-14 03:36:16,257 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-14 03:36:16,257 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-01-14 03:36:16,258 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-01-14 03:36:16,258 INFO L133 SettingsManager]: * TransformationType=MODULO_NEIGHBOR Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(F end) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 35d30cdccac93bddd26c3755048a0b29ad39c8fa [2019-01-14 03:36:16,291 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-14 03:36:16,303 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-14 03:36:16,306 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-14 03:36:16,308 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-14 03:36:16,308 INFO L276 PluginConnector]: CDTParser initialized [2019-01-14 03:36:16,309 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/ldv-regression/ex3_forlist_true-termination.c_true-unreach-call.i [2019-01-14 03:36:16,374 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/957e87de7/770248c24ca04b39ad9b290cb945bf05/FLAG16122ee46 [2019-01-14 03:36:16,812 INFO L307 CDTParser]: Found 1 translation units. [2019-01-14 03:36:16,812 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/ldv-regression/ex3_forlist_true-termination.c_true-unreach-call.i [2019-01-14 03:36:16,818 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/957e87de7/770248c24ca04b39ad9b290cb945bf05/FLAG16122ee46 [2019-01-14 03:36:17,169 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/957e87de7/770248c24ca04b39ad9b290cb945bf05 [2019-01-14 03:36:17,174 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-14 03:36:17,176 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-01-14 03:36:17,177 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-14 03:36:17,177 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-14 03:36:17,181 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-14 03:36:17,181 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.01 03:36:17" (1/1) ... [2019-01-14 03:36:17,184 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@34a4b0fc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 03:36:17, skipping insertion in model container [2019-01-14 03:36:17,185 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.01 03:36:17" (1/1) ... [2019-01-14 03:36:17,192 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-14 03:36:17,212 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-14 03:36:17,440 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-14 03:36:17,457 INFO L191 MainTranslator]: Completed pre-run [2019-01-14 03:36:17,491 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-14 03:36:17,531 INFO L195 MainTranslator]: Completed translation [2019-01-14 03:36:17,531 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 03:36:17 WrapperNode [2019-01-14 03:36:17,532 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-14 03:36:17,532 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-14 03:36:17,533 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-14 03:36:17,533 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-14 03:36:17,545 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 03:36:17" (1/1) ... [2019-01-14 03:36:17,557 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 03:36:17" (1/1) ... [2019-01-14 03:36:17,612 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-14 03:36:17,614 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-14 03:36:17,614 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-14 03:36:17,615 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-14 03:36:17,688 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 03:36:17" (1/1) ... [2019-01-14 03:36:17,689 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 03:36:17" (1/1) ... [2019-01-14 03:36:17,694 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 03:36:17" (1/1) ... [2019-01-14 03:36:17,696 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 03:36:17" (1/1) ... [2019-01-14 03:36:17,718 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 03:36:17" (1/1) ... [2019-01-14 03:36:17,726 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 03:36:17" (1/1) ... [2019-01-14 03:36:17,728 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 03:36:17" (1/1) ... [2019-01-14 03:36:17,734 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-14 03:36:17,735 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-14 03:36:17,735 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-14 03:36:17,735 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-14 03:36:17,738 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 03:36:17" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 03:36:17,805 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-01-14 03:36:17,806 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2019-01-14 03:36:17,806 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-01-14 03:36:17,806 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-01-14 03:36:17,806 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-01-14 03:36:17,806 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-01-14 03:36:17,806 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-14 03:36:17,807 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-14 03:36:17,808 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-01-14 03:36:18,505 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-14 03:36:18,506 INFO L286 CfgBuilder]: Removed 27 assue(true) statements. [2019-01-14 03:36:18,507 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 03:36:18 BoogieIcfgContainer [2019-01-14 03:36:18,507 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-14 03:36:18,508 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-01-14 03:36:18,508 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-01-14 03:36:18,512 INFO L276 PluginConnector]: BuchiAutomizer initialized [2019-01-14 03:36:18,513 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-14 03:36:18,513 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 14.01 03:36:17" (1/3) ... [2019-01-14 03:36:18,514 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@4c4eb6b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 14.01 03:36:18, skipping insertion in model container [2019-01-14 03:36:18,514 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-14 03:36:18,514 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 03:36:17" (2/3) ... [2019-01-14 03:36:18,514 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@4c4eb6b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 14.01 03:36:18, skipping insertion in model container [2019-01-14 03:36:18,515 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-14 03:36:18,515 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 03:36:18" (3/3) ... [2019-01-14 03:36:18,516 INFO L375 chiAutomizerObserver]: Analyzing ICFG ex3_forlist_true-termination.c_true-unreach-call.i [2019-01-14 03:36:18,573 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-14 03:36:18,574 INFO L374 BuchiCegarLoop]: Interprodecural is true [2019-01-14 03:36:18,574 INFO L375 BuchiCegarLoop]: Hoare is false [2019-01-14 03:36:18,574 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-01-14 03:36:18,575 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-14 03:36:18,575 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-14 03:36:18,575 INFO L379 BuchiCegarLoop]: Difference is false [2019-01-14 03:36:18,575 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-14 03:36:18,575 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-01-14 03:36:18,592 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 33 states. [2019-01-14 03:36:18,619 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 20 [2019-01-14 03:36:18,619 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 03:36:18,619 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 03:36:18,627 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2019-01-14 03:36:18,627 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-01-14 03:36:18,627 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2019-01-14 03:36:18,628 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 33 states. [2019-01-14 03:36:18,631 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 20 [2019-01-14 03:36:18,631 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 03:36:18,631 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 03:36:18,631 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2019-01-14 03:36:18,632 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-01-14 03:36:18,640 INFO L794 eck$LassoCheckResult]: Stem: 28#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];call ~#pp~0.base, ~#pp~0.offset := #Ultimate.allocOnStack(8);call write~init~$Pointer$(0, 0, ~#pp~0.base, ~#pp~0.offset, 4);call write~init~$Pointer$(0, 0, ~#pp~0.base, 4 + ~#pp~0.offset, 4);call ~#pstate~0.base, ~#pstate~0.offset := #Ultimate.allocOnStack(8);call write~init~int(0, ~#pstate~0.base, ~#pstate~0.offset, 4);call write~init~int(0, ~#pstate~0.base, 4 + ~#pstate~0.offset, 4);~counter~0 := 1; 4#L-1true havoc main_#res;havoc main_#t~ret7.base, main_#t~ret7.offset, main_#t~ret8.base, main_#t~ret8.offset, main_~a~0.base, main_~a~0.offset, main_~b~0.base, main_~b~0.offset;havoc main_~a~0.base, main_~a~0.offset;havoc main_~b~0.base, main_~b~0.offset;havoc init_#t~post0, init_~i~0;havoc init_~i~0;init_~i~0 := 0; 31#L17-3true [2019-01-14 03:36:18,641 INFO L796 eck$LassoCheckResult]: Loop: 31#L17-3true assume !!(init_~i~0 < 2);call write~$Pointer$(0, 0, ~#pp~0.base, ~#pp~0.offset + 4 * init_~i~0, 4);call write~int(0, ~#pstate~0.base, ~#pstate~0.offset + 4 * init_~i~0, 4); 17#L17-2true init_#t~post0 := init_~i~0;init_~i~0 := 1 + init_#t~post0;havoc init_#t~post0; 31#L17-3true [2019-01-14 03:36:18,647 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 03:36:18,648 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2019-01-14 03:36:18,650 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 03:36:18,651 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 03:36:18,693 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 03:36:18,693 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 03:36:18,694 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 03:36:18,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 03:36:18,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 03:36:18,782 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 03:36:18,782 INFO L82 PathProgramCache]: Analyzing trace with hash 1283, now seen corresponding path program 1 times [2019-01-14 03:36:18,782 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 03:36:18,782 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 03:36:18,783 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 03:36:18,783 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 03:36:18,784 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 03:36:18,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 03:36:18,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 03:36:18,825 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 03:36:18,826 INFO L82 PathProgramCache]: Analyzing trace with hash 925765, now seen corresponding path program 1 times [2019-01-14 03:36:18,826 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 03:36:18,826 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 03:36:18,828 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 03:36:18,828 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 03:36:18,828 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 03:36:18,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 03:36:18,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 03:36:19,124 WARN L181 SmtUtils]: Spent 205.00 ms on a formula simplification that was a NOOP. DAG size: 66 [2019-01-14 03:36:19,156 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-14 03:36:19,178 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-14 03:36:19,320 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-14 03:36:19,321 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:185, output treesize:186 [2019-01-14 03:36:19,624 WARN L181 SmtUtils]: Spent 302.00 ms on a formula simplification that was a NOOP. DAG size: 63 [2019-01-14 03:36:19,811 WARN L181 SmtUtils]: Spent 185.00 ms on a formula simplification that was a NOOP. DAG size: 61 [2019-01-14 03:36:20,075 WARN L181 SmtUtils]: Spent 262.00 ms on a formula simplification that was a NOOP. DAG size: 61 [2019-01-14 03:36:20,086 INFO L216 LassoAnalysis]: Preferences: [2019-01-14 03:36:20,087 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-14 03:36:20,087 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-14 03:36:20,088 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-14 03:36:20,088 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-14 03:36:20,088 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 03:36:20,088 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-14 03:36:20,088 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-14 03:36:20,088 INFO L131 ssoRankerPreferences]: Filename of dumped script: ex3_forlist_true-termination.c_true-unreach-call.i_Iteration1_Lasso [2019-01-14 03:36:20,089 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-14 03:36:20,089 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-14 03:36:20,111 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:36:20,116 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:36:20,119 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:36:20,124 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:36:20,132 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:36:20,142 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:36:20,151 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:36:20,170 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:36:20,176 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:36:20,741 WARN L181 SmtUtils]: Spent 346.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 50 [2019-01-14 03:36:21,064 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:36:21,068 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:36:21,083 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:36:21,085 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:36:21,088 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:36:21,504 WARN L181 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 19 DAG size of output: 19 [2019-01-14 03:36:21,709 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-14 03:36:21,713 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-14 03:36:21,715 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 03:36:21,717 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 03:36:21,717 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 03:36:21,718 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:36:21,718 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 03:36:21,719 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 03:36:21,721 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 03:36:21,721 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 03:36:21,723 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:36:21,724 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 03:36:21,724 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 03:36:21,725 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 03:36:21,725 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:36:21,725 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 03:36:21,725 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 03:36:21,726 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 03:36:21,726 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 03:36:21,727 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:36:21,727 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 03:36:21,728 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 03:36:21,728 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 03:36:21,728 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:36:21,728 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 03:36:21,728 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 03:36:21,729 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 03:36:21,729 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 03:36:21,730 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:36:21,731 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 03:36:21,731 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 03:36:21,731 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 03:36:21,731 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:36:21,732 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 03:36:21,732 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 03:36:21,732 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 03:36:21,733 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 03:36:21,733 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:36:21,734 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 03:36:21,734 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 03:36:21,734 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 03:36:21,735 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:36:21,735 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 03:36:21,735 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 03:36:21,735 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 03:36:21,736 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 03:36:21,736 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:36:21,737 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 03:36:21,737 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 03:36:21,738 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:36:21,738 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 03:36:21,738 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 03:36:21,740 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 03:36:21,741 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 03:36:21,744 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:36:21,745 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 03:36:21,746 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 03:36:21,746 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 03:36:21,746 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:36:21,746 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 03:36:21,746 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 03:36:21,747 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 03:36:21,747 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 03:36:21,748 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:36:21,748 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 03:36:21,749 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 03:36:21,749 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 03:36:21,749 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:36:21,749 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 03:36:21,750 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 03:36:21,750 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 03:36:21,750 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 03:36:21,751 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:36:21,752 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 03:36:21,752 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 03:36:21,752 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:36:21,753 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 03:36:21,753 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 03:36:21,755 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 03:36:21,755 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 03:36:21,761 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:36:21,762 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 03:36:21,762 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 03:36:21,763 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:36:21,763 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 03:36:21,763 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 03:36:21,766 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 03:36:21,766 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 03:36:21,773 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:36:21,774 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 03:36:21,774 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 03:36:21,775 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:36:21,775 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 03:36:21,775 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 03:36:21,777 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 03:36:21,777 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 03:36:21,782 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:36:21,782 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 03:36:21,783 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 03:36:21,783 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:36:21,783 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 03:36:21,783 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 03:36:21,786 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 03:36:21,786 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 03:36:21,793 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:36:21,793 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 03:36:21,794 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 03:36:21,794 INFO L205 nArgumentSynthesizer]: 4 stem disjuncts [2019-01-14 03:36:21,794 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 03:36:21,795 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 03:36:21,799 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2019-01-14 03:36:21,799 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 03:36:21,817 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:36:21,817 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 03:36:21,818 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 03:36:21,818 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 03:36:21,818 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:36:21,819 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 03:36:21,819 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 03:36:21,819 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 03:36:21,819 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 03:36:21,821 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:36:21,821 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 03:36:21,821 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 03:36:21,822 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:36:21,822 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 03:36:21,822 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 03:36:21,824 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 03:36:21,824 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 03:36:21,827 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:36:21,828 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 03:36:21,831 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 03:36:21,831 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 03:36:21,832 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:36:21,832 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 03:36:21,832 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 03:36:21,832 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 03:36:21,833 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 03:36:21,836 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:36:21,836 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 03:36:21,840 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 03:36:21,840 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:36:21,840 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 03:36:21,840 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 03:36:21,842 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 03:36:21,843 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 03:36:21,854 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:36:21,854 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 03:36:21,858 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 03:36:21,858 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 03:36:21,858 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:36:21,858 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 03:36:21,859 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 03:36:21,859 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 03:36:21,859 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 03:36:21,864 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:36:21,865 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 03:36:21,865 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 03:36:21,865 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:36:21,866 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 03:36:21,869 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 03:36:21,870 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 03:36:21,870 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 03:36:21,887 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:36:21,887 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 03:36:21,893 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 03:36:21,893 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:36:21,893 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 03:36:21,893 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 03:36:21,895 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 03:36:21,895 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 03:36:21,908 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:36:21,909 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 03:36:21,910 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 03:36:21,910 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:36:21,910 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 03:36:21,910 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 03:36:21,913 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 03:36:21,913 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 03:36:21,978 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-14 03:36:22,065 INFO L443 ModelExtractionUtils]: Simplification made 7 calls to the SMT solver. [2019-01-14 03:36:22,066 INFO L444 ModelExtractionUtils]: 13 out of 19 variables were initially zero. Simplification set additionally 3 variables to zero. [2019-01-14 03:36:22,068 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-14 03:36:22,070 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-01-14 03:36:22,070 INFO L518 LassoAnalysis]: Proved termination. [2019-01-14 03:36:22,073 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ~#pp~0.base)_1, ULTIMATE.start_init_~i~0) = 1*v_rep(select #length ~#pp~0.base)_1 - 3*ULTIMATE.start_init_~i~0 Supporting invariants [] [2019-01-14 03:36:22,164 INFO L297 tatePredicateManager]: 6 out of 6 supporting invariants were superfluous and have been removed [2019-01-14 03:36:22,171 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2019-01-14 03:36:22,198 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 03:36:22,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 03:36:22,233 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 03:36:22,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 03:36:22,259 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 03:36:22,308 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 03:36:22,323 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2019-01-14 03:36:22,324 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 33 states. Second operand 3 states. [2019-01-14 03:36:22,469 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 33 states.. Second operand 3 states. Result 93 states and 136 transitions. Complement of second has 7 states. [2019-01-14 03:36:22,470 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2019-01-14 03:36:22,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-01-14 03:36:22,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 92 transitions. [2019-01-14 03:36:22,474 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 92 transitions. Stem has 2 letters. Loop has 2 letters. [2019-01-14 03:36:22,475 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 03:36:22,475 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 92 transitions. Stem has 4 letters. Loop has 2 letters. [2019-01-14 03:36:22,475 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 03:36:22,475 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 92 transitions. Stem has 2 letters. Loop has 4 letters. [2019-01-14 03:36:22,476 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 03:36:22,476 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 93 states and 136 transitions. [2019-01-14 03:36:22,483 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 16 [2019-01-14 03:36:22,488 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 93 states to 28 states and 37 transitions. [2019-01-14 03:36:22,489 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 25 [2019-01-14 03:36:22,490 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 26 [2019-01-14 03:36:22,490 INFO L73 IsDeterministic]: Start isDeterministic. Operand 28 states and 37 transitions. [2019-01-14 03:36:22,491 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-14 03:36:22,491 INFO L706 BuchiCegarLoop]: Abstraction has 28 states and 37 transitions. [2019-01-14 03:36:22,505 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states and 37 transitions. [2019-01-14 03:36:22,513 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2019-01-14 03:36:22,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2019-01-14 03:36:22,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 37 transitions. [2019-01-14 03:36:22,515 INFO L729 BuchiCegarLoop]: Abstraction has 28 states and 37 transitions. [2019-01-14 03:36:22,516 INFO L609 BuchiCegarLoop]: Abstraction has 28 states and 37 transitions. [2019-01-14 03:36:22,516 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2019-01-14 03:36:22,516 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 28 states and 37 transitions. [2019-01-14 03:36:22,517 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 16 [2019-01-14 03:36:22,517 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 03:36:22,517 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 03:36:22,518 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-14 03:36:22,518 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-01-14 03:36:22,518 INFO L794 eck$LassoCheckResult]: Stem: 216#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];call ~#pp~0.base, ~#pp~0.offset := #Ultimate.allocOnStack(8);call write~init~$Pointer$(0, 0, ~#pp~0.base, ~#pp~0.offset, 4);call write~init~$Pointer$(0, 0, ~#pp~0.base, 4 + ~#pp~0.offset, 4);call ~#pstate~0.base, ~#pstate~0.offset := #Ultimate.allocOnStack(8);call write~init~int(0, ~#pstate~0.base, ~#pstate~0.offset, 4);call write~init~int(0, ~#pstate~0.base, 4 + ~#pstate~0.offset, 4);~counter~0 := 1; 191#L-1 havoc main_#res;havoc main_#t~ret7.base, main_#t~ret7.offset, main_#t~ret8.base, main_#t~ret8.offset, main_~a~0.base, main_~a~0.offset, main_~b~0.base, main_~b~0.offset;havoc main_~a~0.base, main_~a~0.offset;havoc main_~b~0.base, main_~b~0.offset;havoc init_#t~post0, init_~i~0;havoc init_~i~0;init_~i~0 := 0; 192#L17-3 assume !(init_~i~0 < 2); 205#L15 malloc_#in~size := 4;havoc malloc_#res.base, malloc_#res.offset;havoc malloc_#t~post6, malloc_~size;malloc_~size := malloc_#in~size;malloc_#t~post6 := ~counter~0;~counter~0 := 1 + malloc_#t~post6;malloc_#res.base, malloc_#res.offset := 0, malloc_#t~post6;havoc malloc_#t~post6; 189#L47 main_#t~ret7.base, main_#t~ret7.offset := malloc_#res.base, malloc_#res.offset;main_~a~0.base, main_~a~0.offset := main_#t~ret7.base, main_#t~ret7.offset;havoc main_#t~ret7.base, main_#t~ret7.offset;malloc_#in~size := 4;havoc malloc_#res.base, malloc_#res.offset;havoc malloc_#t~post6, malloc_~size;malloc_~size := malloc_#in~size;malloc_#t~post6 := ~counter~0;~counter~0 := 1 + malloc_#t~post6;malloc_#res.base, malloc_#res.offset := 0, malloc_#t~post6;havoc malloc_#t~post6; 190#L47-1 main_#t~ret8.base, main_#t~ret8.offset := malloc_#res.base, malloc_#res.offset;main_~b~0.base, main_~b~0.offset := main_#t~ret8.base, main_#t~ret8.offset;havoc main_#t~ret8.base, main_#t~ret8.offset; 204#L57 assume !((main_~a~0.base == 0 && main_~a~0.offset == 0) || (main_~b~0.base == 0 && main_~b~0.offset == 0));f_#in~pointer.base, f_#in~pointer.offset := main_~a~0.base, main_~a~0.offset;havoc f_#t~mem2.base, f_#t~mem2.offset, f_#t~post1, f_~pointer.base, f_~pointer.offset, f_~i~1;f_~pointer.base, f_~pointer.offset := f_#in~pointer.base, f_#in~pointer.offset;havoc f_~i~1;f_~i~1 := 0; 195#L25-3 [2019-01-14 03:36:22,519 INFO L796 eck$LassoCheckResult]: Loop: 195#L25-3 assume !!(f_~i~1 < 2);call f_#t~mem2.base, f_#t~mem2.offset := read~$Pointer$(~#pp~0.base, ~#pp~0.offset + 4 * f_~i~1, 4); 196#L26 assume !(f_#t~mem2.base == 0 && f_#t~mem2.offset == 0);havoc f_#t~mem2.base, f_#t~mem2.offset; 200#L25-2 f_#t~post1 := f_~i~1;f_~i~1 := 1 + f_#t~post1;havoc f_#t~post1; 195#L25-3 [2019-01-14 03:36:22,519 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 03:36:22,519 INFO L82 PathProgramCache]: Analyzing trace with hash 1807951404, now seen corresponding path program 1 times [2019-01-14 03:36:22,519 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 03:36:22,519 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 03:36:22,520 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 03:36:22,520 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 03:36:22,520 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 03:36:22,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 03:36:22,605 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 03:36:22,607 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 03:36:22,607 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-14 03:36:22,609 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-01-14 03:36:22,609 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 03:36:22,609 INFO L82 PathProgramCache]: Analyzing trace with hash 62722, now seen corresponding path program 1 times [2019-01-14 03:36:22,609 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 03:36:22,609 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 03:36:22,610 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 03:36:22,610 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 03:36:22,610 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 03:36:22,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 03:36:22,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 03:36:22,808 WARN L181 SmtUtils]: Spent 137.00 ms on a formula simplification that was a NOOP. DAG size: 34 [2019-01-14 03:36:22,811 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 03:36:22,811 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 03:36:22,812 INFO L87 Difference]: Start difference. First operand 28 states and 37 transitions. cyclomatic complexity: 14 Second operand 3 states. [2019-01-14 03:36:22,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 03:36:22,840 INFO L93 Difference]: Finished difference Result 29 states and 37 transitions. [2019-01-14 03:36:22,842 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-14 03:36:22,842 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 29 states and 37 transitions. [2019-01-14 03:36:22,844 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 16 [2019-01-14 03:36:22,844 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 29 states to 29 states and 37 transitions. [2019-01-14 03:36:22,844 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 26 [2019-01-14 03:36:22,845 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 26 [2019-01-14 03:36:22,845 INFO L73 IsDeterministic]: Start isDeterministic. Operand 29 states and 37 transitions. [2019-01-14 03:36:22,845 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-14 03:36:22,845 INFO L706 BuchiCegarLoop]: Abstraction has 29 states and 37 transitions. [2019-01-14 03:36:22,846 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states and 37 transitions. [2019-01-14 03:36:22,848 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 28. [2019-01-14 03:36:22,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2019-01-14 03:36:22,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 36 transitions. [2019-01-14 03:36:22,849 INFO L729 BuchiCegarLoop]: Abstraction has 28 states and 36 transitions. [2019-01-14 03:36:22,849 INFO L609 BuchiCegarLoop]: Abstraction has 28 states and 36 transitions. [2019-01-14 03:36:22,850 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2019-01-14 03:36:22,854 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 28 states and 36 transitions. [2019-01-14 03:36:22,854 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 16 [2019-01-14 03:36:22,855 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 03:36:22,855 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 03:36:22,855 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 03:36:22,855 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-01-14 03:36:22,856 INFO L794 eck$LassoCheckResult]: Stem: 279#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];call ~#pp~0.base, ~#pp~0.offset := #Ultimate.allocOnStack(8);call write~init~$Pointer$(0, 0, ~#pp~0.base, ~#pp~0.offset, 4);call write~init~$Pointer$(0, 0, ~#pp~0.base, 4 + ~#pp~0.offset, 4);call ~#pstate~0.base, ~#pstate~0.offset := #Ultimate.allocOnStack(8);call write~init~int(0, ~#pstate~0.base, ~#pstate~0.offset, 4);call write~init~int(0, ~#pstate~0.base, 4 + ~#pstate~0.offset, 4);~counter~0 := 1; 254#L-1 havoc main_#res;havoc main_#t~ret7.base, main_#t~ret7.offset, main_#t~ret8.base, main_#t~ret8.offset, main_~a~0.base, main_~a~0.offset, main_~b~0.base, main_~b~0.offset;havoc main_~a~0.base, main_~a~0.offset;havoc main_~b~0.base, main_~b~0.offset;havoc init_#t~post0, init_~i~0;havoc init_~i~0;init_~i~0 := 0; 255#L17-3 assume !!(init_~i~0 < 2);call write~$Pointer$(0, 0, ~#pp~0.base, ~#pp~0.offset + 4 * init_~i~0, 4);call write~int(0, ~#pstate~0.base, ~#pstate~0.offset + 4 * init_~i~0, 4); 268#L17-2 init_#t~post0 := init_~i~0;init_~i~0 := 1 + init_#t~post0;havoc init_#t~post0; 269#L17-3 assume !(init_~i~0 < 2); 270#L15 malloc_#in~size := 4;havoc malloc_#res.base, malloc_#res.offset;havoc malloc_#t~post6, malloc_~size;malloc_~size := malloc_#in~size;malloc_#t~post6 := ~counter~0;~counter~0 := 1 + malloc_#t~post6;malloc_#res.base, malloc_#res.offset := 0, malloc_#t~post6;havoc malloc_#t~post6; 252#L47 main_#t~ret7.base, main_#t~ret7.offset := malloc_#res.base, malloc_#res.offset;main_~a~0.base, main_~a~0.offset := main_#t~ret7.base, main_#t~ret7.offset;havoc main_#t~ret7.base, main_#t~ret7.offset;malloc_#in~size := 4;havoc malloc_#res.base, malloc_#res.offset;havoc malloc_#t~post6, malloc_~size;malloc_~size := malloc_#in~size;malloc_#t~post6 := ~counter~0;~counter~0 := 1 + malloc_#t~post6;malloc_#res.base, malloc_#res.offset := 0, malloc_#t~post6;havoc malloc_#t~post6; 253#L47-1 main_#t~ret8.base, main_#t~ret8.offset := malloc_#res.base, malloc_#res.offset;main_~b~0.base, main_~b~0.offset := main_#t~ret8.base, main_#t~ret8.offset;havoc main_#t~ret8.base, main_#t~ret8.offset; 267#L57 assume !((main_~a~0.base == 0 && main_~a~0.offset == 0) || (main_~b~0.base == 0 && main_~b~0.offset == 0));f_#in~pointer.base, f_#in~pointer.offset := main_~a~0.base, main_~a~0.offset;havoc f_#t~mem2.base, f_#t~mem2.offset, f_#t~post1, f_~pointer.base, f_~pointer.offset, f_~i~1;f_~pointer.base, f_~pointer.offset := f_#in~pointer.base, f_#in~pointer.offset;havoc f_~i~1;f_~i~1 := 0; 256#L25-3 [2019-01-14 03:36:22,856 INFO L796 eck$LassoCheckResult]: Loop: 256#L25-3 assume !!(f_~i~1 < 2);call f_#t~mem2.base, f_#t~mem2.offset := read~$Pointer$(~#pp~0.base, ~#pp~0.offset + 4 * f_~i~1, 4); 257#L26 assume !(f_#t~mem2.base == 0 && f_#t~mem2.offset == 0);havoc f_#t~mem2.base, f_#t~mem2.offset; 264#L25-2 f_#t~post1 := f_~i~1;f_~i~1 := 1 + f_#t~post1;havoc f_#t~post1; 256#L25-3 [2019-01-14 03:36:22,856 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 03:36:22,856 INFO L82 PathProgramCache]: Analyzing trace with hash -369325334, now seen corresponding path program 1 times [2019-01-14 03:36:22,856 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 03:36:22,857 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 03:36:22,860 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 03:36:22,860 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 03:36:22,860 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 03:36:22,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 03:36:23,010 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 03:36:23,010 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 03:36:23,010 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-14 03:36:23,027 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 03:36:23,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 03:36:23,053 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 03:36:23,083 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 03:36:23,102 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 03:36:23,102 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2019-01-14 03:36:23,102 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-01-14 03:36:23,102 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 03:36:23,103 INFO L82 PathProgramCache]: Analyzing trace with hash 62722, now seen corresponding path program 2 times [2019-01-14 03:36:23,103 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 03:36:23,103 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 03:36:23,104 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 03:36:23,104 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 03:36:23,105 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 03:36:23,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 03:36:23,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 03:36:23,276 WARN L181 SmtUtils]: Spent 163.00 ms on a formula simplification that was a NOOP. DAG size: 37 [2019-01-14 03:36:23,315 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-14 03:36:23,315 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-01-14 03:36:23,316 INFO L87 Difference]: Start difference. First operand 28 states and 36 transitions. cyclomatic complexity: 13 Second operand 5 states. [2019-01-14 03:36:23,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 03:36:23,337 INFO L93 Difference]: Finished difference Result 30 states and 38 transitions. [2019-01-14 03:36:23,339 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-14 03:36:23,339 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 30 states and 38 transitions. [2019-01-14 03:36:23,340 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 16 [2019-01-14 03:36:23,341 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 30 states to 30 states and 38 transitions. [2019-01-14 03:36:23,341 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 26 [2019-01-14 03:36:23,341 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 26 [2019-01-14 03:36:23,342 INFO L73 IsDeterministic]: Start isDeterministic. Operand 30 states and 38 transitions. [2019-01-14 03:36:23,342 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-14 03:36:23,342 INFO L706 BuchiCegarLoop]: Abstraction has 30 states and 38 transitions. [2019-01-14 03:36:23,342 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states and 38 transitions. [2019-01-14 03:36:23,344 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2019-01-14 03:36:23,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2019-01-14 03:36:23,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 38 transitions. [2019-01-14 03:36:23,345 INFO L729 BuchiCegarLoop]: Abstraction has 30 states and 38 transitions. [2019-01-14 03:36:23,346 INFO L609 BuchiCegarLoop]: Abstraction has 30 states and 38 transitions. [2019-01-14 03:36:23,346 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2019-01-14 03:36:23,346 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 30 states and 38 transitions. [2019-01-14 03:36:23,347 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 16 [2019-01-14 03:36:23,347 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 03:36:23,347 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 03:36:23,347 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 03:36:23,347 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-01-14 03:36:23,348 INFO L794 eck$LassoCheckResult]: Stem: 369#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];call ~#pp~0.base, ~#pp~0.offset := #Ultimate.allocOnStack(8);call write~init~$Pointer$(0, 0, ~#pp~0.base, ~#pp~0.offset, 4);call write~init~$Pointer$(0, 0, ~#pp~0.base, 4 + ~#pp~0.offset, 4);call ~#pstate~0.base, ~#pstate~0.offset := #Ultimate.allocOnStack(8);call write~init~int(0, ~#pstate~0.base, ~#pstate~0.offset, 4);call write~init~int(0, ~#pstate~0.base, 4 + ~#pstate~0.offset, 4);~counter~0 := 1; 344#L-1 havoc main_#res;havoc main_#t~ret7.base, main_#t~ret7.offset, main_#t~ret8.base, main_#t~ret8.offset, main_~a~0.base, main_~a~0.offset, main_~b~0.base, main_~b~0.offset;havoc main_~a~0.base, main_~a~0.offset;havoc main_~b~0.base, main_~b~0.offset;havoc init_#t~post0, init_~i~0;havoc init_~i~0;init_~i~0 := 0; 345#L17-3 assume !!(init_~i~0 < 2);call write~$Pointer$(0, 0, ~#pp~0.base, ~#pp~0.offset + 4 * init_~i~0, 4);call write~int(0, ~#pstate~0.base, ~#pstate~0.offset + 4 * init_~i~0, 4); 358#L17-2 init_#t~post0 := init_~i~0;init_~i~0 := 1 + init_#t~post0;havoc init_#t~post0; 359#L17-3 assume !!(init_~i~0 < 2);call write~$Pointer$(0, 0, ~#pp~0.base, ~#pp~0.offset + 4 * init_~i~0, 4);call write~int(0, ~#pstate~0.base, ~#pstate~0.offset + 4 * init_~i~0, 4); 370#L17-2 init_#t~post0 := init_~i~0;init_~i~0 := 1 + init_#t~post0;havoc init_#t~post0; 371#L17-3 assume !(init_~i~0 < 2); 360#L15 malloc_#in~size := 4;havoc malloc_#res.base, malloc_#res.offset;havoc malloc_#t~post6, malloc_~size;malloc_~size := malloc_#in~size;malloc_#t~post6 := ~counter~0;~counter~0 := 1 + malloc_#t~post6;malloc_#res.base, malloc_#res.offset := 0, malloc_#t~post6;havoc malloc_#t~post6; 342#L47 main_#t~ret7.base, main_#t~ret7.offset := malloc_#res.base, malloc_#res.offset;main_~a~0.base, main_~a~0.offset := main_#t~ret7.base, main_#t~ret7.offset;havoc main_#t~ret7.base, main_#t~ret7.offset;malloc_#in~size := 4;havoc malloc_#res.base, malloc_#res.offset;havoc malloc_#t~post6, malloc_~size;malloc_~size := malloc_#in~size;malloc_#t~post6 := ~counter~0;~counter~0 := 1 + malloc_#t~post6;malloc_#res.base, malloc_#res.offset := 0, malloc_#t~post6;havoc malloc_#t~post6; 343#L47-1 main_#t~ret8.base, main_#t~ret8.offset := malloc_#res.base, malloc_#res.offset;main_~b~0.base, main_~b~0.offset := main_#t~ret8.base, main_#t~ret8.offset;havoc main_#t~ret8.base, main_#t~ret8.offset; 357#L57 assume !((main_~a~0.base == 0 && main_~a~0.offset == 0) || (main_~b~0.base == 0 && main_~b~0.offset == 0));f_#in~pointer.base, f_#in~pointer.offset := main_~a~0.base, main_~a~0.offset;havoc f_#t~mem2.base, f_#t~mem2.offset, f_#t~post1, f_~pointer.base, f_~pointer.offset, f_~i~1;f_~pointer.base, f_~pointer.offset := f_#in~pointer.base, f_#in~pointer.offset;havoc f_~i~1;f_~i~1 := 0; 346#L25-3 [2019-01-14 03:36:23,348 INFO L796 eck$LassoCheckResult]: Loop: 346#L25-3 assume !!(f_~i~1 < 2);call f_#t~mem2.base, f_#t~mem2.offset := read~$Pointer$(~#pp~0.base, ~#pp~0.offset + 4 * f_~i~1, 4); 347#L26 assume !(f_#t~mem2.base == 0 && f_#t~mem2.offset == 0);havoc f_#t~mem2.base, f_#t~mem2.offset; 354#L25-2 f_#t~post1 := f_~i~1;f_~i~1 := 1 + f_#t~post1;havoc f_#t~post1; 346#L25-3 [2019-01-14 03:36:23,348 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 03:36:23,348 INFO L82 PathProgramCache]: Analyzing trace with hash -1083197400, now seen corresponding path program 2 times [2019-01-14 03:36:23,348 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 03:36:23,349 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 03:36:23,349 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 03:36:23,349 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 03:36:23,350 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 03:36:23,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 03:36:23,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 03:36:23,414 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 03:36:23,418 INFO L82 PathProgramCache]: Analyzing trace with hash 62722, now seen corresponding path program 3 times [2019-01-14 03:36:23,418 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 03:36:23,418 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 03:36:23,419 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 03:36:23,419 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 03:36:23,419 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 03:36:23,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 03:36:23,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 03:36:23,433 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 03:36:23,435 INFO L82 PathProgramCache]: Analyzing trace with hash -1444415621, now seen corresponding path program 1 times [2019-01-14 03:36:23,435 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 03:36:23,435 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 03:36:23,436 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 03:36:23,437 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 03:36:23,437 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 03:36:23,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 03:36:23,690 WARN L181 SmtUtils]: Spent 113.00 ms on a formula simplification that was a NOOP. DAG size: 13 [2019-01-14 03:36:23,894 WARN L181 SmtUtils]: Spent 170.00 ms on a formula simplification. DAG size of input: 27 DAG size of output: 21 [2019-01-14 03:36:24,053 WARN L181 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 36 [2019-01-14 03:36:24,451 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 03:36:24,452 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 03:36:24,452 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-14 03:36:24,467 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 03:36:24,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 03:36:24,506 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 03:36:24,540 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 14 [2019-01-14 03:36:24,674 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 1 [2019-01-14 03:36:24,675 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 03:36:24,700 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 03:36:24,801 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 03:36:24,802 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:18, output treesize:11 [2019-01-14 03:36:24,862 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 36 [2019-01-14 03:36:24,868 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2019-01-14 03:36:24,868 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 03:36:24,886 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 36 [2019-01-14 03:36:24,907 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 1 [2019-01-14 03:36:24,907 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-14 03:36:24,936 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 03:36:24,938 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-14 03:36:24,961 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 36 [2019-01-14 03:36:24,966 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2019-01-14 03:36:24,966 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-01-14 03:36:24,985 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 36 [2019-01-14 03:36:25,007 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 1 [2019-01-14 03:36:25,007 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-01-14 03:36:25,079 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 03:36:25,082 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-14 03:36:25,118 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-14 03:36:25,119 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 2 variables, input treesize:108, output treesize:36 [2019-01-14 03:36:25,206 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 41 [2019-01-14 03:36:25,210 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 03:36:25,212 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 27 [2019-01-14 03:36:25,213 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 03:36:25,238 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 43 [2019-01-14 03:36:25,265 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 1 [2019-01-14 03:36:25,266 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-14 03:36:25,297 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 03:36:25,304 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-14 03:36:25,382 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 41 [2019-01-14 03:36:25,386 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 03:36:25,387 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 27 [2019-01-14 03:36:25,389 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-01-14 03:36:25,420 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 43 [2019-01-14 03:36:25,426 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 1 [2019-01-14 03:36:25,426 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-01-14 03:36:25,433 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 03:36:25,438 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-14 03:36:25,457 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-14 03:36:25,457 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 5 variables, input treesize:122, output treesize:46 [2019-01-14 03:36:25,833 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 18 [2019-01-14 03:36:25,837 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 03:36:25,838 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 10 [2019-01-14 03:36:25,839 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 03:36:25,843 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 03:36:25,855 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 18 [2019-01-14 03:36:25,862 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 03:36:25,863 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 10 [2019-01-14 03:36:25,864 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-14 03:36:25,868 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 03:36:25,873 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-14 03:36:25,874 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:50, output treesize:7 [2019-01-14 03:36:25,894 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 03:36:25,913 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 03:36:25,913 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 18 [2019-01-14 03:36:25,973 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-01-14 03:36:25,973 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=297, Unknown=0, NotChecked=0, Total=342 [2019-01-14 03:36:25,974 INFO L87 Difference]: Start difference. First operand 30 states and 38 transitions. cyclomatic complexity: 13 Second operand 19 states. [2019-01-14 03:36:26,396 WARN L181 SmtUtils]: Spent 229.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 38 [2019-01-14 03:36:27,137 WARN L181 SmtUtils]: Spent 171.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 42 [2019-01-14 03:36:27,592 WARN L181 SmtUtils]: Spent 433.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 46 [2019-01-14 03:36:27,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 03:36:27,767 INFO L93 Difference]: Finished difference Result 29 states and 35 transitions. [2019-01-14 03:36:27,768 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-01-14 03:36:27,768 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 29 states and 35 transitions. [2019-01-14 03:36:27,769 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 13 [2019-01-14 03:36:27,770 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 29 states to 29 states and 35 transitions. [2019-01-14 03:36:27,770 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 25 [2019-01-14 03:36:27,770 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 25 [2019-01-14 03:36:27,771 INFO L73 IsDeterministic]: Start isDeterministic. Operand 29 states and 35 transitions. [2019-01-14 03:36:27,771 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-14 03:36:27,771 INFO L706 BuchiCegarLoop]: Abstraction has 29 states and 35 transitions. [2019-01-14 03:36:27,771 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states and 35 transitions. [2019-01-14 03:36:27,775 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2019-01-14 03:36:27,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2019-01-14 03:36:27,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 35 transitions. [2019-01-14 03:36:27,776 INFO L729 BuchiCegarLoop]: Abstraction has 29 states and 35 transitions. [2019-01-14 03:36:27,780 INFO L609 BuchiCegarLoop]: Abstraction has 29 states and 35 transitions. [2019-01-14 03:36:27,780 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2019-01-14 03:36:27,780 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 29 states and 35 transitions. [2019-01-14 03:36:27,780 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 13 [2019-01-14 03:36:27,780 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 03:36:27,781 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 03:36:27,781 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 03:36:27,781 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-01-14 03:36:27,781 INFO L794 eck$LassoCheckResult]: Stem: 506#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];call ~#pp~0.base, ~#pp~0.offset := #Ultimate.allocOnStack(8);call write~init~$Pointer$(0, 0, ~#pp~0.base, ~#pp~0.offset, 4);call write~init~$Pointer$(0, 0, ~#pp~0.base, 4 + ~#pp~0.offset, 4);call ~#pstate~0.base, ~#pstate~0.offset := #Ultimate.allocOnStack(8);call write~init~int(0, ~#pstate~0.base, ~#pstate~0.offset, 4);call write~init~int(0, ~#pstate~0.base, 4 + ~#pstate~0.offset, 4);~counter~0 := 1; 482#L-1 havoc main_#res;havoc main_#t~ret7.base, main_#t~ret7.offset, main_#t~ret8.base, main_#t~ret8.offset, main_~a~0.base, main_~a~0.offset, main_~b~0.base, main_~b~0.offset;havoc main_~a~0.base, main_~a~0.offset;havoc main_~b~0.base, main_~b~0.offset;havoc init_#t~post0, init_~i~0;havoc init_~i~0;init_~i~0 := 0; 483#L17-3 assume !!(init_~i~0 < 2);call write~$Pointer$(0, 0, ~#pp~0.base, ~#pp~0.offset + 4 * init_~i~0, 4);call write~int(0, ~#pstate~0.base, ~#pstate~0.offset + 4 * init_~i~0, 4); 496#L17-2 init_#t~post0 := init_~i~0;init_~i~0 := 1 + init_#t~post0;havoc init_#t~post0; 497#L17-3 assume !!(init_~i~0 < 2);call write~$Pointer$(0, 0, ~#pp~0.base, ~#pp~0.offset + 4 * init_~i~0, 4);call write~int(0, ~#pstate~0.base, ~#pstate~0.offset + 4 * init_~i~0, 4); 507#L17-2 init_#t~post0 := init_~i~0;init_~i~0 := 1 + init_#t~post0;havoc init_#t~post0; 508#L17-3 assume !(init_~i~0 < 2); 495#L15 malloc_#in~size := 4;havoc malloc_#res.base, malloc_#res.offset;havoc malloc_#t~post6, malloc_~size;malloc_~size := malloc_#in~size;malloc_#t~post6 := ~counter~0;~counter~0 := 1 + malloc_#t~post6;malloc_#res.base, malloc_#res.offset := 0, malloc_#t~post6;havoc malloc_#t~post6; 480#L47 main_#t~ret7.base, main_#t~ret7.offset := malloc_#res.base, malloc_#res.offset;main_~a~0.base, main_~a~0.offset := main_#t~ret7.base, main_#t~ret7.offset;havoc main_#t~ret7.base, main_#t~ret7.offset;malloc_#in~size := 4;havoc malloc_#res.base, malloc_#res.offset;havoc malloc_#t~post6, malloc_~size;malloc_~size := malloc_#in~size;malloc_#t~post6 := ~counter~0;~counter~0 := 1 + malloc_#t~post6;malloc_#res.base, malloc_#res.offset := 0, malloc_#t~post6;havoc malloc_#t~post6; 481#L47-1 main_#t~ret8.base, main_#t~ret8.offset := malloc_#res.base, malloc_#res.offset;main_~b~0.base, main_~b~0.offset := main_#t~ret8.base, main_#t~ret8.offset;havoc main_#t~ret8.base, main_#t~ret8.offset; 494#L57 assume !((main_~a~0.base == 0 && main_~a~0.offset == 0) || (main_~b~0.base == 0 && main_~b~0.offset == 0));f_#in~pointer.base, f_#in~pointer.offset := main_~a~0.base, main_~a~0.offset;havoc f_#t~mem2.base, f_#t~mem2.offset, f_#t~post1, f_~pointer.base, f_~pointer.offset, f_~i~1;f_~pointer.base, f_~pointer.offset := f_#in~pointer.base, f_#in~pointer.offset;havoc f_~i~1;f_~i~1 := 0; 484#L25-3 assume !!(f_~i~1 < 2);call f_#t~mem2.base, f_#t~mem2.offset := read~$Pointer$(~#pp~0.base, ~#pp~0.offset + 4 * f_~i~1, 4); 485#L26 assume f_#t~mem2.base == 0 && f_#t~mem2.offset == 0;havoc f_#t~mem2.base, f_#t~mem2.offset;call write~$Pointer$(f_~pointer.base, f_~pointer.offset, ~#pp~0.base, ~#pp~0.offset + 4 * f_~i~1, 4);call write~int(1, ~#pstate~0.base, ~#pstate~0.offset + 4 * f_~i~1, 4); 490#L23 f_#in~pointer.base, f_#in~pointer.offset := main_~b~0.base, main_~b~0.offset;havoc f_#t~mem2.base, f_#t~mem2.offset, f_#t~post1, f_~pointer.base, f_~pointer.offset, f_~i~1;f_~pointer.base, f_~pointer.offset := f_#in~pointer.base, f_#in~pointer.offset;havoc f_~i~1;f_~i~1 := 0; 491#L25-7 [2019-01-14 03:36:27,783 INFO L796 eck$LassoCheckResult]: Loop: 491#L25-7 assume !!(f_~i~1 < 2);call f_#t~mem2.base, f_#t~mem2.offset := read~$Pointer$(~#pp~0.base, ~#pp~0.offset + 4 * f_~i~1, 4); 502#L26-1 assume !(f_#t~mem2.base == 0 && f_#t~mem2.offset == 0);havoc f_#t~mem2.base, f_#t~mem2.offset; 504#L25-6 f_#t~post1 := f_~i~1;f_~i~1 := 1 + f_#t~post1;havoc f_#t~post1; 491#L25-7 [2019-01-14 03:36:27,783 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 03:36:27,783 INFO L82 PathProgramCache]: Analyzing trace with hash -1444415679, now seen corresponding path program 1 times [2019-01-14 03:36:27,783 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 03:36:27,783 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 03:36:27,784 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 03:36:27,784 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 03:36:27,784 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 03:36:27,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 03:36:27,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 03:36:27,832 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 03:36:27,832 INFO L82 PathProgramCache]: Analyzing trace with hash 81589, now seen corresponding path program 1 times [2019-01-14 03:36:27,832 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 03:36:27,833 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 03:36:27,833 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 03:36:27,833 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 03:36:27,833 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 03:36:27,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 03:36:27,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 03:36:27,843 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 03:36:27,843 INFO L82 PathProgramCache]: Analyzing trace with hash 689897333, now seen corresponding path program 1 times [2019-01-14 03:36:27,843 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 03:36:27,844 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 03:36:27,844 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 03:36:27,844 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 03:36:27,844 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 03:36:27,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 03:36:27,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 03:36:28,132 WARN L181 SmtUtils]: Spent 218.00 ms on a formula simplification that was a NOOP. DAG size: 37 [2019-01-14 03:36:55,389 WARN L181 SmtUtils]: Spent 27.22 s on a formula simplification. DAG size of input: 268 DAG size of output: 227 [2019-01-14 03:36:55,400 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-14 03:36:55,766 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-14 03:37:08,438 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-14 03:37:08,707 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-14 03:37:19,717 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-14 03:37:19,906 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-14 03:37:32,101 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-14 03:37:32,328 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-14 03:37:43,926 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-14 03:37:44,145 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-14 03:37:55,327 INFO L267 ElimStorePlain]: Start of recursive call 13: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-14 03:37:55,514 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-14 03:38:03,079 INFO L267 ElimStorePlain]: Start of recursive call 15: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-14 03:38:03,270 INFO L267 ElimStorePlain]: Start of recursive call 14: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-14 03:38:11,728 INFO L267 ElimStorePlain]: Start of recursive call 1: 7 dim-2 vars, End of recursive call: 7 dim-0 vars, and 1 xjuncts. [2019-01-14 03:38:11,729 INFO L202 ElimStorePlain]: Needed 15 recursive calls to eliminate 7 variables, input treesize:467, output treesize:1770 [2019-01-14 03:38:19,390 WARN L181 SmtUtils]: Spent 7.66 s on a formula simplification that was a NOOP. DAG size: 161 [2019-01-14 03:38:19,393 INFO L216 LassoAnalysis]: Preferences: [2019-01-14 03:38:19,393 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-14 03:38:19,394 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-14 03:38:19,394 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-14 03:38:19,394 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-14 03:38:19,394 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 03:38:19,394 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-14 03:38:19,394 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-14 03:38:19,394 INFO L131 ssoRankerPreferences]: Filename of dumped script: ex3_forlist_true-termination.c_true-unreach-call.i_Iteration5_Lasso [2019-01-14 03:38:19,394 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-14 03:38:19,394 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-14 03:38:19,400 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:38:19,427 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:38:19,441 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:38:20,700 WARN L181 SmtUtils]: Spent 165.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 66 [2019-01-14 03:38:20,785 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:38:20,787 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:38:20,789 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:38:20,790 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:38:20,792 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:38:20,832 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:38:20,833 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:38:20,835 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:38:20,846 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:38:20,851 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:38:20,853 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:38:20,855 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:38:20,862 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:38:20,864 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:38:21,355 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-14 03:38:21,355 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-14 03:38:21,355 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 03:38:21,356 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 03:38:21,356 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 03:38:21,356 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:38:21,356 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 03:38:21,356 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 03:38:21,360 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 03:38:21,360 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 03:38:21,361 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:38:21,362 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 03:38:21,362 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 03:38:21,362 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 03:38:21,363 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:38:21,363 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 03:38:21,363 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 03:38:21,363 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 03:38:21,363 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 03:38:21,364 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:38:21,364 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 03:38:21,364 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 03:38:21,364 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:38:21,365 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 03:38:21,365 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 03:38:21,365 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 03:38:21,366 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 03:38:21,367 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:38:21,368 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 03:38:21,368 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 03:38:21,368 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:38:21,368 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 03:38:21,368 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 03:38:21,369 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 03:38:21,369 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 03:38:21,371 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:38:21,372 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 03:38:21,372 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 03:38:21,372 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:38:21,372 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 03:38:21,373 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 03:38:21,374 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 03:38:21,374 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 03:38:21,376 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:38:21,376 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 03:38:21,376 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 03:38:21,377 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 03:38:21,377 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:38:21,377 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 03:38:21,377 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 03:38:21,377 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 03:38:21,377 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 03:38:21,378 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:38:21,378 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 03:38:21,378 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 03:38:21,379 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:38:21,379 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 03:38:21,379 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 03:38:21,380 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 03:38:21,380 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 03:38:21,381 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:38:21,382 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 03:38:21,382 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 03:38:21,382 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:38:21,382 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 03:38:21,382 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 03:38:21,384 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 03:38:21,384 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 03:38:21,385 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:38:21,385 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 03:38:21,386 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 03:38:21,386 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:38:21,386 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 03:38:21,386 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 03:38:21,387 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 03:38:21,387 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 03:38:21,389 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:38:21,389 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 03:38:21,389 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 03:38:21,390 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:38:21,390 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 03:38:21,390 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 03:38:21,391 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 03:38:21,391 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 03:38:21,392 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:38:21,392 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 03:38:21,393 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 03:38:21,393 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:38:21,393 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 03:38:21,393 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 03:38:21,394 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 03:38:21,394 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 03:38:21,396 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:38:21,396 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 03:38:21,396 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 03:38:21,397 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:38:21,397 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 03:38:21,397 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 03:38:21,398 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 03:38:21,398 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 03:38:21,401 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:38:21,401 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 03:38:21,401 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 03:38:21,402 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:38:21,402 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 03:38:21,402 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 03:38:21,403 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 03:38:21,403 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 03:38:21,404 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:38:21,404 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 03:38:21,405 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 03:38:21,405 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:38:21,405 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 03:38:21,405 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 03:38:21,407 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 03:38:21,407 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 03:38:21,412 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:38:21,412 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 03:38:21,413 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 03:38:21,413 INFO L205 nArgumentSynthesizer]: 4 stem disjuncts [2019-01-14 03:38:21,413 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 03:38:21,413 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 03:38:21,418 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2019-01-14 03:38:21,418 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 03:38:21,426 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:38:21,427 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 03:38:21,427 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 03:38:21,428 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:38:21,433 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 03:38:21,433 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 03:38:21,434 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 03:38:21,434 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 03:38:21,436 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:38:21,436 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 03:38:21,440 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 03:38:21,440 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 03:38:21,440 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:38:21,441 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 03:38:21,441 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 03:38:21,441 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 03:38:21,441 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 03:38:21,444 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:38:21,445 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 03:38:21,445 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 03:38:21,446 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:38:21,446 INFO L206 nArgumentSynthesizer]: 4 loop disjuncts [2019-01-14 03:38:21,446 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 03:38:21,469 INFO L402 nArgumentSynthesizer]: We have 48 Motzkin's Theorem applications. [2019-01-14 03:38:21,469 INFO L403 nArgumentSynthesizer]: A total of 8 supporting invariants were added. [2019-01-14 03:38:21,515 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:38:21,516 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 03:38:21,517 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 03:38:21,517 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:38:21,517 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 03:38:21,517 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 03:38:21,521 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 03:38:21,521 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 03:38:21,533 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-14 03:38:21,540 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-01-14 03:38:21,540 INFO L444 ModelExtractionUtils]: 13 out of 16 variables were initially zero. Simplification set additionally 0 variables to zero. [2019-01-14 03:38:21,540 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-14 03:38:21,541 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-01-14 03:38:21,541 INFO L518 LassoAnalysis]: Proved termination. [2019-01-14 03:38:21,542 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_f_~i~1) = -2*ULTIMATE.start_f_~i~1 + 3 Supporting invariants [] [2019-01-14 03:38:21,675 INFO L297 tatePredicateManager]: 9 out of 9 supporting invariants were superfluous and have been removed [2019-01-14 03:38:21,686 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 03:38:21,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 03:38:21,722 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 03:38:21,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 03:38:21,733 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 03:38:21,744 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 03:38:21,744 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2019-01-14 03:38:21,745 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 29 states and 35 transitions. cyclomatic complexity: 10 Second operand 3 states. [2019-01-14 03:38:21,773 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 29 states and 35 transitions. cyclomatic complexity: 10. Second operand 3 states. Result 68 states and 88 transitions. Complement of second has 6 states. [2019-01-14 03:38:21,776 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2019-01-14 03:38:21,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-01-14 03:38:21,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 47 transitions. [2019-01-14 03:38:21,777 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 47 transitions. Stem has 14 letters. Loop has 3 letters. [2019-01-14 03:38:21,778 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 03:38:21,778 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 47 transitions. Stem has 17 letters. Loop has 3 letters. [2019-01-14 03:38:21,778 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 03:38:21,779 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 47 transitions. Stem has 14 letters. Loop has 6 letters. [2019-01-14 03:38:21,779 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 03:38:21,779 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 68 states and 88 transitions. [2019-01-14 03:38:21,780 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 20 [2019-01-14 03:38:21,782 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 68 states to 43 states and 54 transitions. [2019-01-14 03:38:21,782 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 34 [2019-01-14 03:38:21,783 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 36 [2019-01-14 03:38:21,783 INFO L73 IsDeterministic]: Start isDeterministic. Operand 43 states and 54 transitions. [2019-01-14 03:38:21,783 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-14 03:38:21,783 INFO L706 BuchiCegarLoop]: Abstraction has 43 states and 54 transitions. [2019-01-14 03:38:21,783 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states and 54 transitions. [2019-01-14 03:38:21,785 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 31. [2019-01-14 03:38:21,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2019-01-14 03:38:21,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 39 transitions. [2019-01-14 03:38:21,786 INFO L729 BuchiCegarLoop]: Abstraction has 31 states and 39 transitions. [2019-01-14 03:38:21,786 INFO L609 BuchiCegarLoop]: Abstraction has 31 states and 39 transitions. [2019-01-14 03:38:21,786 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2019-01-14 03:38:21,786 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 31 states and 39 transitions. [2019-01-14 03:38:21,787 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2019-01-14 03:38:21,787 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 03:38:21,787 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 03:38:21,788 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 03:38:21,788 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-01-14 03:38:21,788 INFO L794 eck$LassoCheckResult]: Stem: 715#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];call ~#pp~0.base, ~#pp~0.offset := #Ultimate.allocOnStack(8);call write~init~$Pointer$(0, 0, ~#pp~0.base, ~#pp~0.offset, 4);call write~init~$Pointer$(0, 0, ~#pp~0.base, 4 + ~#pp~0.offset, 4);call ~#pstate~0.base, ~#pstate~0.offset := #Ultimate.allocOnStack(8);call write~init~int(0, ~#pstate~0.base, ~#pstate~0.offset, 4);call write~init~int(0, ~#pstate~0.base, 4 + ~#pstate~0.offset, 4);~counter~0 := 1; 689#L-1 havoc main_#res;havoc main_#t~ret7.base, main_#t~ret7.offset, main_#t~ret8.base, main_#t~ret8.offset, main_~a~0.base, main_~a~0.offset, main_~b~0.base, main_~b~0.offset;havoc main_~a~0.base, main_~a~0.offset;havoc main_~b~0.base, main_~b~0.offset;havoc init_#t~post0, init_~i~0;havoc init_~i~0;init_~i~0 := 0; 690#L17-3 assume !!(init_~i~0 < 2);call write~$Pointer$(0, 0, ~#pp~0.base, ~#pp~0.offset + 4 * init_~i~0, 4);call write~int(0, ~#pstate~0.base, ~#pstate~0.offset + 4 * init_~i~0, 4); 702#L17-2 init_#t~post0 := init_~i~0;init_~i~0 := 1 + init_#t~post0;havoc init_#t~post0; 703#L17-3 assume !!(init_~i~0 < 2);call write~$Pointer$(0, 0, ~#pp~0.base, ~#pp~0.offset + 4 * init_~i~0, 4);call write~int(0, ~#pstate~0.base, ~#pstate~0.offset + 4 * init_~i~0, 4); 716#L17-2 init_#t~post0 := init_~i~0;init_~i~0 := 1 + init_#t~post0;havoc init_#t~post0; 717#L17-3 assume !(init_~i~0 < 2); 704#L15 malloc_#in~size := 4;havoc malloc_#res.base, malloc_#res.offset;havoc malloc_#t~post6, malloc_~size;malloc_~size := malloc_#in~size;malloc_#t~post6 := ~counter~0;~counter~0 := 1 + malloc_#t~post6;malloc_#res.base, malloc_#res.offset := 0, malloc_#t~post6;havoc malloc_#t~post6; 687#L47 main_#t~ret7.base, main_#t~ret7.offset := malloc_#res.base, malloc_#res.offset;main_~a~0.base, main_~a~0.offset := main_#t~ret7.base, main_#t~ret7.offset;havoc main_#t~ret7.base, main_#t~ret7.offset;malloc_#in~size := 4;havoc malloc_#res.base, malloc_#res.offset;havoc malloc_#t~post6, malloc_~size;malloc_~size := malloc_#in~size;malloc_#t~post6 := ~counter~0;~counter~0 := 1 + malloc_#t~post6;malloc_#res.base, malloc_#res.offset := 0, malloc_#t~post6;havoc malloc_#t~post6; 688#L47-1 main_#t~ret8.base, main_#t~ret8.offset := malloc_#res.base, malloc_#res.offset;main_~b~0.base, main_~b~0.offset := main_#t~ret8.base, main_#t~ret8.offset;havoc main_#t~ret8.base, main_#t~ret8.offset; 701#L57 assume !((main_~a~0.base == 0 && main_~a~0.offset == 0) || (main_~b~0.base == 0 && main_~b~0.offset == 0));f_#in~pointer.base, f_#in~pointer.offset := main_~a~0.base, main_~a~0.offset;havoc f_#t~mem2.base, f_#t~mem2.offset, f_#t~post1, f_~pointer.base, f_~pointer.offset, f_~i~1;f_~pointer.base, f_~pointer.offset := f_#in~pointer.base, f_#in~pointer.offset;havoc f_~i~1;f_~i~1 := 0; 693#L25-3 assume !!(f_~i~1 < 2);call f_#t~mem2.base, f_#t~mem2.offset := read~$Pointer$(~#pp~0.base, ~#pp~0.offset + 4 * f_~i~1, 4); 694#L26 assume f_#t~mem2.base == 0 && f_#t~mem2.offset == 0;havoc f_#t~mem2.base, f_#t~mem2.offset;call write~$Pointer$(f_~pointer.base, f_~pointer.offset, ~#pp~0.base, ~#pp~0.offset + 4 * f_~i~1, 4);call write~int(1, ~#pstate~0.base, ~#pstate~0.offset + 4 * f_~i~1, 4); 697#L23 f_#in~pointer.base, f_#in~pointer.offset := main_~b~0.base, main_~b~0.offset;havoc f_#t~mem2.base, f_#t~mem2.offset, f_#t~post1, f_~pointer.base, f_~pointer.offset, f_~i~1;f_~pointer.base, f_~pointer.offset := f_#in~pointer.base, f_#in~pointer.offset;havoc f_~i~1;f_~i~1 := 0; 698#L25-7 assume !(f_~i~1 < 2); 691#L23-1 g_#in~pointer.base, g_#in~pointer.offset := main_~a~0.base, main_~a~0.offset;havoc g_#t~mem4.base, g_#t~mem4.offset, g_#t~mem5, g_#t~post3, g_~pointer.base, g_~pointer.offset, g_~i~2;g_~pointer.base, g_~pointer.offset := g_#in~pointer.base, g_#in~pointer.offset;havoc g_~i~2;g_~i~2 := 0; 692#L36-3 [2019-01-14 03:38:21,788 INFO L796 eck$LassoCheckResult]: Loop: 692#L36-3 assume !!(g_~i~2 < 2);call g_#t~mem4.base, g_#t~mem4.offset := read~$Pointer$(~#pp~0.base, ~#pp~0.offset + 4 * g_~i~2, 4); 696#L37 assume !(g_#t~mem4.base == g_~pointer.base && g_#t~mem4.offset == g_~pointer.offset);havoc g_#t~mem4.base, g_#t~mem4.offset; 700#L36-2 g_#t~post3 := g_~i~2;g_~i~2 := 1 + g_#t~post3;havoc g_#t~post3; 692#L36-3 [2019-01-14 03:38:21,789 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 03:38:21,789 INFO L82 PathProgramCache]: Analyzing trace with hash -809029298, now seen corresponding path program 1 times [2019-01-14 03:38:21,789 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 03:38:21,789 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 03:38:21,790 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 03:38:21,790 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 03:38:21,790 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 03:38:21,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 03:38:21,864 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-01-14 03:38:21,865 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 03:38:21,865 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-14 03:38:21,865 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-01-14 03:38:21,865 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 03:38:21,865 INFO L82 PathProgramCache]: Analyzing trace with hash 100776, now seen corresponding path program 1 times [2019-01-14 03:38:21,865 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 03:38:21,866 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 03:38:21,866 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 03:38:21,866 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 03:38:21,867 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 03:38:21,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 03:38:21,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 03:38:22,033 WARN L181 SmtUtils]: Spent 160.00 ms on a formula simplification that was a NOOP. DAG size: 39 [2019-01-14 03:38:22,074 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 03:38:22,074 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 03:38:22,075 INFO L87 Difference]: Start difference. First operand 31 states and 39 transitions. cyclomatic complexity: 12 Second operand 3 states. [2019-01-14 03:38:22,099 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 03:38:22,100 INFO L93 Difference]: Finished difference Result 46 states and 56 transitions. [2019-01-14 03:38:22,102 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-14 03:38:22,102 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 46 states and 56 transitions. [2019-01-14 03:38:22,104 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 20 [2019-01-14 03:38:22,105 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 46 states to 46 states and 56 transitions. [2019-01-14 03:38:22,105 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 37 [2019-01-14 03:38:22,105 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 37 [2019-01-14 03:38:22,105 INFO L73 IsDeterministic]: Start isDeterministic. Operand 46 states and 56 transitions. [2019-01-14 03:38:22,105 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-14 03:38:22,106 INFO L706 BuchiCegarLoop]: Abstraction has 46 states and 56 transitions. [2019-01-14 03:38:22,106 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states and 56 transitions. [2019-01-14 03:38:22,108 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 31. [2019-01-14 03:38:22,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2019-01-14 03:38:22,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 38 transitions. [2019-01-14 03:38:22,109 INFO L729 BuchiCegarLoop]: Abstraction has 31 states and 38 transitions. [2019-01-14 03:38:22,109 INFO L609 BuchiCegarLoop]: Abstraction has 31 states and 38 transitions. [2019-01-14 03:38:22,109 INFO L442 BuchiCegarLoop]: ======== Iteration 7============ [2019-01-14 03:38:22,109 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 31 states and 38 transitions. [2019-01-14 03:38:22,109 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2019-01-14 03:38:22,110 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 03:38:22,110 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 03:38:22,110 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 03:38:22,110 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-01-14 03:38:22,111 INFO L794 eck$LassoCheckResult]: Stem: 798#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];call ~#pp~0.base, ~#pp~0.offset := #Ultimate.allocOnStack(8);call write~init~$Pointer$(0, 0, ~#pp~0.base, ~#pp~0.offset, 4);call write~init~$Pointer$(0, 0, ~#pp~0.base, 4 + ~#pp~0.offset, 4);call ~#pstate~0.base, ~#pstate~0.offset := #Ultimate.allocOnStack(8);call write~init~int(0, ~#pstate~0.base, ~#pstate~0.offset, 4);call write~init~int(0, ~#pstate~0.base, 4 + ~#pstate~0.offset, 4);~counter~0 := 1; 772#L-1 havoc main_#res;havoc main_#t~ret7.base, main_#t~ret7.offset, main_#t~ret8.base, main_#t~ret8.offset, main_~a~0.base, main_~a~0.offset, main_~b~0.base, main_~b~0.offset;havoc main_~a~0.base, main_~a~0.offset;havoc main_~b~0.base, main_~b~0.offset;havoc init_#t~post0, init_~i~0;havoc init_~i~0;init_~i~0 := 0; 773#L17-3 assume !!(init_~i~0 < 2);call write~$Pointer$(0, 0, ~#pp~0.base, ~#pp~0.offset + 4 * init_~i~0, 4);call write~int(0, ~#pstate~0.base, ~#pstate~0.offset + 4 * init_~i~0, 4); 785#L17-2 init_#t~post0 := init_~i~0;init_~i~0 := 1 + init_#t~post0;havoc init_#t~post0; 786#L17-3 assume !!(init_~i~0 < 2);call write~$Pointer$(0, 0, ~#pp~0.base, ~#pp~0.offset + 4 * init_~i~0, 4);call write~int(0, ~#pstate~0.base, ~#pstate~0.offset + 4 * init_~i~0, 4); 799#L17-2 init_#t~post0 := init_~i~0;init_~i~0 := 1 + init_#t~post0;havoc init_#t~post0; 800#L17-3 assume !(init_~i~0 < 2); 787#L15 malloc_#in~size := 4;havoc malloc_#res.base, malloc_#res.offset;havoc malloc_#t~post6, malloc_~size;malloc_~size := malloc_#in~size;malloc_#t~post6 := ~counter~0;~counter~0 := 1 + malloc_#t~post6;malloc_#res.base, malloc_#res.offset := 0, malloc_#t~post6;havoc malloc_#t~post6; 770#L47 main_#t~ret7.base, main_#t~ret7.offset := malloc_#res.base, malloc_#res.offset;main_~a~0.base, main_~a~0.offset := main_#t~ret7.base, main_#t~ret7.offset;havoc main_#t~ret7.base, main_#t~ret7.offset;malloc_#in~size := 4;havoc malloc_#res.base, malloc_#res.offset;havoc malloc_#t~post6, malloc_~size;malloc_~size := malloc_#in~size;malloc_#t~post6 := ~counter~0;~counter~0 := 1 + malloc_#t~post6;malloc_#res.base, malloc_#res.offset := 0, malloc_#t~post6;havoc malloc_#t~post6; 771#L47-1 main_#t~ret8.base, main_#t~ret8.offset := malloc_#res.base, malloc_#res.offset;main_~b~0.base, main_~b~0.offset := main_#t~ret8.base, main_#t~ret8.offset;havoc main_#t~ret8.base, main_#t~ret8.offset; 784#L57 assume !((main_~a~0.base == 0 && main_~a~0.offset == 0) || (main_~b~0.base == 0 && main_~b~0.offset == 0));f_#in~pointer.base, f_#in~pointer.offset := main_~a~0.base, main_~a~0.offset;havoc f_#t~mem2.base, f_#t~mem2.offset, f_#t~post1, f_~pointer.base, f_~pointer.offset, f_~i~1;f_~pointer.base, f_~pointer.offset := f_#in~pointer.base, f_#in~pointer.offset;havoc f_~i~1;f_~i~1 := 0; 774#L25-3 assume !!(f_~i~1 < 2);call f_#t~mem2.base, f_#t~mem2.offset := read~$Pointer$(~#pp~0.base, ~#pp~0.offset + 4 * f_~i~1, 4); 775#L26 assume f_#t~mem2.base == 0 && f_#t~mem2.offset == 0;havoc f_#t~mem2.base, f_#t~mem2.offset;call write~$Pointer$(f_~pointer.base, f_~pointer.offset, ~#pp~0.base, ~#pp~0.offset + 4 * f_~i~1, 4);call write~int(1, ~#pstate~0.base, ~#pstate~0.offset + 4 * f_~i~1, 4); 780#L23 f_#in~pointer.base, f_#in~pointer.offset := main_~b~0.base, main_~b~0.offset;havoc f_#t~mem2.base, f_#t~mem2.offset, f_#t~post1, f_~pointer.base, f_~pointer.offset, f_~i~1;f_~pointer.base, f_~pointer.offset := f_#in~pointer.base, f_#in~pointer.offset;havoc f_~i~1;f_~i~1 := 0; 781#L25-7 assume !!(f_~i~1 < 2);call f_#t~mem2.base, f_#t~mem2.offset := read~$Pointer$(~#pp~0.base, ~#pp~0.offset + 4 * f_~i~1, 4); 793#L26-1 assume f_#t~mem2.base == 0 && f_#t~mem2.offset == 0;havoc f_#t~mem2.base, f_#t~mem2.offset;call write~$Pointer$(f_~pointer.base, f_~pointer.offset, ~#pp~0.base, ~#pp~0.offset + 4 * f_~i~1, 4);call write~int(1, ~#pstate~0.base, ~#pstate~0.offset + 4 * f_~i~1, 4); 776#L23-1 g_#in~pointer.base, g_#in~pointer.offset := main_~a~0.base, main_~a~0.offset;havoc g_#t~mem4.base, g_#t~mem4.offset, g_#t~mem5, g_#t~post3, g_~pointer.base, g_~pointer.offset, g_~i~2;g_~pointer.base, g_~pointer.offset := g_#in~pointer.base, g_#in~pointer.offset;havoc g_~i~2;g_~i~2 := 0; 777#L36-3 [2019-01-14 03:38:22,111 INFO L796 eck$LassoCheckResult]: Loop: 777#L36-3 assume !!(g_~i~2 < 2);call g_#t~mem4.base, g_#t~mem4.offset := read~$Pointer$(~#pp~0.base, ~#pp~0.offset + 4 * g_~i~2, 4); 779#L37 assume !(g_#t~mem4.base == g_~pointer.base && g_#t~mem4.offset == g_~pointer.offset);havoc g_#t~mem4.base, g_#t~mem4.offset; 783#L36-2 g_#t~post3 := g_~i~2;g_~i~2 := 1 + g_#t~post3;havoc g_#t~post3; 777#L36-3 [2019-01-14 03:38:22,111 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 03:38:22,111 INFO L82 PathProgramCache]: Analyzing trace with hash 689897275, now seen corresponding path program 1 times [2019-01-14 03:38:22,111 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 03:38:22,111 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 03:38:22,112 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 03:38:22,112 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 03:38:22,112 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 03:38:22,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 03:38:22,486 WARN L181 SmtUtils]: Spent 151.00 ms on a formula simplification that was a NOOP. DAG size: 11 [2019-01-14 03:38:22,838 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-01-14 03:38:22,838 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 03:38:22,838 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-01-14 03:38:22,838 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-01-14 03:38:22,839 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 03:38:22,839 INFO L82 PathProgramCache]: Analyzing trace with hash 100776, now seen corresponding path program 2 times [2019-01-14 03:38:22,839 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 03:38:22,839 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 03:38:22,840 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 03:38:22,840 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 03:38:22,840 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 03:38:22,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 03:38:22,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 03:38:22,928 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-01-14 03:38:22,928 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-01-14 03:38:22,929 INFO L87 Difference]: Start difference. First operand 31 states and 38 transitions. cyclomatic complexity: 11 Second operand 9 states. [2019-01-14 03:38:23,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 03:38:23,332 INFO L93 Difference]: Finished difference Result 46 states and 55 transitions. [2019-01-14 03:38:23,333 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-01-14 03:38:23,333 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 46 states and 55 transitions. [2019-01-14 03:38:23,334 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 20 [2019-01-14 03:38:23,335 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 46 states to 45 states and 54 transitions. [2019-01-14 03:38:23,335 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 36 [2019-01-14 03:38:23,336 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 36 [2019-01-14 03:38:23,336 INFO L73 IsDeterministic]: Start isDeterministic. Operand 45 states and 54 transitions. [2019-01-14 03:38:23,336 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-14 03:38:23,336 INFO L706 BuchiCegarLoop]: Abstraction has 45 states and 54 transitions. [2019-01-14 03:38:23,336 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states and 54 transitions. [2019-01-14 03:38:23,338 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 31. [2019-01-14 03:38:23,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2019-01-14 03:38:23,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 37 transitions. [2019-01-14 03:38:23,339 INFO L729 BuchiCegarLoop]: Abstraction has 31 states and 37 transitions. [2019-01-14 03:38:23,339 INFO L609 BuchiCegarLoop]: Abstraction has 31 states and 37 transitions. [2019-01-14 03:38:23,339 INFO L442 BuchiCegarLoop]: ======== Iteration 8============ [2019-01-14 03:38:23,339 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 31 states and 37 transitions. [2019-01-14 03:38:23,339 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2019-01-14 03:38:23,340 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 03:38:23,340 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 03:38:23,340 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 03:38:23,340 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-01-14 03:38:23,341 INFO L794 eck$LassoCheckResult]: Stem: 901#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];call ~#pp~0.base, ~#pp~0.offset := #Ultimate.allocOnStack(8);call write~init~$Pointer$(0, 0, ~#pp~0.base, ~#pp~0.offset, 4);call write~init~$Pointer$(0, 0, ~#pp~0.base, 4 + ~#pp~0.offset, 4);call ~#pstate~0.base, ~#pstate~0.offset := #Ultimate.allocOnStack(8);call write~init~int(0, ~#pstate~0.base, ~#pstate~0.offset, 4);call write~init~int(0, ~#pstate~0.base, 4 + ~#pstate~0.offset, 4);~counter~0 := 1; 875#L-1 havoc main_#res;havoc main_#t~ret7.base, main_#t~ret7.offset, main_#t~ret8.base, main_#t~ret8.offset, main_~a~0.base, main_~a~0.offset, main_~b~0.base, main_~b~0.offset;havoc main_~a~0.base, main_~a~0.offset;havoc main_~b~0.base, main_~b~0.offset;havoc init_#t~post0, init_~i~0;havoc init_~i~0;init_~i~0 := 0; 876#L17-3 assume !!(init_~i~0 < 2);call write~$Pointer$(0, 0, ~#pp~0.base, ~#pp~0.offset + 4 * init_~i~0, 4);call write~int(0, ~#pstate~0.base, ~#pstate~0.offset + 4 * init_~i~0, 4); 888#L17-2 init_#t~post0 := init_~i~0;init_~i~0 := 1 + init_#t~post0;havoc init_#t~post0; 889#L17-3 assume !!(init_~i~0 < 2);call write~$Pointer$(0, 0, ~#pp~0.base, ~#pp~0.offset + 4 * init_~i~0, 4);call write~int(0, ~#pstate~0.base, ~#pstate~0.offset + 4 * init_~i~0, 4); 902#L17-2 init_#t~post0 := init_~i~0;init_~i~0 := 1 + init_#t~post0;havoc init_#t~post0; 903#L17-3 assume !(init_~i~0 < 2); 890#L15 malloc_#in~size := 4;havoc malloc_#res.base, malloc_#res.offset;havoc malloc_#t~post6, malloc_~size;malloc_~size := malloc_#in~size;malloc_#t~post6 := ~counter~0;~counter~0 := 1 + malloc_#t~post6;malloc_#res.base, malloc_#res.offset := 0, malloc_#t~post6;havoc malloc_#t~post6; 873#L47 main_#t~ret7.base, main_#t~ret7.offset := malloc_#res.base, malloc_#res.offset;main_~a~0.base, main_~a~0.offset := main_#t~ret7.base, main_#t~ret7.offset;havoc main_#t~ret7.base, main_#t~ret7.offset;malloc_#in~size := 4;havoc malloc_#res.base, malloc_#res.offset;havoc malloc_#t~post6, malloc_~size;malloc_~size := malloc_#in~size;malloc_#t~post6 := ~counter~0;~counter~0 := 1 + malloc_#t~post6;malloc_#res.base, malloc_#res.offset := 0, malloc_#t~post6;havoc malloc_#t~post6; 874#L47-1 main_#t~ret8.base, main_#t~ret8.offset := malloc_#res.base, malloc_#res.offset;main_~b~0.base, main_~b~0.offset := main_#t~ret8.base, main_#t~ret8.offset;havoc main_#t~ret8.base, main_#t~ret8.offset; 887#L57 assume !((main_~a~0.base == 0 && main_~a~0.offset == 0) || (main_~b~0.base == 0 && main_~b~0.offset == 0));f_#in~pointer.base, f_#in~pointer.offset := main_~a~0.base, main_~a~0.offset;havoc f_#t~mem2.base, f_#t~mem2.offset, f_#t~post1, f_~pointer.base, f_~pointer.offset, f_~i~1;f_~pointer.base, f_~pointer.offset := f_#in~pointer.base, f_#in~pointer.offset;havoc f_~i~1;f_~i~1 := 0; 879#L25-3 assume !!(f_~i~1 < 2);call f_#t~mem2.base, f_#t~mem2.offset := read~$Pointer$(~#pp~0.base, ~#pp~0.offset + 4 * f_~i~1, 4); 880#L26 assume f_#t~mem2.base == 0 && f_#t~mem2.offset == 0;havoc f_#t~mem2.base, f_#t~mem2.offset;call write~$Pointer$(f_~pointer.base, f_~pointer.offset, ~#pp~0.base, ~#pp~0.offset + 4 * f_~i~1, 4);call write~int(1, ~#pstate~0.base, ~#pstate~0.offset + 4 * f_~i~1, 4); 883#L23 f_#in~pointer.base, f_#in~pointer.offset := main_~b~0.base, main_~b~0.offset;havoc f_#t~mem2.base, f_#t~mem2.offset, f_#t~post1, f_~pointer.base, f_~pointer.offset, f_~i~1;f_~pointer.base, f_~pointer.offset := f_#in~pointer.base, f_#in~pointer.offset;havoc f_~i~1;f_~i~1 := 0; 884#L25-7 assume !!(f_~i~1 < 2);call f_#t~mem2.base, f_#t~mem2.offset := read~$Pointer$(~#pp~0.base, ~#pp~0.offset + 4 * f_~i~1, 4); 895#L26-1 assume !(f_#t~mem2.base == 0 && f_#t~mem2.offset == 0);havoc f_#t~mem2.base, f_#t~mem2.offset; 899#L25-6 f_#t~post1 := f_~i~1;f_~i~1 := 1 + f_#t~post1;havoc f_#t~post1; 896#L25-7 assume !(f_~i~1 < 2); 877#L23-1 g_#in~pointer.base, g_#in~pointer.offset := main_~a~0.base, main_~a~0.offset;havoc g_#t~mem4.base, g_#t~mem4.offset, g_#t~mem5, g_#t~post3, g_~pointer.base, g_~pointer.offset, g_~i~2;g_~pointer.base, g_~pointer.offset := g_#in~pointer.base, g_#in~pointer.offset;havoc g_~i~2;g_~i~2 := 0; 878#L36-3 [2019-01-14 03:38:23,341 INFO L796 eck$LassoCheckResult]: Loop: 878#L36-3 assume !!(g_~i~2 < 2);call g_#t~mem4.base, g_#t~mem4.offset := read~$Pointer$(~#pp~0.base, ~#pp~0.offset + 4 * g_~i~2, 4); 882#L37 assume !(g_#t~mem4.base == g_~pointer.base && g_#t~mem4.offset == g_~pointer.offset);havoc g_#t~mem4.base, g_#t~mem4.offset; 886#L36-2 g_#t~post3 := g_~i~2;g_~i~2 := 1 + g_#t~post3;havoc g_#t~post3; 878#L36-3 [2019-01-14 03:38:23,341 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 03:38:23,341 INFO L82 PathProgramCache]: Analyzing trace with hash 1566375042, now seen corresponding path program 1 times [2019-01-14 03:38:23,341 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 03:38:23,341 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 03:38:23,342 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 03:38:23,342 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 03:38:23,342 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 03:38:23,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 03:38:23,467 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-01-14 03:38:23,467 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 03:38:23,467 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-14 03:38:23,485 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 03:38:23,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 03:38:23,528 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 03:38:23,610 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-01-14 03:38:23,629 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 03:38:23,629 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2019-01-14 03:38:23,629 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-01-14 03:38:23,629 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 03:38:23,630 INFO L82 PathProgramCache]: Analyzing trace with hash 100776, now seen corresponding path program 3 times [2019-01-14 03:38:23,630 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 03:38:23,630 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 03:38:23,631 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 03:38:23,631 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 03:38:23,631 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 03:38:23,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 03:38:23,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 03:38:23,722 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-14 03:38:23,722 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-01-14 03:38:23,723 INFO L87 Difference]: Start difference. First operand 31 states and 37 transitions. cyclomatic complexity: 10 Second operand 5 states. [2019-01-14 03:38:23,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 03:38:23,751 INFO L93 Difference]: Finished difference Result 46 states and 56 transitions. [2019-01-14 03:38:23,752 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-14 03:38:23,752 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 46 states and 56 transitions. [2019-01-14 03:38:23,753 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 20 [2019-01-14 03:38:23,755 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 46 states to 46 states and 56 transitions. [2019-01-14 03:38:23,755 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 36 [2019-01-14 03:38:23,756 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 36 [2019-01-14 03:38:23,756 INFO L73 IsDeterministic]: Start isDeterministic. Operand 46 states and 56 transitions. [2019-01-14 03:38:23,756 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-14 03:38:23,756 INFO L706 BuchiCegarLoop]: Abstraction has 46 states and 56 transitions. [2019-01-14 03:38:23,756 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states and 56 transitions. [2019-01-14 03:38:23,758 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 34. [2019-01-14 03:38:23,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2019-01-14 03:38:23,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 41 transitions. [2019-01-14 03:38:23,759 INFO L729 BuchiCegarLoop]: Abstraction has 34 states and 41 transitions. [2019-01-14 03:38:23,759 INFO L609 BuchiCegarLoop]: Abstraction has 34 states and 41 transitions. [2019-01-14 03:38:23,759 INFO L442 BuchiCegarLoop]: ======== Iteration 9============ [2019-01-14 03:38:23,759 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 34 states and 41 transitions. [2019-01-14 03:38:23,760 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2019-01-14 03:38:23,760 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 03:38:23,760 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 03:38:23,761 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 03:38:23,761 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-01-14 03:38:23,761 INFO L794 eck$LassoCheckResult]: Stem: 1041#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];call ~#pp~0.base, ~#pp~0.offset := #Ultimate.allocOnStack(8);call write~init~$Pointer$(0, 0, ~#pp~0.base, ~#pp~0.offset, 4);call write~init~$Pointer$(0, 0, ~#pp~0.base, 4 + ~#pp~0.offset, 4);call ~#pstate~0.base, ~#pstate~0.offset := #Ultimate.allocOnStack(8);call write~init~int(0, ~#pstate~0.base, ~#pstate~0.offset, 4);call write~init~int(0, ~#pstate~0.base, 4 + ~#pstate~0.offset, 4);~counter~0 := 1; 1014#L-1 havoc main_#res;havoc main_#t~ret7.base, main_#t~ret7.offset, main_#t~ret8.base, main_#t~ret8.offset, main_~a~0.base, main_~a~0.offset, main_~b~0.base, main_~b~0.offset;havoc main_~a~0.base, main_~a~0.offset;havoc main_~b~0.base, main_~b~0.offset;havoc init_#t~post0, init_~i~0;havoc init_~i~0;init_~i~0 := 0; 1015#L17-3 assume !!(init_~i~0 < 2);call write~$Pointer$(0, 0, ~#pp~0.base, ~#pp~0.offset + 4 * init_~i~0, 4);call write~int(0, ~#pstate~0.base, ~#pstate~0.offset + 4 * init_~i~0, 4); 1027#L17-2 init_#t~post0 := init_~i~0;init_~i~0 := 1 + init_#t~post0;havoc init_#t~post0; 1028#L17-3 assume !!(init_~i~0 < 2);call write~$Pointer$(0, 0, ~#pp~0.base, ~#pp~0.offset + 4 * init_~i~0, 4);call write~int(0, ~#pstate~0.base, ~#pstate~0.offset + 4 * init_~i~0, 4); 1042#L17-2 init_#t~post0 := init_~i~0;init_~i~0 := 1 + init_#t~post0;havoc init_#t~post0; 1044#L17-3 assume !(init_~i~0 < 2); 1029#L15 malloc_#in~size := 4;havoc malloc_#res.base, malloc_#res.offset;havoc malloc_#t~post6, malloc_~size;malloc_~size := malloc_#in~size;malloc_#t~post6 := ~counter~0;~counter~0 := 1 + malloc_#t~post6;malloc_#res.base, malloc_#res.offset := 0, malloc_#t~post6;havoc malloc_#t~post6; 1012#L47 main_#t~ret7.base, main_#t~ret7.offset := malloc_#res.base, malloc_#res.offset;main_~a~0.base, main_~a~0.offset := main_#t~ret7.base, main_#t~ret7.offset;havoc main_#t~ret7.base, main_#t~ret7.offset;malloc_#in~size := 4;havoc malloc_#res.base, malloc_#res.offset;havoc malloc_#t~post6, malloc_~size;malloc_~size := malloc_#in~size;malloc_#t~post6 := ~counter~0;~counter~0 := 1 + malloc_#t~post6;malloc_#res.base, malloc_#res.offset := 0, malloc_#t~post6;havoc malloc_#t~post6; 1013#L47-1 main_#t~ret8.base, main_#t~ret8.offset := malloc_#res.base, malloc_#res.offset;main_~b~0.base, main_~b~0.offset := main_#t~ret8.base, main_#t~ret8.offset;havoc main_#t~ret8.base, main_#t~ret8.offset; 1026#L57 assume !((main_~a~0.base == 0 && main_~a~0.offset == 0) || (main_~b~0.base == 0 && main_~b~0.offset == 0));f_#in~pointer.base, f_#in~pointer.offset := main_~a~0.base, main_~a~0.offset;havoc f_#t~mem2.base, f_#t~mem2.offset, f_#t~post1, f_~pointer.base, f_~pointer.offset, f_~i~1;f_~pointer.base, f_~pointer.offset := f_#in~pointer.base, f_#in~pointer.offset;havoc f_~i~1;f_~i~1 := 0; 1016#L25-3 assume !!(f_~i~1 < 2);call f_#t~mem2.base, f_#t~mem2.offset := read~$Pointer$(~#pp~0.base, ~#pp~0.offset + 4 * f_~i~1, 4); 1017#L26 assume f_#t~mem2.base == 0 && f_#t~mem2.offset == 0;havoc f_#t~mem2.base, f_#t~mem2.offset;call write~$Pointer$(f_~pointer.base, f_~pointer.offset, ~#pp~0.base, ~#pp~0.offset + 4 * f_~i~1, 4);call write~int(1, ~#pstate~0.base, ~#pstate~0.offset + 4 * f_~i~1, 4); 1022#L23 f_#in~pointer.base, f_#in~pointer.offset := main_~b~0.base, main_~b~0.offset;havoc f_#t~mem2.base, f_#t~mem2.offset, f_#t~post1, f_~pointer.base, f_~pointer.offset, f_~i~1;f_~pointer.base, f_~pointer.offset := f_#in~pointer.base, f_#in~pointer.offset;havoc f_~i~1;f_~i~1 := 0; 1023#L25-7 assume !!(f_~i~1 < 2);call f_#t~mem2.base, f_#t~mem2.offset := read~$Pointer$(~#pp~0.base, ~#pp~0.offset + 4 * f_~i~1, 4); 1034#L26-1 assume !(f_#t~mem2.base == 0 && f_#t~mem2.offset == 0);havoc f_#t~mem2.base, f_#t~mem2.offset; 1039#L25-6 f_#t~post1 := f_~i~1;f_~i~1 := 1 + f_#t~post1;havoc f_#t~post1; 1035#L25-7 assume !!(f_~i~1 < 2);call f_#t~mem2.base, f_#t~mem2.offset := read~$Pointer$(~#pp~0.base, ~#pp~0.offset + 4 * f_~i~1, 4); 1036#L26-1 assume f_#t~mem2.base == 0 && f_#t~mem2.offset == 0;havoc f_#t~mem2.base, f_#t~mem2.offset;call write~$Pointer$(f_~pointer.base, f_~pointer.offset, ~#pp~0.base, ~#pp~0.offset + 4 * f_~i~1, 4);call write~int(1, ~#pstate~0.base, ~#pstate~0.offset + 4 * f_~i~1, 4); 1018#L23-1 g_#in~pointer.base, g_#in~pointer.offset := main_~a~0.base, main_~a~0.offset;havoc g_#t~mem4.base, g_#t~mem4.offset, g_#t~mem5, g_#t~post3, g_~pointer.base, g_~pointer.offset, g_~i~2;g_~pointer.base, g_~pointer.offset := g_#in~pointer.base, g_#in~pointer.offset;havoc g_~i~2;g_~i~2 := 0; 1019#L36-3 [2019-01-14 03:38:23,761 INFO L796 eck$LassoCheckResult]: Loop: 1019#L36-3 assume !!(g_~i~2 < 2);call g_#t~mem4.base, g_#t~mem4.offset := read~$Pointer$(~#pp~0.base, ~#pp~0.offset + 4 * g_~i~2, 4); 1021#L37 assume !(g_#t~mem4.base == g_~pointer.base && g_#t~mem4.offset == g_~pointer.offset);havoc g_#t~mem4.base, g_#t~mem4.offset; 1025#L36-2 g_#t~post3 := g_~i~2;g_~i~2 := 1 + g_#t~post3;havoc g_#t~post3; 1019#L36-3 [2019-01-14 03:38:23,761 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 03:38:23,762 INFO L82 PathProgramCache]: Analyzing trace with hash 1312987783, now seen corresponding path program 1 times [2019-01-14 03:38:23,762 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 03:38:23,762 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 03:38:23,763 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 03:38:23,763 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 03:38:23,763 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 03:38:23,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 03:38:23,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 03:38:23,816 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 03:38:23,816 INFO L82 PathProgramCache]: Analyzing trace with hash 100776, now seen corresponding path program 4 times [2019-01-14 03:38:23,816 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 03:38:23,816 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 03:38:23,817 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 03:38:23,817 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 03:38:23,817 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 03:38:23,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 03:38:23,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 03:38:23,825 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 03:38:23,826 INFO L82 PathProgramCache]: Analyzing trace with hash 951949666, now seen corresponding path program 1 times [2019-01-14 03:38:23,826 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 03:38:23,826 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 03:38:23,826 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 03:38:23,827 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 03:38:23,827 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 03:38:23,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 03:38:24,022 WARN L181 SmtUtils]: Spent 105.00 ms on a formula simplification that was a NOOP. DAG size: 12 [2019-01-14 03:38:24,431 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-01-14 03:38:24,431 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 03:38:24,431 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-14 03:38:24,441 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 03:38:24,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 03:38:24,476 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 03:38:24,482 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 14 [2019-01-14 03:38:24,500 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 1 [2019-01-14 03:38:24,501 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 03:38:24,529 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 03:38:24,623 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 03:38:24,624 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:18, output treesize:11 [2019-01-14 03:38:24,754 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 24 [2019-01-14 03:38:24,758 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-01-14 03:38:24,758 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 03:38:24,809 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 24 [2019-01-14 03:38:24,813 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 1 [2019-01-14 03:38:24,814 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-14 03:38:24,821 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 03:38:24,824 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-14 03:38:24,847 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 24 [2019-01-14 03:38:24,849 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-01-14 03:38:24,849 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-01-14 03:38:24,861 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 24 [2019-01-14 03:38:24,867 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 1 [2019-01-14 03:38:24,868 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-01-14 03:38:24,872 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 03:38:24,875 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-14 03:38:24,888 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-14 03:38:24,888 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 2 variables, input treesize:76, output treesize:28 [2019-01-14 03:38:24,961 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 41 [2019-01-14 03:38:24,967 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 03:38:24,971 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 27 [2019-01-14 03:38:24,972 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 03:38:24,994 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 43 [2019-01-14 03:38:24,998 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 1 [2019-01-14 03:38:24,998 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-14 03:38:25,005 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 03:38:25,012 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-14 03:38:25,045 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 41 [2019-01-14 03:38:25,049 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 03:38:25,051 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 27 [2019-01-14 03:38:25,051 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-01-14 03:38:25,069 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 43 [2019-01-14 03:38:25,074 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 1 [2019-01-14 03:38:25,075 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-01-14 03:38:25,086 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 03:38:25,091 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-14 03:38:25,111 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-14 03:38:25,112 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 7 variables, input treesize:125, output treesize:24 [2019-01-14 03:38:25,214 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2019-01-14 03:38:25,231 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2019-01-14 03:38:25,232 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 03:38:25,245 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 03:38:25,259 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2019-01-14 03:38:25,267 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2019-01-14 03:38:25,268 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-14 03:38:25,269 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 03:38:25,274 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-14 03:38:25,275 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:35, output treesize:13 [2019-01-14 03:38:25,287 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-01-14 03:38:25,306 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 03:38:25,307 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 14 [2019-01-14 03:38:25,375 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-01-14 03:38:25,376 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=165, Unknown=0, NotChecked=0, Total=210 [2019-01-14 03:38:25,376 INFO L87 Difference]: Start difference. First operand 34 states and 41 transitions. cyclomatic complexity: 11 Second operand 15 states. [2019-01-14 03:38:26,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 03:38:26,167 INFO L93 Difference]: Finished difference Result 39 states and 46 transitions. [2019-01-14 03:38:26,169 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-01-14 03:38:26,169 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 39 states and 46 transitions. [2019-01-14 03:38:26,170 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2019-01-14 03:38:26,171 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 39 states to 39 states and 46 transitions. [2019-01-14 03:38:26,171 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 29 [2019-01-14 03:38:26,171 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 29 [2019-01-14 03:38:26,171 INFO L73 IsDeterministic]: Start isDeterministic. Operand 39 states and 46 transitions. [2019-01-14 03:38:26,171 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-14 03:38:26,171 INFO L706 BuchiCegarLoop]: Abstraction has 39 states and 46 transitions. [2019-01-14 03:38:26,171 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states and 46 transitions. [2019-01-14 03:38:26,173 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 36. [2019-01-14 03:38:26,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2019-01-14 03:38:26,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 43 transitions. [2019-01-14 03:38:26,174 INFO L729 BuchiCegarLoop]: Abstraction has 36 states and 43 transitions. [2019-01-14 03:38:26,174 INFO L609 BuchiCegarLoop]: Abstraction has 36 states and 43 transitions. [2019-01-14 03:38:26,174 INFO L442 BuchiCegarLoop]: ======== Iteration 10============ [2019-01-14 03:38:26,174 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 36 states and 43 transitions. [2019-01-14 03:38:26,175 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2019-01-14 03:38:26,175 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 03:38:26,175 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 03:38:26,176 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 03:38:26,176 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2019-01-14 03:38:26,176 INFO L794 eck$LassoCheckResult]: Stem: 1207#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];call ~#pp~0.base, ~#pp~0.offset := #Ultimate.allocOnStack(8);call write~init~$Pointer$(0, 0, ~#pp~0.base, ~#pp~0.offset, 4);call write~init~$Pointer$(0, 0, ~#pp~0.base, 4 + ~#pp~0.offset, 4);call ~#pstate~0.base, ~#pstate~0.offset := #Ultimate.allocOnStack(8);call write~init~int(0, ~#pstate~0.base, ~#pstate~0.offset, 4);call write~init~int(0, ~#pstate~0.base, 4 + ~#pstate~0.offset, 4);~counter~0 := 1; 1179#L-1 havoc main_#res;havoc main_#t~ret7.base, main_#t~ret7.offset, main_#t~ret8.base, main_#t~ret8.offset, main_~a~0.base, main_~a~0.offset, main_~b~0.base, main_~b~0.offset;havoc main_~a~0.base, main_~a~0.offset;havoc main_~b~0.base, main_~b~0.offset;havoc init_#t~post0, init_~i~0;havoc init_~i~0;init_~i~0 := 0; 1180#L17-3 assume !!(init_~i~0 < 2);call write~$Pointer$(0, 0, ~#pp~0.base, ~#pp~0.offset + 4 * init_~i~0, 4);call write~int(0, ~#pstate~0.base, ~#pstate~0.offset + 4 * init_~i~0, 4); 1208#L17-2 init_#t~post0 := init_~i~0;init_~i~0 := 1 + init_#t~post0;havoc init_#t~post0; 1209#L17-3 assume !!(init_~i~0 < 2);call write~$Pointer$(0, 0, ~#pp~0.base, ~#pp~0.offset + 4 * init_~i~0, 4);call write~int(0, ~#pstate~0.base, ~#pstate~0.offset + 4 * init_~i~0, 4); 1193#L17-2 init_#t~post0 := init_~i~0;init_~i~0 := 1 + init_#t~post0;havoc init_#t~post0; 1194#L17-3 assume !(init_~i~0 < 2); 1195#L15 malloc_#in~size := 4;havoc malloc_#res.base, malloc_#res.offset;havoc malloc_#t~post6, malloc_~size;malloc_~size := malloc_#in~size;malloc_#t~post6 := ~counter~0;~counter~0 := 1 + malloc_#t~post6;malloc_#res.base, malloc_#res.offset := 0, malloc_#t~post6;havoc malloc_#t~post6; 1177#L47 main_#t~ret7.base, main_#t~ret7.offset := malloc_#res.base, malloc_#res.offset;main_~a~0.base, main_~a~0.offset := main_#t~ret7.base, main_#t~ret7.offset;havoc main_#t~ret7.base, main_#t~ret7.offset;malloc_#in~size := 4;havoc malloc_#res.base, malloc_#res.offset;havoc malloc_#t~post6, malloc_~size;malloc_~size := malloc_#in~size;malloc_#t~post6 := ~counter~0;~counter~0 := 1 + malloc_#t~post6;malloc_#res.base, malloc_#res.offset := 0, malloc_#t~post6;havoc malloc_#t~post6; 1178#L47-1 main_#t~ret8.base, main_#t~ret8.offset := malloc_#res.base, malloc_#res.offset;main_~b~0.base, main_~b~0.offset := main_#t~ret8.base, main_#t~ret8.offset;havoc main_#t~ret8.base, main_#t~ret8.offset; 1192#L57 assume !((main_~a~0.base == 0 && main_~a~0.offset == 0) || (main_~b~0.base == 0 && main_~b~0.offset == 0));f_#in~pointer.base, f_#in~pointer.offset := main_~a~0.base, main_~a~0.offset;havoc f_#t~mem2.base, f_#t~mem2.offset, f_#t~post1, f_~pointer.base, f_~pointer.offset, f_~i~1;f_~pointer.base, f_~pointer.offset := f_#in~pointer.base, f_#in~pointer.offset;havoc f_~i~1;f_~i~1 := 0; 1183#L25-3 assume !!(f_~i~1 < 2);call f_#t~mem2.base, f_#t~mem2.offset := read~$Pointer$(~#pp~0.base, ~#pp~0.offset + 4 * f_~i~1, 4); 1184#L26 assume f_#t~mem2.base == 0 && f_#t~mem2.offset == 0;havoc f_#t~mem2.base, f_#t~mem2.offset;call write~$Pointer$(f_~pointer.base, f_~pointer.offset, ~#pp~0.base, ~#pp~0.offset + 4 * f_~i~1, 4);call write~int(1, ~#pstate~0.base, ~#pstate~0.offset + 4 * f_~i~1, 4); 1186#L23 f_#in~pointer.base, f_#in~pointer.offset := main_~b~0.base, main_~b~0.offset;havoc f_#t~mem2.base, f_#t~mem2.offset, f_#t~post1, f_~pointer.base, f_~pointer.offset, f_~i~1;f_~pointer.base, f_~pointer.offset := f_#in~pointer.base, f_#in~pointer.offset;havoc f_~i~1;f_~i~1 := 0; 1187#L25-7 assume !!(f_~i~1 < 2);call f_#t~mem2.base, f_#t~mem2.offset := read~$Pointer$(~#pp~0.base, ~#pp~0.offset + 4 * f_~i~1, 4); 1200#L26-1 assume !(f_#t~mem2.base == 0 && f_#t~mem2.offset == 0);havoc f_#t~mem2.base, f_#t~mem2.offset; 1205#L25-6 f_#t~post1 := f_~i~1;f_~i~1 := 1 + f_#t~post1;havoc f_#t~post1; 1201#L25-7 assume !!(f_~i~1 < 2);call f_#t~mem2.base, f_#t~mem2.offset := read~$Pointer$(~#pp~0.base, ~#pp~0.offset + 4 * f_~i~1, 4); 1202#L26-1 assume f_#t~mem2.base == 0 && f_#t~mem2.offset == 0;havoc f_#t~mem2.base, f_#t~mem2.offset;call write~$Pointer$(f_~pointer.base, f_~pointer.offset, ~#pp~0.base, ~#pp~0.offset + 4 * f_~i~1, 4);call write~int(1, ~#pstate~0.base, ~#pstate~0.offset + 4 * f_~i~1, 4); 1181#L23-1 g_#in~pointer.base, g_#in~pointer.offset := main_~a~0.base, main_~a~0.offset;havoc g_#t~mem4.base, g_#t~mem4.offset, g_#t~mem5, g_#t~post3, g_~pointer.base, g_~pointer.offset, g_~i~2;g_~pointer.base, g_~pointer.offset := g_#in~pointer.base, g_#in~pointer.offset;havoc g_~i~2;g_~i~2 := 0; 1182#L36-3 assume !!(g_~i~2 < 2);call g_#t~mem4.base, g_#t~mem4.offset := read~$Pointer$(~#pp~0.base, ~#pp~0.offset + 4 * g_~i~2, 4); 1185#L37 assume g_#t~mem4.base == g_~pointer.base && g_#t~mem4.offset == g_~pointer.offset;havoc g_#t~mem4.base, g_#t~mem4.offset;call g_#t~mem5 := read~int(~#pstate~0.base, ~#pstate~0.offset + 4 * g_~i~2, 4); 1196#L39 [2019-01-14 03:38:26,176 INFO L796 eck$LassoCheckResult]: Loop: 1196#L39 assume 1 == g_#t~mem5; 1199#L4 havoc g_#t~mem5;call write~int(2, ~#pstate~0.base, ~#pstate~0.offset + 4 * g_~i~2, 4); 1188#L36-2 g_#t~post3 := g_~i~2;g_~i~2 := 1 + g_#t~post3;havoc g_#t~post3; 1189#L36-3 assume !!(g_~i~2 < 2);call g_#t~mem4.base, g_#t~mem4.offset := read~$Pointer$(~#pp~0.base, ~#pp~0.offset + 4 * g_~i~2, 4); 1210#L37 assume g_#t~mem4.base == g_~pointer.base && g_#t~mem4.offset == g_~pointer.offset;havoc g_#t~mem4.base, g_#t~mem4.offset;call g_#t~mem5 := read~int(~#pstate~0.base, ~#pstate~0.offset + 4 * g_~i~2, 4); 1196#L39 [2019-01-14 03:38:26,176 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 03:38:26,176 INFO L82 PathProgramCache]: Analyzing trace with hash -939123286, now seen corresponding path program 1 times [2019-01-14 03:38:26,177 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 03:38:26,177 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 03:38:26,177 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 03:38:26,178 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 03:38:26,178 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 03:38:26,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 03:38:26,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 03:38:26,231 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 03:38:26,231 INFO L82 PathProgramCache]: Analyzing trace with hash 102329555, now seen corresponding path program 1 times [2019-01-14 03:38:26,231 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 03:38:26,231 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 03:38:26,232 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 03:38:26,232 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 03:38:26,232 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 03:38:26,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 03:38:26,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 03:38:26,239 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 03:38:26,239 INFO L82 PathProgramCache]: Analyzing trace with hash -289378102, now seen corresponding path program 1 times [2019-01-14 03:38:26,239 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 03:38:26,239 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 03:38:26,240 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 03:38:26,240 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 03:38:26,240 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 03:38:26,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 03:38:26,568 WARN L181 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 28 DAG size of output: 17 [2019-01-14 03:38:27,064 WARN L181 SmtUtils]: Spent 225.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 25 [2019-01-14 03:38:27,355 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-01-14 03:38:27,356 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 03:38:27,356 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-14 03:38:27,379 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 03:38:27,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 03:38:27,421 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 03:38:27,425 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 14 [2019-01-14 03:38:27,438 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 1 [2019-01-14 03:38:27,438 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 03:38:27,450 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 03:38:27,461 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 03:38:27,462 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:18, output treesize:11 [2019-01-14 03:38:27,623 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 30 [2019-01-14 03:38:27,626 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2019-01-14 03:38:27,626 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 03:38:27,639 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 30 [2019-01-14 03:38:27,650 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 1 [2019-01-14 03:38:27,651 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-14 03:38:27,684 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 03:38:27,686 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-14 03:38:27,696 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-14 03:38:27,696 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 1 variables, input treesize:50, output treesize:20 [2019-01-14 03:38:27,850 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 34 [2019-01-14 03:38:27,861 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 1 [2019-01-14 03:38:27,862 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 03:38:27,883 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 03:38:27,893 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-14 03:38:27,894 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:46, output treesize:19 [2019-01-14 03:38:27,956 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2019-01-14 03:38:27,958 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2019-01-14 03:38:27,958 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 03:38:27,961 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 03:38:27,966 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-14 03:38:27,966 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:18, output treesize:7 [2019-01-14 03:38:27,994 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-01-14 03:38:28,015 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 03:38:28,015 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 11] total 24 [2019-01-14 03:38:28,142 WARN L181 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 73 [2019-01-14 03:38:28,195 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-01-14 03:38:28,195 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=586, Unknown=0, NotChecked=0, Total=650 [2019-01-14 03:38:28,196 INFO L87 Difference]: Start difference. First operand 36 states and 43 transitions. cyclomatic complexity: 11 Second operand 26 states. [2019-01-14 03:38:30,371 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 03:38:30,372 INFO L93 Difference]: Finished difference Result 72 states and 83 transitions. [2019-01-14 03:38:30,374 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-01-14 03:38:30,374 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 72 states and 83 transitions. [2019-01-14 03:38:30,375 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 26 [2019-01-14 03:38:30,376 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 72 states to 72 states and 83 transitions. [2019-01-14 03:38:30,376 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 60 [2019-01-14 03:38:30,377 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 60 [2019-01-14 03:38:30,377 INFO L73 IsDeterministic]: Start isDeterministic. Operand 72 states and 83 transitions. [2019-01-14 03:38:30,377 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-14 03:38:30,377 INFO L706 BuchiCegarLoop]: Abstraction has 72 states and 83 transitions. [2019-01-14 03:38:30,377 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states and 83 transitions. [2019-01-14 03:38:30,381 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 52. [2019-01-14 03:38:30,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2019-01-14 03:38:30,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 60 transitions. [2019-01-14 03:38:30,382 INFO L729 BuchiCegarLoop]: Abstraction has 52 states and 60 transitions. [2019-01-14 03:38:30,382 INFO L609 BuchiCegarLoop]: Abstraction has 52 states and 60 transitions. [2019-01-14 03:38:30,382 INFO L442 BuchiCegarLoop]: ======== Iteration 11============ [2019-01-14 03:38:30,382 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 52 states and 60 transitions. [2019-01-14 03:38:30,383 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 13 [2019-01-14 03:38:30,383 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 03:38:30,383 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 03:38:30,384 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 03:38:30,384 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2019-01-14 03:38:30,384 INFO L794 eck$LassoCheckResult]: Stem: 1465#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];call ~#pp~0.base, ~#pp~0.offset := #Ultimate.allocOnStack(8);call write~init~$Pointer$(0, 0, ~#pp~0.base, ~#pp~0.offset, 4);call write~init~$Pointer$(0, 0, ~#pp~0.base, 4 + ~#pp~0.offset, 4);call ~#pstate~0.base, ~#pstate~0.offset := #Ultimate.allocOnStack(8);call write~init~int(0, ~#pstate~0.base, ~#pstate~0.offset, 4);call write~init~int(0, ~#pstate~0.base, 4 + ~#pstate~0.offset, 4);~counter~0 := 1; 1434#L-1 havoc main_#res;havoc main_#t~ret7.base, main_#t~ret7.offset, main_#t~ret8.base, main_#t~ret8.offset, main_~a~0.base, main_~a~0.offset, main_~b~0.base, main_~b~0.offset;havoc main_~a~0.base, main_~a~0.offset;havoc main_~b~0.base, main_~b~0.offset;havoc init_#t~post0, init_~i~0;havoc init_~i~0;init_~i~0 := 0; 1435#L17-3 assume !!(init_~i~0 < 2);call write~$Pointer$(0, 0, ~#pp~0.base, ~#pp~0.offset + 4 * init_~i~0, 4);call write~int(0, ~#pstate~0.base, ~#pstate~0.offset + 4 * init_~i~0, 4); 1448#L17-2 init_#t~post0 := init_~i~0;init_~i~0 := 1 + init_#t~post0;havoc init_#t~post0; 1449#L17-3 assume !!(init_~i~0 < 2);call write~$Pointer$(0, 0, ~#pp~0.base, ~#pp~0.offset + 4 * init_~i~0, 4);call write~int(0, ~#pstate~0.base, ~#pstate~0.offset + 4 * init_~i~0, 4); 1466#L17-2 init_#t~post0 := init_~i~0;init_~i~0 := 1 + init_#t~post0;havoc init_#t~post0; 1468#L17-3 assume !(init_~i~0 < 2); 1450#L15 malloc_#in~size := 4;havoc malloc_#res.base, malloc_#res.offset;havoc malloc_#t~post6, malloc_~size;malloc_~size := malloc_#in~size;malloc_#t~post6 := ~counter~0;~counter~0 := 1 + malloc_#t~post6;malloc_#res.base, malloc_#res.offset := 0, malloc_#t~post6;havoc malloc_#t~post6; 1432#L47 main_#t~ret7.base, main_#t~ret7.offset := malloc_#res.base, malloc_#res.offset;main_~a~0.base, main_~a~0.offset := main_#t~ret7.base, main_#t~ret7.offset;havoc main_#t~ret7.base, main_#t~ret7.offset;malloc_#in~size := 4;havoc malloc_#res.base, malloc_#res.offset;havoc malloc_#t~post6, malloc_~size;malloc_~size := malloc_#in~size;malloc_#t~post6 := ~counter~0;~counter~0 := 1 + malloc_#t~post6;malloc_#res.base, malloc_#res.offset := 0, malloc_#t~post6;havoc malloc_#t~post6; 1433#L47-1 main_#t~ret8.base, main_#t~ret8.offset := malloc_#res.base, malloc_#res.offset;main_~b~0.base, main_~b~0.offset := main_#t~ret8.base, main_#t~ret8.offset;havoc main_#t~ret8.base, main_#t~ret8.offset; 1447#L57 assume !((main_~a~0.base == 0 && main_~a~0.offset == 0) || (main_~b~0.base == 0 && main_~b~0.offset == 0));f_#in~pointer.base, f_#in~pointer.offset := main_~a~0.base, main_~a~0.offset;havoc f_#t~mem2.base, f_#t~mem2.offset, f_#t~post1, f_~pointer.base, f_~pointer.offset, f_~i~1;f_~pointer.base, f_~pointer.offset := f_#in~pointer.base, f_#in~pointer.offset;havoc f_~i~1;f_~i~1 := 0; 1436#L25-3 assume !!(f_~i~1 < 2);call f_#t~mem2.base, f_#t~mem2.offset := read~$Pointer$(~#pp~0.base, ~#pp~0.offset + 4 * f_~i~1, 4); 1437#L26 assume f_#t~mem2.base == 0 && f_#t~mem2.offset == 0;havoc f_#t~mem2.base, f_#t~mem2.offset;call write~$Pointer$(f_~pointer.base, f_~pointer.offset, ~#pp~0.base, ~#pp~0.offset + 4 * f_~i~1, 4);call write~int(1, ~#pstate~0.base, ~#pstate~0.offset + 4 * f_~i~1, 4); 1441#L23 f_#in~pointer.base, f_#in~pointer.offset := main_~b~0.base, main_~b~0.offset;havoc f_#t~mem2.base, f_#t~mem2.offset, f_#t~post1, f_~pointer.base, f_~pointer.offset, f_~i~1;f_~pointer.base, f_~pointer.offset := f_#in~pointer.base, f_#in~pointer.offset;havoc f_~i~1;f_~i~1 := 0; 1442#L25-7 assume !!(f_~i~1 < 2);call f_#t~mem2.base, f_#t~mem2.offset := read~$Pointer$(~#pp~0.base, ~#pp~0.offset + 4 * f_~i~1, 4); 1457#L26-1 assume !(f_#t~mem2.base == 0 && f_#t~mem2.offset == 0);havoc f_#t~mem2.base, f_#t~mem2.offset; 1473#L25-6 f_#t~post1 := f_~i~1;f_~i~1 := 1 + f_#t~post1;havoc f_#t~post1; 1458#L25-7 assume !!(f_~i~1 < 2);call f_#t~mem2.base, f_#t~mem2.offset := read~$Pointer$(~#pp~0.base, ~#pp~0.offset + 4 * f_~i~1, 4); 1460#L26-1 assume !(f_#t~mem2.base == 0 && f_#t~mem2.offset == 0);havoc f_#t~mem2.base, f_#t~mem2.offset; 1462#L25-6 f_#t~post1 := f_~i~1;f_~i~1 := 1 + f_#t~post1;havoc f_#t~post1; 1463#L25-7 assume !(f_~i~1 < 2); 1471#L23-1 g_#in~pointer.base, g_#in~pointer.offset := main_~a~0.base, main_~a~0.offset;havoc g_#t~mem4.base, g_#t~mem4.offset, g_#t~mem5, g_#t~post3, g_~pointer.base, g_~pointer.offset, g_~i~2;g_~pointer.base, g_~pointer.offset := g_#in~pointer.base, g_#in~pointer.offset;havoc g_~i~2;g_~i~2 := 0; 1478#L36-3 assume !!(g_~i~2 < 2);call g_#t~mem4.base, g_#t~mem4.offset := read~$Pointer$(~#pp~0.base, ~#pp~0.offset + 4 * g_~i~2, 4); 1477#L37 assume g_#t~mem4.base == g_~pointer.base && g_#t~mem4.offset == g_~pointer.offset;havoc g_#t~mem4.base, g_#t~mem4.offset;call g_#t~mem5 := read~int(~#pstate~0.base, ~#pstate~0.offset + 4 * g_~i~2, 4); 1476#L39 [2019-01-14 03:38:30,384 INFO L796 eck$LassoCheckResult]: Loop: 1476#L39 assume 1 == g_#t~mem5; 1474#L4 havoc g_#t~mem5;call write~int(2, ~#pstate~0.base, ~#pstate~0.offset + 4 * g_~i~2, 4); 1445#L36-2 g_#t~post3 := g_~i~2;g_~i~2 := 1 + g_#t~post3;havoc g_#t~post3; 1446#L36-3 assume !!(g_~i~2 < 2);call g_#t~mem4.base, g_#t~mem4.offset := read~$Pointer$(~#pp~0.base, ~#pp~0.offset + 4 * g_~i~2, 4); 1475#L37 assume g_#t~mem4.base == g_~pointer.base && g_#t~mem4.offset == g_~pointer.offset;havoc g_#t~mem4.base, g_#t~mem4.offset;call g_#t~mem5 := read~int(~#pstate~0.base, ~#pstate~0.offset + 4 * g_~i~2, 4); 1476#L39 [2019-01-14 03:38:30,385 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 03:38:30,385 INFO L82 PathProgramCache]: Analyzing trace with hash -501415375, now seen corresponding path program 1 times [2019-01-14 03:38:30,385 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 03:38:30,385 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 03:38:30,386 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 03:38:30,386 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 03:38:30,386 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 03:38:30,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 03:38:30,811 WARN L181 SmtUtils]: Spent 320.00 ms on a formula simplification. DAG size of input: 22 DAG size of output: 11 [2019-01-14 03:38:31,282 WARN L181 SmtUtils]: Spent 370.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 29 [2019-01-14 03:38:31,736 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-14 03:38:31,736 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 03:38:31,736 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-14 03:38:31,749 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 03:38:31,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 03:38:31,786 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 03:38:31,791 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 14 [2019-01-14 03:38:31,810 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 1 [2019-01-14 03:38:31,811 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 03:38:31,814 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 03:38:31,822 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 03:38:31,823 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:18, output treesize:11 [2019-01-14 03:38:31,912 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 30 [2019-01-14 03:38:31,916 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2019-01-14 03:38:31,917 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 03:38:31,942 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 30 [2019-01-14 03:38:31,948 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 1 [2019-01-14 03:38:31,949 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-14 03:38:31,962 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 03:38:31,966 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-14 03:38:31,995 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 30 [2019-01-14 03:38:31,999 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2019-01-14 03:38:31,999 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-01-14 03:38:32,017 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 30 [2019-01-14 03:38:32,021 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 1 [2019-01-14 03:38:32,022 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-01-14 03:38:32,032 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 03:38:32,039 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-14 03:38:32,053 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-14 03:38:32,053 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 2 variables, input treesize:89, output treesize:29 [2019-01-14 03:38:32,289 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 43 [2019-01-14 03:38:32,314 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 03:38:32,319 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 31 [2019-01-14 03:38:32,320 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 03:38:32,345 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 45 [2019-01-14 03:38:32,350 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 1 [2019-01-14 03:38:32,350 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-14 03:38:32,362 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 03:38:32,370 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-14 03:38:32,398 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 43 [2019-01-14 03:38:32,403 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 03:38:32,407 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 31 [2019-01-14 03:38:32,407 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-01-14 03:38:32,432 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 45 [2019-01-14 03:38:32,437 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 1 [2019-01-14 03:38:32,437 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-01-14 03:38:32,451 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 03:38:32,460 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-14 03:38:32,478 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-14 03:38:32,478 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 7 variables, input treesize:123, output treesize:22 [2019-01-14 03:38:32,579 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2019-01-14 03:38:32,596 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2019-01-14 03:38:32,597 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 03:38:32,622 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 03:38:32,696 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2019-01-14 03:38:32,699 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2019-01-14 03:38:32,700 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-14 03:38:32,703 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 03:38:32,711 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-14 03:38:32,712 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:29, output treesize:7 [2019-01-14 03:38:32,748 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 03:38:32,767 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 03:38:32,767 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 12] total 21 [2019-01-14 03:38:32,768 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-01-14 03:38:32,768 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 03:38:32,768 INFO L82 PathProgramCache]: Analyzing trace with hash 102329555, now seen corresponding path program 2 times [2019-01-14 03:38:32,769 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 03:38:32,769 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 03:38:32,770 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 03:38:32,770 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 03:38:32,770 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 03:38:32,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 03:38:32,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 03:38:32,949 WARN L181 SmtUtils]: Spent 161.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 73 [2019-01-14 03:38:33,004 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-01-14 03:38:33,004 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=387, Unknown=0, NotChecked=0, Total=462 [2019-01-14 03:38:33,004 INFO L87 Difference]: Start difference. First operand 52 states and 60 transitions. cyclomatic complexity: 13 Second operand 22 states. [2019-01-14 03:38:34,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 03:38:34,019 INFO L93 Difference]: Finished difference Result 37 states and 40 transitions. [2019-01-14 03:38:34,020 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-01-14 03:38:34,021 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 37 states and 40 transitions. [2019-01-14 03:38:34,022 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 8 [2019-01-14 03:38:34,023 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 37 states to 36 states and 39 transitions. [2019-01-14 03:38:34,023 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 28 [2019-01-14 03:38:34,023 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 31 [2019-01-14 03:38:34,023 INFO L73 IsDeterministic]: Start isDeterministic. Operand 36 states and 39 transitions. [2019-01-14 03:38:34,024 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-14 03:38:34,024 INFO L706 BuchiCegarLoop]: Abstraction has 36 states and 39 transitions. [2019-01-14 03:38:34,024 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states and 39 transitions. [2019-01-14 03:38:34,027 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 35. [2019-01-14 03:38:34,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2019-01-14 03:38:34,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 38 transitions. [2019-01-14 03:38:34,034 INFO L729 BuchiCegarLoop]: Abstraction has 35 states and 38 transitions. [2019-01-14 03:38:34,034 INFO L609 BuchiCegarLoop]: Abstraction has 35 states and 38 transitions. [2019-01-14 03:38:34,034 INFO L442 BuchiCegarLoop]: ======== Iteration 12============ [2019-01-14 03:38:34,034 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 35 states and 38 transitions. [2019-01-14 03:38:34,035 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 8 [2019-01-14 03:38:34,035 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 03:38:34,035 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 03:38:34,035 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 03:38:34,036 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-01-14 03:38:34,036 INFO L794 eck$LassoCheckResult]: Stem: 1665#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];call ~#pp~0.base, ~#pp~0.offset := #Ultimate.allocOnStack(8);call write~init~$Pointer$(0, 0, ~#pp~0.base, ~#pp~0.offset, 4);call write~init~$Pointer$(0, 0, ~#pp~0.base, 4 + ~#pp~0.offset, 4);call ~#pstate~0.base, ~#pstate~0.offset := #Ultimate.allocOnStack(8);call write~init~int(0, ~#pstate~0.base, ~#pstate~0.offset, 4);call write~init~int(0, ~#pstate~0.base, 4 + ~#pstate~0.offset, 4);~counter~0 := 1; 1639#L-1 havoc main_#res;havoc main_#t~ret7.base, main_#t~ret7.offset, main_#t~ret8.base, main_#t~ret8.offset, main_~a~0.base, main_~a~0.offset, main_~b~0.base, main_~b~0.offset;havoc main_~a~0.base, main_~a~0.offset;havoc main_~b~0.base, main_~b~0.offset;havoc init_#t~post0, init_~i~0;havoc init_~i~0;init_~i~0 := 0; 1640#L17-3 assume !!(init_~i~0 < 2);call write~$Pointer$(0, 0, ~#pp~0.base, ~#pp~0.offset + 4 * init_~i~0, 4);call write~int(0, ~#pstate~0.base, ~#pstate~0.offset + 4 * init_~i~0, 4); 1653#L17-2 init_#t~post0 := init_~i~0;init_~i~0 := 1 + init_#t~post0;havoc init_#t~post0; 1654#L17-3 assume !!(init_~i~0 < 2);call write~$Pointer$(0, 0, ~#pp~0.base, ~#pp~0.offset + 4 * init_~i~0, 4);call write~int(0, ~#pstate~0.base, ~#pstate~0.offset + 4 * init_~i~0, 4); 1666#L17-2 init_#t~post0 := init_~i~0;init_~i~0 := 1 + init_#t~post0;havoc init_#t~post0; 1671#L17-3 assume !(init_~i~0 < 2); 1655#L15 malloc_#in~size := 4;havoc malloc_#res.base, malloc_#res.offset;havoc malloc_#t~post6, malloc_~size;malloc_~size := malloc_#in~size;malloc_#t~post6 := ~counter~0;~counter~0 := 1 + malloc_#t~post6;malloc_#res.base, malloc_#res.offset := 0, malloc_#t~post6;havoc malloc_#t~post6; 1637#L47 main_#t~ret7.base, main_#t~ret7.offset := malloc_#res.base, malloc_#res.offset;main_~a~0.base, main_~a~0.offset := main_#t~ret7.base, main_#t~ret7.offset;havoc main_#t~ret7.base, main_#t~ret7.offset;malloc_#in~size := 4;havoc malloc_#res.base, malloc_#res.offset;havoc malloc_#t~post6, malloc_~size;malloc_~size := malloc_#in~size;malloc_#t~post6 := ~counter~0;~counter~0 := 1 + malloc_#t~post6;malloc_#res.base, malloc_#res.offset := 0, malloc_#t~post6;havoc malloc_#t~post6; 1638#L47-1 main_#t~ret8.base, main_#t~ret8.offset := malloc_#res.base, malloc_#res.offset;main_~b~0.base, main_~b~0.offset := main_#t~ret8.base, main_#t~ret8.offset;havoc main_#t~ret8.base, main_#t~ret8.offset; 1652#L57 assume !((main_~a~0.base == 0 && main_~a~0.offset == 0) || (main_~b~0.base == 0 && main_~b~0.offset == 0));f_#in~pointer.base, f_#in~pointer.offset := main_~a~0.base, main_~a~0.offset;havoc f_#t~mem2.base, f_#t~mem2.offset, f_#t~post1, f_~pointer.base, f_~pointer.offset, f_~i~1;f_~pointer.base, f_~pointer.offset := f_#in~pointer.base, f_#in~pointer.offset;havoc f_~i~1;f_~i~1 := 0; 1641#L25-3 assume !!(f_~i~1 < 2);call f_#t~mem2.base, f_#t~mem2.offset := read~$Pointer$(~#pp~0.base, ~#pp~0.offset + 4 * f_~i~1, 4); 1642#L26 assume f_#t~mem2.base == 0 && f_#t~mem2.offset == 0;havoc f_#t~mem2.base, f_#t~mem2.offset;call write~$Pointer$(f_~pointer.base, f_~pointer.offset, ~#pp~0.base, ~#pp~0.offset + 4 * f_~i~1, 4);call write~int(1, ~#pstate~0.base, ~#pstate~0.offset + 4 * f_~i~1, 4); 1646#L23 f_#in~pointer.base, f_#in~pointer.offset := main_~b~0.base, main_~b~0.offset;havoc f_#t~mem2.base, f_#t~mem2.offset, f_#t~post1, f_~pointer.base, f_~pointer.offset, f_~i~1;f_~pointer.base, f_~pointer.offset := f_#in~pointer.base, f_#in~pointer.offset;havoc f_~i~1;f_~i~1 := 0; 1647#L25-7 assume !!(f_~i~1 < 2);call f_#t~mem2.base, f_#t~mem2.offset := read~$Pointer$(~#pp~0.base, ~#pp~0.offset + 4 * f_~i~1, 4); 1660#L26-1 assume !(f_#t~mem2.base == 0 && f_#t~mem2.offset == 0);havoc f_#t~mem2.base, f_#t~mem2.offset; 1662#L25-6 f_#t~post1 := f_~i~1;f_~i~1 := 1 + f_#t~post1;havoc f_#t~post1; 1663#L25-7 assume !!(f_~i~1 < 2);call f_#t~mem2.base, f_#t~mem2.offset := read~$Pointer$(~#pp~0.base, ~#pp~0.offset + 4 * f_~i~1, 4); 1667#L26-1 assume f_#t~mem2.base == 0 && f_#t~mem2.offset == 0;havoc f_#t~mem2.base, f_#t~mem2.offset;call write~$Pointer$(f_~pointer.base, f_~pointer.offset, ~#pp~0.base, ~#pp~0.offset + 4 * f_~i~1, 4);call write~int(1, ~#pstate~0.base, ~#pstate~0.offset + 4 * f_~i~1, 4); 1643#L23-1 g_#in~pointer.base, g_#in~pointer.offset := main_~a~0.base, main_~a~0.offset;havoc g_#t~mem4.base, g_#t~mem4.offset, g_#t~mem5, g_#t~post3, g_~pointer.base, g_~pointer.offset, g_~i~2;g_~pointer.base, g_~pointer.offset := g_#in~pointer.base, g_#in~pointer.offset;havoc g_~i~2;g_~i~2 := 0; 1644#L36-3 assume !!(g_~i~2 < 2);call g_#t~mem4.base, g_#t~mem4.offset := read~$Pointer$(~#pp~0.base, ~#pp~0.offset + 4 * g_~i~2, 4); 1645#L37 assume g_#t~mem4.base == g_~pointer.base && g_#t~mem4.offset == g_~pointer.offset;havoc g_#t~mem4.base, g_#t~mem4.offset;call g_#t~mem5 := read~int(~#pstate~0.base, ~#pstate~0.offset + 4 * g_~i~2, 4); 1656#L39 assume 1 == g_#t~mem5; 1659#L4 havoc g_#t~mem5;call write~int(2, ~#pstate~0.base, ~#pstate~0.offset + 4 * g_~i~2, 4); 1648#L36-2 g_#t~post3 := g_~i~2;g_~i~2 := 1 + g_#t~post3;havoc g_#t~post3; 1649#L36-3 assume !!(g_~i~2 < 2);call g_#t~mem4.base, g_#t~mem4.offset := read~$Pointer$(~#pp~0.base, ~#pp~0.offset + 4 * g_~i~2, 4); 1669#L37 [2019-01-14 03:38:34,036 INFO L796 eck$LassoCheckResult]: Loop: 1669#L37 assume !(g_#t~mem4.base == g_~pointer.base && g_#t~mem4.offset == g_~pointer.offset);havoc g_#t~mem4.base, g_#t~mem4.offset; 1670#L36-2 g_#t~post3 := g_~i~2;g_~i~2 := 1 + g_#t~post3;havoc g_#t~post3; 1668#L36-3 assume !!(g_~i~2 < 2);call g_#t~mem4.base, g_#t~mem4.offset := read~$Pointer$(~#pp~0.base, ~#pp~0.offset + 4 * g_~i~2, 4); 1669#L37 [2019-01-14 03:38:34,036 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 03:38:34,036 INFO L82 PathProgramCache]: Analyzing trace with hash -147882112, now seen corresponding path program 2 times [2019-01-14 03:38:34,037 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 03:38:34,037 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 03:38:34,041 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 03:38:34,041 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 03:38:34,041 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 03:38:34,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 03:38:34,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 03:38:34,113 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 03:38:34,114 INFO L82 PathProgramCache]: Analyzing trace with hash 115236, now seen corresponding path program 5 times [2019-01-14 03:38:34,114 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 03:38:34,114 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 03:38:34,117 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 03:38:34,117 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 03:38:34,118 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 03:38:34,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 03:38:34,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 03:38:34,126 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 03:38:34,126 INFO L82 PathProgramCache]: Analyzing trace with hash 1080532549, now seen corresponding path program 1 times [2019-01-14 03:38:34,126 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 03:38:34,126 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 03:38:34,127 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 03:38:34,127 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 03:38:34,127 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 03:38:34,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 03:38:34,347 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-01-14 03:38:34,347 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 03:38:34,348 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-14 03:38:34,371 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 03:38:34,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 03:38:34,410 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 03:38:34,413 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-01-14 03:38:34,432 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-01-14 03:38:34,432 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 5 [2019-01-14 03:38:34,472 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-14 03:38:34,472 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-01-14 03:38:34,472 INFO L87 Difference]: Start difference. First operand 35 states and 38 transitions. cyclomatic complexity: 6 Second operand 6 states. [2019-01-14 03:38:34,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 03:38:34,549 INFO L93 Difference]: Finished difference Result 41 states and 43 transitions. [2019-01-14 03:38:34,551 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-14 03:38:34,551 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 41 states and 43 transitions. [2019-01-14 03:38:34,552 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-01-14 03:38:34,552 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 41 states to 0 states and 0 transitions. [2019-01-14 03:38:34,552 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2019-01-14 03:38:34,552 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2019-01-14 03:38:34,552 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2019-01-14 03:38:34,552 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-14 03:38:34,552 INFO L706 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-14 03:38:34,552 INFO L729 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-14 03:38:34,553 INFO L609 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-14 03:38:34,557 INFO L442 BuchiCegarLoop]: ======== Iteration 13============ [2019-01-14 03:38:34,557 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2019-01-14 03:38:34,557 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-01-14 03:38:34,557 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2019-01-14 03:38:34,568 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 14.01 03:38:34 BoogieIcfgContainer [2019-01-14 03:38:34,568 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2019-01-14 03:38:34,568 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-14 03:38:34,568 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-14 03:38:34,568 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-14 03:38:34,569 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 03:36:18" (3/4) ... [2019-01-14 03:38:34,577 INFO L147 WitnessPrinter]: No result that supports witness generation found [2019-01-14 03:38:34,578 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-14 03:38:34,578 INFO L168 Benchmark]: Toolchain (without parser) took 137403.95 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 274.7 MB). Free memory was 950.0 MB in the beginning and 1.1 GB in the end (delta: -102.9 MB). Peak memory consumption was 171.8 MB. Max. memory is 11.5 GB. [2019-01-14 03:38:34,581 INFO L168 Benchmark]: CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-14 03:38:34,581 INFO L168 Benchmark]: CACSL2BoogieTranslator took 355.08 ms. Allocated memory is still 1.0 GB. Free memory was 950.0 MB in the beginning and 939.3 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2019-01-14 03:38:34,582 INFO L168 Benchmark]: Boogie Procedure Inliner took 81.61 ms. Allocated memory is still 1.0 GB. Free memory was 939.3 MB in the beginning and 933.9 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2019-01-14 03:38:34,582 INFO L168 Benchmark]: Boogie Preprocessor took 120.23 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 73.9 MB). Free memory was 933.9 MB in the beginning and 1.1 GB in the end (delta: -125.9 MB). Peak memory consumption was 13.5 MB. Max. memory is 11.5 GB. [2019-01-14 03:38:34,583 INFO L168 Benchmark]: RCFGBuilder took 772.21 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 25.6 MB). Peak memory consumption was 25.6 MB. Max. memory is 11.5 GB. [2019-01-14 03:38:34,583 INFO L168 Benchmark]: BuchiAutomizer took 136060.16 ms. Allocated memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: 200.8 MB). Free memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: -29.4 MB). Peak memory consumption was 171.4 MB. Max. memory is 11.5 GB. [2019-01-14 03:38:34,583 INFO L168 Benchmark]: Witness Printer took 9.60 ms. Allocated memory is still 1.3 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-14 03:38:34,585 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 355.08 ms. Allocated memory is still 1.0 GB. Free memory was 950.0 MB in the beginning and 939.3 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 81.61 ms. Allocated memory is still 1.0 GB. Free memory was 939.3 MB in the beginning and 933.9 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 120.23 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 73.9 MB). Free memory was 933.9 MB in the beginning and 1.1 GB in the end (delta: -125.9 MB). Peak memory consumption was 13.5 MB. Max. memory is 11.5 GB. * RCFGBuilder took 772.21 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 25.6 MB). Peak memory consumption was 25.6 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 136060.16 ms. Allocated memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: 200.8 MB). Free memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: -29.4 MB). Peak memory consumption was 171.4 MB. Max. memory is 11.5 GB. * Witness Printer took 9.60 ms. Allocated memory is still 1.3 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #length * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 12 terminating modules (10 trivial, 2 deterministic, 0 nondeterministic). One deterministic module has affine ranking function unknown-#length-unknown[pp] + -3 * i and consists of 5 locations. One deterministic module has affine ranking function -2 * i + 3 and consists of 4 locations. 10 modules have a trivial ranking function, the largest among these consists of 26 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 136.0s and 13 iterations. TraceHistogramMax:2. Analysis of lassos took 128.9s. Construction of modules took 2.2s. Büchi inclusion checks took 4.5s. Highest rank in rank-based complementation 3. Minimization of det autom 6. Minimization of nondet autom 6. Automata minimization 0.0s AutomataMinimizationTime, 11 MinimizatonAttempts, 78 StatesRemovedByMinimization, 8 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 52 states and ocurred in iteration 10. Nontrivial modules had stage [2, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 288 SDtfs, 836 SDslu, 799 SDs, 0 SdLazy, 1195 SolverSat, 313 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.2s Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc4 concLT0 SILN0 SILU6 SILI0 SILT0 lasso2 LassoPreprocessingBenchmarks: Lassos: inital1082 mio100 ax100 hnf100 lsp96 ukn24 mio100 lsp45 div100 bol100 ite100 ukn100 eq169 hnf77 smp100 dnf100 smp100 tf100 neg100 sie112 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 70ms VariablesStem: 6 VariablesLoop: 2 DisjunctsStem: 1 DisjunctsLoop: 4 SupportingInvariants: 8 MotzkinApplications: 48 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! Received shutdown request...