./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/termination-recursive-malloc/rec_malloc_ex2.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_a8020c52-882f-4ae8-99bc-0ef823a6a81d/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_a8020c52-882f-4ae8-99bc-0ef823a6a81d/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_a8020c52-882f-4ae8-99bc-0ef823a6a81d/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_a8020c52-882f-4ae8-99bc-0ef823a6a81d/bin/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/termination-recursive-malloc/rec_malloc_ex2.i -s /tmp/vcloud-vcloud-master/worker/run_dir_a8020c52-882f-4ae8-99bc-0ef823a6a81d/bin/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_a8020c52-882f-4ae8-99bc-0ef823a6a81d/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 205669a0469477740fa35099dd0e4ee1e635b686 ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-cad4683 [2019-11-16 00:27:07,073 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-16 00:27:07,075 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-16 00:27:07,090 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-16 00:27:07,091 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-16 00:27:07,092 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-16 00:27:07,094 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-16 00:27:07,103 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-16 00:27:07,108 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-16 00:27:07,112 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-16 00:27:07,114 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-16 00:27:07,116 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-16 00:27:07,117 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-16 00:27:07,119 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-16 00:27:07,120 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-16 00:27:07,121 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-16 00:27:07,122 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-16 00:27:07,123 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-16 00:27:07,126 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-16 00:27:07,129 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-16 00:27:07,134 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-16 00:27:07,136 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-16 00:27:07,140 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-16 00:27:07,141 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-16 00:27:07,145 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-16 00:27:07,145 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-16 00:27:07,146 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-16 00:27:07,147 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-16 00:27:07,148 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-16 00:27:07,149 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-16 00:27:07,149 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-16 00:27:07,150 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-16 00:27:07,151 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-16 00:27:07,151 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-16 00:27:07,153 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-16 00:27:07,153 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-16 00:27:07,154 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-16 00:27:07,154 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-16 00:27:07,155 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-16 00:27:07,155 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-16 00:27:07,156 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-16 00:27:07,157 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_a8020c52-882f-4ae8-99bc-0ef823a6a81d/bin/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf [2019-11-16 00:27:07,184 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-16 00:27:07,190 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-16 00:27:07,191 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-16 00:27:07,192 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-16 00:27:07,192 INFO L138 SettingsManager]: * Use SBE=true [2019-11-16 00:27:07,192 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-11-16 00:27:07,192 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-11-16 00:27:07,192 INFO L138 SettingsManager]: * Use old map elimination=false [2019-11-16 00:27:07,193 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2019-11-16 00:27:07,193 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2019-11-16 00:27:07,193 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-11-16 00:27:07,193 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-16 00:27:07,193 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-11-16 00:27:07,194 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-16 00:27:07,198 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-16 00:27:07,198 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-11-16 00:27:07,198 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-11-16 00:27:07,199 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-11-16 00:27:07,199 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-16 00:27:07,199 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-11-16 00:27:07,199 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-16 00:27:07,199 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-11-16 00:27:07,200 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-16 00:27:07,200 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-16 00:27:07,200 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-11-16 00:27:07,200 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-16 00:27:07,201 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-16 00:27:07,201 INFO L138 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-11-16 00:27:07,202 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-11-16 00:27:07,202 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_a8020c52-882f-4ae8-99bc-0ef823a6a81d/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 -> 205669a0469477740fa35099dd0e4ee1e635b686 [2019-11-16 00:27:07,226 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-16 00:27:07,236 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-16 00:27:07,239 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-16 00:27:07,240 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-16 00:27:07,241 INFO L275 PluginConnector]: CDTParser initialized [2019-11-16 00:27:07,241 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_a8020c52-882f-4ae8-99bc-0ef823a6a81d/bin/uautomizer/../../sv-benchmarks/c/termination-recursive-malloc/rec_malloc_ex2.i [2019-11-16 00:27:07,290 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_a8020c52-882f-4ae8-99bc-0ef823a6a81d/bin/uautomizer/data/6a07272d5/e62290a281bc40c28569a1200d5e156c/FLAG7f95f5e6b [2019-11-16 00:27:07,715 INFO L306 CDTParser]: Found 1 translation units. [2019-11-16 00:27:07,716 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_a8020c52-882f-4ae8-99bc-0ef823a6a81d/sv-benchmarks/c/termination-recursive-malloc/rec_malloc_ex2.i [2019-11-16 00:27:07,721 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_a8020c52-882f-4ae8-99bc-0ef823a6a81d/bin/uautomizer/data/6a07272d5/e62290a281bc40c28569a1200d5e156c/FLAG7f95f5e6b [2019-11-16 00:27:07,731 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_a8020c52-882f-4ae8-99bc-0ef823a6a81d/bin/uautomizer/data/6a07272d5/e62290a281bc40c28569a1200d5e156c [2019-11-16 00:27:07,734 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-16 00:27:07,735 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-16 00:27:07,736 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-16 00:27:07,736 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-16 00:27:07,739 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-16 00:27:07,740 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 12:27:07" (1/1) ... [2019-11-16 00:27:07,742 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@52e66f97 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:27:07, skipping insertion in model container [2019-11-16 00:27:07,742 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 12:27:07" (1/1) ... [2019-11-16 00:27:07,749 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-16 00:27:07,763 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-16 00:27:07,896 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-16 00:27:07,965 INFO L188 MainTranslator]: Completed pre-run [2019-11-16 00:27:07,980 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-16 00:27:07,992 INFO L192 MainTranslator]: Completed translation [2019-11-16 00:27:07,992 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:27:07 WrapperNode [2019-11-16 00:27:07,992 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-16 00:27:07,993 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-16 00:27:07,993 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-16 00:27:07,993 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-16 00:27:08,000 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:27:07" (1/1) ... [2019-11-16 00:27:08,007 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:27:07" (1/1) ... [2019-11-16 00:27:08,023 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-16 00:27:08,024 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-16 00:27:08,024 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-16 00:27:08,024 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-16 00:27:08,032 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:27:07" (1/1) ... [2019-11-16 00:27:08,032 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:27:07" (1/1) ... [2019-11-16 00:27:08,034 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:27:07" (1/1) ... [2019-11-16 00:27:08,034 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:27:07" (1/1) ... [2019-11-16 00:27:08,038 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:27:07" (1/1) ... [2019-11-16 00:27:08,042 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:27:07" (1/1) ... [2019-11-16 00:27:08,043 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:27:07" (1/1) ... [2019-11-16 00:27:08,045 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-16 00:27:08,046 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-16 00:27:08,046 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-16 00:27:08,046 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-16 00:27:08,047 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:27:07" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_a8020c52-882f-4ae8-99bc-0ef823a6a81d/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-16 00:27:08,114 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-11-16 00:27:08,114 INFO L130 BoogieDeclarations]: Found specification of procedure rec [2019-11-16 00:27:08,115 INFO L138 BoogieDeclarations]: Found implementation of procedure rec [2019-11-16 00:27:08,115 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-11-16 00:27:08,116 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-16 00:27:08,116 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-16 00:27:08,116 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-11-16 00:27:08,116 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-16 00:27:08,387 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-16 00:27:08,387 INFO L284 CfgBuilder]: Removed 5 assume(true) statements. [2019-11-16 00:27:08,388 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 12:27:08 BoogieIcfgContainer [2019-11-16 00:27:08,388 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-16 00:27:08,389 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-11-16 00:27:08,389 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-11-16 00:27:08,392 INFO L275 PluginConnector]: BuchiAutomizer initialized [2019-11-16 00:27:08,393 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-16 00:27:08,393 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 16.11 12:27:07" (1/3) ... [2019-11-16 00:27:08,394 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@6facc3ca and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 16.11 12:27:08, skipping insertion in model container [2019-11-16 00:27:08,394 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-16 00:27:08,394 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:27:07" (2/3) ... [2019-11-16 00:27:08,395 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@6facc3ca and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 16.11 12:27:08, skipping insertion in model container [2019-11-16 00:27:08,395 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-16 00:27:08,395 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 12:27:08" (3/3) ... [2019-11-16 00:27:08,397 INFO L371 chiAutomizerObserver]: Analyzing ICFG rec_malloc_ex2.i [2019-11-16 00:27:08,457 INFO L356 BuchiCegarLoop]: Interprodecural is true [2019-11-16 00:27:08,457 INFO L357 BuchiCegarLoop]: Hoare is false [2019-11-16 00:27:08,457 INFO L358 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-11-16 00:27:08,457 INFO L359 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-16 00:27:08,458 INFO L360 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-16 00:27:08,458 INFO L361 BuchiCegarLoop]: Difference is false [2019-11-16 00:27:08,458 INFO L362 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-16 00:27:08,458 INFO L365 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-11-16 00:27:08,484 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states. [2019-11-16 00:27:08,529 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 7 [2019-11-16 00:27:08,530 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-16 00:27:08,530 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-16 00:27:08,537 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2019-11-16 00:27:08,537 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:27:08,537 INFO L424 BuchiCegarLoop]: ======== Iteration 1============ [2019-11-16 00:27:08,537 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states. [2019-11-16 00:27:08,539 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 7 [2019-11-16 00:27:08,539 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-16 00:27:08,539 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-16 00:27:08,540 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2019-11-16 00:27:08,540 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:27:08,545 INFO L791 eck$LassoCheckResult]: Stem: 11#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 9#L-1true havoc main_#res;havoc main_#t~malloc7.base, main_#t~malloc7.offset, main_#t~nondet8, main_#t~malloc10.base, main_#t~malloc10.offset, main_#t~mem11, main_#t~mem13, main_#t~ret12, main_~op~0.base, main_~op~0.offset, main_#t~mem9, main_~ip~0.base, main_~ip~0.offset;call main_#t~malloc7.base, main_#t~malloc7.offset := #Ultimate.allocOnHeap(4);main_~ip~0.base, main_~ip~0.offset := main_#t~malloc7.base, main_#t~malloc7.offset;call write~int(main_#t~nondet8, main_~ip~0.base, main_~ip~0.offset, 4);havoc main_#t~nondet8; 7#L23-3true [2019-11-16 00:27:08,546 INFO L793 eck$LassoCheckResult]: Loop: 7#L23-3true call main_#t~mem9 := read~int(main_~ip~0.base, main_~ip~0.offset, 4); 12#L23-1true assume !!(main_#t~mem9 > 1);havoc main_#t~mem9;call main_#t~malloc10.base, main_#t~malloc10.offset := #Ultimate.allocOnHeap(4);main_~op~0.base, main_~op~0.offset := main_#t~malloc10.base, main_#t~malloc10.offset;call main_#t~mem11 := read~int(main_~ip~0.base, main_~ip~0.offset, 4);call write~int(main_#t~mem11, main_~op~0.base, main_~op~0.offset, 4);havoc main_#t~mem11;call main_#t~mem13 := read~int(main_~ip~0.base, main_~ip~0.offset, 4); 3#L26true call main_#t~ret12 := rec(main_~op~0.base, main_~op~0.offset, main_~ip~0.base, main_~ip~0.offset);< 4#recENTRYtrue ~p.base, ~p.offset := #in~p.base, #in~p.offset;~up.base, ~up.offset := #in~up.base, #in~up.offset;call #t~mem1 := read~int(~p.base, ~p.offset, 4); 10#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);call ULTIMATE.dealloc(~up.base, ~up.offset);#res := ~pv~0; 15#recFINALtrue assume true; 13#recEXITtrue >#31#return; 17#L26-1true call write~int(main_#t~mem13 + main_#t~ret12, main_~ip~0.base, main_~ip~0.offset, 4);havoc main_#t~mem13;havoc main_#t~ret12; 7#L23-3true [2019-11-16 00:27:08,551 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:27:08,552 INFO L82 PathProgramCache]: Analyzing trace with hash 1219, now seen corresponding path program 1 times [2019-11-16 00:27:08,558 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:27:08,558 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [464916079] [2019-11-16 00:27:08,559 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:27:08,559 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:27:08,559 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:27:08,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:27:08,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:27:08,667 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-16 00:27:08,669 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:27:08,669 INFO L82 PathProgramCache]: Analyzing trace with hash -5927165, now seen corresponding path program 1 times [2019-11-16 00:27:08,669 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:27:08,669 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1642218985] [2019-11-16 00:27:08,670 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:27:08,670 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:27:08,670 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:27:08,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:27:08,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:27:08,875 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-16 00:27:08,876 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1642218985] [2019-11-16 00:27:08,877 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:27:08,877 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-16 00:27:08,877 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [801691460] [2019-11-16 00:27:08,882 INFO L808 eck$LassoCheckResult]: loop already infeasible [2019-11-16 00:27:08,883 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:27:08,897 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-16 00:27:08,898 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-11-16 00:27:08,900 INFO L87 Difference]: Start difference. First operand 15 states. Second operand 7 states. [2019-11-16 00:27:09,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:27:09,040 INFO L93 Difference]: Finished difference Result 17 states and 19 transitions. [2019-11-16 00:27:09,041 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-16 00:27:09,043 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 17 states and 19 transitions. [2019-11-16 00:27:09,045 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 7 [2019-11-16 00:27:09,051 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 17 states to 14 states and 16 transitions. [2019-11-16 00:27:09,053 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 14 [2019-11-16 00:27:09,053 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 14 [2019-11-16 00:27:09,054 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 16 transitions. [2019-11-16 00:27:09,056 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-16 00:27:09,056 INFO L688 BuchiCegarLoop]: Abstraction has 14 states and 16 transitions. [2019-11-16 00:27:09,072 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states and 16 transitions. [2019-11-16 00:27:09,084 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2019-11-16 00:27:09,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2019-11-16 00:27:09,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 16 transitions. [2019-11-16 00:27:09,087 INFO L711 BuchiCegarLoop]: Abstraction has 14 states and 16 transitions. [2019-11-16 00:27:09,088 INFO L591 BuchiCegarLoop]: Abstraction has 14 states and 16 transitions. [2019-11-16 00:27:09,088 INFO L424 BuchiCegarLoop]: ======== Iteration 2============ [2019-11-16 00:27:09,088 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 14 states and 16 transitions. [2019-11-16 00:27:09,090 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 7 [2019-11-16 00:27:09,091 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-16 00:27:09,091 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-16 00:27:09,092 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2019-11-16 00:27:09,092 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:27:09,092 INFO L791 eck$LassoCheckResult]: Stem: 58#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 51#L-1 havoc main_#res;havoc main_#t~malloc7.base, main_#t~malloc7.offset, main_#t~nondet8, main_#t~malloc10.base, main_#t~malloc10.offset, main_#t~mem11, main_#t~mem13, main_#t~ret12, main_~op~0.base, main_~op~0.offset, main_#t~mem9, main_~ip~0.base, main_~ip~0.offset;call main_#t~malloc7.base, main_#t~malloc7.offset := #Ultimate.allocOnHeap(4);main_~ip~0.base, main_~ip~0.offset := main_#t~malloc7.base, main_#t~malloc7.offset;call write~int(main_#t~nondet8, main_~ip~0.base, main_~ip~0.offset, 4);havoc main_#t~nondet8; 52#L23-3 [2019-11-16 00:27:09,093 INFO L793 eck$LassoCheckResult]: Loop: 52#L23-3 call main_#t~mem9 := read~int(main_~ip~0.base, main_~ip~0.offset, 4); 59#L23-1 assume !!(main_#t~mem9 > 1);havoc main_#t~mem9;call main_#t~malloc10.base, main_#t~malloc10.offset := #Ultimate.allocOnHeap(4);main_~op~0.base, main_~op~0.offset := main_#t~malloc10.base, main_#t~malloc10.offset;call main_#t~mem11 := read~int(main_~ip~0.base, main_~ip~0.offset, 4);call write~int(main_#t~mem11, main_~op~0.base, main_~op~0.offset, 4);havoc main_#t~mem11;call main_#t~mem13 := read~int(main_~ip~0.base, main_~ip~0.offset, 4); 54#L26 call main_#t~ret12 := rec(main_~op~0.base, main_~op~0.offset, main_~ip~0.base, main_~ip~0.offset);< 57#recENTRY ~p.base, ~p.offset := #in~p.base, #in~p.offset;~up.base, ~up.offset := #in~up.base, #in~up.offset;call #t~mem1 := read~int(~p.base, ~p.offset, 4); 53#L9 assume !(#t~mem1 < 0);havoc #t~mem1;call #t~malloc3.base, #t~malloc3.offset := #Ultimate.allocOnHeap(4);~upn~0.base, ~upn~0.offset := #t~malloc3.base, #t~malloc3.offset;call #t~mem4 := read~int(~p.base, ~p.offset, 4);#t~post5 := #t~mem4;call write~int(#t~post5 - 1, ~p.base, ~p.offset, 4);havoc #t~post5;havoc #t~mem4; 55#L17 call #t~ret6 := rec(~p.base, ~p.offset, ~upn~0.base, ~upn~0.offset);< 57#recENTRY ~p.base, ~p.offset := #in~p.base, #in~p.offset;~up.base, ~up.offset := #in~up.base, #in~up.offset;call #t~mem1 := read~int(~p.base, ~p.offset, 4); 53#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);call ULTIMATE.dealloc(~up.base, ~up.offset);#res := ~pv~0; 56#recFINAL assume true; 60#recEXIT >#29#return; 61#L17-1 #res := #t~ret6;havoc #t~ret6; 62#recFINAL assume true; 64#recEXIT >#31#return; 63#L26-1 call write~int(main_#t~mem13 + main_#t~ret12, main_~ip~0.base, main_~ip~0.offset, 4);havoc main_#t~mem13;havoc main_#t~ret12; 52#L23-3 [2019-11-16 00:27:09,093 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:27:09,093 INFO L82 PathProgramCache]: Analyzing trace with hash 1219, now seen corresponding path program 2 times [2019-11-16 00:27:09,093 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:27:09,094 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [374815674] [2019-11-16 00:27:09,094 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:27:09,094 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:27:09,094 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:27:09,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:27:09,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:27:09,135 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-16 00:27:09,146 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:27:09,147 INFO L82 PathProgramCache]: Analyzing trace with hash -741726607, now seen corresponding path program 1 times [2019-11-16 00:27:09,147 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:27:09,147 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [743058663] [2019-11-16 00:27:09,154 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:27:09,155 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:27:09,155 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:27:09,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:27:09,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:27:09,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:27:09,369 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-11-16 00:27:09,370 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [743058663] [2019-11-16 00:27:09,370 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1345243217] [2019-11-16 00:27:09,370 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_a8020c52-882f-4ae8-99bc-0ef823a6a81d/bin/uautomizer/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:27:09,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:27:09,471 INFO L256 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 26 conjunts are in the unsatisfiable core [2019-11-16 00:27:09,474 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:27:09,565 INFO L341 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2019-11-16 00:27:09,566 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 18 [2019-11-16 00:27:09,567 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:27:09,576 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:27:09,578 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-16 00:27:09,578 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:23, output treesize:19 [2019-11-16 00:27:09,783 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-16 00:27:09,783 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-16 00:27:09,783 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9] total 15 [2019-11-16 00:27:09,784 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [156671372] [2019-11-16 00:27:09,784 INFO L808 eck$LassoCheckResult]: loop already infeasible [2019-11-16 00:27:09,784 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:27:09,785 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-11-16 00:27:09,785 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=196, Unknown=0, NotChecked=0, Total=240 [2019-11-16 00:27:09,785 INFO L87 Difference]: Start difference. First operand 14 states and 16 transitions. cyclomatic complexity: 4 Second operand 16 states. [2019-11-16 00:27:10,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:27:10,012 INFO L93 Difference]: Finished difference Result 17 states and 19 transitions. [2019-11-16 00:27:10,012 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-16 00:27:10,013 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 17 states and 19 transitions. [2019-11-16 00:27:10,014 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 7 [2019-11-16 00:27:10,015 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 17 states to 17 states and 19 transitions. [2019-11-16 00:27:10,015 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 17 [2019-11-16 00:27:10,016 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 17 [2019-11-16 00:27:10,016 INFO L73 IsDeterministic]: Start isDeterministic. Operand 17 states and 19 transitions. [2019-11-16 00:27:10,016 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-16 00:27:10,016 INFO L688 BuchiCegarLoop]: Abstraction has 17 states and 19 transitions. [2019-11-16 00:27:10,016 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states and 19 transitions. [2019-11-16 00:27:10,018 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2019-11-16 00:27:10,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2019-11-16 00:27:10,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 19 transitions. [2019-11-16 00:27:10,031 INFO L711 BuchiCegarLoop]: Abstraction has 17 states and 19 transitions. [2019-11-16 00:27:10,031 INFO L591 BuchiCegarLoop]: Abstraction has 17 states and 19 transitions. [2019-11-16 00:27:10,032 INFO L424 BuchiCegarLoop]: ======== Iteration 3============ [2019-11-16 00:27:10,032 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states and 19 transitions. [2019-11-16 00:27:10,033 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 7 [2019-11-16 00:27:10,033 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-16 00:27:10,033 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-16 00:27:10,034 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2019-11-16 00:27:10,034 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2019-11-16 00:27:10,034 INFO L791 eck$LassoCheckResult]: Stem: 167#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 160#L-1 havoc main_#res;havoc main_#t~malloc7.base, main_#t~malloc7.offset, main_#t~nondet8, main_#t~malloc10.base, main_#t~malloc10.offset, main_#t~mem11, main_#t~mem13, main_#t~ret12, main_~op~0.base, main_~op~0.offset, main_#t~mem9, main_~ip~0.base, main_~ip~0.offset;call main_#t~malloc7.base, main_#t~malloc7.offset := #Ultimate.allocOnHeap(4);main_~ip~0.base, main_~ip~0.offset := main_#t~malloc7.base, main_#t~malloc7.offset;call write~int(main_#t~nondet8, main_~ip~0.base, main_~ip~0.offset, 4);havoc main_#t~nondet8; 161#L23-3 [2019-11-16 00:27:10,034 INFO L793 eck$LassoCheckResult]: Loop: 161#L23-3 call main_#t~mem9 := read~int(main_~ip~0.base, main_~ip~0.offset, 4); 168#L23-1 assume !!(main_#t~mem9 > 1);havoc main_#t~mem9;call main_#t~malloc10.base, main_#t~malloc10.offset := #Ultimate.allocOnHeap(4);main_~op~0.base, main_~op~0.offset := main_#t~malloc10.base, main_#t~malloc10.offset;call main_#t~mem11 := read~int(main_~ip~0.base, main_~ip~0.offset, 4);call write~int(main_#t~mem11, main_~op~0.base, main_~op~0.offset, 4);havoc main_#t~mem11;call main_#t~mem13 := read~int(main_~ip~0.base, main_~ip~0.offset, 4); 163#L26 call main_#t~ret12 := rec(main_~op~0.base, main_~op~0.offset, main_~ip~0.base, main_~ip~0.offset);< 166#recENTRY ~p.base, ~p.offset := #in~p.base, #in~p.offset;~up.base, ~up.offset := #in~up.base, #in~up.offset;call #t~mem1 := read~int(~p.base, ~p.offset, 4); 162#L9 assume !(#t~mem1 < 0);havoc #t~mem1;call #t~malloc3.base, #t~malloc3.offset := #Ultimate.allocOnHeap(4);~upn~0.base, ~upn~0.offset := #t~malloc3.base, #t~malloc3.offset;call #t~mem4 := read~int(~p.base, ~p.offset, 4);#t~post5 := #t~mem4;call write~int(#t~post5 - 1, ~p.base, ~p.offset, 4);havoc #t~post5;havoc #t~mem4; 164#L17 call #t~ret6 := rec(~p.base, ~p.offset, ~upn~0.base, ~upn~0.offset);< 166#recENTRY ~p.base, ~p.offset := #in~p.base, #in~p.offset;~up.base, ~up.offset := #in~up.base, #in~up.offset;call #t~mem1 := read~int(~p.base, ~p.offset, 4); 162#L9 assume !(#t~mem1 < 0);havoc #t~mem1;call #t~malloc3.base, #t~malloc3.offset := #Ultimate.allocOnHeap(4);~upn~0.base, ~upn~0.offset := #t~malloc3.base, #t~malloc3.offset;call #t~mem4 := read~int(~p.base, ~p.offset, 4);#t~post5 := #t~mem4;call write~int(#t~post5 - 1, ~p.base, ~p.offset, 4);havoc #t~post5;havoc #t~mem4; 164#L17 call #t~ret6 := rec(~p.base, ~p.offset, ~upn~0.base, ~upn~0.offset);< 166#recENTRY ~p.base, ~p.offset := #in~p.base, #in~p.offset;~up.base, ~up.offset := #in~up.base, #in~up.offset;call #t~mem1 := read~int(~p.base, ~p.offset, 4); 162#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);call ULTIMATE.dealloc(~up.base, ~up.offset);#res := ~pv~0; 165#recFINAL assume true; 169#recEXIT >#29#return; 170#L17-1 #res := #t~ret6;havoc #t~ret6; 171#recFINAL assume true; 176#recEXIT >#29#return; 174#L17-1 #res := #t~ret6;havoc #t~ret6; 175#recFINAL assume true; 173#recEXIT >#31#return; 172#L26-1 call write~int(main_#t~mem13 + main_#t~ret12, main_~ip~0.base, main_~ip~0.offset, 4);havoc main_#t~mem13;havoc main_#t~ret12; 161#L23-3 [2019-11-16 00:27:10,035 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:27:10,035 INFO L82 PathProgramCache]: Analyzing trace with hash 1219, now seen corresponding path program 3 times [2019-11-16 00:27:10,035 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:27:10,035 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1444442150] [2019-11-16 00:27:10,036 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:27:10,036 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:27:10,036 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:27:10,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:27:10,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:27:10,062 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-16 00:27:10,062 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:27:10,063 INFO L82 PathProgramCache]: Analyzing trace with hash -1620168125, now seen corresponding path program 2 times [2019-11-16 00:27:10,063 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:27:10,063 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1196906411] [2019-11-16 00:27:10,063 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:27:10,063 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:27:10,064 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:27:10,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:27:10,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:27:10,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:27:10,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:27:10,406 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-11-16 00:27:10,406 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1196906411] [2019-11-16 00:27:10,406 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [713620213] [2019-11-16 00:27:10,406 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_a8020c52-882f-4ae8-99bc-0ef823a6a81d/bin/uautomizer/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:27:10,480 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-16 00:27:10,480 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-16 00:27:10,482 INFO L256 TraceCheckSpWp]: Trace formula consists of 180 conjuncts, 43 conjunts are in the unsatisfiable core [2019-11-16 00:27:10,490 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:27:10,527 INFO L341 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2019-11-16 00:27:10,527 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 18 [2019-11-16 00:27:10,528 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:27:10,538 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:27:10,539 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-16 00:27:10,540 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:26, output treesize:22 [2019-11-16 00:27:10,817 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-11-16 00:27:10,818 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-16 00:27:10,818 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10] total 18 [2019-11-16 00:27:10,818 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [982065978] [2019-11-16 00:27:10,819 INFO L808 eck$LassoCheckResult]: loop already infeasible [2019-11-16 00:27:10,819 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:27:10,819 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-11-16 00:27:10,820 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=286, Unknown=0, NotChecked=0, Total=342 [2019-11-16 00:27:10,820 INFO L87 Difference]: Start difference. First operand 17 states and 19 transitions. cyclomatic complexity: 4 Second operand 19 states. [2019-11-16 00:27:11,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:27:11,124 INFO L93 Difference]: Finished difference Result 20 states and 22 transitions. [2019-11-16 00:27:11,124 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-16 00:27:11,125 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 20 states and 22 transitions. [2019-11-16 00:27:11,126 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 7 [2019-11-16 00:27:11,127 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 20 states to 20 states and 22 transitions. [2019-11-16 00:27:11,128 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 20 [2019-11-16 00:27:11,128 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 20 [2019-11-16 00:27:11,128 INFO L73 IsDeterministic]: Start isDeterministic. Operand 20 states and 22 transitions. [2019-11-16 00:27:11,128 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-16 00:27:11,128 INFO L688 BuchiCegarLoop]: Abstraction has 20 states and 22 transitions. [2019-11-16 00:27:11,129 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states and 22 transitions. [2019-11-16 00:27:11,131 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2019-11-16 00:27:11,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2019-11-16 00:27:11,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 22 transitions. [2019-11-16 00:27:11,132 INFO L711 BuchiCegarLoop]: Abstraction has 20 states and 22 transitions. [2019-11-16 00:27:11,133 INFO L591 BuchiCegarLoop]: Abstraction has 20 states and 22 transitions. [2019-11-16 00:27:11,133 INFO L424 BuchiCegarLoop]: ======== Iteration 4============ [2019-11-16 00:27:11,133 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 20 states and 22 transitions. [2019-11-16 00:27:11,134 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 7 [2019-11-16 00:27:11,134 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-16 00:27:11,135 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-16 00:27:11,136 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2019-11-16 00:27:11,136 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [4, 4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1] [2019-11-16 00:27:11,136 INFO L791 eck$LassoCheckResult]: Stem: 319#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 316#L-1 havoc main_#res;havoc main_#t~malloc7.base, main_#t~malloc7.offset, main_#t~nondet8, main_#t~malloc10.base, main_#t~malloc10.offset, main_#t~mem11, main_#t~mem13, main_#t~ret12, main_~op~0.base, main_~op~0.offset, main_#t~mem9, main_~ip~0.base, main_~ip~0.offset;call main_#t~malloc7.base, main_#t~malloc7.offset := #Ultimate.allocOnHeap(4);main_~ip~0.base, main_~ip~0.offset := main_#t~malloc7.base, main_#t~malloc7.offset;call write~int(main_#t~nondet8, main_~ip~0.base, main_~ip~0.offset, 4);havoc main_#t~nondet8; 317#L23-3 [2019-11-16 00:27:11,136 INFO L793 eck$LassoCheckResult]: Loop: 317#L23-3 call main_#t~mem9 := read~int(main_~ip~0.base, main_~ip~0.offset, 4); 320#L23-1 assume !!(main_#t~mem9 > 1);havoc main_#t~mem9;call main_#t~malloc10.base, main_#t~malloc10.offset := #Ultimate.allocOnHeap(4);main_~op~0.base, main_~op~0.offset := main_#t~malloc10.base, main_#t~malloc10.offset;call main_#t~mem11 := read~int(main_~ip~0.base, main_~ip~0.offset, 4);call write~int(main_#t~mem11, main_~op~0.base, main_~op~0.offset, 4);havoc main_#t~mem11;call main_#t~mem13 := read~int(main_~ip~0.base, main_~ip~0.offset, 4); 313#L26 call main_#t~ret12 := rec(main_~op~0.base, main_~op~0.offset, main_~ip~0.base, main_~ip~0.offset);< 318#recENTRY ~p.base, ~p.offset := #in~p.base, #in~p.offset;~up.base, ~up.offset := #in~up.base, #in~up.offset;call #t~mem1 := read~int(~p.base, ~p.offset, 4); 312#L9 assume !(#t~mem1 < 0);havoc #t~mem1;call #t~malloc3.base, #t~malloc3.offset := #Ultimate.allocOnHeap(4);~upn~0.base, ~upn~0.offset := #t~malloc3.base, #t~malloc3.offset;call #t~mem4 := read~int(~p.base, ~p.offset, 4);#t~post5 := #t~mem4;call write~int(#t~post5 - 1, ~p.base, ~p.offset, 4);havoc #t~post5;havoc #t~mem4; 314#L17 call #t~ret6 := rec(~p.base, ~p.offset, ~upn~0.base, ~upn~0.offset);< 318#recENTRY ~p.base, ~p.offset := #in~p.base, #in~p.offset;~up.base, ~up.offset := #in~up.base, #in~up.offset;call #t~mem1 := read~int(~p.base, ~p.offset, 4); 312#L9 assume !(#t~mem1 < 0);havoc #t~mem1;call #t~malloc3.base, #t~malloc3.offset := #Ultimate.allocOnHeap(4);~upn~0.base, ~upn~0.offset := #t~malloc3.base, #t~malloc3.offset;call #t~mem4 := read~int(~p.base, ~p.offset, 4);#t~post5 := #t~mem4;call write~int(#t~post5 - 1, ~p.base, ~p.offset, 4);havoc #t~post5;havoc #t~mem4; 314#L17 call #t~ret6 := rec(~p.base, ~p.offset, ~upn~0.base, ~upn~0.offset);< 318#recENTRY ~p.base, ~p.offset := #in~p.base, #in~p.offset;~up.base, ~up.offset := #in~up.base, #in~up.offset;call #t~mem1 := read~int(~p.base, ~p.offset, 4); 312#L9 assume !(#t~mem1 < 0);havoc #t~mem1;call #t~malloc3.base, #t~malloc3.offset := #Ultimate.allocOnHeap(4);~upn~0.base, ~upn~0.offset := #t~malloc3.base, #t~malloc3.offset;call #t~mem4 := read~int(~p.base, ~p.offset, 4);#t~post5 := #t~mem4;call write~int(#t~post5 - 1, ~p.base, ~p.offset, 4);havoc #t~post5;havoc #t~mem4; 314#L17 call #t~ret6 := rec(~p.base, ~p.offset, ~upn~0.base, ~upn~0.offset);< 318#recENTRY ~p.base, ~p.offset := #in~p.base, #in~p.offset;~up.base, ~up.offset := #in~up.base, #in~up.offset;call #t~mem1 := read~int(~p.base, ~p.offset, 4); 312#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);call ULTIMATE.dealloc(~up.base, ~up.offset);#res := ~pv~0; 315#recFINAL assume true; 331#recEXIT >#29#return; 324#L17-1 #res := #t~ret6;havoc #t~ret6; 323#recFINAL assume true; 321#recEXIT >#29#return; 322#L17-1 #res := #t~ret6;havoc #t~ret6; 330#recFINAL assume true; 329#recEXIT >#29#return; 327#L17-1 #res := #t~ret6;havoc #t~ret6; 328#recFINAL assume true; 326#recEXIT >#31#return; 325#L26-1 call write~int(main_#t~mem13 + main_#t~ret12, main_~ip~0.base, main_~ip~0.offset, 4);havoc main_#t~mem13;havoc main_#t~ret12; 317#L23-3 [2019-11-16 00:27:11,137 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:27:11,137 INFO L82 PathProgramCache]: Analyzing trace with hash 1219, now seen corresponding path program 4 times [2019-11-16 00:27:11,137 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:27:11,138 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [571837070] [2019-11-16 00:27:11,138 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:27:11,138 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:27:11,138 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:27:11,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:27:11,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:27:11,148 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-16 00:27:11,148 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:27:11,149 INFO L82 PathProgramCache]: Analyzing trace with hash 1930575665, now seen corresponding path program 3 times [2019-11-16 00:27:11,149 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:27:11,149 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [962754413] [2019-11-16 00:27:11,149 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:27:11,150 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:27:11,150 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:27:11,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:27:11,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:27:11,293 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-16 00:27:11,294 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:27:11,294 INFO L82 PathProgramCache]: Analyzing trace with hash 650376563, now seen corresponding path program 1 times [2019-11-16 00:27:11,294 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:27:11,294 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [257186448] [2019-11-16 00:27:11,294 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:27:11,295 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:27:11,295 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:27:11,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:27:11,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:27:11,362 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-16 00:27:11,903 WARN L191 SmtUtils]: Spent 304.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 97 [2019-11-16 00:27:12,119 WARN L191 SmtUtils]: Spent 127.00 ms on a formula simplification that was a NOOP. DAG size: 82 [2019-11-16 00:27:12,238 WARN L191 SmtUtils]: Spent 116.00 ms on a formula simplification that was a NOOP. DAG size: 76 [2019-11-16 00:27:12,704 WARN L191 SmtUtils]: Spent 463.00 ms on a formula simplification. DAG size of input: 125 DAG size of output: 113 [2019-11-16 00:27:12,893 WARN L191 SmtUtils]: Spent 106.00 ms on a formula simplification that was a NOOP. DAG size: 90 [2019-11-16 00:27:13,037 WARN L191 SmtUtils]: Spent 141.00 ms on a formula simplification that was a NOOP. DAG size: 84 [2019-11-16 00:27:13,442 WARN L191 SmtUtils]: Spent 402.00 ms on a formula simplification. DAG size of input: 134 DAG size of output: 122 [2019-11-16 00:27:13,662 WARN L191 SmtUtils]: Spent 129.00 ms on a formula simplification that was a NOOP. DAG size: 99 [2019-11-16 00:27:13,776 WARN L191 SmtUtils]: Spent 110.00 ms on a formula simplification that was a NOOP. DAG size: 93 [2019-11-16 00:27:14,326 WARN L191 SmtUtils]: Spent 547.00 ms on a formula simplification. DAG size of input: 149 DAG size of output: 127 [2019-11-16 00:27:14,474 WARN L191 SmtUtils]: Spent 141.00 ms on a formula simplification that was a NOOP. DAG size: 80 [2019-11-16 00:27:14,587 INFO L210 LassoAnalysis]: Preferences: [2019-11-16 00:27:14,588 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-11-16 00:27:14,588 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-16 00:27:14,588 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-11-16 00:27:14,588 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-11-16 00:27:14,588 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-16 00:27:14,589 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-16 00:27:14,589 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-11-16 00:27:14,589 INFO L131 ssoRankerPreferences]: Filename of dumped script: rec_malloc_ex2.i_Iteration4_Lasso [2019-11-16 00:27:14,589 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-16 00:27:14,589 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-16 00:27:14,606 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-16 00:27:14,612 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-16 00:27:14,613 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-16 00:27:14,615 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-16 00:27:14,617 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-16 00:27:14,620 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-16 00:27:14,887 WARN L191 SmtUtils]: Spent 163.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 71 [2019-11-16 00:27:14,887 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-16 00:27:14,889 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-16 00:27:14,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-16 00:27:15,739 WARN L191 SmtUtils]: Spent 613.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 50 [2019-11-16 00:27:15,793 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-16 00:27:15,798 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-11-16 00:27:15,800 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-16 00:27:15,802 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:27:15,802 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:27:15,803 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:27:15,803 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:27:15,803 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:27:15,805 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:27:15,806 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:27:15,808 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:27:15,808 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-16 00:27:15,809 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:27:15,809 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:27:15,809 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:27:15,810 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:27:15,810 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:27:15,810 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:27:15,810 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:27:15,811 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:27:15,811 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-16 00:27:15,812 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:27:15,812 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:27:15,812 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:27:15,813 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:27:15,813 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:27:15,814 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:27:15,814 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:27:15,814 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:27:15,815 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-16 00:27:15,815 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:27:15,816 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:27:15,816 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:27:15,816 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:27:15,816 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:27:15,817 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:27:15,817 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:27:15,817 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:27:15,818 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-16 00:27:15,818 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:27:15,819 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:27:15,819 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:27:15,819 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:27:15,821 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-16 00:27:15,822 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-16 00:27:15,823 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:27:15,824 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-16 00:27:15,826 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:27:15,826 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:27:15,826 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:27:15,826 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:27:15,827 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:27:15,827 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:27:15,828 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:27:15,828 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:27:15,829 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-16 00:27:15,829 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:27:15,830 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:27:15,830 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:27:15,830 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:27:15,834 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-16 00:27:15,834 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-16 00:27:15,844 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:27:15,845 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-16 00:27:15,846 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:27:15,846 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:27:15,846 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:27:15,846 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:27:15,846 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:27:15,847 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:27:15,847 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:27:15,849 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:27:15,849 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-16 00:27:15,850 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:27:15,850 INFO L202 nArgumentSynthesizer]: 2 stem disjuncts [2019-11-16 00:27:15,850 INFO L203 nArgumentSynthesizer]: 16 loop disjuncts [2019-11-16 00:27:15,850 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:27:16,084 INFO L400 nArgumentSynthesizer]: We have 608 Motzkin's Theorem applications. [2019-11-16 00:27:16,085 INFO L401 nArgumentSynthesizer]: A total of 32 supporting invariants were added. [2019-11-16 00:27:18,572 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:27:18,573 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-16 00:27:18,574 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:27:18,574 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:27:18,574 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:27:18,575 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:27:18,575 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:27:18,575 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:27:18,575 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:27:18,577 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:27:18,577 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-16 00:27:18,586 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:27:18,587 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:27:18,587 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:27:18,587 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:27:18,588 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-16 00:27:18,589 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-16 00:27:18,615 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-16 00:27:18,635 INFO L443 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. [2019-11-16 00:27:18,636 INFO L444 ModelExtractionUtils]: 6 out of 10 variables were initially zero. Simplification set additionally 2 variables to zero. [2019-11-16 00:27:18,638 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-16 00:27:18,640 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-11-16 00:27:18,640 INFO L510 LassoAnalysis]: Proved termination. [2019-11-16 00:27:18,641 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_main_~ip~0.base) ULTIMATE.start_main_~ip~0.offset)_1) = 1*v_rep(select (select #memory_int ULTIMATE.start_main_~ip~0.base) ULTIMATE.start_main_~ip~0.offset)_1 Supporting invariants [] [2019-11-16 00:27:18,659 INFO L297 tatePredicateManager]: 3 out of 3 supporting invariants were superfluous and have been removed [2019-11-16 00:27:18,666 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-11-16 00:27:18,686 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:27:18,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:27:18,697 INFO L256 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-16 00:27:18,697 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:27:18,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:27:18,769 INFO L256 TraceCheckSpWp]: Trace formula consists of 351 conjuncts, 32 conjunts are in the unsatisfiable core [2019-11-16 00:27:18,774 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:27:18,807 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:27:18,807 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 15 [2019-11-16 00:27:18,808 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:27:18,823 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:27:18,829 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:27:18,832 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2019-11-16 00:27:18,832 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-16 00:27:18,840 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:27:18,841 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:27:18,841 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:44, output treesize:7 [2019-11-16 00:27:19,020 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2019-11-16 00:27:19,024 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 8 loop predicates [2019-11-16 00:27:19,025 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 20 states and 22 transitions. cyclomatic complexity: 4 Second operand 9 states. [2019-11-16 00:27:19,219 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 20 states and 22 transitions. cyclomatic complexity: 4. Second operand 9 states. Result 66 states and 73 transitions. Complement of second has 24 states. [2019-11-16 00:27:19,222 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 9 states 1 stem states 7 non-accepting loop states 1 accepting loop states [2019-11-16 00:27:19,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2019-11-16 00:27:19,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 14 transitions. [2019-11-16 00:27:19,225 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 14 transitions. Stem has 2 letters. Loop has 26 letters. [2019-11-16 00:27:19,227 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-16 00:27:19,228 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 14 transitions. Stem has 28 letters. Loop has 26 letters. [2019-11-16 00:27:19,229 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-16 00:27:19,229 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 14 transitions. Stem has 2 letters. Loop has 52 letters. [2019-11-16 00:27:19,232 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-16 00:27:19,232 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 66 states and 73 transitions. [2019-11-16 00:27:19,238 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-11-16 00:27:19,243 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 66 states to 35 states and 40 transitions. [2019-11-16 00:27:19,244 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2019-11-16 00:27:19,244 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2019-11-16 00:27:19,245 INFO L73 IsDeterministic]: Start isDeterministic. Operand 35 states and 40 transitions. [2019-11-16 00:27:19,245 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-16 00:27:19,245 INFO L688 BuchiCegarLoop]: Abstraction has 35 states and 40 transitions. [2019-11-16 00:27:19,246 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states and 40 transitions. [2019-11-16 00:27:19,253 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 29. [2019-11-16 00:27:19,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2019-11-16 00:27:19,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 33 transitions. [2019-11-16 00:27:19,255 INFO L711 BuchiCegarLoop]: Abstraction has 29 states and 33 transitions. [2019-11-16 00:27:19,255 INFO L591 BuchiCegarLoop]: Abstraction has 29 states and 33 transitions. [2019-11-16 00:27:19,255 INFO L424 BuchiCegarLoop]: ======== Iteration 5============ [2019-11-16 00:27:19,255 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 29 states and 33 transitions. [2019-11-16 00:27:19,257 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-11-16 00:27:19,258 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-16 00:27:19,258 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-16 00:27:19,259 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2019-11-16 00:27:19,259 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-11-16 00:27:19,260 INFO L791 eck$LassoCheckResult]: Stem: 560#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 547#L-1 havoc main_#res;havoc main_#t~malloc7.base, main_#t~malloc7.offset, main_#t~nondet8, main_#t~malloc10.base, main_#t~malloc10.offset, main_#t~mem11, main_#t~mem13, main_#t~ret12, main_~op~0.base, main_~op~0.offset, main_#t~mem9, main_~ip~0.base, main_~ip~0.offset;call main_#t~malloc7.base, main_#t~malloc7.offset := #Ultimate.allocOnHeap(4);main_~ip~0.base, main_~ip~0.offset := main_#t~malloc7.base, main_#t~malloc7.offset;call write~int(main_#t~nondet8, main_~ip~0.base, main_~ip~0.offset, 4);havoc main_#t~nondet8; 548#L23-3 call main_#t~mem9 := read~int(main_~ip~0.base, main_~ip~0.offset, 4); 561#L23-1 assume !!(main_#t~mem9 > 1);havoc main_#t~mem9;call main_#t~malloc10.base, main_#t~malloc10.offset := #Ultimate.allocOnHeap(4);main_~op~0.base, main_~op~0.offset := main_#t~malloc10.base, main_#t~malloc10.offset;call main_#t~mem11 := read~int(main_~ip~0.base, main_~ip~0.offset, 4);call write~int(main_#t~mem11, main_~op~0.base, main_~op~0.offset, 4);havoc main_#t~mem11;call main_#t~mem13 := read~int(main_~ip~0.base, main_~ip~0.offset, 4); 550#L26 call main_#t~ret12 := rec(main_~op~0.base, main_~op~0.offset, main_~ip~0.base, main_~ip~0.offset);< 556#recENTRY [2019-11-16 00:27:19,260 INFO L793 eck$LassoCheckResult]: Loop: 556#recENTRY ~p.base, ~p.offset := #in~p.base, #in~p.offset;~up.base, ~up.offset := #in~up.base, #in~up.offset;call #t~mem1 := read~int(~p.base, ~p.offset, 4); 549#L9 assume !(#t~mem1 < 0);havoc #t~mem1;call #t~malloc3.base, #t~malloc3.offset := #Ultimate.allocOnHeap(4);~upn~0.base, ~upn~0.offset := #t~malloc3.base, #t~malloc3.offset;call #t~mem4 := read~int(~p.base, ~p.offset, 4);#t~post5 := #t~mem4;call write~int(#t~post5 - 1, ~p.base, ~p.offset, 4);havoc #t~post5;havoc #t~mem4; 551#L17 call #t~ret6 := rec(~p.base, ~p.offset, ~upn~0.base, ~upn~0.offset);< 556#recENTRY [2019-11-16 00:27:19,260 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:27:19,260 INFO L82 PathProgramCache]: Analyzing trace with hash 36330294, now seen corresponding path program 1 times [2019-11-16 00:27:19,260 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:27:19,261 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2103903714] [2019-11-16 00:27:19,262 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:27:19,262 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:27:19,262 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:27:19,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:27:19,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:27:19,294 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-16 00:27:19,294 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:27:19,295 INFO L82 PathProgramCache]: Analyzing trace with hash 29943, now seen corresponding path program 1 times [2019-11-16 00:27:19,295 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:27:19,295 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [806778160] [2019-11-16 00:27:19,295 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:27:19,296 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:27:19,296 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:27:19,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:27:19,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:27:19,311 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-16 00:27:19,311 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:27:19,312 INFO L82 PathProgramCache]: Analyzing trace with hash -15969886, now seen corresponding path program 1 times [2019-11-16 00:27:19,312 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:27:19,312 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [945807183] [2019-11-16 00:27:19,312 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:27:19,312 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:27:19,313 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:27:19,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:27:19,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:27:19,355 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-16 00:27:19,571 WARN L191 SmtUtils]: Spent 212.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 70 [2019-11-16 00:27:19,679 WARN L191 SmtUtils]: Spent 107.00 ms on a formula simplification that was a NOOP. DAG size: 67 [2019-11-16 00:27:19,800 WARN L191 SmtUtils]: Spent 101.00 ms on a formula simplification that was a NOOP. DAG size: 73 [2019-11-16 00:27:20,305 WARN L191 SmtUtils]: Spent 436.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 91 [2019-11-16 00:27:20,462 WARN L191 SmtUtils]: Spent 154.00 ms on a formula simplification that was a NOOP. DAG size: 79 [2019-11-16 00:27:20,667 WARN L191 SmtUtils]: Spent 188.00 ms on a formula simplification that was a NOOP. DAG size: 85 [2019-11-16 00:27:20,769 INFO L210 LassoAnalysis]: Preferences: [2019-11-16 00:27:20,770 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-11-16 00:27:20,770 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-16 00:27:20,770 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-11-16 00:27:20,770 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-11-16 00:27:20,770 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-16 00:27:20,770 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-16 00:27:20,770 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-11-16 00:27:20,770 INFO L131 ssoRankerPreferences]: Filename of dumped script: rec_malloc_ex2.i_Iteration5_Lasso [2019-11-16 00:27:20,770 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-16 00:27:20,771 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-16 00:27:20,774 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-16 00:27:20,783 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-16 00:27:20,785 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-16 00:27:20,787 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-16 00:27:20,790 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-16 00:27:20,792 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-16 00:27:20,795 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-16 00:27:20,798 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-16 00:27:20,801 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:27:20,803 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-16 00:27:20,805 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-16 00:27:20,808 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-16 00:27:20,811 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-16 00:27:20,979 WARN L191 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 48 [2019-11-16 00:27:21,072 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-16 00:27:21,076 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-16 00:27:21,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-16 00:27:21,080 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-16 00:27:21,083 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-16 00:27:21,086 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-16 00:27:21,090 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-16 00:27:21,092 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-16 00:27:21,095 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-16 00:27:21,097 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-16 00:27:21,100 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-16 00:27:21,256 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-16 00:27:21,258 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-16 00:27:21,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-16 00:27:21,263 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-16 00:27:21,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-16 00:27:21,267 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-16 00:27:21,270 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-16 00:27:21,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-16 00:27:21,276 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-16 00:27:21,279 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-16 00:27:21,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-16 00:27:21,729 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-16 00:27:21,729 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-11-16 00:27:21,730 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-16 00:27:21,731 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:27:21,731 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:27:21,731 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:27:21,731 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:27:21,731 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:27:21,732 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:27:21,732 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:27:21,732 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:27:21,733 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-16 00:27:21,733 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:27:21,733 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:27:21,734 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:27:21,734 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:27:21,734 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:27:21,734 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:27:21,734 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:27:21,735 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:27:21,735 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-16 00:27:21,736 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:27:21,736 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:27:21,736 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:27:21,736 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:27:21,736 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:27:21,736 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:27:21,736 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:27:21,737 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:27:21,737 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-16 00:27:21,737 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:27:21,738 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:27:21,738 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:27:21,738 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:27:21,738 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:27:21,738 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:27:21,738 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:27:21,738 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:27:21,739 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-16 00:27:21,739 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:27:21,739 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:27:21,739 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:27:21,740 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:27:21,740 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:27:21,740 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:27:21,740 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:27:21,741 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:27:21,741 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-16 00:27:21,742 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:27:21,742 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:27:21,742 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:27:21,742 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:27:21,743 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-16 00:27:21,743 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-16 00:27:21,744 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:27:21,745 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-16 00:27:21,745 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:27:21,746 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:27:21,746 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:27:21,746 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:27:21,746 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:27:21,746 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:27:21,747 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:27:21,747 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:27:21,747 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-16 00:27:21,748 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:27:21,748 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:27:21,748 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:27:21,748 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:27:21,749 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:27:21,749 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:27:21,749 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:27:21,750 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:27:21,750 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-16 00:27:21,751 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:27:21,751 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:27:21,751 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:27:21,751 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:27:21,751 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:27:21,752 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:27:21,752 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:27:21,752 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:27:21,753 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-16 00:27:21,753 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:27:21,754 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:27:21,754 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:27:21,754 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:27:21,754 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:27:21,754 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:27:21,755 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:27:21,755 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:27:21,755 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-16 00:27:21,756 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:27:21,756 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:27:21,756 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:27:21,757 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:27:21,757 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:27:21,757 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:27:21,757 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:27:21,758 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:27:21,758 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-16 00:27:21,759 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:27:21,759 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:27:21,759 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:27:21,759 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:27:21,760 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:27:21,760 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:27:21,760 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:27:21,761 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:27:21,761 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-16 00:27:21,762 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:27:21,762 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:27:21,762 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:27:21,762 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:27:21,763 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-16 00:27:21,764 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-16 00:27:21,771 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:27:21,772 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-16 00:27:21,772 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:27:21,773 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:27:21,773 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:27:21,773 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:27:21,774 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-16 00:27:21,774 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-16 00:27:21,794 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-16 00:27:21,802 INFO L443 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. [2019-11-16 00:27:21,802 INFO L444 ModelExtractionUtils]: 11 out of 16 variables were initially zero. Simplification set additionally 2 variables to zero. [2019-11-16 00:27:21,803 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-16 00:27:21,803 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-11-16 00:27:21,804 INFO L510 LassoAnalysis]: Proved termination. [2019-11-16 00:27:21,804 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-16 00:27:21,818 INFO L297 tatePredicateManager]: 3 out of 3 supporting invariants were superfluous and have been removed [2019-11-16 00:27:21,822 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-11-16 00:27:21,840 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:27:21,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:27:21,863 INFO L256 TraceCheckSpWp]: Trace formula consists of 98 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-16 00:27:21,864 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:27:21,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:27:21,882 INFO L256 TraceCheckSpWp]: Trace formula consists of 78 conjuncts, 17 conjunts are in the unsatisfiable core [2019-11-16 00:27:21,883 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:27:21,904 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-16 00:27:21,904 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:27:21,915 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:27:21,915 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:27:21,915 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:36, output treesize:21 [2019-11-16 00:27:21,936 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-16 00:27:21,936 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-16 00:27:21,936 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 29 states and 33 transitions. cyclomatic complexity: 7 Second operand 4 states. [2019-11-16 00:27:22,041 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 29 states and 33 transitions. cyclomatic complexity: 7. Second operand 4 states. Result 57 states and 66 transitions. Complement of second has 14 states. [2019-11-16 00:27:22,041 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-16 00:27:22,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-11-16 00:27:22,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 10 transitions. [2019-11-16 00:27:22,042 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 10 transitions. Stem has 5 letters. Loop has 3 letters. [2019-11-16 00:27:22,043 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-16 00:27:22,043 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 10 transitions. Stem has 8 letters. Loop has 3 letters. [2019-11-16 00:27:22,044 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-16 00:27:22,044 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 10 transitions. Stem has 5 letters. Loop has 6 letters. [2019-11-16 00:27:22,044 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-16 00:27:22,044 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 57 states and 66 transitions. [2019-11-16 00:27:22,047 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-11-16 00:27:22,049 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 57 states to 40 states and 48 transitions. [2019-11-16 00:27:22,049 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 8 [2019-11-16 00:27:22,049 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 8 [2019-11-16 00:27:22,049 INFO L73 IsDeterministic]: Start isDeterministic. Operand 40 states and 48 transitions. [2019-11-16 00:27:22,049 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-16 00:27:22,049 INFO L688 BuchiCegarLoop]: Abstraction has 40 states and 48 transitions. [2019-11-16 00:27:22,049 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states and 48 transitions. [2019-11-16 00:27:22,054 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2019-11-16 00:27:22,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2019-11-16 00:27:22,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 48 transitions. [2019-11-16 00:27:22,056 INFO L711 BuchiCegarLoop]: Abstraction has 40 states and 48 transitions. [2019-11-16 00:27:22,056 INFO L591 BuchiCegarLoop]: Abstraction has 40 states and 48 transitions. [2019-11-16 00:27:22,056 INFO L424 BuchiCegarLoop]: ======== Iteration 6============ [2019-11-16 00:27:22,057 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 40 states and 48 transitions. [2019-11-16 00:27:22,058 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-11-16 00:27:22,058 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-16 00:27:22,058 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-16 00:27:22,060 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [4, 4, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1] [2019-11-16 00:27:22,060 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-11-16 00:27:22,060 INFO L791 eck$LassoCheckResult]: Stem: 714#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 710#L-1 havoc main_#res;havoc main_#t~malloc7.base, main_#t~malloc7.offset, main_#t~nondet8, main_#t~malloc10.base, main_#t~malloc10.offset, main_#t~mem11, main_#t~mem13, main_#t~ret12, main_~op~0.base, main_~op~0.offset, main_#t~mem9, main_~ip~0.base, main_~ip~0.offset;call main_#t~malloc7.base, main_#t~malloc7.offset := #Ultimate.allocOnHeap(4);main_~ip~0.base, main_~ip~0.offset := main_#t~malloc7.base, main_#t~malloc7.offset;call write~int(main_#t~nondet8, main_~ip~0.base, main_~ip~0.offset, 4);havoc main_#t~nondet8; 711#L23-3 call main_#t~mem9 := read~int(main_~ip~0.base, main_~ip~0.offset, 4); 727#L23-1 assume !!(main_#t~mem9 > 1);havoc main_#t~mem9;call main_#t~malloc10.base, main_#t~malloc10.offset := #Ultimate.allocOnHeap(4);main_~op~0.base, main_~op~0.offset := main_#t~malloc10.base, main_#t~malloc10.offset;call main_#t~mem11 := read~int(main_~ip~0.base, main_~ip~0.offset, 4);call write~int(main_#t~mem11, main_~op~0.base, main_~op~0.offset, 4);havoc main_#t~mem11;call main_#t~mem13 := read~int(main_~ip~0.base, main_~ip~0.offset, 4); 729#L26 call main_#t~ret12 := rec(main_~op~0.base, main_~op~0.offset, main_~ip~0.base, main_~ip~0.offset);< 743#recENTRY ~p.base, ~p.offset := #in~p.base, #in~p.offset;~up.base, ~up.offset := #in~up.base, #in~up.offset;call #t~mem1 := read~int(~p.base, ~p.offset, 4); 742#L9 assume !(#t~mem1 < 0);havoc #t~mem1;call #t~malloc3.base, #t~malloc3.offset := #Ultimate.allocOnHeap(4);~upn~0.base, ~upn~0.offset := #t~malloc3.base, #t~malloc3.offset;call #t~mem4 := read~int(~p.base, ~p.offset, 4);#t~post5 := #t~mem4;call write~int(#t~post5 - 1, ~p.base, ~p.offset, 4);havoc #t~post5;havoc #t~mem4; 722#L17 call #t~ret6 := rec(~p.base, ~p.offset, ~upn~0.base, ~upn~0.offset);< 740#recENTRY ~p.base, ~p.offset := #in~p.base, #in~p.offset;~up.base, ~up.offset := #in~up.base, #in~up.offset;call #t~mem1 := read~int(~p.base, ~p.offset, 4); 739#L9 assume !(#t~mem1 < 0);havoc #t~mem1;call #t~malloc3.base, #t~malloc3.offset := #Ultimate.allocOnHeap(4);~upn~0.base, ~upn~0.offset := #t~malloc3.base, #t~malloc3.offset;call #t~mem4 := read~int(~p.base, ~p.offset, 4);#t~post5 := #t~mem4;call write~int(#t~post5 - 1, ~p.base, ~p.offset, 4);havoc #t~post5;havoc #t~mem4; 723#L17 call #t~ret6 := rec(~p.base, ~p.offset, ~upn~0.base, ~upn~0.offset);< 740#recENTRY ~p.base, ~p.offset := #in~p.base, #in~p.offset;~up.base, ~up.offset := #in~up.base, #in~up.offset;call #t~mem1 := read~int(~p.base, ~p.offset, 4); 739#L9 assume !(#t~mem1 < 0);havoc #t~mem1;call #t~malloc3.base, #t~malloc3.offset := #Ultimate.allocOnHeap(4);~upn~0.base, ~upn~0.offset := #t~malloc3.base, #t~malloc3.offset;call #t~mem4 := read~int(~p.base, ~p.offset, 4);#t~post5 := #t~mem4;call write~int(#t~post5 - 1, ~p.base, ~p.offset, 4);havoc #t~post5;havoc #t~mem4; 723#L17 call #t~ret6 := rec(~p.base, ~p.offset, ~upn~0.base, ~upn~0.offset);< 740#recENTRY ~p.base, ~p.offset := #in~p.base, #in~p.offset;~up.base, ~up.offset := #in~up.base, #in~up.offset;call #t~mem1 := read~int(~p.base, ~p.offset, 4); 736#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);call ULTIMATE.dealloc(~up.base, ~up.offset);#res := ~pv~0; 737#recFINAL assume true; 741#recEXIT >#29#return; 719#L17-1 #res := #t~ret6;havoc #t~ret6; 724#recFINAL assume true; 735#recEXIT >#29#return; 733#L17-1 #res := #t~ret6;havoc #t~ret6; 734#recFINAL assume true; 732#recEXIT >#29#return; 731#L17-1 #res := #t~ret6;havoc #t~ret6; 730#recFINAL assume true; 728#recEXIT >#31#return; 725#L26-1 call write~int(main_#t~mem13 + main_#t~ret12, main_~ip~0.base, main_~ip~0.offset, 4);havoc main_#t~mem13;havoc main_#t~ret12; 726#L23-3 call main_#t~mem9 := read~int(main_~ip~0.base, main_~ip~0.offset, 4); 715#L23-1 assume !!(main_#t~mem9 > 1);havoc main_#t~mem9;call main_#t~malloc10.base, main_#t~malloc10.offset := #Ultimate.allocOnHeap(4);main_~op~0.base, main_~op~0.offset := main_#t~malloc10.base, main_#t~malloc10.offset;call main_#t~mem11 := read~int(main_~ip~0.base, main_~ip~0.offset, 4);call write~int(main_#t~mem11, main_~op~0.base, main_~op~0.offset, 4);havoc main_#t~mem11;call main_#t~mem13 := read~int(main_~ip~0.base, main_~ip~0.offset, 4); 706#L26 call main_#t~ret12 := rec(main_~op~0.base, main_~op~0.offset, main_~ip~0.base, main_~ip~0.offset);< 712#recENTRY [2019-11-16 00:27:22,061 INFO L793 eck$LassoCheckResult]: Loop: 712#recENTRY ~p.base, ~p.offset := #in~p.base, #in~p.offset;~up.base, ~up.offset := #in~up.base, #in~up.offset;call #t~mem1 := read~int(~p.base, ~p.offset, 4); 704#L9 assume !(#t~mem1 < 0);havoc #t~mem1;call #t~malloc3.base, #t~malloc3.offset := #Ultimate.allocOnHeap(4);~upn~0.base, ~upn~0.offset := #t~malloc3.base, #t~malloc3.offset;call #t~mem4 := read~int(~p.base, ~p.offset, 4);#t~post5 := #t~mem4;call write~int(#t~post5 - 1, ~p.base, ~p.offset, 4);havoc #t~post5;havoc #t~mem4; 705#L17 call #t~ret6 := rec(~p.base, ~p.offset, ~upn~0.base, ~upn~0.offset);< 712#recENTRY [2019-11-16 00:27:22,061 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:27:22,061 INFO L82 PathProgramCache]: Analyzing trace with hash 770731142, now seen corresponding path program 2 times [2019-11-16 00:27:22,061 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:27:22,062 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1318292694] [2019-11-16 00:27:22,062 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:27:22,062 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:27:22,062 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:27:22,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:27:22,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:27:22,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:27:22,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:27:22,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:27:22,497 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 1 proven. 17 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-11-16 00:27:22,497 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1318292694] [2019-11-16 00:27:22,497 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1209826621] [2019-11-16 00:27:22,498 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_a8020c52-882f-4ae8-99bc-0ef823a6a81d/bin/uautomizer/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:27:22,616 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-16 00:27:22,616 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-16 00:27:22,619 INFO L256 TraceCheckSpWp]: Trace formula consists of 297 conjuncts, 67 conjunts are in the unsatisfiable core [2019-11-16 00:27:22,623 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:27:22,635 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-11-16 00:27:22,635 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:27:22,642 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:27:22,646 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-11-16 00:27:22,646 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-16 00:27:22,652 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:27:22,652 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:27:22,652 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:18, output treesize:5 [2019-11-16 00:27:22,673 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:27:22,673 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 15 [2019-11-16 00:27:22,674 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:27:22,687 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:27:22,693 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 15 [2019-11-16 00:27:22,694 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-16 00:27:22,706 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:27:22,706 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:27:22,707 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:33, output treesize:23 [2019-11-16 00:27:23,231 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 23 [2019-11-16 00:27:23,231 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:27:23,245 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:27:23,246 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-16 00:27:23,246 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:56, output treesize:41 [2019-11-16 00:27:23,332 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 33 [2019-11-16 00:27:23,333 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:27:23,349 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:27:23,351 INFO L496 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-16 00:27:23,351 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:54, output treesize:29 [2019-11-16 00:27:23,412 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 16 [2019-11-16 00:27:23,413 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-16 00:27:23,419 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:27:23,419 INFO L496 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-16 00:27:23,420 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:36, output treesize:14 [2019-11-16 00:27:23,437 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 4 proven. 17 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-11-16 00:27:23,437 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-16 00:27:23,437 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18] total 32 [2019-11-16 00:27:23,438 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1085137195] [2019-11-16 00:27:23,439 INFO L796 eck$LassoCheckResult]: stem already infeasible [2019-11-16 00:27:23,439 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:27:23,439 INFO L82 PathProgramCache]: Analyzing trace with hash 29943, now seen corresponding path program 2 times [2019-11-16 00:27:23,439 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:27:23,439 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1496601293] [2019-11-16 00:27:23,440 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:27:23,440 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:27:23,440 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:27:23,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:27:23,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:27:23,451 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-16 00:27:23,634 WARN L191 SmtUtils]: Spent 174.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 70 [2019-11-16 00:27:23,834 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:27:23,835 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2019-11-16 00:27:23,835 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=890, Unknown=0, NotChecked=0, Total=992 [2019-11-16 00:27:23,835 INFO L87 Difference]: Start difference. First operand 40 states and 48 transitions. cyclomatic complexity: 12 Second operand 32 states. [2019-11-16 00:27:24,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:27:24,329 INFO L93 Difference]: Finished difference Result 53 states and 67 transitions. [2019-11-16 00:27:24,330 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-11-16 00:27:24,331 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 53 states and 67 transitions. [2019-11-16 00:27:24,332 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-11-16 00:27:24,334 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 53 states to 46 states and 58 transitions. [2019-11-16 00:27:24,334 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 8 [2019-11-16 00:27:24,335 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 8 [2019-11-16 00:27:24,335 INFO L73 IsDeterministic]: Start isDeterministic. Operand 46 states and 58 transitions. [2019-11-16 00:27:24,335 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-16 00:27:24,335 INFO L688 BuchiCegarLoop]: Abstraction has 46 states and 58 transitions. [2019-11-16 00:27:24,335 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states and 58 transitions. [2019-11-16 00:27:24,339 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 43. [2019-11-16 00:27:24,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2019-11-16 00:27:24,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 52 transitions. [2019-11-16 00:27:24,341 INFO L711 BuchiCegarLoop]: Abstraction has 43 states and 52 transitions. [2019-11-16 00:27:24,341 INFO L591 BuchiCegarLoop]: Abstraction has 43 states and 52 transitions. [2019-11-16 00:27:24,341 INFO L424 BuchiCegarLoop]: ======== Iteration 7============ [2019-11-16 00:27:24,341 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 43 states and 52 transitions. [2019-11-16 00:27:24,342 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-11-16 00:27:24,343 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-16 00:27:24,343 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-16 00:27:24,344 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [5, 5, 4, 4, 4, 4, 2, 2, 2, 1, 1, 1, 1, 1] [2019-11-16 00:27:24,345 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-11-16 00:27:24,345 INFO L791 eck$LassoCheckResult]: Stem: 1004#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 995#L-1 havoc main_#res;havoc main_#t~malloc7.base, main_#t~malloc7.offset, main_#t~nondet8, main_#t~malloc10.base, main_#t~malloc10.offset, main_#t~mem11, main_#t~mem13, main_#t~ret12, main_~op~0.base, main_~op~0.offset, main_#t~mem9, main_~ip~0.base, main_~ip~0.offset;call main_#t~malloc7.base, main_#t~malloc7.offset := #Ultimate.allocOnHeap(4);main_~ip~0.base, main_~ip~0.offset := main_#t~malloc7.base, main_#t~malloc7.offset;call write~int(main_#t~nondet8, main_~ip~0.base, main_~ip~0.offset, 4);havoc main_#t~nondet8; 996#L23-3 call main_#t~mem9 := read~int(main_~ip~0.base, main_~ip~0.offset, 4); 1006#L23-1 assume !!(main_#t~mem9 > 1);havoc main_#t~mem9;call main_#t~malloc10.base, main_#t~malloc10.offset := #Ultimate.allocOnHeap(4);main_~op~0.base, main_~op~0.offset := main_#t~malloc10.base, main_#t~malloc10.offset;call main_#t~mem11 := read~int(main_~ip~0.base, main_~ip~0.offset, 4);call write~int(main_#t~mem11, main_~op~0.base, main_~op~0.offset, 4);havoc main_#t~mem11;call main_#t~mem13 := read~int(main_~ip~0.base, main_~ip~0.offset, 4); 998#L26 call main_#t~ret12 := rec(main_~op~0.base, main_~op~0.offset, main_~ip~0.base, main_~ip~0.offset);< 999#recENTRY ~p.base, ~p.offset := #in~p.base, #in~p.offset;~up.base, ~up.offset := #in~up.base, #in~up.offset;call #t~mem1 := read~int(~p.base, ~p.offset, 4); 1021#L9 assume !(#t~mem1 < 0);havoc #t~mem1;call #t~malloc3.base, #t~malloc3.offset := #Ultimate.allocOnHeap(4);~upn~0.base, ~upn~0.offset := #t~malloc3.base, #t~malloc3.offset;call #t~mem4 := read~int(~p.base, ~p.offset, 4);#t~post5 := #t~mem4;call write~int(#t~post5 - 1, ~p.base, ~p.offset, 4);havoc #t~post5;havoc #t~mem4; 992#L17 call #t~ret6 := rec(~p.base, ~p.offset, ~upn~0.base, ~upn~0.offset);< 1025#recENTRY ~p.base, ~p.offset := #in~p.base, #in~p.offset;~up.base, ~up.offset := #in~up.base, #in~up.offset;call #t~mem1 := read~int(~p.base, ~p.offset, 4); 1023#L9 assume !(#t~mem1 < 0);havoc #t~mem1;call #t~malloc3.base, #t~malloc3.offset := #Ultimate.allocOnHeap(4);~upn~0.base, ~upn~0.offset := #t~malloc3.base, #t~malloc3.offset;call #t~mem4 := read~int(~p.base, ~p.offset, 4);#t~post5 := #t~mem4;call write~int(#t~post5 - 1, ~p.base, ~p.offset, 4);havoc #t~post5;havoc #t~mem4; 993#L17 call #t~ret6 := rec(~p.base, ~p.offset, ~upn~0.base, ~upn~0.offset);< 1025#recENTRY ~p.base, ~p.offset := #in~p.base, #in~p.offset;~up.base, ~up.offset := #in~up.base, #in~up.offset;call #t~mem1 := read~int(~p.base, ~p.offset, 4); 1023#L9 assume !(#t~mem1 < 0);havoc #t~mem1;call #t~malloc3.base, #t~malloc3.offset := #Ultimate.allocOnHeap(4);~upn~0.base, ~upn~0.offset := #t~malloc3.base, #t~malloc3.offset;call #t~mem4 := read~int(~p.base, ~p.offset, 4);#t~post5 := #t~mem4;call write~int(#t~post5 - 1, ~p.base, ~p.offset, 4);havoc #t~post5;havoc #t~mem4; 993#L17 call #t~ret6 := rec(~p.base, ~p.offset, ~upn~0.base, ~upn~0.offset);< 1025#recENTRY ~p.base, ~p.offset := #in~p.base, #in~p.offset;~up.base, ~up.offset := #in~up.base, #in~up.offset;call #t~mem1 := read~int(~p.base, ~p.offset, 4); 1023#L9 assume !(#t~mem1 < 0);havoc #t~mem1;call #t~malloc3.base, #t~malloc3.offset := #Ultimate.allocOnHeap(4);~upn~0.base, ~upn~0.offset := #t~malloc3.base, #t~malloc3.offset;call #t~mem4 := read~int(~p.base, ~p.offset, 4);#t~post5 := #t~mem4;call write~int(#t~post5 - 1, ~p.base, ~p.offset, 4);havoc #t~post5;havoc #t~mem4; 993#L17 call #t~ret6 := rec(~p.base, ~p.offset, ~upn~0.base, ~upn~0.offset);< 1025#recENTRY ~p.base, ~p.offset := #in~p.base, #in~p.offset;~up.base, ~up.offset := #in~up.base, #in~up.offset;call #t~mem1 := read~int(~p.base, ~p.offset, 4); 991#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);call ULTIMATE.dealloc(~up.base, ~up.offset);#res := ~pv~0; 994#recFINAL assume true; 1009#recEXIT >#29#return; 1010#L17-1 #res := #t~ret6;havoc #t~ret6; 1011#recFINAL assume true; 1007#recEXIT >#29#return; 1008#L17-1 #res := #t~ret6;havoc #t~ret6; 1026#recFINAL assume true; 1024#recEXIT >#29#return; 1020#L17-1 #res := #t~ret6;havoc #t~ret6; 1022#recFINAL assume true; 1019#recEXIT >#29#return; 1018#L17-1 #res := #t~ret6;havoc #t~ret6; 1017#recFINAL assume true; 1015#recEXIT >#31#return; 1012#L26-1 call write~int(main_#t~mem13 + main_#t~ret12, main_~ip~0.base, main_~ip~0.offset, 4);havoc main_#t~mem13;havoc main_#t~ret12; 1013#L23-3 call main_#t~mem9 := read~int(main_~ip~0.base, main_~ip~0.offset, 4); 1005#L23-1 assume !!(main_#t~mem9 > 1);havoc main_#t~mem9;call main_#t~malloc10.base, main_#t~malloc10.offset := #Ultimate.allocOnHeap(4);main_~op~0.base, main_~op~0.offset := main_#t~malloc10.base, main_#t~malloc10.offset;call main_#t~mem11 := read~int(main_~ip~0.base, main_~ip~0.offset, 4);call write~int(main_#t~mem11, main_~op~0.base, main_~op~0.offset, 4);havoc main_#t~mem11;call main_#t~mem13 := read~int(main_~ip~0.base, main_~ip~0.offset, 4); 990#L26 call main_#t~ret12 := rec(main_~op~0.base, main_~op~0.offset, main_~ip~0.base, main_~ip~0.offset);< 997#recENTRY [2019-11-16 00:27:24,345 INFO L793 eck$LassoCheckResult]: Loop: 997#recENTRY ~p.base, ~p.offset := #in~p.base, #in~p.offset;~up.base, ~up.offset := #in~up.base, #in~up.offset;call #t~mem1 := read~int(~p.base, ~p.offset, 4); 988#L9 assume !(#t~mem1 < 0);havoc #t~mem1;call #t~malloc3.base, #t~malloc3.offset := #Ultimate.allocOnHeap(4);~upn~0.base, ~upn~0.offset := #t~malloc3.base, #t~malloc3.offset;call #t~mem4 := read~int(~p.base, ~p.offset, 4);#t~post5 := #t~mem4;call write~int(#t~post5 - 1, ~p.base, ~p.offset, 4);havoc #t~post5;havoc #t~mem4; 989#L17 call #t~ret6 := rec(~p.base, ~p.offset, ~upn~0.base, ~upn~0.offset);< 997#recENTRY [2019-11-16 00:27:24,346 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:27:24,346 INFO L82 PathProgramCache]: Analyzing trace with hash 1655830132, now seen corresponding path program 3 times [2019-11-16 00:27:24,346 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:27:24,346 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [479043075] [2019-11-16 00:27:24,346 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:27:24,347 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:27:24,347 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:27:24,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:27:24,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:27:24,424 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-16 00:27:24,424 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:27:24,424 INFO L82 PathProgramCache]: Analyzing trace with hash 29943, now seen corresponding path program 3 times [2019-11-16 00:27:24,425 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:27:24,425 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1008124875] [2019-11-16 00:27:24,425 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:27:24,425 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:27:24,425 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:27:24,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:27:24,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:27:24,434 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-16 00:27:24,435 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:27:24,435 INFO L82 PathProgramCache]: Analyzing trace with hash 1136068004, now seen corresponding path program 4 times [2019-11-16 00:27:24,435 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:27:24,435 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1687886853] [2019-11-16 00:27:24,435 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:27:24,436 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:27:24,436 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:27:24,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:27:24,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:27:24,526 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-16 00:27:24,688 WARN L191 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 70 [2019-11-16 00:27:25,348 WARN L191 SmtUtils]: Spent 295.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 97 [2019-11-16 00:27:25,592 WARN L191 SmtUtils]: Spent 154.00 ms on a formula simplification that was a NOOP. DAG size: 82 [2019-11-16 00:27:25,741 WARN L191 SmtUtils]: Spent 147.00 ms on a formula simplification that was a NOOP. DAG size: 76 [2019-11-16 00:27:26,235 WARN L191 SmtUtils]: Spent 490.00 ms on a formula simplification. DAG size of input: 125 DAG size of output: 113 [2019-11-16 00:27:26,950 WARN L191 SmtUtils]: Spent 456.00 ms on a formula simplification. DAG size of input: 134 DAG size of output: 122 [2019-11-16 00:27:27,181 WARN L191 SmtUtils]: Spent 134.00 ms on a formula simplification that was a NOOP. DAG size: 99 [2019-11-16 00:27:27,347 WARN L191 SmtUtils]: Spent 164.00 ms on a formula simplification that was a NOOP. DAG size: 93 [2019-11-16 00:27:27,956 WARN L191 SmtUtils]: Spent 605.00 ms on a formula simplification. DAG size of input: 143 DAG size of output: 131 [2019-11-16 00:27:28,077 WARN L191 SmtUtils]: Spent 117.00 ms on a formula simplification that was a NOOP. DAG size: 85 [2019-11-16 00:27:28,240 WARN L191 SmtUtils]: Spent 161.00 ms on a formula simplification that was a NOOP. DAG size: 107 [2019-11-16 00:27:28,434 WARN L191 SmtUtils]: Spent 191.00 ms on a formula simplification that was a NOOP. DAG size: 101 [2019-11-16 00:27:30,394 WARN L191 SmtUtils]: Spent 1.96 s on a formula simplification. DAG size of input: 242 DAG size of output: 209 [2019-11-16 00:27:30,918 WARN L191 SmtUtils]: Spent 517.00 ms on a formula simplification that was a NOOP. DAG size: 137 [2019-11-16 00:27:31,463 WARN L191 SmtUtils]: Spent 532.00 ms on a formula simplification that was a NOOP. DAG size: 143 [2019-11-16 00:27:31,865 WARN L191 SmtUtils]: Spent 397.00 ms on a formula simplification that was a NOOP. DAG size: 117 [2019-11-16 00:27:31,869 INFO L210 LassoAnalysis]: Preferences: [2019-11-16 00:27:31,869 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-11-16 00:27:31,869 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-16 00:27:31,869 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-11-16 00:27:31,869 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-11-16 00:27:31,870 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-16 00:27:31,870 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-16 00:27:31,870 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-11-16 00:27:31,870 INFO L131 ssoRankerPreferences]: Filename of dumped script: rec_malloc_ex2.i_Iteration7_Lasso [2019-11-16 00:27:31,870 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-16 00:27:31,870 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-16 00:27:31,874 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-16 00:27:31,882 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-16 00:27:31,890 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-16 00:27:31,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-16 00:27:31,894 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-16 00:27:31,897 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:27:31,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-16 00:27:31,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-16 00:27:31,903 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-16 00:27:31,905 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-16 00:27:31,907 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:27:31,908 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-16 00:27:31,911 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-16 00:27:31,913 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-16 00:27:31,914 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:27:31,917 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-16 00:27:31,919 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-16 00:27:31,920 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-16 00:27:31,922 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:27:31,924 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-16 00:27:31,927 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-16 00:27:31,932 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-16 00:27:31,934 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-16 00:27:31,935 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-16 00:27:31,937 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-16 00:27:31,939 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-16 00:27:31,941 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-16 00:27:31,942 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-16 00:27:31,944 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-16 00:27:31,946 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-16 00:27:31,947 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-16 00:27:31,949 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-16 00:27:31,951 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-16 00:27:31,952 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-16 00:27:32,271 WARN L191 SmtUtils]: Spent 220.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 79 [2019-11-16 00:27:32,425 WARN L191 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 65 [2019-11-16 00:27:32,425 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-16 00:27:32,651 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 7 [2019-11-16 00:27:40,729 WARN L191 SmtUtils]: Spent 7.99 s on a formula simplification. DAG size of input: 173 DAG size of output: 173 [2019-11-16 00:27:40,874 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-16 00:27:40,874 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-11-16 00:27:40,874 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-16 00:27:40,875 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:27:40,875 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:27:40,876 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:27:40,876 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:27:40,876 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:27:40,876 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:27:40,876 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:27:40,877 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:27:40,877 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-16 00:27:40,878 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:27:40,878 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:27:40,878 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:27:40,878 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:27:40,879 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:27:40,879 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:27:40,879 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:27:40,879 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:27:40,880 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-16 00:27:40,880 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:27:40,881 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:27:40,881 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:27:40,881 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:27:40,881 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:27:40,881 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:27:40,881 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:27:40,882 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:27:40,882 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-16 00:27:40,883 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:27:40,883 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:27:40,883 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:27:40,883 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:27:40,883 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:27:40,884 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:27:40,884 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:27:40,884 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:27:40,885 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-16 00:27:40,885 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:27:40,886 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:27:40,886 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:27:40,886 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:27:40,886 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-16 00:27:40,887 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-16 00:27:40,888 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:27:40,888 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-16 00:27:40,889 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:27:40,889 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:27:40,889 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:27:40,890 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:27:40,890 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:27:40,890 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:27:40,890 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:27:40,891 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:27:40,891 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-16 00:27:40,892 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:27:40,892 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:27:40,892 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:27:40,892 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:27:40,893 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:27:40,893 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:27:40,893 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:27:40,893 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:27:40,894 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-16 00:27:40,895 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:27:40,895 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:27:40,895 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:27:40,895 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:27:40,895 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:27:40,896 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:27:40,896 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:27:40,896 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:27:40,897 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-16 00:27:40,897 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:27:40,898 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:27:40,898 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:27:40,898 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:27:40,898 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:27:40,899 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:27:40,899 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:27:40,899 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:27:40,900 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-16 00:27:40,900 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:27:40,901 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:27:40,901 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:27:40,901 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:27:40,901 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:27:40,901 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:27:40,902 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:27:40,902 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:27:40,903 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-16 00:27:40,903 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:27:40,903 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:27:40,904 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:27:40,904 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:27:40,904 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:27:40,904 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:27:40,905 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:27:40,905 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:27:40,905 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-16 00:27:40,906 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:27:40,906 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:27:40,906 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:27:40,907 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:27:40,907 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-16 00:27:40,907 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-16 00:27:40,909 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:27:40,909 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-16 00:27:40,910 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:27:40,910 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:27:40,910 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:27:40,910 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:27:40,911 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:27:40,911 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:27:40,911 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:27:40,912 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:27:40,912 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-16 00:27:40,913 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:27:40,913 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:27:40,913 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:27:40,913 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:27:40,913 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:27:40,914 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:27:40,914 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:27:40,914 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:27:40,915 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-16 00:27:40,915 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:27:40,916 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:27:40,916 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:27:40,916 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:27:40,916 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:27:40,916 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:27:40,917 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:27:40,917 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:27:40,918 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-16 00:27:40,918 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:27:40,918 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:27:40,919 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:27:40,919 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:27:40,919 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:27:40,919 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:27:40,919 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:27:40,920 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:27:40,920 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-16 00:27:40,921 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:27:40,921 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:27:40,921 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:27:40,922 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:27:40,922 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:27:40,922 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:27:40,922 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:27:40,923 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:27:40,923 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-16 00:27:40,924 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:27:40,924 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:27:40,924 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:27:40,924 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:27:40,925 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:27:40,925 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:27:40,925 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:27:40,926 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:27:40,926 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-16 00:27:40,927 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:27:40,927 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:27:40,927 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:27:40,927 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:27:40,928 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:27:40,928 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:27:40,928 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:27:40,929 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:27:40,929 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-16 00:27:40,930 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:27:40,930 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:27:40,930 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:27:40,930 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:27:40,931 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:27:40,931 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:27:40,931 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:27:40,932 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:27:40,932 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-16 00:27:40,933 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:27:40,933 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:27:40,933 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:27:40,933 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:27:40,933 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:27:40,934 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:27:40,934 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:27:40,934 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:27:40,935 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-16 00:27:40,935 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:27:40,936 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:27:40,936 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:27:40,936 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:27:40,936 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:27:40,937 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:27:40,937 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:27:40,937 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:27:40,938 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-16 00:27:40,938 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:27:40,939 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:27:40,939 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:27:40,939 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:27:40,939 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:27:40,940 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:27:40,940 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:27:40,940 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:27:40,941 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-16 00:27:40,942 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:27:40,942 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:27:40,942 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:27:40,942 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:27:40,942 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:27:40,943 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:27:40,943 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:27:40,943 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:27:40,944 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-16 00:27:40,944 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:27:40,945 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:27:40,945 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:27:40,945 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:27:40,945 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:27:40,946 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:27:40,946 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:27:40,946 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:27:40,947 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-16 00:27:40,947 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:27:40,947 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:27:40,948 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:27:40,948 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:27:40,948 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:27:40,948 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:27:40,949 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:27:40,949 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:27:40,950 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-16 00:27:40,950 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:27:40,950 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:27:40,951 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:27:40,951 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:27:40,951 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:27:40,951 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:27:40,951 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:27:40,952 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:27:40,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-16 00:27:40,953 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:27:40,953 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:27:40,953 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:27:40,954 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:27:40,954 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:27:40,954 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:27:40,954 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:27:40,955 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:27:40,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-16 00:27:40,956 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:27:40,956 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:27:40,956 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:27:40,956 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:27:40,957 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:27:40,957 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:27:40,957 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:27:40,958 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:27:40,958 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-16 00:27:40,959 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:27:40,959 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:27:40,959 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:27:40,959 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:27:40,960 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:27:40,960 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:27:40,960 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:27:40,961 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:27:40,961 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-16 00:27:40,962 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:27:40,962 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:27:40,962 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:27:40,962 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:27:40,962 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:27:40,963 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:27:40,963 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:27:40,963 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:27:40,964 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-16 00:27:40,964 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:27:40,965 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:27:40,965 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:27:40,965 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:27:40,965 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:27:40,966 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:27:40,966 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:27:40,966 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:27:40,967 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-16 00:27:40,967 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:27:40,968 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:27:40,968 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:27:40,968 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:27:40,968 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:27:40,968 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:27:40,969 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:27:40,969 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:27:40,970 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-16 00:27:40,970 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:27:40,971 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:27:40,971 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:27:40,971 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:27:40,972 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-16 00:27:40,972 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-16 00:27:40,974 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:27:40,975 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-16 00:27:40,975 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:27:40,976 INFO L202 nArgumentSynthesizer]: 128 stem disjuncts [2019-11-16 00:27:40,976 INFO L203 nArgumentSynthesizer]: 2 loop disjuncts [2019-11-16 00:27:40,976 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:27:41,033 INFO L400 nArgumentSynthesizer]: We have 524 Motzkin's Theorem applications. [2019-11-16 00:27:41,033 INFO L401 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2019-11-16 00:27:41,487 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:27:41,487 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:27:41,489 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:27:41,489 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:27:41,489 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:27:41,490 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:27:41,490 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-16 00:27:41,491 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-16 00:27:41,494 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:27:41,494 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-16 00:27:41,495 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:27:41,495 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:27:41,495 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:27:41,495 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:27:41,503 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-16 00:27:41,503 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-16 00:27:41,527 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-16 00:27:41,550 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2019-11-16 00:27:41,550 INFO L444 ModelExtractionUtils]: 17 out of 22 variables were initially zero. Simplification set additionally 2 variables to zero. [2019-11-16 00:27:41,551 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-16 00:27:41,552 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-11-16 00:27:41,552 INFO L510 LassoAnalysis]: Proved termination. [2019-11-16 00:27:41,552 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int rec_#in~p.base) 0)_1) = 2*v_rep(select (select #memory_int rec_#in~p.base) 0)_1 + 1 Supporting invariants [] [2019-11-16 00:27:41,585 INFO L297 tatePredicateManager]: 4 out of 5 supporting invariants were superfluous and have been removed [2019-11-16 00:27:41,587 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-11-16 00:27:41,644 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:27:41,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:27:41,741 INFO L256 TraceCheckSpWp]: Trace formula consists of 528 conjuncts, 20 conjunts are in the unsatisfiable core [2019-11-16 00:27:41,753 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:27:41,785 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:41,795 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:41,798 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:41,800 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:41,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:27:41,841 INFO L256 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 19 conjunts are in the unsatisfiable core [2019-11-16 00:27:41,842 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:27:41,883 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:27:41,883 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 32 [2019-11-16 00:27:41,884 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:27:41,905 INFO L567 ElimStorePlain]: treesize reduction 11, result has 68.6 percent of original size [2019-11-16 00:27:41,905 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:27:41,905 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:39, output treesize:24 [2019-11-16 00:27:41,932 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-16 00:27:41,932 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.3 stem predicates 3 loop predicates [2019-11-16 00:27:41,932 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 43 states and 52 transitions. cyclomatic complexity: 13 Second operand 6 states. [2019-11-16 00:27:42,114 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 43 states and 52 transitions. cyclomatic complexity: 13. Second operand 6 states. Result 50 states and 59 transitions. Complement of second has 15 states. [2019-11-16 00:27:42,115 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-16 00:27:42,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2019-11-16 00:27:42,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 10 transitions. [2019-11-16 00:27:42,116 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 10 transitions. Stem has 37 letters. Loop has 3 letters. [2019-11-16 00:27:42,116 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-16 00:27:42,116 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-11-16 00:27:42,153 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:27:42,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:27:42,250 INFO L256 TraceCheckSpWp]: Trace formula consists of 528 conjuncts, 20 conjunts are in the unsatisfiable core [2019-11-16 00:27:42,255 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:27:42,281 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:42,282 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:42,284 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:42,285 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:42,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:27:42,317 INFO L256 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 19 conjunts are in the unsatisfiable core [2019-11-16 00:27:42,318 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:27:42,352 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:27:42,352 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 32 [2019-11-16 00:27:42,353 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:27:42,371 INFO L567 ElimStorePlain]: treesize reduction 11, result has 68.6 percent of original size [2019-11-16 00:27:42,371 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:27:42,371 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:39, output treesize:24 [2019-11-16 00:27:42,396 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-16 00:27:42,396 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.3 stem predicates 3 loop predicates [2019-11-16 00:27:42,397 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 43 states and 52 transitions. cyclomatic complexity: 13 Second operand 6 states. [2019-11-16 00:27:42,548 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 43 states and 52 transitions. cyclomatic complexity: 13. Second operand 6 states. Result 50 states and 59 transitions. Complement of second has 15 states. [2019-11-16 00:27:42,550 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-16 00:27:42,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2019-11-16 00:27:42,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 10 transitions. [2019-11-16 00:27:42,551 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 10 transitions. Stem has 37 letters. Loop has 3 letters. [2019-11-16 00:27:42,551 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-16 00:27:42,552 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-11-16 00:27:42,598 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:27:42,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:27:42,697 INFO L256 TraceCheckSpWp]: Trace formula consists of 528 conjuncts, 20 conjunts are in the unsatisfiable core [2019-11-16 00:27:42,699 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:27:42,723 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:42,724 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:42,726 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:42,728 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:42,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:27:42,764 INFO L256 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 19 conjunts are in the unsatisfiable core [2019-11-16 00:27:42,764 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:27:42,799 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:27:42,800 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 32 [2019-11-16 00:27:42,800 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:27:42,816 INFO L567 ElimStorePlain]: treesize reduction 11, result has 68.6 percent of original size [2019-11-16 00:27:42,817 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:27:42,817 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:39, output treesize:24 [2019-11-16 00:27:42,850 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-16 00:27:42,850 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.3 stem predicates 3 loop predicates [2019-11-16 00:27:42,850 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 43 states and 52 transitions. cyclomatic complexity: 13 Second operand 6 states. [2019-11-16 00:27:43,010 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 43 states and 52 transitions. cyclomatic complexity: 13. Second operand 6 states. Result 63 states and 72 transitions. Complement of second has 16 states. [2019-11-16 00:27:43,015 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 7 states 3 stem states 3 non-accepting loop states 1 accepting loop states [2019-11-16 00:27:43,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2019-11-16 00:27:43,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 22 transitions. [2019-11-16 00:27:43,015 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 22 transitions. Stem has 37 letters. Loop has 3 letters. [2019-11-16 00:27:43,016 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-16 00:27:43,016 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 22 transitions. Stem has 40 letters. Loop has 3 letters. [2019-11-16 00:27:43,017 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-16 00:27:43,017 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 22 transitions. Stem has 37 letters. Loop has 6 letters. [2019-11-16 00:27:43,017 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-16 00:27:43,017 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 63 states and 72 transitions. [2019-11-16 00:27:43,019 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-11-16 00:27:43,019 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 63 states to 0 states and 0 transitions. [2019-11-16 00:27:43,019 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2019-11-16 00:27:43,019 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2019-11-16 00:27:43,019 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2019-11-16 00:27:43,020 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-16 00:27:43,020 INFO L688 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-16 00:27:43,020 INFO L711 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-16 00:27:43,020 INFO L591 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-16 00:27:43,020 INFO L424 BuchiCegarLoop]: ======== Iteration 8============ [2019-11-16 00:27:43,020 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2019-11-16 00:27:43,020 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-11-16 00:27:43,020 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2019-11-16 00:27:43,026 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 16.11 12:27:43 BoogieIcfgContainer [2019-11-16 00:27:43,026 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2019-11-16 00:27:43,027 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-16 00:27:43,027 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-16 00:27:43,027 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-16 00:27:43,028 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 12:27:08" (3/4) ... [2019-11-16 00:27:43,030 INFO L140 WitnessPrinter]: No result that supports witness generation found [2019-11-16 00:27:43,031 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-16 00:27:43,032 INFO L168 Benchmark]: Toolchain (without parser) took 35296.85 ms. Allocated memory was 1.0 GB in the beginning and 2.0 GB in the end (delta: 976.7 MB). Free memory was 943.4 MB in the beginning and 1.4 GB in the end (delta: -442.1 MB). Peak memory consumption was 534.6 MB. Max. memory is 11.5 GB. [2019-11-16 00:27:43,032 INFO L168 Benchmark]: CDTParser took 0.21 ms. Allocated memory is still 1.0 GB. Free memory is still 967.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-16 00:27:43,033 INFO L168 Benchmark]: CACSL2BoogieTranslator took 256.75 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 118.0 MB). Free memory was 943.4 MB in the beginning and 1.1 GB in the end (delta: -168.5 MB). Peak memory consumption was 23.2 MB. Max. memory is 11.5 GB. [2019-11-16 00:27:43,033 INFO L168 Benchmark]: Boogie Procedure Inliner took 30.35 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: 3.5 MB). Peak memory consumption was 3.5 MB. Max. memory is 11.5 GB. [2019-11-16 00:27:43,033 INFO L168 Benchmark]: Boogie Preprocessor took 21.77 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-16 00:27:43,034 INFO L168 Benchmark]: RCFGBuilder took 342.67 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: 24.3 MB). Peak memory consumption was 24.3 MB. Max. memory is 11.5 GB. [2019-11-16 00:27:43,035 INFO L168 Benchmark]: BuchiAutomizer took 34637.69 ms. Allocated memory was 1.1 GB in the beginning and 2.0 GB in the end (delta: 858.8 MB). Free memory was 1.1 GB in the beginning and 1.4 GB in the end (delta: -301.4 MB). Peak memory consumption was 557.4 MB. Max. memory is 11.5 GB. [2019-11-16 00:27:43,035 INFO L168 Benchmark]: Witness Printer took 3.99 ms. Allocated memory is still 2.0 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-16 00:27:43,037 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.21 ms. Allocated memory is still 1.0 GB. Free memory is still 967.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 256.75 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 118.0 MB). Free memory was 943.4 MB in the beginning and 1.1 GB in the end (delta: -168.5 MB). Peak memory consumption was 23.2 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 30.35 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: 3.5 MB). Peak memory consumption was 3.5 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 21.77 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 342.67 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: 24.3 MB). Peak memory consumption was 24.3 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 34637.69 ms. Allocated memory was 1.1 GB in the beginning and 2.0 GB in the end (delta: 858.8 MB). Free memory was 1.1 GB in the beginning and 1.4 GB in the end (delta: -301.4 MB). Peak memory consumption was 557.4 MB. Max. memory is 11.5 GB. * Witness Printer took 3.99 ms. Allocated memory is still 2.0 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 7 terminating modules (4 trivial, 2 deterministic, 1 nondeterministic). One deterministic module has affine ranking function unknown-#memory_int-unknown[ip][ip] 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 nondeterministic module has affine ranking function 2 * unknown-#memory_int-unknown[p][0] + 1 and consists of 7 locations. 4 modules have a trivial ranking function, the largest among these consists of 32 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 34.5s and 8 iterations. TraceHistogramMax:5. Analysis of lassos took 30.9s. Construction of modules took 0.8s. Büchi inclusion checks took 2.5s. Highest rank in rank-based complementation 3. Minimization of det autom 4. Minimization of nondet autom 3. Automata minimization 0.0s AutomataMinimizationTime, 6 MinimizatonAttempts, 9 StatesRemovedByMinimization, 2 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 43 states and ocurred in iteration 6. Nontrivial modules had stage [2, 0, 1, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 30/30 HoareTripleCheckerStatistics: 84 SDtfs, 58 SDslu, 256 SDs, 0 SdLazy, 624 SolverSat, 75 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.8s Time LassoAnalysisResults: nont0 unkn0 SFLI3 SFLT0 conc0 concLT0 SILN0 SILU1 SILI0 SILT0 lasso3 LassoPreprocessingBenchmarks: Lassos: inital361 mio100 ax100 hnf100 lsp97 ukn53 mio100 lsp29 div100 bol100 ite100 ukn100 eq181 hnf91 smp100 dnf2287 smp86 tf100 neg86 sie150 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 2722ms VariablesStem: 3 VariablesLoop: 8 DisjunctsStem: 2 DisjunctsLoop: 16 SupportingInvariants: 32 MotzkinApplications: 608 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...