./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/termination-recursive-malloc/rec_malloc_ex3.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_9642a027-d584-4d47-bb7c-0901518b2e3a/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_9642a027-d584-4d47-bb7c-0901518b2e3a/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_9642a027-d584-4d47-bb7c-0901518b2e3a/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_9642a027-d584-4d47-bb7c-0901518b2e3a/bin/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/termination-recursive-malloc/rec_malloc_ex3.i -s /tmp/vcloud-vcloud-master/worker/run_dir_9642a027-d584-4d47-bb7c-0901518b2e3a/bin/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_9642a027-d584-4d47-bb7c-0901518b2e3a/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 a96be28be4b50f026536d78db5ba85eeb0ae4413 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. 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:06:46,965 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-15 23:06:46,967 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-15 23:06:46,983 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-15 23:06:46,984 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-15 23:06:46,985 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-15 23:06:46,987 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-15 23:06:46,997 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-15 23:06:47,002 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-15 23:06:47,005 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-15 23:06:47,006 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-15 23:06:47,007 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-15 23:06:47,007 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-15 23:06:47,008 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-15 23:06:47,008 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-15 23:06:47,009 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-15 23:06:47,010 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-15 23:06:47,011 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-15 23:06:47,012 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-15 23:06:47,014 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-15 23:06:47,019 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-15 23:06:47,021 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-15 23:06:47,024 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-15 23:06:47,025 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-15 23:06:47,029 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-15 23:06:47,030 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-15 23:06:47,030 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-15 23:06:47,032 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-15 23:06:47,033 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-15 23:06:47,034 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-15 23:06:47,035 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-15 23:06:47,036 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-15 23:06:47,037 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-15 23:06:47,038 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-15 23:06:47,041 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-15 23:06:47,041 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-15 23:06:47,042 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-15 23:06:47,042 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-15 23:06:47,042 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-15 23:06:47,043 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-15 23:06:47,044 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-15 23:06:47,045 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_9642a027-d584-4d47-bb7c-0901518b2e3a/bin/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf [2019-11-15 23:06:47,075 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-15 23:06:47,075 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-15 23:06:47,076 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-15 23:06:47,077 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-15 23:06:47,077 INFO L138 SettingsManager]: * Use SBE=true [2019-11-15 23:06:47,077 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-11-15 23:06:47,077 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-11-15 23:06:47,077 INFO L138 SettingsManager]: * Use old map elimination=false [2019-11-15 23:06:47,078 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2019-11-15 23:06:47,078 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2019-11-15 23:06:47,078 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-11-15 23:06:47,078 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-15 23:06:47,079 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-11-15 23:06:47,079 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-15 23:06:47,079 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-15 23:06:47,079 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-11-15 23:06:47,080 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-11-15 23:06:47,080 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-11-15 23:06:47,080 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-15 23:06:47,080 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-11-15 23:06:47,080 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-15 23:06:47,081 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-11-15 23:06:47,081 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-15 23:06:47,081 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-15 23:06:47,093 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-11-15 23:06:47,093 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-15 23:06:47,094 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-15 23:06:47,094 INFO L138 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-11-15 23:06:47,095 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-11-15 23:06:47,095 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_9642a027-d584-4d47-bb7c-0901518b2e3a/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 -> a96be28be4b50f026536d78db5ba85eeb0ae4413 [2019-11-15 23:06:47,136 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-15 23:06:47,151 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-15 23:06:47,155 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-15 23:06:47,157 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-15 23:06:47,158 INFO L275 PluginConnector]: CDTParser initialized [2019-11-15 23:06:47,159 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_9642a027-d584-4d47-bb7c-0901518b2e3a/bin/uautomizer/../../sv-benchmarks/c/termination-recursive-malloc/rec_malloc_ex3.i [2019-11-15 23:06:47,228 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_9642a027-d584-4d47-bb7c-0901518b2e3a/bin/uautomizer/data/57be5e834/765fb82899724d6c91b6d225db5b93a9/FLAG1815a34c1 [2019-11-15 23:06:47,711 INFO L306 CDTParser]: Found 1 translation units. [2019-11-15 23:06:47,712 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_9642a027-d584-4d47-bb7c-0901518b2e3a/sv-benchmarks/c/termination-recursive-malloc/rec_malloc_ex3.i [2019-11-15 23:06:47,718 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_9642a027-d584-4d47-bb7c-0901518b2e3a/bin/uautomizer/data/57be5e834/765fb82899724d6c91b6d225db5b93a9/FLAG1815a34c1 [2019-11-15 23:06:48,108 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_9642a027-d584-4d47-bb7c-0901518b2e3a/bin/uautomizer/data/57be5e834/765fb82899724d6c91b6d225db5b93a9 [2019-11-15 23:06:48,111 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-15 23:06:48,121 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-15 23:06:48,122 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-15 23:06:48,123 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-15 23:06:48,127 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-15 23:06:48,128 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 11:06:48" (1/1) ... [2019-11-15 23:06:48,130 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@41343112 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:06:48, skipping insertion in model container [2019-11-15 23:06:48,130 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 11:06:48" (1/1) ... [2019-11-15 23:06:48,137 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-15 23:06:48,154 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-15 23:06:48,398 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-15 23:06:48,426 INFO L188 MainTranslator]: Completed pre-run [2019-11-15 23:06:48,443 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-15 23:06:48,459 INFO L192 MainTranslator]: Completed translation [2019-11-15 23:06:48,459 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:06:48 WrapperNode [2019-11-15 23:06:48,460 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-15 23:06:48,461 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-15 23:06:48,461 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-15 23:06:48,461 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-15 23:06:48,470 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:06:48" (1/1) ... [2019-11-15 23:06:48,478 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:06:48" (1/1) ... [2019-11-15 23:06:48,496 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-15 23:06:48,496 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-15 23:06:48,496 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-15 23:06:48,496 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-15 23:06:48,506 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:06:48" (1/1) ... [2019-11-15 23:06:48,507 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:06:48" (1/1) ... [2019-11-15 23:06:48,508 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:06:48" (1/1) ... [2019-11-15 23:06:48,509 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:06:48" (1/1) ... [2019-11-15 23:06:48,513 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:06:48" (1/1) ... [2019-11-15 23:06:48,529 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:06:48" (1/1) ... [2019-11-15 23:06:48,530 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:06:48" (1/1) ... [2019-11-15 23:06:48,532 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-15 23:06:48,533 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-15 23:06:48,533 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-15 23:06:48,533 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-15 23:06:48,536 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:06:48" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_9642a027-d584-4d47-bb7c-0901518b2e3a/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:06:48,618 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-11-15 23:06:48,619 INFO L130 BoogieDeclarations]: Found specification of procedure rec [2019-11-15 23:06:48,619 INFO L138 BoogieDeclarations]: Found implementation of procedure rec [2019-11-15 23:06:48,620 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-11-15 23:06:48,620 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-15 23:06:48,620 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-15 23:06:48,620 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-11-15 23:06:48,620 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-15 23:06:48,856 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-15 23:06:48,856 INFO L284 CfgBuilder]: Removed 5 assume(true) statements. [2019-11-15 23:06:48,857 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 11:06:48 BoogieIcfgContainer [2019-11-15 23:06:48,858 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-15 23:06:48,858 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-11-15 23:06:48,858 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-11-15 23:06:48,864 INFO L275 PluginConnector]: BuchiAutomizer initialized [2019-11-15 23:06:48,864 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-15 23:06:48,865 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 15.11 11:06:48" (1/3) ... [2019-11-15 23:06:48,866 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@6401e5ee and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 15.11 11:06:48, skipping insertion in model container [2019-11-15 23:06:48,866 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-15 23:06:48,866 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:06:48" (2/3) ... [2019-11-15 23:06:48,866 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@6401e5ee and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 15.11 11:06:48, skipping insertion in model container [2019-11-15 23:06:48,866 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-15 23:06:48,867 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 11:06:48" (3/3) ... [2019-11-15 23:06:48,868 INFO L371 chiAutomizerObserver]: Analyzing ICFG rec_malloc_ex3.i [2019-11-15 23:06:48,938 INFO L356 BuchiCegarLoop]: Interprodecural is true [2019-11-15 23:06:48,939 INFO L357 BuchiCegarLoop]: Hoare is false [2019-11-15 23:06:48,939 INFO L358 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-11-15 23:06:48,939 INFO L359 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-15 23:06:48,939 INFO L360 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-15 23:06:48,939 INFO L361 BuchiCegarLoop]: Difference is false [2019-11-15 23:06:48,939 INFO L362 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-15 23:06:48,940 INFO L365 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-11-15 23:06:48,970 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 14 states. [2019-11-15 23:06:49,009 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2019-11-15 23:06:49,010 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 23:06:49,010 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 23:06:49,018 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2019-11-15 23:06:49,018 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:06:49,018 INFO L424 BuchiCegarLoop]: ======== Iteration 1============ [2019-11-15 23:06:49,018 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 14 states. [2019-11-15 23:06:49,020 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2019-11-15 23:06:49,020 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 23:06:49,021 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 23:06:49,021 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2019-11-15 23:06:49,021 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:06:49,030 INFO L791 eck$LassoCheckResult]: Stem: 10#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 8#L-1true havoc main_#res;havoc main_#t~nondet6, main_#t~malloc7.base, main_#t~malloc7.offset, main_#t~nondet8, main_#t~ret9, main_~op~0.base, main_~op~0.offset, main_~i~0;main_~i~0 := main_#t~nondet6;havoc main_#t~nondet6; 5#L20-2true [2019-11-15 23:06:49,031 INFO L793 eck$LassoCheckResult]: Loop: 5#L20-2true assume !!(main_~i~0 > 0);call main_#t~malloc7.base, main_#t~malloc7.offset := #Ultimate.allocOnHeap(4);main_~op~0.base, main_~op~0.offset := main_#t~malloc7.base, main_#t~malloc7.offset;call write~int(main_#t~nondet8, main_~op~0.base, main_~op~0.offset, 4);havoc main_#t~nondet8; 13#L23true call main_#t~ret9 := rec(main_~op~0.base, main_~op~0.offset);< 4#recENTRYtrue ~p.base, ~p.offset := #in~p.base, #in~p.offset;call #t~mem1 := read~int(~p.base, ~p.offset, 4); 9#L9true assume #t~mem1 < 0;havoc #t~mem1;call #t~mem2 := read~int(~p.base, ~p.offset, 4);~pv~0 := #t~mem2;havoc #t~mem2;call ULTIMATE.dealloc(~p.base, ~p.offset);#res := ~pv~0; 15#recFINALtrue assume true; 12#recEXITtrue >#30#return; 11#L23-1true main_~i~0 := main_~i~0 + main_#t~ret9;havoc main_#t~ret9; 5#L20-2true [2019-11-15 23:06:49,037 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:06:49,037 INFO L82 PathProgramCache]: Analyzing trace with hash 1219, now seen corresponding path program 1 times [2019-11-15 23:06:49,048 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:06:49,048 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1509577131] [2019-11-15 23:06:49,049 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:06:49,049 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:06:49,049 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:06:49,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:06:49,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:06:49,226 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 23:06:49,228 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:06:49,228 INFO L82 PathProgramCache]: Analyzing trace with hash -2039113776, now seen corresponding path program 1 times [2019-11-15 23:06:49,229 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:06:49,229 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1276445110] [2019-11-15 23:06:49,230 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:06:49,230 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:06:49,230 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:06:49,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:06:49,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:06:49,351 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 23:06:49,352 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:06:49,353 INFO L82 PathProgramCache]: Analyzing trace with hash -1009969970, now seen corresponding path program 1 times [2019-11-15 23:06:49,353 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:06:49,353 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [616867509] [2019-11-15 23:06:49,353 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:06:49,354 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:06:49,354 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:06:49,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:06:49,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:06:49,398 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 23:06:49,930 WARN L191 SmtUtils]: Spent 279.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 66 [2019-11-15 23:06:50,025 INFO L210 LassoAnalysis]: Preferences: [2019-11-15 23:06:50,026 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-11-15 23:06:50,026 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-15 23:06:50,027 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-11-15 23:06:50,027 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-11-15 23:06:50,027 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 23:06:50,027 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-15 23:06:50,028 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-11-15 23:06:50,028 INFO L131 ssoRankerPreferences]: Filename of dumped script: rec_malloc_ex3.i_Iteration1_Lasso [2019-11-15 23:06:50,028 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-15 23:06:50,029 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-15 23:06:50,057 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:06:50,068 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:06:50,071 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:06:50,078 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:06:50,081 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:06:50,085 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:06:50,220 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:06:50,455 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-15 23:06:50,461 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-11-15 23:06:50,464 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:06:50,466 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:06:50,466 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:06:50,467 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:06:50,467 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:06:50,468 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:06:50,470 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 23:06:50,470 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:06:50,490 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:06:50,491 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:06:50,492 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:06:50,492 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:06:50,492 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:06:50,492 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:06:50,492 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:06:50,493 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 23:06:50,493 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:06:50,494 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:06:50,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:06:50,495 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:06:50,495 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:06:50,496 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:06:50,496 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:06:50,499 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 23:06:50,499 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 23:06:50,513 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:06:50,514 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:06:50,514 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:06:50,515 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:06:50,515 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:06:50,515 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:06:50,515 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:06:50,516 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 23:06:50,516 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:06:50,517 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:06:50,518 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:06:50,518 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:06:50,519 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:06:50,519 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:06:50,519 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:06:50,519 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:06:50,520 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 23:06:50,520 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:06:50,521 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:06:50,522 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:06:50,522 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:06:50,523 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:06:50,527 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:06:50,528 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:06:50,528 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:06:50,530 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 23:06:50,530 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:06:50,536 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:06:50,536 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:06:50,538 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:06:50,538 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:06:50,538 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:06:50,538 INFO L203 nArgumentSynthesizer]: 2 loop disjuncts [2019-11-15 23:06:50,538 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:06:50,544 INFO L400 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-11-15 23:06:50,544 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:06:50,563 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:06:50,564 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:06:50,565 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:06:50,565 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:06:50,565 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:06:50,565 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:06:50,571 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 23:06:50,572 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 23:06:50,590 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:06:50,591 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:06:50,592 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:06:50,592 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:06:50,592 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:06:50,593 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:06:50,593 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:06:50,594 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 23:06:50,594 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:06:50,611 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-15 23:06:50,617 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-11-15 23:06:50,617 INFO L444 ModelExtractionUtils]: 2 out of 5 variables were initially zero. Simplification set additionally 1 variables to zero. [2019-11-15 23:06:50,619 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-15 23:06:50,620 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-11-15 23:06:50,620 INFO L510 LassoAnalysis]: Proved termination. [2019-11-15 23:06:50,621 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0) = 1*ULTIMATE.start_main_~i~0 Supporting invariants [] [2019-11-15 23:06:50,624 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-11-15 23:06:50,648 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:06:50,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:06:50,661 INFO L256 TraceCheckSpWp]: Trace formula consists of 9 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-15 23:06:50,663 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:06:50,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:06:50,715 INFO L256 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 11 conjunts are in the unsatisfiable core [2019-11-15 23:06:50,717 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:06:50,809 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 17 treesize of output 9 [2019-11-15 23:06:50,810 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 23:06:50,828 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:06:50,828 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:06:50,828 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:20, output treesize:9 [2019-11-15 23:06:50,874 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:06:50,892 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:06:50,894 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 14 states. Second operand 7 states. [2019-11-15 23:06:51,060 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 14 states.. Second operand 7 states. Result 63 states and 77 transitions. Complement of second has 22 states. [2019-11-15 23:06:51,061 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 9 states 1 stem states 6 non-accepting loop states 1 accepting loop states [2019-11-15 23:06:51,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2019-11-15 23:06:51,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 22 transitions. [2019-11-15 23:06:51,067 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 22 transitions. Stem has 2 letters. Loop has 7 letters. [2019-11-15 23:06:51,070 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 23:06:51,070 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 22 transitions. Stem has 9 letters. Loop has 7 letters. [2019-11-15 23:06:51,070 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 23:06:51,071 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 22 transitions. Stem has 2 letters. Loop has 14 letters. [2019-11-15 23:06:51,071 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 23:06:51,072 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 63 states and 77 transitions. [2019-11-15 23:06:51,091 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 9 [2019-11-15 23:06:51,115 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 63 states to 35 states and 42 transitions. [2019-11-15 23:06:51,123 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 27 [2019-11-15 23:06:51,124 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 28 [2019-11-15 23:06:51,125 INFO L73 IsDeterministic]: Start isDeterministic. Operand 35 states and 42 transitions. [2019-11-15 23:06:51,125 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-15 23:06:51,125 INFO L688 BuchiCegarLoop]: Abstraction has 35 states and 42 transitions. [2019-11-15 23:06:51,146 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states and 42 transitions. [2019-11-15 23:06:51,158 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 32. [2019-11-15 23:06:51,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2019-11-15 23:06:51,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 38 transitions. [2019-11-15 23:06:51,161 INFO L711 BuchiCegarLoop]: Abstraction has 32 states and 38 transitions. [2019-11-15 23:06:51,162 INFO L591 BuchiCegarLoop]: Abstraction has 32 states and 38 transitions. [2019-11-15 23:06:51,162 INFO L424 BuchiCegarLoop]: ======== Iteration 2============ [2019-11-15 23:06:51,162 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 32 states and 38 transitions. [2019-11-15 23:06:51,164 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 9 [2019-11-15 23:06:51,164 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 23:06:51,164 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 23:06:51,165 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:06:51,165 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-11-15 23:06:51,165 INFO L791 eck$LassoCheckResult]: Stem: 166#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 161#L-1 havoc main_#res;havoc main_#t~nondet6, main_#t~malloc7.base, main_#t~malloc7.offset, main_#t~nondet8, main_#t~ret9, main_~op~0.base, main_~op~0.offset, main_~i~0;main_~i~0 := main_#t~nondet6;havoc main_#t~nondet6; 162#L20-2 assume !!(main_~i~0 > 0);call main_#t~malloc7.base, main_#t~malloc7.offset := #Ultimate.allocOnHeap(4);main_~op~0.base, main_~op~0.offset := main_#t~malloc7.base, main_#t~malloc7.offset;call write~int(main_#t~nondet8, main_~op~0.base, main_~op~0.offset, 4);havoc main_#t~nondet8; 174#L23 call main_#t~ret9 := rec(main_~op~0.base, main_~op~0.offset);< 175#recENTRY ~p.base, ~p.offset := #in~p.base, #in~p.offset;call #t~mem1 := read~int(~p.base, ~p.offset, 4); 185#L9 assume !(#t~mem1 < 0);havoc #t~mem1;call #t~mem3 := read~int(~p.base, ~p.offset, 4);#t~post4 := #t~mem3;call write~int(#t~post4 - 1, ~p.base, ~p.offset, 4);havoc #t~post4;havoc #t~mem3; 156#L15 call #t~ret5 := rec(~p.base, ~p.offset);< 164#recENTRY [2019-11-15 23:06:51,166 INFO L793 eck$LassoCheckResult]: Loop: 164#recENTRY ~p.base, ~p.offset := #in~p.base, #in~p.offset;call #t~mem1 := read~int(~p.base, ~p.offset, 4); 154#L9 assume !(#t~mem1 < 0);havoc #t~mem1;call #t~mem3 := read~int(~p.base, ~p.offset, 4);#t~post4 := #t~mem3;call write~int(#t~post4 - 1, ~p.base, ~p.offset, 4);havoc #t~post4;havoc #t~mem3; 155#L15 call #t~ret5 := rec(~p.base, ~p.offset);< 164#recENTRY [2019-11-15 23:06:51,166 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:06:51,166 INFO L82 PathProgramCache]: Analyzing trace with hash 557607690, now seen corresponding path program 1 times [2019-11-15 23:06:51,167 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:06:51,167 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1420669371] [2019-11-15 23:06:51,167 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:06:51,168 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:06:51,168 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:06:51,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:06:51,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:06:51,205 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 23:06:51,206 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:06:51,207 INFO L82 PathProgramCache]: Analyzing trace with hash 29942, now seen corresponding path program 1 times [2019-11-15 23:06:51,207 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:06:51,208 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1145341792] [2019-11-15 23:06:51,209 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:06:51,209 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:06:51,210 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:06:51,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:06:51,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:06:51,237 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 23:06:51,239 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:06:51,239 INFO L82 PathProgramCache]: Analyzing trace with hash -1242807987, now seen corresponding path program 2 times [2019-11-15 23:06:51,240 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:06:51,242 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1114669610] [2019-11-15 23:06:51,242 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:06:51,243 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:06:51,243 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:06:51,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:06:51,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:06:51,288 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 23:06:51,760 WARN L191 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 51 [2019-11-15 23:06:52,033 WARN L191 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 66 [2019-11-15 23:06:52,106 INFO L210 LassoAnalysis]: Preferences: [2019-11-15 23:06:52,106 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-11-15 23:06:52,107 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-15 23:06:52,107 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-11-15 23:06:52,107 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-11-15 23:06:52,107 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 23:06:52,107 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-15 23:06:52,107 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-11-15 23:06:52,107 INFO L131 ssoRankerPreferences]: Filename of dumped script: rec_malloc_ex3.i_Iteration2_Lasso [2019-11-15 23:06:52,107 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-15 23:06:52,108 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-15 23:06:52,112 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:06:52,115 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:06:52,117 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:06:52,119 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:06:52,121 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:06:52,124 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:06:52,127 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:06:52,129 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:06:52,131 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:06:52,133 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:06:52,135 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:06:52,137 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:06:52,139 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:06:52,141 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:06:52,144 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:06:52,145 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:06:52,147 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:06:52,149 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:06:52,151 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:06:52,153 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:06:52,155 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:06:52,156 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:06:52,158 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:06:52,160 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:06:52,161 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:06:52,521 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-15 23:06:52,521 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-11-15 23:06:52,522 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:06:52,523 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:06:52,523 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:06:52,524 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:06:52,524 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:06:52,524 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:06:52,524 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 23:06:52,525 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:06:52,526 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:06:52,526 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:06:52,527 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:06:52,527 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:06:52,527 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:06:52,527 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:06:52,528 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:06:52,528 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 23:06:52,528 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:06:52,528 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:06:52,529 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:06:52,530 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:06:52,530 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:06:52,530 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:06:52,530 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:06:52,531 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:06:52,531 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 23:06:52,531 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:06:52,532 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:06:52,532 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:06:52,533 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:06:52,533 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:06:52,533 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:06:52,534 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:06:52,534 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:06:52,534 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 23:06:52,534 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:06:52,535 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:06:52,536 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:06:52,537 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:06:52,537 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:06:52,537 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:06:52,537 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:06:52,549 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 23:06:52,550 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 23:06:52,553 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:06:52,553 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:06:52,554 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:06:52,554 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:06:52,554 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:06:52,555 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:06:52,555 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:06:52,555 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 23:06:52,555 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:06:52,556 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:06:52,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:06:52,557 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:06:52,557 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:06:52,558 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:06:52,558 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:06:52,558 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:06:52,559 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 23:06:52,566 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:06:52,568 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:06:52,568 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:06:52,569 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:06:52,569 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:06:52,569 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:06:52,569 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:06:52,570 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:06:52,570 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 23:06:52,570 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:06:52,571 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:06:52,572 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:06:52,572 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:06:52,572 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:06:52,573 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:06:52,573 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:06:52,573 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:06:52,573 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 23:06:52,574 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:06:52,574 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:06:52,575 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:06:52,576 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:06:52,576 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:06:52,576 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:06:52,576 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:06:52,576 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:06:52,577 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 23:06:52,577 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:06:52,578 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:06:52,578 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:06:52,579 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:06:52,579 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:06:52,579 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:06:52,579 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:06:52,581 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 23:06:52,581 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 23:06:52,583 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:06:52,584 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:06:52,585 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:06:52,585 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:06:52,585 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:06:52,585 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:06:52,586 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:06:52,586 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 23:06:52,586 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:06:52,587 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:06:52,588 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:06:52,588 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:06:52,589 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:06:52,589 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:06:52,589 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:06:52,589 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:06:52,590 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 23:06:52,590 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:06:52,591 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:06:52,591 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:06:52,592 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:06:52,592 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:06:52,592 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:06:52,592 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:06:52,593 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:06:52,593 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 23:06:52,593 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:06:52,594 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:06:52,595 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:06:52,595 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:06:52,596 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:06:52,596 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:06:52,596 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:06:52,596 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:06:52,597 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 23:06:52,597 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:06:52,598 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:06:52,598 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:06:52,599 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:06:52,599 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:06:52,599 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:06:52,600 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:06:52,600 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:06:52,600 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 23:06:52,600 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:06:52,601 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:06:52,602 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:06:52,602 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:06:52,603 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:06:52,603 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:06:52,603 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:06:52,603 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:06:52,604 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 23:06:52,604 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:06:52,605 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:06:52,611 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:06:52,612 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:06:52,613 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:06:52,613 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:06:52,613 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:06:52,613 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:06:52,614 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 23:06:52,614 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:06:52,615 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:06:52,616 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:06:52,617 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:06:52,619 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:06:52,619 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:06:52,620 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:06:52,620 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:06:52,621 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 23:06:52,621 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:06:52,622 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:06:52,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:06:52,623 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:06:52,624 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:06:52,625 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:06:52,625 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:06:52,625 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:06:52,625 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 23:06:52,626 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:06:52,628 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:06:52,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:06:52,629 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:06:52,630 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:06:52,630 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:06:52,630 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:06:52,630 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:06:52,631 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 23:06:52,631 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:06:52,632 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:06:52,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:06:52,634 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:06:52,634 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:06:52,634 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:06:52,634 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:06:52,634 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:06:52,635 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 23:06:52,635 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:06:52,639 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:06:52,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:06:52,640 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:06:52,640 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:06:52,641 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:06:52,641 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:06:52,641 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:06:52,642 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 23:06:52,642 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:06:52,647 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:06:52,648 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:06:52,649 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:06:52,654 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:06:52,654 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:06:52,655 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:06:52,657 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 23:06:52,661 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 23:06:52,675 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:06:52,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:06:52,684 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:06:52,684 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:06:52,684 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:06:52,685 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:06:52,686 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 23:06:52,695 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 23:06:52,700 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:06:52,703 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:06:52,704 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:06:52,705 INFO L202 nArgumentSynthesizer]: 2 stem disjuncts [2019-11-15 23:06:52,709 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:06:52,710 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:06:52,712 INFO L400 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2019-11-15 23:06:52,712 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 23:06:52,719 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:06:52,727 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:06:52,728 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:06:52,728 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:06:52,729 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:06:52,729 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:06:52,730 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 23:06:52,733 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 23:06:52,761 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-15 23:06:52,773 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-11-15 23:06:52,779 INFO L444 ModelExtractionUtils]: 7 out of 10 variables were initially zero. Simplification set additionally 0 variables to zero. [2019-11-15 23:06:52,780 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-15 23:06:52,782 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-11-15 23:06:52,784 INFO L510 LassoAnalysis]: Proved termination. [2019-11-15 23:06:52,784 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int rec_#in~p.base) rec_#in~p.offset)_1) = 2*v_rep(select (select #memory_int rec_#in~p.base) rec_#in~p.offset)_1 + 1 Supporting invariants [] [2019-11-15 23:06:52,786 INFO L297 tatePredicateManager]: 1 out of 1 supporting invariants were superfluous and have been removed [2019-11-15 23:06:52,792 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-11-15 23:06:52,809 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:06:52,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:06:52,835 INFO L256 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-15 23:06:52,837 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:06:52,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:06:52,851 INFO L256 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 17 conjunts are in the unsatisfiable core [2019-11-15 23:06:52,852 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:06:52,894 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 0 case distinctions, treesize of input 36 treesize of output 20 [2019-11-15 23:06:52,895 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 23:06:52,904 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:06:52,904 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 23:06:52,904 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:36, output treesize:21 [2019-11-15 23:06:52,921 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:06:52,921 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:06:52,921 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 32 states and 38 transitions. cyclomatic complexity: 10 Second operand 4 states. [2019-11-15 23:06:53,049 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 32 states and 38 transitions. cyclomatic complexity: 10. Second operand 4 states. Result 47 states and 56 transitions. Complement of second has 17 states. [2019-11-15 23:06:53,051 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:06:53,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-11-15 23:06:53,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 16 transitions. [2019-11-15 23:06:53,052 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 16 transitions. Stem has 7 letters. Loop has 3 letters. [2019-11-15 23:06:53,053 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 23:06:53,053 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 16 transitions. Stem has 10 letters. Loop has 3 letters. [2019-11-15 23:06:53,053 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 23:06:53,053 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 16 transitions. Stem has 7 letters. Loop has 6 letters. [2019-11-15 23:06:53,054 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 23:06:53,054 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 47 states and 56 transitions. [2019-11-15 23:06:53,056 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2019-11-15 23:06:53,058 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 47 states to 41 states and 50 transitions. [2019-11-15 23:06:53,058 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 27 [2019-11-15 23:06:53,059 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 29 [2019-11-15 23:06:53,059 INFO L73 IsDeterministic]: Start isDeterministic. Operand 41 states and 50 transitions. [2019-11-15 23:06:53,061 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-15 23:06:53,061 INFO L688 BuchiCegarLoop]: Abstraction has 41 states and 50 transitions. [2019-11-15 23:06:53,062 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states and 50 transitions. [2019-11-15 23:06:53,069 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 39. [2019-11-15 23:06:53,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2019-11-15 23:06:53,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 46 transitions. [2019-11-15 23:06:53,075 INFO L711 BuchiCegarLoop]: Abstraction has 39 states and 46 transitions. [2019-11-15 23:06:53,076 INFO L591 BuchiCegarLoop]: Abstraction has 39 states and 46 transitions. [2019-11-15 23:06:53,076 INFO L424 BuchiCegarLoop]: ======== Iteration 3============ [2019-11-15 23:06:53,076 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 39 states and 46 transitions. [2019-11-15 23:06:53,079 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2019-11-15 23:06:53,080 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 23:06:53,080 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 23:06:53,081 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:06:53,081 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:06:53,081 INFO L791 eck$LassoCheckResult]: Stem: 317#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 310#L-1 havoc main_#res;havoc main_#t~nondet6, main_#t~malloc7.base, main_#t~malloc7.offset, main_#t~nondet8, main_#t~ret9, main_~op~0.base, main_~op~0.offset, main_~i~0;main_~i~0 := main_#t~nondet6;havoc main_#t~nondet6; 311#L20-2 assume !!(main_~i~0 > 0);call main_#t~malloc7.base, main_#t~malloc7.offset := #Ultimate.allocOnHeap(4);main_~op~0.base, main_~op~0.offset := main_#t~malloc7.base, main_#t~malloc7.offset;call write~int(main_#t~nondet8, main_~op~0.base, main_~op~0.offset, 4);havoc main_#t~nondet8; 329#L23 call main_#t~ret9 := rec(main_~op~0.base, main_~op~0.offset);< 339#recENTRY ~p.base, ~p.offset := #in~p.base, #in~p.offset;call #t~mem1 := read~int(~p.base, ~p.offset, 4); 338#L9 assume !(#t~mem1 < 0);havoc #t~mem1;call #t~mem3 := read~int(~p.base, ~p.offset, 4);#t~post4 := #t~mem3;call write~int(#t~post4 - 1, ~p.base, ~p.offset, 4);havoc #t~post4;havoc #t~mem3; 309#L15 call #t~ret5 := rec(~p.base, ~p.offset);< 314#recENTRY ~p.base, ~p.offset := #in~p.base, #in~p.offset;call #t~mem1 := read~int(~p.base, ~p.offset, 4); 315#L9 assume #t~mem1 < 0;havoc #t~mem1;call #t~mem2 := read~int(~p.base, ~p.offset, 4);~pv~0 := #t~mem2;havoc #t~mem2;call ULTIMATE.dealloc(~p.base, ~p.offset);#res := ~pv~0; 343#recFINAL assume true; 322#recEXIT >#28#return; 323#L15-1 #res := #t~ret5;havoc #t~ret5; 337#recFINAL assume true; 332#recEXIT >#30#return; 318#L23-1 [2019-11-15 23:06:53,081 INFO L793 eck$LassoCheckResult]: Loop: 318#L23-1 main_~i~0 := main_~i~0 + main_#t~ret9;havoc main_#t~ret9; 319#L20-2 assume !!(main_~i~0 > 0);call main_#t~malloc7.base, main_#t~malloc7.offset := #Ultimate.allocOnHeap(4);main_~op~0.base, main_~op~0.offset := main_#t~malloc7.base, main_#t~malloc7.offset;call write~int(main_#t~nondet8, main_~op~0.base, main_~op~0.offset, 4);havoc main_#t~nondet8; 326#L23 call main_#t~ret9 := rec(main_~op~0.base, main_~op~0.offset);< 327#recENTRY ~p.base, ~p.offset := #in~p.base, #in~p.offset;call #t~mem1 := read~int(~p.base, ~p.offset, 4); 334#L9 assume #t~mem1 < 0;havoc #t~mem1;call #t~mem2 := read~int(~p.base, ~p.offset, 4);~pv~0 := #t~mem2;havoc #t~mem2;call ULTIMATE.dealloc(~p.base, ~p.offset);#res := ~pv~0; 336#recFINAL assume true; 341#recEXIT >#30#return; 318#L23-1 [2019-11-15 23:06:53,082 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:06:53,082 INFO L82 PathProgramCache]: Analyzing trace with hash 1969157627, now seen corresponding path program 1 times [2019-11-15 23:06:53,082 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:06:53,082 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [132771141] [2019-11-15 23:06:53,082 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:06:53,082 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:06:53,083 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:06:53,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:06:53,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:06:53,138 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 23:06:53,140 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:06:53,140 INFO L82 PathProgramCache]: Analyzing trace with hash -523709736, now seen corresponding path program 2 times [2019-11-15 23:06:53,140 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:06:53,140 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [984840973] [2019-11-15 23:06:53,140 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:06:53,140 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:06:53,141 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:06:53,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:06:53,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:06:53,152 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 23:06:53,152 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:06:53,153 INFO L82 PathProgramCache]: Analyzing trace with hash 931270558, now seen corresponding path program 1 times [2019-11-15 23:06:53,153 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:06:53,153 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [392475710] [2019-11-15 23:06:53,153 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:06:53,153 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:06:53,154 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:06:53,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:06:53,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:06:53,182 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 23:06:53,399 WARN L191 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 67 [2019-11-15 23:06:53,650 WARN L191 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 59 [2019-11-15 23:06:53,923 WARN L191 SmtUtils]: Spent 175.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 77 [2019-11-15 23:06:53,968 INFO L210 LassoAnalysis]: Preferences: [2019-11-15 23:06:53,968 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-11-15 23:06:53,968 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-15 23:06:53,968 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-11-15 23:06:53,968 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-11-15 23:06:53,968 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 23:06:53,968 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-15 23:06:53,968 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-11-15 23:06:53,969 INFO L131 ssoRankerPreferences]: Filename of dumped script: rec_malloc_ex3.i_Iteration3_Lasso [2019-11-15 23:06:53,969 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-15 23:06:53,969 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-15 23:06:53,971 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:06:54,150 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:06:54,153 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:06:54,154 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:06:54,158 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:06:54,370 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-15 23:06:54,370 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-11-15 23:06:54,370 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:06:54,371 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:06:54,371 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:06:54,371 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:06:54,371 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:06:54,373 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 23:06:54,373 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 23:06:54,382 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:06:54,382 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:06:54,383 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:06:54,383 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:06:54,383 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:06:54,384 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:06:54,384 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 23:06:54,384 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 23:06:54,385 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:06:54,386 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:06:54,386 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:06:54,387 INFO L202 nArgumentSynthesizer]: 2 stem disjuncts [2019-11-15 23:06:54,387 INFO L203 nArgumentSynthesizer]: 2 loop disjuncts [2019-11-15 23:06:54,387 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:06:54,390 INFO L400 nArgumentSynthesizer]: We have 20 Motzkin's Theorem applications. [2019-11-15 23:06:54,391 INFO L401 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2019-11-15 23:06:54,420 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:06:54,420 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:06:54,421 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:06:54,421 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:06:54,421 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:06:54,421 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:06:54,422 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 23:06:54,422 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 23:06:54,425 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:06:54,426 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:06:54,426 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:06:54,426 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:06:54,426 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:06:54,427 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:06:54,428 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 23:06:54,428 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 23:06:54,430 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:06:54,431 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:06:54,431 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:06:54,431 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:06:54,432 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:06:54,432 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:06:54,433 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 23:06:54,433 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 23:06:54,453 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-15 23:06:54,470 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2019-11-15 23:06:54,471 INFO L444 ModelExtractionUtils]: 8 out of 16 variables were initially zero. Simplification set additionally 5 variables to zero. [2019-11-15 23:06:54,471 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-15 23:06:54,472 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-11-15 23:06:54,472 INFO L510 LassoAnalysis]: Proved termination. [2019-11-15 23:06:54,472 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_#t~ret9, ULTIMATE.start_main_~i~0) = 1*ULTIMATE.start_main_#t~ret9 + 1*ULTIMATE.start_main_~i~0 Supporting invariants [] [2019-11-15 23:06:54,480 INFO L297 tatePredicateManager]: 3 out of 3 supporting invariants were superfluous and have been removed [2019-11-15 23:06:54,497 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:06:54,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:06:54,523 INFO L256 TraceCheckSpWp]: Trace formula consists of 147 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-15 23:06:54,524 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:06:54,544 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:06:54,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:06:54,561 INFO L256 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 11 conjunts are in the unsatisfiable core [2019-11-15 23:06:54,562 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:06:54,614 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 17 treesize of output 9 [2019-11-15 23:06:54,614 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 23:06:54,619 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:06:54,619 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:06:54,619 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:20, output treesize:9 [2019-11-15 23:06:54,631 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:06:54,631 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 6 loop predicates [2019-11-15 23:06:54,631 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 39 states and 46 transitions. cyclomatic complexity: 11 Second operand 8 states. [2019-11-15 23:06:54,745 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 39 states and 46 transitions. cyclomatic complexity: 11. Second operand 8 states. Result 130 states and 152 transitions. Complement of second has 21 states. [2019-11-15 23:06:54,745 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 8 states 2 stem states 5 non-accepting loop states 1 accepting loop states [2019-11-15 23:06:54,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2019-11-15 23:06:54,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 26 transitions. [2019-11-15 23:06:54,746 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 26 transitions. Stem has 14 letters. Loop has 7 letters. [2019-11-15 23:06:54,746 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 23:06:54,746 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 26 transitions. Stem has 21 letters. Loop has 7 letters. [2019-11-15 23:06:54,747 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 23:06:54,748 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 26 transitions. Stem has 14 letters. Loop has 14 letters. [2019-11-15 23:06:54,748 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 23:06:54,748 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 130 states and 152 transitions. [2019-11-15 23:06:54,753 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 9 [2019-11-15 23:06:54,755 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 130 states to 90 states and 105 transitions. [2019-11-15 23:06:54,756 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 63 [2019-11-15 23:06:54,756 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 65 [2019-11-15 23:06:54,756 INFO L73 IsDeterministic]: Start isDeterministic. Operand 90 states and 105 transitions. [2019-11-15 23:06:54,757 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-15 23:06:54,757 INFO L688 BuchiCegarLoop]: Abstraction has 90 states and 105 transitions. [2019-11-15 23:06:54,757 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states and 105 transitions. [2019-11-15 23:06:54,764 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 82. [2019-11-15 23:06:54,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2019-11-15 23:06:54,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 96 transitions. [2019-11-15 23:06:54,766 INFO L711 BuchiCegarLoop]: Abstraction has 82 states and 96 transitions. [2019-11-15 23:06:54,766 INFO L591 BuchiCegarLoop]: Abstraction has 82 states and 96 transitions. [2019-11-15 23:06:54,766 INFO L424 BuchiCegarLoop]: ======== Iteration 4============ [2019-11-15 23:06:54,766 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 82 states and 96 transitions. [2019-11-15 23:06:54,768 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 9 [2019-11-15 23:06:54,768 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 23:06:54,769 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 23:06:54,769 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:06:54,769 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-11-15 23:06:54,770 INFO L791 eck$LassoCheckResult]: Stem: 613#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 603#L-1 havoc main_#res;havoc main_#t~nondet6, main_#t~malloc7.base, main_#t~malloc7.offset, main_#t~nondet8, main_#t~ret9, main_~op~0.base, main_~op~0.offset, main_~i~0;main_~i~0 := main_#t~nondet6;havoc main_#t~nondet6; 604#L20-2 assume !!(main_~i~0 > 0);call main_#t~malloc7.base, main_#t~malloc7.offset := #Ultimate.allocOnHeap(4);main_~op~0.base, main_~op~0.offset := main_#t~malloc7.base, main_#t~malloc7.offset;call write~int(main_#t~nondet8, main_~op~0.base, main_~op~0.offset, 4);havoc main_#t~nondet8; 633#L23 call main_#t~ret9 := rec(main_~op~0.base, main_~op~0.offset);< 634#recENTRY ~p.base, ~p.offset := #in~p.base, #in~p.offset;call #t~mem1 := read~int(~p.base, ~p.offset, 4); 639#L9 assume !(#t~mem1 < 0);havoc #t~mem1;call #t~mem3 := read~int(~p.base, ~p.offset, 4);#t~post4 := #t~mem3;call write~int(#t~post4 - 1, ~p.base, ~p.offset, 4);havoc #t~post4;havoc #t~mem3; 629#L15 call #t~ret5 := rec(~p.base, ~p.offset);< 638#recENTRY ~p.base, ~p.offset := #in~p.base, #in~p.offset;call #t~mem1 := read~int(~p.base, ~p.offset, 4); 644#L9 assume #t~mem1 < 0;havoc #t~mem1;call #t~mem2 := read~int(~p.base, ~p.offset, 4);~pv~0 := #t~mem2;havoc #t~mem2;call ULTIMATE.dealloc(~p.base, ~p.offset);#res := ~pv~0; 641#recFINAL assume true; 637#recEXIT >#28#return; 636#L15-1 #res := #t~ret5;havoc #t~ret5; 635#recFINAL assume true; 632#recEXIT >#30#return; 631#L23-1 main_~i~0 := main_~i~0 + main_#t~ret9;havoc main_#t~ret9; 618#L20-2 assume !!(main_~i~0 > 0);call main_#t~malloc7.base, main_#t~malloc7.offset := #Ultimate.allocOnHeap(4);main_~op~0.base, main_~op~0.offset := main_#t~malloc7.base, main_#t~malloc7.offset;call write~int(main_#t~nondet8, main_~op~0.base, main_~op~0.offset, 4);havoc main_#t~nondet8; 622#L23 call main_#t~ret9 := rec(main_~op~0.base, main_~op~0.offset);< 623#recENTRY ~p.base, ~p.offset := #in~p.base, #in~p.offset;call #t~mem1 := read~int(~p.base, ~p.offset, 4); 673#L9 assume !(#t~mem1 < 0);havoc #t~mem1;call #t~mem3 := read~int(~p.base, ~p.offset, 4);#t~post4 := #t~mem3;call write~int(#t~post4 - 1, ~p.base, ~p.offset, 4);havoc #t~post4;havoc #t~mem3; 609#L15 call #t~ret5 := rec(~p.base, ~p.offset);< 608#recENTRY [2019-11-15 23:06:54,770 INFO L793 eck$LassoCheckResult]: Loop: 608#recENTRY ~p.base, ~p.offset := #in~p.base, #in~p.offset;call #t~mem1 := read~int(~p.base, ~p.offset, 4); 611#L9 assume !(#t~mem1 < 0);havoc #t~mem1;call #t~mem3 := read~int(~p.base, ~p.offset, 4);#t~post4 := #t~mem3;call write~int(#t~post4 - 1, ~p.base, ~p.offset, 4);havoc #t~post4;havoc #t~mem3; 610#L15 call #t~ret5 := rec(~p.base, ~p.offset);< 608#recENTRY [2019-11-15 23:06:54,770 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:06:54,770 INFO L82 PathProgramCache]: Analyzing trace with hash -801242957, now seen corresponding path program 2 times [2019-11-15 23:06:54,770 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:06:54,771 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1418556450] [2019-11-15 23:06:54,771 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:06:54,771 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:06:54,771 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:06:54,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:06:54,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:06:54,797 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 23:06:54,797 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:06:54,797 INFO L82 PathProgramCache]: Analyzing trace with hash 29942, now seen corresponding path program 2 times [2019-11-15 23:06:54,797 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:06:54,798 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1377686185] [2019-11-15 23:06:54,798 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:06:54,798 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:06:54,798 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:06:54,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:06:54,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:06:54,804 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 23:06:54,805 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:06:54,805 INFO L82 PathProgramCache]: Analyzing trace with hash 1599299332, now seen corresponding path program 3 times [2019-11-15 23:06:54,805 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:06:54,805 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2093764475] [2019-11-15 23:06:54,805 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:06:54,805 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:06:54,806 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:06:54,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:06:54,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:06:54,832 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 23:06:55,163 WARN L191 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 59 [2019-11-15 23:06:55,711 WARN L191 SmtUtils]: Spent 351.00 ms on a formula simplification. DAG size of input: 128 DAG size of output: 115 [2019-11-15 23:06:56,056 WARN L191 SmtUtils]: Spent 209.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 89 [2019-11-15 23:06:56,112 INFO L210 LassoAnalysis]: Preferences: [2019-11-15 23:06:56,112 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-11-15 23:06:56,112 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-15 23:06:56,112 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-11-15 23:06:56,112 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-11-15 23:06:56,112 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 23:06:56,112 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-15 23:06:56,112 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-11-15 23:06:56,112 INFO L131 ssoRankerPreferences]: Filename of dumped script: rec_malloc_ex3.i_Iteration4_Lasso [2019-11-15 23:06:56,112 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-15 23:06:56,112 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-15 23:06:56,115 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:06:56,128 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:06:56,132 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:06:56,133 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:06:56,135 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:06:56,253 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:06:56,259 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:06:56,261 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:06:56,262 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:06:56,264 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:06:56,265 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:06:56,268 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:06:56,269 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:06:56,271 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:06:56,272 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:06:56,275 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:06:56,277 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:06:56,278 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:06:56,280 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:06:56,283 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:06:56,285 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:06:56,286 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:06:56,288 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:06:56,290 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:06:56,291 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:06:56,525 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-15 23:06:56,525 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-11-15 23:06:56,526 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:06:56,526 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:06:56,526 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:06:56,526 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:06:56,527 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:06:56,527 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:06:56,527 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 23:06:56,527 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:06:56,528 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:06:56,528 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:06:56,528 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:06:56,528 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:06:56,528 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:06:56,529 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:06:56,529 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:06:56,529 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 23:06:56,529 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:06:56,529 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:06:56,529 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:06:56,530 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:06:56,530 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:06:56,530 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:06:56,530 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:06:56,530 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:06:56,530 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 23:06:56,531 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:06:56,531 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:06:56,531 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:06:56,531 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:06:56,531 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:06:56,532 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:06:56,532 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:06:56,532 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:06:56,532 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 23:06:56,532 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:06:56,532 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:06:56,533 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:06:56,533 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:06:56,533 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:06:56,533 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:06:56,533 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:06:56,534 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 23:06:56,534 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 23:06:56,538 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:06:56,539 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:06:56,541 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:06:56,541 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:06:56,541 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:06:56,541 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:06:56,542 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 23:06:56,542 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 23:06:56,543 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:06:56,543 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:06:56,544 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:06:56,544 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:06:56,544 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:06:56,544 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:06:56,545 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 23:06:56,545 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 23:06:56,547 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:06:56,548 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:06:56,548 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:06:56,548 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:06:56,548 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:06:56,549 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:06:56,549 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 23:06:56,550 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 23:06:56,555 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-15 23:06:56,558 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-11-15 23:06:56,558 INFO L444 ModelExtractionUtils]: 7 out of 10 variables were initially zero. Simplification set additionally 0 variables to zero. [2019-11-15 23:06:56,558 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-15 23:06:56,559 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-11-15 23:06:56,559 INFO L510 LassoAnalysis]: Proved termination. [2019-11-15 23:06:56,559 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int rec_#in~p.base) rec_#in~p.offset)_2) = 2*v_rep(select (select #memory_int rec_#in~p.base) rec_#in~p.offset)_2 + 1 Supporting invariants [] [2019-11-15 23:06:56,571 INFO L297 tatePredicateManager]: 1 out of 1 supporting invariants were superfluous and have been removed [2019-11-15 23:06:56,576 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-11-15 23:06:56,589 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:06:56,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:06:56,632 INFO L256 TraceCheckSpWp]: Trace formula consists of 259 conjuncts, 10 conjunts are in the unsatisfiable core [2019-11-15 23:06:56,636 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:06:56,654 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:06:56,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:06:56,670 INFO L256 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 17 conjunts are in the unsatisfiable core [2019-11-15 23:06:56,671 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:06:56,689 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 0 case distinctions, treesize of input 36 treesize of output 20 [2019-11-15 23:06:56,690 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 23:06:56,693 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:06:56,694 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 23:06:56,694 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:36, output treesize:21 [2019-11-15 23:06:56,704 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:06:56,704 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:06:56,704 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 82 states and 96 transitions. cyclomatic complexity: 21 Second operand 5 states. [2019-11-15 23:06:56,783 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 82 states and 96 transitions. cyclomatic complexity: 21. Second operand 5 states. Result 106 states and 124 transitions. Complement of second has 17 states. [2019-11-15 23:06:56,785 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:06:56,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2019-11-15 23:06:56,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 16 transitions. [2019-11-15 23:06:56,786 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 16 transitions. Stem has 20 letters. Loop has 3 letters. [2019-11-15 23:06:56,786 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 23:06:56,786 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-11-15 23:06:56,796 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:06:56,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:06:56,833 INFO L256 TraceCheckSpWp]: Trace formula consists of 259 conjuncts, 10 conjunts are in the unsatisfiable core [2019-11-15 23:06:56,834 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:06:56,849 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:06:56,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:06:56,860 INFO L256 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 17 conjunts are in the unsatisfiable core [2019-11-15 23:06:56,861 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:06:56,877 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 0 case distinctions, treesize of input 36 treesize of output 20 [2019-11-15 23:06:56,877 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 23:06:56,887 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:06:56,888 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 23:06:56,888 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:36, output treesize:21 [2019-11-15 23:06:56,899 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:06:56,900 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:06:56,900 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 82 states and 96 transitions. cyclomatic complexity: 21 Second operand 5 states. [2019-11-15 23:06:56,987 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 82 states and 96 transitions. cyclomatic complexity: 21. Second operand 5 states. Result 106 states and 124 transitions. Complement of second has 17 states. [2019-11-15 23:06:56,989 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:06:56,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2019-11-15 23:06:56,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 16 transitions. [2019-11-15 23:06:56,989 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 16 transitions. Stem has 20 letters. Loop has 3 letters. [2019-11-15 23:06:56,990 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 23:06:56,990 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-11-15 23:06:56,999 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:06:57,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:06:57,037 INFO L256 TraceCheckSpWp]: Trace formula consists of 259 conjuncts, 10 conjunts are in the unsatisfiable core [2019-11-15 23:06:57,038 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:06:57,058 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:06:57,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:06:57,073 INFO L256 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 17 conjunts are in the unsatisfiable core [2019-11-15 23:06:57,074 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:06:57,094 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 0 case distinctions, treesize of input 36 treesize of output 20 [2019-11-15 23:06:57,094 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 23:06:57,100 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:06:57,100 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 23:06:57,100 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:36, output treesize:21 [2019-11-15 23:06:57,110 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:06:57,111 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:06:57,111 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 82 states and 96 transitions. cyclomatic complexity: 21 Second operand 5 states. [2019-11-15 23:06:57,202 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 82 states and 96 transitions. cyclomatic complexity: 21. Second operand 5 states. Result 154 states and 179 transitions. Complement of second has 19 states. [2019-11-15 23:06:57,203 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:06:57,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2019-11-15 23:06:57,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 19 transitions. [2019-11-15 23:06:57,203 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 19 transitions. Stem has 20 letters. Loop has 3 letters. [2019-11-15 23:06:57,203 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 23:06:57,204 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 19 transitions. Stem has 23 letters. Loop has 3 letters. [2019-11-15 23:06:57,204 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 23:06:57,204 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 19 transitions. Stem has 20 letters. Loop has 6 letters. [2019-11-15 23:06:57,204 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 23:06:57,204 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 154 states and 179 transitions. [2019-11-15 23:06:57,208 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-11-15 23:06:57,212 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 154 states to 110 states and 135 transitions. [2019-11-15 23:06:57,212 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 68 [2019-11-15 23:06:57,213 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 76 [2019-11-15 23:06:57,213 INFO L73 IsDeterministic]: Start isDeterministic. Operand 110 states and 135 transitions. [2019-11-15 23:06:57,213 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-15 23:06:57,213 INFO L688 BuchiCegarLoop]: Abstraction has 110 states and 135 transitions. [2019-11-15 23:06:57,213 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states and 135 transitions. [2019-11-15 23:06:57,220 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 74. [2019-11-15 23:06:57,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2019-11-15 23:06:57,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 87 transitions. [2019-11-15 23:06:57,222 INFO L711 BuchiCegarLoop]: Abstraction has 74 states and 87 transitions. [2019-11-15 23:06:57,222 INFO L591 BuchiCegarLoop]: Abstraction has 74 states and 87 transitions. [2019-11-15 23:06:57,222 INFO L424 BuchiCegarLoop]: ======== Iteration 5============ [2019-11-15 23:06:57,222 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 74 states and 87 transitions. [2019-11-15 23:06:57,224 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-11-15 23:06:57,224 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 23:06:57,224 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 23:06:57,225 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:06:57,225 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:06:57,225 INFO L791 eck$LassoCheckResult]: Stem: 1363#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 1356#L-1 havoc main_#res;havoc main_#t~nondet6, main_#t~malloc7.base, main_#t~malloc7.offset, main_#t~nondet8, main_#t~ret9, main_~op~0.base, main_~op~0.offset, main_~i~0;main_~i~0 := main_#t~nondet6;havoc main_#t~nondet6; 1357#L20-2 assume !!(main_~i~0 > 0);call main_#t~malloc7.base, main_#t~malloc7.offset := #Ultimate.allocOnHeap(4);main_~op~0.base, main_~op~0.offset := main_#t~malloc7.base, main_#t~malloc7.offset;call write~int(main_#t~nondet8, main_~op~0.base, main_~op~0.offset, 4);havoc main_#t~nondet8; 1371#L23 call main_#t~ret9 := rec(main_~op~0.base, main_~op~0.offset);< 1374#recENTRY ~p.base, ~p.offset := #in~p.base, #in~p.offset;call #t~mem1 := read~int(~p.base, ~p.offset, 4); 1378#L9 assume #t~mem1 < 0;havoc #t~mem1;call #t~mem2 := read~int(~p.base, ~p.offset, 4);~pv~0 := #t~mem2;havoc #t~mem2;call ULTIMATE.dealloc(~p.base, ~p.offset);#res := ~pv~0; 1376#recFINAL assume true; 1370#recEXIT >#30#return; 1366#L23-1 main_~i~0 := main_~i~0 + main_#t~ret9;havoc main_#t~ret9; 1368#L20-2 assume !!(main_~i~0 > 0);call main_#t~malloc7.base, main_#t~malloc7.offset := #Ultimate.allocOnHeap(4);main_~op~0.base, main_~op~0.offset := main_#t~malloc7.base, main_#t~malloc7.offset;call write~int(main_#t~nondet8, main_~op~0.base, main_~op~0.offset, 4);havoc main_#t~nondet8; 1372#L23 call main_#t~ret9 := rec(main_~op~0.base, main_~op~0.offset);< 1373#recENTRY ~p.base, ~p.offset := #in~p.base, #in~p.offset;call #t~mem1 := read~int(~p.base, ~p.offset, 4); 1400#L9 assume !(#t~mem1 < 0);havoc #t~mem1;call #t~mem3 := read~int(~p.base, ~p.offset, 4);#t~post4 := #t~mem3;call write~int(#t~post4 - 1, ~p.base, ~p.offset, 4);havoc #t~post4;havoc #t~mem3; 1352#L15 call #t~ret5 := rec(~p.base, ~p.offset);< 1360#recENTRY ~p.base, ~p.offset := #in~p.base, #in~p.offset;call #t~mem1 := read~int(~p.base, ~p.offset, 4); 1351#L9 assume #t~mem1 < 0;havoc #t~mem1;call #t~mem2 := read~int(~p.base, ~p.offset, 4);~pv~0 := #t~mem2;havoc #t~mem2;call ULTIMATE.dealloc(~p.base, ~p.offset);#res := ~pv~0; 1353#recFINAL assume true; 1417#recEXIT >#28#return; 1406#L15-1 #res := #t~ret5;havoc #t~ret5; 1401#recFINAL assume true; 1377#recEXIT >#30#return; 1364#L23-1 [2019-11-15 23:06:57,225 INFO L793 eck$LassoCheckResult]: Loop: 1364#L23-1 main_~i~0 := main_~i~0 + main_#t~ret9;havoc main_#t~ret9; 1365#L20-2 assume !!(main_~i~0 > 0);call main_#t~malloc7.base, main_#t~malloc7.offset := #Ultimate.allocOnHeap(4);main_~op~0.base, main_~op~0.offset := main_#t~malloc7.base, main_#t~malloc7.offset;call write~int(main_#t~nondet8, main_~op~0.base, main_~op~0.offset, 4);havoc main_#t~nondet8; 1403#L23 call main_#t~ret9 := rec(main_~op~0.base, main_~op~0.offset);< 1407#recENTRY ~p.base, ~p.offset := #in~p.base, #in~p.offset;call #t~mem1 := read~int(~p.base, ~p.offset, 4); 1402#L9 assume #t~mem1 < 0;havoc #t~mem1;call #t~mem2 := read~int(~p.base, ~p.offset, 4);~pv~0 := #t~mem2;havoc #t~mem2;call ULTIMATE.dealloc(~p.base, ~p.offset);#res := ~pv~0; 1404#recFINAL assume true; 1408#recEXIT >#30#return; 1364#L23-1 [2019-11-15 23:06:57,225 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:06:57,226 INFO L82 PathProgramCache]: Analyzing trace with hash 1572162950, now seen corresponding path program 4 times [2019-11-15 23:06:57,226 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:06:57,226 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1985120399] [2019-11-15 23:06:57,226 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:06:57,226 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:06:57,226 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:06:57,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:06:57,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:06:57,248 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 23:06:57,248 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:06:57,248 INFO L82 PathProgramCache]: Analyzing trace with hash -523709736, now seen corresponding path program 3 times [2019-11-15 23:06:57,249 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:06:57,249 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2002376446] [2019-11-15 23:06:57,249 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:06:57,249 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:06:57,249 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:06:57,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:06:57,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:06:57,258 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 23:06:57,259 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:06:57,259 INFO L82 PathProgramCache]: Analyzing trace with hash 1341076915, now seen corresponding path program 5 times [2019-11-15 23:06:57,259 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:06:57,259 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1114538705] [2019-11-15 23:06:57,260 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:06:57,260 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:06:57,260 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:06:57,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:06:57,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:06:57,288 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 23:06:57,567 WARN L191 SmtUtils]: Spent 169.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 70 [2019-11-15 23:06:58,009 WARN L191 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 59 [2019-11-15 23:06:58,785 WARN L191 SmtUtils]: Spent 647.00 ms on a formula simplification. DAG size of input: 152 DAG size of output: 133 [2019-11-15 23:06:58,874 INFO L210 LassoAnalysis]: Preferences: [2019-11-15 23:06:58,874 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-11-15 23:06:58,874 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-15 23:06:58,874 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-11-15 23:06:58,874 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-11-15 23:06:58,874 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 23:06:58,874 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-15 23:06:58,874 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-11-15 23:06:58,874 INFO L131 ssoRankerPreferences]: Filename of dumped script: rec_malloc_ex3.i_Iteration5_Lasso [2019-11-15 23:06:58,874 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-15 23:06:58,875 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-15 23:06:58,877 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:06:58,892 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:06:58,898 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:06:58,900 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:06:59,037 WARN L191 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 41 [2019-11-15 23:06:59,157 WARN L191 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 50 [2019-11-15 23:06:59,157 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:06:59,490 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-15 23:06:59,490 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-11-15 23:06:59,491 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:06:59,491 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:06:59,491 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:06:59,492 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:06:59,492 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:06:59,492 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 23:06:59,493 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 23:06:59,494 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:06:59,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:06:59,495 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:06:59,495 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:06:59,496 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:06:59,496 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:06:59,496 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 23:06:59,497 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 23:06:59,498 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:06:59,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:06:59,498 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:06:59,498 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:06:59,499 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:06:59,499 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:06:59,499 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:06:59,499 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 23:06:59,499 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:06:59,500 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:06:59,500 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:06:59,501 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:06:59,501 INFO L202 nArgumentSynthesizer]: 4 stem disjuncts [2019-11-15 23:06:59,501 INFO L203 nArgumentSynthesizer]: 2 loop disjuncts [2019-11-15 23:06:59,501 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:06:59,505 INFO L400 nArgumentSynthesizer]: We have 28 Motzkin's Theorem applications. [2019-11-15 23:06:59,505 INFO L401 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2019-11-15 23:06:59,531 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:06:59,531 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:06:59,532 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:06:59,532 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:06:59,532 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:06:59,532 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:06:59,533 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 23:06:59,533 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 23:06:59,534 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:06:59,535 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:06:59,535 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:06:59,536 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:06:59,536 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:06:59,536 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:06:59,537 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 23:06:59,537 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 23:06:59,551 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-15 23:06:59,561 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2019-11-15 23:06:59,561 INFO L444 ModelExtractionUtils]: 12 out of 16 variables were initially zero. Simplification set additionally 1 variables to zero. [2019-11-15 23:06:59,562 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-15 23:06:59,562 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-11-15 23:06:59,563 INFO L510 LassoAnalysis]: Proved termination. [2019-11-15 23:06:59,563 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_#t~ret9, ULTIMATE.start_main_~i~0) = 1*ULTIMATE.start_main_#t~ret9 + 1*ULTIMATE.start_main_~i~0 Supporting invariants [] [2019-11-15 23:06:59,581 INFO L297 tatePredicateManager]: 3 out of 3 supporting invariants were superfluous and have been removed [2019-11-15 23:06:59,600 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:06:59,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:06:59,640 INFO L256 TraceCheckSpWp]: Trace formula consists of 228 conjuncts, 8 conjunts are in the unsatisfiable core [2019-11-15 23:06:59,642 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:06:59,668 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:06:59,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:06:59,708 INFO L256 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 11 conjunts are in the unsatisfiable core [2019-11-15 23:06:59,709 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:06:59,777 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 17 treesize of output 9 [2019-11-15 23:06:59,777 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 23:06:59,786 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:06:59,786 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:06:59,787 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:20, output treesize:9 [2019-11-15 23:06:59,803 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:06:59,804 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 6 loop predicates [2019-11-15 23:06:59,804 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 74 states and 87 transitions. cyclomatic complexity: 18 Second operand 8 states. [2019-11-15 23:06:59,935 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 74 states and 87 transitions. cyclomatic complexity: 18. Second operand 8 states. Result 118 states and 139 transitions. Complement of second has 21 states. [2019-11-15 23:06:59,937 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 8 states 2 stem states 5 non-accepting loop states 1 accepting loop states [2019-11-15 23:06:59,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2019-11-15 23:06:59,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 26 transitions. [2019-11-15 23:06:59,938 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 26 transitions. Stem has 21 letters. Loop has 7 letters. [2019-11-15 23:06:59,938 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 23:06:59,938 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-11-15 23:06:59,960 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:07:00,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:07:00,004 INFO L256 TraceCheckSpWp]: Trace formula consists of 228 conjuncts, 8 conjunts are in the unsatisfiable core [2019-11-15 23:07:00,006 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:07:00,038 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:07:00,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:07:00,064 INFO L256 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 11 conjunts are in the unsatisfiable core [2019-11-15 23:07:00,065 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:07:00,140 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 17 treesize of output 9 [2019-11-15 23:07:00,141 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 23:07:00,149 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:07:00,149 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:07:00,150 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:20, output treesize:9 [2019-11-15 23:07:00,171 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:07:00,175 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.2 stem predicates 6 loop predicates [2019-11-15 23:07:00,175 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 74 states and 87 transitions. cyclomatic complexity: 18 Second operand 8 states. [2019-11-15 23:07:00,292 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 74 states and 87 transitions. cyclomatic complexity: 18. Second operand 8 states. Result 118 states and 139 transitions. Complement of second has 21 states. [2019-11-15 23:07:00,293 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 8 states 2 stem states 5 non-accepting loop states 1 accepting loop states [2019-11-15 23:07:00,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2019-11-15 23:07:00,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 26 transitions. [2019-11-15 23:07:00,294 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 26 transitions. Stem has 21 letters. Loop has 7 letters. [2019-11-15 23:07:00,294 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 23:07:00,294 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-11-15 23:07:00,316 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:07:00,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:07:00,360 INFO L256 TraceCheckSpWp]: Trace formula consists of 228 conjuncts, 8 conjunts are in the unsatisfiable core [2019-11-15 23:07:00,367 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:07:00,403 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:07:00,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:07:00,424 INFO L256 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 11 conjunts are in the unsatisfiable core [2019-11-15 23:07:00,425 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:07:00,496 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 17 treesize of output 9 [2019-11-15 23:07:00,497 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 23:07:00,505 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:07:00,505 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:07:00,505 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:20, output treesize:9 [2019-11-15 23:07:00,521 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:07:00,522 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 6 loop predicates [2019-11-15 23:07:00,522 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 74 states and 87 transitions. cyclomatic complexity: 18 Second operand 8 states. [2019-11-15 23:07:00,628 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 74 states and 87 transitions. cyclomatic complexity: 18. Second operand 8 states. Result 143 states and 169 transitions. Complement of second has 22 states. [2019-11-15 23:07:00,629 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 8 states 2 stem states 5 non-accepting loop states 1 accepting loop states [2019-11-15 23:07:00,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2019-11-15 23:07:00,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 28 transitions. [2019-11-15 23:07:00,630 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 28 transitions. Stem has 21 letters. Loop has 7 letters. [2019-11-15 23:07:00,630 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 23:07:00,630 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 28 transitions. Stem has 28 letters. Loop has 7 letters. [2019-11-15 23:07:00,631 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 23:07:00,631 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 28 transitions. Stem has 21 letters. Loop has 14 letters. [2019-11-15 23:07:00,632 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 23:07:00,632 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 143 states and 169 transitions. [2019-11-15 23:07:00,638 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2019-11-15 23:07:00,644 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 143 states to 94 states and 109 transitions. [2019-11-15 23:07:00,645 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 57 [2019-11-15 23:07:00,646 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 59 [2019-11-15 23:07:00,647 INFO L73 IsDeterministic]: Start isDeterministic. Operand 94 states and 109 transitions. [2019-11-15 23:07:00,647 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-15 23:07:00,647 INFO L688 BuchiCegarLoop]: Abstraction has 94 states and 109 transitions. [2019-11-15 23:07:00,647 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states and 109 transitions. [2019-11-15 23:07:00,657 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 32. [2019-11-15 23:07:00,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2019-11-15 23:07:00,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 38 transitions. [2019-11-15 23:07:00,663 INFO L711 BuchiCegarLoop]: Abstraction has 32 states and 38 transitions. [2019-11-15 23:07:00,663 INFO L591 BuchiCegarLoop]: Abstraction has 32 states and 38 transitions. [2019-11-15 23:07:00,663 INFO L424 BuchiCegarLoop]: ======== Iteration 6============ [2019-11-15 23:07:00,663 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 32 states and 38 transitions. [2019-11-15 23:07:00,664 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2019-11-15 23:07:00,665 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 23:07:00,666 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 23:07:00,666 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2019-11-15 23:07:00,667 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:07:00,667 INFO L791 eck$LassoCheckResult]: Stem: 2197#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 2189#L-1 havoc main_#res;havoc main_#t~nondet6, main_#t~malloc7.base, main_#t~malloc7.offset, main_#t~nondet8, main_#t~ret9, main_~op~0.base, main_~op~0.offset, main_~i~0;main_~i~0 := main_#t~nondet6;havoc main_#t~nondet6; 2190#L20-2 assume !!(main_~i~0 > 0);call main_#t~malloc7.base, main_#t~malloc7.offset := #Ultimate.allocOnHeap(4);main_~op~0.base, main_~op~0.offset := main_#t~malloc7.base, main_#t~malloc7.offset;call write~int(main_#t~nondet8, main_~op~0.base, main_~op~0.offset, 4);havoc main_#t~nondet8; 2204#L23 [2019-11-15 23:07:00,667 INFO L793 eck$LassoCheckResult]: Loop: 2204#L23 call main_#t~ret9 := rec(main_~op~0.base, main_~op~0.offset);< 2205#recENTRY ~p.base, ~p.offset := #in~p.base, #in~p.offset;call #t~mem1 := read~int(~p.base, ~p.offset, 4); 2209#L9 assume !(#t~mem1 < 0);havoc #t~mem1;call #t~mem3 := read~int(~p.base, ~p.offset, 4);#t~post4 := #t~mem3;call write~int(#t~post4 - 1, ~p.base, ~p.offset, 4);havoc #t~post4;havoc #t~mem3; 2184#L15 call #t~ret5 := rec(~p.base, ~p.offset);< 2194#recENTRY ~p.base, ~p.offset := #in~p.base, #in~p.offset;call #t~mem1 := read~int(~p.base, ~p.offset, 4); 2183#L9 assume #t~mem1 < 0;havoc #t~mem1;call #t~mem2 := read~int(~p.base, ~p.offset, 4);~pv~0 := #t~mem2;havoc #t~mem2;call ULTIMATE.dealloc(~p.base, ~p.offset);#res := ~pv~0; 2185#recFINAL assume true; 2206#recEXIT >#28#return; 2211#L15-1 #res := #t~ret5;havoc #t~ret5; 2210#recFINAL assume true; 2208#recEXIT >#30#return; 2198#L23-1 main_~i~0 := main_~i~0 + main_#t~ret9;havoc main_#t~ret9; 2200#L20-2 assume !!(main_~i~0 > 0);call main_#t~malloc7.base, main_#t~malloc7.offset := #Ultimate.allocOnHeap(4);main_~op~0.base, main_~op~0.offset := main_#t~malloc7.base, main_#t~malloc7.offset;call write~int(main_#t~nondet8, main_~op~0.base, main_~op~0.offset, 4);havoc main_#t~nondet8; 2204#L23 [2019-11-15 23:07:00,667 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:07:00,668 INFO L82 PathProgramCache]: Analyzing trace with hash 37808, now seen corresponding path program 1 times [2019-11-15 23:07:00,668 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:07:00,668 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [198688875] [2019-11-15 23:07:00,668 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:07:00,668 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:07:00,669 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:07:00,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:07:00,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:07:00,689 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 23:07:00,690 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:07:00,690 INFO L82 PathProgramCache]: Analyzing trace with hash -669629144, now seen corresponding path program 1 times [2019-11-15 23:07:00,690 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:07:00,691 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [600384815] [2019-11-15 23:07:00,691 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:07:00,691 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:07:00,691 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:07:00,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:07:00,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:07:00,719 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 23:07:00,723 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:07:00,723 INFO L82 PathProgramCache]: Analyzing trace with hash -1720097319, now seen corresponding path program 6 times [2019-11-15 23:07:00,724 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:07:00,724 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1278867072] [2019-11-15 23:07:00,724 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:07:00,724 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:07:00,724 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:07:00,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:07:00,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:07:00,748 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 23:07:00,980 WARN L191 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 59 [2019-11-15 23:07:01,335 WARN L191 SmtUtils]: Spent 205.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 79 [2019-11-15 23:07:01,525 INFO L210 LassoAnalysis]: Preferences: [2019-11-15 23:07:01,525 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-11-15 23:07:01,526 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-15 23:07:01,526 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-11-15 23:07:01,526 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-11-15 23:07:01,526 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 23:07:01,526 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-15 23:07:01,526 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-11-15 23:07:01,526 INFO L131 ssoRankerPreferences]: Filename of dumped script: rec_malloc_ex3.i_Iteration6_Lasso [2019-11-15 23:07:01,526 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-15 23:07:01,526 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-15 23:07:01,528 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:07:01,531 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:07: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:07:01,694 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:07: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:07: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:07:01,952 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-15 23:07:01,952 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-11-15 23:07:01,952 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:07:01,953 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:07:01,953 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:07:01,953 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:07:01,953 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:07:01,953 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 23:07:01,954 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 23:07:01,954 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:07:01,955 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:07:01,955 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:07:01,955 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:07:01,955 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:07:01,955 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:07:01,956 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 23:07:01,956 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 23:07:01,959 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:07:01,959 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:07:01,959 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:07:01,960 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:07:01,960 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:07:01,960 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:07:01,961 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 23:07:01,962 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 23:07:01,968 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:07:01,969 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:07:01,969 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:07:01,970 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:07:01,970 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:07:01,970 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:07:01,971 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 23:07:01,971 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 23:07:01,978 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-15 23:07:01,981 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-11-15 23:07:01,981 INFO L444 ModelExtractionUtils]: 10 out of 13 variables were initially zero. Simplification set additionally 1 variables to zero. [2019-11-15 23:07:01,982 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-15 23:07:01,982 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-11-15 23:07:01,982 INFO L510 LassoAnalysis]: Proved termination. [2019-11-15 23:07:01,983 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0) = 1*ULTIMATE.start_main_~i~0 Supporting invariants [] [2019-11-15 23:07:02,001 INFO L297 tatePredicateManager]: 3 out of 3 supporting invariants were superfluous and have been removed [2019-11-15 23:07:02,023 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:07:02,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:07:02,032 INFO L256 TraceCheckSpWp]: Trace formula consists of 27 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-15 23:07:02,032 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:07:02,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:07:02,060 INFO L256 TraceCheckSpWp]: Trace formula consists of 142 conjuncts, 15 conjunts are in the unsatisfiable core [2019-11-15 23:07:02,061 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:07:02,100 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 17 treesize of output 9 [2019-11-15 23:07:02,100 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 23:07:02,104 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:07:02,104 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:07:02,105 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:20, output treesize:9 [2019-11-15 23:07:02,152 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-11-15 23:07:02,152 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 7 loop predicates [2019-11-15 23:07:02,152 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 32 states and 38 transitions. cyclomatic complexity: 8 Second operand 8 states. [2019-11-15 23:07:02,233 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 32 states and 38 transitions. cyclomatic complexity: 8. Second operand 8 states. Result 69 states and 86 transitions. Complement of second has 22 states. [2019-11-15 23:07:02,233 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:07:02,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2019-11-15 23:07:02,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 14 transitions. [2019-11-15 23:07:02,234 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 14 transitions. Stem has 3 letters. Loop has 13 letters. [2019-11-15 23:07:02,235 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 23:07:02,235 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 14 transitions. Stem has 16 letters. Loop has 13 letters. [2019-11-15 23:07:02,235 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 23:07:02,235 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 14 transitions. Stem has 3 letters. Loop has 26 letters. [2019-11-15 23:07:02,236 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 23:07:02,236 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 69 states and 86 transitions. [2019-11-15 23:07:02,238 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-11-15 23:07:02,238 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 69 states to 0 states and 0 transitions. [2019-11-15 23:07:02,238 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2019-11-15 23:07:02,238 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2019-11-15 23:07:02,238 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2019-11-15 23:07:02,239 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-15 23:07:02,239 INFO L688 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-15 23:07:02,239 INFO L711 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-15 23:07:02,239 INFO L591 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-15 23:07:02,239 INFO L424 BuchiCegarLoop]: ======== Iteration 7============ [2019-11-15 23:07:02,239 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2019-11-15 23:07:02,239 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-11-15 23:07:02,239 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2019-11-15 23:07:02,246 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 15.11 11:07:02 BoogieIcfgContainer [2019-11-15 23:07:02,246 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2019-11-15 23:07:02,246 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-15 23:07:02,246 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-15 23:07:02,247 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-15 23:07:02,247 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 11:06:48" (3/4) ... [2019-11-15 23:07:02,250 INFO L140 WitnessPrinter]: No result that supports witness generation found [2019-11-15 23:07:02,251 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-15 23:07:02,252 INFO L168 Benchmark]: Toolchain (without parser) took 14140.11 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 220.7 MB). Free memory was 946.5 MB in the beginning and 846.9 MB in the end (delta: 99.6 MB). Peak memory consumption was 320.3 MB. Max. memory is 11.5 GB. [2019-11-15 23:07:02,253 INFO L168 Benchmark]: CDTParser took 0.32 ms. Allocated memory is still 1.0 GB. Free memory is still 963.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-15 23:07:02,253 INFO L168 Benchmark]: CACSL2BoogieTranslator took 337.75 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 109.1 MB). Free memory was 946.5 MB in the beginning and 1.1 GB in the end (delta: -157.4 MB). Peak memory consumption was 23.2 MB. Max. memory is 11.5 GB. [2019-11-15 23:07:02,253 INFO L168 Benchmark]: Boogie Procedure Inliner took 35.24 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-15 23:07:02,254 INFO L168 Benchmark]: Boogie Preprocessor took 36.29 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 11.5 GB. [2019-11-15 23:07:02,255 INFO L168 Benchmark]: RCFGBuilder took 325.11 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 22.4 MB). Peak memory consumption was 22.4 MB. Max. memory is 11.5 GB. [2019-11-15 23:07:02,255 INFO L168 Benchmark]: BuchiAutomizer took 13387.69 ms. Allocated memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: 111.7 MB). Free memory was 1.1 GB in the beginning and 846.9 MB in the end (delta: 233.3 MB). Peak memory consumption was 344.9 MB. Max. memory is 11.5 GB. [2019-11-15 23:07:02,256 INFO L168 Benchmark]: Witness Printer took 4.55 ms. Allocated memory is still 1.2 GB. Free memory is still 846.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-15 23:07:02,261 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.32 ms. Allocated memory is still 1.0 GB. Free memory is still 963.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 337.75 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 109.1 MB). Free memory was 946.5 MB in the beginning and 1.1 GB in the end (delta: -157.4 MB). Peak memory consumption was 23.2 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 35.24 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 36.29 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 11.5 GB. * RCFGBuilder took 325.11 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 22.4 MB). Peak memory consumption was 22.4 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 13387.69 ms. Allocated memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: 111.7 MB). Free memory was 1.1 GB in the beginning and 846.9 MB in the end (delta: 233.3 MB). Peak memory consumption was 344.9 MB. Max. memory is 11.5 GB. * Witness Printer took 4.55 ms. Allocated memory is still 1.2 GB. Free memory is still 846.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 6 terminating modules (0 trivial, 4 deterministic, 2 nondeterministic). One deterministic module has affine ranking function i and consists of 9 locations. One deterministic module has affine ranking function 2 * unknown-#memory_int-unknown[p][p] + 1 and consists of 5 locations. One deterministic module has affine ranking function aux-rec(op)-aux + i and consists of 8 locations. One deterministic module has affine ranking function i and consists of 8 locations. One nondeterministic module has affine ranking function 2 * unknown-#memory_int-unknown[p][p] + 1 and consists of 6 locations. One nondeterministic module has affine ranking function aux-rec(op)-aux + i and consists of 8 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 13.3s and 7 iterations. TraceHistogramMax:3. Analysis of lassos took 10.1s. Construction of modules took 0.5s. Büchi inclusion checks took 2.3s. Highest rank in rank-based complementation 3. Minimization of det autom 1. Minimization of nondet autom 5. Automata minimization 0.0s AutomataMinimizationTime, 5 MinimizatonAttempts, 111 StatesRemovedByMinimization, 5 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 82 states and ocurred in iteration 3. Nontrivial modules had stage [4, 0, 2, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 4/4 HoareTripleCheckerStatistics: 127 SDtfs, 149 SDslu, 120 SDs, 0 SdLazy, 376 SolverSat, 126 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.5s Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc0 concLT0 SILN0 SILU0 SILI0 SILT0 lasso6 LassoPreprocessingBenchmarks: Lassos: inital178 mio100 ax100 hnf100 lsp95 ukn59 mio100 lsp30 div100 bol100 ite100 ukn100 eq171 hnf90 smp97 dnf150 smp97 tf101 neg93 sie126 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 30ms VariablesStem: 4 VariablesLoop: 5 DisjunctsStem: 4 DisjunctsLoop: 2 SupportingInvariants: 4 MotzkinApplications: 28 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...