./Ultimate.py --spec ../../sv-benchmarks/c/Termination.prp --file ../../sv-benchmarks/c/termination-memory-alloca/b.12-alloca_true-termination_true-no-overflow.c.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 1dbac8bc Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_b9d79254-3769-4dea-8ea0-143bdf22461a/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_b9d79254-3769-4dea-8ea0-143bdf22461a/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_b9d79254-3769-4dea-8ea0-143bdf22461a/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_b9d79254-3769-4dea-8ea0-143bdf22461a/bin-2019/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/termination-memory-alloca/b.12-alloca_true-termination_true-no-overflow.c.i -s /tmp/vcloud-vcloud-master/worker/working_dir_b9d79254-3769-4dea-8ea0-143bdf22461a/bin-2019/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_b9d79254-3769-4dea-8ea0-143bdf22461a/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 27b51ff95b1c87aada11269295eff3fc5c30957f .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-1dbac8b [2018-10-27 06:07:09,556 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-27 06:07:09,557 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-27 06:07:09,566 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-27 06:07:09,567 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-27 06:07:09,567 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-27 06:07:09,568 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-27 06:07:09,570 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-27 06:07:09,572 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-27 06:07:09,572 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-27 06:07:09,573 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-27 06:07:09,573 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-27 06:07:09,574 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-27 06:07:09,575 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-27 06:07:09,576 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-27 06:07:09,577 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-27 06:07:09,577 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-27 06:07:09,579 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-27 06:07:09,580 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-27 06:07:09,582 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-27 06:07:09,582 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-27 06:07:09,583 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-27 06:07:09,585 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-27 06:07:09,585 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-27 06:07:09,585 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-27 06:07:09,586 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-27 06:07:09,587 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-27 06:07:09,588 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-27 06:07:09,589 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-27 06:07:09,589 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-27 06:07:09,590 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-27 06:07:09,590 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-27 06:07:09,590 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-27 06:07:09,590 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-27 06:07:09,592 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-27 06:07:09,592 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-27 06:07:09,592 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_b9d79254-3769-4dea-8ea0-143bdf22461a/bin-2019/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf [2018-10-27 06:07:09,603 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-27 06:07:09,604 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-27 06:07:09,604 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-10-27 06:07:09,605 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-10-27 06:07:09,605 INFO L133 SettingsManager]: * Use SBE=true [2018-10-27 06:07:09,605 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-10-27 06:07:09,605 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-10-27 06:07:09,605 INFO L133 SettingsManager]: * Use old map elimination=false [2018-10-27 06:07:09,605 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-10-27 06:07:09,605 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-10-27 06:07:09,606 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-10-27 06:07:09,606 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-27 06:07:09,606 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-10-27 06:07:09,606 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-10-27 06:07:09,606 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-27 06:07:09,606 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-10-27 06:07:09,606 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-10-27 06:07:09,608 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-10-27 06:07:09,608 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-10-27 06:07:09,608 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-10-27 06:07:09,608 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-10-27 06:07:09,609 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-27 06:07:09,609 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-10-27 06:07:09,609 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-10-27 06:07:09,609 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-27 06:07:09,609 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-10-27 06:07:09,609 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-10-27 06:07:09,610 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-10-27 06:07:09,610 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_b9d79254-3769-4dea-8ea0-143bdf22461a/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 -> 27b51ff95b1c87aada11269295eff3fc5c30957f [2018-10-27 06:07:09,636 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-27 06:07:09,645 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-27 06:07:09,648 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-27 06:07:09,649 INFO L271 PluginConnector]: Initializing CDTParser... [2018-10-27 06:07:09,649 INFO L276 PluginConnector]: CDTParser initialized [2018-10-27 06:07:09,650 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_b9d79254-3769-4dea-8ea0-143bdf22461a/bin-2019/uautomizer/../../sv-benchmarks/c/termination-memory-alloca/b.12-alloca_true-termination_true-no-overflow.c.i [2018-10-27 06:07:09,693 INFO L218 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_b9d79254-3769-4dea-8ea0-143bdf22461a/bin-2019/uautomizer/data/1892f15c9/f345a44581d640fda2fb6f56d930362e/FLAG0d2bfdb10 [2018-10-27 06:07:10,098 INFO L298 CDTParser]: Found 1 translation units. [2018-10-27 06:07:10,099 INFO L158 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_b9d79254-3769-4dea-8ea0-143bdf22461a/sv-benchmarks/c/termination-memory-alloca/b.12-alloca_true-termination_true-no-overflow.c.i [2018-10-27 06:07:10,108 INFO L346 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_b9d79254-3769-4dea-8ea0-143bdf22461a/bin-2019/uautomizer/data/1892f15c9/f345a44581d640fda2fb6f56d930362e/FLAG0d2bfdb10 [2018-10-27 06:07:10,119 INFO L354 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_b9d79254-3769-4dea-8ea0-143bdf22461a/bin-2019/uautomizer/data/1892f15c9/f345a44581d640fda2fb6f56d930362e [2018-10-27 06:07:10,121 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-27 06:07:10,123 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-10-27 06:07:10,123 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-10-27 06:07:10,123 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-10-27 06:07:10,129 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-10-27 06:07:10,130 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.10 06:07:10" (1/1) ... [2018-10-27 06:07:10,132 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@13682a3a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:07:10, skipping insertion in model container [2018-10-27 06:07:10,132 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.10 06:07:10" (1/1) ... [2018-10-27 06:07:10,142 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-10-27 06:07:10,175 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-10-27 06:07:10,404 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-27 06:07:10,416 INFO L189 MainTranslator]: Completed pre-run [2018-10-27 06:07:10,459 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-27 06:07:10,503 INFO L193 MainTranslator]: Completed translation [2018-10-27 06:07:10,503 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:07:10 WrapperNode [2018-10-27 06:07:10,504 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-10-27 06:07:10,505 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-10-27 06:07:10,505 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-10-27 06:07:10,505 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-10-27 06:07:10,513 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:07:10" (1/1) ... [2018-10-27 06:07:10,528 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:07:10" (1/1) ... [2018-10-27 06:07:10,614 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-10-27 06:07:10,614 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-27 06:07:10,614 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-27 06:07:10,614 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-27 06:07:10,626 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:07:10" (1/1) ... [2018-10-27 06:07:10,626 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:07:10" (1/1) ... [2018-10-27 06:07:10,629 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:07:10" (1/1) ... [2018-10-27 06:07:10,629 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:07:10" (1/1) ... [2018-10-27 06:07:10,636 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:07:10" (1/1) ... [2018-10-27 06:07:10,648 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:07:10" (1/1) ... [2018-10-27 06:07:10,649 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:07:10" (1/1) ... [2018-10-27 06:07:10,650 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-27 06:07:10,657 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-27 06:07:10,657 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-27 06:07:10,657 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-27 06:07:10,658 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:07:10" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b9d79254-3769-4dea-8ea0-143bdf22461a/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-10-27 06:07:10,719 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-10-27 06:07:10,720 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-10-27 06:07:10,720 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-27 06:07:10,720 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-27 06:07:11,274 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-27 06:07:11,275 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.10 06:07:11 BoogieIcfgContainer [2018-10-27 06:07:11,275 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-27 06:07:11,275 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-10-27 06:07:11,275 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-10-27 06:07:11,278 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-10-27 06:07:11,278 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-10-27 06:07:11,278 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 27.10 06:07:10" (1/3) ... [2018-10-27 06:07:11,279 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@47c40bc2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 27.10 06:07:11, skipping insertion in model container [2018-10-27 06:07:11,280 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-10-27 06:07:11,280 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:07:10" (2/3) ... [2018-10-27 06:07:11,280 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@47c40bc2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 27.10 06:07:11, skipping insertion in model container [2018-10-27 06:07:11,280 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-10-27 06:07:11,280 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.10 06:07:11" (3/3) ... [2018-10-27 06:07:11,282 INFO L375 chiAutomizerObserver]: Analyzing ICFG b.12-alloca_true-termination_true-no-overflow.c.i [2018-10-27 06:07:11,319 INFO L135 ementStrategyFactory]: Using default assertion order modulation [2018-10-27 06:07:11,320 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-10-27 06:07:11,320 INFO L375 BuchiCegarLoop]: Hoare is false [2018-10-27 06:07:11,320 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-10-27 06:07:11,320 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-27 06:07:11,320 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-27 06:07:11,320 INFO L379 BuchiCegarLoop]: Difference is false [2018-10-27 06:07:11,321 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-27 06:07:11,321 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-10-27 06:07:11,331 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 28 states. [2018-10-27 06:07:11,351 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 17 [2018-10-27 06:07:11,351 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-10-27 06:07:11,351 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-10-27 06:07:11,358 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2018-10-27 06:07:11,358 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 06:07:11,358 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-10-27 06:07:11,359 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 28 states. [2018-10-27 06:07:11,364 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 17 [2018-10-27 06:07:11,364 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-10-27 06:07:11,365 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-10-27 06:07:11,365 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2018-10-27 06:07:11,365 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 06:07:11,372 INFO L793 eck$LassoCheckResult]: Stem: 25#ULTIMATE.startENTRYtrue assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 11#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet13, main_#t~nondet14, main_#t~ret15;assume { :begin_inline_test_fun } true;test_fun_#in~x, test_fun_#in~y := main_#t~nondet13, main_#t~nondet14;havoc test_fun_#res;havoc test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset, test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset, test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset, test_fun_#t~mem8, test_fun_#t~mem9, test_fun_#t~mem10, test_fun_#t~mem11, test_fun_#t~mem5, test_fun_#t~mem6, test_fun_#t~short7, test_fun_#t~mem12, test_fun_~x, test_fun_~y, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, test_fun_~c~0.base, test_fun_~c~0.offset;test_fun_~x := test_fun_#in~x;test_fun_~y := test_fun_#in~y;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset := test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset := test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;test_fun_~c~0.base, test_fun_~c~0.offset := test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset; 13#L552true SUMMARY for call write~int(test_fun_~x, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L552 14#L552-1true SUMMARY for call write~int(test_fun_~y, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L552-1 23#L553true SUMMARY for call write~int(0, test_fun_~c~0.base, test_fun_~c~0.offset, 4); srcloc: L553 6#L559-3true [2018-10-27 06:07:11,373 INFO L795 eck$LassoCheckResult]: Loop: 6#L559-3true assume true; 8#L555true SUMMARY for call test_fun_#t~mem5 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L555 10#L555-1true test_fun_#t~short7 := test_fun_#t~mem5 > 0; 24#L555-2true assume test_fun_#t~short7; 29#L555-6true assume !!test_fun_#t~short7;havoc test_fun_#t~mem6;havoc test_fun_#t~mem5;havoc test_fun_#t~short7; 20#L556true SUMMARY for call test_fun_#t~mem8 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L556 21#L556-1true assume !(test_fun_#t~mem8 > 0);havoc test_fun_#t~mem8; 17#L559true SUMMARY for call test_fun_#t~mem10 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L559 3#L559-1true assume !(test_fun_#t~mem10 > 0);havoc test_fun_#t~mem10; 6#L559-3true [2018-10-27 06:07:11,377 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:07:11,378 INFO L82 PathProgramCache]: Analyzing trace with hash 28691745, now seen corresponding path program 1 times [2018-10-27 06:07:11,380 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:07:11,380 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:07:11,427 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:07:11,427 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:07:11,427 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:07:11,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:07:11,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:07:11,508 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:07:11,510 INFO L82 PathProgramCache]: Analyzing trace with hash 925785955, now seen corresponding path program 1 times [2018-10-27 06:07:11,510 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:07:11,510 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:07:11,512 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:07:11,514 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:07:11,514 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:07:11,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:07:11,639 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 06:07:11,641 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-27 06:07:11,641 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-10-27 06:07:11,644 INFO L810 eck$LassoCheckResult]: loop already infeasible [2018-10-27 06:07:11,653 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-27 06:07:11,653 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-10-27 06:07:11,655 INFO L87 Difference]: Start difference. First operand 28 states. Second operand 6 states. [2018-10-27 06:07:12,019 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 06:07:12,020 INFO L93 Difference]: Finished difference Result 39 states and 42 transitions. [2018-10-27 06:07:12,023 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-27 06:07:12,025 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 39 states and 42 transitions. [2018-10-27 06:07:12,026 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 22 [2018-10-27 06:07:12,030 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 39 states to 27 states and 30 transitions. [2018-10-27 06:07:12,031 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 27 [2018-10-27 06:07:12,032 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 27 [2018-10-27 06:07:12,032 INFO L73 IsDeterministic]: Start isDeterministic. Operand 27 states and 30 transitions. [2018-10-27 06:07:12,032 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-10-27 06:07:12,033 INFO L705 BuchiCegarLoop]: Abstraction has 27 states and 30 transitions. [2018-10-27 06:07:12,045 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states and 30 transitions. [2018-10-27 06:07:12,053 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 25. [2018-10-27 06:07:12,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2018-10-27 06:07:12,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 28 transitions. [2018-10-27 06:07:12,055 INFO L728 BuchiCegarLoop]: Abstraction has 25 states and 28 transitions. [2018-10-27 06:07:12,055 INFO L608 BuchiCegarLoop]: Abstraction has 25 states and 28 transitions. [2018-10-27 06:07:12,055 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-10-27 06:07:12,056 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 25 states and 28 transitions. [2018-10-27 06:07:12,056 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 20 [2018-10-27 06:07:12,056 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-10-27 06:07:12,057 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-10-27 06:07:12,057 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2018-10-27 06:07:12,057 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 06:07:12,057 INFO L793 eck$LassoCheckResult]: Stem: 103#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 98#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet13, main_#t~nondet14, main_#t~ret15;assume { :begin_inline_test_fun } true;test_fun_#in~x, test_fun_#in~y := main_#t~nondet13, main_#t~nondet14;havoc test_fun_#res;havoc test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset, test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset, test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset, test_fun_#t~mem8, test_fun_#t~mem9, test_fun_#t~mem10, test_fun_#t~mem11, test_fun_#t~mem5, test_fun_#t~mem6, test_fun_#t~short7, test_fun_#t~mem12, test_fun_~x, test_fun_~y, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, test_fun_~c~0.base, test_fun_~c~0.offset;test_fun_~x := test_fun_#in~x;test_fun_~y := test_fun_#in~y;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset := test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset := test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;test_fun_~c~0.base, test_fun_~c~0.offset := test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset; 99#L552 SUMMARY for call write~int(test_fun_~x, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L552 104#L552-1 SUMMARY for call write~int(test_fun_~y, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L552-1 100#L553 SUMMARY for call write~int(0, test_fun_~c~0.base, test_fun_~c~0.offset, 4); srcloc: L553 87#L559-3 [2018-10-27 06:07:12,058 INFO L795 eck$LassoCheckResult]: Loop: 87#L559-3 assume true; 94#L555 SUMMARY for call test_fun_#t~mem5 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L555 96#L555-1 test_fun_#t~short7 := test_fun_#t~mem5 > 0; 97#L555-2 assume test_fun_#t~short7; 102#L555-6 assume !!test_fun_#t~short7;havoc test_fun_#t~mem6;havoc test_fun_#t~mem5;havoc test_fun_#t~short7; 109#L556 SUMMARY for call test_fun_#t~mem8 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L556 95#L556-1 assume test_fun_#t~mem8 > 0;havoc test_fun_#t~mem8; 89#L557 SUMMARY for call test_fun_#t~mem9 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L557 90#L557-1 SUMMARY for call write~int(test_fun_#t~mem9 - 1, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L557-1 93#L557-2 havoc test_fun_#t~mem9; 87#L559-3 [2018-10-27 06:07:12,058 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:07:12,058 INFO L82 PathProgramCache]: Analyzing trace with hash 28691745, now seen corresponding path program 2 times [2018-10-27 06:07:12,058 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:07:12,058 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:07:12,060 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:07:12,060 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:07:12,060 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:07:12,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:07:12,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:07:12,093 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:07:12,094 INFO L82 PathProgramCache]: Analyzing trace with hash -1365560567, now seen corresponding path program 1 times [2018-10-27 06:07:12,094 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:07:12,094 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:07:12,095 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:07:12,095 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-27 06:07:12,096 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:07:12,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:07:12,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:07:12,111 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:07:12,111 INFO L82 PathProgramCache]: Analyzing trace with hash -1848960983, now seen corresponding path program 1 times [2018-10-27 06:07:12,111 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:07:12,111 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:07:12,112 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:07:12,112 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:07:12,112 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:07:12,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:07:12,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:07:12,349 WARN L179 SmtUtils]: Spent 196.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 31 [2018-10-27 06:07:13,126 WARN L179 SmtUtils]: Spent 755.00 ms on a formula simplification. DAG size of input: 110 DAG size of output: 95 [2018-10-27 06:07:13,253 WARN L179 SmtUtils]: Spent 125.00 ms on a formula simplification that was a NOOP. DAG size: 89 [2018-10-27 06:07:13,261 INFO L214 LassoAnalysis]: Preferences: [2018-10-27 06:07:13,262 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-10-27 06:07:13,263 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-10-27 06:07:13,263 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-10-27 06:07:13,263 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-10-27 06:07:13,263 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-10-27 06:07:13,263 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-10-27 06:07:13,264 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-10-27 06:07:13,264 INFO L131 ssoRankerPreferences]: Filename of dumped script: b.12-alloca_true-termination_true-no-overflow.c.i_Iteration2_Lasso [2018-10-27 06:07:13,264 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-10-27 06:07:13,264 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-10-27 06:07:13,285 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:07:13,297 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:07:13,759 WARN L179 SmtUtils]: Spent 279.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 93 [2018-10-27 06:07:13,867 WARN L179 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 49 [2018-10-27 06:07:13,868 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:07:13,882 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:07:13,884 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:07:13,886 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:07:13,889 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:07:13,891 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:07:13,911 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:07:13,914 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:07:13,918 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:07:13,919 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:07:13,921 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:07:13,923 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:07:13,924 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:07:13,926 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:07:13,931 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:07:14,444 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-10-27 06:07:14,448 INFO L496 LassoAnalysis]: Using template 'affine'. [2018-10-27 06:07:14,451 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-10-27 06:07:14,453 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:07:14,453 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:07:14,453 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:07:14,454 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:07:14,454 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:07:14,457 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:07:14,457 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:07:14,460 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:07:14,461 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-10-27 06:07:14,461 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:07:14,462 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:07:14,462 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:07:14,462 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:07:14,464 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:07:14,464 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:07:14,470 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:07:14,470 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-10-27 06:07:14,472 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:07:14,472 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:07:14,472 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:07:14,472 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:07:14,475 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:07:14,475 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:07:14,496 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:07:14,497 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-10-27 06:07:14,497 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:07:14,497 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-10-27 06:07:14,497 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:07:14,498 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:07:14,501 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-10-27 06:07:14,501 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:07:14,511 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:07:14,511 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-10-27 06:07:14,512 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:07:14,512 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:07:14,512 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:07:14,512 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:07:14,514 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:07:14,514 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:07:14,519 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:07:14,519 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-10-27 06:07:14,520 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:07:14,520 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-10-27 06:07:14,520 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:07:14,520 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:07:14,522 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-10-27 06:07:14,522 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:07:14,532 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:07:14,533 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-10-27 06:07:14,533 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:07:14,533 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-10-27 06:07:14,533 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:07:14,534 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:07:14,537 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-10-27 06:07:14,537 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:07:14,545 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:07:14,546 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-10-27 06:07:14,546 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:07:14,546 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:07:14,548 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:07:14,548 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:07:14,549 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:07:14,549 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:07:14,553 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:07:14,553 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-10-27 06:07:14,554 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:07:14,554 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:07:14,554 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:07:14,554 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:07:14,557 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:07:14,558 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:07:14,560 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:07:14,560 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-10-27 06:07:14,561 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:07:14,561 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:07:14,561 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:07:14,563 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:07:14,565 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:07:14,565 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:07:14,581 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-10-27 06:07:14,587 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-10-27 06:07:14,587 INFO L444 ModelExtractionUtils]: 13 out of 16 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-10-27 06:07:14,589 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-10-27 06:07:14,590 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-10-27 06:07:14,591 INFO L517 LassoAnalysis]: Proved termination. [2018-10-27 06:07:14,592 INFO L519 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_test_fun_~x_ref~0.base) ULTIMATE.start_test_fun_~x_ref~0.offset)_1) = 1*v_rep(select (select #memory_int ULTIMATE.start_test_fun_~x_ref~0.base) ULTIMATE.start_test_fun_~x_ref~0.offset)_1 Supporting invariants [] [2018-10-27 06:07:14,791 INFO L297 tatePredicateManager]: 19 out of 19 supporting invariants were superfluous and have been removed [2018-10-27 06:07:14,796 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-10-27 06:07:14,806 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:07:14,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:07:14,823 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 06:07:14,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:07:14,837 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 06:07:15,021 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 06:07:15,025 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 35 treesize of output 34 [2018-10-27 06:07:15,030 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 25 [2018-10-27 06:07:15,032 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 06:07:15,046 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 06:07:15,050 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-27 06:07:15,050 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:35, output treesize:13 [2018-10-27 06:07:15,067 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 06:07:15,069 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 6 loop predicates [2018-10-27 06:07:15,070 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 25 states and 28 transitions. cyclomatic complexity: 4 Second operand 8 states. [2018-10-27 06:07:15,241 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 25 states and 28 transitions. cyclomatic complexity: 4. Second operand 8 states. Result 69 states and 77 transitions. Complement of second has 15 states. [2018-10-27 06:07:15,242 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 8 states 1 stem states 6 non-accepting loop states 1 accepting loop states [2018-10-27 06:07:15,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-10-27 06:07:15,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 28 transitions. [2018-10-27 06:07:15,244 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 28 transitions. Stem has 5 letters. Loop has 10 letters. [2018-10-27 06:07:15,245 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-10-27 06:07:15,245 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 28 transitions. Stem has 15 letters. Loop has 10 letters. [2018-10-27 06:07:15,245 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-10-27 06:07:15,245 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 28 transitions. Stem has 5 letters. Loop has 20 letters. [2018-10-27 06:07:15,246 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-10-27 06:07:15,246 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 69 states and 77 transitions. [2018-10-27 06:07:15,249 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 31 [2018-10-27 06:07:15,250 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 69 states to 60 states and 68 transitions. [2018-10-27 06:07:15,250 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 41 [2018-10-27 06:07:15,250 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 43 [2018-10-27 06:07:15,250 INFO L73 IsDeterministic]: Start isDeterministic. Operand 60 states and 68 transitions. [2018-10-27 06:07:15,250 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-10-27 06:07:15,251 INFO L705 BuchiCegarLoop]: Abstraction has 60 states and 68 transitions. [2018-10-27 06:07:15,251 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states and 68 transitions. [2018-10-27 06:07:15,253 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 54. [2018-10-27 06:07:15,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2018-10-27 06:07:15,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 62 transitions. [2018-10-27 06:07:15,254 INFO L728 BuchiCegarLoop]: Abstraction has 54 states and 62 transitions. [2018-10-27 06:07:15,254 INFO L608 BuchiCegarLoop]: Abstraction has 54 states and 62 transitions. [2018-10-27 06:07:15,254 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-10-27 06:07:15,254 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 54 states and 62 transitions. [2018-10-27 06:07:15,257 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 31 [2018-10-27 06:07:15,257 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-10-27 06:07:15,258 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-10-27 06:07:15,258 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2018-10-27 06:07:15,258 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 06:07:15,258 INFO L793 eck$LassoCheckResult]: Stem: 375#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 367#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet13, main_#t~nondet14, main_#t~ret15;assume { :begin_inline_test_fun } true;test_fun_#in~x, test_fun_#in~y := main_#t~nondet13, main_#t~nondet14;havoc test_fun_#res;havoc test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset, test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset, test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset, test_fun_#t~mem8, test_fun_#t~mem9, test_fun_#t~mem10, test_fun_#t~mem11, test_fun_#t~mem5, test_fun_#t~mem6, test_fun_#t~short7, test_fun_#t~mem12, test_fun_~x, test_fun_~y, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, test_fun_~c~0.base, test_fun_~c~0.offset;test_fun_~x := test_fun_#in~x;test_fun_~y := test_fun_#in~y;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset := test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset := test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;test_fun_~c~0.base, test_fun_~c~0.offset := test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset; 368#L552 SUMMARY for call write~int(test_fun_~x, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L552 376#L552-1 SUMMARY for call write~int(test_fun_~y, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L552-1 373#L553 SUMMARY for call write~int(0, test_fun_~c~0.base, test_fun_~c~0.offset, 4); srcloc: L553 374#L559-3 assume true; 353#L555 [2018-10-27 06:07:15,258 INFO L795 eck$LassoCheckResult]: Loop: 353#L555 SUMMARY for call test_fun_#t~mem5 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L555 390#L555-1 test_fun_#t~short7 := test_fun_#t~mem5 > 0; 369#L555-2 assume !test_fun_#t~short7; 370#L555-4 SUMMARY for call test_fun_#t~mem6 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L555-4 395#L555-5 test_fun_#t~short7 := test_fun_#t~mem6 > 0; 394#L555-6 assume !!test_fun_#t~short7;havoc test_fun_#t~mem6;havoc test_fun_#t~mem5;havoc test_fun_#t~short7; 393#L556 SUMMARY for call test_fun_#t~mem8 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L556 392#L556-1 assume !(test_fun_#t~mem8 > 0);havoc test_fun_#t~mem8; 391#L559 SUMMARY for call test_fun_#t~mem10 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L559 342#L559-1 assume !(test_fun_#t~mem10 > 0);havoc test_fun_#t~mem10; 344#L559-3 assume true; 353#L555 [2018-10-27 06:07:15,259 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:07:15,259 INFO L82 PathProgramCache]: Analyzing trace with hash 889444104, now seen corresponding path program 1 times [2018-10-27 06:07:15,259 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:07:15,259 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:07:15,260 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:07:15,260 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:07:15,260 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:07:15,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:07:15,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:07:15,285 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:07:15,285 INFO L82 PathProgramCache]: Analyzing trace with hash 546641296, now seen corresponding path program 1 times [2018-10-27 06:07:15,285 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:07:15,285 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:07:15,286 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:07:15,286 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:07:15,286 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:07:15,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:07:15,331 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 06:07:15,332 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-27 06:07:15,332 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-10-27 06:07:15,332 INFO L810 eck$LassoCheckResult]: loop already infeasible [2018-10-27 06:07:15,332 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-27 06:07:15,332 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-10-27 06:07:15,332 INFO L87 Difference]: Start difference. First operand 54 states and 62 transitions. cyclomatic complexity: 11 Second operand 6 states. [2018-10-27 06:07:15,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 06:07:15,401 INFO L93 Difference]: Finished difference Result 56 states and 61 transitions. [2018-10-27 06:07:15,403 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-10-27 06:07:15,403 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 56 states and 61 transitions. [2018-10-27 06:07:15,404 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 22 [2018-10-27 06:07:15,404 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 56 states to 49 states and 54 transitions. [2018-10-27 06:07:15,404 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 39 [2018-10-27 06:07:15,405 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 39 [2018-10-27 06:07:15,405 INFO L73 IsDeterministic]: Start isDeterministic. Operand 49 states and 54 transitions. [2018-10-27 06:07:15,405 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-10-27 06:07:15,405 INFO L705 BuchiCegarLoop]: Abstraction has 49 states and 54 transitions. [2018-10-27 06:07:15,405 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states and 54 transitions. [2018-10-27 06:07:15,406 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 40. [2018-10-27 06:07:15,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2018-10-27 06:07:15,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 44 transitions. [2018-10-27 06:07:15,408 INFO L728 BuchiCegarLoop]: Abstraction has 40 states and 44 transitions. [2018-10-27 06:07:15,408 INFO L608 BuchiCegarLoop]: Abstraction has 40 states and 44 transitions. [2018-10-27 06:07:15,408 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2018-10-27 06:07:15,408 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 40 states and 44 transitions. [2018-10-27 06:07:15,410 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 20 [2018-10-27 06:07:15,410 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-10-27 06:07:15,410 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-10-27 06:07:15,411 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 06:07:15,411 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 06:07:15,411 INFO L793 eck$LassoCheckResult]: Stem: 494#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 487#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet13, main_#t~nondet14, main_#t~ret15;assume { :begin_inline_test_fun } true;test_fun_#in~x, test_fun_#in~y := main_#t~nondet13, main_#t~nondet14;havoc test_fun_#res;havoc test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset, test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset, test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset, test_fun_#t~mem8, test_fun_#t~mem9, test_fun_#t~mem10, test_fun_#t~mem11, test_fun_#t~mem5, test_fun_#t~mem6, test_fun_#t~short7, test_fun_#t~mem12, test_fun_~x, test_fun_~y, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, test_fun_~c~0.base, test_fun_~c~0.offset;test_fun_~x := test_fun_#in~x;test_fun_~y := test_fun_#in~y;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset := test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset := test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;test_fun_~c~0.base, test_fun_~c~0.offset := test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset; 488#L552 SUMMARY for call write~int(test_fun_~x, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L552 495#L552-1 SUMMARY for call write~int(test_fun_~y, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L552-1 489#L553 SUMMARY for call write~int(0, test_fun_~c~0.base, test_fun_~c~0.offset, 4); srcloc: L553 490#L559-3 assume true; 501#L555 SUMMARY for call test_fun_#t~mem5 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L555 504#L555-1 test_fun_#t~short7 := test_fun_#t~mem5 > 0; 491#L555-2 assume !test_fun_#t~short7; 492#L555-4 [2018-10-27 06:07:15,411 INFO L795 eck$LassoCheckResult]: Loop: 492#L555-4 SUMMARY for call test_fun_#t~mem6 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L555-4 496#L555-5 test_fun_#t~short7 := test_fun_#t~mem6 > 0; 497#L555-6 assume !!test_fun_#t~short7;havoc test_fun_#t~mem6;havoc test_fun_#t~mem5;havoc test_fun_#t~short7; 499#L556 SUMMARY for call test_fun_#t~mem8 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L556 502#L556-1 assume test_fun_#t~mem8 > 0;havoc test_fun_#t~mem8; 469#L557 SUMMARY for call test_fun_#t~mem9 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L557 470#L557-1 SUMMARY for call write~int(test_fun_#t~mem9 - 1, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L557-1 480#L557-2 havoc test_fun_#t~mem9; 468#L559-3 assume true; 473#L555 SUMMARY for call test_fun_#t~mem5 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L555 482#L555-1 test_fun_#t~short7 := test_fun_#t~mem5 > 0; 485#L555-2 assume !test_fun_#t~short7; 492#L555-4 [2018-10-27 06:07:15,411 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:07:15,411 INFO L82 PathProgramCache]: Analyzing trace with hash 1776064200, now seen corresponding path program 1 times [2018-10-27 06:07:15,411 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:07:15,411 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:07:15,412 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:07:15,412 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:07:15,412 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:07:15,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:07:15,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:07:15,451 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:07:15,451 INFO L82 PathProgramCache]: Analyzing trace with hash -1639730676, now seen corresponding path program 1 times [2018-10-27 06:07:15,451 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:07:15,451 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:07:15,452 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:07:15,452 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:07:15,452 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:07:15,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:07:15,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:07:15,465 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:07:15,465 INFO L82 PathProgramCache]: Analyzing trace with hash 1271486035, now seen corresponding path program 1 times [2018-10-27 06:07:15,465 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:07:15,465 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:07:15,466 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:07:15,466 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:07:15,466 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:07:15,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:07:15,606 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 06:07:15,606 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-27 06:07:15,607 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-10-27 06:07:15,685 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-27 06:07:15,685 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-10-27 06:07:15,685 INFO L87 Difference]: Start difference. First operand 40 states and 44 transitions. cyclomatic complexity: 6 Second operand 6 states. [2018-10-27 06:07:15,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 06:07:15,730 INFO L93 Difference]: Finished difference Result 40 states and 43 transitions. [2018-10-27 06:07:15,731 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-27 06:07:15,731 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 40 states and 43 transitions. [2018-10-27 06:07:15,731 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 20 [2018-10-27 06:07:15,732 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 40 states to 40 states and 43 transitions. [2018-10-27 06:07:15,732 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 30 [2018-10-27 06:07:15,732 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 30 [2018-10-27 06:07:15,732 INFO L73 IsDeterministic]: Start isDeterministic. Operand 40 states and 43 transitions. [2018-10-27 06:07:15,732 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-10-27 06:07:15,733 INFO L705 BuchiCegarLoop]: Abstraction has 40 states and 43 transitions. [2018-10-27 06:07:15,733 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states and 43 transitions. [2018-10-27 06:07:15,734 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2018-10-27 06:07:15,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2018-10-27 06:07:15,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 43 transitions. [2018-10-27 06:07:15,735 INFO L728 BuchiCegarLoop]: Abstraction has 40 states and 43 transitions. [2018-10-27 06:07:15,735 INFO L608 BuchiCegarLoop]: Abstraction has 40 states and 43 transitions. [2018-10-27 06:07:15,735 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2018-10-27 06:07:15,735 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 40 states and 43 transitions. [2018-10-27 06:07:15,739 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 20 [2018-10-27 06:07:15,739 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-10-27 06:07:15,739 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-10-27 06:07:15,739 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 06:07:15,740 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 06:07:15,740 INFO L793 eck$LassoCheckResult]: Stem: 590#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 584#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet13, main_#t~nondet14, main_#t~ret15;assume { :begin_inline_test_fun } true;test_fun_#in~x, test_fun_#in~y := main_#t~nondet13, main_#t~nondet14;havoc test_fun_#res;havoc test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset, test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset, test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset, test_fun_#t~mem8, test_fun_#t~mem9, test_fun_#t~mem10, test_fun_#t~mem11, test_fun_#t~mem5, test_fun_#t~mem6, test_fun_#t~short7, test_fun_#t~mem12, test_fun_~x, test_fun_~y, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, test_fun_~c~0.base, test_fun_~c~0.offset;test_fun_~x := test_fun_#in~x;test_fun_~y := test_fun_#in~y;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset := test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset := test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;test_fun_~c~0.base, test_fun_~c~0.offset := test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset; 585#L552 SUMMARY for call write~int(test_fun_~x, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L552 591#L552-1 SUMMARY for call write~int(test_fun_~y, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L552-1 586#L553 SUMMARY for call write~int(0, test_fun_~c~0.base, test_fun_~c~0.offset, 4); srcloc: L553 587#L559-3 assume true; 571#L555 SUMMARY for call test_fun_#t~mem5 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L555 580#L555-1 test_fun_#t~short7 := test_fun_#t~mem5 > 0; 582#L555-2 assume !test_fun_#t~short7; 588#L555-4 [2018-10-27 06:07:15,740 INFO L795 eck$LassoCheckResult]: Loop: 588#L555-4 SUMMARY for call test_fun_#t~mem6 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L555-4 592#L555-5 test_fun_#t~short7 := test_fun_#t~mem6 > 0; 593#L555-6 assume !!test_fun_#t~short7;havoc test_fun_#t~mem6;havoc test_fun_#t~mem5;havoc test_fun_#t~short7; 598#L556 SUMMARY for call test_fun_#t~mem8 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L556 597#L556-1 assume !(test_fun_#t~mem8 > 0);havoc test_fun_#t~mem8; 596#L559 SUMMARY for call test_fun_#t~mem10 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L559 562#L559-1 assume test_fun_#t~mem10 > 0;havoc test_fun_#t~mem10; 563#L560 SUMMARY for call test_fun_#t~mem11 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L560 594#L560-1 SUMMARY for call write~int(test_fun_#t~mem11 - 1, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L560-1 564#L560-2 havoc test_fun_#t~mem11; 565#L559-3 assume true; 601#L555 SUMMARY for call test_fun_#t~mem5 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L555 600#L555-1 test_fun_#t~short7 := test_fun_#t~mem5 > 0; 599#L555-2 assume !test_fun_#t~short7; 588#L555-4 [2018-10-27 06:07:15,740 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:07:15,740 INFO L82 PathProgramCache]: Analyzing trace with hash 1776064200, now seen corresponding path program 2 times [2018-10-27 06:07:15,740 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:07:15,740 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:07:15,741 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:07:15,741 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:07:15,742 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:07:15,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:07:15,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:07:15,762 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:07:15,763 INFO L82 PathProgramCache]: Analyzing trace with hash 1189356237, now seen corresponding path program 1 times [2018-10-27 06:07:15,763 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:07:15,763 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:07:15,764 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:07:15,764 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-27 06:07:15,764 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:07:15,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:07:15,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:07:15,776 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:07:15,776 INFO L82 PathProgramCache]: Analyzing trace with hash -1450061484, now seen corresponding path program 1 times [2018-10-27 06:07:15,777 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:07:15,777 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:07:15,777 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:07:15,777 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:07:15,778 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:07:15,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:07:15,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:07:16,024 WARN L179 SmtUtils]: Spent 221.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 51 [2018-10-27 06:07:16,332 WARN L179 SmtUtils]: Spent 286.00 ms on a formula simplification. DAG size of input: 121 DAG size of output: 109 [2018-10-27 06:07:16,449 WARN L179 SmtUtils]: Spent 116.00 ms on a formula simplification that was a NOOP. DAG size: 103 [2018-10-27 06:07:16,451 INFO L214 LassoAnalysis]: Preferences: [2018-10-27 06:07:16,451 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-10-27 06:07:16,451 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-10-27 06:07:16,451 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-10-27 06:07:16,451 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-10-27 06:07:16,451 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-10-27 06:07:16,451 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-10-27 06:07:16,451 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-10-27 06:07:16,451 INFO L131 ssoRankerPreferences]: Filename of dumped script: b.12-alloca_true-termination_true-no-overflow.c.i_Iteration5_Lasso [2018-10-27 06:07:16,452 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-10-27 06:07:16,452 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-10-27 06:07:16,454 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:07:16,460 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:07:16,461 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:07:16,463 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:07:16,465 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:07:16,467 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:07:16,747 WARN L179 SmtUtils]: Spent 205.00 ms on a formula simplification. DAG size of input: 114 DAG size of output: 99 [2018-10-27 06:07:16,932 WARN L179 SmtUtils]: Spent 177.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 70 [2018-10-27 06:07:16,932 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:07:16,934 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:07:16,935 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:07:16,936 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:07:16,939 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:07:16,944 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:07:16,946 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:07:16,947 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:07:16,949 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:07:16,950 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:07:16,951 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:07:16,953 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:07:16,954 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:07:17,376 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-10-27 06:07:17,376 INFO L496 LassoAnalysis]: Using template 'affine'. [2018-10-27 06:07:17,376 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:07:17,377 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:07:17,377 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:07:17,377 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:07:17,377 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:07:17,377 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:07:17,378 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:07:17,378 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:07:17,382 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:07:17,382 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:07:17,383 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:07:17,383 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:07:17,383 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:07:17,383 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:07:17,384 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:07:17,384 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:07:17,385 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:07:17,386 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-10-27 06:07:17,386 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:07:17,386 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:07:17,386 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:07:17,386 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:07:17,391 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:07:17,392 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:07:17,392 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:07:17,392 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:07:17,393 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-10-27 06:07:17,394 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:07:17,394 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:07:17,394 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:07:17,394 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:07:17,395 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:07:17,395 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:07:17,397 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:07:17,397 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-10-27 06:07:17,397 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:07:17,397 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:07:17,397 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:07:17,398 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:07:17,398 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:07:17,398 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:07:17,405 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:07:17,406 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-10-27 06:07:17,406 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:07:17,406 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:07:17,406 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:07:17,406 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:07:17,410 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:07:17,410 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:07:17,411 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:07:17,412 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:07:17,413 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:07:17,413 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:07:17,413 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:07:17,413 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:07:17,414 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:07:17,414 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:07:17,423 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:07:17,423 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-10-27 06:07:17,424 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:07:17,424 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-10-27 06:07:17,424 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:07:17,424 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:07:17,425 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-10-27 06:07:17,425 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:07:17,432 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:07:17,433 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-10-27 06:07:17,433 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:07:17,433 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:07:17,433 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:07:17,434 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:07:17,434 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:07:17,434 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:07:17,438 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:07:17,439 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-10-27 06:07:17,439 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:07:17,439 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:07:17,439 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:07:17,439 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:07:17,440 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:07:17,440 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:07:17,442 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:07:17,442 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-10-27 06:07:17,447 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:07:17,447 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-10-27 06:07:17,447 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:07:17,447 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:07:17,448 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-10-27 06:07:17,448 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:07:17,453 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:07:17,454 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-10-27 06:07:17,454 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:07:17,454 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:07:17,454 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:07:17,454 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:07:17,455 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:07:17,455 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:07:17,457 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:07:17,457 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-10-27 06:07:17,457 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:07:17,458 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:07:17,458 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:07:17,458 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:07:17,465 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:07:17,466 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:07:17,482 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:07:17,483 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-10-27 06:07:17,483 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:07:17,483 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:07:17,483 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:07:17,484 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:07:17,484 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:07:17,484 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:07:17,486 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:07:17,489 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-10-27 06:07:17,490 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:07:17,491 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:07:17,491 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:07:17,492 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:07:17,493 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:07:17,493 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:07:17,499 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:07:17,499 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-10-27 06:07:17,499 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:07:17,500 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-10-27 06:07:17,500 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:07:17,500 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:07:17,500 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-10-27 06:07:17,501 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:07:17,507 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:07:17,507 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-10-27 06:07:17,507 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:07:17,507 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:07:17,508 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:07:17,508 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:07:17,508 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:07:17,509 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:07:17,516 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-10-27 06:07:17,520 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-10-27 06:07:17,520 INFO L444 ModelExtractionUtils]: 13 out of 16 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-10-27 06:07:17,520 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-10-27 06:07:17,521 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-10-27 06:07:17,521 INFO L517 LassoAnalysis]: Proved termination. [2018-10-27 06:07:17,521 INFO L519 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_test_fun_~y_ref~0.base) ULTIMATE.start_test_fun_~y_ref~0.offset)_2) = 1*v_rep(select (select #memory_int ULTIMATE.start_test_fun_~y_ref~0.base) ULTIMATE.start_test_fun_~y_ref~0.offset)_2 Supporting invariants [] [2018-10-27 06:07:17,680 INFO L297 tatePredicateManager]: 23 out of 23 supporting invariants were superfluous and have been removed [2018-10-27 06:07:17,680 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-10-27 06:07:17,689 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:07:17,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:07:17,699 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 06:07:17,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:07:17,706 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 06:07:17,904 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 06:07:17,905 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 35 treesize of output 34 [2018-10-27 06:07:17,910 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 25 [2018-10-27 06:07:17,911 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 06:07:17,920 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 06:07:17,925 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-27 06:07:17,925 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:35, output treesize:13 [2018-10-27 06:07:17,936 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 06:07:17,936 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 6 loop predicates [2018-10-27 06:07:17,937 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 40 states and 43 transitions. cyclomatic complexity: 5 Second operand 7 states. [2018-10-27 06:07:18,024 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 40 states and 43 transitions. cyclomatic complexity: 5. Second operand 7 states. Result 80 states and 85 transitions. Complement of second has 15 states. [2018-10-27 06:07:18,025 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 8 states 1 stem states 6 non-accepting loop states 1 accepting loop states [2018-10-27 06:07:18,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-10-27 06:07:18,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 37 transitions. [2018-10-27 06:07:18,026 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 37 transitions. Stem has 9 letters. Loop has 14 letters. [2018-10-27 06:07:18,026 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-10-27 06:07:18,026 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 37 transitions. Stem has 23 letters. Loop has 14 letters. [2018-10-27 06:07:18,028 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-10-27 06:07:18,028 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 37 transitions. Stem has 9 letters. Loop has 28 letters. [2018-10-27 06:07:18,029 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-10-27 06:07:18,029 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 80 states and 85 transitions. [2018-10-27 06:07:18,030 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 20 [2018-10-27 06:07:18,030 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 80 states to 65 states and 69 transitions. [2018-10-27 06:07:18,030 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 39 [2018-10-27 06:07:18,030 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 40 [2018-10-27 06:07:18,031 INFO L73 IsDeterministic]: Start isDeterministic. Operand 65 states and 69 transitions. [2018-10-27 06:07:18,031 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-10-27 06:07:18,031 INFO L705 BuchiCegarLoop]: Abstraction has 65 states and 69 transitions. [2018-10-27 06:07:18,031 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states and 69 transitions. [2018-10-27 06:07:18,032 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 59. [2018-10-27 06:07:18,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2018-10-27 06:07:18,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 63 transitions. [2018-10-27 06:07:18,033 INFO L728 BuchiCegarLoop]: Abstraction has 59 states and 63 transitions. [2018-10-27 06:07:18,033 INFO L608 BuchiCegarLoop]: Abstraction has 59 states and 63 transitions. [2018-10-27 06:07:18,033 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2018-10-27 06:07:18,034 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 59 states and 63 transitions. [2018-10-27 06:07:18,034 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 20 [2018-10-27 06:07:18,034 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-10-27 06:07:18,034 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-10-27 06:07:18,038 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 06:07:18,038 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 06:07:18,039 INFO L793 eck$LassoCheckResult]: Stem: 917#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 911#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet13, main_#t~nondet14, main_#t~ret15;assume { :begin_inline_test_fun } true;test_fun_#in~x, test_fun_#in~y := main_#t~nondet13, main_#t~nondet14;havoc test_fun_#res;havoc test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset, test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset, test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset, test_fun_#t~mem8, test_fun_#t~mem9, test_fun_#t~mem10, test_fun_#t~mem11, test_fun_#t~mem5, test_fun_#t~mem6, test_fun_#t~short7, test_fun_#t~mem12, test_fun_~x, test_fun_~y, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, test_fun_~c~0.base, test_fun_~c~0.offset;test_fun_~x := test_fun_#in~x;test_fun_~y := test_fun_#in~y;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset := test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset := test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;test_fun_~c~0.base, test_fun_~c~0.offset := test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset; 912#L552 SUMMARY for call write~int(test_fun_~x, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L552 918#L552-1 SUMMARY for call write~int(test_fun_~y, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L552-1 913#L553 SUMMARY for call write~int(0, test_fun_~c~0.base, test_fun_~c~0.offset, 4); srcloc: L553 914#L559-3 assume true; 935#L555 SUMMARY for call test_fun_#t~mem5 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L555 941#L555-1 test_fun_#t~short7 := test_fun_#t~mem5 > 0; 939#L555-2 assume !test_fun_#t~short7; 919#L555-4 SUMMARY for call test_fun_#t~mem6 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L555-4 920#L555-5 test_fun_#t~short7 := test_fun_#t~mem6 > 0; 923#L555-6 assume !!test_fun_#t~short7;havoc test_fun_#t~mem6;havoc test_fun_#t~mem5;havoc test_fun_#t~short7; 930#L556 SUMMARY for call test_fun_#t~mem8 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L556 929#L556-1 assume !(test_fun_#t~mem8 > 0);havoc test_fun_#t~mem8; 928#L559 SUMMARY for call test_fun_#t~mem10 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L559 886#L559-1 assume test_fun_#t~mem10 > 0;havoc test_fun_#t~mem10; 887#L560 SUMMARY for call test_fun_#t~mem11 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L560 925#L560-1 SUMMARY for call write~int(test_fun_#t~mem11 - 1, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L560-1 890#L560-2 havoc test_fun_#t~mem11; 892#L559-3 assume true; 897#L555 SUMMARY for call test_fun_#t~mem5 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L555 905#L555-1 test_fun_#t~short7 := test_fun_#t~mem5 > 0; 909#L555-2 assume test_fun_#t~short7; 915#L555-6 [2018-10-27 06:07:18,039 INFO L795 eck$LassoCheckResult]: Loop: 915#L555-6 assume !!test_fun_#t~short7;havoc test_fun_#t~mem6;havoc test_fun_#t~mem5;havoc test_fun_#t~short7; 899#L556 SUMMARY for call test_fun_#t~mem8 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L556 900#L556-1 assume test_fun_#t~mem8 > 0;havoc test_fun_#t~mem8; 893#L557 SUMMARY for call test_fun_#t~mem9 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L557 894#L557-1 SUMMARY for call write~int(test_fun_#t~mem9 - 1, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L557-1 903#L557-2 havoc test_fun_#t~mem9; 889#L559-3 assume true; 942#L555 SUMMARY for call test_fun_#t~mem5 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L555 940#L555-1 test_fun_#t~short7 := test_fun_#t~mem5 > 0; 938#L555-2 assume test_fun_#t~short7; 915#L555-6 [2018-10-27 06:07:18,039 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:07:18,039 INFO L82 PathProgramCache]: Analyzing trace with hash -1450061486, now seen corresponding path program 1 times [2018-10-27 06:07:18,039 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:07:18,039 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:07:18,040 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:07:18,040 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:07:18,040 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:07:18,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:07:18,511 WARN L179 SmtUtils]: Spent 140.00 ms on a formula simplification that was a NOOP. DAG size: 13 [2018-10-27 06:07:18,884 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 06:07:18,885 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 06:07:18,885 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b9d79254-3769-4dea-8ea0-143bdf22461a/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-10-27 06:07:18,894 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:07:18,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:07:18,920 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 06:07:18,973 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 5 treesize of output 1 [2018-10-27 06:07:18,973 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-27 06:07:18,975 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 06:07:18,975 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:8, output treesize:4 [2018-10-27 06:07:19,010 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 21 treesize of output 22 [2018-10-27 06:07:19,012 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-10-27 06:07:19,013 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 06:07:19,017 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 06:07:19,021 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-27 06:07:19,021 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:25, output treesize:7 [2018-10-27 06:07:19,038 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-10-27 06:07:19,043 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2018-10-27 06:07:19,043 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 06:07:19,045 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 06:07:19,046 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-27 06:07:19,047 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:15, output treesize:3 [2018-10-27 06:07:19,048 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 06:07:19,075 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-27 06:07:19,076 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 9 [2018-10-27 06:07:19,076 INFO L798 eck$LassoCheckResult]: stem already infeasible [2018-10-27 06:07:19,076 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:07:19,076 INFO L82 PathProgramCache]: Analyzing trace with hash -1389463223, now seen corresponding path program 2 times [2018-10-27 06:07:19,076 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:07:19,076 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:07:19,077 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:07:19,077 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:07:19,077 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:07:19,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:07:19,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:07:19,383 WARN L179 SmtUtils]: Spent 295.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 34 [2018-10-27 06:07:19,393 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-27 06:07:19,393 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2018-10-27 06:07:19,393 INFO L87 Difference]: Start difference. First operand 59 states and 63 transitions. cyclomatic complexity: 7 Second operand 10 states. [2018-10-27 06:07:19,508 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 06:07:19,509 INFO L93 Difference]: Finished difference Result 39 states and 41 transitions. [2018-10-27 06:07:19,509 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-10-27 06:07:19,509 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 39 states and 41 transitions. [2018-10-27 06:07:19,510 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-10-27 06:07:19,510 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 39 states to 0 states and 0 transitions. [2018-10-27 06:07:19,510 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2018-10-27 06:07:19,510 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2018-10-27 06:07:19,510 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2018-10-27 06:07:19,510 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-10-27 06:07:19,510 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-10-27 06:07:19,510 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-10-27 06:07:19,510 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-10-27 06:07:19,510 INFO L442 BuchiCegarLoop]: ======== Iteration 7============ [2018-10-27 06:07:19,511 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2018-10-27 06:07:19,511 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-10-27 06:07:19,511 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2018-10-27 06:07:19,517 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 27.10 06:07:19 BoogieIcfgContainer [2018-10-27 06:07:19,517 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-10-27 06:07:19,517 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-10-27 06:07:19,518 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-10-27 06:07:19,518 INFO L276 PluginConnector]: Witness Printer initialized [2018-10-27 06:07:19,518 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.10 06:07:11" (3/4) ... [2018-10-27 06:07:19,521 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-10-27 06:07:19,521 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-10-27 06:07:19,522 INFO L168 Benchmark]: Toolchain (without parser) took 9399.80 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 295.7 MB). Free memory was 957.0 MB in the beginning and 986.8 MB in the end (delta: -29.8 MB). Peak memory consumption was 265.9 MB. Max. memory is 11.5 GB. [2018-10-27 06:07:19,522 INFO L168 Benchmark]: CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 985.4 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-10-27 06:07:19,525 INFO L168 Benchmark]: CACSL2BoogieTranslator took 380.62 ms. Allocated memory is still 1.0 GB. Free memory was 957.0 MB in the beginning and 935.5 MB in the end (delta: 21.5 MB). Peak memory consumption was 21.5 MB. Max. memory is 11.5 GB. [2018-10-27 06:07:19,525 INFO L168 Benchmark]: Boogie Procedure Inliner took 108.72 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 180.4 MB). Free memory was 935.5 MB in the beginning and 1.2 GB in the end (delta: -242.4 MB). Peak memory consumption was 15.8 MB. Max. memory is 11.5 GB. [2018-10-27 06:07:19,526 INFO L168 Benchmark]: Boogie Preprocessor took 43.00 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 3.3 MB). Peak memory consumption was 3.3 MB. Max. memory is 11.5 GB. [2018-10-27 06:07:19,526 INFO L168 Benchmark]: RCFGBuilder took 617.79 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 22.4 MB). Peak memory consumption was 22.4 MB. Max. memory is 11.5 GB. [2018-10-27 06:07:19,527 INFO L168 Benchmark]: BuchiAutomizer took 8241.95 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 115.3 MB). Free memory was 1.2 GB in the beginning and 986.8 MB in the end (delta: 165.3 MB). Peak memory consumption was 280.7 MB. Max. memory is 11.5 GB. [2018-10-27 06:07:19,527 INFO L168 Benchmark]: Witness Printer took 3.56 ms. Allocated memory is still 1.3 GB. Free memory is still 986.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-10-27 06:07:19,530 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 985.4 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 380.62 ms. Allocated memory is still 1.0 GB. Free memory was 957.0 MB in the beginning and 935.5 MB in the end (delta: 21.5 MB). Peak memory consumption was 21.5 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 108.72 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 180.4 MB). Free memory was 935.5 MB in the beginning and 1.2 GB in the end (delta: -242.4 MB). Peak memory consumption was 15.8 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 43.00 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 3.3 MB). Peak memory consumption was 3.3 MB. Max. memory is 11.5 GB. * RCFGBuilder took 617.79 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 22.4 MB). Peak memory consumption was 22.4 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 8241.95 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 115.3 MB). Free memory was 1.2 GB in the beginning and 986.8 MB in the end (delta: 165.3 MB). Peak memory consumption was 280.7 MB. Max. memory is 11.5 GB. * Witness Printer took 3.56 ms. Allocated memory is still 1.3 GB. Free memory is still 986.8 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 - 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 6 terminating modules (4 trivial, 2 deterministic, 0 nondeterministic). One deterministic module has affine ranking function unknown-#memory_int-unknown[x_ref][x_ref] and consists of 8 locations. One deterministic module has affine ranking function unknown-#memory_int-unknown[y_ref][y_ref] and consists of 8 locations. 4 modules have a trivial ranking function, the largest among these consists of 10 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 8.2s and 7 iterations. TraceHistogramMax:2. Analysis of lassos took 6.6s. Construction of modules took 0.5s. Büchi inclusion checks took 0.9s. Highest rank in rank-based complementation 3. Minimization of det autom 2. Minimization of nondet autom 4. Automata minimization 0.0s AutomataMinimizationTime, 5 MinimizatonAttempts, 23 StatesRemovedByMinimization, 4 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 59 states and ocurred in iteration 5. Nontrivial modules had stage [2, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 106 SDtfs, 172 SDslu, 185 SDs, 0 SdLazy, 340 SolverSat, 35 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.5s Time LassoAnalysisResults: nont0 unkn0 SFLI2 SFLT0 conc1 concLT0 SILN0 SILU1 SILI0 SILT0 lasso2 LassoPreprocessingBenchmarks: Lassos: inital259 mio100 ax107 hnf99 lsp88 ukn84 mio100 lsp39 div100 bol100 ite100 ukn100 eq193 hnf87 smp92 dnf100 smp100 tf100 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 14ms 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...