./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/termination-recursive-malloc/rec_malloc_ex11.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/run_dir_911302a1-35c5-4c8f-bdae-94f218e7b3df/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_911302a1-35c5-4c8f-bdae-94f218e7b3df/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_911302a1-35c5-4c8f-bdae-94f218e7b3df/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_911302a1-35c5-4c8f-bdae-94f218e7b3df/bin/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/termination-recursive-malloc/rec_malloc_ex11.i -s /tmp/vcloud-vcloud-master/worker/run_dir_911302a1-35c5-4c8f-bdae-94f218e7b3df/bin/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_911302a1-35c5-4c8f-bdae-94f218e7b3df/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 2e31c843d33c80f978b3ed5615692b93565f0ae0 ..................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-cad4683 [2019-11-15 23:30:48,709 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-15 23:30:48,711 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-15 23:30:48,724 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-15 23:30:48,725 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-15 23:30:48,726 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-15 23:30:48,727 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-15 23:30:48,736 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-15 23:30:48,740 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-15 23:30:48,744 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-15 23:30:48,745 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-15 23:30:48,746 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-15 23:30:48,746 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-15 23:30:48,747 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-15 23:30:48,748 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-15 23:30:48,749 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-15 23:30:48,749 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-15 23:30:48,750 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-15 23:30:48,752 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-15 23:30:48,755 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-15 23:30:48,759 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-15 23:30:48,761 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-15 23:30:48,764 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-15 23:30:48,764 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-15 23:30:48,769 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-15 23:30:48,769 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-15 23:30:48,770 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-15 23:30:48,771 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-15 23:30:48,772 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-15 23:30:48,773 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-15 23:30:48,773 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-15 23:30:48,774 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-15 23:30:48,775 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-15 23:30:48,775 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-15 23:30:48,777 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-15 23:30:48,777 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-15 23:30:48,778 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-15 23:30:48,778 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-15 23:30:48,778 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-15 23:30:48,779 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-15 23:30:48,780 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-15 23:30:48,781 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_911302a1-35c5-4c8f-bdae-94f218e7b3df/bin/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf [2019-11-15 23:30:48,808 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-15 23:30:48,808 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-15 23:30:48,809 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-15 23:30:48,809 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-15 23:30:48,810 INFO L138 SettingsManager]: * Use SBE=true [2019-11-15 23:30:48,810 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-11-15 23:30:48,810 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-11-15 23:30:48,810 INFO L138 SettingsManager]: * Use old map elimination=false [2019-11-15 23:30:48,810 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2019-11-15 23:30:48,810 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2019-11-15 23:30:48,811 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-11-15 23:30:48,811 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-15 23:30:48,811 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-11-15 23:30:48,811 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-15 23:30:48,811 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-15 23:30:48,811 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-11-15 23:30:48,812 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-11-15 23:30:48,812 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-11-15 23:30:48,812 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-15 23:30:48,812 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-11-15 23:30:48,812 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-15 23:30:48,813 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-11-15 23:30:48,813 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-15 23:30:48,813 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-15 23:30:48,813 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-11-15 23:30:48,813 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-15 23:30:48,813 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-15 23:30:48,814 INFO L138 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-11-15 23:30:48,814 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-11-15 23:30:48,815 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/run_dir_911302a1-35c5-4c8f-bdae-94f218e7b3df/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 -> 2e31c843d33c80f978b3ed5615692b93565f0ae0 [2019-11-15 23:30:48,837 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-15 23:30:48,847 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-15 23:30:48,850 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-15 23:30:48,851 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-15 23:30:48,851 INFO L275 PluginConnector]: CDTParser initialized [2019-11-15 23:30:48,852 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_911302a1-35c5-4c8f-bdae-94f218e7b3df/bin/uautomizer/../../sv-benchmarks/c/termination-recursive-malloc/rec_malloc_ex11.i [2019-11-15 23:30:48,901 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_911302a1-35c5-4c8f-bdae-94f218e7b3df/bin/uautomizer/data/4359b3734/7eb09304f24a4fad8321e7e55a77fbcc/FLAGcf6203f71 [2019-11-15 23:30:49,333 INFO L306 CDTParser]: Found 1 translation units. [2019-11-15 23:30:49,334 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_911302a1-35c5-4c8f-bdae-94f218e7b3df/sv-benchmarks/c/termination-recursive-malloc/rec_malloc_ex11.i [2019-11-15 23:30:49,339 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_911302a1-35c5-4c8f-bdae-94f218e7b3df/bin/uautomizer/data/4359b3734/7eb09304f24a4fad8321e7e55a77fbcc/FLAGcf6203f71 [2019-11-15 23:30:49,352 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_911302a1-35c5-4c8f-bdae-94f218e7b3df/bin/uautomizer/data/4359b3734/7eb09304f24a4fad8321e7e55a77fbcc [2019-11-15 23:30:49,355 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-15 23:30:49,356 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-15 23:30:49,357 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-15 23:30:49,357 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-15 23:30:49,361 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-15 23:30:49,362 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 11:30:49" (1/1) ... [2019-11-15 23:30:49,364 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5db962ca and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:30:49, skipping insertion in model container [2019-11-15 23:30:49,364 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 11:30:49" (1/1) ... [2019-11-15 23:30:49,371 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-15 23:30:49,390 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-15 23:30:49,638 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-15 23:30:49,651 INFO L188 MainTranslator]: Completed pre-run [2019-11-15 23:30:49,670 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-15 23:30:49,685 INFO L192 MainTranslator]: Completed translation [2019-11-15 23:30:49,686 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:30:49 WrapperNode [2019-11-15 23:30:49,686 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-15 23:30:49,687 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-15 23:30:49,687 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-15 23:30:49,687 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-15 23:30:49,695 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:30:49" (1/1) ... [2019-11-15 23:30:49,705 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:30:49" (1/1) ... [2019-11-15 23:30:49,732 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-15 23:30:49,733 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-15 23:30:49,733 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-15 23:30:49,733 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-15 23:30:49,742 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:30:49" (1/1) ... [2019-11-15 23:30:49,743 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:30:49" (1/1) ... [2019-11-15 23:30:49,753 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:30:49" (1/1) ... [2019-11-15 23:30:49,753 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:30:49" (1/1) ... [2019-11-15 23:30:49,762 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:30:49" (1/1) ... [2019-11-15 23:30:49,766 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:30:49" (1/1) ... [2019-11-15 23:30:49,767 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:30:49" (1/1) ... [2019-11-15 23:30:49,769 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-15 23:30:49,770 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-15 23:30:49,770 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-15 23:30:49,770 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-15 23:30:49,771 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:30:49" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_911302a1-35c5-4c8f-bdae-94f218e7b3df/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-11-15 23:30:49,829 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-11-15 23:30:49,830 INFO L130 BoogieDeclarations]: Found specification of procedure rec [2019-11-15 23:30:49,830 INFO L138 BoogieDeclarations]: Found implementation of procedure rec [2019-11-15 23:30:49,830 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-11-15 23:30:49,830 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-15 23:30:49,831 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-15 23:30:49,831 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-11-15 23:30:49,831 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-15 23:30:50,083 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-15 23:30:50,083 INFO L284 CfgBuilder]: Removed 5 assume(true) statements. [2019-11-15 23:30:50,085 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 11:30:50 BoogieIcfgContainer [2019-11-15 23:30:50,085 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-15 23:30:50,085 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-11-15 23:30:50,086 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-11-15 23:30:50,089 INFO L275 PluginConnector]: BuchiAutomizer initialized [2019-11-15 23:30:50,090 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-15 23:30:50,090 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 15.11 11:30:49" (1/3) ... [2019-11-15 23:30:50,091 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@247979d0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 15.11 11:30:50, skipping insertion in model container [2019-11-15 23:30:50,092 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-15 23:30:50,092 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:30:49" (2/3) ... [2019-11-15 23:30:50,092 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@247979d0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 15.11 11:30:50, skipping insertion in model container [2019-11-15 23:30:50,092 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-15 23:30:50,093 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 11:30:50" (3/3) ... [2019-11-15 23:30:50,094 INFO L371 chiAutomizerObserver]: Analyzing ICFG rec_malloc_ex11.i [2019-11-15 23:30:50,137 INFO L356 BuchiCegarLoop]: Interprodecural is true [2019-11-15 23:30:50,137 INFO L357 BuchiCegarLoop]: Hoare is false [2019-11-15 23:30:50,138 INFO L358 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-11-15 23:30:50,138 INFO L359 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-15 23:30:50,138 INFO L360 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-15 23:30:50,138 INFO L361 BuchiCegarLoop]: Difference is false [2019-11-15 23:30:50,138 INFO L362 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-15 23:30:50,139 INFO L365 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-11-15 23:30:50,152 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states. [2019-11-15 23:30:50,194 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 9 [2019-11-15 23:30:50,194 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 23:30:50,194 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 23:30:50,216 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2019-11-15 23:30:50,216 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:30:50,216 INFO L424 BuchiCegarLoop]: ======== Iteration 1============ [2019-11-15 23:30:50,216 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states. [2019-11-15 23:30:50,218 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 9 [2019-11-15 23:30:50,218 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 23:30:50,218 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 23:30:50,219 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2019-11-15 23:30:50,219 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:30:50,239 INFO L791 eck$LassoCheckResult]: Stem: 8#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 5#L-1true havoc main_#res;havoc main_#t~malloc6.base, main_#t~malloc6.offset, main_#t~nondet7, main_#t~malloc9.base, main_#t~malloc9.offset, main_#t~nondet10, main_#t~mem11, main_#t~mem14, main_#t~ret12, main_#t~ite13, main_~pp~0.base, main_~pp~0.offset, main_#t~mem8, main_~qq~0.base, main_~qq~0.offset;call main_#t~malloc6.base, main_#t~malloc6.offset := #Ultimate.allocOnHeap(4);main_~qq~0.base, main_~qq~0.offset := main_#t~malloc6.base, main_#t~malloc6.offset;call write~int(main_#t~nondet7, main_~qq~0.base, main_~qq~0.offset, 4);havoc main_#t~nondet7; 19#L28-3true [2019-11-15 23:30:50,240 INFO L793 eck$LassoCheckResult]: Loop: 19#L28-3true call main_#t~mem8 := read~int(main_~qq~0.base, main_~qq~0.offset, 4); 4#L28-1true assume !!(main_#t~mem8 > 1);havoc main_#t~mem8;call main_#t~malloc9.base, main_#t~malloc9.offset := #Ultimate.allocOnHeap(4);main_~pp~0.base, main_~pp~0.offset := main_#t~malloc9.base, main_#t~malloc9.offset;call write~int(main_#t~nondet10, main_~pp~0.base, main_~pp~0.offset, 4);havoc main_#t~nondet10;call main_#t~mem11 := read~int(main_~pp~0.base, main_~pp~0.offset, 4); 9#L32true assume !(main_#t~mem11 < 0);havoc main_#t~mem11;call main_#t~mem14 := read~int(main_~qq~0.base, main_~qq~0.offset, 4); 20#L36true call main_#t~ret12 := rec(main_~pp~0.base, main_~pp~0.offset);< 3#recENTRYtrue ~op.base, ~op.offset := #in~op.base, #in~op.offset;call #t~mem1 := read~int(~op.base, ~op.offset, 4); 6#L9true assume #t~mem1 < 0;havoc #t~mem1;call #t~mem2 := read~int(~op.base, ~op.offset, 4);~r~0 := #t~mem2;havoc #t~mem2;call ULTIMATE.dealloc(~op.base, ~op.offset);#res := ~r~0; 14#recFINALtrue assume true; 12#recEXITtrue >#44#return; 18#L36-1true assume -1 == main_#t~ret12;main_#t~ite13 := -1; 11#L36-3true call write~int(main_#t~mem14 + main_#t~ite13, main_~qq~0.base, main_~qq~0.offset, 4);havoc main_#t~mem14;havoc main_#t~ret12;havoc main_#t~ite13; 19#L28-3true [2019-11-15 23:30:50,245 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:30:50,245 INFO L82 PathProgramCache]: Analyzing trace with hash 1219, now seen corresponding path program 1 times [2019-11-15 23:30:50,253 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:30:50,253 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1924405322] [2019-11-15 23:30:50,254 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:30:50,254 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:30:50,254 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:30:50,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:30:50,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:30:50,417 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 23:30:50,418 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:30:50,419 INFO L82 PathProgramCache]: Analyzing trace with hash -2107477180, now seen corresponding path program 1 times [2019-11-15 23:30:50,419 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:30:50,419 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [660562837] [2019-11-15 23:30:50,419 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:30:50,419 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:30:50,419 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:30:50,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:30:50,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:30:50,611 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:30:50,612 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [660562837] [2019-11-15 23:30:50,612 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:30:50,612 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-15 23:30:50,613 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1522767650] [2019-11-15 23:30:50,617 INFO L808 eck$LassoCheckResult]: loop already infeasible [2019-11-15 23:30:50,618 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:30:50,628 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-15 23:30:50,628 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-11-15 23:30:50,629 INFO L87 Difference]: Start difference. First operand 18 states. Second operand 7 states. [2019-11-15 23:30:50,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:30:50,791 INFO L93 Difference]: Finished difference Result 20 states and 24 transitions. [2019-11-15 23:30:50,791 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-15 23:30:50,793 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 20 states and 24 transitions. [2019-11-15 23:30:50,795 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 9 [2019-11-15 23:30:50,801 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 20 states to 16 states and 19 transitions. [2019-11-15 23:30:50,803 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 16 [2019-11-15 23:30:50,803 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 16 [2019-11-15 23:30:50,803 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 19 transitions. [2019-11-15 23:30:50,805 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-15 23:30:50,805 INFO L688 BuchiCegarLoop]: Abstraction has 16 states and 19 transitions. [2019-11-15 23:30:50,820 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states and 19 transitions. [2019-11-15 23:30:50,830 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2019-11-15 23:30:50,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2019-11-15 23:30:50,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 19 transitions. [2019-11-15 23:30:50,833 INFO L711 BuchiCegarLoop]: Abstraction has 16 states and 19 transitions. [2019-11-15 23:30:50,833 INFO L591 BuchiCegarLoop]: Abstraction has 16 states and 19 transitions. [2019-11-15 23:30:50,833 INFO L424 BuchiCegarLoop]: ======== Iteration 2============ [2019-11-15 23:30:50,833 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 16 states and 19 transitions. [2019-11-15 23:30:50,834 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 9 [2019-11-15 23:30:50,834 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 23:30:50,834 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 23:30:50,835 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2019-11-15 23:30:50,835 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:30:50,836 INFO L791 eck$LassoCheckResult]: Stem: 66#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 63#L-1 havoc main_#res;havoc main_#t~malloc6.base, main_#t~malloc6.offset, main_#t~nondet7, main_#t~malloc9.base, main_#t~malloc9.offset, main_#t~nondet10, main_#t~mem11, main_#t~mem14, main_#t~ret12, main_#t~ite13, main_~pp~0.base, main_~pp~0.offset, main_#t~mem8, main_~qq~0.base, main_~qq~0.offset;call main_#t~malloc6.base, main_#t~malloc6.offset := #Ultimate.allocOnHeap(4);main_~qq~0.base, main_~qq~0.offset := main_#t~malloc6.base, main_#t~malloc6.offset;call write~int(main_#t~nondet7, main_~qq~0.base, main_~qq~0.offset, 4);havoc main_#t~nondet7; 64#L28-3 [2019-11-15 23:30:50,836 INFO L793 eck$LassoCheckResult]: Loop: 64#L28-3 call main_#t~mem8 := read~int(main_~qq~0.base, main_~qq~0.offset, 4); 61#L28-1 assume !!(main_#t~mem8 > 1);havoc main_#t~mem8;call main_#t~malloc9.base, main_#t~malloc9.offset := #Ultimate.allocOnHeap(4);main_~pp~0.base, main_~pp~0.offset := main_#t~malloc9.base, main_#t~malloc9.offset;call write~int(main_#t~nondet10, main_~pp~0.base, main_~pp~0.offset, 4);havoc main_#t~nondet10;call main_#t~mem11 := read~int(main_~pp~0.base, main_~pp~0.offset, 4); 62#L32 assume !(main_#t~mem11 < 0);havoc main_#t~mem11;call main_#t~mem14 := read~int(main_~qq~0.base, main_~qq~0.offset, 4); 59#L36 call main_#t~ret12 := rec(main_~pp~0.base, main_~pp~0.offset);< 57#recENTRY ~op.base, ~op.offset := #in~op.base, #in~op.offset;call #t~mem1 := read~int(~op.base, ~op.offset, 4); 60#L9 assume !(#t~mem1 < 0);havoc #t~mem1;call #t~malloc3.base, #t~malloc3.offset := #Ultimate.allocOnHeap(4);~ip~0.base, ~ip~0.offset := #t~malloc3.base, #t~malloc3.offset;call #t~mem4 := read~int(~op.base, ~op.offset, 4);call write~int(#t~mem4 - 1, ~ip~0.base, ~ip~0.offset, 4);havoc #t~mem4;call ULTIMATE.dealloc(~op.base, ~op.offset); 58#L19 call #t~ret5 := rec(~ip~0.base, ~ip~0.offset);< 57#recENTRY ~op.base, ~op.offset := #in~op.base, #in~op.offset;call #t~mem1 := read~int(~op.base, ~op.offset, 4); 60#L9 assume #t~mem1 < 0;havoc #t~mem1;call #t~mem2 := read~int(~op.base, ~op.offset, 4);~r~0 := #t~mem2;havoc #t~mem2;call ULTIMATE.dealloc(~op.base, ~op.offset);#res := ~r~0; 65#recFINAL assume true; 70#recEXIT >#42#return; 67#L19-1 #res := #t~ret5;havoc #t~ret5; 68#recFINAL assume true; 72#recEXIT >#44#return; 71#L36-1 assume -1 == main_#t~ret12;main_#t~ite13 := -1; 69#L36-3 call write~int(main_#t~mem14 + main_#t~ite13, main_~qq~0.base, main_~qq~0.offset, 4);havoc main_#t~mem14;havoc main_#t~ret12;havoc main_#t~ite13; 64#L28-3 [2019-11-15 23:30:50,836 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:30:50,836 INFO L82 PathProgramCache]: Analyzing trace with hash 1219, now seen corresponding path program 2 times [2019-11-15 23:30:50,836 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:30:50,837 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [935979568] [2019-11-15 23:30:50,837 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:30:50,837 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:30:50,837 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:30:50,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:30:50,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:30:50,852 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 23:30:50,853 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:30:50,853 INFO L82 PathProgramCache]: Analyzing trace with hash 290320444, now seen corresponding path program 1 times [2019-11-15 23:30:50,853 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:30:50,853 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1921566336] [2019-11-15 23:30:50,854 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:30:50,854 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:30:50,854 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:30:50,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:30:50,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:30:50,969 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 23:30:50,969 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:30:50,970 INFO L82 PathProgramCache]: Analyzing trace with hash -645910274, now seen corresponding path program 1 times [2019-11-15 23:30:50,970 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:30:50,970 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [808182130] [2019-11-15 23:30:50,970 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:30:50,970 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:30:50,971 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:30:51,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:30:51,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:30:51,058 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 23:30:51,630 WARN L191 SmtUtils]: Spent 384.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 92 [2019-11-15 23:30:51,897 WARN L191 SmtUtils]: Spent 148.00 ms on a formula simplification that was a NOOP. DAG size: 83 [2019-11-15 23:30:52,042 WARN L191 SmtUtils]: Spent 138.00 ms on a formula simplification that was a NOOP. DAG size: 77 [2019-11-15 23:30:52,648 WARN L191 SmtUtils]: Spent 601.00 ms on a formula simplification. DAG size of input: 145 DAG size of output: 123 [2019-11-15 23:30:52,784 WARN L191 SmtUtils]: Spent 123.00 ms on a formula simplification that was a NOOP. DAG size: 78 [2019-11-15 23:30:52,877 INFO L210 LassoAnalysis]: Preferences: [2019-11-15 23:30:52,878 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-11-15 23:30:52,878 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-15 23:30:52,878 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-11-15 23:30:52,878 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-11-15 23:30:52,878 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 23:30:52,879 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-15 23:30:52,879 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-11-15 23:30:52,879 INFO L131 ssoRankerPreferences]: Filename of dumped script: rec_malloc_ex11.i_Iteration2_Lasso [2019-11-15 23:30:52,879 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-15 23:30:52,879 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-15 23:30:52,897 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:30:52,907 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:30:52,914 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:30:52,918 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:30:52,922 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:30:52,925 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:30:53,207 WARN L191 SmtUtils]: Spent 166.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 66 [2019-11-15 23:30:53,207 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:30:53,210 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:30:53,212 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:30:53,214 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:30:53,587 WARN L191 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 26 DAG size of output: 26 [2019-11-15 23:30:53,647 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-15 23:30:53,652 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-11-15 23:30:53,654 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-11-15 23:30:53,655 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:30:53,656 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:30:53,656 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:30:53,656 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:30:53,656 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:30:53,658 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 23:30:53,658 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:30:53,660 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:30:53,661 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-11-15 23:30:53,661 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:30:53,662 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:30:53,662 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:30:53,662 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:30:53,662 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:30:53,662 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 23:30:53,663 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:30:53,663 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:30:53,664 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-11-15 23:30:53,664 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:30:53,664 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:30:53,665 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:30:53,665 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:30:53,665 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:30:53,665 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 23:30:53,665 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:30:53,666 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:30:53,666 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-11-15 23:30:53,667 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:30:53,667 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:30:53,667 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:30:53,667 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:30:53,669 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 23:30:53,669 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 23:30:53,672 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:30:53,673 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-11-15 23:30:53,673 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:30:53,673 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:30:53,674 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:30:53,674 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:30:53,674 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:30:53,674 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 23:30:53,674 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:30:53,675 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:30:53,676 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-11-15 23:30:53,676 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:30:53,676 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:30:53,676 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:30:53,677 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:30:53,680 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 23:30:53,680 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 23:30:53,695 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:30:53,695 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-11-15 23:30:53,696 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:30:53,696 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:30:53,696 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:30:53,696 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:30:53,697 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:30:53,697 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 23:30:53,697 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:30:53,698 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:30:53,698 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-11-15 23:30:53,699 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:30:53,699 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:30:53,699 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:30:53,699 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:30:53,701 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 23:30:53,701 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 23:30:53,718 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-15 23:30:53,727 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-11-15 23:30:53,727 INFO L444 ModelExtractionUtils]: 4 out of 7 variables were initially zero. Simplification set additionally 1 variables to zero. [2019-11-15 23:30:53,729 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-15 23:30:53,731 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-11-15 23:30:53,731 INFO L510 LassoAnalysis]: Proved termination. [2019-11-15 23:30:53,732 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_main_~qq~0.base) ULTIMATE.start_main_~qq~0.offset)_1) = 1*v_rep(select (select #memory_int ULTIMATE.start_main_~qq~0.base) ULTIMATE.start_main_~qq~0.offset)_1 Supporting invariants [] [2019-11-15 23:30:53,750 INFO L297 tatePredicateManager]: 3 out of 3 supporting invariants were superfluous and have been removed [2019-11-15 23:30:53,755 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-11-15 23:30:53,768 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:30:53,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:30:53,780 INFO L256 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-15 23:30:53,781 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:30:53,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:30:53,837 INFO L256 TraceCheckSpWp]: Trace formula consists of 184 conjuncts, 18 conjunts are in the unsatisfiable core [2019-11-15 23:30:53,838 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:30:53,899 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:30:53,900 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-11-15 23:30:53,900 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 23:30:53,923 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:30:53,931 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 21 [2019-11-15 23:30:53,932 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 23:30:53,942 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:30:53,943 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 23:30:53,943 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:36, output treesize:15 [2019-11-15 23:30:53,962 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 22 treesize of output 10 [2019-11-15 23:30:53,963 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 23:30:53,968 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:30:53,968 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 23:30:53,968 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:7 [2019-11-15 23:30:54,021 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-11-15 23:30:54,025 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 6 loop predicates [2019-11-15 23:30:54,025 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 16 states and 19 transitions. cyclomatic complexity: 5 Second operand 7 states. [2019-11-15 23:30:54,172 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 16 states and 19 transitions. cyclomatic complexity: 5. Second operand 7 states. Result 62 states and 73 transitions. Complement of second has 17 states. [2019-11-15 23:30:54,173 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 8 states 1 stem states 6 non-accepting loop states 1 accepting loop states [2019-11-15 23:30:54,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2019-11-15 23:30:54,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 17 transitions. [2019-11-15 23:30:54,176 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 17 transitions. Stem has 2 letters. Loop has 16 letters. [2019-11-15 23:30:54,178 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 23:30:54,178 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 17 transitions. Stem has 18 letters. Loop has 16 letters. [2019-11-15 23:30:54,179 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 23:30:54,179 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 17 transitions. Stem has 2 letters. Loop has 32 letters. [2019-11-15 23:30:54,179 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 23:30:54,180 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 62 states and 73 transitions. [2019-11-15 23:30:54,184 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 12 [2019-11-15 23:30:54,187 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 62 states to 56 states and 67 transitions. [2019-11-15 23:30:54,187 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 35 [2019-11-15 23:30:54,187 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 36 [2019-11-15 23:30:54,188 INFO L73 IsDeterministic]: Start isDeterministic. Operand 56 states and 67 transitions. [2019-11-15 23:30:54,188 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-15 23:30:54,188 INFO L688 BuchiCegarLoop]: Abstraction has 56 states and 67 transitions. [2019-11-15 23:30:54,188 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states and 67 transitions. [2019-11-15 23:30:54,193 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 51. [2019-11-15 23:30:54,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2019-11-15 23:30:54,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 60 transitions. [2019-11-15 23:30:54,195 INFO L711 BuchiCegarLoop]: Abstraction has 51 states and 60 transitions. [2019-11-15 23:30:54,195 INFO L591 BuchiCegarLoop]: Abstraction has 51 states and 60 transitions. [2019-11-15 23:30:54,196 INFO L424 BuchiCegarLoop]: ======== Iteration 3============ [2019-11-15 23:30:54,196 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 51 states and 60 transitions. [2019-11-15 23:30:54,198 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 12 [2019-11-15 23:30:54,198 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 23:30:54,198 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 23:30:54,199 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:30:54,199 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-11-15 23:30:54,199 INFO L791 eck$LassoCheckResult]: Stem: 261#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 255#L-1 havoc main_#res;havoc main_#t~malloc6.base, main_#t~malloc6.offset, main_#t~nondet7, main_#t~malloc9.base, main_#t~malloc9.offset, main_#t~nondet10, main_#t~mem11, main_#t~mem14, main_#t~ret12, main_#t~ite13, main_~pp~0.base, main_~pp~0.offset, main_#t~mem8, main_~qq~0.base, main_~qq~0.offset;call main_#t~malloc6.base, main_#t~malloc6.offset := #Ultimate.allocOnHeap(4);main_~qq~0.base, main_~qq~0.offset := main_#t~malloc6.base, main_#t~malloc6.offset;call write~int(main_#t~nondet7, main_~qq~0.base, main_~qq~0.offset, 4);havoc main_#t~nondet7; 256#L28-3 call main_#t~mem8 := read~int(main_~qq~0.base, main_~qq~0.offset, 4); 251#L28-1 assume !!(main_#t~mem8 > 1);havoc main_#t~mem8;call main_#t~malloc9.base, main_#t~malloc9.offset := #Ultimate.allocOnHeap(4);main_~pp~0.base, main_~pp~0.offset := main_#t~malloc9.base, main_#t~malloc9.offset;call write~int(main_#t~nondet10, main_~pp~0.base, main_~pp~0.offset, 4);havoc main_#t~nondet10;call main_#t~mem11 := read~int(main_~pp~0.base, main_~pp~0.offset, 4); 252#L32 assume !(main_#t~mem11 < 0);havoc main_#t~mem11;call main_#t~mem14 := read~int(main_~qq~0.base, main_~qq~0.offset, 4); 262#L36 call main_#t~ret12 := rec(main_~pp~0.base, main_~pp~0.offset);< 280#recENTRY ~op.base, ~op.offset := #in~op.base, #in~op.offset;call #t~mem1 := read~int(~op.base, ~op.offset, 4); 291#L9 assume !(#t~mem1 < 0);havoc #t~mem1;call #t~malloc3.base, #t~malloc3.offset := #Ultimate.allocOnHeap(4);~ip~0.base, ~ip~0.offset := #t~malloc3.base, #t~malloc3.offset;call #t~mem4 := read~int(~op.base, ~op.offset, 4);call write~int(#t~mem4 - 1, ~ip~0.base, ~ip~0.offset, 4);havoc #t~mem4;call ULTIMATE.dealloc(~op.base, ~op.offset); 246#L19 call #t~ret5 := rec(~ip~0.base, ~ip~0.offset);< 244#recENTRY [2019-11-15 23:30:54,199 INFO L793 eck$LassoCheckResult]: Loop: 244#recENTRY ~op.base, ~op.offset := #in~op.base, #in~op.offset;call #t~mem1 := read~int(~op.base, ~op.offset, 4); 247#L9 assume !(#t~mem1 < 0);havoc #t~mem1;call #t~malloc3.base, #t~malloc3.offset := #Ultimate.allocOnHeap(4);~ip~0.base, ~ip~0.offset := #t~malloc3.base, #t~malloc3.offset;call #t~mem4 := read~int(~op.base, ~op.offset, 4);call write~int(#t~mem4 - 1, ~ip~0.base, ~ip~0.offset, 4);havoc #t~mem4;call ULTIMATE.dealloc(~op.base, ~op.offset); 245#L19 call #t~ret5 := rec(~ip~0.base, ~ip~0.offset);< 244#recENTRY [2019-11-15 23:30:54,199 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:30:54,200 INFO L82 PathProgramCache]: Analyzing trace with hash -498407605, now seen corresponding path program 1 times [2019-11-15 23:30:54,200 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:30:54,200 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1692362107] [2019-11-15 23:30:54,200 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:30:54,200 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:30:54,201 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:30:54,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:30:54,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:30:54,238 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 23:30:54,239 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:30:54,239 INFO L82 PathProgramCache]: Analyzing trace with hash 29956, now seen corresponding path program 1 times [2019-11-15 23:30:54,239 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:30:54,239 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1759788804] [2019-11-15 23:30:54,239 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:30:54,240 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:30:54,240 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:30:54,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:30:54,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:30:54,260 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 23:30:54,261 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:30:54,261 INFO L82 PathProgramCache]: Analyzing trace with hash -359018118, now seen corresponding path program 2 times [2019-11-15 23:30:54,261 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:30:54,261 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1280370939] [2019-11-15 23:30:54,262 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:30:54,262 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:30:54,262 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:30:54,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:30:54,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:30:54,322 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 23:30:54,466 WARN L191 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 62 [2019-11-15 23:30:54,752 WARN L191 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 65 [2019-11-15 23:30:55,103 WARN L191 SmtUtils]: Spent 192.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 91 [2019-11-15 23:30:55,573 WARN L191 SmtUtils]: Spent 306.00 ms on a formula simplification. DAG size of input: 114 DAG size of output: 107 [2019-11-15 23:30:55,697 WARN L191 SmtUtils]: Spent 120.00 ms on a formula simplification that was a NOOP. DAG size: 71 [2019-11-15 23:30:55,703 INFO L210 LassoAnalysis]: Preferences: [2019-11-15 23:30:55,704 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-11-15 23:30:55,704 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-15 23:30:55,704 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-11-15 23:30:55,704 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-11-15 23:30:55,704 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 23:30:55,704 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-15 23:30:55,704 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-11-15 23:30:55,704 INFO L131 ssoRankerPreferences]: Filename of dumped script: rec_malloc_ex11.i_Iteration3_Lasso [2019-11-15 23:30:55,704 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-15 23:30:55,704 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-15 23:30:55,708 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:30:55,714 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:30:55,716 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:30:55,725 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:30:55,730 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:30:55,732 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:30:55,736 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:30:55,738 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:30:55,740 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:30:55,742 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:30:55,744 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:30:55,745 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:30:55,747 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:30:55,748 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:30:55,750 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:30:55,892 WARN L191 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 47 [2019-11-15 23:30:55,970 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:30:55,972 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:30:55,974 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:30:55,975 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:30:55,977 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:30:55,980 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:30:55,981 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:30:55,983 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:30:55,984 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:30:55,986 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:30:55,987 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:30:55,989 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:30:55,990 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:30:55,993 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:30:55,995 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:30:55,997 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:30:56,004 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:30:56,006 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:30:56,007 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:30:56,364 WARN L191 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 29 DAG size of output: 29 [2019-11-15 23:30:56,455 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-15 23:30:56,455 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-11-15 23:30:56,456 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-11-15 23:30:56,457 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:30:56,457 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:30:56,457 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:30:56,457 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:30:56,457 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:30:56,458 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 23:30:56,458 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:30:56,459 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:30:56,459 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-11-15 23:30:56,460 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:30:56,460 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:30:56,460 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:30:56,460 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:30:56,460 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:30:56,461 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 23:30:56,461 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:30:56,462 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:30:56,462 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-11-15 23:30:56,463 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:30:56,463 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:30:56,463 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:30:56,463 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:30:56,463 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:30:56,464 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 23:30:56,464 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:30:56,464 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:30:56,465 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-11-15 23:30:56,465 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:30:56,466 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:30:56,466 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:30:56,466 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:30:56,466 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:30:56,466 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 23:30:56,467 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:30:56,467 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:30:56,468 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-11-15 23:30:56,468 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:30:56,468 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:30:56,469 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:30:56,469 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:30:56,469 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:30:56,469 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 23:30:56,469 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:30:56,470 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:30:56,470 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-11-15 23:30:56,471 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:30:56,471 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:30:56,471 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:30:56,471 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:30:56,472 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:30:56,472 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 23:30:56,472 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:30:56,473 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:30:56,473 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-11-15 23:30:56,474 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:30:56,474 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:30:56,474 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:30:56,474 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:30:56,474 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:30:56,475 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 23:30:56,475 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:30:56,476 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:30:56,476 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-11-15 23:30:56,477 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:30:56,477 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:30:56,477 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:30:56,477 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:30:56,477 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:30:56,478 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 23:30:56,478 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:30:56,478 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:30:56,479 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-11-15 23:30:56,479 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:30:56,479 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:30:56,480 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:30:56,480 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:30:56,480 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:30:56,480 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 23:30:56,481 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:30:56,481 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:30:56,481 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-11-15 23:30:56,482 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:30:56,482 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:30:56,482 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:30:56,483 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:30:56,484 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 23:30:56,484 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 23:30:56,486 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:30:56,487 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-11-15 23:30:56,487 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:30:56,487 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:30:56,487 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:30:56,488 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:30:56,488 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:30:56,488 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 23:30:56,488 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:30:56,489 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:30:56,489 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-11-15 23:30:56,490 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:30:56,490 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:30:56,490 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:30:56,490 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:30:56,490 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:30:56,491 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 23:30:56,491 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:30:56,492 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:30:56,492 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-11-15 23:30:56,493 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:30:56,493 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:30:56,493 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:30:56,493 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:30:56,493 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:30:56,494 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 23:30:56,494 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:30:56,495 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:30:56,495 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-11-15 23:30:56,496 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:30:56,496 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:30:56,496 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:30:56,496 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:30:56,496 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:30:56,497 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 23:30:56,497 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:30:56,497 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:30:56,498 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-11-15 23:30:56,498 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:30:56,499 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:30:56,499 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:30:56,499 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:30:56,501 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 23:30:56,501 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 23:30:56,509 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:30:56,509 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-11-15 23:30:56,510 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:30:56,510 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:30:56,510 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:30:56,510 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:30:56,511 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 23:30:56,511 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 23:30:56,513 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:30:56,513 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-11-15 23:30:56,514 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:30:56,514 INFO L202 nArgumentSynthesizer]: 8 stem disjuncts [2019-11-15 23:30:56,514 INFO L203 nArgumentSynthesizer]: 2 loop disjuncts [2019-11-15 23:30:56,514 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:30:56,522 INFO L400 nArgumentSynthesizer]: We have 44 Motzkin's Theorem applications. [2019-11-15 23:30:56,522 INFO L401 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2019-11-15 23:30:56,556 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:30:56,557 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-11-15 23:30:56,558 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:30:56,558 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:30:56,558 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:30:56,558 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:30:56,561 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 23:30:56,561 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 23:30:56,579 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-15 23:30:56,587 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-11-15 23:30:56,588 INFO L444 ModelExtractionUtils]: 13 out of 16 variables were initially zero. Simplification set additionally 0 variables to zero. [2019-11-15 23:30:56,588 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-15 23:30:56,589 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-11-15 23:30:56,590 INFO L510 LassoAnalysis]: Proved termination. [2019-11-15 23:30:56,590 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int rec_#in~op.base) rec_#in~op.offset)_1) = 2*v_rep(select (select #memory_int rec_#in~op.base) rec_#in~op.offset)_1 + 1 Supporting invariants [] [2019-11-15 23:30:56,599 INFO L297 tatePredicateManager]: 2 out of 2 supporting invariants were superfluous and have been removed [2019-11-15 23:30:56,603 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-11-15 23:30:56,621 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:30:56,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:30:56,651 INFO L256 TraceCheckSpWp]: Trace formula consists of 169 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-15 23:30:56,652 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:30:56,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:30:56,666 INFO L256 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 17 conjunts are in the unsatisfiable core [2019-11-15 23:30:56,666 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:30:56,720 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:30:56,720 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 53 [2019-11-15 23:30:56,721 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 23:30:56,759 INFO L567 ElimStorePlain]: treesize reduction 20, result has 67.7 percent of original size [2019-11-15 23:30:56,760 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 23:30:56,761 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:36, output treesize:21 [2019-11-15 23:30:56,778 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:30:56,779 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2019-11-15 23:30:56,779 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 51 states and 60 transitions. cyclomatic complexity: 14 Second operand 4 states. [2019-11-15 23:30:56,856 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 51 states and 60 transitions. cyclomatic complexity: 14. Second operand 4 states. Result 99 states and 122 transitions. Complement of second has 17 states. [2019-11-15 23:30:56,857 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 3 non-accepting loop states 1 accepting loop states [2019-11-15 23:30:56,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-11-15 23:30:56,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 14 transitions. [2019-11-15 23:30:56,858 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 14 transitions. Stem has 9 letters. Loop has 3 letters. [2019-11-15 23:30:56,859 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 23:30:56,859 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 14 transitions. Stem has 12 letters. Loop has 3 letters. [2019-11-15 23:30:56,859 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 23:30:56,859 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 14 transitions. Stem has 9 letters. Loop has 6 letters. [2019-11-15 23:30:56,859 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 23:30:56,859 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 99 states and 122 transitions. [2019-11-15 23:30:56,865 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 12 [2019-11-15 23:30:56,868 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 99 states to 87 states and 110 transitions. [2019-11-15 23:30:56,869 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 44 [2019-11-15 23:30:56,869 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 46 [2019-11-15 23:30:56,869 INFO L73 IsDeterministic]: Start isDeterministic. Operand 87 states and 110 transitions. [2019-11-15 23:30:56,869 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-15 23:30:56,870 INFO L688 BuchiCegarLoop]: Abstraction has 87 states and 110 transitions. [2019-11-15 23:30:56,871 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states and 110 transitions. [2019-11-15 23:30:56,879 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 83. [2019-11-15 23:30:56,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2019-11-15 23:30:56,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 102 transitions. [2019-11-15 23:30:56,883 INFO L711 BuchiCegarLoop]: Abstraction has 83 states and 102 transitions. [2019-11-15 23:30:56,884 INFO L591 BuchiCegarLoop]: Abstraction has 83 states and 102 transitions. [2019-11-15 23:30:56,884 INFO L424 BuchiCegarLoop]: ======== Iteration 4============ [2019-11-15 23:30:56,884 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 83 states and 102 transitions. [2019-11-15 23:30:56,887 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 12 [2019-11-15 23:30:56,889 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 23:30:56,889 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 23:30:56,890 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:30:56,890 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:30:56,890 INFO L791 eck$LassoCheckResult]: Stem: 494#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 489#L-1 havoc main_#res;havoc main_#t~malloc6.base, main_#t~malloc6.offset, main_#t~nondet7, main_#t~malloc9.base, main_#t~malloc9.offset, main_#t~nondet10, main_#t~mem11, main_#t~mem14, main_#t~ret12, main_#t~ite13, main_~pp~0.base, main_~pp~0.offset, main_#t~mem8, main_~qq~0.base, main_~qq~0.offset;call main_#t~malloc6.base, main_#t~malloc6.offset := #Ultimate.allocOnHeap(4);main_~qq~0.base, main_~qq~0.offset := main_#t~malloc6.base, main_#t~malloc6.offset;call write~int(main_#t~nondet7, main_~qq~0.base, main_~qq~0.offset, 4);havoc main_#t~nondet7; 490#L28-3 call main_#t~mem8 := read~int(main_~qq~0.base, main_~qq~0.offset, 4); 515#L28-1 assume !!(main_#t~mem8 > 1);havoc main_#t~mem8;call main_#t~malloc9.base, main_#t~malloc9.offset := #Ultimate.allocOnHeap(4);main_~pp~0.base, main_~pp~0.offset := main_#t~malloc9.base, main_#t~malloc9.offset;call write~int(main_#t~nondet10, main_~pp~0.base, main_~pp~0.offset, 4);havoc main_#t~nondet10;call main_#t~mem11 := read~int(main_~pp~0.base, main_~pp~0.offset, 4); 555#L32 assume !(main_#t~mem11 < 0);havoc main_#t~mem11;call main_#t~mem14 := read~int(main_~qq~0.base, main_~qq~0.offset, 4); 527#L36 call main_#t~ret12 := rec(main_~pp~0.base, main_~pp~0.offset);< 553#recENTRY ~op.base, ~op.offset := #in~op.base, #in~op.offset;call #t~mem1 := read~int(~op.base, ~op.offset, 4); 552#L9 assume !(#t~mem1 < 0);havoc #t~mem1;call #t~malloc3.base, #t~malloc3.offset := #Ultimate.allocOnHeap(4);~ip~0.base, ~ip~0.offset := #t~malloc3.base, #t~malloc3.offset;call #t~mem4 := read~int(~op.base, ~op.offset, 4);call write~int(#t~mem4 - 1, ~ip~0.base, ~ip~0.offset, 4);havoc #t~mem4;call ULTIMATE.dealloc(~op.base, ~op.offset); 488#L19 call #t~ret5 := rec(~ip~0.base, ~ip~0.offset);< 551#recENTRY ~op.base, ~op.offset := #in~op.base, #in~op.offset;call #t~mem1 := read~int(~op.base, ~op.offset, 4); 558#L9 assume #t~mem1 < 0;havoc #t~mem1;call #t~mem2 := read~int(~op.base, ~op.offset, 4);~r~0 := #t~mem2;havoc #t~mem2;call ULTIMATE.dealloc(~op.base, ~op.offset);#res := ~r~0; 509#recFINAL assume true; 510#recEXIT >#42#return; 535#L19-1 #res := #t~ret5;havoc #t~ret5; 534#recFINAL assume true; 526#recEXIT >#44#return; 513#L36-1 assume !(-1 == main_#t~ret12);main_#t~ite13 := 1; 503#L36-3 [2019-11-15 23:30:56,891 INFO L793 eck$LassoCheckResult]: Loop: 503#L36-3 call write~int(main_#t~mem14 + main_#t~ite13, main_~qq~0.base, main_~qq~0.offset, 4);havoc main_#t~mem14;havoc main_#t~ret12;havoc main_#t~ite13; 504#L28-3 call main_#t~mem8 := read~int(main_~qq~0.base, main_~qq~0.offset, 4); 536#L28-1 assume !!(main_#t~mem8 > 1);havoc main_#t~mem8;call main_#t~malloc9.base, main_#t~malloc9.offset := #Ultimate.allocOnHeap(4);main_~pp~0.base, main_~pp~0.offset := main_#t~malloc9.base, main_#t~malloc9.offset;call write~int(main_#t~nondet10, main_~pp~0.base, main_~pp~0.offset, 4);havoc main_#t~nondet10;call main_#t~mem11 := read~int(main_~pp~0.base, main_~pp~0.offset, 4); 531#L32 assume !(main_#t~mem11 < 0);havoc main_#t~mem11;call main_#t~mem14 := read~int(main_~qq~0.base, main_~qq~0.offset, 4); 517#L36 call main_#t~ret12 := rec(main_~pp~0.base, main_~pp~0.offset);< 518#recENTRY ~op.base, ~op.offset := #in~op.base, #in~op.offset;call #t~mem1 := read~int(~op.base, ~op.offset, 4); 541#L9 assume !(#t~mem1 < 0);havoc #t~mem1;call #t~malloc3.base, #t~malloc3.offset := #Ultimate.allocOnHeap(4);~ip~0.base, ~ip~0.offset := #t~malloc3.base, #t~malloc3.offset;call #t~mem4 := read~int(~op.base, ~op.offset, 4);call write~int(#t~mem4 - 1, ~ip~0.base, ~ip~0.offset, 4);havoc #t~mem4;call ULTIMATE.dealloc(~op.base, ~op.offset); 529#L19 call #t~ret5 := rec(~ip~0.base, ~ip~0.offset);< 518#recENTRY ~op.base, ~op.offset := #in~op.base, #in~op.offset;call #t~mem1 := read~int(~op.base, ~op.offset, 4); 541#L9 assume #t~mem1 < 0;havoc #t~mem1;call #t~mem2 := read~int(~op.base, ~op.offset, 4);~r~0 := #t~mem2;havoc #t~mem2;call ULTIMATE.dealloc(~op.base, ~op.offset);#res := ~r~0; 542#recFINAL assume true; 540#recEXIT >#42#return; 530#L19-1 #res := #t~ret5;havoc #t~ret5; 538#recFINAL assume true; 528#recEXIT >#44#return; 524#L36-1 assume -1 == main_#t~ret12;main_#t~ite13 := -1; 503#L36-3 [2019-11-15 23:30:56,891 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:30:56,891 INFO L82 PathProgramCache]: Analyzing trace with hash -713572475, now seen corresponding path program 1 times [2019-11-15 23:30:56,891 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:30:56,891 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [477331792] [2019-11-15 23:30:56,892 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:30:56,892 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:30:56,892 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:30:56,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:30:56,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:30:56,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:30:57,054 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-15 23:30:57,054 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [477331792] [2019-11-15 23:30:57,054 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [726250633] [2019-11-15 23:30:57,055 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_911302a1-35c5-4c8f-bdae-94f218e7b3df/bin/uautomizer/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 23:30:57,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:30:57,144 INFO L256 TraceCheckSpWp]: Trace formula consists of 140 conjuncts, 26 conjunts are in the unsatisfiable core [2019-11-15 23:30:57,145 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:30:57,181 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:30:57,181 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 46 [2019-11-15 23:30:57,182 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 23:30:57,199 INFO L567 ElimStorePlain]: treesize reduction 20, result has 60.8 percent of original size [2019-11-15 23:30:57,200 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 23:30:57,200 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:25, output treesize:9 [2019-11-15 23:30:57,257 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 26 treesize of output 14 [2019-11-15 23:30:57,258 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 23:30:57,263 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:30:57,263 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 23:30:57,264 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:26, output treesize:11 [2019-11-15 23:30:57,268 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:30:57,268 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 23:30:57,268 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 13 [2019-11-15 23:30:57,269 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2110639581] [2019-11-15 23:30:57,269 INFO L796 eck$LassoCheckResult]: stem already infeasible [2019-11-15 23:30:57,269 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:30:57,269 INFO L82 PathProgramCache]: Analyzing trace with hash 542882406, now seen corresponding path program 2 times [2019-11-15 23:30:57,270 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:30:57,270 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [784424814] [2019-11-15 23:30:57,270 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:30:57,270 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:30:57,270 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:30:57,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:30:57,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:30:57,299 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 23:30:57,608 WARN L191 SmtUtils]: Spent 205.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 90 [2019-11-15 23:30:58,252 WARN L191 SmtUtils]: Spent 448.00 ms on a formula simplification. DAG size of input: 141 DAG size of output: 129 [2019-11-15 23:30:58,368 WARN L191 SmtUtils]: Spent 111.00 ms on a formula simplification that was a NOOP. DAG size: 91 [2019-11-15 23:30:58,368 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:30:58,368 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-11-15 23:30:58,369 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=148, Unknown=0, NotChecked=0, Total=182 [2019-11-15 23:30:58,369 INFO L87 Difference]: Start difference. First operand 83 states and 102 transitions. cyclomatic complexity: 26 Second operand 14 states. [2019-11-15 23:30:58,477 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:30:58,478 INFO L93 Difference]: Finished difference Result 85 states and 110 transitions. [2019-11-15 23:30:58,478 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-11-15 23:30:58,478 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 85 states and 110 transitions. [2019-11-15 23:30:58,481 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-11-15 23:30:58,482 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 85 states to 54 states and 67 transitions. [2019-11-15 23:30:58,483 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 12 [2019-11-15 23:30:58,483 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 12 [2019-11-15 23:30:58,483 INFO L73 IsDeterministic]: Start isDeterministic. Operand 54 states and 67 transitions. [2019-11-15 23:30:58,483 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-15 23:30:58,483 INFO L688 BuchiCegarLoop]: Abstraction has 54 states and 67 transitions. [2019-11-15 23:30:58,483 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states and 67 transitions. [2019-11-15 23:30:58,487 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 45. [2019-11-15 23:30:58,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2019-11-15 23:30:58,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 54 transitions. [2019-11-15 23:30:58,488 INFO L711 BuchiCegarLoop]: Abstraction has 45 states and 54 transitions. [2019-11-15 23:30:58,489 INFO L591 BuchiCegarLoop]: Abstraction has 45 states and 54 transitions. [2019-11-15 23:30:58,489 INFO L424 BuchiCegarLoop]: ======== Iteration 5============ [2019-11-15 23:30:58,489 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 45 states and 54 transitions. [2019-11-15 23:30:58,490 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-11-15 23:30:58,490 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 23:30:58,490 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 23:30:58,491 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:30:58,491 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-11-15 23:30:58,491 INFO L791 eck$LassoCheckResult]: Stem: 749#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 743#L-1 havoc main_#res;havoc main_#t~malloc6.base, main_#t~malloc6.offset, main_#t~nondet7, main_#t~malloc9.base, main_#t~malloc9.offset, main_#t~nondet10, main_#t~mem11, main_#t~mem14, main_#t~ret12, main_#t~ite13, main_~pp~0.base, main_~pp~0.offset, main_#t~mem8, main_~qq~0.base, main_~qq~0.offset;call main_#t~malloc6.base, main_#t~malloc6.offset := #Ultimate.allocOnHeap(4);main_~qq~0.base, main_~qq~0.offset := main_#t~malloc6.base, main_#t~malloc6.offset;call write~int(main_#t~nondet7, main_~qq~0.base, main_~qq~0.offset, 4);havoc main_#t~nondet7; 744#L28-3 call main_#t~mem8 := read~int(main_~qq~0.base, main_~qq~0.offset, 4); 758#L28-1 assume !!(main_#t~mem8 > 1);havoc main_#t~mem8;call main_#t~malloc9.base, main_#t~malloc9.offset := #Ultimate.allocOnHeap(4);main_~pp~0.base, main_~pp~0.offset := main_#t~malloc9.base, main_#t~malloc9.offset;call write~int(main_#t~nondet10, main_~pp~0.base, main_~pp~0.offset, 4);havoc main_#t~nondet10;call main_#t~mem11 := read~int(main_~pp~0.base, main_~pp~0.offset, 4); 748#L32 assume !(main_#t~mem11 < 0);havoc main_#t~mem11;call main_#t~mem14 := read~int(main_~qq~0.base, main_~qq~0.offset, 4); 734#L36 call main_#t~ret12 := rec(main_~pp~0.base, main_~pp~0.offset);< 733#recENTRY ~op.base, ~op.offset := #in~op.base, #in~op.offset;call #t~mem1 := read~int(~op.base, ~op.offset, 4); 735#L9 assume !(#t~mem1 < 0);havoc #t~mem1;call #t~malloc3.base, #t~malloc3.offset := #Ultimate.allocOnHeap(4);~ip~0.base, ~ip~0.offset := #t~malloc3.base, #t~malloc3.offset;call #t~mem4 := read~int(~op.base, ~op.offset, 4);call write~int(#t~mem4 - 1, ~ip~0.base, ~ip~0.offset, 4);havoc #t~mem4;call ULTIMATE.dealloc(~op.base, ~op.offset); 741#L19 call #t~ret5 := rec(~ip~0.base, ~ip~0.offset);< 764#recENTRY ~op.base, ~op.offset := #in~op.base, #in~op.offset;call #t~mem1 := read~int(~op.base, ~op.offset, 4); 740#L9 assume #t~mem1 < 0;havoc #t~mem1;call #t~mem2 := read~int(~op.base, ~op.offset, 4);~r~0 := #t~mem2;havoc #t~mem2;call ULTIMATE.dealloc(~op.base, ~op.offset);#res := ~r~0; 742#recFINAL assume true; 763#recEXIT >#42#return; 762#L19-1 #res := #t~ret5;havoc #t~ret5; 761#recFINAL assume true; 759#recEXIT >#44#return; 757#L36-1 assume -1 == main_#t~ret12;main_#t~ite13 := -1; 753#L36-3 call write~int(main_#t~mem14 + main_#t~ite13, main_~qq~0.base, main_~qq~0.offset, 4);havoc main_#t~mem14;havoc main_#t~ret12;havoc main_#t~ite13; 754#L28-3 call main_#t~mem8 := read~int(main_~qq~0.base, main_~qq~0.offset, 4); 736#L28-1 assume !!(main_#t~mem8 > 1);havoc main_#t~mem8;call main_#t~malloc9.base, main_#t~malloc9.offset := #Ultimate.allocOnHeap(4);main_~pp~0.base, main_~pp~0.offset := main_#t~malloc9.base, main_#t~malloc9.offset;call write~int(main_#t~nondet10, main_~pp~0.base, main_~pp~0.offset, 4);havoc main_#t~nondet10;call main_#t~mem11 := read~int(main_~pp~0.base, main_~pp~0.offset, 4); 737#L32 assume !(main_#t~mem11 < 0);havoc main_#t~mem11;call main_#t~mem14 := read~int(main_~qq~0.base, main_~qq~0.offset, 4); 730#L36 call main_#t~ret12 := rec(main_~pp~0.base, main_~pp~0.offset);< 729#recENTRY [2019-11-15 23:30:58,491 INFO L793 eck$LassoCheckResult]: Loop: 729#recENTRY ~op.base, ~op.offset := #in~op.base, #in~op.offset;call #t~mem1 := read~int(~op.base, ~op.offset, 4); 731#L9 assume !(#t~mem1 < 0);havoc #t~mem1;call #t~malloc3.base, #t~malloc3.offset := #Ultimate.allocOnHeap(4);~ip~0.base, ~ip~0.offset := #t~malloc3.base, #t~malloc3.offset;call #t~mem4 := read~int(~op.base, ~op.offset, 4);call write~int(#t~mem4 - 1, ~ip~0.base, ~ip~0.offset, 4);havoc #t~mem4;call ULTIMATE.dealloc(~op.base, ~op.offset); 732#L19 call #t~ret5 := rec(~ip~0.base, ~ip~0.offset);< 729#recENTRY [2019-11-15 23:30:58,491 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:30:58,491 INFO L82 PathProgramCache]: Analyzing trace with hash -873815595, now seen corresponding path program 2 times [2019-11-15 23:30:58,491 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:30:58,491 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [741499135] [2019-11-15 23:30:58,492 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:30:58,492 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:30:58,492 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:30:58,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:30:58,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:30:58,528 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 23:30:58,529 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:30:58,529 INFO L82 PathProgramCache]: Analyzing trace with hash 29956, now seen corresponding path program 2 times [2019-11-15 23:30:58,529 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:30:58,529 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [554940257] [2019-11-15 23:30:58,529 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:30:58,530 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:30:58,530 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:30:58,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:30:58,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:30:58,539 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 23:30:58,539 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:30:58,539 INFO L82 PathProgramCache]: Analyzing trace with hash -43609424, now seen corresponding path program 3 times [2019-11-15 23:30:58,540 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:30:58,540 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [564016997] [2019-11-15 23:30:58,540 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:30:58,540 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:30:58,540 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:30:58,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:30:58,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:30:58,590 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 23:30:58,740 WARN L191 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 62 [2019-11-15 23:30:59,356 WARN L191 SmtUtils]: Spent 294.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 89 [2019-11-15 23:30:59,542 WARN L191 SmtUtils]: Spent 105.00 ms on a formula simplification that was a NOOP. DAG size: 80 [2019-11-15 23:31:00,842 WARN L191 SmtUtils]: Spent 1.23 s on a formula simplification. DAG size of input: 230 DAG size of output: 191 [2019-11-15 23:31:01,207 WARN L191 SmtUtils]: Spent 357.00 ms on a formula simplification that was a NOOP. DAG size: 116 [2019-11-15 23:31:01,472 WARN L191 SmtUtils]: Spent 253.00 ms on a formula simplification that was a NOOP. DAG size: 122 [2019-11-15 23:31:01,662 WARN L191 SmtUtils]: Spent 187.00 ms on a formula simplification that was a NOOP. DAG size: 98 [2019-11-15 23:31:01,664 INFO L210 LassoAnalysis]: Preferences: [2019-11-15 23:31:01,665 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-11-15 23:31:01,665 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-15 23:31:01,665 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-11-15 23:31:01,665 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-11-15 23:31:01,665 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 23:31:01,665 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-15 23:31:01,665 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-11-15 23:31:01,665 INFO L131 ssoRankerPreferences]: Filename of dumped script: rec_malloc_ex11.i_Iteration5_Lasso [2019-11-15 23:31:01,665 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-15 23:31:01,665 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-15 23:31:01,667 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:31:01,669 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:31:01,672 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:31:01,673 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:31:01,675 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:31:01,682 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:31:01,683 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:31:01,685 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:31:01,688 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:31:01,689 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:31:01,690 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:31:01,692 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:31:01,693 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:31:01,695 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:31:01,697 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:31:01,698 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:31:01,699 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:31:01,701 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:31:01,702 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:31:01,703 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:31:01,711 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:31:01,874 WARN L191 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 55 [2019-11-15 23:31:01,953 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:31:01,955 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:31:01,956 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:31:01,958 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:31:01,959 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:31:01,960 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:31:01,962 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:31:01,963 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:31:01,964 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:31:01,966 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:31:01,967 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:31:01,968 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:31:01,970 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:31:02,555 WARN L191 SmtUtils]: Spent 361.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 43 [2019-11-15 23:31:02,608 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-15 23:31:02,608 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-11-15 23:31:02,608 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-11-15 23:31:02,609 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:31:02,609 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:31:02,609 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:31:02,610 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:31:02,610 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:31:02,610 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 23:31:02,610 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:31:02,611 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:31:02,612 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-11-15 23:31:02,612 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:31:02,612 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:31:02,613 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:31:02,613 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:31:02,613 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:31:02,613 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 23:31:02,613 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:31:02,614 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:31:02,614 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-11-15 23:31:02,615 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:31:02,615 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:31:02,615 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:31:02,615 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:31:02,615 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:31:02,616 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 23:31:02,616 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:31:02,616 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:31:02,617 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-11-15 23:31:02,617 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:31:02,617 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:31:02,617 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:31:02,617 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:31:02,618 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:31:02,618 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 23:31:02,618 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:31:02,618 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:31:02,618 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-11-15 23:31:02,619 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:31:02,619 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:31:02,619 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:31:02,619 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:31:02,620 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 23:31:02,620 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 23:31:02,621 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:31:02,622 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-11-15 23:31:02,622 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:31:02,622 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:31:02,623 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:31:02,623 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:31:02,623 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:31:02,623 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 23:31:02,623 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:31:02,624 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:31:02,624 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-11-15 23:31:02,625 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:31:02,625 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:31:02,625 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:31:02,625 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:31:02,625 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:31:02,625 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 23:31:02,626 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:31:02,626 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:31:02,626 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-11-15 23:31:02,627 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:31:02,627 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:31:02,627 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:31:02,627 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:31:02,628 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 23:31:02,628 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 23:31:02,629 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:31:02,629 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-11-15 23:31:02,630 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:31:02,630 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:31:02,630 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:31:02,630 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:31:02,631 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:31:02,631 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 23:31:02,631 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:31:02,632 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:31:02,632 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-11-15 23:31:02,632 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:31:02,633 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:31:02,633 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:31:02,633 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:31:02,633 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:31:02,633 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 23:31:02,633 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:31:02,634 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:31:02,634 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-11-15 23:31:02,635 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:31:02,635 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:31:02,635 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:31:02,635 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:31:02,635 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:31:02,636 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 23:31:02,636 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:31:02,636 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:31:02,637 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-11-15 23:31:02,637 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:31:02,637 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:31:02,638 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:31:02,638 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:31:02,638 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:31:02,638 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 23:31:02,638 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:31:02,639 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:31:02,639 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-11-15 23:31:02,640 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:31:02,640 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:31:02,640 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:31:02,640 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:31:02,640 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:31:02,641 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 23:31:02,641 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:31:02,641 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:31:02,642 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-11-15 23:31:02,642 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:31:02,642 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:31:02,642 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:31:02,643 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:31:02,643 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:31:02,643 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 23:31:02,643 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:31:02,644 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:31:02,646 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-11-15 23:31:02,647 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:31:02,647 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:31:02,648 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:31:02,648 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:31:02,648 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:31:02,648 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 23:31:02,648 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:31:02,649 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:31:02,650 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-11-15 23:31:02,650 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:31:02,650 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:31:02,651 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:31:02,651 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:31:02,651 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:31:02,651 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 23:31:02,651 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:31:02,652 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:31:02,654 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-11-15 23:31:02,654 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:31:02,654 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:31:02,655 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:31:02,655 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:31:02,655 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:31:02,655 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 23:31:02,655 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:31:02,656 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:31:02,656 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-11-15 23:31:02,657 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:31:02,657 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:31:02,660 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:31:02,660 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:31:02,660 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:31:02,661 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 23:31:02,661 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:31:02,662 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:31:02,662 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-11-15 23:31:02,663 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:31:02,663 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:31:02,664 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:31:02,664 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:31:02,664 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:31:02,665 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 23:31:02,665 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:31:02,665 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:31:02,666 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-11-15 23:31:02,666 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:31:02,667 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:31:02,667 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:31:02,667 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:31:02,667 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:31:02,667 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 23:31:02,668 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:31:02,668 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:31:02,669 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-11-15 23:31:02,670 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:31:02,670 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:31:02,670 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:31:02,670 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:31:02,671 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 23:31:02,671 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 23:31:02,682 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:31:02,682 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-11-15 23:31:02,683 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:31:02,683 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:31:02,684 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:31:02,684 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:31:02,685 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 23:31:02,685 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 23:31:02,689 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:31:02,690 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-11-15 23:31:02,691 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:31:02,691 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:31:02,691 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:31:02,692 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:31:02,692 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 23:31:02,692 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 23:31:02,693 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:31:02,694 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-11-15 23:31:02,695 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:31:02,696 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:31:02,696 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:31:02,696 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:31:02,697 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 23:31:02,697 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 23:31:02,699 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:31:02,701 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-11-15 23:31:02,701 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:31:02,702 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:31:02,702 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:31:02,702 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:31:02,703 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 23:31:02,704 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 23:31:02,718 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:31:02,719 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-11-15 23:31:02,719 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:31:02,719 INFO L202 nArgumentSynthesizer]: 16 stem disjuncts [2019-11-15 23:31:02,719 INFO L203 nArgumentSynthesizer]: 2 loop disjuncts [2019-11-15 23:31:02,719 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:31:02,725 INFO L400 nArgumentSynthesizer]: We have 76 Motzkin's Theorem applications. [2019-11-15 23:31:02,725 INFO L401 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2019-11-15 23:31:02,781 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:31:02,781 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-11-15 23:31:02,782 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:31:02,782 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:31:02,782 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:31:02,782 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:31:02,783 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 23:31:02,783 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 23:31:02,784 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:31:02,785 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-11-15 23:31:02,785 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:31:02,785 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:31:02,785 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:31:02,786 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:31:02,787 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 23:31:02,787 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 23:31:02,801 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-15 23:31:02,814 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-11-15 23:31:02,816 INFO L444 ModelExtractionUtils]: 11 out of 16 variables were initially zero. Simplification set additionally 2 variables to zero. [2019-11-15 23:31:02,817 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-15 23:31:02,818 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-11-15 23:31:02,818 INFO L510 LassoAnalysis]: Proved termination. [2019-11-15 23:31:02,818 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int rec_#in~op.base) rec_#in~op.offset)_2) = 2*v_rep(select (select #memory_int rec_#in~op.base) rec_#in~op.offset)_2 + 1 Supporting invariants [] [2019-11-15 23:31:02,825 INFO L297 tatePredicateManager]: 2 out of 2 supporting invariants were superfluous and have been removed [2019-11-15 23:31:02,829 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-11-15 23:31:02,866 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:31:02,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:31:02,906 INFO L256 TraceCheckSpWp]: Trace formula consists of 279 conjuncts, 8 conjunts are in the unsatisfiable core [2019-11-15 23:31:02,911 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:31:02,942 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:31:02,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:31:02,962 INFO L256 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 17 conjunts are in the unsatisfiable core [2019-11-15 23:31:02,962 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:31:03,007 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:31:03,007 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 53 [2019-11-15 23:31:03,008 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 23:31:03,039 INFO L567 ElimStorePlain]: treesize reduction 20, result has 67.7 percent of original size [2019-11-15 23:31:03,040 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 23:31:03,040 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:36, output treesize:21 [2019-11-15 23:31:03,061 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:31:03,062 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 3 loop predicates [2019-11-15 23:31:03,062 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 45 states and 54 transitions. cyclomatic complexity: 13 Second operand 5 states. [2019-11-15 23:31:03,138 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 45 states and 54 transitions. cyclomatic complexity: 13. Second operand 5 states. Result 55 states and 65 transitions. Complement of second has 14 states. [2019-11-15 23:31:03,140 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 3 non-accepting loop states 1 accepting loop states [2019-11-15 23:31:03,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2019-11-15 23:31:03,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 11 transitions. [2019-11-15 23:31:03,140 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 11 transitions. Stem has 22 letters. Loop has 3 letters. [2019-11-15 23:31:03,141 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 23:31:03,141 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-11-15 23:31:03,159 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:31:03,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:31:03,206 INFO L256 TraceCheckSpWp]: Trace formula consists of 279 conjuncts, 8 conjunts are in the unsatisfiable core [2019-11-15 23:31:03,210 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:31:03,232 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:31:03,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:31:03,247 INFO L256 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 17 conjunts are in the unsatisfiable core [2019-11-15 23:31:03,250 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:31:03,293 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:31:03,294 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 53 [2019-11-15 23:31:03,294 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 23:31:03,325 INFO L567 ElimStorePlain]: treesize reduction 20, result has 67.7 percent of original size [2019-11-15 23:31:03,326 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 23:31:03,326 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:36, output treesize:21 [2019-11-15 23:31:03,336 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:31:03,337 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.2 stem predicates 3 loop predicates [2019-11-15 23:31:03,337 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 45 states and 54 transitions. cyclomatic complexity: 13 Second operand 5 states. [2019-11-15 23:31:03,388 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 45 states and 54 transitions. cyclomatic complexity: 13. Second operand 5 states. Result 55 states and 65 transitions. Complement of second has 14 states. [2019-11-15 23:31:03,391 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 3 non-accepting loop states 1 accepting loop states [2019-11-15 23:31:03,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2019-11-15 23:31:03,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 11 transitions. [2019-11-15 23:31:03,391 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 11 transitions. Stem has 22 letters. Loop has 3 letters. [2019-11-15 23:31:03,392 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 23:31:03,392 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-11-15 23:31:03,401 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:31:03,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:31:03,454 INFO L256 TraceCheckSpWp]: Trace formula consists of 279 conjuncts, 8 conjunts are in the unsatisfiable core [2019-11-15 23:31:03,456 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:31:03,487 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:31:03,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:31:03,504 INFO L256 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 17 conjunts are in the unsatisfiable core [2019-11-15 23:31:03,504 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:31:03,547 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:31:03,548 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 53 [2019-11-15 23:31:03,548 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 23:31:03,568 INFO L567 ElimStorePlain]: treesize reduction 20, result has 67.7 percent of original size [2019-11-15 23:31:03,569 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 23:31:03,569 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:36, output treesize:21 [2019-11-15 23:31:03,579 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:31:03,580 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.2 stem predicates 3 loop predicates [2019-11-15 23:31:03,580 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 45 states and 54 transitions. cyclomatic complexity: 13 Second operand 5 states. [2019-11-15 23:31:03,669 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 45 states and 54 transitions. cyclomatic complexity: 13. Second operand 5 states. Result 68 states and 78 transitions. Complement of second has 15 states. [2019-11-15 23:31:03,671 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 2 stem states 3 non-accepting loop states 1 accepting loop states [2019-11-15 23:31:03,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2019-11-15 23:31:03,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 22 transitions. [2019-11-15 23:31:03,672 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 22 transitions. Stem has 22 letters. Loop has 3 letters. [2019-11-15 23:31:03,672 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 23:31:03,672 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 22 transitions. Stem has 25 letters. Loop has 3 letters. [2019-11-15 23:31:03,672 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 23:31:03,673 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 22 transitions. Stem has 22 letters. Loop has 6 letters. [2019-11-15 23:31:03,673 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 23:31:03,673 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 68 states and 78 transitions. [2019-11-15 23:31:03,675 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-11-15 23:31:03,675 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 68 states to 0 states and 0 transitions. [2019-11-15 23:31:03,675 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2019-11-15 23:31:03,675 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2019-11-15 23:31:03,675 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2019-11-15 23:31:03,675 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-15 23:31:03,675 INFO L688 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-15 23:31:03,675 INFO L711 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-15 23:31:03,675 INFO L591 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-15 23:31:03,675 INFO L424 BuchiCegarLoop]: ======== Iteration 6============ [2019-11-15 23:31:03,676 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2019-11-15 23:31:03,676 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-11-15 23:31:03,676 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2019-11-15 23:31:03,681 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 15.11 11:31:03 BoogieIcfgContainer [2019-11-15 23:31:03,681 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2019-11-15 23:31:03,681 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-15 23:31:03,681 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-15 23:31:03,681 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-15 23:31:03,682 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 11:30:50" (3/4) ... [2019-11-15 23:31:03,684 INFO L140 WitnessPrinter]: No result that supports witness generation found [2019-11-15 23:31:03,684 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-15 23:31:03,685 INFO L168 Benchmark]: Toolchain (without parser) took 14329.34 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 251.7 MB). Free memory was 941.1 MB in the beginning and 1.0 GB in the end (delta: -103.1 MB). Peak memory consumption was 148.6 MB. Max. memory is 11.5 GB. [2019-11-15 23:31:03,686 INFO L168 Benchmark]: CDTParser took 0.22 ms. Allocated memory is still 1.0 GB. Free memory is still 958.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-15 23:31:03,686 INFO L168 Benchmark]: CACSL2BoogieTranslator took 329.74 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 153.1 MB). Free memory was 941.1 MB in the beginning and 1.1 GB in the end (delta: -206.9 MB). Peak memory consumption was 23.0 MB. Max. memory is 11.5 GB. [2019-11-15 23:31:03,686 INFO L168 Benchmark]: Boogie Procedure Inliner took 45.60 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-15 23:31:03,687 INFO L168 Benchmark]: Boogie Preprocessor took 36.75 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2019-11-15 23:31:03,687 INFO L168 Benchmark]: RCFGBuilder took 315.13 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 18.4 MB). Peak memory consumption was 18.4 MB. Max. memory is 11.5 GB. [2019-11-15 23:31:03,688 INFO L168 Benchmark]: BuchiAutomizer took 13595.47 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 98.6 MB). Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 80.1 MB). Peak memory consumption was 178.6 MB. Max. memory is 11.5 GB. [2019-11-15 23:31:03,688 INFO L168 Benchmark]: Witness Printer took 2.87 ms. Allocated memory is still 1.3 GB. Free memory is still 1.0 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-15 23:31:03,691 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.22 ms. Allocated memory is still 1.0 GB. Free memory is still 958.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 329.74 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 153.1 MB). Free memory was 941.1 MB in the beginning and 1.1 GB in the end (delta: -206.9 MB). Peak memory consumption was 23.0 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 45.60 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 36.75 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 315.13 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 18.4 MB). Peak memory consumption was 18.4 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 13595.47 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 98.6 MB). Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 80.1 MB). Peak memory consumption was 178.6 MB. Max. memory is 11.5 GB. * Witness Printer took 2.87 ms. Allocated memory is still 1.3 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 - 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 (2 trivial, 2 deterministic, 1 nondeterministic). One deterministic module has affine ranking function unknown-#memory_int-unknown[qq][qq] and consists of 8 locations. One deterministic module has affine ranking function 2 * unknown-#memory_int-unknown[op][op] + 1 and consists of 5 locations. One nondeterministic module has affine ranking function 2 * unknown-#memory_int-unknown[op][op] + 1 and consists of 6 locations. 2 modules have a trivial ranking function, the largest among these consists of 14 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 13.5s and 6 iterations. TraceHistogramMax:2. Analysis of lassos took 11.5s. Construction of modules took 0.3s. Büchi inclusion checks took 1.4s. Highest rank in rank-based complementation 3. Minimization of det autom 2. Minimization of nondet autom 3. Automata minimization 0.0s AutomataMinimizationTime, 4 MinimizatonAttempts, 18 StatesRemovedByMinimization, 3 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 83 states and ocurred in iteration 3. Nontrivial modules had stage [2, 0, 1, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 4/4 HoareTripleCheckerStatistics: 82 SDtfs, 61 SDslu, 148 SDs, 0 SdLazy, 236 SolverSat, 43 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.3s Time LassoAnalysisResults: nont0 unkn0 SFLI1 SFLT0 conc0 concLT0 SILN0 SILU1 SILI0 SILT0 lasso3 LassoPreprocessingBenchmarks: Lassos: inital385 mio100 ax100 hnf100 lsp98 ukn41 mio100 lsp29 div100 bol100 ite100 ukn100 eq197 hnf88 smp100 dnf386 smp88 tf100 neg86 sie151 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 62ms VariablesStem: 5 VariablesLoop: 2 DisjunctsStem: 16 DisjunctsLoop: 2 SupportingInvariants: 4 MotzkinApplications: 76 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...