./Ultimate.py --spec ../../sv-benchmarks/c/Termination.prp --file ../../sv-benchmarks/c/termination-memory-alloca/Urban-2013WST-Fig2-alloca_true-termination.c.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 5842f4b8 Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_6a300b76-927b-4df7-a7d6-c354c6c7ad0f/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_6a300b76-927b-4df7-a7d6-c354c6c7ad0f/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_6a300b76-927b-4df7-a7d6-c354c6c7ad0f/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_6a300b76-927b-4df7-a7d6-c354c6c7ad0f/bin-2019/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/termination-memory-alloca/Urban-2013WST-Fig2-alloca_true-termination.c.i -s /tmp/vcloud-vcloud-master/worker/working_dir_6a300b76-927b-4df7-a7d6-c354c6c7ad0f/bin-2019/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_6a300b76-927b-4df7-a7d6-c354c6c7ad0f/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 64bit --witnessprinter.graph.data.programhash b6ea490b9c20ea87d0996e916d918afb3a914616 ...................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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 15:23:52,646 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-18 15:23:52,647 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-18 15:23:52,653 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-18 15:23:52,653 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-18 15:23:52,654 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-18 15:23:52,655 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-18 15:23:52,656 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-18 15:23:52,657 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-18 15:23:52,657 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-18 15:23:52,658 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-18 15:23:52,658 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-18 15:23:52,659 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-18 15:23:52,660 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-18 15:23:52,660 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-18 15:23:52,661 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-18 15:23:52,661 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-18 15:23:52,662 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-18 15:23:52,663 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-18 15:23:52,664 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-18 15:23:52,664 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-18 15:23:52,665 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-18 15:23:52,666 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-18 15:23:52,666 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-18 15:23:52,666 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-18 15:23:52,667 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-18 15:23:52,667 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-18 15:23:52,668 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-18 15:23:52,668 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-18 15:23:52,669 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-18 15:23:52,669 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-18 15:23:52,670 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-18 15:23:52,670 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-18 15:23:52,670 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-18 15:23:52,671 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-18 15:23:52,671 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-18 15:23:52,671 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_6a300b76-927b-4df7-a7d6-c354c6c7ad0f/bin-2019/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf [2018-11-18 15:23:52,679 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-18 15:23:52,679 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-18 15:23:52,680 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-18 15:23:52,680 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-18 15:23:52,680 INFO L133 SettingsManager]: * Use SBE=true [2018-11-18 15:23:52,681 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-11-18 15:23:52,681 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-11-18 15:23:52,681 INFO L133 SettingsManager]: * Use old map elimination=false [2018-11-18 15:23:52,681 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-11-18 15:23:52,681 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-11-18 15:23:52,681 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-11-18 15:23:52,681 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-18 15:23:52,682 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-18 15:23:52,682 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-18 15:23:52,682 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-18 15:23:52,682 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-11-18 15:23:52,682 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-11-18 15:23:52,682 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-11-18 15:23:52,682 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-18 15:23:52,682 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-11-18 15:23:52,683 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-18 15:23:52,683 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-11-18 15:23:52,683 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-18 15:23:52,683 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-18 15:23:52,683 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-11-18 15:23:52,683 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-18 15:23:52,683 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-18 15:23:52,683 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-11-18 15:23:52,684 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-11-18 15:23:52,684 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_6a300b76-927b-4df7-a7d6-c354c6c7ad0f/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 -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> b6ea490b9c20ea87d0996e916d918afb3a914616 [2018-11-18 15:23:52,709 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-18 15:23:52,718 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-18 15:23:52,720 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-18 15:23:52,721 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-18 15:23:52,721 INFO L276 PluginConnector]: CDTParser initialized [2018-11-18 15:23:52,722 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_6a300b76-927b-4df7-a7d6-c354c6c7ad0f/bin-2019/uautomizer/../../sv-benchmarks/c/termination-memory-alloca/Urban-2013WST-Fig2-alloca_true-termination.c.i [2018-11-18 15:23:52,757 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_6a300b76-927b-4df7-a7d6-c354c6c7ad0f/bin-2019/uautomizer/data/2a58cce8c/20744b846a6e4038afe759d64e0f7ee8/FLAG8f676f5c4 [2018-11-18 15:23:53,191 INFO L307 CDTParser]: Found 1 translation units. [2018-11-18 15:23:53,192 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_6a300b76-927b-4df7-a7d6-c354c6c7ad0f/sv-benchmarks/c/termination-memory-alloca/Urban-2013WST-Fig2-alloca_true-termination.c.i [2018-11-18 15:23:53,201 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_6a300b76-927b-4df7-a7d6-c354c6c7ad0f/bin-2019/uautomizer/data/2a58cce8c/20744b846a6e4038afe759d64e0f7ee8/FLAG8f676f5c4 [2018-11-18 15:23:53,211 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_6a300b76-927b-4df7-a7d6-c354c6c7ad0f/bin-2019/uautomizer/data/2a58cce8c/20744b846a6e4038afe759d64e0f7ee8 [2018-11-18 15:23:53,214 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-18 15:23:53,214 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-18 15:23:53,215 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-18 15:23:53,215 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-18 15:23:53,217 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-18 15:23:53,218 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 03:23:53" (1/1) ... [2018-11-18 15:23:53,220 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5a671eef and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 03:23:53, skipping insertion in model container [2018-11-18 15:23:53,220 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 03:23:53" (1/1) ... [2018-11-18 15:23:53,226 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-18 15:23:53,252 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-18 15:23:53,425 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-18 15:23:53,433 INFO L191 MainTranslator]: Completed pre-run [2018-11-18 15:23:53,458 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-18 15:23:53,528 INFO L195 MainTranslator]: Completed translation [2018-11-18 15:23:53,529 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 03:23:53 WrapperNode [2018-11-18 15:23:53,529 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-18 15:23:53,529 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-18 15:23:53,529 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-18 15:23:53,529 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-18 15:23:53,534 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 03:23:53" (1/1) ... [2018-11-18 15:23:53,543 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 03:23:53" (1/1) ... [2018-11-18 15:23:53,555 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-18 15:23:53,556 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-18 15:23:53,556 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-18 15:23:53,556 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-18 15:23:53,561 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 03:23:53" (1/1) ... [2018-11-18 15:23:53,561 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 03:23:53" (1/1) ... [2018-11-18 15:23:53,562 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 03:23:53" (1/1) ... [2018-11-18 15:23:53,562 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 03:23:53" (1/1) ... [2018-11-18 15:23:53,565 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 03:23:53" (1/1) ... [2018-11-18 15:23:53,569 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 03:23:53" (1/1) ... [2018-11-18 15:23:53,569 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 03:23:53" (1/1) ... [2018-11-18 15:23:53,570 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-18 15:23:53,571 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-18 15:23:53,571 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-18 15:23:53,571 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-18 15:23:53,571 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 03:23:53" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_6a300b76-927b-4df7-a7d6-c354c6c7ad0f/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 15:23:53,611 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-18 15:23:53,611 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-18 15:23:53,611 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-18 15:23:53,611 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-18 15:23:53,611 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-18 15:23:53,611 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-18 15:23:53,746 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-18 15:23:53,746 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 03:23:53 BoogieIcfgContainer [2018-11-18 15:23:53,747 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-18 15:23:53,747 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-11-18 15:23:53,747 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-11-18 15:23:53,749 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-11-18 15:23:53,750 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-18 15:23:53,750 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 18.11 03:23:53" (1/3) ... [2018-11-18 15:23:53,750 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@d80760e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 18.11 03:23:53, skipping insertion in model container [2018-11-18 15:23:53,750 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-18 15:23:53,751 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 03:23:53" (2/3) ... [2018-11-18 15:23:53,751 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@d80760e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 18.11 03:23:53, skipping insertion in model container [2018-11-18 15:23:53,751 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-18 15:23:53,751 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 03:23:53" (3/3) ... [2018-11-18 15:23:53,752 INFO L375 chiAutomizerObserver]: Analyzing ICFG Urban-2013WST-Fig2-alloca_true-termination.c.i [2018-11-18 15:23:53,788 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-18 15:23:53,788 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-11-18 15:23:53,788 INFO L375 BuchiCegarLoop]: Hoare is false [2018-11-18 15:23:53,788 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-11-18 15:23:53,790 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-18 15:23:53,790 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-18 15:23:53,790 INFO L379 BuchiCegarLoop]: Difference is false [2018-11-18 15:23:53,790 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-18 15:23:53,790 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-11-18 15:23:53,802 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 13 states. [2018-11-18 15:23:53,817 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2018-11-18 15:23:53,817 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 15:23:53,817 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 15:23:53,823 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-18 15:23:53,823 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2018-11-18 15:23:53,823 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-11-18 15:23:53,824 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 13 states. [2018-11-18 15:23:53,824 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2018-11-18 15:23:53,825 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 15:23:53,825 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 15:23:53,825 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-18 15:23:53,825 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2018-11-18 15:23:53,832 INFO L794 eck$LassoCheckResult]: Stem: 11#ULTIMATE.startENTRYtrue assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 10#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~malloc3.base, main_#t~malloc3.offset, main_#t~mem6, main_#t~mem5, main_#t~mem7, main_#t~mem4, main_~x1~0.base, main_~x1~0.offset, main_~x2~0.base, main_~x2~0.offset;call main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.alloc(4);main_~x1~0.base, main_~x1~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset;call main_#t~malloc3.base, main_#t~malloc3.offset := #Ultimate.alloc(4);main_~x2~0.base, main_~x2~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset; 8#L549-4true [2018-11-18 15:23:53,833 INFO L796 eck$LassoCheckResult]: Loop: 8#L549-4true assume true; 3#L549-1true call main_#t~mem4 := read~int(main_~x1~0.base, main_~x1~0.offset, 4); 4#L549-2true assume !!(main_#t~mem4 <= 10);havoc main_#t~mem4;call write~int(10, main_~x2~0.base, main_~x2~0.offset, 4); 5#L551-4true assume !true; 7#L551-5true call main_#t~mem7 := read~int(main_~x1~0.base, main_~x1~0.offset, 4);call write~int(1 + main_#t~mem7, main_~x1~0.base, main_~x1~0.offset, 4);havoc main_#t~mem7; 8#L549-4true [2018-11-18 15:23:53,838 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 15:23:53,838 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2018-11-18 15:23:53,839 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 15:23:53,840 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 15:23:53,873 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:23:53,874 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 15:23:53,874 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:23:53,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 15:23:53,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 15:23:53,907 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 15:23:53,907 INFO L82 PathProgramCache]: Analyzing trace with hash 34421932, now seen corresponding path program 1 times [2018-11-18 15:23:53,907 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 15:23:53,908 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 15:23:53,909 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:23:53,909 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 15:23:53,909 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:23:53,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 15:23:53,938 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 15:23:53,939 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 15:23:53,939 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-18 15:23:53,942 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-11-18 15:23:53,951 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-18 15:23:53,951 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-18 15:23:53,952 INFO L87 Difference]: Start difference. First operand 13 states. Second operand 2 states. [2018-11-18 15:23:53,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 15:23:53,956 INFO L93 Difference]: Finished difference Result 13 states and 14 transitions. [2018-11-18 15:23:53,957 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-18 15:23:53,958 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 13 states and 14 transitions. [2018-11-18 15:23:53,959 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2018-11-18 15:23:53,962 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 13 states to 9 states and 10 transitions. [2018-11-18 15:23:53,963 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9 [2018-11-18 15:23:53,963 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 9 [2018-11-18 15:23:53,964 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 10 transitions. [2018-11-18 15:23:53,964 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-18 15:23:53,964 INFO L705 BuchiCegarLoop]: Abstraction has 9 states and 10 transitions. [2018-11-18 15:23:53,977 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states and 10 transitions. [2018-11-18 15:23:53,982 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 9. [2018-11-18 15:23:53,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-11-18 15:23:53,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 10 transitions. [2018-11-18 15:23:53,984 INFO L728 BuchiCegarLoop]: Abstraction has 9 states and 10 transitions. [2018-11-18 15:23:53,984 INFO L608 BuchiCegarLoop]: Abstraction has 9 states and 10 transitions. [2018-11-18 15:23:53,984 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-11-18 15:23:53,984 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 9 states and 10 transitions. [2018-11-18 15:23:53,985 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2018-11-18 15:23:53,985 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 15:23:53,985 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 15:23:53,985 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-18 15:23:53,985 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2018-11-18 15:23:53,986 INFO L794 eck$LassoCheckResult]: Stem: 38#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 34#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~malloc3.base, main_#t~malloc3.offset, main_#t~mem6, main_#t~mem5, main_#t~mem7, main_#t~mem4, main_~x1~0.base, main_~x1~0.offset, main_~x2~0.base, main_~x2~0.offset;call main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.alloc(4);main_~x1~0.base, main_~x1~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset;call main_#t~malloc3.base, main_#t~malloc3.offset := #Ultimate.alloc(4);main_~x2~0.base, main_~x2~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset; 35#L549-4 [2018-11-18 15:23:53,986 INFO L796 eck$LassoCheckResult]: Loop: 35#L549-4 assume true; 36#L549-1 call main_#t~mem4 := read~int(main_~x1~0.base, main_~x1~0.offset, 4); 37#L549-2 assume !!(main_#t~mem4 <= 10);havoc main_#t~mem4;call write~int(10, main_~x2~0.base, main_~x2~0.offset, 4); 39#L551-4 assume true; 40#L551-1 call main_#t~mem5 := read~int(main_~x2~0.base, main_~x2~0.offset, 4); 42#L551-2 assume !(main_#t~mem5 > 1);havoc main_#t~mem5; 41#L551-5 call main_#t~mem7 := read~int(main_~x1~0.base, main_~x1~0.offset, 4);call write~int(1 + main_#t~mem7, main_~x1~0.base, main_~x1~0.offset, 4);havoc main_#t~mem7; 35#L549-4 [2018-11-18 15:23:53,986 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 15:23:53,986 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 2 times [2018-11-18 15:23:53,986 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 15:23:53,986 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 15:23:53,988 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:23:53,988 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 15:23:53,988 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:23:53,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 15:23:53,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 15:23:53,998 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 15:23:53,998 INFO L82 PathProgramCache]: Analyzing trace with hash -1280537774, now seen corresponding path program 1 times [2018-11-18 15:23:53,998 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 15:23:53,998 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 15:23:53,999 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:23:53,999 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 15:23:54,000 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:23:54,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 15:23:54,052 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 15:23:54,052 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 15:23:54,052 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-18 15:23:54,053 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-11-18 15:23:54,053 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-18 15:23:54,053 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-18 15:23:54,053 INFO L87 Difference]: Start difference. First operand 9 states and 10 transitions. cyclomatic complexity: 2 Second operand 4 states. [2018-11-18 15:23:54,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 15:23:54,095 INFO L93 Difference]: Finished difference Result 12 states and 13 transitions. [2018-11-18 15:23:54,095 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-18 15:23:54,096 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 12 states and 13 transitions. [2018-11-18 15:23:54,096 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 10 [2018-11-18 15:23:54,097 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 12 states to 12 states and 13 transitions. [2018-11-18 15:23:54,097 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 12 [2018-11-18 15:23:54,097 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 12 [2018-11-18 15:23:54,097 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 13 transitions. [2018-11-18 15:23:54,097 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-18 15:23:54,097 INFO L705 BuchiCegarLoop]: Abstraction has 12 states and 13 transitions. [2018-11-18 15:23:54,097 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states and 13 transitions. [2018-11-18 15:23:54,098 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2018-11-18 15:23:54,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-11-18 15:23:54,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 13 transitions. [2018-11-18 15:23:54,098 INFO L728 BuchiCegarLoop]: Abstraction has 12 states and 13 transitions. [2018-11-18 15:23:54,098 INFO L608 BuchiCegarLoop]: Abstraction has 12 states and 13 transitions. [2018-11-18 15:23:54,098 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-11-18 15:23:54,099 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 12 states and 13 transitions. [2018-11-18 15:23:54,099 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 10 [2018-11-18 15:23:54,099 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 15:23:54,099 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 15:23:54,099 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-18 15:23:54,099 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 1, 1, 1, 1, 1, 1] [2018-11-18 15:23:54,099 INFO L794 eck$LassoCheckResult]: Stem: 68#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 64#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~malloc3.base, main_#t~malloc3.offset, main_#t~mem6, main_#t~mem5, main_#t~mem7, main_#t~mem4, main_~x1~0.base, main_~x1~0.offset, main_~x2~0.base, main_~x2~0.offset;call main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.alloc(4);main_~x1~0.base, main_~x1~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset;call main_#t~malloc3.base, main_#t~malloc3.offset := #Ultimate.alloc(4);main_~x2~0.base, main_~x2~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset; 65#L549-4 [2018-11-18 15:23:54,099 INFO L796 eck$LassoCheckResult]: Loop: 65#L549-4 assume true; 66#L549-1 call main_#t~mem4 := read~int(main_~x1~0.base, main_~x1~0.offset, 4); 67#L549-2 assume !!(main_#t~mem4 <= 10);havoc main_#t~mem4;call write~int(10, main_~x2~0.base, main_~x2~0.offset, 4); 69#L551-4 assume true; 70#L551-1 call main_#t~mem5 := read~int(main_~x2~0.base, main_~x2~0.offset, 4); 72#L551-2 assume !!(main_#t~mem5 > 1);havoc main_#t~mem5;call main_#t~mem6 := read~int(main_~x2~0.base, main_~x2~0.offset, 4);call write~int(main_#t~mem6 - 1, main_~x2~0.base, main_~x2~0.offset, 4);havoc main_#t~mem6; 73#L551-4 assume true; 75#L551-1 call main_#t~mem5 := read~int(main_~x2~0.base, main_~x2~0.offset, 4); 74#L551-2 assume !(main_#t~mem5 > 1);havoc main_#t~mem5; 71#L551-5 call main_#t~mem7 := read~int(main_~x1~0.base, main_~x1~0.offset, 4);call write~int(1 + main_#t~mem7, main_~x1~0.base, main_~x1~0.offset, 4);havoc main_#t~mem7; 65#L549-4 [2018-11-18 15:23:54,100 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 15:23:54,100 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 3 times [2018-11-18 15:23:54,100 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 15:23:54,100 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 15:23:54,101 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:23:54,101 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 15:23:54,101 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:23:54,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 15:23:54,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 15:23:54,111 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 15:23:54,111 INFO L82 PathProgramCache]: Analyzing trace with hash -599763852, now seen corresponding path program 1 times [2018-11-18 15:23:54,111 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 15:23:54,111 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 15:23:54,112 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:23:54,112 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 15:23:54,112 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:23:54,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 15:23:54,190 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 15:23:54,190 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 15:23:54,190 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_6a300b76-927b-4df7-a7d6-c354c6c7ad0f/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 15:23:54,205 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 15:23:54,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 15:23:54,219 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 15:23:54,247 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 15:23:54,249 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 15:23:54,250 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 15:23:54,252 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 15:23:54,253 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 15:23:54,253 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:11, output treesize:7 [2018-11-18 15:23:54,261 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 15:23:54,261 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 28 [2018-11-18 15:23:54,267 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 15:23:54,268 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 28 treesize of output 7 [2018-11-18 15:23:54,268 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 15:23:54,270 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 15:23:54,271 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 15:23:54,272 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:25, output treesize:7 [2018-11-18 15:23:54,284 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 15:23:54,286 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 15:23:54,287 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 15:23:54,288 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 15:23:54,289 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 15:23:54,289 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:15, output treesize:3 [2018-11-18 15:23:54,291 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 15:23:54,315 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 15:23:54,316 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 6 [2018-11-18 15:23:54,316 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-11-18 15:23:54,316 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-18 15:23:54,316 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-11-18 15:23:54,316 INFO L87 Difference]: Start difference. First operand 12 states and 13 transitions. cyclomatic complexity: 2 Second operand 6 states. [2018-11-18 15:23:54,348 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 15:23:54,349 INFO L93 Difference]: Finished difference Result 15 states and 16 transitions. [2018-11-18 15:23:54,349 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-18 15:23:54,349 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 15 states and 16 transitions. [2018-11-18 15:23:54,350 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 13 [2018-11-18 15:23:54,350 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 15 states to 15 states and 16 transitions. [2018-11-18 15:23:54,350 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 15 [2018-11-18 15:23:54,351 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 15 [2018-11-18 15:23:54,351 INFO L73 IsDeterministic]: Start isDeterministic. Operand 15 states and 16 transitions. [2018-11-18 15:23:54,351 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-18 15:23:54,351 INFO L705 BuchiCegarLoop]: Abstraction has 15 states and 16 transitions. [2018-11-18 15:23:54,351 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states and 16 transitions. [2018-11-18 15:23:54,352 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2018-11-18 15:23:54,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-11-18 15:23:54,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 16 transitions. [2018-11-18 15:23:54,353 INFO L728 BuchiCegarLoop]: Abstraction has 15 states and 16 transitions. [2018-11-18 15:23:54,353 INFO L608 BuchiCegarLoop]: Abstraction has 15 states and 16 transitions. [2018-11-18 15:23:54,353 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2018-11-18 15:23:54,353 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states and 16 transitions. [2018-11-18 15:23:54,353 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 13 [2018-11-18 15:23:54,353 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 15:23:54,353 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 15:23:54,354 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-18 15:23:54,354 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [3, 3, 2, 1, 1, 1, 1, 1] [2018-11-18 15:23:54,354 INFO L794 eck$LassoCheckResult]: Stem: 135#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 131#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~malloc3.base, main_#t~malloc3.offset, main_#t~mem6, main_#t~mem5, main_#t~mem7, main_#t~mem4, main_~x1~0.base, main_~x1~0.offset, main_~x2~0.base, main_~x2~0.offset;call main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.alloc(4);main_~x1~0.base, main_~x1~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset;call main_#t~malloc3.base, main_#t~malloc3.offset := #Ultimate.alloc(4);main_~x2~0.base, main_~x2~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset; 132#L549-4 [2018-11-18 15:23:54,354 INFO L796 eck$LassoCheckResult]: Loop: 132#L549-4 assume true; 133#L549-1 call main_#t~mem4 := read~int(main_~x1~0.base, main_~x1~0.offset, 4); 134#L549-2 assume !!(main_#t~mem4 <= 10);havoc main_#t~mem4;call write~int(10, main_~x2~0.base, main_~x2~0.offset, 4); 136#L551-4 assume true; 145#L551-1 call main_#t~mem5 := read~int(main_~x2~0.base, main_~x2~0.offset, 4); 141#L551-2 assume !!(main_#t~mem5 > 1);havoc main_#t~mem5;call main_#t~mem6 := read~int(main_~x2~0.base, main_~x2~0.offset, 4);call write~int(main_#t~mem6 - 1, main_~x2~0.base, main_~x2~0.offset, 4);havoc main_#t~mem6; 137#L551-4 assume true; 138#L551-1 call main_#t~mem5 := read~int(main_~x2~0.base, main_~x2~0.offset, 4); 140#L551-2 assume !!(main_#t~mem5 > 1);havoc main_#t~mem5;call main_#t~mem6 := read~int(main_~x2~0.base, main_~x2~0.offset, 4);call write~int(main_#t~mem6 - 1, main_~x2~0.base, main_~x2~0.offset, 4);havoc main_#t~mem6; 143#L551-4 assume true; 144#L551-1 call main_#t~mem5 := read~int(main_~x2~0.base, main_~x2~0.offset, 4); 142#L551-2 assume !(main_#t~mem5 > 1);havoc main_#t~mem5; 139#L551-5 call main_#t~mem7 := read~int(main_~x1~0.base, main_~x1~0.offset, 4);call write~int(1 + main_#t~mem7, main_~x1~0.base, main_~x1~0.offset, 4);havoc main_#t~mem7; 132#L549-4 [2018-11-18 15:23:54,354 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 15:23:54,354 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 4 times [2018-11-18 15:23:54,355 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 15:23:54,355 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 15:23:54,355 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:23:54,356 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 15:23:54,356 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:23:54,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 15:23:54,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 15:23:54,363 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 15:23:54,363 INFO L82 PathProgramCache]: Analyzing trace with hash -499425262, now seen corresponding path program 2 times [2018-11-18 15:23:54,363 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 15:23:54,364 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 15:23:54,364 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:23:54,365 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 15:23:54,365 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:23:54,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 15:23:54,429 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 15:23:54,430 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 15:23:54,430 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_6a300b76-927b-4df7-a7d6-c354c6c7ad0f/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 15:23:54,437 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-18 15:23:54,447 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-18 15:23:54,447 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-18 15:23:54,448 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 15:23:54,452 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 15:23:54,453 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 15:23:54,454 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 15:23:54,455 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 15:23:54,463 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 15:23:54,463 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:11, output treesize:7 [2018-11-18 15:23:54,467 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 15:23:54,468 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 28 [2018-11-18 15:23:54,471 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 15:23:54,471 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 28 treesize of output 7 [2018-11-18 15:23:54,472 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 15:23:54,475 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 15:23:54,477 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 15:23:54,477 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:25, output treesize:7 [2018-11-18 15:23:54,514 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 15:23:54,515 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 28 [2018-11-18 15:23:54,520 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 15:23:54,521 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 28 treesize of output 7 [2018-11-18 15:23:54,521 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 15:23:54,527 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 15:23:54,528 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 15:23:54,529 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:25, output treesize:7 [2018-11-18 15:23:54,536 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 15:23:54,538 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 15:23:54,538 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 15:23:54,539 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 15:23:54,540 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 15:23:54,540 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:15, output treesize:3 [2018-11-18 15:23:54,541 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 15:23:54,556 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 15:23:54,556 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 8 [2018-11-18 15:23:54,556 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-11-18 15:23:54,556 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-18 15:23:54,557 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-11-18 15:23:54,557 INFO L87 Difference]: Start difference. First operand 15 states and 16 transitions. cyclomatic complexity: 2 Second operand 8 states. [2018-11-18 15:23:54,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 15:23:54,599 INFO L93 Difference]: Finished difference Result 18 states and 19 transitions. [2018-11-18 15:23:54,600 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-18 15:23:54,600 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 18 states and 19 transitions. [2018-11-18 15:23:54,600 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 16 [2018-11-18 15:23:54,601 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 18 states to 18 states and 19 transitions. [2018-11-18 15:23:54,601 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 18 [2018-11-18 15:23:54,601 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 18 [2018-11-18 15:23:54,601 INFO L73 IsDeterministic]: Start isDeterministic. Operand 18 states and 19 transitions. [2018-11-18 15:23:54,601 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-18 15:23:54,601 INFO L705 BuchiCegarLoop]: Abstraction has 18 states and 19 transitions. [2018-11-18 15:23:54,601 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states and 19 transitions. [2018-11-18 15:23:54,602 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2018-11-18 15:23:54,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-11-18 15:23:54,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 19 transitions. [2018-11-18 15:23:54,603 INFO L728 BuchiCegarLoop]: Abstraction has 18 states and 19 transitions. [2018-11-18 15:23:54,603 INFO L608 BuchiCegarLoop]: Abstraction has 18 states and 19 transitions. [2018-11-18 15:23:54,603 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2018-11-18 15:23:54,603 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states and 19 transitions. [2018-11-18 15:23:54,603 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 16 [2018-11-18 15:23:54,603 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 15:23:54,603 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 15:23:54,604 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-18 15:23:54,604 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [4, 4, 3, 1, 1, 1, 1, 1] [2018-11-18 15:23:54,604 INFO L794 eck$LassoCheckResult]: Stem: 221#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 217#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~malloc3.base, main_#t~malloc3.offset, main_#t~mem6, main_#t~mem5, main_#t~mem7, main_#t~mem4, main_~x1~0.base, main_~x1~0.offset, main_~x2~0.base, main_~x2~0.offset;call main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.alloc(4);main_~x1~0.base, main_~x1~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset;call main_#t~malloc3.base, main_#t~malloc3.offset := #Ultimate.alloc(4);main_~x2~0.base, main_~x2~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset; 218#L549-4 [2018-11-18 15:23:54,604 INFO L796 eck$LassoCheckResult]: Loop: 218#L549-4 assume true; 219#L549-1 call main_#t~mem4 := read~int(main_~x1~0.base, main_~x1~0.offset, 4); 220#L549-2 assume !!(main_#t~mem4 <= 10);havoc main_#t~mem4;call write~int(10, main_~x2~0.base, main_~x2~0.offset, 4); 222#L551-4 assume true; 234#L551-1 call main_#t~mem5 := read~int(main_~x2~0.base, main_~x2~0.offset, 4); 227#L551-2 assume !!(main_#t~mem5 > 1);havoc main_#t~mem5;call main_#t~mem6 := read~int(main_~x2~0.base, main_~x2~0.offset, 4);call write~int(main_#t~mem6 - 1, main_~x2~0.base, main_~x2~0.offset, 4);havoc main_#t~mem6; 223#L551-4 assume true; 224#L551-1 call main_#t~mem5 := read~int(main_~x2~0.base, main_~x2~0.offset, 4); 226#L551-2 assume !!(main_#t~mem5 > 1);havoc main_#t~mem5;call main_#t~mem6 := read~int(main_~x2~0.base, main_~x2~0.offset, 4);call write~int(main_#t~mem6 - 1, main_~x2~0.base, main_~x2~0.offset, 4);havoc main_#t~mem6; 233#L551-4 assume true; 232#L551-1 call main_#t~mem5 := read~int(main_~x2~0.base, main_~x2~0.offset, 4); 231#L551-2 assume !!(main_#t~mem5 > 1);havoc main_#t~mem5;call main_#t~mem6 := read~int(main_~x2~0.base, main_~x2~0.offset, 4);call write~int(main_#t~mem6 - 1, main_~x2~0.base, main_~x2~0.offset, 4);havoc main_#t~mem6; 229#L551-4 assume true; 230#L551-1 call main_#t~mem5 := read~int(main_~x2~0.base, main_~x2~0.offset, 4); 228#L551-2 assume !(main_#t~mem5 > 1);havoc main_#t~mem5; 225#L551-5 call main_#t~mem7 := read~int(main_~x1~0.base, main_~x1~0.offset, 4);call write~int(1 + main_#t~mem7, main_~x1~0.base, main_~x1~0.offset, 4);havoc main_#t~mem7; 218#L549-4 [2018-11-18 15:23:54,604 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 15:23:54,604 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 5 times [2018-11-18 15:23:54,604 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 15:23:54,604 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 15:23:54,605 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:23:54,605 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 15:23:54,605 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:23:54,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 15:23:54,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 15:23:54,610 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 15:23:54,610 INFO L82 PathProgramCache]: Analyzing trace with hash -609728588, now seen corresponding path program 3 times [2018-11-18 15:23:54,611 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 15:23:54,611 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 15:23:54,611 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:23:54,612 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 15:23:54,612 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:23:54,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 15:23:54,683 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 15:23:54,683 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 15:23:54,683 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_6a300b76-927b-4df7-a7d6-c354c6c7ad0f/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 15:23:54,700 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-18 15:23:54,717 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-11-18 15:23:54,717 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-18 15:23:54,718 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 15:23:54,721 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 15:23:54,723 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 15:23:54,723 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 15:23:54,725 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 15:23:54,727 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 15:23:54,727 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:11, output treesize:7 [2018-11-18 15:23:54,731 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 15:23:54,732 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 28 [2018-11-18 15:23:54,740 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 15:23:54,741 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 28 treesize of output 7 [2018-11-18 15:23:54,741 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 15:23:54,748 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 15:23:54,749 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 15:23:54,750 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:25, output treesize:7 [2018-11-18 15:23:54,760 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 15:23:54,761 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 28 [2018-11-18 15:23:54,764 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 15:23:54,765 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 28 treesize of output 7 [2018-11-18 15:23:54,765 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 15:23:54,767 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 15:23:54,768 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 15:23:54,768 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:25, output treesize:7 [2018-11-18 15:23:54,786 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 15:23:54,787 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 28 [2018-11-18 15:23:54,793 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 15:23:54,793 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 28 treesize of output 7 [2018-11-18 15:23:54,794 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 15:23:54,795 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 15:23:54,799 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 15:23:54,800 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:25, output treesize:7 [2018-11-18 15:23:54,810 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 15:23:54,812 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 15:23:54,812 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 15:23:54,814 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 15:23:54,819 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 15:23:54,819 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:15, output treesize:3 [2018-11-18 15:23:54,821 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 15:23:54,844 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 15:23:54,844 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 10 [2018-11-18 15:23:54,845 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-11-18 15:23:54,845 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-18 15:23:54,845 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2018-11-18 15:23:54,845 INFO L87 Difference]: Start difference. First operand 18 states and 19 transitions. cyclomatic complexity: 2 Second operand 10 states. [2018-11-18 15:23:54,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 15:23:54,907 INFO L93 Difference]: Finished difference Result 21 states and 22 transitions. [2018-11-18 15:23:54,907 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-18 15:23:54,908 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 21 states and 22 transitions. [2018-11-18 15:23:54,908 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 19 [2018-11-18 15:23:54,909 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 21 states to 21 states and 22 transitions. [2018-11-18 15:23:54,909 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 21 [2018-11-18 15:23:54,909 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 21 [2018-11-18 15:23:54,909 INFO L73 IsDeterministic]: Start isDeterministic. Operand 21 states and 22 transitions. [2018-11-18 15:23:54,909 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-18 15:23:54,909 INFO L705 BuchiCegarLoop]: Abstraction has 21 states and 22 transitions. [2018-11-18 15:23:54,909 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states and 22 transitions. [2018-11-18 15:23:54,910 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2018-11-18 15:23:54,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2018-11-18 15:23:54,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 22 transitions. [2018-11-18 15:23:54,911 INFO L728 BuchiCegarLoop]: Abstraction has 21 states and 22 transitions. [2018-11-18 15:23:54,911 INFO L608 BuchiCegarLoop]: Abstraction has 21 states and 22 transitions. [2018-11-18 15:23:54,911 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2018-11-18 15:23:54,911 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 21 states and 22 transitions. [2018-11-18 15:23:54,912 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 19 [2018-11-18 15:23:54,912 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 15:23:54,912 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 15:23:54,912 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-18 15:23:54,912 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [5, 5, 4, 1, 1, 1, 1, 1] [2018-11-18 15:23:54,913 INFO L794 eck$LassoCheckResult]: Stem: 326#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 322#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~malloc3.base, main_#t~malloc3.offset, main_#t~mem6, main_#t~mem5, main_#t~mem7, main_#t~mem4, main_~x1~0.base, main_~x1~0.offset, main_~x2~0.base, main_~x2~0.offset;call main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.alloc(4);main_~x1~0.base, main_~x1~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset;call main_#t~malloc3.base, main_#t~malloc3.offset := #Ultimate.alloc(4);main_~x2~0.base, main_~x2~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset; 323#L549-4 [2018-11-18 15:23:54,913 INFO L796 eck$LassoCheckResult]: Loop: 323#L549-4 assume true; 324#L549-1 call main_#t~mem4 := read~int(main_~x1~0.base, main_~x1~0.offset, 4); 325#L549-2 assume !!(main_#t~mem4 <= 10);havoc main_#t~mem4;call write~int(10, main_~x2~0.base, main_~x2~0.offset, 4); 327#L551-4 assume true; 342#L551-1 call main_#t~mem5 := read~int(main_~x2~0.base, main_~x2~0.offset, 4); 332#L551-2 assume !!(main_#t~mem5 > 1);havoc main_#t~mem5;call main_#t~mem6 := read~int(main_~x2~0.base, main_~x2~0.offset, 4);call write~int(main_#t~mem6 - 1, main_~x2~0.base, main_~x2~0.offset, 4);havoc main_#t~mem6; 328#L551-4 assume true; 329#L551-1 call main_#t~mem5 := read~int(main_~x2~0.base, main_~x2~0.offset, 4); 331#L551-2 assume !!(main_#t~mem5 > 1);havoc main_#t~mem5;call main_#t~mem6 := read~int(main_~x2~0.base, main_~x2~0.offset, 4);call write~int(main_#t~mem6 - 1, main_~x2~0.base, main_~x2~0.offset, 4);havoc main_#t~mem6; 341#L551-4 assume true; 340#L551-1 call main_#t~mem5 := read~int(main_~x2~0.base, main_~x2~0.offset, 4); 339#L551-2 assume !!(main_#t~mem5 > 1);havoc main_#t~mem5;call main_#t~mem6 := read~int(main_~x2~0.base, main_~x2~0.offset, 4);call write~int(main_#t~mem6 - 1, main_~x2~0.base, main_~x2~0.offset, 4);havoc main_#t~mem6; 338#L551-4 assume true; 337#L551-1 call main_#t~mem5 := read~int(main_~x2~0.base, main_~x2~0.offset, 4); 336#L551-2 assume !!(main_#t~mem5 > 1);havoc main_#t~mem5;call main_#t~mem6 := read~int(main_~x2~0.base, main_~x2~0.offset, 4);call write~int(main_#t~mem6 - 1, main_~x2~0.base, main_~x2~0.offset, 4);havoc main_#t~mem6; 334#L551-4 assume true; 335#L551-1 call main_#t~mem5 := read~int(main_~x2~0.base, main_~x2~0.offset, 4); 333#L551-2 assume !(main_#t~mem5 > 1);havoc main_#t~mem5; 330#L551-5 call main_#t~mem7 := read~int(main_~x1~0.base, main_~x1~0.offset, 4);call write~int(1 + main_#t~mem7, main_~x1~0.base, main_~x1~0.offset, 4);havoc main_#t~mem7; 323#L549-4 [2018-11-18 15:23:54,913 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 15:23:54,913 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 6 times [2018-11-18 15:23:54,913 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 15:23:54,913 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 15:23:54,914 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:23:54,914 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 15:23:54,914 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:23:54,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 15:23:54,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 15:23:54,919 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 15:23:54,919 INFO L82 PathProgramCache]: Analyzing trace with hash -1006132014, now seen corresponding path program 4 times [2018-11-18 15:23:54,919 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 15:23:54,919 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 15:23:54,920 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:23:54,920 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 15:23:54,920 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:23:54,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 15:23:54,993 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 15:23:54,993 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 15:23:54,993 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_6a300b76-927b-4df7-a7d6-c354c6c7ad0f/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 15:23:55,001 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-18 15:23:55,014 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-18 15:23:55,014 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-18 15:23:55,016 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 15:23:55,021 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 15:23:55,024 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 15:23:55,024 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 15:23:55,025 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 15:23:55,026 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 15:23:55,027 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:11, output treesize:7 [2018-11-18 15:23:55,031 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 15:23:55,031 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 28 [2018-11-18 15:23:55,034 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 15:23:55,034 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 28 treesize of output 7 [2018-11-18 15:23:55,034 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 15:23:55,043 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 15:23:55,045 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 15:23:55,045 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:25, output treesize:7 [2018-11-18 15:23:55,062 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 15:23:55,062 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 28 [2018-11-18 15:23:55,065 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 15:23:55,065 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 28 treesize of output 7 [2018-11-18 15:23:55,065 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 15:23:55,067 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 15:23:55,068 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 15:23:55,068 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:25, output treesize:7 [2018-11-18 15:23:55,075 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 15:23:55,075 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 28 [2018-11-18 15:23:55,083 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 15:23:55,084 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 28 treesize of output 7 [2018-11-18 15:23:55,084 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 15:23:55,086 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 15:23:55,087 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 15:23:55,087 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:25, output treesize:7 [2018-11-18 15:23:55,095 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 15:23:55,096 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 28 [2018-11-18 15:23:55,098 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 15:23:55,099 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 28 treesize of output 7 [2018-11-18 15:23:55,099 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 15:23:55,103 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 15:23:55,119 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 15:23:55,119 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:25, output treesize:7 [2018-11-18 15:23:55,128 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 15:23:55,130 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 15:23:55,130 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 15:23:55,132 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 15:23:55,133 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 15:23:55,133 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:15, output treesize:3 [2018-11-18 15:23:55,135 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 15:23:55,158 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 15:23:55,159 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 12 [2018-11-18 15:23:55,159 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-11-18 15:23:55,159 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-18 15:23:55,159 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2018-11-18 15:23:55,160 INFO L87 Difference]: Start difference. First operand 21 states and 22 transitions. cyclomatic complexity: 2 Second operand 12 states. [2018-11-18 15:23:55,253 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 15:23:55,253 INFO L93 Difference]: Finished difference Result 24 states and 25 transitions. [2018-11-18 15:23:55,253 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-18 15:23:55,254 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 24 states and 25 transitions. [2018-11-18 15:23:55,254 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 22 [2018-11-18 15:23:55,254 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 24 states to 24 states and 25 transitions. [2018-11-18 15:23:55,254 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 24 [2018-11-18 15:23:55,254 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 24 [2018-11-18 15:23:55,254 INFO L73 IsDeterministic]: Start isDeterministic. Operand 24 states and 25 transitions. [2018-11-18 15:23:55,255 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-18 15:23:55,255 INFO L705 BuchiCegarLoop]: Abstraction has 24 states and 25 transitions. [2018-11-18 15:23:55,255 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states and 25 transitions. [2018-11-18 15:23:55,255 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2018-11-18 15:23:55,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-11-18 15:23:55,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 25 transitions. [2018-11-18 15:23:55,256 INFO L728 BuchiCegarLoop]: Abstraction has 24 states and 25 transitions. [2018-11-18 15:23:55,256 INFO L608 BuchiCegarLoop]: Abstraction has 24 states and 25 transitions. [2018-11-18 15:23:55,256 INFO L442 BuchiCegarLoop]: ======== Iteration 7============ [2018-11-18 15:23:55,256 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 24 states and 25 transitions. [2018-11-18 15:23:55,256 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 22 [2018-11-18 15:23:55,257 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 15:23:55,257 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 15:23:55,258 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-18 15:23:55,258 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [6, 6, 5, 1, 1, 1, 1, 1] [2018-11-18 15:23:55,258 INFO L794 eck$LassoCheckResult]: Stem: 453#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 446#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~malloc3.base, main_#t~malloc3.offset, main_#t~mem6, main_#t~mem5, main_#t~mem7, main_#t~mem4, main_~x1~0.base, main_~x1~0.offset, main_~x2~0.base, main_~x2~0.offset;call main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.alloc(4);main_~x1~0.base, main_~x1~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset;call main_#t~malloc3.base, main_#t~malloc3.offset := #Ultimate.alloc(4);main_~x2~0.base, main_~x2~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset; 447#L549-4 [2018-11-18 15:23:55,258 INFO L796 eck$LassoCheckResult]: Loop: 447#L549-4 assume true; 448#L549-1 call main_#t~mem4 := read~int(main_~x1~0.base, main_~x1~0.offset, 4); 449#L549-2 assume !!(main_#t~mem4 <= 10);havoc main_#t~mem4;call write~int(10, main_~x2~0.base, main_~x2~0.offset, 4); 450#L551-4 assume true; 469#L551-1 call main_#t~mem5 := read~int(main_~x2~0.base, main_~x2~0.offset, 4); 456#L551-2 assume !!(main_#t~mem5 > 1);havoc main_#t~mem5;call main_#t~mem6 := read~int(main_~x2~0.base, main_~x2~0.offset, 4);call write~int(main_#t~mem6 - 1, main_~x2~0.base, main_~x2~0.offset, 4);havoc main_#t~mem6; 451#L551-4 assume true; 452#L551-1 call main_#t~mem5 := read~int(main_~x2~0.base, main_~x2~0.offset, 4); 455#L551-2 assume !!(main_#t~mem5 > 1);havoc main_#t~mem5;call main_#t~mem6 := read~int(main_~x2~0.base, main_~x2~0.offset, 4);call write~int(main_#t~mem6 - 1, main_~x2~0.base, main_~x2~0.offset, 4);havoc main_#t~mem6; 468#L551-4 assume true; 467#L551-1 call main_#t~mem5 := read~int(main_~x2~0.base, main_~x2~0.offset, 4); 466#L551-2 assume !!(main_#t~mem5 > 1);havoc main_#t~mem5;call main_#t~mem6 := read~int(main_~x2~0.base, main_~x2~0.offset, 4);call write~int(main_#t~mem6 - 1, main_~x2~0.base, main_~x2~0.offset, 4);havoc main_#t~mem6; 465#L551-4 assume true; 464#L551-1 call main_#t~mem5 := read~int(main_~x2~0.base, main_~x2~0.offset, 4); 463#L551-2 assume !!(main_#t~mem5 > 1);havoc main_#t~mem5;call main_#t~mem6 := read~int(main_~x2~0.base, main_~x2~0.offset, 4);call write~int(main_#t~mem6 - 1, main_~x2~0.base, main_~x2~0.offset, 4);havoc main_#t~mem6; 462#L551-4 assume true; 461#L551-1 call main_#t~mem5 := read~int(main_~x2~0.base, main_~x2~0.offset, 4); 460#L551-2 assume !!(main_#t~mem5 > 1);havoc main_#t~mem5;call main_#t~mem6 := read~int(main_~x2~0.base, main_~x2~0.offset, 4);call write~int(main_#t~mem6 - 1, main_~x2~0.base, main_~x2~0.offset, 4);havoc main_#t~mem6; 458#L551-4 assume true; 459#L551-1 call main_#t~mem5 := read~int(main_~x2~0.base, main_~x2~0.offset, 4); 457#L551-2 assume !(main_#t~mem5 > 1);havoc main_#t~mem5; 454#L551-5 call main_#t~mem7 := read~int(main_~x1~0.base, main_~x1~0.offset, 4);call write~int(1 + main_#t~mem7, main_~x1~0.base, main_~x1~0.offset, 4);havoc main_#t~mem7; 447#L549-4 [2018-11-18 15:23:55,258 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 15:23:55,258 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 7 times [2018-11-18 15:23:55,258 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 15:23:55,258 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 15:23:55,259 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:23:55,259 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 15:23:55,259 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:23:55,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 15:23:55,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 15:23:55,264 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 15:23:55,264 INFO L82 PathProgramCache]: Analyzing trace with hash 899468020, now seen corresponding path program 5 times [2018-11-18 15:23:55,264 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 15:23:55,264 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 15:23:55,265 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:23:55,266 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 15:23:55,266 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:23:55,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 15:23:55,343 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 15:23:55,343 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 15:23:55,343 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_6a300b76-927b-4df7-a7d6-c354c6c7ad0f/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 15:23:55,350 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-11-18 15:23:55,364 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2018-11-18 15:23:55,364 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-18 15:23:55,365 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 15:23:55,369 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 15:23:55,371 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 15:23:55,371 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 15:23:55,373 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 15:23:55,374 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 15:23:55,374 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:11, output treesize:7 [2018-11-18 15:23:55,379 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 15:23:55,379 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 28 [2018-11-18 15:23:55,383 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 15:23:55,384 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 28 treesize of output 7 [2018-11-18 15:23:55,384 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 15:23:55,385 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 15:23:55,386 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 15:23:55,386 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:25, output treesize:7 [2018-11-18 15:23:55,396 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 15:23:55,397 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 28 [2018-11-18 15:23:55,427 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 15:23:55,428 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 28 treesize of output 7 [2018-11-18 15:23:55,428 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 15:23:55,431 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 15:23:55,433 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 15:23:55,433 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:25, output treesize:7 [2018-11-18 15:23:55,441 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 15:23:55,442 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 28 [2018-11-18 15:23:55,445 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 15:23:55,446 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 28 treesize of output 7 [2018-11-18 15:23:55,446 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 15:23:55,447 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 15:23:55,448 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 15:23:55,448 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:25, output treesize:7 [2018-11-18 15:23:55,456 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 15:23:55,457 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 28 [2018-11-18 15:23:55,465 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 15:23:55,466 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 28 treesize of output 7 [2018-11-18 15:23:55,466 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 15:23:55,468 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 15:23:55,469 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 15:23:55,470 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:25, output treesize:7 [2018-11-18 15:23:55,480 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 15:23:55,481 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 28 [2018-11-18 15:23:55,484 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 15:23:55,484 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 28 treesize of output 7 [2018-11-18 15:23:55,485 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 15:23:55,487 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 15:23:55,488 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 15:23:55,488 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:25, output treesize:7 [2018-11-18 15:23:55,496 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 15:23:55,497 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 15:23:55,497 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 15:23:55,499 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 15:23:55,500 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 15:23:55,500 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:15, output treesize:3 [2018-11-18 15:23:55,501 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 15:23:55,517 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 15:23:55,517 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 14 [2018-11-18 15:23:55,517 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-11-18 15:23:55,517 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-11-18 15:23:55,517 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=127, Unknown=0, NotChecked=0, Total=182 [2018-11-18 15:23:55,518 INFO L87 Difference]: Start difference. First operand 24 states and 25 transitions. cyclomatic complexity: 2 Second operand 14 states. [2018-11-18 15:23:55,598 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 15:23:55,598 INFO L93 Difference]: Finished difference Result 27 states and 28 transitions. [2018-11-18 15:23:55,598 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-11-18 15:23:55,598 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 27 states and 28 transitions. [2018-11-18 15:23:55,599 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 25 [2018-11-18 15:23:55,599 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 27 states to 27 states and 28 transitions. [2018-11-18 15:23:55,599 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 27 [2018-11-18 15:23:55,599 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 27 [2018-11-18 15:23:55,599 INFO L73 IsDeterministic]: Start isDeterministic. Operand 27 states and 28 transitions. [2018-11-18 15:23:55,599 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-18 15:23:55,599 INFO L705 BuchiCegarLoop]: Abstraction has 27 states and 28 transitions. [2018-11-18 15:23:55,599 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states and 28 transitions. [2018-11-18 15:23:55,600 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2018-11-18 15:23:55,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2018-11-18 15:23:55,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 28 transitions. [2018-11-18 15:23:55,601 INFO L728 BuchiCegarLoop]: Abstraction has 27 states and 28 transitions. [2018-11-18 15:23:55,601 INFO L608 BuchiCegarLoop]: Abstraction has 27 states and 28 transitions. [2018-11-18 15:23:55,601 INFO L442 BuchiCegarLoop]: ======== Iteration 8============ [2018-11-18 15:23:55,601 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 27 states and 28 transitions. [2018-11-18 15:23:55,601 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 25 [2018-11-18 15:23:55,601 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 15:23:55,601 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 15:23:55,602 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-18 15:23:55,602 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [7, 7, 6, 1, 1, 1, 1, 1] [2018-11-18 15:23:55,602 INFO L794 eck$LassoCheckResult]: Stem: 595#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 589#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~malloc3.base, main_#t~malloc3.offset, main_#t~mem6, main_#t~mem5, main_#t~mem7, main_#t~mem4, main_~x1~0.base, main_~x1~0.offset, main_~x2~0.base, main_~x2~0.offset;call main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.alloc(4);main_~x1~0.base, main_~x1~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset;call main_#t~malloc3.base, main_#t~malloc3.offset := #Ultimate.alloc(4);main_~x2~0.base, main_~x2~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset; 590#L549-4 [2018-11-18 15:23:55,602 INFO L796 eck$LassoCheckResult]: Loop: 590#L549-4 assume true; 591#L549-1 call main_#t~mem4 := read~int(main_~x1~0.base, main_~x1~0.offset, 4); 592#L549-2 assume !!(main_#t~mem4 <= 10);havoc main_#t~mem4;call write~int(10, main_~x2~0.base, main_~x2~0.offset, 4); 593#L551-4 assume true; 594#L551-1 call main_#t~mem5 := read~int(main_~x2~0.base, main_~x2~0.offset, 4); 597#L551-2 assume !!(main_#t~mem5 > 1);havoc main_#t~mem5;call main_#t~mem6 := read~int(main_~x2~0.base, main_~x2~0.offset, 4);call write~int(main_#t~mem6 - 1, main_~x2~0.base, main_~x2~0.offset, 4);havoc main_#t~mem6; 598#L551-4 assume true; 615#L551-1 call main_#t~mem5 := read~int(main_~x2~0.base, main_~x2~0.offset, 4); 614#L551-2 assume !!(main_#t~mem5 > 1);havoc main_#t~mem5;call main_#t~mem6 := read~int(main_~x2~0.base, main_~x2~0.offset, 4);call write~int(main_#t~mem6 - 1, main_~x2~0.base, main_~x2~0.offset, 4);havoc main_#t~mem6; 613#L551-4 assume true; 612#L551-1 call main_#t~mem5 := read~int(main_~x2~0.base, main_~x2~0.offset, 4); 611#L551-2 assume !!(main_#t~mem5 > 1);havoc main_#t~mem5;call main_#t~mem6 := read~int(main_~x2~0.base, main_~x2~0.offset, 4);call write~int(main_#t~mem6 - 1, main_~x2~0.base, main_~x2~0.offset, 4);havoc main_#t~mem6; 610#L551-4 assume true; 609#L551-1 call main_#t~mem5 := read~int(main_~x2~0.base, main_~x2~0.offset, 4); 608#L551-2 assume !!(main_#t~mem5 > 1);havoc main_#t~mem5;call main_#t~mem6 := read~int(main_~x2~0.base, main_~x2~0.offset, 4);call write~int(main_#t~mem6 - 1, main_~x2~0.base, main_~x2~0.offset, 4);havoc main_#t~mem6; 607#L551-4 assume true; 606#L551-1 call main_#t~mem5 := read~int(main_~x2~0.base, main_~x2~0.offset, 4); 605#L551-2 assume !!(main_#t~mem5 > 1);havoc main_#t~mem5;call main_#t~mem6 := read~int(main_~x2~0.base, main_~x2~0.offset, 4);call write~int(main_#t~mem6 - 1, main_~x2~0.base, main_~x2~0.offset, 4);havoc main_#t~mem6; 604#L551-4 assume true; 603#L551-1 call main_#t~mem5 := read~int(main_~x2~0.base, main_~x2~0.offset, 4); 602#L551-2 assume !!(main_#t~mem5 > 1);havoc main_#t~mem5;call main_#t~mem6 := read~int(main_~x2~0.base, main_~x2~0.offset, 4);call write~int(main_#t~mem6 - 1, main_~x2~0.base, main_~x2~0.offset, 4);havoc main_#t~mem6; 600#L551-4 assume true; 601#L551-1 call main_#t~mem5 := read~int(main_~x2~0.base, main_~x2~0.offset, 4); 599#L551-2 assume !(main_#t~mem5 > 1);havoc main_#t~mem5; 596#L551-5 call main_#t~mem7 := read~int(main_~x1~0.base, main_~x1~0.offset, 4);call write~int(1 + main_#t~mem7, main_~x1~0.base, main_~x1~0.offset, 4);havoc main_#t~mem7; 590#L549-4 [2018-11-18 15:23:55,602 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 15:23:55,602 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 8 times [2018-11-18 15:23:55,602 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 15:23:55,603 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 15:23:55,603 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:23:55,604 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 15:23:55,604 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:23:55,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 15:23:55,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 15:23:55,608 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 15:23:55,608 INFO L82 PathProgramCache]: Analyzing trace with hash -247637614, now seen corresponding path program 6 times [2018-11-18 15:23:55,608 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 15:23:55,608 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 15:23:55,609 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:23:55,609 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 15:23:55,609 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:23:55,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 15:23:55,688 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 0 proven. 63 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 15:23:55,689 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 15:23:55,689 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_6a300b76-927b-4df7-a7d6-c354c6c7ad0f/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 15:23:55,701 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-11-18 15:23:55,746 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2018-11-18 15:23:55,746 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-18 15:23:55,748 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 15:23:55,753 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 15:23:55,755 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 15:23:55,755 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 15:23:55,756 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 15:23:55,758 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 15:23:55,758 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:11, output treesize:7 [2018-11-18 15:23:55,761 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 15:23:55,762 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 28 [2018-11-18 15:23:55,763 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 15:23:55,764 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 28 treesize of output 7 [2018-11-18 15:23:55,764 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 15:23:55,775 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 15:23:55,776 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 15:23:55,776 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:25, output treesize:7 [2018-11-18 15:23:55,781 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 15:23:55,782 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 28 [2018-11-18 15:23:55,784 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 15:23:55,784 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 28 treesize of output 7 [2018-11-18 15:23:55,784 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 15:23:55,786 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 15:23:55,786 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 15:23:55,787 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:25, output treesize:7 [2018-11-18 15:23:55,793 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 15:23:55,794 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 28 [2018-11-18 15:23:55,796 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 15:23:55,796 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 28 treesize of output 7 [2018-11-18 15:23:55,796 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 15:23:55,797 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 15:23:55,799 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 15:23:55,799 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:25, output treesize:7 [2018-11-18 15:23:55,805 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 15:23:55,806 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 28 [2018-11-18 15:23:55,807 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 15:23:55,808 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 28 treesize of output 7 [2018-11-18 15:23:55,808 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 15:23:55,809 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 15:23:55,810 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 15:23:55,810 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:25, output treesize:7 [2018-11-18 15:23:55,817 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 15:23:55,818 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 28 [2018-11-18 15:23:55,819 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 15:23:55,820 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 28 treesize of output 7 [2018-11-18 15:23:55,820 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 15:23:55,821 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 15:23:55,822 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 15:23:55,822 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:25, output treesize:7 [2018-11-18 15:23:55,838 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 15:23:55,838 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 28 [2018-11-18 15:23:55,841 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 15:23:55,842 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 28 treesize of output 7 [2018-11-18 15:23:55,842 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 15:23:55,848 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 15:23:55,850 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 15:23:55,850 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:25, output treesize:7 [2018-11-18 15:23:55,862 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 15:23:55,864 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 15:23:55,864 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 15:23:55,865 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 15:23:55,866 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 15:23:55,866 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:15, output treesize:3 [2018-11-18 15:23:55,867 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 0 proven. 63 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 15:23:55,883 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 15:23:55,883 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 16 [2018-11-18 15:23:55,883 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-11-18 15:23:55,883 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-11-18 15:23:55,883 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=169, Unknown=0, NotChecked=0, Total=240 [2018-11-18 15:23:55,883 INFO L87 Difference]: Start difference. First operand 27 states and 28 transitions. cyclomatic complexity: 2 Second operand 16 states. [2018-11-18 15:23:55,991 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 15:23:55,991 INFO L93 Difference]: Finished difference Result 30 states and 31 transitions. [2018-11-18 15:23:55,991 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-11-18 15:23:55,991 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 30 states and 31 transitions. [2018-11-18 15:23:55,991 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 28 [2018-11-18 15:23:55,992 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 30 states to 30 states and 31 transitions. [2018-11-18 15:23:55,992 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 30 [2018-11-18 15:23:55,992 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 30 [2018-11-18 15:23:55,992 INFO L73 IsDeterministic]: Start isDeterministic. Operand 30 states and 31 transitions. [2018-11-18 15:23:55,992 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-18 15:23:55,992 INFO L705 BuchiCegarLoop]: Abstraction has 30 states and 31 transitions. [2018-11-18 15:23:55,992 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states and 31 transitions. [2018-11-18 15:23:55,994 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2018-11-18 15:23:55,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-11-18 15:23:55,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 31 transitions. [2018-11-18 15:23:55,994 INFO L728 BuchiCegarLoop]: Abstraction has 30 states and 31 transitions. [2018-11-18 15:23:55,994 INFO L608 BuchiCegarLoop]: Abstraction has 30 states and 31 transitions. [2018-11-18 15:23:55,994 INFO L442 BuchiCegarLoop]: ======== Iteration 9============ [2018-11-18 15:23:55,994 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 30 states and 31 transitions. [2018-11-18 15:23:55,995 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 28 [2018-11-18 15:23:55,995 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 15:23:55,995 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 15:23:55,995 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-18 15:23:55,995 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [8, 8, 7, 1, 1, 1, 1, 1] [2018-11-18 15:23:55,995 INFO L794 eck$LassoCheckResult]: Stem: 755#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 751#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~malloc3.base, main_#t~malloc3.offset, main_#t~mem6, main_#t~mem5, main_#t~mem7, main_#t~mem4, main_~x1~0.base, main_~x1~0.offset, main_~x2~0.base, main_~x2~0.offset;call main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.alloc(4);main_~x1~0.base, main_~x1~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset;call main_#t~malloc3.base, main_#t~malloc3.offset := #Ultimate.alloc(4);main_~x2~0.base, main_~x2~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset; 752#L549-4 [2018-11-18 15:23:55,996 INFO L796 eck$LassoCheckResult]: Loop: 752#L549-4 assume true; 753#L549-1 call main_#t~mem4 := read~int(main_~x1~0.base, main_~x1~0.offset, 4); 754#L549-2 assume !!(main_#t~mem4 <= 10);havoc main_#t~mem4;call write~int(10, main_~x2~0.base, main_~x2~0.offset, 4); 756#L551-4 assume true; 780#L551-1 call main_#t~mem5 := read~int(main_~x2~0.base, main_~x2~0.offset, 4); 761#L551-2 assume !!(main_#t~mem5 > 1);havoc main_#t~mem5;call main_#t~mem6 := read~int(main_~x2~0.base, main_~x2~0.offset, 4);call write~int(main_#t~mem6 - 1, main_~x2~0.base, main_~x2~0.offset, 4);havoc main_#t~mem6; 757#L551-4 assume true; 758#L551-1 call main_#t~mem5 := read~int(main_~x2~0.base, main_~x2~0.offset, 4); 760#L551-2 assume !!(main_#t~mem5 > 1);havoc main_#t~mem5;call main_#t~mem6 := read~int(main_~x2~0.base, main_~x2~0.offset, 4);call write~int(main_#t~mem6 - 1, main_~x2~0.base, main_~x2~0.offset, 4);havoc main_#t~mem6; 779#L551-4 assume true; 778#L551-1 call main_#t~mem5 := read~int(main_~x2~0.base, main_~x2~0.offset, 4); 777#L551-2 assume !!(main_#t~mem5 > 1);havoc main_#t~mem5;call main_#t~mem6 := read~int(main_~x2~0.base, main_~x2~0.offset, 4);call write~int(main_#t~mem6 - 1, main_~x2~0.base, main_~x2~0.offset, 4);havoc main_#t~mem6; 776#L551-4 assume true; 775#L551-1 call main_#t~mem5 := read~int(main_~x2~0.base, main_~x2~0.offset, 4); 774#L551-2 assume !!(main_#t~mem5 > 1);havoc main_#t~mem5;call main_#t~mem6 := read~int(main_~x2~0.base, main_~x2~0.offset, 4);call write~int(main_#t~mem6 - 1, main_~x2~0.base, main_~x2~0.offset, 4);havoc main_#t~mem6; 773#L551-4 assume true; 772#L551-1 call main_#t~mem5 := read~int(main_~x2~0.base, main_~x2~0.offset, 4); 771#L551-2 assume !!(main_#t~mem5 > 1);havoc main_#t~mem5;call main_#t~mem6 := read~int(main_~x2~0.base, main_~x2~0.offset, 4);call write~int(main_#t~mem6 - 1, main_~x2~0.base, main_~x2~0.offset, 4);havoc main_#t~mem6; 770#L551-4 assume true; 769#L551-1 call main_#t~mem5 := read~int(main_~x2~0.base, main_~x2~0.offset, 4); 768#L551-2 assume !!(main_#t~mem5 > 1);havoc main_#t~mem5;call main_#t~mem6 := read~int(main_~x2~0.base, main_~x2~0.offset, 4);call write~int(main_#t~mem6 - 1, main_~x2~0.base, main_~x2~0.offset, 4);havoc main_#t~mem6; 767#L551-4 assume true; 766#L551-1 call main_#t~mem5 := read~int(main_~x2~0.base, main_~x2~0.offset, 4); 765#L551-2 assume !!(main_#t~mem5 > 1);havoc main_#t~mem5;call main_#t~mem6 := read~int(main_~x2~0.base, main_~x2~0.offset, 4);call write~int(main_#t~mem6 - 1, main_~x2~0.base, main_~x2~0.offset, 4);havoc main_#t~mem6; 763#L551-4 assume true; 764#L551-1 call main_#t~mem5 := read~int(main_~x2~0.base, main_~x2~0.offset, 4); 762#L551-2 assume !(main_#t~mem5 > 1);havoc main_#t~mem5; 759#L551-5 call main_#t~mem7 := read~int(main_~x1~0.base, main_~x1~0.offset, 4);call write~int(1 + main_#t~mem7, main_~x1~0.base, main_~x1~0.offset, 4);havoc main_#t~mem7; 752#L549-4 [2018-11-18 15:23:55,996 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 15:23:55,996 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 9 times [2018-11-18 15:23:55,996 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 15:23:55,996 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 15:23:55,997 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:23:55,997 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 15:23:55,997 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:23:55,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 15:23:56,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 15:23:56,005 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 15:23:56,005 INFO L82 PathProgramCache]: Analyzing trace with hash 1383194164, now seen corresponding path program 7 times [2018-11-18 15:23:56,005 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 15:23:56,005 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 15:23:56,006 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:23:56,006 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 15:23:56,006 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:23:56,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 15:23:56,104 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 84 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 15:23:56,104 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 15:23:56,105 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_6a300b76-927b-4df7-a7d6-c354c6c7ad0f/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 15:23:56,113 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 15:23:56,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 15:23:56,123 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 15:23:56,126 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 15:23:56,127 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 15:23:56,128 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 15:23:56,131 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 15:23:56,132 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 15:23:56,132 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:11, output treesize:7 [2018-11-18 15:23:56,138 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 15:23:56,139 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 28 [2018-11-18 15:23:56,141 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 15:23:56,142 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 28 treesize of output 7 [2018-11-18 15:23:56,142 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 15:23:56,143 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 15:23:56,144 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 15:23:56,144 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:25, output treesize:7 [2018-11-18 15:23:56,150 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 15:23:56,151 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 28 [2018-11-18 15:23:56,153 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 15:23:56,154 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 28 treesize of output 7 [2018-11-18 15:23:56,154 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 15:23:56,155 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 15:23:56,156 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 15:23:56,156 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:25, output treesize:7 [2018-11-18 15:23:56,176 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 15:23:56,176 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 28 [2018-11-18 15:23:56,179 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 15:23:56,180 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 28 treesize of output 7 [2018-11-18 15:23:56,180 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 15:23:56,183 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 15:23:56,185 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 15:23:56,185 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:25, output treesize:7 [2018-11-18 15:23:56,192 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 15:23:56,193 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 28 [2018-11-18 15:23:56,195 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 15:23:56,196 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 28 treesize of output 7 [2018-11-18 15:23:56,196 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 15:23:56,198 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 15:23:56,199 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 15:23:56,199 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:25, output treesize:7 [2018-11-18 15:23:56,212 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 15:23:56,212 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 28 [2018-11-18 15:23:56,215 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 15:23:56,216 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 28 treesize of output 7 [2018-11-18 15:23:56,216 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 15:23:56,218 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 15:23:56,219 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 15:23:56,219 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:25, output treesize:7 [2018-11-18 15:23:56,228 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 15:23:56,229 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 28 [2018-11-18 15:23:56,231 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 15:23:56,232 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 28 treesize of output 7 [2018-11-18 15:23:56,232 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 15:23:56,234 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 15:23:56,235 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 15:23:56,235 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:25, output treesize:7 [2018-11-18 15:23:56,245 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 15:23:56,245 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 28 [2018-11-18 15:23:56,248 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 15:23:56,249 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 28 treesize of output 7 [2018-11-18 15:23:56,249 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 15:23:56,255 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 15:23:56,263 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 15:23:56,263 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:25, output treesize:7 [2018-11-18 15:23:56,279 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 15:23:56,281 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 15:23:56,281 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 15:23:56,282 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 15:23:56,283 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 15:23:56,284 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:15, output treesize:3 [2018-11-18 15:23:56,285 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 84 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 15:23:56,308 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 15:23:56,308 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 18 [2018-11-18 15:23:56,308 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-11-18 15:23:56,309 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-11-18 15:23:56,309 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=217, Unknown=0, NotChecked=0, Total=306 [2018-11-18 15:23:56,309 INFO L87 Difference]: Start difference. First operand 30 states and 31 transitions. cyclomatic complexity: 2 Second operand 18 states. [2018-11-18 15:23:56,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 15:23:56,529 INFO L93 Difference]: Finished difference Result 33 states and 34 transitions. [2018-11-18 15:23:56,530 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-11-18 15:23:56,530 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 33 states and 34 transitions. [2018-11-18 15:23:56,530 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 31 [2018-11-18 15:23:56,531 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 33 states to 33 states and 34 transitions. [2018-11-18 15:23:56,531 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 33 [2018-11-18 15:23:56,531 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 33 [2018-11-18 15:23:56,531 INFO L73 IsDeterministic]: Start isDeterministic. Operand 33 states and 34 transitions. [2018-11-18 15:23:56,531 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-18 15:23:56,531 INFO L705 BuchiCegarLoop]: Abstraction has 33 states and 34 transitions. [2018-11-18 15:23:56,532 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states and 34 transitions. [2018-11-18 15:23:56,533 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2018-11-18 15:23:56,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2018-11-18 15:23:56,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 34 transitions. [2018-11-18 15:23:56,533 INFO L728 BuchiCegarLoop]: Abstraction has 33 states and 34 transitions. [2018-11-18 15:23:56,533 INFO L608 BuchiCegarLoop]: Abstraction has 33 states and 34 transitions. [2018-11-18 15:23:56,534 INFO L442 BuchiCegarLoop]: ======== Iteration 10============ [2018-11-18 15:23:56,534 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 33 states and 34 transitions. [2018-11-18 15:23:56,534 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 31 [2018-11-18 15:23:56,534 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 15:23:56,534 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 15:23:56,535 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-18 15:23:56,535 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [9, 9, 8, 1, 1, 1, 1, 1] [2018-11-18 15:23:56,535 INFO L794 eck$LassoCheckResult]: Stem: 938#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 932#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~malloc3.base, main_#t~malloc3.offset, main_#t~mem6, main_#t~mem5, main_#t~mem7, main_#t~mem4, main_~x1~0.base, main_~x1~0.offset, main_~x2~0.base, main_~x2~0.offset;call main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.alloc(4);main_~x1~0.base, main_~x1~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset;call main_#t~malloc3.base, main_#t~malloc3.offset := #Ultimate.alloc(4);main_~x2~0.base, main_~x2~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset; 933#L549-4 [2018-11-18 15:23:56,535 INFO L796 eck$LassoCheckResult]: Loop: 933#L549-4 assume true; 934#L549-1 call main_#t~mem4 := read~int(main_~x1~0.base, main_~x1~0.offset, 4); 935#L549-2 assume !!(main_#t~mem4 <= 10);havoc main_#t~mem4;call write~int(10, main_~x2~0.base, main_~x2~0.offset, 4); 936#L551-4 assume true; 937#L551-1 call main_#t~mem5 := read~int(main_~x2~0.base, main_~x2~0.offset, 4); 940#L551-2 assume !!(main_#t~mem5 > 1);havoc main_#t~mem5;call main_#t~mem6 := read~int(main_~x2~0.base, main_~x2~0.offset, 4);call write~int(main_#t~mem6 - 1, main_~x2~0.base, main_~x2~0.offset, 4);havoc main_#t~mem6; 941#L551-4 assume true; 964#L551-1 call main_#t~mem5 := read~int(main_~x2~0.base, main_~x2~0.offset, 4); 963#L551-2 assume !!(main_#t~mem5 > 1);havoc main_#t~mem5;call main_#t~mem6 := read~int(main_~x2~0.base, main_~x2~0.offset, 4);call write~int(main_#t~mem6 - 1, main_~x2~0.base, main_~x2~0.offset, 4);havoc main_#t~mem6; 962#L551-4 assume true; 961#L551-1 call main_#t~mem5 := read~int(main_~x2~0.base, main_~x2~0.offset, 4); 960#L551-2 assume !!(main_#t~mem5 > 1);havoc main_#t~mem5;call main_#t~mem6 := read~int(main_~x2~0.base, main_~x2~0.offset, 4);call write~int(main_#t~mem6 - 1, main_~x2~0.base, main_~x2~0.offset, 4);havoc main_#t~mem6; 959#L551-4 assume true; 958#L551-1 call main_#t~mem5 := read~int(main_~x2~0.base, main_~x2~0.offset, 4); 957#L551-2 assume !!(main_#t~mem5 > 1);havoc main_#t~mem5;call main_#t~mem6 := read~int(main_~x2~0.base, main_~x2~0.offset, 4);call write~int(main_#t~mem6 - 1, main_~x2~0.base, main_~x2~0.offset, 4);havoc main_#t~mem6; 956#L551-4 assume true; 955#L551-1 call main_#t~mem5 := read~int(main_~x2~0.base, main_~x2~0.offset, 4); 954#L551-2 assume !!(main_#t~mem5 > 1);havoc main_#t~mem5;call main_#t~mem6 := read~int(main_~x2~0.base, main_~x2~0.offset, 4);call write~int(main_#t~mem6 - 1, main_~x2~0.base, main_~x2~0.offset, 4);havoc main_#t~mem6; 953#L551-4 assume true; 952#L551-1 call main_#t~mem5 := read~int(main_~x2~0.base, main_~x2~0.offset, 4); 951#L551-2 assume !!(main_#t~mem5 > 1);havoc main_#t~mem5;call main_#t~mem6 := read~int(main_~x2~0.base, main_~x2~0.offset, 4);call write~int(main_#t~mem6 - 1, main_~x2~0.base, main_~x2~0.offset, 4);havoc main_#t~mem6; 950#L551-4 assume true; 949#L551-1 call main_#t~mem5 := read~int(main_~x2~0.base, main_~x2~0.offset, 4); 948#L551-2 assume !!(main_#t~mem5 > 1);havoc main_#t~mem5;call main_#t~mem6 := read~int(main_~x2~0.base, main_~x2~0.offset, 4);call write~int(main_#t~mem6 - 1, main_~x2~0.base, main_~x2~0.offset, 4);havoc main_#t~mem6; 947#L551-4 assume true; 946#L551-1 call main_#t~mem5 := read~int(main_~x2~0.base, main_~x2~0.offset, 4); 945#L551-2 assume !!(main_#t~mem5 > 1);havoc main_#t~mem5;call main_#t~mem6 := read~int(main_~x2~0.base, main_~x2~0.offset, 4);call write~int(main_#t~mem6 - 1, main_~x2~0.base, main_~x2~0.offset, 4);havoc main_#t~mem6; 943#L551-4 assume true; 944#L551-1 call main_#t~mem5 := read~int(main_~x2~0.base, main_~x2~0.offset, 4); 942#L551-2 assume !(main_#t~mem5 > 1);havoc main_#t~mem5; 939#L551-5 call main_#t~mem7 := read~int(main_~x1~0.base, main_~x1~0.offset, 4);call write~int(1 + main_#t~mem7, main_~x1~0.base, main_~x1~0.offset, 4);havoc main_#t~mem7; 933#L549-4 [2018-11-18 15:23:56,535 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 15:23:56,535 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 10 times [2018-11-18 15:23:56,535 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 15:23:56,535 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 15:23:56,536 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:23:56,536 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 15:23:56,536 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:23:56,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 15:23:56,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 15:23:56,543 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 15:23:56,543 INFO L82 PathProgramCache]: Analyzing trace with hash 822640210, now seen corresponding path program 8 times [2018-11-18 15:23:56,543 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 15:23:56,543 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 15:23:56,544 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:23:56,544 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 15:23:56,544 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:23:56,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 15:23:56,641 INFO L134 CoverageAnalysis]: Checked inductivity of 108 backedges. 0 proven. 108 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 15:23:56,641 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 15:23:56,641 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_6a300b76-927b-4df7-a7d6-c354c6c7ad0f/bin-2019/uautomizer/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-18 15:23:56,654 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-18 15:23:56,665 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-18 15:23:56,665 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-18 15:23:56,667 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 15:23:56,671 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 15:23:56,674 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 15:23:56,675 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 15:23:56,680 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 15:23:56,681 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 15:23:56,681 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:11, output treesize:7 [2018-11-18 15:23:56,686 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 15:23:56,688 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 28 [2018-11-18 15:23:56,690 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 15:23:56,691 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 28 treesize of output 7 [2018-11-18 15:23:56,691 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 15:23:56,692 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 15:23:56,693 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 15:23:56,694 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:25, output treesize:7 [2018-11-18 15:23:56,704 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 15:23:56,705 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 28 [2018-11-18 15:23:56,707 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 15:23:56,708 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 28 treesize of output 7 [2018-11-18 15:23:56,708 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 15:23:56,709 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 15:23:56,710 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 15:23:56,710 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:25, output treesize:7 [2018-11-18 15:23:56,716 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 15:23:56,717 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 28 [2018-11-18 15:23:56,718 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 15:23:56,719 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 28 treesize of output 7 [2018-11-18 15:23:56,719 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 15:23:56,721 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 15:23:56,722 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 15:23:56,722 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:25, output treesize:7 [2018-11-18 15:23:56,728 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 15:23:56,728 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 28 [2018-11-18 15:23:56,730 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 15:23:56,730 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 28 treesize of output 7 [2018-11-18 15:23:56,731 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 15:23:56,732 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 15:23:56,732 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 15:23:56,733 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:25, output treesize:7 [2018-11-18 15:23:56,745 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 15:23:56,746 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 28 [2018-11-18 15:23:56,748 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 15:23:56,748 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 28 treesize of output 7 [2018-11-18 15:23:56,748 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 15:23:56,752 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 15:23:56,754 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 15:23:56,754 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:25, output treesize:7 [2018-11-18 15:23:56,765 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 15:23:56,766 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 28 [2018-11-18 15:23:56,767 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 15:23:56,768 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 28 treesize of output 7 [2018-11-18 15:23:56,768 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 15:23:56,775 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 15:23:56,777 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 15:23:56,777 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:25, output treesize:7 [2018-11-18 15:23:56,785 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 15:23:56,786 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 28 [2018-11-18 15:23:56,788 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 15:23:56,788 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 28 treesize of output 7 [2018-11-18 15:23:56,789 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 15:23:56,790 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 15:23:56,791 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 15:23:56,791 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:25, output treesize:7 [2018-11-18 15:23:56,800 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 15:23:56,801 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 28 [2018-11-18 15:23:56,803 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 15:23:56,804 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 28 treesize of output 7 [2018-11-18 15:23:56,804 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 15:23:56,805 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 15:23:56,807 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 15:23:56,807 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:25, output treesize:7 [2018-11-18 15:23:56,817 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 15:23:56,819 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 15:23:56,820 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 15:23:56,821 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 15:23:56,822 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 15:23:56,823 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:15, output treesize:3 [2018-11-18 15:23:56,824 INFO L134 CoverageAnalysis]: Checked inductivity of 108 backedges. 0 proven. 108 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 15:23:56,840 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 15:23:56,840 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 20 [2018-11-18 15:23:56,841 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-11-18 15:23:56,841 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-11-18 15:23:56,841 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=109, Invalid=271, Unknown=0, NotChecked=0, Total=380 [2018-11-18 15:23:56,841 INFO L87 Difference]: Start difference. First operand 33 states and 34 transitions. cyclomatic complexity: 2 Second operand 20 states. [2018-11-18 15:23:57,014 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 15:23:57,014 INFO L93 Difference]: Finished difference Result 36 states and 37 transitions. [2018-11-18 15:23:57,014 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-11-18 15:23:57,015 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 36 states and 37 transitions. [2018-11-18 15:23:57,015 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 34 [2018-11-18 15:23:57,015 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 36 states to 36 states and 37 transitions. [2018-11-18 15:23:57,016 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 36 [2018-11-18 15:23:57,016 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 36 [2018-11-18 15:23:57,016 INFO L73 IsDeterministic]: Start isDeterministic. Operand 36 states and 37 transitions. [2018-11-18 15:23:57,016 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-18 15:23:57,016 INFO L705 BuchiCegarLoop]: Abstraction has 36 states and 37 transitions. [2018-11-18 15:23:57,016 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states and 37 transitions. [2018-11-18 15:23:57,017 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2018-11-18 15:23:57,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2018-11-18 15:23:57,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 37 transitions. [2018-11-18 15:23:57,018 INFO L728 BuchiCegarLoop]: Abstraction has 36 states and 37 transitions. [2018-11-18 15:23:57,018 INFO L608 BuchiCegarLoop]: Abstraction has 36 states and 37 transitions. [2018-11-18 15:23:57,018 INFO L442 BuchiCegarLoop]: ======== Iteration 11============ [2018-11-18 15:23:57,018 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 36 states and 37 transitions. [2018-11-18 15:23:57,019 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 34 [2018-11-18 15:23:57,019 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 15:23:57,019 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 15:23:57,019 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-18 15:23:57,019 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [10, 10, 9, 1, 1, 1, 1, 1] [2018-11-18 15:23:57,019 INFO L794 eck$LassoCheckResult]: Stem: 1138#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 1132#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~malloc3.base, main_#t~malloc3.offset, main_#t~mem6, main_#t~mem5, main_#t~mem7, main_#t~mem4, main_~x1~0.base, main_~x1~0.offset, main_~x2~0.base, main_~x2~0.offset;call main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.alloc(4);main_~x1~0.base, main_~x1~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset;call main_#t~malloc3.base, main_#t~malloc3.offset := #Ultimate.alloc(4);main_~x2~0.base, main_~x2~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset; 1133#L549-4 [2018-11-18 15:23:57,019 INFO L796 eck$LassoCheckResult]: Loop: 1133#L549-4 assume true; 1134#L549-1 call main_#t~mem4 := read~int(main_~x1~0.base, main_~x1~0.offset, 4); 1135#L549-2 assume !!(main_#t~mem4 <= 10);havoc main_#t~mem4;call write~int(10, main_~x2~0.base, main_~x2~0.offset, 4); 1136#L551-4 assume true; 1137#L551-1 call main_#t~mem5 := read~int(main_~x2~0.base, main_~x2~0.offset, 4); 1140#L551-2 assume !!(main_#t~mem5 > 1);havoc main_#t~mem5;call main_#t~mem6 := read~int(main_~x2~0.base, main_~x2~0.offset, 4);call write~int(main_#t~mem6 - 1, main_~x2~0.base, main_~x2~0.offset, 4);havoc main_#t~mem6; 1141#L551-4 assume true; 1167#L551-1 call main_#t~mem5 := read~int(main_~x2~0.base, main_~x2~0.offset, 4); 1166#L551-2 assume !!(main_#t~mem5 > 1);havoc main_#t~mem5;call main_#t~mem6 := read~int(main_~x2~0.base, main_~x2~0.offset, 4);call write~int(main_#t~mem6 - 1, main_~x2~0.base, main_~x2~0.offset, 4);havoc main_#t~mem6; 1165#L551-4 assume true; 1164#L551-1 call main_#t~mem5 := read~int(main_~x2~0.base, main_~x2~0.offset, 4); 1163#L551-2 assume !!(main_#t~mem5 > 1);havoc main_#t~mem5;call main_#t~mem6 := read~int(main_~x2~0.base, main_~x2~0.offset, 4);call write~int(main_#t~mem6 - 1, main_~x2~0.base, main_~x2~0.offset, 4);havoc main_#t~mem6; 1162#L551-4 assume true; 1161#L551-1 call main_#t~mem5 := read~int(main_~x2~0.base, main_~x2~0.offset, 4); 1160#L551-2 assume !!(main_#t~mem5 > 1);havoc main_#t~mem5;call main_#t~mem6 := read~int(main_~x2~0.base, main_~x2~0.offset, 4);call write~int(main_#t~mem6 - 1, main_~x2~0.base, main_~x2~0.offset, 4);havoc main_#t~mem6; 1159#L551-4 assume true; 1158#L551-1 call main_#t~mem5 := read~int(main_~x2~0.base, main_~x2~0.offset, 4); 1157#L551-2 assume !!(main_#t~mem5 > 1);havoc main_#t~mem5;call main_#t~mem6 := read~int(main_~x2~0.base, main_~x2~0.offset, 4);call write~int(main_#t~mem6 - 1, main_~x2~0.base, main_~x2~0.offset, 4);havoc main_#t~mem6; 1156#L551-4 assume true; 1155#L551-1 call main_#t~mem5 := read~int(main_~x2~0.base, main_~x2~0.offset, 4); 1154#L551-2 assume !!(main_#t~mem5 > 1);havoc main_#t~mem5;call main_#t~mem6 := read~int(main_~x2~0.base, main_~x2~0.offset, 4);call write~int(main_#t~mem6 - 1, main_~x2~0.base, main_~x2~0.offset, 4);havoc main_#t~mem6; 1153#L551-4 assume true; 1152#L551-1 call main_#t~mem5 := read~int(main_~x2~0.base, main_~x2~0.offset, 4); 1151#L551-2 assume !!(main_#t~mem5 > 1);havoc main_#t~mem5;call main_#t~mem6 := read~int(main_~x2~0.base, main_~x2~0.offset, 4);call write~int(main_#t~mem6 - 1, main_~x2~0.base, main_~x2~0.offset, 4);havoc main_#t~mem6; 1150#L551-4 assume true; 1149#L551-1 call main_#t~mem5 := read~int(main_~x2~0.base, main_~x2~0.offset, 4); 1148#L551-2 assume !!(main_#t~mem5 > 1);havoc main_#t~mem5;call main_#t~mem6 := read~int(main_~x2~0.base, main_~x2~0.offset, 4);call write~int(main_#t~mem6 - 1, main_~x2~0.base, main_~x2~0.offset, 4);havoc main_#t~mem6; 1147#L551-4 assume true; 1146#L551-1 call main_#t~mem5 := read~int(main_~x2~0.base, main_~x2~0.offset, 4); 1145#L551-2 assume !!(main_#t~mem5 > 1);havoc main_#t~mem5;call main_#t~mem6 := read~int(main_~x2~0.base, main_~x2~0.offset, 4);call write~int(main_#t~mem6 - 1, main_~x2~0.base, main_~x2~0.offset, 4);havoc main_#t~mem6; 1143#L551-4 assume true; 1144#L551-1 call main_#t~mem5 := read~int(main_~x2~0.base, main_~x2~0.offset, 4); 1142#L551-2 assume !(main_#t~mem5 > 1);havoc main_#t~mem5; 1139#L551-5 call main_#t~mem7 := read~int(main_~x1~0.base, main_~x1~0.offset, 4);call write~int(1 + main_#t~mem7, main_~x1~0.base, main_~x1~0.offset, 4);havoc main_#t~mem7; 1133#L549-4 [2018-11-18 15:23:57,020 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 15:23:57,020 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 11 times [2018-11-18 15:23:57,020 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 15:23:57,020 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 15:23:57,020 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:23:57,021 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 15:23:57,021 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:23:57,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 15:23:57,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 15:23:57,024 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 15:23:57,024 INFO L82 PathProgramCache]: Analyzing trace with hash 192643444, now seen corresponding path program 9 times [2018-11-18 15:23:57,024 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 15:23:57,024 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 15:23:57,025 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:23:57,025 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 15:23:57,025 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:23:57,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 15:23:57,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 15:23:57,054 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 15:23:57,055 INFO L82 PathProgramCache]: Analyzing trace with hash -2047077194, now seen corresponding path program 1 times [2018-11-18 15:23:57,055 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 15:23:57,055 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 15:23:57,056 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:23:57,056 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 15:23:57,056 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:23:57,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 15:23:57,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 15:23:58,451 WARN L180 SmtUtils]: Spent 1.36 s on a formula simplification. DAG size of input: 138 DAG size of output: 127 [2018-11-18 15:23:58,506 INFO L216 LassoAnalysis]: Preferences: [2018-11-18 15:23:58,507 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-18 15:23:58,507 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-18 15:23:58,507 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-18 15:23:58,507 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-18 15:23:58,507 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 15:23:58,507 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-18 15:23:58,507 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-18 15:23:58,507 INFO L131 ssoRankerPreferences]: Filename of dumped script: Urban-2013WST-Fig2-alloca_true-termination.c.i_Iteration11_Lasso [2018-11-18 15:23:58,507 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-18 15:23:58,508 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-18 15:23:58,519 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 15:23:58,527 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 15:23:58,528 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 15:23:58,530 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 15:23:58,531 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 15:23:58,532 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 15:23:58,535 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 15:23:58,539 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 15:23:58,541 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 15:23:58,543 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 15:23:58,627 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 15:23:58,793 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-18 15:23:58,797 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-18 15:23:58,798 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 15:23:58,800 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 15:23:58,800 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 15:23:58,800 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 15:23:58,800 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 15:23:58,800 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 15:23:58,802 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 15:23:58,802 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 15:23:58,804 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 15:23:58,804 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 15:23:58,805 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 15:23:58,805 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 15:23:58,805 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 15:23:58,805 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 15:23:58,805 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 15:23:58,806 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 15:23:58,806 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 15:23:58,806 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 15:23:58,807 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 15:23:58,807 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 15:23:58,807 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 15:23:58,808 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 15:23:58,808 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 15:23:58,809 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 15:23:58,810 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 15:23:58,811 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 15:23:58,812 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 15:23:58,812 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 15:23:58,812 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 15:23:58,812 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 15:23:58,813 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 15:23:58,813 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 15:23:58,813 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 15:23:58,813 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 15:23:58,814 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 15:23:58,814 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 15:23:58,814 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 15:23:58,814 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 15:23:58,814 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 15:23:58,823 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 15:23:58,823 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 15:23:58,823 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 15:23:58,823 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 15:23:58,826 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 15:23:58,826 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 15:23:58,827 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 15:23:58,827 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 15:23:58,827 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 15:23:58,827 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 15:23:58,828 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 15:23:58,828 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 15:23:58,830 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 15:23:58,830 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 15:23:58,831 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 15:23:58,831 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 15:23:58,831 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 15:23:58,831 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 15:23:58,831 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 15:23:58,831 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 15:23:58,831 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 15:23:58,832 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 15:23:58,832 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 15:23:58,832 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 15:23:58,833 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 15:23:58,833 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 15:23:58,833 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 15:23:58,834 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 15:23:58,834 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 15:23:58,836 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 15:23:58,836 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 15:23:58,837 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 15:23:58,837 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 15:23:58,837 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 15:23:58,837 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 15:23:58,838 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 15:23:58,838 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 15:23:58,840 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 15:23:58,840 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 15:23:58,840 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 15:23:58,841 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 15:23:58,841 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 15:23:58,841 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 15:23:58,842 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 15:23:58,842 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 15:23:58,847 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 15:23:58,848 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 15:23:58,848 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 15:23:58,848 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 15:23:58,848 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 15:23:58,848 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 15:23:58,850 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 15:23:58,850 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 15:23:58,854 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 15:23:58,854 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 15:23:58,854 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 15:23:58,854 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-18 15:23:58,855 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 15:23:58,855 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 15:23:58,856 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-18 15:23:58,856 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 15:23:58,859 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 15:23:58,860 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 15:23:58,860 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 15:23:58,860 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 15:23:58,860 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 15:23:58,860 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 15:23:58,861 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 15:23:58,861 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 15:23:58,862 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 15:23:58,863 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 15:23:58,863 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 15:23:58,863 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 15:23:58,863 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 15:23:58,863 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 15:23:58,864 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 15:23:58,864 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 15:23:58,864 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 15:23:58,865 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 15:23:58,865 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 15:23:58,865 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 15:23:58,866 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 15:23:58,866 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 15:23:58,866 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 15:23:58,866 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 15:23:58,866 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 15:23:58,866 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 15:23:58,868 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-18 15:23:58,871 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-18 15:23:58,872 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2018-11-18 15:23:58,873 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-18 15:23:58,873 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-11-18 15:23:58,874 INFO L518 LassoAnalysis]: Proved termination. [2018-11-18 15:23:58,874 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_main_~x1~0.base) ULTIMATE.start_main_~x1~0.offset)_1) = -2*v_rep(select (select #memory_int ULTIMATE.start_main_~x1~0.base) ULTIMATE.start_main_~x1~0.offset)_1 + 21 Supporting invariants [] [2018-11-18 15:23:58,953 INFO L297 tatePredicateManager]: 10 out of 11 supporting invariants were superfluous and have been removed [2018-11-18 15:23:58,960 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-18 15:23:58,976 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 15:23:58,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 15:23:58,980 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 15:23:58,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 15:23:59,001 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 15:23:59,030 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 31 [2018-11-18 15:23:59,032 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 15:23:59,032 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 15:23:59,047 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 15:23:59,076 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 15:23:59,077 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:34, output treesize:30 [2018-11-18 15:23:59,092 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 15:23:59,093 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 50 [2018-11-18 15:23:59,097 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 15:23:59,097 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 28 treesize of output 7 [2018-11-18 15:23:59,097 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 15:23:59,103 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 15:23:59,108 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 15:23:59,108 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:47, output treesize:30 [2018-11-18 15:23:59,126 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 15:23:59,126 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 50 [2018-11-18 15:23:59,128 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 15:23:59,129 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 28 treesize of output 7 [2018-11-18 15:23:59,129 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 15:23:59,135 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 15:23:59,140 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 15:23:59,140 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:47, output treesize:30 [2018-11-18 15:23:59,157 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 15:23:59,158 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 50 [2018-11-18 15:23:59,160 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 15:23:59,161 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 28 treesize of output 7 [2018-11-18 15:23:59,161 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 15:23:59,166 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 15:23:59,171 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 15:23:59,171 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:47, output treesize:30 [2018-11-18 15:23:59,190 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 15:23:59,192 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 50 [2018-11-18 15:23:59,195 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 15:23:59,196 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 28 treesize of output 7 [2018-11-18 15:23:59,196 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 15:23:59,204 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 15:23:59,210 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 15:23:59,210 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:47, output treesize:30 [2018-11-18 15:23:59,231 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 15:23:59,232 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 50 [2018-11-18 15:23:59,235 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 15:23:59,236 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 28 treesize of output 7 [2018-11-18 15:23:59,236 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 15:23:59,242 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 15:23:59,247 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 15:23:59,247 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:47, output treesize:30 [2018-11-18 15:23:59,269 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 15:23:59,270 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 50 [2018-11-18 15:23:59,274 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 15:23:59,275 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 28 treesize of output 7 [2018-11-18 15:23:59,275 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 15:23:59,281 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 15:23:59,318 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 15:23:59,318 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:47, output treesize:30 [2018-11-18 15:23:59,344 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 15:23:59,345 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 50 [2018-11-18 15:23:59,347 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 15:23:59,348 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 28 treesize of output 7 [2018-11-18 15:23:59,348 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 15:23:59,353 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 15:23:59,358 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 15:23:59,358 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:47, output treesize:30 [2018-11-18 15:23:59,383 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 15:23:59,384 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 50 [2018-11-18 15:23:59,386 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 15:23:59,387 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 28 treesize of output 7 [2018-11-18 15:23:59,387 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 15:23:59,392 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 15:23:59,396 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 15:23:59,396 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:47, output treesize:30 [2018-11-18 15:23:59,423 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 15:23:59,424 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 50 [2018-11-18 15:23:59,427 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 15:23:59,429 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 28 treesize of output 7 [2018-11-18 15:23:59,429 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 15:23:59,436 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 15:23:59,451 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-18 15:23:59,451 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:47, output treesize:30 [2018-11-18 15:23:59,493 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 0 proven. 135 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 15:23:59,496 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 12 loop predicates [2018-11-18 15:23:59,497 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 36 states and 37 transitions. cyclomatic complexity: 2 Second operand 14 states. [2018-11-18 15:23:59,704 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 36 states and 37 transitions. cyclomatic complexity: 2. Second operand 14 states. Result 81 states and 86 transitions. Complement of second has 26 states. [2018-11-18 15:23:59,705 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 14 states 1 stem states 12 non-accepting loop states 1 accepting loop states [2018-11-18 15:23:59,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-11-18 15:23:59,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 43 transitions. [2018-11-18 15:23:59,706 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 43 transitions. Stem has 2 letters. Loop has 34 letters. [2018-11-18 15:23:59,707 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 15:23:59,707 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 43 transitions. Stem has 36 letters. Loop has 34 letters. [2018-11-18 15:23:59,707 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 15:23:59,707 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 43 transitions. Stem has 2 letters. Loop has 68 letters. [2018-11-18 15:23:59,708 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 15:23:59,708 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 81 states and 86 transitions. [2018-11-18 15:23:59,708 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 37 [2018-11-18 15:23:59,709 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 81 states to 80 states and 85 transitions. [2018-11-18 15:23:59,709 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 40 [2018-11-18 15:23:59,709 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 41 [2018-11-18 15:23:59,709 INFO L73 IsDeterministic]: Start isDeterministic. Operand 80 states and 85 transitions. [2018-11-18 15:23:59,709 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-18 15:23:59,709 INFO L705 BuchiCegarLoop]: Abstraction has 80 states and 85 transitions. [2018-11-18 15:23:59,709 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states and 85 transitions. [2018-11-18 15:23:59,711 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 79. [2018-11-18 15:23:59,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2018-11-18 15:23:59,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 84 transitions. [2018-11-18 15:23:59,712 INFO L728 BuchiCegarLoop]: Abstraction has 79 states and 84 transitions. [2018-11-18 15:23:59,712 INFO L608 BuchiCegarLoop]: Abstraction has 79 states and 84 transitions. [2018-11-18 15:23:59,712 INFO L442 BuchiCegarLoop]: ======== Iteration 12============ [2018-11-18 15:23:59,712 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 79 states and 84 transitions. [2018-11-18 15:23:59,712 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 37 [2018-11-18 15:23:59,712 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 15:23:59,713 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 15:23:59,713 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2018-11-18 15:23:59,713 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [11, 11, 10, 1, 1, 1, 1, 1] [2018-11-18 15:23:59,713 INFO L794 eck$LassoCheckResult]: Stem: 1479#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 1473#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~malloc3.base, main_#t~malloc3.offset, main_#t~mem6, main_#t~mem5, main_#t~mem7, main_#t~mem4, main_~x1~0.base, main_~x1~0.offset, main_~x2~0.base, main_~x2~0.offset;call main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.alloc(4);main_~x1~0.base, main_~x1~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset;call main_#t~malloc3.base, main_#t~malloc3.offset := #Ultimate.alloc(4);main_~x2~0.base, main_~x2~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset; 1474#L549-4 assume true; 1469#L549-1 [2018-11-18 15:23:59,713 INFO L796 eck$LassoCheckResult]: Loop: 1469#L549-1 call main_#t~mem4 := read~int(main_~x1~0.base, main_~x1~0.offset, 4); 1470#L549-2 assume !!(main_#t~mem4 <= 10);havoc main_#t~mem4;call write~int(10, main_~x2~0.base, main_~x2~0.offset, 4); 1480#L551-4 assume true; 1517#L551-1 call main_#t~mem5 := read~int(main_~x2~0.base, main_~x2~0.offset, 4); 1488#L551-2 assume !!(main_#t~mem5 > 1);havoc main_#t~mem5;call main_#t~mem6 := read~int(main_~x2~0.base, main_~x2~0.offset, 4);call write~int(main_#t~mem6 - 1, main_~x2~0.base, main_~x2~0.offset, 4);havoc main_#t~mem6; 1475#L551-4 assume true; 1476#L551-1 call main_#t~mem5 := read~int(main_~x2~0.base, main_~x2~0.offset, 4); 1486#L551-2 assume !!(main_#t~mem5 > 1);havoc main_#t~mem5;call main_#t~mem6 := read~int(main_~x2~0.base, main_~x2~0.offset, 4);call write~int(main_#t~mem6 - 1, main_~x2~0.base, main_~x2~0.offset, 4);havoc main_#t~mem6; 1516#L551-4 assume true; 1515#L551-1 call main_#t~mem5 := read~int(main_~x2~0.base, main_~x2~0.offset, 4); 1514#L551-2 assume !!(main_#t~mem5 > 1);havoc main_#t~mem5;call main_#t~mem6 := read~int(main_~x2~0.base, main_~x2~0.offset, 4);call write~int(main_#t~mem6 - 1, main_~x2~0.base, main_~x2~0.offset, 4);havoc main_#t~mem6; 1513#L551-4 assume true; 1512#L551-1 call main_#t~mem5 := read~int(main_~x2~0.base, main_~x2~0.offset, 4); 1511#L551-2 assume !!(main_#t~mem5 > 1);havoc main_#t~mem5;call main_#t~mem6 := read~int(main_~x2~0.base, main_~x2~0.offset, 4);call write~int(main_#t~mem6 - 1, main_~x2~0.base, main_~x2~0.offset, 4);havoc main_#t~mem6; 1510#L551-4 assume true; 1509#L551-1 call main_#t~mem5 := read~int(main_~x2~0.base, main_~x2~0.offset, 4); 1508#L551-2 assume !!(main_#t~mem5 > 1);havoc main_#t~mem5;call main_#t~mem6 := read~int(main_~x2~0.base, main_~x2~0.offset, 4);call write~int(main_#t~mem6 - 1, main_~x2~0.base, main_~x2~0.offset, 4);havoc main_#t~mem6; 1507#L551-4 assume true; 1506#L551-1 call main_#t~mem5 := read~int(main_~x2~0.base, main_~x2~0.offset, 4); 1505#L551-2 assume !!(main_#t~mem5 > 1);havoc main_#t~mem5;call main_#t~mem6 := read~int(main_~x2~0.base, main_~x2~0.offset, 4);call write~int(main_#t~mem6 - 1, main_~x2~0.base, main_~x2~0.offset, 4);havoc main_#t~mem6; 1504#L551-4 assume true; 1503#L551-1 call main_#t~mem5 := read~int(main_~x2~0.base, main_~x2~0.offset, 4); 1502#L551-2 assume !!(main_#t~mem5 > 1);havoc main_#t~mem5;call main_#t~mem6 := read~int(main_~x2~0.base, main_~x2~0.offset, 4);call write~int(main_#t~mem6 - 1, main_~x2~0.base, main_~x2~0.offset, 4);havoc main_#t~mem6; 1501#L551-4 assume true; 1500#L551-1 call main_#t~mem5 := read~int(main_~x2~0.base, main_~x2~0.offset, 4); 1499#L551-2 assume !!(main_#t~mem5 > 1);havoc main_#t~mem5;call main_#t~mem6 := read~int(main_~x2~0.base, main_~x2~0.offset, 4);call write~int(main_#t~mem6 - 1, main_~x2~0.base, main_~x2~0.offset, 4);havoc main_#t~mem6; 1498#L551-4 assume true; 1497#L551-1 call main_#t~mem5 := read~int(main_~x2~0.base, main_~x2~0.offset, 4); 1496#L551-2 assume !!(main_#t~mem5 > 1);havoc main_#t~mem5;call main_#t~mem6 := read~int(main_~x2~0.base, main_~x2~0.offset, 4);call write~int(main_#t~mem6 - 1, main_~x2~0.base, main_~x2~0.offset, 4);havoc main_#t~mem6; 1495#L551-4 assume true; 1494#L551-1 call main_#t~mem5 := read~int(main_~x2~0.base, main_~x2~0.offset, 4); 1493#L551-2 assume !!(main_#t~mem5 > 1);havoc main_#t~mem5;call main_#t~mem6 := read~int(main_~x2~0.base, main_~x2~0.offset, 4);call write~int(main_#t~mem6 - 1, main_~x2~0.base, main_~x2~0.offset, 4);havoc main_#t~mem6; 1491#L551-4 assume true; 1492#L551-1 call main_#t~mem5 := read~int(main_~x2~0.base, main_~x2~0.offset, 4); 1490#L551-2 assume !(main_#t~mem5 > 1);havoc main_#t~mem5; 1482#L551-5 call main_#t~mem7 := read~int(main_~x1~0.base, main_~x1~0.offset, 4);call write~int(1 + main_#t~mem7, main_~x1~0.base, main_~x1~0.offset, 4);havoc main_#t~mem7; 1483#L549-4 assume true; 1469#L549-1 [2018-11-18 15:23:59,713 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 15:23:59,714 INFO L82 PathProgramCache]: Analyzing trace with hash 29859, now seen corresponding path program 1 times [2018-11-18 15:23:59,714 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 15:23:59,714 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 15:23:59,715 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:23:59,715 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 15:23:59,715 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:23:59,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 15:23:59,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 15:23:59,718 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 15:23:59,718 INFO L82 PathProgramCache]: Analyzing trace with hash 1232029912, now seen corresponding path program 10 times [2018-11-18 15:23:59,719 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 15:23:59,719 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 15:23:59,719 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:23:59,719 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 15:23:59,719 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:23:59,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 15:23:59,860 INFO L134 CoverageAnalysis]: Checked inductivity of 165 backedges. 138 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 15:23:59,860 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 15:23:59,860 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_6a300b76-927b-4df7-a7d6-c354c6c7ad0f/bin-2019/uautomizer/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-18 15:23:59,874 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-18 15:23:59,888 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-18 15:23:59,888 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-18 15:23:59,890 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 15:23:59,892 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 15:23:59,893 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 15:23:59,893 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 15:23:59,894 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 15:23:59,895 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 15:23:59,895 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:11, output treesize:7 [2018-11-18 15:23:59,901 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 15:23:59,902 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 28 [2018-11-18 15:23:59,904 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 15:23:59,905 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 28 treesize of output 7 [2018-11-18 15:23:59,905 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 15:23:59,907 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 15:23:59,908 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 15:23:59,908 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:25, output treesize:7 [2018-11-18 15:23:59,916 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 15:23:59,916 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 28 [2018-11-18 15:23:59,918 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 15:23:59,918 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 28 treesize of output 7 [2018-11-18 15:23:59,919 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 15:23:59,920 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 15:23:59,921 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 15:23:59,921 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:25, output treesize:7 [2018-11-18 15:23:59,930 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 15:23:59,931 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 28 [2018-11-18 15:23:59,932 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 15:23:59,933 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 28 treesize of output 7 [2018-11-18 15:23:59,933 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 15:23:59,934 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 15:23:59,936 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 15:23:59,936 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:25, output treesize:7 [2018-11-18 15:23:59,948 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 15:23:59,949 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 28 [2018-11-18 15:23:59,951 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 15:23:59,951 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 28 treesize of output 7 [2018-11-18 15:23:59,951 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 15:23:59,952 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 15:23:59,954 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 15:23:59,954 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:25, output treesize:7 [2018-11-18 15:23:59,971 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 15:23:59,971 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 28 [2018-11-18 15:23:59,973 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 15:23:59,973 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 28 treesize of output 7 [2018-11-18 15:23:59,973 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 15:23:59,975 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 15:23:59,976 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 15:23:59,976 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:25, output treesize:7 [2018-11-18 15:23:59,991 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 15:23:59,991 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 28 [2018-11-18 15:23:59,993 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 15:23:59,994 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 28 treesize of output 7 [2018-11-18 15:23:59,994 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 15:23:59,995 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 15:23:59,999 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 15:23:59,999 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:25, output treesize:7 [2018-11-18 15:24:00,015 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 15:24:00,016 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 28 [2018-11-18 15:24:00,018 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 15:24:00,018 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 28 treesize of output 7 [2018-11-18 15:24:00,018 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 15:24:00,019 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 15:24:00,020 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 15:24:00,020 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:25, output treesize:7 [2018-11-18 15:24:00,032 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 15:24:00,033 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 28 [2018-11-18 15:24:00,035 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 15:24:00,035 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 28 treesize of output 7 [2018-11-18 15:24:00,036 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 15:24:00,037 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 15:24:00,039 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 15:24:00,039 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:25, output treesize:7 [2018-11-18 15:24:00,053 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 15:24:00,053 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 28 [2018-11-18 15:24:00,055 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 15:24:00,055 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 28 treesize of output 7 [2018-11-18 15:24:00,056 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 15:24:00,057 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 15:24:00,063 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 15:24:00,064 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:25, output treesize:7 [2018-11-18 15:24:00,079 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 15:24:00,080 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 15:24:00,081 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 15:24:00,082 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 15:24:00,083 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 15:24:00,083 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:15, output treesize:3 [2018-11-18 15:24:00,093 INFO L134 CoverageAnalysis]: Checked inductivity of 165 backedges. 30 proven. 135 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 15:24:00,117 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 15:24:00,117 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 23 [2018-11-18 15:24:00,118 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-11-18 15:24:00,118 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-11-18 15:24:00,118 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=134, Invalid=372, Unknown=0, NotChecked=0, Total=506 [2018-11-18 15:24:00,118 INFO L87 Difference]: Start difference. First operand 79 states and 84 transitions. cyclomatic complexity: 7 Second operand 23 states. [2018-11-18 15:24:00,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 15:24:00,231 INFO L93 Difference]: Finished difference Result 73 states and 74 transitions. [2018-11-18 15:24:00,231 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-11-18 15:24:00,231 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 73 states and 74 transitions. [2018-11-18 15:24:00,232 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-18 15:24:00,232 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 73 states to 0 states and 0 transitions. [2018-11-18 15:24:00,232 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2018-11-18 15:24:00,232 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2018-11-18 15:24:00,232 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2018-11-18 15:24:00,232 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-18 15:24:00,232 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-18 15:24:00,232 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-18 15:24:00,232 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-18 15:24:00,232 INFO L442 BuchiCegarLoop]: ======== Iteration 13============ [2018-11-18 15:24:00,232 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2018-11-18 15:24:00,232 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-18 15:24:00,233 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2018-11-18 15:24:00,237 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 18.11 03:24:00 BoogieIcfgContainer [2018-11-18 15:24:00,237 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-11-18 15:24:00,237 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-18 15:24:00,237 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-18 15:24:00,237 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-18 15:24:00,238 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 03:23:53" (3/4) ... [2018-11-18 15:24:00,240 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-11-18 15:24:00,240 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-18 15:24:00,241 INFO L168 Benchmark]: Toolchain (without parser) took 7027.05 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 186.1 MB). Free memory was 956.6 MB in the beginning and 977.9 MB in the end (delta: -21.4 MB). Peak memory consumption was 164.7 MB. Max. memory is 11.5 GB. [2018-11-18 15:24:00,241 INFO L168 Benchmark]: CDTParser took 0.11 ms. Allocated memory is still 1.0 GB. Free memory is still 982.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-18 15:24:00,241 INFO L168 Benchmark]: CACSL2BoogieTranslator took 313.95 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 141.0 MB). Free memory was 956.6 MB in the beginning and 1.1 GB in the end (delta: -172.7 MB). Peak memory consumption was 27.4 MB. Max. memory is 11.5 GB. [2018-11-18 15:24:00,241 INFO L168 Benchmark]: Boogie Procedure Inliner took 26.27 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-18 15:24:00,242 INFO L168 Benchmark]: Boogie Preprocessor took 14.94 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-18 15:24:00,242 INFO L168 Benchmark]: RCFGBuilder took 176.03 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 20.8 MB). Peak memory consumption was 20.8 MB. Max. memory is 11.5 GB. [2018-11-18 15:24:00,242 INFO L168 Benchmark]: BuchiAutomizer took 6489.95 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 45.1 MB). Free memory was 1.1 GB in the beginning and 977.9 MB in the end (delta: 130.6 MB). Peak memory consumption was 175.7 MB. Max. memory is 11.5 GB. [2018-11-18 15:24:00,242 INFO L168 Benchmark]: Witness Printer took 3.27 ms. Allocated memory is still 1.2 GB. Free memory is still 977.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-18 15:24:00,243 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.11 ms. Allocated memory is still 1.0 GB. Free memory is still 982.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 313.95 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 141.0 MB). Free memory was 956.6 MB in the beginning and 1.1 GB in the end (delta: -172.7 MB). Peak memory consumption was 27.4 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 26.27 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 14.94 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 176.03 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 20.8 MB). Peak memory consumption was 20.8 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 6489.95 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 45.1 MB). Free memory was 1.1 GB in the beginning and 977.9 MB in the end (delta: 130.6 MB). Peak memory consumption was 175.7 MB. Max. memory is 11.5 GB. * Witness Printer took 3.27 ms. Allocated memory is still 1.2 GB. Free memory is still 977.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 12 terminating modules (11 trivial, 1 deterministic, 0 nondeterministic). One deterministic module has affine ranking function -2 * unknown-#memory_int-unknown[x1][x1] + 21 and consists of 14 locations. 11 modules have a trivial ranking function, the largest among these consists of 23 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 6.4s and 13 iterations. TraceHistogramMax:11. Analysis of lassos took 4.5s. Construction of modules took 0.6s. Büchi inclusion checks took 1.0s. Highest rank in rank-based complementation 3. Minimization of det autom 11. Minimization of nondet autom 1. Automata minimization 0.0s AutomataMinimizationTime, 11 MinimizatonAttempts, 1 StatesRemovedByMinimization, 1 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 79 states and ocurred in iteration 11. Nontrivial modules had stage [1, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/135 HoareTripleCheckerStatistics: 152 SDtfs, 102 SDslu, 790 SDs, 0 SdLazy, 1479 SolverSat, 57 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.6s Time LassoAnalysisResults: nont0 unkn0 SFLI11 SFLT0 conc0 concLT0 SILN0 SILU0 SILI0 SILT0 lasso1 LassoPreprocessingBenchmarks: Lassos: inital152 mio100 ax111 hnf100 lsp85 ukn72 mio100 lsp42 div100 bol100 ite100 ukn100 eq188 hnf88 smp100 dnf100 smp100 tf100 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 5ms VariablesStem: 2 VariablesLoop: 2 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...