./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/termination-memory-alloca/b.14-alloca.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version cad46833 Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_5bdee8d9-134f-439c-a744-beeeb6c901a6/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_5bdee8d9-134f-439c-a744-beeeb6c901a6/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_5bdee8d9-134f-439c-a744-beeeb6c901a6/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_5bdee8d9-134f-439c-a744-beeeb6c901a6/bin/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/termination-memory-alloca/b.14-alloca.i -s /tmp/vcloud-vcloud-master/worker/working_dir_5bdee8d9-134f-439c-a744-beeeb6c901a6/bin/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_5bdee8d9-134f-439c-a744-beeeb6c901a6/bin/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 14310793a2daa3bf62d53b5cef67b6406903d242 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-cad4683 [2019-10-22 08:55:50,562 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-22 08:55:50,565 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-22 08:55:50,574 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-22 08:55:50,575 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-22 08:55:50,576 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-22 08:55:50,577 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-22 08:55:50,579 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-22 08:55:50,582 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-22 08:55:50,584 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-22 08:55:50,586 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-22 08:55:50,587 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-22 08:55:50,593 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-22 08:55:50,594 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-22 08:55:50,594 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-22 08:55:50,595 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-22 08:55:50,595 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-22 08:55:50,596 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-22 08:55:50,599 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-22 08:55:50,600 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-22 08:55:50,601 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-22 08:55:50,602 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-22 08:55:50,603 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-22 08:55:50,607 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-22 08:55:50,609 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-22 08:55:50,610 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-22 08:55:50,610 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-22 08:55:50,611 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-22 08:55:50,612 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-22 08:55:50,613 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-22 08:55:50,614 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-22 08:55:50,615 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-22 08:55:50,615 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-22 08:55:50,616 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-22 08:55:50,617 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-22 08:55:50,618 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-22 08:55:50,619 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-22 08:55:50,619 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-22 08:55:50,619 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-22 08:55:50,620 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-22 08:55:50,620 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-22 08:55:50,621 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_5bdee8d9-134f-439c-a744-beeeb6c901a6/bin/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf [2019-10-22 08:55:50,635 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-22 08:55:50,645 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-22 08:55:50,646 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-22 08:55:50,646 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-22 08:55:50,646 INFO L138 SettingsManager]: * Use SBE=true [2019-10-22 08:55:50,647 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-10-22 08:55:50,647 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-10-22 08:55:50,647 INFO L138 SettingsManager]: * Use old map elimination=false [2019-10-22 08:55:50,648 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2019-10-22 08:55:50,648 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2019-10-22 08:55:50,648 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-10-22 08:55:50,649 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-22 08:55:50,649 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-10-22 08:55:50,649 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-22 08:55:50,649 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-22 08:55:50,649 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-10-22 08:55:50,649 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-10-22 08:55:50,649 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-10-22 08:55:50,650 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-22 08:55:50,650 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-10-22 08:55:50,650 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-22 08:55:50,650 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-10-22 08:55:50,650 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-22 08:55:50,650 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-22 08:55:50,650 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-10-22 08:55:50,651 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-22 08:55:50,651 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-22 08:55:50,651 INFO L138 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-10-22 08:55:50,653 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-10-22 08:55:50,653 INFO L138 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_5bdee8d9-134f-439c-a744-beeeb6c901a6/bin/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 -> 14310793a2daa3bf62d53b5cef67b6406903d242 [2019-10-22 08:55:50,683 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-22 08:55:50,693 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-22 08:55:50,696 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-22 08:55:50,698 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-22 08:55:50,698 INFO L275 PluginConnector]: CDTParser initialized [2019-10-22 08:55:50,699 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_5bdee8d9-134f-439c-a744-beeeb6c901a6/bin/uautomizer/../../sv-benchmarks/c/termination-memory-alloca/b.14-alloca.i [2019-10-22 08:55:50,749 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_5bdee8d9-134f-439c-a744-beeeb6c901a6/bin/uautomizer/data/5d2353ef6/fee5f00378184afeb67230fcfd1063ae/FLAGec9d0cf75 [2019-10-22 08:55:51,185 INFO L306 CDTParser]: Found 1 translation units. [2019-10-22 08:55:51,186 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_5bdee8d9-134f-439c-a744-beeeb6c901a6/sv-benchmarks/c/termination-memory-alloca/b.14-alloca.i [2019-10-22 08:55:51,195 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_5bdee8d9-134f-439c-a744-beeeb6c901a6/bin/uautomizer/data/5d2353ef6/fee5f00378184afeb67230fcfd1063ae/FLAGec9d0cf75 [2019-10-22 08:55:51,206 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_5bdee8d9-134f-439c-a744-beeeb6c901a6/bin/uautomizer/data/5d2353ef6/fee5f00378184afeb67230fcfd1063ae [2019-10-22 08:55:51,210 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-22 08:55:51,211 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-10-22 08:55:51,212 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-22 08:55:51,212 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-22 08:55:51,215 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-22 08:55:51,216 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.10 08:55:51" (1/1) ... [2019-10-22 08:55:51,218 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@659a3c1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:55:51, skipping insertion in model container [2019-10-22 08:55:51,218 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.10 08:55:51" (1/1) ... [2019-10-22 08:55:51,225 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-22 08:55:51,253 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-22 08:55:51,547 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-22 08:55:51,557 INFO L188 MainTranslator]: Completed pre-run [2019-10-22 08:55:51,593 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-22 08:55:51,627 INFO L192 MainTranslator]: Completed translation [2019-10-22 08:55:51,627 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:55:51 WrapperNode [2019-10-22 08:55:51,627 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-22 08:55:51,628 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-10-22 08:55:51,628 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-10-22 08:55:51,628 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-10-22 08:55:51,636 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:55:51" (1/1) ... [2019-10-22 08:55:51,648 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:55:51" (1/1) ... [2019-10-22 08:55:51,666 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-10-22 08:55:51,666 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-22 08:55:51,666 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-22 08:55:51,666 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-22 08:55:51,674 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:55:51" (1/1) ... [2019-10-22 08:55:51,675 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:55:51" (1/1) ... [2019-10-22 08:55:51,677 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:55:51" (1/1) ... [2019-10-22 08:55:51,677 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:55:51" (1/1) ... [2019-10-22 08:55:51,681 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:55:51" (1/1) ... [2019-10-22 08:55:51,685 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:55:51" (1/1) ... [2019-10-22 08:55:51,686 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:55:51" (1/1) ... [2019-10-22 08:55:51,688 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-22 08:55:51,688 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-22 08:55:51,689 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-22 08:55:51,689 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-22 08:55:51,690 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:55:51" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_5bdee8d9-134f-439c-a744-beeeb6c901a6/bin/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 [2019-10-22 08:55:51,746 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-10-22 08:55:51,746 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-10-22 08:55:51,746 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-10-22 08:55:51,747 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-10-22 08:55:51,747 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-22 08:55:51,747 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-22 08:55:52,030 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-22 08:55:52,030 INFO L284 CfgBuilder]: Removed 8 assume(true) statements. [2019-10-22 08:55:52,031 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 08:55:52 BoogieIcfgContainer [2019-10-22 08:55:52,031 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-22 08:55:52,032 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-10-22 08:55:52,032 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-10-22 08:55:52,035 INFO L275 PluginConnector]: BuchiAutomizer initialized [2019-10-22 08:55:52,036 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-10-22 08:55:52,036 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 22.10 08:55:51" (1/3) ... [2019-10-22 08:55:52,037 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@3f991378 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 22.10 08:55:52, skipping insertion in model container [2019-10-22 08:55:52,037 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-10-22 08:55:52,038 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:55:51" (2/3) ... [2019-10-22 08:55:52,038 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@3f991378 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 22.10 08:55:52, skipping insertion in model container [2019-10-22 08:55:52,038 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-10-22 08:55:52,038 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 08:55:52" (3/3) ... [2019-10-22 08:55:52,040 INFO L371 chiAutomizerObserver]: Analyzing ICFG b.14-alloca.i [2019-10-22 08:55:52,085 INFO L356 BuchiCegarLoop]: Interprodecural is true [2019-10-22 08:55:52,085 INFO L357 BuchiCegarLoop]: Hoare is false [2019-10-22 08:55:52,085 INFO L358 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-10-22 08:55:52,085 INFO L359 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-22 08:55:52,086 INFO L360 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-22 08:55:52,086 INFO L361 BuchiCegarLoop]: Difference is false [2019-10-22 08:55:52,086 INFO L362 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-22 08:55:52,086 INFO L365 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-10-22 08:55:52,099 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 12 states. [2019-10-22 08:55:52,124 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2019-10-22 08:55:52,124 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 08:55:52,124 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 08:55:52,133 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2019-10-22 08:55:52,133 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2019-10-22 08:55:52,133 INFO L424 BuchiCegarLoop]: ======== Iteration 1============ [2019-10-22 08:55:52,133 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 12 states. [2019-10-22 08:55:52,134 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2019-10-22 08:55:52,135 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 08:55:52,135 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 08:55:52,135 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2019-10-22 08:55:52,137 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2019-10-22 08:55:52,143 INFO L791 eck$LassoCheckResult]: Stem: 5#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 3#L-1true havoc main_#res;havoc main_#t~nondet14, main_#t~nondet15, main_#t~ret16;test_fun_#in~x, test_fun_#in~y := main_#t~nondet14, main_#t~nondet15;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~mem10, test_fun_#t~mem11, test_fun_#t~mem12, test_fun_#t~mem9, test_fun_#t~mem5, test_fun_#t~mem6, test_fun_#t~mem7, test_fun_#t~short8, test_fun_#t~mem13, 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;call test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset := #Ultimate.allocOnStack(4);test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset := test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset;call test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset := #Ultimate.allocOnStack(4);test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset := test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset;call test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset := #Ultimate.allocOnStack(4);test_fun_~c~0.base, test_fun_~c~0.offset := test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset;call write~int(test_fun_~x, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call write~int(test_fun_~y, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call write~int(0, test_fun_~c~0.base, test_fun_~c~0.offset, 4); 6#L556-4true [2019-10-22 08:55:52,144 INFO L793 eck$LassoCheckResult]: Loop: 6#L556-4true call test_fun_#t~mem5 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem6 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);test_fun_#t~short8 := test_fun_#t~mem5 == test_fun_#t~mem6; 14#L555-1true assume test_fun_#t~short8;call test_fun_#t~mem7 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);test_fun_#t~short8 := test_fun_#t~mem7 > 0; 7#L555-3true assume !!test_fun_#t~short8;havoc test_fun_#t~mem5;havoc test_fun_#t~mem6;havoc test_fun_#t~short8;havoc test_fun_#t~mem7; 4#L556-3true assume !true; 6#L556-4true [2019-10-22 08:55:52,149 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:55:52,150 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2019-10-22 08:55:52,157 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:55:52,157 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1978027459] [2019-10-22 08:55:52,158 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:55:52,158 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:55:52,158 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:55:52,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:55:52,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:55:52,329 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:55:52,330 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:55:52,330 INFO L82 PathProgramCache]: Analyzing trace with hash 1142256, now seen corresponding path program 1 times [2019-10-22 08:55:52,330 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:55:52,330 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1663213673] [2019-10-22 08:55:52,330 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:55:52,331 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:55:52,331 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:55:52,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:55:52,364 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:55:52,364 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1663213673] [2019-10-22 08:55:52,365 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:55:52,365 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-10-22 08:55:52,365 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [216589905] [2019-10-22 08:55:52,370 INFO L808 eck$LassoCheckResult]: loop already infeasible [2019-10-22 08:55:52,371 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:55:52,380 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-10-22 08:55:52,381 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-10-22 08:55:52,382 INFO L87 Difference]: Start difference. First operand 12 states. Second operand 2 states. [2019-10-22 08:55:52,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:55:52,387 INFO L93 Difference]: Finished difference Result 12 states and 14 transitions. [2019-10-22 08:55:52,387 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-10-22 08:55:52,388 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 12 states and 14 transitions. [2019-10-22 08:55:52,389 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2019-10-22 08:55:52,393 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 12 states to 7 states and 9 transitions. [2019-10-22 08:55:52,394 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 7 [2019-10-22 08:55:52,394 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 7 [2019-10-22 08:55:52,395 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 9 transitions. [2019-10-22 08:55:52,395 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-10-22 08:55:52,395 INFO L688 BuchiCegarLoop]: Abstraction has 7 states and 9 transitions. [2019-10-22 08:55:52,412 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7 states and 9 transitions. [2019-10-22 08:55:52,419 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7 to 7. [2019-10-22 08:55:52,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2019-10-22 08:55:52,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 9 transitions. [2019-10-22 08:55:52,421 INFO L711 BuchiCegarLoop]: Abstraction has 7 states and 9 transitions. [2019-10-22 08:55:52,421 INFO L591 BuchiCegarLoop]: Abstraction has 7 states and 9 transitions. [2019-10-22 08:55:52,421 INFO L424 BuchiCegarLoop]: ======== Iteration 2============ [2019-10-22 08:55:52,421 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 7 states and 9 transitions. [2019-10-22 08:55:52,422 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2019-10-22 08:55:52,422 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 08:55:52,422 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 08:55:52,422 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2019-10-22 08:55:52,422 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2019-10-22 08:55:52,423 INFO L791 eck$LassoCheckResult]: Stem: 36#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 32#L-1 havoc main_#res;havoc main_#t~nondet14, main_#t~nondet15, main_#t~ret16;test_fun_#in~x, test_fun_#in~y := main_#t~nondet14, main_#t~nondet15;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~mem10, test_fun_#t~mem11, test_fun_#t~mem12, test_fun_#t~mem9, test_fun_#t~mem5, test_fun_#t~mem6, test_fun_#t~mem7, test_fun_#t~short8, test_fun_#t~mem13, 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;call test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset := #Ultimate.allocOnStack(4);test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset := test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset;call test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset := #Ultimate.allocOnStack(4);test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset := test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset;call test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset := #Ultimate.allocOnStack(4);test_fun_~c~0.base, test_fun_~c~0.offset := test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset;call write~int(test_fun_~x, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call write~int(test_fun_~y, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call write~int(0, test_fun_~c~0.base, test_fun_~c~0.offset, 4); 33#L556-4 [2019-10-22 08:55:52,423 INFO L793 eck$LassoCheckResult]: Loop: 33#L556-4 call test_fun_#t~mem5 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem6 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);test_fun_#t~short8 := test_fun_#t~mem5 == test_fun_#t~mem6; 37#L555-1 assume test_fun_#t~short8;call test_fun_#t~mem7 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);test_fun_#t~short8 := test_fun_#t~mem7 > 0; 38#L555-3 assume !!test_fun_#t~short8;havoc test_fun_#t~mem5;havoc test_fun_#t~mem6;havoc test_fun_#t~short8;havoc test_fun_#t~mem7; 34#L556-3 call test_fun_#t~mem9 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); 35#L556-1 assume !(test_fun_#t~mem9 > 0);havoc test_fun_#t~mem9; 33#L556-4 [2019-10-22 08:55:52,423 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:55:52,423 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 2 times [2019-10-22 08:55:52,423 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:55:52,424 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1576179044] [2019-10-22 08:55:52,424 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:55:52,424 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:55:52,424 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:55:52,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:55:52,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:55:52,474 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:55:52,474 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:55:52,475 INFO L82 PathProgramCache]: Analyzing trace with hash 35409745, now seen corresponding path program 1 times [2019-10-22 08:55:52,475 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:55:52,475 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [453053835] [2019-10-22 08:55:52,475 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:55:52,475 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:55:52,475 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:55:52,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:55:52,569 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:55:52,570 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [453053835] [2019-10-22 08:55:52,570 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:55:52,570 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-22 08:55:52,570 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1440369553] [2019-10-22 08:55:52,570 INFO L808 eck$LassoCheckResult]: loop already infeasible [2019-10-22 08:55:52,575 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:55:52,575 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-22 08:55:52,576 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-10-22 08:55:52,576 INFO L87 Difference]: Start difference. First operand 7 states and 9 transitions. cyclomatic complexity: 3 Second operand 6 states. [2019-10-22 08:55:52,691 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:55:52,691 INFO L93 Difference]: Finished difference Result 9 states and 11 transitions. [2019-10-22 08:55:52,691 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-22 08:55:52,692 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 9 states and 11 transitions. [2019-10-22 08:55:52,692 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2019-10-22 08:55:52,693 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 9 states to 9 states and 11 transitions. [2019-10-22 08:55:52,693 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9 [2019-10-22 08:55:52,693 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 9 [2019-10-22 08:55:52,693 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 11 transitions. [2019-10-22 08:55:52,693 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-10-22 08:55:52,693 INFO L688 BuchiCegarLoop]: Abstraction has 9 states and 11 transitions. [2019-10-22 08:55:52,694 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states and 11 transitions. [2019-10-22 08:55:52,694 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 9. [2019-10-22 08:55:52,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2019-10-22 08:55:52,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 11 transitions. [2019-10-22 08:55:52,695 INFO L711 BuchiCegarLoop]: Abstraction has 9 states and 11 transitions. [2019-10-22 08:55:52,695 INFO L591 BuchiCegarLoop]: Abstraction has 9 states and 11 transitions. [2019-10-22 08:55:52,695 INFO L424 BuchiCegarLoop]: ======== Iteration 3============ [2019-10-22 08:55:52,695 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 9 states and 11 transitions. [2019-10-22 08:55:52,696 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2019-10-22 08:55:52,696 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 08:55:52,696 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 08:55:52,696 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2019-10-22 08:55:52,696 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [2, 1, 1, 1, 1, 1] [2019-10-22 08:55:52,697 INFO L791 eck$LassoCheckResult]: Stem: 67#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 63#L-1 havoc main_#res;havoc main_#t~nondet14, main_#t~nondet15, main_#t~ret16;test_fun_#in~x, test_fun_#in~y := main_#t~nondet14, main_#t~nondet15;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~mem10, test_fun_#t~mem11, test_fun_#t~mem12, test_fun_#t~mem9, test_fun_#t~mem5, test_fun_#t~mem6, test_fun_#t~mem7, test_fun_#t~short8, test_fun_#t~mem13, 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;call test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset := #Ultimate.allocOnStack(4);test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset := test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset;call test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset := #Ultimate.allocOnStack(4);test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset := test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset;call test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset := #Ultimate.allocOnStack(4);test_fun_~c~0.base, test_fun_~c~0.offset := test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset;call write~int(test_fun_~x, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call write~int(test_fun_~y, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call write~int(0, test_fun_~c~0.base, test_fun_~c~0.offset, 4); 64#L556-4 [2019-10-22 08:55:52,697 INFO L793 eck$LassoCheckResult]: Loop: 64#L556-4 call test_fun_#t~mem5 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem6 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);test_fun_#t~short8 := test_fun_#t~mem5 == test_fun_#t~mem6; 68#L555-1 assume test_fun_#t~short8;call test_fun_#t~mem7 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);test_fun_#t~short8 := test_fun_#t~mem7 > 0; 69#L555-3 assume !!test_fun_#t~short8;havoc test_fun_#t~mem5;havoc test_fun_#t~mem6;havoc test_fun_#t~short8;havoc test_fun_#t~mem7; 65#L556-3 call test_fun_#t~mem9 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); 66#L556-1 assume !!(test_fun_#t~mem9 > 0);havoc test_fun_#t~mem9;call test_fun_#t~mem10 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call write~int(test_fun_#t~mem10 - 1, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);havoc test_fun_#t~mem10;call test_fun_#t~mem11 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call write~int(test_fun_#t~mem11 - 1, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);havoc test_fun_#t~mem11;call test_fun_#t~mem12 := read~int(test_fun_~c~0.base, test_fun_~c~0.offset, 4);call write~int(1 + test_fun_#t~mem12, test_fun_~c~0.base, test_fun_~c~0.offset, 4);havoc test_fun_#t~mem12; 70#L556-3 call test_fun_#t~mem9 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); 71#L556-1 assume !(test_fun_#t~mem9 > 0);havoc test_fun_#t~mem9; 64#L556-4 [2019-10-22 08:55:52,697 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:55:52,697 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 3 times [2019-10-22 08:55:52,697 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:55:52,698 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1468146956] [2019-10-22 08:55:52,698 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:55:52,698 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:55:52,698 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:55:52,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:55:52,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:55:52,753 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:55:52,753 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:55:52,753 INFO L82 PathProgramCache]: Analyzing trace with hash -330970762, now seen corresponding path program 1 times [2019-10-22 08:55:52,753 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:55:52,754 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [439846827] [2019-10-22 08:55:52,754 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:55:52,754 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:55:52,754 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:55:52,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:55:52,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:55:52,785 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:55:52,786 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:55:52,786 INFO L82 PathProgramCache]: Analyzing trace with hash 1215326068, now seen corresponding path program 1 times [2019-10-22 08:55:52,791 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:55:52,791 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [76760445] [2019-10-22 08:55:52,792 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:55:52,792 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:55:52,792 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:55:52,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:55:52,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:55:52,868 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:55:53,173 WARN L191 SmtUtils]: Spent 300.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 69 [2019-10-22 08:55:53,605 WARN L191 SmtUtils]: Spent 270.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 85 [2019-10-22 08:55:53,744 WARN L191 SmtUtils]: Spent 137.00 ms on a formula simplification that was a NOOP. DAG size: 83 [2019-10-22 08:55:53,757 INFO L210 LassoAnalysis]: Preferences: [2019-10-22 08:55:53,758 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-10-22 08:55:53,758 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-10-22 08:55:53,758 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-10-22 08:55:53,758 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-10-22 08:55:53,758 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 08:55:53,759 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-10-22 08:55:53,759 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-10-22 08:55:53,759 INFO L131 ssoRankerPreferences]: Filename of dumped script: b.14-alloca.i_Iteration3_Lasso [2019-10-22 08:55:53,760 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-10-22 08:55:53,760 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-10-22 08:55:53,794 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:55:53,801 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:55:53,807 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:55:53,815 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:55:53,817 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:55:53,820 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:55:53,827 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:55:53,830 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:55:53,833 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:55:53,836 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:55:53,839 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:55:53,842 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:55:53,845 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:55:53,848 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:55:54,198 WARN L191 SmtUtils]: Spent 239.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 77 [2019-10-22 08:55:54,339 WARN L191 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 62 [2019-10-22 08:55:54,340 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:55:54,343 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:55:54,344 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:55:54,347 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:55:55,002 WARN L191 SmtUtils]: Spent 283.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 38 [2019-10-22 08:55:55,046 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-10-22 08:55:55,051 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-10-22 08:55:55,053 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:55:55,054 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:55:55,054 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:55:55,055 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:55:55,055 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:55:55,055 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:55:55,057 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:55:55,057 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:55:55,058 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:55:55,059 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:55:55,059 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:55:55,060 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:55:55,060 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:55:55,060 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:55:55,060 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:55:55,060 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:55:55,061 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:55:55,061 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:55:55,062 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:55:55,062 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:55:55,062 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:55:55,063 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:55:55,063 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:55:55,063 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:55:55,063 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:55:55,063 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:55:55,064 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:55:55,065 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:55:55,065 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:55:55,065 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:55:55,065 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:55:55,066 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:55:55,066 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:55:55,066 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:55:55,066 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:55:55,067 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:55:55,068 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:55:55,068 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:55:55,068 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:55:55,068 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:55:55,069 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:55:55,069 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:55:55,069 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:55:55,069 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:55:55,070 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:55:55,070 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:55:55,071 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:55:55,071 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:55:55,071 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:55:55,071 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:55:55,073 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:55:55,073 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:55:55,076 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:55:55,076 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:55:55,077 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:55:55,077 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:55:55,077 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:55:55,077 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:55:55,077 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:55:55,078 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:55:55,078 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:55:55,079 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:55:55,079 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:55:55,079 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:55:55,080 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:55:55,080 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:55:55,080 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:55:55,080 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:55:55,080 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:55:55,081 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:55:55,081 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:55:55,082 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:55:55,082 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:55:55,082 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:55:55,082 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:55:55,083 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:55:55,083 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:55:55,083 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:55:55,083 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:55:55,084 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:55:55,084 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:55:55,085 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:55:55,085 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:55:55,085 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:55:55,085 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:55:55,087 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:55:55,087 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:55:55,090 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:55:55,090 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:55:55,091 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:55:55,091 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:55:55,091 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:55:55,091 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:55:55,091 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:55:55,092 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:55:55,092 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:55:55,093 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:55:55,093 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:55:55,093 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:55:55,094 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:55:55,094 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:55:55,094 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:55:55,095 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:55:55,095 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:55:55,097 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:55:55,098 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:55:55,098 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:55:55,098 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:55:55,099 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:55:55,099 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:55:55,099 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:55:55,099 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:55:55,099 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:55:55,100 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:55:55,100 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:55:55,101 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:55:55,101 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:55:55,101 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:55:55,101 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:55:55,105 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:55:55,105 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:55:55,122 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-10-22 08:55:55,135 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-10-22 08:55:55,135 INFO L444 ModelExtractionUtils]: 25 out of 28 variables were initially zero. Simplification set additionally 1 variables to zero. [2019-10-22 08:55:55,137 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-10-22 08:55:55,139 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-10-22 08:55:55,139 INFO L510 LassoAnalysis]: Proved termination. [2019-10-22 08:55:55,139 INFO L512 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)_1) = 1*v_rep(select (select #memory_int ULTIMATE.start_test_fun_~y_ref~0.base) ULTIMATE.start_test_fun_~y_ref~0.offset)_1 Supporting invariants [] [2019-10-22 08:55:55,217 INFO L297 tatePredicateManager]: 24 out of 24 supporting invariants were superfluous and have been removed [2019-10-22 08:55:55,222 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-10-22 08:55:55,235 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:55:55,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:55:55,251 INFO L256 TraceCheckSpWp]: Trace formula consists of 60 conjuncts, 2 conjunts are in the unsatisfiable core [2019-10-22 08:55:55,252 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:55:55,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:55:55,276 INFO L256 TraceCheckSpWp]: Trace formula consists of 51 conjuncts, 6 conjunts are in the unsatisfiable core [2019-10-22 08:55:55,277 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:55:55,307 INFO L375 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 7 [2019-10-22 08:55:55,309 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-22 08:55:55,312 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 08:55:55,312 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-22 08:55:55,313 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:3 [2019-10-22 08:55:55,336 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:55:55,338 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 4 loop predicates [2019-10-22 08:55:55,339 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 9 states and 11 transitions. cyclomatic complexity: 3 Second operand 6 states. [2019-10-22 08:55:55,440 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 9 states and 11 transitions. cyclomatic complexity: 3. Second operand 6 states. Result 16 states and 21 transitions. Complement of second has 10 states. [2019-10-22 08:55:55,441 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 1 stem states 4 non-accepting loop states 1 accepting loop states [2019-10-22 08:55:55,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2019-10-22 08:55:55,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 11 transitions. [2019-10-22 08:55:55,443 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 11 transitions. Stem has 2 letters. Loop has 7 letters. [2019-10-22 08:55:55,444 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 08:55:55,444 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 11 transitions. Stem has 9 letters. Loop has 7 letters. [2019-10-22 08:55:55,444 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 08:55:55,444 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 11 transitions. Stem has 2 letters. Loop has 14 letters. [2019-10-22 08:55:55,444 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 08:55:55,444 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 16 states and 21 transitions. [2019-10-22 08:55:55,445 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-10-22 08:55:55,445 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 16 states to 16 states and 21 transitions. [2019-10-22 08:55:55,446 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 8 [2019-10-22 08:55:55,446 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 9 [2019-10-22 08:55:55,446 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 21 transitions. [2019-10-22 08:55:55,446 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-10-22 08:55:55,446 INFO L688 BuchiCegarLoop]: Abstraction has 16 states and 21 transitions. [2019-10-22 08:55:55,446 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states and 21 transitions. [2019-10-22 08:55:55,447 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 14. [2019-10-22 08:55:55,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2019-10-22 08:55:55,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 19 transitions. [2019-10-22 08:55:55,448 INFO L711 BuchiCegarLoop]: Abstraction has 14 states and 19 transitions. [2019-10-22 08:55:55,448 INFO L591 BuchiCegarLoop]: Abstraction has 14 states and 19 transitions. [2019-10-22 08:55:55,448 INFO L424 BuchiCegarLoop]: ======== Iteration 4============ [2019-10-22 08:55:55,448 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 14 states and 19 transitions. [2019-10-22 08:55:55,448 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-10-22 08:55:55,449 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 08:55:55,449 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 08:55:55,449 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2019-10-22 08:55:55,449 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-10-22 08:55:55,449 INFO L791 eck$LassoCheckResult]: Stem: 251#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 245#L-1 havoc main_#res;havoc main_#t~nondet14, main_#t~nondet15, main_#t~ret16;test_fun_#in~x, test_fun_#in~y := main_#t~nondet14, main_#t~nondet15;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~mem10, test_fun_#t~mem11, test_fun_#t~mem12, test_fun_#t~mem9, test_fun_#t~mem5, test_fun_#t~mem6, test_fun_#t~mem7, test_fun_#t~short8, test_fun_#t~mem13, 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;call test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset := #Ultimate.allocOnStack(4);test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset := test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset;call test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset := #Ultimate.allocOnStack(4);test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset := test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset;call test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset := #Ultimate.allocOnStack(4);test_fun_~c~0.base, test_fun_~c~0.offset := test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset;call write~int(test_fun_~x, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call write~int(test_fun_~y, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call write~int(0, test_fun_~c~0.base, test_fun_~c~0.offset, 4); 246#L556-4 call test_fun_#t~mem5 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem6 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);test_fun_#t~short8 := test_fun_#t~mem5 == test_fun_#t~mem6; 253#L555-1 assume !test_fun_#t~short8; 255#L555-3 assume !!test_fun_#t~short8;havoc test_fun_#t~mem5;havoc test_fun_#t~mem6;havoc test_fun_#t~short8;havoc test_fun_#t~mem7; 247#L556-3 [2019-10-22 08:55:55,449 INFO L793 eck$LassoCheckResult]: Loop: 247#L556-3 call test_fun_#t~mem9 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); 248#L556-1 assume !!(test_fun_#t~mem9 > 0);havoc test_fun_#t~mem9;call test_fun_#t~mem10 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call write~int(test_fun_#t~mem10 - 1, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);havoc test_fun_#t~mem10;call test_fun_#t~mem11 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call write~int(test_fun_#t~mem11 - 1, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);havoc test_fun_#t~mem11;call test_fun_#t~mem12 := read~int(test_fun_~c~0.base, test_fun_~c~0.offset, 4);call write~int(1 + test_fun_#t~mem12, test_fun_~c~0.base, test_fun_~c~0.offset, 4);havoc test_fun_#t~mem12; 247#L556-3 [2019-10-22 08:55:55,450 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:55:55,450 INFO L82 PathProgramCache]: Analyzing trace with hash 28695850, now seen corresponding path program 1 times [2019-10-22 08:55:55,450 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:55:55,450 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1684587151] [2019-10-22 08:55:55,450 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:55:55,450 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:55:55,450 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:55:55,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:55:55,467 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:55:55,467 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1684587151] [2019-10-22 08:55:55,467 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:55:55,467 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-10-22 08:55:55,468 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [685736989] [2019-10-22 08:55:55,468 INFO L796 eck$LassoCheckResult]: stem already infeasible [2019-10-22 08:55:55,468 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:55:55,468 INFO L82 PathProgramCache]: Analyzing trace with hash 1702, now seen corresponding path program 1 times [2019-10-22 08:55:55,468 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:55:55,468 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1944939720] [2019-10-22 08:55:55,469 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:55:55,469 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:55:55,469 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:55:55,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:55:55,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:55:55,488 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:55:55,571 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:55:55,572 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 08:55:55,572 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 08:55:55,572 INFO L87 Difference]: Start difference. First operand 14 states and 19 transitions. cyclomatic complexity: 7 Second operand 3 states. [2019-10-22 08:55:55,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:55:55,579 INFO L93 Difference]: Finished difference Result 16 states and 19 transitions. [2019-10-22 08:55:55,580 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 08:55:55,580 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 16 states and 19 transitions. [2019-10-22 08:55:55,580 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-10-22 08:55:55,581 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 16 states to 14 states and 17 transitions. [2019-10-22 08:55:55,581 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 7 [2019-10-22 08:55:55,581 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 7 [2019-10-22 08:55:55,581 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 17 transitions. [2019-10-22 08:55:55,581 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-10-22 08:55:55,581 INFO L688 BuchiCegarLoop]: Abstraction has 14 states and 17 transitions. [2019-10-22 08:55:55,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states and 17 transitions. [2019-10-22 08:55:55,582 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2019-10-22 08:55:55,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2019-10-22 08:55:55,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 17 transitions. [2019-10-22 08:55:55,583 INFO L711 BuchiCegarLoop]: Abstraction has 14 states and 17 transitions. [2019-10-22 08:55:55,583 INFO L591 BuchiCegarLoop]: Abstraction has 14 states and 17 transitions. [2019-10-22 08:55:55,583 INFO L424 BuchiCegarLoop]: ======== Iteration 5============ [2019-10-22 08:55:55,583 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 14 states and 17 transitions. [2019-10-22 08:55:55,583 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-10-22 08:55:55,583 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 08:55:55,584 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 08:55:55,584 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2019-10-22 08:55:55,584 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-10-22 08:55:55,584 INFO L791 eck$LassoCheckResult]: Stem: 287#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 281#L-1 havoc main_#res;havoc main_#t~nondet14, main_#t~nondet15, main_#t~ret16;test_fun_#in~x, test_fun_#in~y := main_#t~nondet14, main_#t~nondet15;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~mem10, test_fun_#t~mem11, test_fun_#t~mem12, test_fun_#t~mem9, test_fun_#t~mem5, test_fun_#t~mem6, test_fun_#t~mem7, test_fun_#t~short8, test_fun_#t~mem13, 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;call test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset := #Ultimate.allocOnStack(4);test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset := test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset;call test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset := #Ultimate.allocOnStack(4);test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset := test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset;call test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset := #Ultimate.allocOnStack(4);test_fun_~c~0.base, test_fun_~c~0.offset := test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset;call write~int(test_fun_~x, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call write~int(test_fun_~y, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call write~int(0, test_fun_~c~0.base, test_fun_~c~0.offset, 4); 282#L556-4 call test_fun_#t~mem5 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem6 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);test_fun_#t~short8 := test_fun_#t~mem5 == test_fun_#t~mem6; 289#L555-1 assume test_fun_#t~short8;call test_fun_#t~mem7 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);test_fun_#t~short8 := test_fun_#t~mem7 > 0; 291#L555-3 assume !!test_fun_#t~short8;havoc test_fun_#t~mem5;havoc test_fun_#t~mem6;havoc test_fun_#t~short8;havoc test_fun_#t~mem7; 283#L556-3 [2019-10-22 08:55:55,584 INFO L793 eck$LassoCheckResult]: Loop: 283#L556-3 call test_fun_#t~mem9 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); 284#L556-1 assume !!(test_fun_#t~mem9 > 0);havoc test_fun_#t~mem9;call test_fun_#t~mem10 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call write~int(test_fun_#t~mem10 - 1, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);havoc test_fun_#t~mem10;call test_fun_#t~mem11 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call write~int(test_fun_#t~mem11 - 1, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);havoc test_fun_#t~mem11;call test_fun_#t~mem12 := read~int(test_fun_~c~0.base, test_fun_~c~0.offset, 4);call write~int(1 + test_fun_#t~mem12, test_fun_~c~0.base, test_fun_~c~0.offset, 4);havoc test_fun_#t~mem12; 283#L556-3 [2019-10-22 08:55:55,584 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:55:55,584 INFO L82 PathProgramCache]: Analyzing trace with hash 28695788, now seen corresponding path program 1 times [2019-10-22 08:55:55,585 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:55:55,585 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [189919791] [2019-10-22 08:55:55,585 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:55:55,585 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:55:55,585 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:55:55,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:55:55,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:55:55,621 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:55:55,621 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:55:55,622 INFO L82 PathProgramCache]: Analyzing trace with hash 1702, now seen corresponding path program 2 times [2019-10-22 08:55:55,622 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:55:55,622 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2083285165] [2019-10-22 08:55:55,622 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:55:55,622 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:55:55,622 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:55:55,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:55:55,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:55:55,638 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:55:55,638 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:55:55,638 INFO L82 PathProgramCache]: Analyzing trace with hash 1806849233, now seen corresponding path program 1 times [2019-10-22 08:55:55,639 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:55:55,639 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [891208620] [2019-10-22 08:55:55,639 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:55:55,639 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:55:55,639 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:55:55,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:55:55,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:55:55,704 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:55:56,186 WARN L191 SmtUtils]: Spent 400.00 ms on a formula simplification. DAG size of input: 124 DAG size of output: 102 [2019-10-22 08:55:56,292 WARN L191 SmtUtils]: Spent 102.00 ms on a formula simplification that was a NOOP. DAG size: 92 [2019-10-22 08:55:56,294 INFO L210 LassoAnalysis]: Preferences: [2019-10-22 08:55:56,295 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-10-22 08:55:56,295 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-10-22 08:55:56,295 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-10-22 08:55:56,295 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-10-22 08:55:56,295 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 08:55:56,295 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-10-22 08:55:56,295 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-10-22 08:55:56,295 INFO L131 ssoRankerPreferences]: Filename of dumped script: b.14-alloca.i_Iteration5_Lasso [2019-10-22 08:55:56,295 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-10-22 08:55:56,295 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-10-22 08:55:56,300 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:55:56,303 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:55:56,305 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:55:56,306 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:55:56,308 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:55:56,309 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:55:56,310 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:55:56,312 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:55:56,313 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:55:56,314 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:55:56,316 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:55:56,318 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:55:56,319 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:55:56,321 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:55:56,566 WARN L191 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 77 [2019-10-22 08:55:56,642 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:55:56,643 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:55:56,644 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:55:56,646 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:55:56,647 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:55:57,222 WARN L191 SmtUtils]: Spent 258.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 38 [2019-10-22 08:55:57,237 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-10-22 08:55:57,237 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-10-22 08:55:57,238 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:55:57,239 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:55:57,239 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:55:57,239 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:55:57,239 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:55:57,239 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:55:57,240 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:55:57,240 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:55:57,240 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:55:57,241 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:55:57,241 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:55:57,241 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:55:57,242 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:55:57,242 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:55:57,243 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:55:57,243 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:55:57,245 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:55:57,245 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:55:57,245 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:55:57,246 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:55:57,246 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:55:57,246 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:55:57,246 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:55:57,255 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:55:57,255 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:55:57,255 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:55:57,256 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:55:57,256 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:55:57,256 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:55:57,256 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:55:57,257 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:55:57,257 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:55:57,257 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:55:57,264 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:55:57,264 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:55:57,265 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:55:57,265 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:55:57,265 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:55:57,265 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:55:57,265 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:55:57,266 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:55:57,266 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:55:57,266 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:55:57,266 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:55:57,267 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:55:57,267 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:55:57,267 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:55:57,272 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:55:57,272 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:55:57,272 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:55:57,272 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:55:57,273 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:55:57,273 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:55:57,273 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:55:57,274 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:55:57,274 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:55:57,274 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:55:57,274 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:55:57,274 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:55:57,274 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:55:57,275 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:55:57,275 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:55:57,276 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:55:57,276 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:55:57,276 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:55:57,276 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:55:57,276 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:55:57,276 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:55:57,276 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:55:57,277 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:55:57,277 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:55:57,277 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:55:57,277 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:55:57,277 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:55:57,278 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:55:57,278 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:55:57,278 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:55:57,282 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:55:57,282 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:55:57,285 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:55:57,286 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:55:57,287 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:55:57,287 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:55:57,287 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:55:57,288 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:55:57,289 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:55:57,289 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:55:57,290 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:55:57,290 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:55:57,290 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:55:57,290 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:55:57,290 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:55:57,290 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:55:57,290 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:55:57,291 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:55:57,291 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:55:57,300 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:55:57,300 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:55:57,301 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:55:57,301 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:55:57,301 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:55:57,301 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:55:57,301 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:55:57,302 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:55:57,302 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:55:57,303 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:55:57,303 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:55:57,303 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:55:57,303 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:55:57,304 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:55:57,304 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:55:57,305 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:55:57,306 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:55:57,306 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:55:57,306 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:55:57,306 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:55:57,306 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:55:57,308 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:55:57,308 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:55:57,313 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:55:57,313 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:55:57,314 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:55:57,314 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:55:57,314 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:55:57,314 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:55:57,315 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:55:57,315 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:55:57,320 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:55:57,322 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:55:57,324 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:55:57,324 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:55:57,325 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:55:57,325 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:55:57,326 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:55:57,326 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:55:57,355 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-10-22 08:55:57,365 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-10-22 08:55:57,365 INFO L444 ModelExtractionUtils]: 22 out of 28 variables were initially zero. Simplification set additionally 4 variables to zero. [2019-10-22 08:55:57,366 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-10-22 08:55:57,366 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-10-22 08:55:57,367 INFO L510 LassoAnalysis]: Proved termination. [2019-10-22 08:55:57,367 INFO L512 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 [] [2019-10-22 08:55:57,433 INFO L297 tatePredicateManager]: 23 out of 24 supporting invariants were superfluous and have been removed [2019-10-22 08:55:57,435 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-10-22 08:55:57,454 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:55:57,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:55:57,468 INFO L256 TraceCheckSpWp]: Trace formula consists of 82 conjuncts, 22 conjunts are in the unsatisfiable core [2019-10-22 08:55:57,469 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:55:57,484 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 08:55:57,484 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 15 [2019-10-22 08:55:57,484 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-22 08:55:57,493 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 08:55:57,537 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 08:55:57,537 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 59 treesize of output 92 [2019-10-22 08:55:57,538 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-22 08:55:57,580 INFO L567 ElimStorePlain]: treesize reduction 51, result has 46.9 percent of original size [2019-10-22 08:55:57,580 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-22 08:55:57,581 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:74, output treesize:12 [2019-10-22 08:55:57,597 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 08:55:57,626 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 08:55:57,674 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 08:55:57,675 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 22 treesize of output 42 [2019-10-22 08:55:57,675 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 08:55:57,676 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 08:55:57,676 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 08:55:57,678 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 08:55:57,678 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 08:55:57,679 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 08:55:57,682 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-22 08:55:57,703 INFO L567 ElimStorePlain]: treesize reduction 1, result has 97.0 percent of original size [2019-10-22 08:55:57,722 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 08:55:57,723 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 27 treesize of output 43 [2019-10-22 08:55:57,723 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 08:55:57,724 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 08:55:57,724 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 08:55:57,725 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 08:55:57,726 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 08:55:57,727 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-22 08:55:57,735 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 08:55:57,736 INFO L496 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2019-10-22 08:55:57,736 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 6 variables, input treesize:51, output treesize:19 [2019-10-22 08:55:57,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:55:57,784 INFO L256 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 6 conjunts are in the unsatisfiable core [2019-10-22 08:55:57,784 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:55:57,809 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:55:57,809 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.4 stem predicates 2 loop predicates [2019-10-22 08:55:57,809 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 14 states and 17 transitions. cyclomatic complexity: 5 Second operand 6 states. [2019-10-22 08:55:57,989 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 14 states and 17 transitions. cyclomatic complexity: 5. Second operand 6 states. Result 32 states and 37 transitions. Complement of second has 9 states. [2019-10-22 08:55:57,991 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 7 states 4 stem states 2 non-accepting loop states 1 accepting loop states [2019-10-22 08:55:57,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2019-10-22 08:55:57,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 12 transitions. [2019-10-22 08:55:57,992 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 12 transitions. Stem has 5 letters. Loop has 2 letters. [2019-10-22 08:55:57,992 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 08:55:57,992 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 12 transitions. Stem has 7 letters. Loop has 2 letters. [2019-10-22 08:55:57,993 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 08:55:57,993 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 12 transitions. Stem has 5 letters. Loop has 4 letters. [2019-10-22 08:55:57,993 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 08:55:57,993 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 32 states and 37 transitions. [2019-10-22 08:55:57,994 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-10-22 08:55:57,994 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 32 states to 0 states and 0 transitions. [2019-10-22 08:55:57,994 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2019-10-22 08:55:57,994 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2019-10-22 08:55:57,994 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2019-10-22 08:55:57,994 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-10-22 08:55:57,994 INFO L688 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-10-22 08:55:57,994 INFO L711 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-10-22 08:55:57,994 INFO L591 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-10-22 08:55:57,994 INFO L424 BuchiCegarLoop]: ======== Iteration 6============ [2019-10-22 08:55:57,995 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2019-10-22 08:55:57,995 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-10-22 08:55:57,995 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2019-10-22 08:55:58,002 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 22.10 08:55:58 BoogieIcfgContainer [2019-10-22 08:55:58,002 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2019-10-22 08:55:58,002 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-10-22 08:55:58,002 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-10-22 08:55:58,003 INFO L275 PluginConnector]: Witness Printer initialized [2019-10-22 08:55:58,003 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 08:55:52" (3/4) ... [2019-10-22 08:55:58,006 INFO L140 WitnessPrinter]: No result that supports witness generation found [2019-10-22 08:55:58,006 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-10-22 08:55:58,008 INFO L168 Benchmark]: Toolchain (without parser) took 6797.21 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 174.1 MB). Free memory was 946.1 MB in the beginning and 1.0 GB in the end (delta: -75.4 MB). Peak memory consumption was 98.6 MB. Max. memory is 11.5 GB. [2019-10-22 08:55:58,008 INFO L168 Benchmark]: CDTParser took 0.14 ms. Allocated memory is still 1.0 GB. Free memory is still 967.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-10-22 08:55:58,008 INFO L168 Benchmark]: CACSL2BoogieTranslator took 415.95 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 114.8 MB). Free memory was 946.1 MB in the beginning and 1.1 GB in the end (delta: -152.5 MB). Peak memory consumption was 18.5 MB. Max. memory is 11.5 GB. [2019-10-22 08:55:58,009 INFO L168 Benchmark]: Boogie Procedure Inliner took 38.16 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-10-22 08:55:58,009 INFO L168 Benchmark]: Boogie Preprocessor took 21.94 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-10-22 08:55:58,009 INFO L168 Benchmark]: RCFGBuilder took 342.94 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 23.7 MB). Peak memory consumption was 23.7 MB. Max. memory is 11.5 GB. [2019-10-22 08:55:58,010 INFO L168 Benchmark]: BuchiAutomizer took 5970.36 ms. Allocated memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: 59.2 MB). Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 53.3 MB). Peak memory consumption was 112.5 MB. Max. memory is 11.5 GB. [2019-10-22 08:55:58,010 INFO L168 Benchmark]: Witness Printer took 4.21 ms. Allocated memory is still 1.2 GB. Free memory is still 1.0 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-10-22 08:55:58,012 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.14 ms. Allocated memory is still 1.0 GB. Free memory is still 967.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 415.95 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 114.8 MB). Free memory was 946.1 MB in the beginning and 1.1 GB in the end (delta: -152.5 MB). Peak memory consumption was 18.5 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 38.16 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 21.94 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 342.94 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 23.7 MB). Peak memory consumption was 23.7 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 5970.36 ms. Allocated memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: 59.2 MB). Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 53.3 MB). Peak memory consumption was 112.5 MB. Max. memory is 11.5 GB. * Witness Printer took 4.21 ms. Allocated memory is still 1.2 GB. Free memory is still 1.0 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #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 5 terminating modules (3 trivial, 2 deterministic, 0 nondeterministic). One deterministic module has affine ranking function unknown-#memory_int-unknown[y_ref][y_ref] and consists of 6 locations. One deterministic module has affine ranking function unknown-#memory_int-unknown[y_ref][y_ref] and consists of 7 locations. 3 modules have a trivial ranking function, the largest among these consists of 6 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 5.9s and 6 iterations. TraceHistogramMax:2. Analysis of lassos took 4.8s. Construction of modules took 0.1s. Büchi inclusion checks took 0.8s. Highest rank in rank-based complementation 3. Minimization of det autom 3. Minimization of nondet autom 2. Automata minimization 0.0s AutomataMinimizationTime, 4 MinimizatonAttempts, 2 StatesRemovedByMinimization, 1 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 14 states and ocurred in iteration 3. Nontrivial modules had stage [2, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/2 HoareTripleCheckerStatistics: 34 SDtfs, 16 SDslu, 21 SDs, 0 SdLazy, 64 SolverSat, 21 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.1s Time LassoAnalysisResults: nont0 unkn0 SFLI2 SFLT0 conc0 concLT0 SILN0 SILU1 SILI0 SILT0 lasso2 LassoPreprocessingBenchmarks: Lassos: inital452 mio100 ax103 hnf100 lsp94 ukn43 mio100 lsp35 div100 bol100 ite100 ukn100 eq194 hnf87 smp100 dnf293 smp92 tf100 neg92 sie126 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 5ms VariablesStem: 1 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 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...