./Ultimate.py --spec ../../sv-benchmarks/c/Termination.prp --file ../../sv-benchmarks/c/ldv-regression/ex3_forlist_true-termination.c_true-unreach-call.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 5842f4b8 Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_32a682b5-12ae-445a-a4a1-22782da750c8/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_32a682b5-12ae-445a-a4a1-22782da750c8/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_32a682b5-12ae-445a-a4a1-22782da750c8/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_32a682b5-12ae-445a-a4a1-22782da750c8/bin-2019/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/ldv-regression/ex3_forlist_true-termination.c_true-unreach-call.i -s /tmp/vcloud-vcloud-master/worker/working_dir_32a682b5-12ae-445a-a4a1-22782da750c8/bin-2019/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_32a682b5-12ae-445a-a4a1-22782da750c8/bin-2019/uautomizer --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.23-5842f4b [2018-11-18 12:21:09,552 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-18 12:21:09,553 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-18 12:21:09,561 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-18 12:21:09,561 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-18 12:21:09,562 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-18 12:21:09,563 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-18 12:21:09,564 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-18 12:21:09,565 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-18 12:21:09,565 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-18 12:21:09,566 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-18 12:21:09,566 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-18 12:21:09,567 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-18 12:21:09,568 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-18 12:21:09,568 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-18 12:21:09,569 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-18 12:21:09,569 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-18 12:21:09,571 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-18 12:21:09,572 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-18 12:21:09,573 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-18 12:21:09,574 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-18 12:21:09,575 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-18 12:21:09,576 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-18 12:21:09,576 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-18 12:21:09,576 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-18 12:21:09,577 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-18 12:21:09,577 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-18 12:21:09,579 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-18 12:21:09,579 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-18 12:21:09,580 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-18 12:21:09,580 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-18 12:21:09,581 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-18 12:21:09,581 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-18 12:21:09,581 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-18 12:21:09,581 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-18 12:21:09,582 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-18 12:21:09,582 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_32a682b5-12ae-445a-a4a1-22782da750c8/bin-2019/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf [2018-11-18 12:21:09,593 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-18 12:21:09,593 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-18 12:21:09,594 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-18 12:21:09,594 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-18 12:21:09,594 INFO L133 SettingsManager]: * Use SBE=true [2018-11-18 12:21:09,594 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-11-18 12:21:09,594 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-11-18 12:21:09,595 INFO L133 SettingsManager]: * Use old map elimination=false [2018-11-18 12:21:09,595 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-11-18 12:21:09,595 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-11-18 12:21:09,595 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-11-18 12:21:09,596 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-18 12:21:09,596 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-18 12:21:09,596 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-18 12:21:09,596 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-18 12:21:09,596 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-18 12:21:09,596 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-18 12:21:09,596 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-11-18 12:21:09,596 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-11-18 12:21:09,597 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-11-18 12:21:09,597 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-18 12:21:09,597 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-18 12:21:09,597 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-11-18 12:21:09,597 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-18 12:21:09,597 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-11-18 12:21:09,597 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-18 12:21:09,598 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-18 12:21:09,598 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-11-18 12:21:09,598 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-18 12:21:09,598 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-18 12:21:09,598 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-11-18 12:21:09,599 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-11-18 12:21:09,599 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 -> /tmp/vcloud-vcloud-master/worker/working_dir_32a682b5-12ae-445a-a4a1-22782da750c8/bin-2019/uautomizer 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 [2018-11-18 12:21:09,621 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-18 12:21:09,629 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-18 12:21:09,631 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-18 12:21:09,632 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-18 12:21:09,633 INFO L276 PluginConnector]: CDTParser initialized [2018-11-18 12:21:09,633 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_32a682b5-12ae-445a-a4a1-22782da750c8/bin-2019/uautomizer/../../sv-benchmarks/c/ldv-regression/ex3_forlist_true-termination.c_true-unreach-call.i [2018-11-18 12:21:09,667 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_32a682b5-12ae-445a-a4a1-22782da750c8/bin-2019/uautomizer/data/2bf781dcc/526148062d814672ad407245b05b17c0/FLAGeb0172082 [2018-11-18 12:21:10,061 INFO L307 CDTParser]: Found 1 translation units. [2018-11-18 12:21:10,062 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_32a682b5-12ae-445a-a4a1-22782da750c8/sv-benchmarks/c/ldv-regression/ex3_forlist_true-termination.c_true-unreach-call.i [2018-11-18 12:21:10,065 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_32a682b5-12ae-445a-a4a1-22782da750c8/bin-2019/uautomizer/data/2bf781dcc/526148062d814672ad407245b05b17c0/FLAGeb0172082 [2018-11-18 12:21:10,073 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_32a682b5-12ae-445a-a4a1-22782da750c8/bin-2019/uautomizer/data/2bf781dcc/526148062d814672ad407245b05b17c0 [2018-11-18 12:21:10,076 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-18 12:21:10,077 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-18 12:21:10,077 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-18 12:21:10,077 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-18 12:21:10,079 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-18 12:21:10,080 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 12:21:10" (1/1) ... [2018-11-18 12:21:10,081 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@649584a9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 12:21:10, skipping insertion in model container [2018-11-18 12:21:10,081 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 12:21:10" (1/1) ... [2018-11-18 12:21:10,087 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-18 12:21:10,098 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-18 12:21:10,201 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-18 12:21:10,206 INFO L191 MainTranslator]: Completed pre-run [2018-11-18 12:21:10,218 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-18 12:21:10,233 INFO L195 MainTranslator]: Completed translation [2018-11-18 12:21:10,233 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 12:21:10 WrapperNode [2018-11-18 12:21:10,233 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-18 12:21:10,234 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-18 12:21:10,234 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-18 12:21:10,234 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-18 12:21:10,240 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 12:21:10" (1/1) ... [2018-11-18 12:21:10,249 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 12:21:10" (1/1) ... [2018-11-18 12:21:10,306 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-18 12:21:10,306 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-18 12:21:10,307 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-18 12:21:10,307 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-18 12:21:10,315 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 12:21:10" (1/1) ... [2018-11-18 12:21:10,316 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 12:21:10" (1/1) ... [2018-11-18 12:21:10,318 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 12:21:10" (1/1) ... [2018-11-18 12:21:10,318 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 12:21:10" (1/1) ... [2018-11-18 12:21:10,325 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 12:21:10" (1/1) ... [2018-11-18 12:21:10,328 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 12:21:10" (1/1) ... [2018-11-18 12:21:10,330 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 12:21:10" (1/1) ... [2018-11-18 12:21:10,331 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-18 12:21:10,332 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-18 12:21:10,332 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-18 12:21:10,332 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-18 12:21:10,332 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 12:21:10" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_32a682b5-12ae-445a-a4a1-22782da750c8/bin-2019/uautomizer/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 [2018-11-18 12:21:10,378 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-11-18 12:21:10,378 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-11-18 12:21:10,378 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-18 12:21:10,378 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-18 12:21:10,378 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-18 12:21:10,379 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-18 12:21:10,379 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-18 12:21:10,629 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-18 12:21:10,630 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 12:21:10 BoogieIcfgContainer [2018-11-18 12:21:10,630 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-18 12:21:10,630 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-11-18 12:21:10,630 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-11-18 12:21:10,633 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-11-18 12:21:10,633 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-18 12:21:10,633 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 18.11 12:21:10" (1/3) ... [2018-11-18 12:21:10,634 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@3922ff31 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 18.11 12:21:10, skipping insertion in model container [2018-11-18 12:21:10,634 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-18 12:21:10,634 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 12:21:10" (2/3) ... [2018-11-18 12:21:10,634 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@3922ff31 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 18.11 12:21:10, skipping insertion in model container [2018-11-18 12:21:10,635 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-18 12:21:10,635 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 12:21:10" (3/3) ... [2018-11-18 12:21:10,636 INFO L375 chiAutomizerObserver]: Analyzing ICFG ex3_forlist_true-termination.c_true-unreach-call.i [2018-11-18 12:21:10,675 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-18 12:21:10,676 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-11-18 12:21:10,676 INFO L375 BuchiCegarLoop]: Hoare is false [2018-11-18 12:21:10,676 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-11-18 12:21:10,676 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-18 12:21:10,676 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-18 12:21:10,676 INFO L379 BuchiCegarLoop]: Difference is false [2018-11-18 12:21:10,676 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-18 12:21:10,676 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-11-18 12:21:10,688 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 40 states. [2018-11-18 12:21:10,707 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 27 [2018-11-18 12:21:10,708 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 12:21:10,708 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 12:21:10,713 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-18 12:21:10,714 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-11-18 12:21:10,714 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-11-18 12:21:10,714 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 40 states. [2018-11-18 12:21:10,716 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 27 [2018-11-18 12:21:10,716 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 12:21:10,716 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 12:21:10,717 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-18 12:21:10,717 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-11-18 12:21:10,723 INFO L794 eck$LassoCheckResult]: Stem: 32#ULTIMATE.startENTRYtrue assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];call ~#pp~0.base, ~#pp~0.offset := #Ultimate.alloc(8);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#pp~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#pp~0.base);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#pp~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#pp~0.base);call ~#pstate~0.base, ~#pstate~0.offset := #Ultimate.alloc(8);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#pstate~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#pstate~0.base);~counter~0 := 1; 4#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;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;assume { :begin_inline_init } true;havoc init_#t~post0, init_~i~0;havoc init_~i~0;init_~i~0 := 0; 34#L17-4true [2018-11-18 12:21:10,724 INFO L796 eck$LassoCheckResult]: Loop: 34#L17-4true assume true; 23#L17-1true 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); 37#L17-3true init_#t~post0 := init_~i~0;init_~i~0 := 1 + init_#t~post0;havoc init_#t~post0; 34#L17-4true [2018-11-18 12:21:10,728 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 12:21:10,729 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2018-11-18 12:21:10,730 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 12:21:10,731 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 12:21:10,768 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:21:10,768 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 12:21:10,768 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:21:10,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 12:21:10,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 12:21:10,814 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 12:21:10,814 INFO L82 PathProgramCache]: Analyzing trace with hash 35911, now seen corresponding path program 1 times [2018-11-18 12:21:10,814 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 12:21:10,814 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 12:21:10,815 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:21:10,815 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 12:21:10,815 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:21:10,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 12:21:10,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 12:21:10,829 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 12:21:10,829 INFO L82 PathProgramCache]: Analyzing trace with hash 28694853, now seen corresponding path program 1 times [2018-11-18 12:21:10,829 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 12:21:10,829 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 12:21:10,830 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:21:10,830 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 12:21:10,830 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:21:10,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 12:21:10,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 12:21:11,062 INFO L216 LassoAnalysis]: Preferences: [2018-11-18 12:21:11,063 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-18 12:21:11,063 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-18 12:21:11,063 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-18 12:21:11,063 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-18 12:21:11,063 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 12:21:11,063 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-18 12:21:11,064 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-18 12:21:11,064 INFO L131 ssoRankerPreferences]: Filename of dumped script: ex3_forlist_true-termination.c_true-unreach-call.i_Iteration1_Lasso [2018-11-18 12:21:11,064 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-18 12:21:11,064 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-18 12:21:11,083 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 12:21:11,088 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 12:21:11,089 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 12:21:11,091 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 12:21:11,092 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 12:21:11,094 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 12:21:11,099 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 12:21:11,101 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 12:21:11,104 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 12:21:11,182 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 12:21:11,184 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 12:21:11,185 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 12:21:11,186 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 12:21:11,188 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 12:21:11,345 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-18 12:21:11,348 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-18 12:21:11,349 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 [2018-11-18 12:21:11,350 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 12:21:11,350 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 12:21:11,351 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 12:21:11,351 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 12:21:11,351 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 12:21:11,352 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 12:21:11,353 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 12:21:11,354 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 12:21:11,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 [2018-11-18 12:21:11,355 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 12:21:11,355 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 12:21:11,355 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 12:21:11,356 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 12:21:11,356 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 12:21:11,356 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 12:21:11,356 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 12:21:11,357 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 12:21:11,357 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 [2018-11-18 12:21:11,358 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 12:21:11,358 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 12:21:11,358 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 12:21:11,358 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 12:21:11,358 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 12:21:11,358 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 12:21:11,359 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 12:21:11,359 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 12:21:11,360 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 [2018-11-18 12:21:11,360 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 12:21:11,360 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 12:21:11,360 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 12:21:11,360 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 12:21:11,361 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 12:21:11,361 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 12:21:11,361 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 12:21:11,362 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 12:21:11,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 [2018-11-18 12:21:11,363 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 12:21:11,363 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 12:21:11,363 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 12:21:11,363 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 12:21:11,363 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 12:21:11,364 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 12:21:11,364 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 12:21:11,364 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 12:21:11,365 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 [2018-11-18 12:21:11,365 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 12:21:11,365 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 12:21:11,365 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 12:21:11,366 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 12:21:11,367 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 12:21:11,368 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 12:21:11,371 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 12:21:11,371 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 [2018-11-18 12:21:11,372 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 12:21:11,372 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 12:21:11,372 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 12:21:11,372 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 12:21:11,372 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 12:21:11,373 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 12:21:11,373 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 12:21:11,374 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 12:21:11,375 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 [2018-11-18 12:21:11,375 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 12:21:11,375 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 12:21:11,375 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 12:21:11,376 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 12:21:11,376 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 12:21:11,376 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 12:21:11,376 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 12:21:11,377 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 12:21:11,377 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 [2018-11-18 12:21:11,379 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 12:21:11,379 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-18 12:21:11,379 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 12:21:11,380 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 12:21:11,381 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-18 12:21:11,381 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 12:21:11,387 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 12:21:11,388 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 [2018-11-18 12:21:11,388 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 12:21:11,388 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 12:21:11,388 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 12:21:11,389 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 12:21:11,389 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 12:21:11,389 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 12:21:11,389 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 12:21:11,390 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 12:21:11,390 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 [2018-11-18 12:21:11,391 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 12:21:11,391 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 12:21:11,391 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 12:21:11,391 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 12:21:11,393 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 12:21:11,393 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 12:21:11,402 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 12:21:11,402 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 [2018-11-18 12:21:11,403 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 12:21:11,403 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 12:21:11,403 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 12:21:11,403 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 12:21:11,405 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 12:21:11,405 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 12:21:11,412 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 12:21:11,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 [2018-11-18 12:21:11,413 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 12:21:11,413 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 12:21:11,413 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 12:21:11,414 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 12:21:11,416 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 12:21:11,416 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 12:21:11,446 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-18 12:21:11,463 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2018-11-18 12:21:11,463 INFO L444 ModelExtractionUtils]: 14 out of 19 variables were initially zero. Simplification set additionally 2 variables to zero. [2018-11-18 12:21:11,465 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-18 12:21:11,466 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-18 12:21:11,467 INFO L518 LassoAnalysis]: Proved termination. [2018-11-18 12:21:11,467 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_init_~i~0) = -2*ULTIMATE.start_init_~i~0 + 3 Supporting invariants [] [2018-11-18 12:21:11,490 INFO L297 tatePredicateManager]: 3 out of 3 supporting invariants were superfluous and have been removed [2018-11-18 12:21:11,507 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 12:21:11,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 12:21:11,517 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 12:21:11,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 12:21:11,529 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 12:21:11,536 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 12:21:11,545 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 [2018-11-18 12:21:11,546 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 40 states. Second operand 4 states. [2018-11-18 12:21:11,586 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 40 states.. Second operand 4 states. Result 109 states and 150 transitions. Complement of second has 7 states. [2018-11-18 12:21:11,586 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 [2018-11-18 12:21:11,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-18 12:21:11,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 103 transitions. [2018-11-18 12:21:11,589 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 103 transitions. Stem has 2 letters. Loop has 3 letters. [2018-11-18 12:21:11,590 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 12:21:11,590 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 103 transitions. Stem has 5 letters. Loop has 3 letters. [2018-11-18 12:21:11,590 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 12:21:11,590 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 103 transitions. Stem has 2 letters. Loop has 6 letters. [2018-11-18 12:21:11,591 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 12:21:11,591 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 109 states and 150 transitions. [2018-11-18 12:21:11,594 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 20 [2018-11-18 12:21:11,597 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 109 states to 34 states and 43 transitions. [2018-11-18 12:21:11,597 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 30 [2018-11-18 12:21:11,598 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 31 [2018-11-18 12:21:11,598 INFO L73 IsDeterministic]: Start isDeterministic. Operand 34 states and 43 transitions. [2018-11-18 12:21:11,598 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-18 12:21:11,598 INFO L705 BuchiCegarLoop]: Abstraction has 34 states and 43 transitions. [2018-11-18 12:21:11,609 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states and 43 transitions. [2018-11-18 12:21:11,615 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2018-11-18 12:21:11,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-11-18 12:21:11,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 43 transitions. [2018-11-18 12:21:11,617 INFO L728 BuchiCegarLoop]: Abstraction has 34 states and 43 transitions. [2018-11-18 12:21:11,617 INFO L608 BuchiCegarLoop]: Abstraction has 34 states and 43 transitions. [2018-11-18 12:21:11,617 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-11-18 12:21:11,617 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 34 states and 43 transitions. [2018-11-18 12:21:11,618 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 20 [2018-11-18 12:21:11,618 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 12:21:11,618 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 12:21:11,619 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 12:21:11,619 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-11-18 12:21:11,619 INFO L794 eck$LassoCheckResult]: Stem: 233#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];call ~#pp~0.base, ~#pp~0.offset := #Ultimate.alloc(8);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#pp~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#pp~0.base);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#pp~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#pp~0.base);call ~#pstate~0.base, ~#pstate~0.offset := #Ultimate.alloc(8);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#pstate~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#pstate~0.base);~counter~0 := 1; 205#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;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;assume { :begin_inline_init } true;havoc init_#t~post0, init_~i~0;havoc init_~i~0;init_~i~0 := 0; 206#L17-4 assume true; 225#L17-1 assume !(init_~i~0 < 2); 221#L15 assume { :end_inline_init } true;assume { :begin_inline_malloc } true;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; 203#L47 main_#t~ret7.base, main_#t~ret7.offset := malloc_#res.base, malloc_#res.offset;assume { :end_inline_malloc } true;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;assume { :begin_inline_malloc } true;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; 204#L47-1 main_#t~ret8.base, main_#t~ret8.offset := malloc_#res.base, malloc_#res.offset;assume { :end_inline_malloc } true;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; 220#L57 assume !((main_~a~0.base == 0 && main_~a~0.offset == 0) || (main_~b~0.base == 0 && main_~b~0.offset == 0));assume { :begin_inline_f } true;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; 207#L25-4 [2018-11-18 12:21:11,619 INFO L796 eck$LassoCheckResult]: Loop: 207#L25-4 assume true; 208#L25-1 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); 218#L26 assume !(f_#t~mem2.base == 0 && f_#t~mem2.offset == 0);havoc f_#t~mem2.base, f_#t~mem2.offset; 211#L25-3 f_#t~post1 := f_~i~1;f_~i~1 := 1 + f_#t~post1;havoc f_#t~post1; 207#L25-4 [2018-11-18 12:21:11,619 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 12:21:11,620 INFO L82 PathProgramCache]: Analyzing trace with hash 148164877, now seen corresponding path program 1 times [2018-11-18 12:21:11,620 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 12:21:11,620 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 12:21:11,621 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:21:11,621 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 12:21:11,621 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:21:11,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 12:21:11,667 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 12:21:11,668 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 12:21:11,668 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 12:21:11,669 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-18 12:21:11,670 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 12:21:11,670 INFO L82 PathProgramCache]: Analyzing trace with hash 1852168, now seen corresponding path program 1 times [2018-11-18 12:21:11,670 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 12:21:11,670 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 12:21:11,671 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:21:11,671 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 12:21:11,671 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:21:11,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 12:21:11,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 12:21:11,716 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 12:21:11,716 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 12:21:11,717 INFO L87 Difference]: Start difference. First operand 34 states and 43 transitions. cyclomatic complexity: 14 Second operand 3 states. [2018-11-18 12:21:11,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 12:21:11,727 INFO L93 Difference]: Finished difference Result 37 states and 45 transitions. [2018-11-18 12:21:11,728 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 12:21:11,728 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 37 states and 45 transitions. [2018-11-18 12:21:11,729 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 20 [2018-11-18 12:21:11,730 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 37 states to 36 states and 44 transitions. [2018-11-18 12:21:11,730 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 31 [2018-11-18 12:21:11,730 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 31 [2018-11-18 12:21:11,730 INFO L73 IsDeterministic]: Start isDeterministic. Operand 36 states and 44 transitions. [2018-11-18 12:21:11,731 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-18 12:21:11,731 INFO L705 BuchiCegarLoop]: Abstraction has 36 states and 44 transitions. [2018-11-18 12:21:11,731 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states and 44 transitions. [2018-11-18 12:21:11,733 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 34. [2018-11-18 12:21:11,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-11-18 12:21:11,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 42 transitions. [2018-11-18 12:21:11,734 INFO L728 BuchiCegarLoop]: Abstraction has 34 states and 42 transitions. [2018-11-18 12:21:11,734 INFO L608 BuchiCegarLoop]: Abstraction has 34 states and 42 transitions. [2018-11-18 12:21:11,734 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-11-18 12:21:11,734 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 34 states and 42 transitions. [2018-11-18 12:21:11,735 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 20 [2018-11-18 12:21:11,735 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 12:21:11,735 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 12:21:11,735 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 12:21:11,735 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-11-18 12:21:11,736 INFO L794 eck$LassoCheckResult]: Stem: 310#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];call ~#pp~0.base, ~#pp~0.offset := #Ultimate.alloc(8);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#pp~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#pp~0.base);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#pp~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#pp~0.base);call ~#pstate~0.base, ~#pstate~0.offset := #Ultimate.alloc(8);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#pstate~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#pstate~0.base);~counter~0 := 1; 282#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;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;assume { :begin_inline_init } true;havoc init_#t~post0, init_~i~0;havoc init_~i~0;init_~i~0 := 0; 283#L17-4 assume true; 303#L17-1 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); 304#L17-3 init_#t~post0 := init_~i~0;init_~i~0 := 1 + init_#t~post0;havoc init_#t~post0; 312#L17-4 assume true; 302#L17-1 assume !(init_~i~0 < 2); 298#L15 assume { :end_inline_init } true;assume { :begin_inline_malloc } true;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; 280#L47 main_#t~ret7.base, main_#t~ret7.offset := malloc_#res.base, malloc_#res.offset;assume { :end_inline_malloc } true;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;assume { :begin_inline_malloc } true;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; 281#L47-1 main_#t~ret8.base, main_#t~ret8.offset := malloc_#res.base, malloc_#res.offset;assume { :end_inline_malloc } true;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; 297#L57 assume !((main_~a~0.base == 0 && main_~a~0.offset == 0) || (main_~b~0.base == 0 && main_~b~0.offset == 0));assume { :begin_inline_f } true;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; 284#L25-4 [2018-11-18 12:21:11,736 INFO L796 eck$LassoCheckResult]: Loop: 284#L25-4 assume true; 285#L25-1 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); 295#L26 assume !(f_#t~mem2.base == 0 && f_#t~mem2.offset == 0);havoc f_#t~mem2.base, f_#t~mem2.offset; 288#L25-3 f_#t~post1 := f_~i~1;f_~i~1 := 1 + f_#t~post1;havoc f_#t~post1; 284#L25-4 [2018-11-18 12:21:11,736 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 12:21:11,736 INFO L82 PathProgramCache]: Analyzing trace with hash -1694434033, now seen corresponding path program 1 times [2018-11-18 12:21:11,736 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 12:21:11,736 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 12:21:11,738 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:21:11,738 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 12:21:11,738 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:21:11,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 12:21:11,774 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 12:21:11,775 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 12:21:11,775 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_32a682b5-12ae-445a-a4a1-22782da750c8/bin-2019/uautomizer/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 [2018-11-18 12:21:11,782 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 12:21:11,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 12:21:11,800 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 12:21:11,813 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 12:21:11,831 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 12:21:11,831 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2018-11-18 12:21:11,831 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-18 12:21:11,832 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 12:21:11,832 INFO L82 PathProgramCache]: Analyzing trace with hash 1852168, now seen corresponding path program 2 times [2018-11-18 12:21:11,832 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 12:21:11,832 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 12:21:11,833 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:21:11,833 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 12:21:11,833 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:21:11,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 12:21:11,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 12:21:11,890 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-18 12:21:11,890 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-11-18 12:21:11,890 INFO L87 Difference]: Start difference. First operand 34 states and 42 transitions. cyclomatic complexity: 13 Second operand 5 states. [2018-11-18 12:21:11,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 12:21:11,905 INFO L93 Difference]: Finished difference Result 39 states and 47 transitions. [2018-11-18 12:21:11,906 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-18 12:21:11,906 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 39 states and 47 transitions. [2018-11-18 12:21:11,907 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 20 [2018-11-18 12:21:11,907 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 39 states to 38 states and 46 transitions. [2018-11-18 12:21:11,907 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 31 [2018-11-18 12:21:11,908 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 31 [2018-11-18 12:21:11,908 INFO L73 IsDeterministic]: Start isDeterministic. Operand 38 states and 46 transitions. [2018-11-18 12:21:11,908 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-18 12:21:11,908 INFO L705 BuchiCegarLoop]: Abstraction has 38 states and 46 transitions. [2018-11-18 12:21:11,908 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states and 46 transitions. [2018-11-18 12:21:11,909 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 37. [2018-11-18 12:21:11,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2018-11-18 12:21:11,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 45 transitions. [2018-11-18 12:21:11,910 INFO L728 BuchiCegarLoop]: Abstraction has 37 states and 45 transitions. [2018-11-18 12:21:11,910 INFO L608 BuchiCegarLoop]: Abstraction has 37 states and 45 transitions. [2018-11-18 12:21:11,910 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2018-11-18 12:21:11,910 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 37 states and 45 transitions. [2018-11-18 12:21:11,911 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 20 [2018-11-18 12:21:11,911 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 12:21:11,911 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 12:21:11,912 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 12:21:11,912 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-11-18 12:21:11,912 INFO L794 eck$LassoCheckResult]: Stem: 421#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];call ~#pp~0.base, ~#pp~0.offset := #Ultimate.alloc(8);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#pp~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#pp~0.base);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#pp~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#pp~0.base);call ~#pstate~0.base, ~#pstate~0.offset := #Ultimate.alloc(8);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#pstate~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#pstate~0.base);~counter~0 := 1; 393#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;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;assume { :begin_inline_init } true;havoc init_#t~post0, init_~i~0;havoc init_~i~0;init_~i~0 := 0; 394#L17-4 assume true; 413#L17-1 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); 414#L17-3 init_#t~post0 := init_~i~0;init_~i~0 := 1 + init_#t~post0;havoc init_#t~post0; 423#L17-4 assume true; 424#L17-1 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); 427#L17-3 init_#t~post0 := init_~i~0;init_~i~0 := 1 + init_#t~post0;havoc init_#t~post0; 426#L17-4 assume true; 412#L17-1 assume !(init_~i~0 < 2); 409#L15 assume { :end_inline_init } true;assume { :begin_inline_malloc } true;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; 391#L47 main_#t~ret7.base, main_#t~ret7.offset := malloc_#res.base, malloc_#res.offset;assume { :end_inline_malloc } true;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;assume { :begin_inline_malloc } true;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; 392#L47-1 main_#t~ret8.base, main_#t~ret8.offset := malloc_#res.base, malloc_#res.offset;assume { :end_inline_malloc } true;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; 408#L57 assume !((main_~a~0.base == 0 && main_~a~0.offset == 0) || (main_~b~0.base == 0 && main_~b~0.offset == 0));assume { :begin_inline_f } true;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; 395#L25-4 [2018-11-18 12:21:11,912 INFO L796 eck$LassoCheckResult]: Loop: 395#L25-4 assume true; 396#L25-1 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); 406#L26 assume !(f_#t~mem2.base == 0 && f_#t~mem2.offset == 0);havoc f_#t~mem2.base, f_#t~mem2.offset; 399#L25-3 f_#t~post1 := f_~i~1;f_~i~1 := 1 + f_#t~post1;havoc f_#t~post1; 395#L25-4 [2018-11-18 12:21:11,912 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 12:21:11,912 INFO L82 PathProgramCache]: Analyzing trace with hash -581551667, now seen corresponding path program 2 times [2018-11-18 12:21:11,912 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 12:21:11,913 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 12:21:11,913 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:21:11,913 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 12:21:11,913 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:21:11,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 12:21:11,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 12:21:11,945 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 12:21:11,945 INFO L82 PathProgramCache]: Analyzing trace with hash 1852168, now seen corresponding path program 3 times [2018-11-18 12:21:11,945 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 12:21:11,945 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 12:21:11,946 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:21:11,946 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 12:21:11,946 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:21:11,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 12:21:11,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 12:21:11,952 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 12:21:11,952 INFO L82 PathProgramCache]: Analyzing trace with hash 1894299348, now seen corresponding path program 1 times [2018-11-18 12:21:11,952 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 12:21:11,952 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 12:21:11,953 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:21:11,953 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 12:21:11,953 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:21:11,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 12:21:12,191 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-11-18 12:21:12,191 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 12:21:12,192 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_32a682b5-12ae-445a-a4a1-22782da750c8/bin-2019/uautomizer/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 [2018-11-18 12:21:12,211 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 12:21:12,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 12:21:12,230 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 12:21:12,243 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 7 treesize of output 6 [2018-11-18 12:21:12,243 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-18 12:21:12,252 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 7 treesize of output 6 [2018-11-18 12:21:12,253 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 12:21:12,257 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 12:21:12,257 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:18, output treesize:16 [2018-11-18 12:21:12,282 INFO L682 Elim1Store]: detected equality via solver [2018-11-18 12:21:12,283 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 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 22 treesize of output 26 [2018-11-18 12:21:12,283 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-18 12:21:12,298 INFO L682 Elim1Store]: detected equality via solver [2018-11-18 12:21:12,299 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 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 22 treesize of output 26 [2018-11-18 12:21:12,300 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 12:21:12,309 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 12:21:12,309 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:49, output treesize:33 [2018-11-18 12:21:12,335 INFO L682 Elim1Store]: detected equality via solver [2018-11-18 12:21:12,336 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 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 22 treesize of output 26 [2018-11-18 12:21:12,336 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-18 12:21:12,344 INFO L682 Elim1Store]: detected equality via solver [2018-11-18 12:21:12,345 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 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 22 treesize of output 26 [2018-11-18 12:21:12,346 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 12:21:12,352 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-18 12:21:12,352 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:49, output treesize:33 [2018-11-18 12:21:12,382 INFO L477 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 14 treesize of output 10 [2018-11-18 12:21:12,383 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-18 12:21:12,388 INFO L477 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 14 treesize of output 10 [2018-11-18 12:21:12,388 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 12:21:12,392 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 12:21:12,392 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:27, output treesize:13 [2018-11-18 12:21:12,401 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 12:21:12,416 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 12:21:12,416 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6] total 9 [2018-11-18 12:21:12,455 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-18 12:21:12,456 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2018-11-18 12:21:12,456 INFO L87 Difference]: Start difference. First operand 37 states and 45 transitions. cyclomatic complexity: 13 Second operand 10 states. [2018-11-18 12:21:12,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 12:21:12,528 INFO L93 Difference]: Finished difference Result 36 states and 42 transitions. [2018-11-18 12:21:12,528 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-18 12:21:12,529 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 36 states and 42 transitions. [2018-11-18 12:21:12,529 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 16 [2018-11-18 12:21:12,530 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 36 states to 36 states and 42 transitions. [2018-11-18 12:21:12,530 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 30 [2018-11-18 12:21:12,530 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 30 [2018-11-18 12:21:12,530 INFO L73 IsDeterministic]: Start isDeterministic. Operand 36 states and 42 transitions. [2018-11-18 12:21:12,530 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-18 12:21:12,530 INFO L705 BuchiCegarLoop]: Abstraction has 36 states and 42 transitions. [2018-11-18 12:21:12,531 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states and 42 transitions. [2018-11-18 12:21:12,532 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2018-11-18 12:21:12,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2018-11-18 12:21:12,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 42 transitions. [2018-11-18 12:21:12,533 INFO L728 BuchiCegarLoop]: Abstraction has 36 states and 42 transitions. [2018-11-18 12:21:12,533 INFO L608 BuchiCegarLoop]: Abstraction has 36 states and 42 transitions. [2018-11-18 12:21:12,533 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2018-11-18 12:21:12,533 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 36 states and 42 transitions. [2018-11-18 12:21:12,533 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 16 [2018-11-18 12:21:12,533 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 12:21:12,534 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 12:21:12,534 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 12:21:12,534 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-11-18 12:21:12,534 INFO L794 eck$LassoCheckResult]: Stem: 563#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];call ~#pp~0.base, ~#pp~0.offset := #Ultimate.alloc(8);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#pp~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#pp~0.base);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#pp~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#pp~0.base);call ~#pstate~0.base, ~#pstate~0.offset := #Ultimate.alloc(8);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#pstate~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#pstate~0.base);~counter~0 := 1; 536#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;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;assume { :begin_inline_init } true;havoc init_#t~post0, init_~i~0;havoc init_~i~0;init_~i~0 := 0; 537#L17-4 assume true; 556#L17-1 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); 557#L17-3 init_#t~post0 := init_~i~0;init_~i~0 := 1 + init_#t~post0;havoc init_#t~post0; 565#L17-4 assume true; 566#L17-1 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); 569#L17-3 init_#t~post0 := init_~i~0;init_~i~0 := 1 + init_#t~post0;havoc init_#t~post0; 568#L17-4 assume true; 555#L17-1 assume !(init_~i~0 < 2); 551#L15 assume { :end_inline_init } true;assume { :begin_inline_malloc } true;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; 534#L47 main_#t~ret7.base, main_#t~ret7.offset := malloc_#res.base, malloc_#res.offset;assume { :end_inline_malloc } true;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;assume { :begin_inline_malloc } true;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; 535#L47-1 main_#t~ret8.base, main_#t~ret8.offset := malloc_#res.base, malloc_#res.offset;assume { :end_inline_malloc } true;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; 550#L57 assume !((main_~a~0.base == 0 && main_~a~0.offset == 0) || (main_~b~0.base == 0 && main_~b~0.offset == 0));assume { :begin_inline_f } true;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; 538#L25-4 assume true; 539#L25-1 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); 548#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); 544#L23 assume { :end_inline_f } true;assume { :begin_inline_f } true;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; 545#L25-9 [2018-11-18 12:21:12,535 INFO L796 eck$LassoCheckResult]: Loop: 545#L25-9 assume true; 554#L25-6 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); 561#L26-1 assume !(f_#t~mem2.base == 0 && f_#t~mem2.offset == 0);havoc f_#t~mem2.base, f_#t~mem2.offset; 559#L25-8 f_#t~post1 := f_~i~1;f_~i~1 := 1 + f_#t~post1;havoc f_#t~post1; 545#L25-9 [2018-11-18 12:21:12,535 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 12:21:12,535 INFO L82 PathProgramCache]: Analyzing trace with hash 1894299290, now seen corresponding path program 1 times [2018-11-18 12:21:12,535 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 12:21:12,535 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 12:21:12,536 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:21:12,536 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 12:21:12,536 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:21:12,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 12:21:12,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 12:21:12,562 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 12:21:12,562 INFO L82 PathProgramCache]: Analyzing trace with hash 2467848, now seen corresponding path program 1 times [2018-11-18 12:21:12,562 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 12:21:12,562 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 12:21:12,563 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:21:12,563 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 12:21:12,563 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:21:12,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 12:21:12,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 12:21:12,568 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 12:21:12,568 INFO L82 PathProgramCache]: Analyzing trace with hash -902862303, now seen corresponding path program 1 times [2018-11-18 12:21:12,568 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 12:21:12,568 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 12:21:12,569 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:21:12,569 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 12:21:12,569 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:21:12,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 12:21:12,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 12:21:13,337 WARN L180 SmtUtils]: Spent 643.00 ms on a formula simplification. DAG size of input: 209 DAG size of output: 170 [2018-11-18 12:21:13,388 INFO L216 LassoAnalysis]: Preferences: [2018-11-18 12:21:13,388 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-18 12:21:13,388 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-18 12:21:13,388 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-18 12:21:13,388 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-18 12:21:13,388 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 12:21:13,389 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-18 12:21:13,389 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-18 12:21:13,389 INFO L131 ssoRankerPreferences]: Filename of dumped script: ex3_forlist_true-termination.c_true-unreach-call.i_Iteration5_Lasso [2018-11-18 12:21:13,389 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-18 12:21:13,389 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-18 12:21:13,393 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 12:21:13,395 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 12:21:13,396 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 12:21:13,398 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 12:21:13,399 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 12:21:13,400 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 12:21:13,401 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 12:21:13,402 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 12:21:13,406 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 12:21:13,406 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 12:21:13,408 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 12:21:13,409 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 12:21:13,409 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 12:21:13,410 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 12:21:13,414 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 12:21:13,418 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 12:21:13,419 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 12:21:13,581 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-18 12:21:13,581 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-18 12:21:13,581 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 [2018-11-18 12:21:13,582 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 12:21:13,582 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 12:21:13,582 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 12:21:13,582 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 12:21:13,582 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 12:21:13,582 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 12:21:13,582 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 12:21:13,583 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 12:21:13,583 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 [2018-11-18 12:21:13,583 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 12:21:13,583 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 12:21:13,583 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 12:21:13,583 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 12:21:13,584 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 12:21:13,584 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 12:21:13,584 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 12:21:13,584 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 12:21:13,585 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 [2018-11-18 12:21:13,585 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 12:21:13,585 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 12:21:13,585 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 12:21:13,585 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 12:21:13,586 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 12:21:13,586 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 12:21:13,588 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 12:21:13,588 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 [2018-11-18 12:21:13,588 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 12:21:13,588 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 12:21:13,589 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 12:21:13,589 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 12:21:13,589 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 12:21:13,589 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 12:21:13,589 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 12:21:13,589 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 12:21:13,590 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 [2018-11-18 12:21:13,590 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 12:21:13,590 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 12:21:13,590 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 12:21:13,590 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 12:21:13,590 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 12:21:13,591 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 12:21:13,591 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 12:21:13,591 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 12:21:13,591 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 [2018-11-18 12:21:13,592 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 12:21:13,592 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 12:21:13,592 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 12:21:13,592 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 12:21:13,593 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 12:21:13,593 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 12:21:13,594 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 12:21:13,594 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 [2018-11-18 12:21:13,595 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 12:21:13,595 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 12:21:13,595 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 12:21:13,595 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 12:21:13,595 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 12:21:13,595 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 12:21:13,595 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 12:21:13,596 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 12:21:13,596 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 [2018-11-18 12:21:13,596 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 12:21:13,597 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 12:21:13,597 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 12:21:13,597 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 12:21:13,598 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 12:21:13,598 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 12:21:13,600 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 12:21:13,600 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 [2018-11-18 12:21:13,600 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 12:21:13,600 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 12:21:13,600 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 12:21:13,601 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 12:21:13,601 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 12:21:13,601 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 12:21:13,601 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 12:21:13,601 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 12:21:13,602 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 [2018-11-18 12:21:13,602 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 12:21:13,602 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 12:21:13,602 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 12:21:13,602 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 12:21:13,603 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 12:21:13,603 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 12:21:13,604 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 12:21:13,604 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 [2018-11-18 12:21:13,605 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 12:21:13,605 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 12:21:13,605 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 12:21:13,605 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 12:21:13,605 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 12:21:13,605 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 12:21:13,605 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 12:21:13,606 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 12:21:13,606 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 [2018-11-18 12:21:13,606 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 12:21:13,606 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 12:21:13,607 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 12:21:13,607 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 12:21:13,607 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 12:21:13,607 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 12:21:13,607 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 12:21:13,607 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 12:21:13,608 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 [2018-11-18 12:21:13,608 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 12:21:13,608 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 12:21:13,608 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 12:21:13,608 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 12:21:13,608 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 12:21:13,609 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 12:21:13,609 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 12:21:13,609 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 12:21:13,609 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 [2018-11-18 12:21:13,610 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 12:21:13,610 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 12:21:13,610 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 12:21:13,610 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 12:21:13,611 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 12:21:13,611 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 12:21:13,613 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 12:21:13,613 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 [2018-11-18 12:21:13,614 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 12:21:13,614 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 12:21:13,614 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 12:21:13,614 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 12:21:13,615 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 12:21:13,615 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 12:21:13,618 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 12:21:13,618 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 [2018-11-18 12:21:13,619 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 12:21:13,619 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 12:21:13,619 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 12:21:13,619 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 12:21:13,619 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 12:21:13,619 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 12:21:13,619 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 12:21:13,620 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 12:21:13,620 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 [2018-11-18 12:21:13,620 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 12:21:13,620 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 12:21:13,620 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 12:21:13,621 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 12:21:13,621 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 12:21:13,621 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 12:21:13,624 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 12:21:13,624 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 [2018-11-18 12:21:13,624 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 12:21:13,624 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 12:21:13,625 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 12:21:13,625 INFO L206 nArgumentSynthesizer]: 4 loop disjuncts [2018-11-18 12:21:13,625 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 12:21:13,625 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-18 12:21:13,625 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 12:21:13,627 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 12:21:13,628 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 [2018-11-18 12:21:13,628 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 12:21:13,628 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 12:21:13,628 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 12:21:13,628 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 12:21:13,629 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 12:21:13,629 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 12:21:13,630 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 12:21:13,631 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 [2018-11-18 12:21:13,631 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 12:21:13,631 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-18 12:21:13,631 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 12:21:13,631 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 12:21:13,632 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-18 12:21:13,632 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 12:21:13,634 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 12:21:13,634 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 [2018-11-18 12:21:13,635 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 12:21:13,635 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 12:21:13,635 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 12:21:13,635 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 12:21:13,636 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 12:21:13,636 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 12:21:13,637 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 12:21:13,637 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 [2018-11-18 12:21:13,638 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 12:21:13,638 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 12:21:13,638 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 12:21:13,638 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 12:21:13,639 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 12:21:13,639 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 12:21:13,640 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 12:21:13,641 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 [2018-11-18 12:21:13,641 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 12:21:13,641 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-18 12:21:13,641 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 12:21:13,641 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 12:21:13,642 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-18 12:21:13,642 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 12:21:13,644 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 12:21:13,644 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 [2018-11-18 12:21:13,645 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 12:21:13,645 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 12:21:13,645 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 12:21:13,645 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 12:21:13,646 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 12:21:13,646 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 12:21:13,647 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 12:21:13,648 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 [2018-11-18 12:21:13,648 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 12:21:13,648 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 12:21:13,648 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 12:21:13,649 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 12:21:13,650 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 12:21:13,650 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 12:21:13,657 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-18 12:21:13,665 INFO L443 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. [2018-11-18 12:21:13,665 INFO L444 ModelExtractionUtils]: 10 out of 16 variables were initially zero. Simplification set additionally 3 variables to zero. [2018-11-18 12:21:13,666 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-18 12:21:13,671 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-18 12:21:13,671 INFO L518 LassoAnalysis]: Proved termination. [2018-11-18 12:21:13,671 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_f_~i~1) = -2*ULTIMATE.start_f_~i~1 + 3 Supporting invariants [] [2018-11-18 12:21:13,707 INFO L297 tatePredicateManager]: 3 out of 3 supporting invariants were superfluous and have been removed [2018-11-18 12:21:13,715 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 12:21:13,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 12:21:13,729 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 12:21:13,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 12:21:13,736 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 12:21:13,742 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 12:21:13,742 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 [2018-11-18 12:21:13,743 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 36 states and 42 transitions. cyclomatic complexity: 10 Second operand 4 states. [2018-11-18 12:21:13,755 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 36 states and 42 transitions. cyclomatic complexity: 10. Second operand 4 states. Result 82 states and 100 transitions. Complement of second has 6 states. [2018-11-18 12:21:13,756 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 [2018-11-18 12:21:13,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-18 12:21:13,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 54 transitions. [2018-11-18 12:21:13,756 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 54 transitions. Stem has 18 letters. Loop has 4 letters. [2018-11-18 12:21:13,757 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 12:21:13,757 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 54 transitions. Stem has 22 letters. Loop has 4 letters. [2018-11-18 12:21:13,757 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 12:21:13,757 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 54 transitions. Stem has 18 letters. Loop has 8 letters. [2018-11-18 12:21:13,757 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 12:21:13,757 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 82 states and 100 transitions. [2018-11-18 12:21:13,758 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 24 [2018-11-18 12:21:13,759 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 82 states to 53 states and 63 transitions. [2018-11-18 12:21:13,759 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 42 [2018-11-18 12:21:13,759 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 43 [2018-11-18 12:21:13,759 INFO L73 IsDeterministic]: Start isDeterministic. Operand 53 states and 63 transitions. [2018-11-18 12:21:13,759 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-18 12:21:13,759 INFO L705 BuchiCegarLoop]: Abstraction has 53 states and 63 transitions. [2018-11-18 12:21:13,759 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states and 63 transitions. [2018-11-18 12:21:13,761 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 39. [2018-11-18 12:21:13,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2018-11-18 12:21:13,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 46 transitions. [2018-11-18 12:21:13,762 INFO L728 BuchiCegarLoop]: Abstraction has 39 states and 46 transitions. [2018-11-18 12:21:13,762 INFO L608 BuchiCegarLoop]: Abstraction has 39 states and 46 transitions. [2018-11-18 12:21:13,762 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2018-11-18 12:21:13,762 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 39 states and 46 transitions. [2018-11-18 12:21:13,762 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 12 [2018-11-18 12:21:13,763 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 12:21:13,763 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 12:21:13,763 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 12:21:13,763 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-11-18 12:21:13,763 INFO L794 eck$LassoCheckResult]: Stem: 785#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];call ~#pp~0.base, ~#pp~0.offset := #Ultimate.alloc(8);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#pp~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#pp~0.base);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#pp~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#pp~0.base);call ~#pstate~0.base, ~#pstate~0.offset := #Ultimate.alloc(8);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#pstate~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#pstate~0.base);~counter~0 := 1; 755#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;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;assume { :begin_inline_init } true;havoc init_#t~post0, init_~i~0;havoc init_~i~0;init_~i~0 := 0; 756#L17-4 assume true; 787#L17-1 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); 791#L17-3 init_#t~post0 := init_~i~0;init_~i~0 := 1 + init_#t~post0;havoc init_#t~post0; 788#L17-4 assume true; 774#L17-1 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); 775#L17-3 init_#t~post0 := init_~i~0;init_~i~0 := 1 + init_#t~post0;havoc init_#t~post0; 790#L17-4 assume true; 773#L17-1 assume !(init_~i~0 < 2); 770#L15 assume { :end_inline_init } true;assume { :begin_inline_malloc } true;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; 753#L47 main_#t~ret7.base, main_#t~ret7.offset := malloc_#res.base, malloc_#res.offset;assume { :end_inline_malloc } true;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;assume { :begin_inline_malloc } true;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; 754#L47-1 main_#t~ret8.base, main_#t~ret8.offset := malloc_#res.base, malloc_#res.offset;assume { :end_inline_malloc } true;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; 769#L57 assume !((main_~a~0.base == 0 && main_~a~0.offset == 0) || (main_~b~0.base == 0 && main_~b~0.offset == 0));assume { :begin_inline_f } true;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; 757#L25-4 assume true; 758#L25-1 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); 767#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); 763#L23 assume { :end_inline_f } true;assume { :begin_inline_f } true;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; 764#L25-9 assume true; 777#L25-6 assume !(f_~i~1 < 2); 761#L23-1 assume { :end_inline_f } true;assume { :begin_inline_g } true;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; 759#L36-4 [2018-11-18 12:21:13,763 INFO L796 eck$LassoCheckResult]: Loop: 759#L36-4 assume true; 760#L36-1 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); 768#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; 762#L36-3 g_#t~post3 := g_~i~2;g_~i~2 := 1 + g_#t~post3;havoc g_#t~post3; 759#L36-4 [2018-11-18 12:21:13,764 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 12:21:13,764 INFO L82 PathProgramCache]: Analyzing trace with hash 1494896005, now seen corresponding path program 1 times [2018-11-18 12:21:13,764 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 12:21:13,764 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 12:21:13,764 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:21:13,765 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 12:21:13,765 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:21:13,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 12:21:13,779 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-11-18 12:21:13,779 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 12:21:13,779 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 12:21:13,779 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-18 12:21:13,779 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 12:21:13,780 INFO L82 PathProgramCache]: Analyzing trace with hash 3083880, now seen corresponding path program 1 times [2018-11-18 12:21:13,780 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 12:21:13,780 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 12:21:13,780 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:21:13,780 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 12:21:13,780 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:21:13,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 12:21:13,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 12:21:13,838 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 12:21:13,838 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 12:21:13,838 INFO L87 Difference]: Start difference. First operand 39 states and 46 transitions. cyclomatic complexity: 11 Second operand 3 states. [2018-11-18 12:21:13,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 12:21:13,853 INFO L93 Difference]: Finished difference Result 58 states and 68 transitions. [2018-11-18 12:21:13,855 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 12:21:13,855 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 58 states and 68 transitions. [2018-11-18 12:21:13,855 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 24 [2018-11-18 12:21:13,856 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 58 states to 58 states and 68 transitions. [2018-11-18 12:21:13,856 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 45 [2018-11-18 12:21:13,856 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 45 [2018-11-18 12:21:13,856 INFO L73 IsDeterministic]: Start isDeterministic. Operand 58 states and 68 transitions. [2018-11-18 12:21:13,856 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-18 12:21:13,856 INFO L705 BuchiCegarLoop]: Abstraction has 58 states and 68 transitions. [2018-11-18 12:21:13,857 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states and 68 transitions. [2018-11-18 12:21:13,858 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 40. [2018-11-18 12:21:13,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2018-11-18 12:21:13,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 47 transitions. [2018-11-18 12:21:13,859 INFO L728 BuchiCegarLoop]: Abstraction has 40 states and 47 transitions. [2018-11-18 12:21:13,859 INFO L608 BuchiCegarLoop]: Abstraction has 40 states and 47 transitions. [2018-11-18 12:21:13,859 INFO L442 BuchiCegarLoop]: ======== Iteration 7============ [2018-11-18 12:21:13,859 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 40 states and 47 transitions. [2018-11-18 12:21:13,859 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 12 [2018-11-18 12:21:13,859 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 12:21:13,859 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 12:21:13,860 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 12:21:13,860 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-11-18 12:21:13,860 INFO L794 eck$LassoCheckResult]: Stem: 889#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];call ~#pp~0.base, ~#pp~0.offset := #Ultimate.alloc(8);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#pp~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#pp~0.base);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#pp~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#pp~0.base);call ~#pstate~0.base, ~#pstate~0.offset := #Ultimate.alloc(8);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#pstate~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#pstate~0.base);~counter~0 := 1; 858#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;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;assume { :begin_inline_init } true;havoc init_#t~post0, init_~i~0;havoc init_~i~0;init_~i~0 := 0; 859#L17-4 assume true; 891#L17-1 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); 894#L17-3 init_#t~post0 := init_~i~0;init_~i~0 := 1 + init_#t~post0;havoc init_#t~post0; 892#L17-4 assume true; 877#L17-1 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); 878#L17-3 init_#t~post0 := init_~i~0;init_~i~0 := 1 + init_#t~post0;havoc init_#t~post0; 895#L17-4 assume true; 876#L17-1 assume !(init_~i~0 < 2); 873#L15 assume { :end_inline_init } true;assume { :begin_inline_malloc } true;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; 856#L47 main_#t~ret7.base, main_#t~ret7.offset := malloc_#res.base, malloc_#res.offset;assume { :end_inline_malloc } true;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;assume { :begin_inline_malloc } true;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; 857#L47-1 main_#t~ret8.base, main_#t~ret8.offset := malloc_#res.base, malloc_#res.offset;assume { :end_inline_malloc } true;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; 872#L57 assume !((main_~a~0.base == 0 && main_~a~0.offset == 0) || (main_~b~0.base == 0 && main_~b~0.offset == 0));assume { :begin_inline_f } true;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; 860#L25-4 assume true; 861#L25-1 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); 870#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); 866#L23 assume { :end_inline_f } true;assume { :begin_inline_f } true;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; 867#L25-9 assume true; 880#L25-6 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); 886#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); 864#L23-1 assume { :end_inline_f } true;assume { :begin_inline_g } true;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; 862#L36-4 [2018-11-18 12:21:13,860 INFO L796 eck$LassoCheckResult]: Loop: 862#L36-4 assume true; 863#L36-1 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); 871#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; 865#L36-3 g_#t~post3 := g_~i~2;g_~i~2 := 1 + g_#t~post3;havoc g_#t~post3; 862#L36-4 [2018-11-18 12:21:13,860 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 12:21:13,860 INFO L82 PathProgramCache]: Analyzing trace with hash -902862361, now seen corresponding path program 1 times [2018-11-18 12:21:13,860 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 12:21:13,860 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 12:21:13,861 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:21:13,861 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 12:21:13,861 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:21:13,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 12:21:13,969 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-11-18 12:21:13,969 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 12:21:13,969 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-11-18 12:21:13,969 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-18 12:21:13,969 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 12:21:13,969 INFO L82 PathProgramCache]: Analyzing trace with hash 3083880, now seen corresponding path program 2 times [2018-11-18 12:21:13,970 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 12:21:13,970 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 12:21:13,970 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:21:13,970 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 12:21:13,970 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:21:13,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 12:21:13,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 12:21:14,014 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-18 12:21:14,015 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-11-18 12:21:14,015 INFO L87 Difference]: Start difference. First operand 40 states and 47 transitions. cyclomatic complexity: 11 Second operand 8 states. [2018-11-18 12:21:14,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 12:21:14,137 INFO L93 Difference]: Finished difference Result 58 states and 67 transitions. [2018-11-18 12:21:14,138 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-18 12:21:14,138 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 58 states and 67 transitions. [2018-11-18 12:21:14,139 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 24 [2018-11-18 12:21:14,140 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 58 states to 56 states and 65 transitions. [2018-11-18 12:21:14,140 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 43 [2018-11-18 12:21:14,140 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 43 [2018-11-18 12:21:14,140 INFO L73 IsDeterministic]: Start isDeterministic. Operand 56 states and 65 transitions. [2018-11-18 12:21:14,140 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-18 12:21:14,140 INFO L705 BuchiCegarLoop]: Abstraction has 56 states and 65 transitions. [2018-11-18 12:21:14,140 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states and 65 transitions. [2018-11-18 12:21:14,141 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 39. [2018-11-18 12:21:14,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2018-11-18 12:21:14,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 45 transitions. [2018-11-18 12:21:14,142 INFO L728 BuchiCegarLoop]: Abstraction has 39 states and 45 transitions. [2018-11-18 12:21:14,142 INFO L608 BuchiCegarLoop]: Abstraction has 39 states and 45 transitions. [2018-11-18 12:21:14,142 INFO L442 BuchiCegarLoop]: ======== Iteration 8============ [2018-11-18 12:21:14,142 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 39 states and 45 transitions. [2018-11-18 12:21:14,143 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 12 [2018-11-18 12:21:14,144 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 12:21:14,144 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 12:21:14,144 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 12:21:14,144 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-11-18 12:21:14,144 INFO L794 eck$LassoCheckResult]: Stem: 1009#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];call ~#pp~0.base, ~#pp~0.offset := #Ultimate.alloc(8);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#pp~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#pp~0.base);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#pp~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#pp~0.base);call ~#pstate~0.base, ~#pstate~0.offset := #Ultimate.alloc(8);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#pstate~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#pstate~0.base);~counter~0 := 1; 979#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;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;assume { :begin_inline_init } true;havoc init_#t~post0, init_~i~0;havoc init_~i~0;init_~i~0 := 0; 980#L17-4 assume true; 998#L17-1 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); 999#L17-3 init_#t~post0 := init_~i~0;init_~i~0 := 1 + init_#t~post0;havoc init_#t~post0; 1011#L17-4 assume true; 1012#L17-1 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); 1015#L17-3 init_#t~post0 := init_~i~0;init_~i~0 := 1 + init_#t~post0;havoc init_#t~post0; 1014#L17-4 assume true; 997#L17-1 assume !(init_~i~0 < 2); 994#L15 assume { :end_inline_init } true;assume { :begin_inline_malloc } true;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; 977#L47 main_#t~ret7.base, main_#t~ret7.offset := malloc_#res.base, malloc_#res.offset;assume { :end_inline_malloc } true;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;assume { :begin_inline_malloc } true;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; 978#L47-1 main_#t~ret8.base, main_#t~ret8.offset := malloc_#res.base, malloc_#res.offset;assume { :end_inline_malloc } true;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; 993#L57 assume !((main_~a~0.base == 0 && main_~a~0.offset == 0) || (main_~b~0.base == 0 && main_~b~0.offset == 0));assume { :begin_inline_f } true;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; 981#L25-4 assume true; 982#L25-1 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); 991#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); 987#L23 assume { :end_inline_f } true;assume { :begin_inline_f } true;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; 988#L25-9 assume true; 1000#L25-6 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); 1007#L26-1 assume !(f_#t~mem2.base == 0 && f_#t~mem2.offset == 0);havoc f_#t~mem2.base, f_#t~mem2.offset; 1004#L25-8 f_#t~post1 := f_~i~1;f_~i~1 := 1 + f_#t~post1;havoc f_#t~post1; 1001#L25-9 assume true; 1002#L25-6 assume !(f_~i~1 < 2); 985#L23-1 assume { :end_inline_f } true;assume { :begin_inline_g } true;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; 983#L36-4 [2018-11-18 12:21:14,145 INFO L796 eck$LassoCheckResult]: Loop: 983#L36-4 assume true; 984#L36-1 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); 992#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; 986#L36-3 g_#t~post3 := g_~i~2;g_~i~2 := 1 + g_#t~post3;havoc g_#t~post3; 983#L36-4 [2018-11-18 12:21:14,145 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 12:21:14,145 INFO L82 PathProgramCache]: Analyzing trace with hash -2085611362, now seen corresponding path program 1 times [2018-11-18 12:21:14,145 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 12:21:14,145 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 12:21:14,145 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:21:14,146 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 12:21:14,146 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:21:14,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 12:21:14,166 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-11-18 12:21:14,166 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 12:21:14,166 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_32a682b5-12ae-445a-a4a1-22782da750c8/bin-2019/uautomizer/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 [2018-11-18 12:21:14,177 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 12:21:14,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 12:21:14,201 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 12:21:14,211 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-11-18 12:21:14,235 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 12:21:14,235 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2018-11-18 12:21:14,235 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-18 12:21:14,236 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 12:21:14,236 INFO L82 PathProgramCache]: Analyzing trace with hash 3083880, now seen corresponding path program 3 times [2018-11-18 12:21:14,236 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 12:21:14,236 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 12:21:14,237 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:21:14,237 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 12:21:14,237 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:21:14,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 12:21:14,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 12:21:14,292 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-18 12:21:14,292 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-11-18 12:21:14,292 INFO L87 Difference]: Start difference. First operand 39 states and 45 transitions. cyclomatic complexity: 10 Second operand 5 states. [2018-11-18 12:21:14,314 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 12:21:14,314 INFO L93 Difference]: Finished difference Result 59 states and 69 transitions. [2018-11-18 12:21:14,315 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-18 12:21:14,315 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 59 states and 69 transitions. [2018-11-18 12:21:14,316 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 24 [2018-11-18 12:21:14,316 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 59 states to 59 states and 69 transitions. [2018-11-18 12:21:14,317 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 44 [2018-11-18 12:21:14,317 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 44 [2018-11-18 12:21:14,317 INFO L73 IsDeterministic]: Start isDeterministic. Operand 59 states and 69 transitions. [2018-11-18 12:21:14,317 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-18 12:21:14,317 INFO L705 BuchiCegarLoop]: Abstraction has 59 states and 69 transitions. [2018-11-18 12:21:14,317 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states and 69 transitions. [2018-11-18 12:21:14,319 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 44. [2018-11-18 12:21:14,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2018-11-18 12:21:14,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 51 transitions. [2018-11-18 12:21:14,320 INFO L728 BuchiCegarLoop]: Abstraction has 44 states and 51 transitions. [2018-11-18 12:21:14,320 INFO L608 BuchiCegarLoop]: Abstraction has 44 states and 51 transitions. [2018-11-18 12:21:14,320 INFO L442 BuchiCegarLoop]: ======== Iteration 9============ [2018-11-18 12:21:14,320 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 44 states and 51 transitions. [2018-11-18 12:21:14,320 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 12 [2018-11-18 12:21:14,320 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 12:21:14,320 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 12:21:14,321 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 12:21:14,321 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-11-18 12:21:14,321 INFO L794 eck$LassoCheckResult]: Stem: 1190#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];call ~#pp~0.base, ~#pp~0.offset := #Ultimate.alloc(8);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#pp~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#pp~0.base);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#pp~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#pp~0.base);call ~#pstate~0.base, ~#pstate~0.offset := #Ultimate.alloc(8);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#pstate~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#pstate~0.base);~counter~0 := 1; 1157#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;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;assume { :begin_inline_init } true;havoc init_#t~post0, init_~i~0;havoc init_~i~0;init_~i~0 := 0; 1158#L17-4 assume true; 1192#L17-1 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); 1195#L17-3 init_#t~post0 := init_~i~0;init_~i~0 := 1 + init_#t~post0;havoc init_#t~post0; 1193#L17-4 assume true; 1176#L17-1 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); 1177#L17-3 init_#t~post0 := init_~i~0;init_~i~0 := 1 + init_#t~post0;havoc init_#t~post0; 1198#L17-4 assume true; 1175#L17-1 assume !(init_~i~0 < 2); 1172#L15 assume { :end_inline_init } true;assume { :begin_inline_malloc } true;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; 1155#L47 main_#t~ret7.base, main_#t~ret7.offset := malloc_#res.base, malloc_#res.offset;assume { :end_inline_malloc } true;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;assume { :begin_inline_malloc } true;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; 1156#L47-1 main_#t~ret8.base, main_#t~ret8.offset := malloc_#res.base, malloc_#res.offset;assume { :end_inline_malloc } true;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; 1171#L57 assume !((main_~a~0.base == 0 && main_~a~0.offset == 0) || (main_~b~0.base == 0 && main_~b~0.offset == 0));assume { :begin_inline_f } true;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; 1159#L25-4 assume true; 1160#L25-1 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); 1169#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); 1165#L23 assume { :end_inline_f } true;assume { :begin_inline_f } true;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; 1166#L25-9 assume true; 1178#L25-6 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); 1188#L26-1 assume !(f_#t~mem2.base == 0 && f_#t~mem2.offset == 0);havoc f_#t~mem2.base, f_#t~mem2.offset; 1183#L25-8 f_#t~post1 := f_~i~1;f_~i~1 := 1 + f_#t~post1;havoc f_#t~post1; 1184#L25-9 assume true; 1186#L25-6 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); 1187#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); 1163#L23-1 assume { :end_inline_f } true;assume { :begin_inline_g } true;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; 1161#L36-4 [2018-11-18 12:21:14,321 INFO L796 eck$LassoCheckResult]: Loop: 1161#L36-4 assume true; 1162#L36-1 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); 1170#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; 1164#L36-3 g_#t~post3 := g_~i~2;g_~i~2 := 1 + g_#t~post3;havoc g_#t~post3; 1161#L36-4 [2018-11-18 12:21:14,322 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 12:21:14,324 INFO L82 PathProgramCache]: Analyzing trace with hash -229441042, now seen corresponding path program 1 times [2018-11-18 12:21:14,325 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 12:21:14,325 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 12:21:14,325 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:21:14,325 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 12:21:14,326 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:21:14,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 12:21:14,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 12:21:14,359 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 12:21:14,359 INFO L82 PathProgramCache]: Analyzing trace with hash 3083880, now seen corresponding path program 4 times [2018-11-18 12:21:14,359 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 12:21:14,359 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 12:21:14,360 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:21:14,360 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 12:21:14,360 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:21:14,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 12:21:14,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 12:21:14,364 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 12:21:14,364 INFO L82 PathProgramCache]: Analyzing trace with hash -1406840363, now seen corresponding path program 1 times [2018-11-18 12:21:14,364 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 12:21:14,364 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 12:21:14,365 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:21:14,365 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 12:21:14,365 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:21:14,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 12:21:15,017 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 12:21:15,017 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 12:21:15,017 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_32a682b5-12ae-445a-a4a1-22782da750c8/bin-2019/uautomizer/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 [2018-11-18 12:21:15,027 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 12:21:15,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 12:21:15,044 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 12:21:15,104 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 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 11 treesize of output 8 [2018-11-18 12:21:15,105 INFO L477 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 [2018-11-18 12:21:15,105 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 12:21:15,107 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 12:21:15,112 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 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 11 treesize of output 8 [2018-11-18 12:21:15,114 INFO L477 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 [2018-11-18 12:21:15,114 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-18 12:21:15,115 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 12:21:15,118 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 12:21:15,119 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:29, output treesize:21 [2018-11-18 12:21:15,181 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 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 23 treesize of output 18 [2018-11-18 12:21:15,183 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:21:15,184 INFO L477 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 [2018-11-18 12:21:15,185 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 12:21:15,189 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 12:21:15,198 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 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 23 treesize of output 18 [2018-11-18 12:21:15,200 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:21:15,201 INFO L477 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 [2018-11-18 12:21:15,202 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-18 12:21:15,205 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 12:21:15,212 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 12:21:15,212 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:54, output treesize:21 [2018-11-18 12:21:15,234 INFO L477 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 [2018-11-18 12:21:15,235 INFO L477 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 [2018-11-18 12:21:15,235 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 12:21:15,236 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 12:21:15,241 INFO L477 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 [2018-11-18 12:21:15,242 INFO L477 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 [2018-11-18 12:21:15,243 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-18 12:21:15,243 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 12:21:15,246 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 12:21:15,246 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:32, output treesize:10 [2018-11-18 12:21:15,264 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-11-18 12:21:15,279 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-18 12:21:15,279 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [18] total 27 [2018-11-18 12:21:15,306 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-11-18 12:21:15,306 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=655, Unknown=0, NotChecked=0, Total=756 [2018-11-18 12:21:15,306 INFO L87 Difference]: Start difference. First operand 44 states and 51 transitions. cyclomatic complexity: 11 Second operand 28 states. [2018-11-18 12:21:15,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 12:21:15,756 INFO L93 Difference]: Finished difference Result 50 states and 57 transitions. [2018-11-18 12:21:15,756 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-11-18 12:21:15,756 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 50 states and 57 transitions. [2018-11-18 12:21:15,757 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 12 [2018-11-18 12:21:15,757 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 50 states to 50 states and 57 transitions. [2018-11-18 12:21:15,757 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 36 [2018-11-18 12:21:15,757 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 36 [2018-11-18 12:21:15,757 INFO L73 IsDeterministic]: Start isDeterministic. Operand 50 states and 57 transitions. [2018-11-18 12:21:15,757 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-18 12:21:15,757 INFO L705 BuchiCegarLoop]: Abstraction has 50 states and 57 transitions. [2018-11-18 12:21:15,758 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states and 57 transitions. [2018-11-18 12:21:15,759 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 47. [2018-11-18 12:21:15,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2018-11-18 12:21:15,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 54 transitions. [2018-11-18 12:21:15,760 INFO L728 BuchiCegarLoop]: Abstraction has 47 states and 54 transitions. [2018-11-18 12:21:15,760 INFO L608 BuchiCegarLoop]: Abstraction has 47 states and 54 transitions. [2018-11-18 12:21:15,760 INFO L442 BuchiCegarLoop]: ======== Iteration 10============ [2018-11-18 12:21:15,760 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 47 states and 54 transitions. [2018-11-18 12:21:15,760 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 12 [2018-11-18 12:21:15,760 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 12:21:15,760 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 12:21:15,761 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 12:21:15,761 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2018-11-18 12:21:15,761 INFO L794 eck$LassoCheckResult]: Stem: 1426#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];call ~#pp~0.base, ~#pp~0.offset := #Ultimate.alloc(8);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#pp~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#pp~0.base);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#pp~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#pp~0.base);call ~#pstate~0.base, ~#pstate~0.offset := #Ultimate.alloc(8);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#pstate~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#pstate~0.base);~counter~0 := 1; 1393#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;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;assume { :begin_inline_init } true;havoc init_#t~post0, init_~i~0;havoc init_~i~0;init_~i~0 := 0; 1394#L17-4 assume true; 1413#L17-1 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); 1414#L17-3 init_#t~post0 := init_~i~0;init_~i~0 := 1 + init_#t~post0;havoc init_#t~post0; 1428#L17-4 assume true; 1429#L17-1 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); 1434#L17-3 init_#t~post0 := init_~i~0;init_~i~0 := 1 + init_#t~post0;havoc init_#t~post0; 1433#L17-4 assume true; 1412#L17-1 assume !(init_~i~0 < 2); 1409#L15 assume { :end_inline_init } true;assume { :begin_inline_malloc } true;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; 1391#L47 main_#t~ret7.base, main_#t~ret7.offset := malloc_#res.base, malloc_#res.offset;assume { :end_inline_malloc } true;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;assume { :begin_inline_malloc } true;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; 1392#L47-1 main_#t~ret8.base, main_#t~ret8.offset := malloc_#res.base, malloc_#res.offset;assume { :end_inline_malloc } true;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; 1408#L57 assume !((main_~a~0.base == 0 && main_~a~0.offset == 0) || (main_~b~0.base == 0 && main_~b~0.offset == 0));assume { :begin_inline_f } true;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; 1395#L25-4 assume true; 1396#L25-1 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); 1406#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); 1402#L23 assume { :end_inline_f } true;assume { :begin_inline_f } true;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; 1403#L25-9 assume true; 1415#L25-6 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-1 assume !(f_#t~mem2.base == 0 && f_#t~mem2.offset == 0);havoc f_#t~mem2.base, f_#t~mem2.offset; 1436#L25-8 f_#t~post1 := f_~i~1;f_~i~1 := 1 + f_#t~post1;havoc f_#t~post1; 1435#L25-9 assume true; 1422#L25-6 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); 1423#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); 1399#L23-1 assume { :end_inline_f } true;assume { :begin_inline_g } true;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; 1397#L36-4 assume true; 1398#L36-1 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); 1407#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); 1410#L39 [2018-11-18 12:21:15,761 INFO L796 eck$LassoCheckResult]: Loop: 1410#L39 assume 1 == g_#t~mem5; 1411#L39-2 havoc g_#t~mem5;call write~int(2, ~#pstate~0.base, ~#pstate~0.offset + 4 * g_~i~2, 4); 1400#L36-3 g_#t~post3 := g_~i~2;g_~i~2 := 1 + g_#t~post3;havoc g_#t~post3; 1401#L36-4 assume true; 1431#L36-1 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); 1432#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); 1410#L39 [2018-11-18 12:21:15,762 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 12:21:15,762 INFO L82 PathProgramCache]: Analyzing trace with hash -1985044613, now seen corresponding path program 1 times [2018-11-18 12:21:15,762 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 12:21:15,762 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 12:21:15,762 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:21:15,763 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 12:21:15,763 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:21:15,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 12:21:15,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 12:21:15,792 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 12:21:15,793 INFO L82 PathProgramCache]: Analyzing trace with hash -1003468779, now seen corresponding path program 1 times [2018-11-18 12:21:15,793 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 12:21:15,793 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 12:21:15,793 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:21:15,793 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 12:21:15,793 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:21:15,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 12:21:15,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 12:21:15,801 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 12:21:15,801 INFO L82 PathProgramCache]: Analyzing trace with hash 132375567, now seen corresponding path program 1 times [2018-11-18 12:21:15,801 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 12:21:15,801 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 12:21:15,802 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:21:15,802 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 12:21:15,802 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:21:15,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 12:21:16,190 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 8 proven. 3 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-18 12:21:16,190 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 12:21:16,190 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_32a682b5-12ae-445a-a4a1-22782da750c8/bin-2019/uautomizer/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 [2018-11-18 12:21:16,209 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 12:21:16,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 12:21:16,233 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 12:21:16,359 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 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 13 treesize of output 10 [2018-11-18 12:21:16,361 INFO L477 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 [2018-11-18 12:21:16,362 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 12:21:16,364 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 12:21:16,367 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 12:21:16,368 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:20, output treesize:16 [2018-11-18 12:21:16,417 INFO L477 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 [2018-11-18 12:21:16,419 INFO L477 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 [2018-11-18 12:21:16,419 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 12:21:16,420 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 12:21:16,422 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 12:21:16,422 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:18, output treesize:7 [2018-11-18 12:21:16,441 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-11-18 12:21:16,456 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 12:21:16,457 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 10] total 26 [2018-11-18 12:21:16,511 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-11-18 12:21:16,511 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=672, Unknown=0, NotChecked=0, Total=756 [2018-11-18 12:21:16,511 INFO L87 Difference]: Start difference. First operand 47 states and 54 transitions. cyclomatic complexity: 11 Second operand 28 states. [2018-11-18 12:21:18,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 12:21:18,064 INFO L93 Difference]: Finished difference Result 91 states and 102 transitions. [2018-11-18 12:21:18,065 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-11-18 12:21:18,065 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 91 states and 102 transitions. [2018-11-18 12:21:18,065 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 32 [2018-11-18 12:21:18,065 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 91 states to 91 states and 102 transitions. [2018-11-18 12:21:18,065 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 74 [2018-11-18 12:21:18,066 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 74 [2018-11-18 12:21:18,066 INFO L73 IsDeterministic]: Start isDeterministic. Operand 91 states and 102 transitions. [2018-11-18 12:21:18,066 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-18 12:21:18,066 INFO L705 BuchiCegarLoop]: Abstraction has 91 states and 102 transitions. [2018-11-18 12:21:18,066 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states and 102 transitions. [2018-11-18 12:21:18,068 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 67. [2018-11-18 12:21:18,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2018-11-18 12:21:18,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 75 transitions. [2018-11-18 12:21:18,068 INFO L728 BuchiCegarLoop]: Abstraction has 67 states and 75 transitions. [2018-11-18 12:21:18,068 INFO L608 BuchiCegarLoop]: Abstraction has 67 states and 75 transitions. [2018-11-18 12:21:18,068 INFO L442 BuchiCegarLoop]: ======== Iteration 11============ [2018-11-18 12:21:18,068 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 67 states and 75 transitions. [2018-11-18 12:21:18,068 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 16 [2018-11-18 12:21:18,068 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 12:21:18,068 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 12:21:18,069 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 12:21:18,069 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2018-11-18 12:21:18,069 INFO L794 eck$LassoCheckResult]: Stem: 1745#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];call ~#pp~0.base, ~#pp~0.offset := #Ultimate.alloc(8);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#pp~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#pp~0.base);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#pp~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#pp~0.base);call ~#pstate~0.base, ~#pstate~0.offset := #Ultimate.alloc(8);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#pstate~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#pstate~0.base);~counter~0 := 1; 1710#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;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;assume { :begin_inline_init } true;havoc init_#t~post0, init_~i~0;havoc init_~i~0;init_~i~0 := 0; 1711#L17-4 assume true; 1731#L17-1 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); 1732#L17-3 init_#t~post0 := init_~i~0;init_~i~0 := 1 + init_#t~post0;havoc init_#t~post0; 1747#L17-4 assume true; 1748#L17-1 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); 1753#L17-3 init_#t~post0 := init_~i~0;init_~i~0 := 1 + init_#t~post0;havoc init_#t~post0; 1752#L17-4 assume true; 1730#L17-1 assume !(init_~i~0 < 2); 1727#L15 assume { :end_inline_init } true;assume { :begin_inline_malloc } true;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; 1708#L47 main_#t~ret7.base, main_#t~ret7.offset := malloc_#res.base, malloc_#res.offset;assume { :end_inline_malloc } true;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;assume { :begin_inline_malloc } true;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; 1709#L47-1 main_#t~ret8.base, main_#t~ret8.offset := malloc_#res.base, malloc_#res.offset;assume { :end_inline_malloc } true;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; 1726#L57 assume !((main_~a~0.base == 0 && main_~a~0.offset == 0) || (main_~b~0.base == 0 && main_~b~0.offset == 0));assume { :begin_inline_f } true;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; 1712#L25-4 assume true; 1713#L25-1 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); 1723#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); 1719#L23 assume { :end_inline_f } true;assume { :begin_inline_f } true;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; 1720#L25-9 assume true; 1733#L25-6 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); 1760#L26-1 assume !(f_#t~mem2.base == 0 && f_#t~mem2.offset == 0);havoc f_#t~mem2.base, f_#t~mem2.offset; 1738#L25-8 f_#t~post1 := f_~i~1;f_~i~1 := 1 + f_#t~post1;havoc f_#t~post1; 1734#L25-9 assume true; 1735#L25-6 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); 1743#L26-1 assume !(f_#t~mem2.base == 0 && f_#t~mem2.offset == 0);havoc f_#t~mem2.base, f_#t~mem2.offset; 1751#L25-8 f_#t~post1 := f_~i~1;f_~i~1 := 1 + f_#t~post1;havoc f_#t~post1; 1758#L25-9 assume true; 1756#L25-6 assume !(f_~i~1 < 2); 1757#L23-1 assume { :end_inline_f } true;assume { :begin_inline_g } true;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; 1774#L36-4 assume true; 1773#L36-1 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); 1766#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); 1740#L39 [2018-11-18 12:21:18,069 INFO L796 eck$LassoCheckResult]: Loop: 1740#L39 assume 1 == g_#t~mem5; 1741#L39-2 havoc g_#t~mem5;call write~int(2, ~#pstate~0.base, ~#pstate~0.offset + 4 * g_~i~2, 4); 1771#L36-3 g_#t~post3 := g_~i~2;g_~i~2 := 1 + g_#t~post3;havoc g_#t~post3; 1770#L36-4 assume true; 1767#L36-1 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); 1768#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); 1740#L39 [2018-11-18 12:21:18,069 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 12:21:18,069 INFO L82 PathProgramCache]: Analyzing trace with hash 283050386, now seen corresponding path program 1 times [2018-11-18 12:21:18,069 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 12:21:18,069 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 12:21:18,070 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:21:18,070 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 12:21:18,070 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:21:18,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 12:21:18,428 WARN L180 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 49 [2018-11-18 12:21:19,075 WARN L180 SmtUtils]: Spent 241.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 68 [2018-11-18 12:21:19,457 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 12:21:19,457 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 12:21:19,457 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_32a682b5-12ae-445a-a4a1-22782da750c8/bin-2019/uautomizer/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 [2018-11-18 12:21:19,467 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 12:21:19,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 12:21:19,484 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 12:21:19,486 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 7 treesize of output 6 [2018-11-18 12:21:19,486 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-18 12:21:19,490 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 7 treesize of output 6 [2018-11-18 12:21:19,490 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 12:21:19,494 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 12:21:19,494 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:18, output treesize:16 [2018-11-18 12:21:19,539 INFO L682 Elim1Store]: detected equality via solver [2018-11-18 12:21:19,540 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 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 22 treesize of output 26 [2018-11-18 12:21:19,540 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-18 12:21:19,548 INFO L682 Elim1Store]: detected equality via solver [2018-11-18 12:21:19,548 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 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 22 treesize of output 26 [2018-11-18 12:21:19,549 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 12:21:19,554 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 12:21:19,555 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:49, output treesize:33 [2018-11-18 12:21:19,600 INFO L682 Elim1Store]: detected equality via solver [2018-11-18 12:21:19,601 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 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 20 treesize of output 22 [2018-11-18 12:21:19,601 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-18 12:21:19,609 INFO L682 Elim1Store]: detected equality via solver [2018-11-18 12:21:19,610 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 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 20 treesize of output 22 [2018-11-18 12:21:19,610 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 12:21:19,614 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 12:21:19,614 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:42, output treesize:26 [2018-11-18 12:21:19,675 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 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 22 treesize of output 17 [2018-11-18 12:21:19,675 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-18 12:21:19,684 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 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 22 treesize of output 17 [2018-11-18 12:21:19,684 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 12:21:19,689 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2018-11-18 12:21:19,690 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:49, output treesize:33 [2018-11-18 12:21:20,168 WARN L180 SmtUtils]: Spent 445.00 ms on a formula simplification that was a NOOP. DAG size: 23 [2018-11-18 12:21:20,600 WARN L180 SmtUtils]: Spent 399.00 ms on a formula simplification that was a NOOP. DAG size: 25 [2018-11-18 12:21:21,036 WARN L180 SmtUtils]: Spent 403.00 ms on a formula simplification that was a NOOP. DAG size: 26 [2018-11-18 12:21:21,041 INFO L477 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 19 treesize of output 15 [2018-11-18 12:21:21,042 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-18 12:21:21,048 INFO L477 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 19 treesize of output 15 [2018-11-18 12:21:21,049 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 12:21:21,052 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2018-11-18 12:21:21,052 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 6 variables, input treesize:40, output treesize:26 [2018-11-18 12:21:21,086 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 5 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 12:21:21,101 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 12:21:21,101 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 9] total 28 [2018-11-18 12:21:21,101 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-18 12:21:21,101 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 12:21:21,101 INFO L82 PathProgramCache]: Analyzing trace with hash -1003468779, now seen corresponding path program 2 times [2018-11-18 12:21:21,101 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 12:21:21,101 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 12:21:21,102 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:21:21,102 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 12:21:21,102 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:21:21,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 12:21:21,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 12:21:21,167 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-11-18 12:21:21,168 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=131, Invalid=681, Unknown=0, NotChecked=0, Total=812 [2018-11-18 12:21:21,168 INFO L87 Difference]: Start difference. First operand 67 states and 75 transitions. cyclomatic complexity: 13 Second operand 29 states. [2018-11-18 12:21:25,687 WARN L180 SmtUtils]: Spent 1.28 s on a formula simplification. DAG size of input: 79 DAG size of output: 27 [2018-11-18 12:21:26,982 WARN L180 SmtUtils]: Spent 1.20 s on a formula simplification. DAG size of input: 100 DAG size of output: 33 [2018-11-18 12:21:28,985 WARN L180 SmtUtils]: Spent 1.08 s on a formula simplification. DAG size of input: 79 DAG size of output: 28 [2018-11-18 12:21:30,115 WARN L180 SmtUtils]: Spent 1.07 s on a formula simplification. DAG size of input: 104 DAG size of output: 38 [2018-11-18 12:21:31,961 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 12:21:31,961 INFO L93 Difference]: Finished difference Result 49 states and 52 transitions. [2018-11-18 12:21:31,961 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-11-18 12:21:31,961 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 49 states and 52 transitions. [2018-11-18 12:21:31,962 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2018-11-18 12:21:31,962 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 49 states to 47 states and 50 transitions. [2018-11-18 12:21:31,962 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 35 [2018-11-18 12:21:31,962 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 39 [2018-11-18 12:21:31,962 INFO L73 IsDeterministic]: Start isDeterministic. Operand 47 states and 50 transitions. [2018-11-18 12:21:31,963 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-18 12:21:31,963 INFO L705 BuchiCegarLoop]: Abstraction has 47 states and 50 transitions. [2018-11-18 12:21:31,963 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states and 50 transitions. [2018-11-18 12:21:31,964 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 45. [2018-11-18 12:21:31,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2018-11-18 12:21:31,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 48 transitions. [2018-11-18 12:21:31,964 INFO L728 BuchiCegarLoop]: Abstraction has 45 states and 48 transitions. [2018-11-18 12:21:31,965 INFO L608 BuchiCegarLoop]: Abstraction has 45 states and 48 transitions. [2018-11-18 12:21:31,965 INFO L442 BuchiCegarLoop]: ======== Iteration 12============ [2018-11-18 12:21:31,965 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 45 states and 48 transitions. [2018-11-18 12:21:31,965 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2018-11-18 12:21:31,965 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 12:21:31,965 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 12:21:31,966 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 12:21:31,967 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-11-18 12:21:31,967 INFO L794 eck$LassoCheckResult]: Stem: 2006#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];call ~#pp~0.base, ~#pp~0.offset := #Ultimate.alloc(8);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#pp~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#pp~0.base);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#pp~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#pp~0.base);call ~#pstate~0.base, ~#pstate~0.offset := #Ultimate.alloc(8);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#pstate~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#pstate~0.base);~counter~0 := 1; 1977#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;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;assume { :begin_inline_init } true;havoc init_#t~post0, init_~i~0;havoc init_~i~0;init_~i~0 := 0; 1978#L17-4 assume true; 2008#L17-1 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); 2011#L17-3 init_#t~post0 := init_~i~0;init_~i~0 := 1 + init_#t~post0;havoc init_#t~post0; 2009#L17-4 assume true; 1999#L17-1 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); 2000#L17-3 init_#t~post0 := init_~i~0;init_~i~0 := 1 + init_#t~post0;havoc init_#t~post0; 2016#L17-4 assume true; 1998#L17-1 assume !(init_~i~0 < 2); 1993#L15 assume { :end_inline_init } true;assume { :begin_inline_malloc } true;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; 1975#L47 main_#t~ret7.base, main_#t~ret7.offset := malloc_#res.base, malloc_#res.offset;assume { :end_inline_malloc } true;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;assume { :begin_inline_malloc } true;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; 1976#L47-1 main_#t~ret8.base, main_#t~ret8.offset := malloc_#res.base, malloc_#res.offset;assume { :end_inline_malloc } true;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; 1992#L57 assume !((main_~a~0.base == 0 && main_~a~0.offset == 0) || (main_~b~0.base == 0 && main_~b~0.offset == 0));assume { :begin_inline_f } true;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; 1979#L25-4 assume true; 1980#L25-1 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); 1990#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); 1986#L23 assume { :end_inline_f } true;assume { :begin_inline_f } true;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; 1987#L25-9 assume true; 2019#L25-6 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); 2012#L26-1 assume !(f_#t~mem2.base == 0 && f_#t~mem2.offset == 0);havoc f_#t~mem2.base, f_#t~mem2.offset; 2002#L25-8 f_#t~post1 := f_~i~1;f_~i~1 := 1 + f_#t~post1;havoc f_#t~post1; 1996#L25-9 assume true; 1997#L25-6 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); 2004#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); 1983#L23-1 assume { :end_inline_f } true;assume { :begin_inline_g } true;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; 1981#L36-4 assume true; 1982#L36-1 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); 1991#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); 1994#L39 assume 1 == g_#t~mem5; 1995#L39-2 havoc g_#t~mem5;call write~int(2, ~#pstate~0.base, ~#pstate~0.offset + 4 * g_~i~2, 4); 1984#L36-3 g_#t~post3 := g_~i~2;g_~i~2 := 1 + g_#t~post3;havoc g_#t~post3; 1985#L36-4 assume true; 2018#L36-1 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); 2014#L37 [2018-11-18 12:21:31,967 INFO L796 eck$LassoCheckResult]: Loop: 2014#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; 2017#L36-3 g_#t~post3 := g_~i~2;g_~i~2 := 1 + g_#t~post3;havoc g_#t~post3; 2015#L36-4 assume true; 2013#L36-1 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); 2014#L37 [2018-11-18 12:21:31,967 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 12:21:31,967 INFO L82 PathProgramCache]: Analyzing trace with hash 2082480159, now seen corresponding path program 2 times [2018-11-18 12:21:31,967 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 12:21:31,967 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 12:21:31,968 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:21:31,968 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 12:21:31,968 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:21:31,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 12:21:31,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 12:21:31,993 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 12:21:31,993 INFO L82 PathProgramCache]: Analyzing trace with hash 3726120, now seen corresponding path program 5 times [2018-11-18 12:21:31,993 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 12:21:31,993 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 12:21:31,996 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:21:31,996 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 12:21:31,996 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:21:31,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 12:21:31,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 12:21:31,999 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 12:21:31,999 INFO L82 PathProgramCache]: Analyzing trace with hash 821017670, now seen corresponding path program 1 times [2018-11-18 12:21:31,999 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 12:21:31,999 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 12:21:32,000 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:21:32,000 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 12:21:32,000 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:21:32,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 12:21:32,071 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 8 proven. 5 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-11-18 12:21:32,072 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 12:21:32,072 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_32a682b5-12ae-445a-a4a1-22782da750c8/bin-2019/uautomizer/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 [2018-11-18 12:21:32,091 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 12:21:32,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 12:21:32,112 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 12:21:32,115 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-11-18 12:21:32,131 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-18 12:21:32,132 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [8] total 9 [2018-11-18 12:21:32,154 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-18 12:21:32,154 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2018-11-18 12:21:32,155 INFO L87 Difference]: Start difference. First operand 45 states and 48 transitions. cyclomatic complexity: 6 Second operand 10 states. [2018-11-18 12:21:32,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 12:21:32,248 INFO L93 Difference]: Finished difference Result 53 states and 55 transitions. [2018-11-18 12:21:32,248 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-18 12:21:32,249 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 53 states and 55 transitions. [2018-11-18 12:21:32,249 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-18 12:21:32,249 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 53 states to 0 states and 0 transitions. [2018-11-18 12:21:32,249 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2018-11-18 12:21:32,249 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2018-11-18 12:21:32,250 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2018-11-18 12:21:32,250 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-18 12:21:32,250 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-18 12:21:32,250 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-18 12:21:32,250 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-18 12:21:32,250 INFO L442 BuchiCegarLoop]: ======== Iteration 13============ [2018-11-18 12:21:32,250 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2018-11-18 12:21:32,250 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-18 12:21:32,250 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2018-11-18 12:21:32,256 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 18.11 12:21:32 BoogieIcfgContainer [2018-11-18 12:21:32,256 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-11-18 12:21:32,256 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-18 12:21:32,257 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-18 12:21:32,257 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-18 12:21:32,257 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 12:21:10" (3/4) ... [2018-11-18 12:21:32,260 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-11-18 12:21:32,261 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-18 12:21:32,261 INFO L168 Benchmark]: Toolchain (without parser) took 22185.10 ms. Allocated memory was 1.0 GB in the beginning and 1.5 GB in the end (delta: 429.9 MB). Free memory was 953.7 MB in the beginning and 1.3 GB in the end (delta: -362.4 MB). Peak memory consumption was 67.5 MB. Max. memory is 11.5 GB. [2018-11-18 12:21:32,262 INFO L168 Benchmark]: CDTParser took 0.10 ms. Allocated memory is still 1.0 GB. Free memory is still 980.1 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-18 12:21:32,262 INFO L168 Benchmark]: CACSL2BoogieTranslator took 155.92 ms. Allocated memory is still 1.0 GB. Free memory was 953.7 MB in the beginning and 940.1 MB in the end (delta: 13.6 MB). Peak memory consumption was 13.6 MB. Max. memory is 11.5 GB. [2018-11-18 12:21:32,262 INFO L168 Benchmark]: Boogie Procedure Inliner took 72.67 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 174.1 MB). Free memory was 940.1 MB in the beginning and 1.2 GB in the end (delta: -232.2 MB). Peak memory consumption was 14.6 MB. Max. memory is 11.5 GB. [2018-11-18 12:21:32,262 INFO L168 Benchmark]: Boogie Preprocessor took 24.85 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 3.3 MB). Peak memory consumption was 3.3 MB. Max. memory is 11.5 GB. [2018-11-18 12:21:32,263 INFO L168 Benchmark]: RCFGBuilder took 298.35 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 27.4 MB). Peak memory consumption was 27.4 MB. Max. memory is 11.5 GB. [2018-11-18 12:21:32,263 INFO L168 Benchmark]: BuchiAutomizer took 21625.98 ms. Allocated memory was 1.2 GB in the beginning and 1.5 GB in the end (delta: 255.9 MB). Free memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: -174.6 MB). Peak memory consumption was 81.2 MB. Max. memory is 11.5 GB. [2018-11-18 12:21:32,263 INFO L168 Benchmark]: Witness Printer took 4.18 ms. Allocated memory is still 1.5 GB. Free memory is still 1.3 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-18 12:21:32,266 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.10 ms. Allocated memory is still 1.0 GB. Free memory is still 980.1 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 155.92 ms. Allocated memory is still 1.0 GB. Free memory was 953.7 MB in the beginning and 940.1 MB in the end (delta: 13.6 MB). Peak memory consumption was 13.6 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 72.67 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 174.1 MB). Free memory was 940.1 MB in the beginning and 1.2 GB in the end (delta: -232.2 MB). Peak memory consumption was 14.6 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 24.85 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 3.3 MB). Peak memory consumption was 3.3 MB. Max. memory is 11.5 GB. * RCFGBuilder took 298.35 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 27.4 MB). Peak memory consumption was 27.4 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 21625.98 ms. Allocated memory was 1.2 GB in the beginning and 1.5 GB in the end (delta: 255.9 MB). Free memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: -174.6 MB). Peak memory consumption was 81.2 MB. Max. memory is 11.5 GB. * Witness Printer took 4.18 ms. Allocated memory is still 1.5 GB. Free memory is still 1.3 GB. There was no memory consumed. Max. memory is 11.5 GB. * 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 -2 * i + 3 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 29 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 21.5s and 13 iterations. TraceHistogramMax:3. Analysis of lassos took 8.1s. Construction of modules took 6.1s. Büchi inclusion checks took 7.1s. Highest rank in rank-based complementation 3. Minimization of det autom 1. Minimization of nondet autom 11. Automata minimization 0.0s AutomataMinimizationTime, 11 MinimizatonAttempts, 96 StatesRemovedByMinimization, 9 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 67 states and ocurred in iteration 10. Nontrivial modules had stage [2, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 386 SDtfs, 1184 SDslu, 1356 SDs, 0 SdLazy, 1420 SolverSat, 254 SolverUnsat, 11 SolverUnknown, 0 SolverNotchecked, 6.1s Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc4 concLT0 SILN0 SILU6 SILI0 SILT0 lasso2 LassoPreprocessingBenchmarks: Lassos: inital226 mio100 ax100 hnf99 lsp84 ukn43 mio100 lsp61 div100 bol100 ite100 ukn100 eq139 hnf93 smp97 dnf100 smp100 tf100 neg100 sie103 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 9ms VariablesStem: 1 VariablesLoop: 0 DisjunctsStem: 2 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 8 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...