./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/termination-recursive-malloc/rec_malloc_ex11B.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version cad46833 Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_9aff9549-f91d-4707-9a6d-4238dd8b2e02/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_9aff9549-f91d-4707-9a6d-4238dd8b2e02/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_9aff9549-f91d-4707-9a6d-4238dd8b2e02/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_9aff9549-f91d-4707-9a6d-4238dd8b2e02/bin/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/termination-recursive-malloc/rec_malloc_ex11B.i -s /tmp/vcloud-vcloud-master/worker/working_dir_9aff9549-f91d-4707-9a6d-4238dd8b2e02/bin/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_9aff9549-f91d-4707-9a6d-4238dd8b2e02/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 18b42b65120149c30866fbc5b5479df029781f63 ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-cad4683 [2019-10-22 08:57:50,464 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-22 08:57:50,466 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-22 08:57:50,474 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-22 08:57:50,475 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-22 08:57:50,475 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-22 08:57:50,476 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-22 08:57:50,478 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-22 08:57:50,479 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-22 08:57:50,480 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-22 08:57:50,480 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-22 08:57:50,481 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-22 08:57:50,481 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-22 08:57:50,482 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-22 08:57:50,483 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-22 08:57:50,484 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-22 08:57:50,484 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-22 08:57:50,485 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-22 08:57:50,486 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-22 08:57:50,488 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-22 08:57:50,489 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-22 08:57:50,490 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-22 08:57:50,491 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-22 08:57:50,491 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-22 08:57:50,493 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-22 08:57:50,493 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-22 08:57:50,494 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-22 08:57:50,494 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-22 08:57:50,495 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-22 08:57:50,495 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-22 08:57:50,496 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-22 08:57:50,496 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-22 08:57:50,497 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-22 08:57:50,498 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-22 08:57:50,498 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-22 08:57:50,499 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-22 08:57:50,499 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-22 08:57:50,499 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-22 08:57:50,499 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-22 08:57:50,500 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-22 08:57:50,501 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-22 08:57:50,501 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_9aff9549-f91d-4707-9a6d-4238dd8b2e02/bin/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf [2019-10-22 08:57:50,513 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-22 08:57:50,513 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-22 08:57:50,514 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-22 08:57:50,515 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-22 08:57:50,515 INFO L138 SettingsManager]: * Use SBE=true [2019-10-22 08:57:50,515 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-10-22 08:57:50,515 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-10-22 08:57:50,515 INFO L138 SettingsManager]: * Use old map elimination=false [2019-10-22 08:57:50,515 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2019-10-22 08:57:50,516 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2019-10-22 08:57:50,516 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-10-22 08:57:50,516 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-22 08:57:50,516 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-10-22 08:57:50,516 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-22 08:57:50,516 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-22 08:57:50,517 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-10-22 08:57:50,517 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-10-22 08:57:50,517 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-10-22 08:57:50,517 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-22 08:57:50,517 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-10-22 08:57:50,517 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-22 08:57:50,518 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-10-22 08:57:50,518 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-22 08:57:50,518 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-22 08:57:50,518 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-10-22 08:57:50,518 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-22 08:57:50,518 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-22 08:57:50,519 INFO L138 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-10-22 08:57:50,519 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-10-22 08:57:50,520 INFO L138 SettingsManager]: * TransformationType=MODULO_NEIGHBOR Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud-vcloud-master/worker/working_dir_9aff9549-f91d-4707-9a6d-4238dd8b2e02/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 -> 18b42b65120149c30866fbc5b5479df029781f63 [2019-10-22 08:57:50,556 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-22 08:57:50,570 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-22 08:57:50,572 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-22 08:57:50,573 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-22 08:57:50,573 INFO L275 PluginConnector]: CDTParser initialized [2019-10-22 08:57:50,574 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_9aff9549-f91d-4707-9a6d-4238dd8b2e02/bin/uautomizer/../../sv-benchmarks/c/termination-recursive-malloc/rec_malloc_ex11B.i [2019-10-22 08:57:50,619 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_9aff9549-f91d-4707-9a6d-4238dd8b2e02/bin/uautomizer/data/1293a7a9c/bfde86ed38354aabb965b526c5b0b437/FLAGb4c51032e [2019-10-22 08:57:50,955 INFO L306 CDTParser]: Found 1 translation units. [2019-10-22 08:57:50,956 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_9aff9549-f91d-4707-9a6d-4238dd8b2e02/sv-benchmarks/c/termination-recursive-malloc/rec_malloc_ex11B.i [2019-10-22 08:57:50,961 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_9aff9549-f91d-4707-9a6d-4238dd8b2e02/bin/uautomizer/data/1293a7a9c/bfde86ed38354aabb965b526c5b0b437/FLAGb4c51032e [2019-10-22 08:57:50,973 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_9aff9549-f91d-4707-9a6d-4238dd8b2e02/bin/uautomizer/data/1293a7a9c/bfde86ed38354aabb965b526c5b0b437 [2019-10-22 08:57:50,977 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-22 08:57:50,978 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-10-22 08:57:50,979 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-22 08:57:50,979 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-22 08:57:50,982 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-22 08:57:50,986 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.10 08:57:50" (1/1) ... [2019-10-22 08:57:50,989 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@339afd5b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:57:50, skipping insertion in model container [2019-10-22 08:57:50,989 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.10 08:57:50" (1/1) ... [2019-10-22 08:57:50,996 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-22 08:57:51,010 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-22 08:57:51,130 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-22 08:57:51,201 INFO L188 MainTranslator]: Completed pre-run [2019-10-22 08:57:51,213 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-22 08:57:51,225 INFO L192 MainTranslator]: Completed translation [2019-10-22 08:57:51,225 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:57:51 WrapperNode [2019-10-22 08:57:51,226 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-22 08:57:51,226 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-10-22 08:57:51,226 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-10-22 08:57:51,226 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-10-22 08:57:51,238 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:57:51" (1/1) ... [2019-10-22 08:57:51,245 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:57:51" (1/1) ... [2019-10-22 08:57:51,261 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-10-22 08:57:51,262 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-22 08:57:51,262 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-22 08:57:51,262 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-22 08:57:51,270 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:57:51" (1/1) ... [2019-10-22 08:57:51,270 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:57:51" (1/1) ... [2019-10-22 08:57:51,272 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:57:51" (1/1) ... [2019-10-22 08:57:51,272 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:57:51" (1/1) ... [2019-10-22 08:57:51,279 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:57:51" (1/1) ... [2019-10-22 08:57:51,289 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:57:51" (1/1) ... [2019-10-22 08:57:51,290 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:57:51" (1/1) ... [2019-10-22 08:57:51,291 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-22 08:57:51,292 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-22 08:57:51,292 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-22 08:57:51,292 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-22 08:57:51,293 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:57:51" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_9aff9549-f91d-4707-9a6d-4238dd8b2e02/bin/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 08:57:51,352 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-10-22 08:57:51,353 INFO L130 BoogieDeclarations]: Found specification of procedure rec [2019-10-22 08:57:51,353 INFO L138 BoogieDeclarations]: Found implementation of procedure rec [2019-10-22 08:57:51,353 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-10-22 08:57:51,353 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-22 08:57:51,353 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-22 08:57:51,353 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-10-22 08:57:51,353 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-10-22 08:57:51,614 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-22 08:57:51,614 INFO L284 CfgBuilder]: Removed 5 assume(true) statements. [2019-10-22 08:57:51,615 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 08:57:51 BoogieIcfgContainer [2019-10-22 08:57:51,615 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-22 08:57:51,616 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-10-22 08:57:51,616 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-10-22 08:57:51,627 INFO L275 PluginConnector]: BuchiAutomizer initialized [2019-10-22 08:57:51,628 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-10-22 08:57:51,628 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 22.10 08:57:50" (1/3) ... [2019-10-22 08:57:51,629 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@ec1b595 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 22.10 08:57:51, skipping insertion in model container [2019-10-22 08:57:51,629 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-10-22 08:57:51,629 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:57:51" (2/3) ... [2019-10-22 08:57:51,631 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@ec1b595 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 22.10 08:57:51, skipping insertion in model container [2019-10-22 08:57:51,631 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-10-22 08:57:51,631 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 08:57:51" (3/3) ... [2019-10-22 08:57:51,635 INFO L371 chiAutomizerObserver]: Analyzing ICFG rec_malloc_ex11B.i [2019-10-22 08:57:51,695 INFO L356 BuchiCegarLoop]: Interprodecural is true [2019-10-22 08:57:51,695 INFO L357 BuchiCegarLoop]: Hoare is false [2019-10-22 08:57:51,695 INFO L358 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-10-22 08:57:51,695 INFO L359 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-22 08:57:51,695 INFO L360 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-22 08:57:51,695 INFO L361 BuchiCegarLoop]: Difference is false [2019-10-22 08:57:51,696 INFO L362 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-22 08:57:51,696 INFO L365 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-10-22 08:57:51,713 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states. [2019-10-22 08:57:51,737 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 8 [2019-10-22 08:57:51,737 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 08:57:51,739 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 08:57:51,747 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2019-10-22 08:57:51,747 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 08:57:51,747 INFO L424 BuchiCegarLoop]: ======== Iteration 1============ [2019-10-22 08:57:51,747 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states. [2019-10-22 08:57:51,748 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 8 [2019-10-22 08:57:51,748 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 08:57:51,749 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 08:57:51,749 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2019-10-22 08:57:51,749 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 08:57:51,756 INFO L791 eck$LassoCheckResult]: Stem: 9#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 6#L-1true havoc main_#res;havoc main_#t~malloc6.base, main_#t~malloc6.offset, main_#t~nondet7, main_#t~malloc9.base, main_#t~malloc9.offset, main_#t~nondet10, main_#t~mem13, main_#t~ret11, main_#t~ite12, main_~pp~0.base, main_~pp~0.offset, main_#t~mem8, main_~qq~0.base, main_~qq~0.offset;call main_#t~malloc6.base, main_#t~malloc6.offset := #Ultimate.allocOnHeap(4);main_~qq~0.base, main_~qq~0.offset := main_#t~malloc6.base, main_#t~malloc6.offset;call write~int(main_#t~nondet7, main_~qq~0.base, main_~qq~0.offset, 4);havoc main_#t~nondet7; 19#L28-3true [2019-10-22 08:57:51,757 INFO L793 eck$LassoCheckResult]: Loop: 19#L28-3true call main_#t~mem8 := read~int(main_~qq~0.base, main_~qq~0.offset, 4); 4#L28-1true assume !!(main_#t~mem8 > 1);havoc main_#t~mem8;call main_#t~malloc9.base, main_#t~malloc9.offset := #Ultimate.allocOnHeap(4);main_~pp~0.base, main_~pp~0.offset := main_#t~malloc9.base, main_#t~malloc9.offset;call write~int(main_#t~nondet10, main_~pp~0.base, main_~pp~0.offset, 4);havoc main_#t~nondet10;call main_#t~mem13 := read~int(main_~qq~0.base, main_~qq~0.offset, 4); 12#L33true call main_#t~ret11 := rec(main_~pp~0.base, main_~pp~0.offset);< 3#recENTRYtrue ~op.base, ~op.offset := #in~op.base, #in~op.offset;call #t~mem1 := read~int(~op.base, ~op.offset, 4); 7#L9true assume #t~mem1 < 0;havoc #t~mem1;call #t~mem2 := read~int(~op.base, ~op.offset, 4);~r~0 := #t~mem2;havoc #t~mem2;call ULTIMATE.dealloc(~op.base, ~op.offset);#res := ~r~0; 15#recFINALtrue assume true; 13#recEXITtrue >#39#return; 10#L33-1true assume main_#t~ret11 <= -1;main_#t~ite12 := -1; 5#L33-3true call write~int(main_#t~mem13 + main_#t~ite12, main_~qq~0.base, main_~qq~0.offset, 4);havoc main_#t~ret11;havoc main_#t~mem13;havoc main_#t~ite12; 19#L28-3true [2019-10-22 08:57:51,763 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:57:51,763 INFO L82 PathProgramCache]: Analyzing trace with hash 1219, now seen corresponding path program 1 times [2019-10-22 08:57:51,771 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:57:51,771 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [507077524] [2019-10-22 08:57:51,771 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:57:51,771 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:57:51,772 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:57:51,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:57:51,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:57:51,896 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:57:51,897 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:57:51,898 INFO L82 PathProgramCache]: Analyzing trace with hash -1673639481, now seen corresponding path program 1 times [2019-10-22 08:57:51,898 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:57:51,898 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1278725874] [2019-10-22 08:57:51,898 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:57:51,898 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:57:51,899 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:57:51,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:57:51,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:57:51,974 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:57:51,976 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:57:51,976 INFO L82 PathProgramCache]: Analyzing trace with hash -508919995, now seen corresponding path program 1 times [2019-10-22 08:57:51,976 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:57:51,976 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [406193076] [2019-10-22 08:57:51,977 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:57:51,977 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:57:51,977 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:57:52,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:57:52,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:57:52,029 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:57:52,541 WARN L191 SmtUtils]: Spent 333.00 ms on a formula simplification. DAG size of input: 110 DAG size of output: 92 [2019-10-22 08:57:52,732 INFO L210 LassoAnalysis]: Preferences: [2019-10-22 08:57:52,732 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-10-22 08:57:52,733 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-10-22 08:57:52,733 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-10-22 08:57:52,733 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-10-22 08:57:52,734 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 08:57:52,734 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-10-22 08:57:52,735 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-10-22 08:57:52,735 INFO L131 ssoRankerPreferences]: Filename of dumped script: rec_malloc_ex11B.i_Iteration1_Lasso [2019-10-22 08:57:52,735 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-10-22 08:57:52,735 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-10-22 08:57:52,760 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:57:52,766 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:57:52,770 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:57:52,775 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:57:52,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-10-22 08:57:53,048 WARN L191 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 60 [2019-10-22 08:57:53,048 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:57:53,051 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:57:53,055 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:57:53,057 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:57:53,373 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-10-22 08:57:53,379 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-10-22 08:57:53,381 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:57:53,383 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:57:53,383 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:57:53,384 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:57:53,384 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:57:53,384 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:57:53,386 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:57:53,386 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:57:53,389 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:57:53,390 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:57:53,393 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:57:53,393 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:57:53,394 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:57:53,394 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:57:53,394 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:57:53,395 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:57:53,396 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:57:53,397 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:57:53,397 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:57:53,397 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:57:53,398 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:57:53,398 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:57:53,398 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:57:53,398 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:57:53,399 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:57:53,399 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:57:53,399 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:57:53,400 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:57:53,400 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:57:53,400 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:57:53,401 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:57:53,401 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:57:53,421 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:57:53,421 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:57:53,425 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:57:53,425 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:57:53,430 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:57:53,430 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:57:53,430 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:57:53,430 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:57:53,435 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:57:53,435 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:57:53,464 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:57:53,465 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:57:53,466 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:57:53,467 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:57:53,467 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:57:53,467 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:57:53,469 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:57:53,471 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:57:53,491 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-10-22 08:57:53,511 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-10-22 08:57:53,512 INFO L444 ModelExtractionUtils]: 4 out of 7 variables were initially zero. Simplification set additionally 1 variables to zero. [2019-10-22 08:57:53,514 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-10-22 08:57:53,516 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-10-22 08:57:53,516 INFO L510 LassoAnalysis]: Proved termination. [2019-10-22 08:57:53,517 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_main_~qq~0.base) ULTIMATE.start_main_~qq~0.offset)_1) = 1*v_rep(select (select #memory_int ULTIMATE.start_main_~qq~0.base) ULTIMATE.start_main_~qq~0.offset)_1 Supporting invariants [] [2019-10-22 08:57:53,536 INFO L297 tatePredicateManager]: 3 out of 3 supporting invariants were superfluous and have been removed [2019-10-22 08:57:53,542 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-10-22 08:57:53,557 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:57:53,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:57:53,574 INFO L256 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 2 conjunts are in the unsatisfiable core [2019-10-22 08:57:53,575 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:57:53,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:57:53,620 INFO L256 TraceCheckSpWp]: Trace formula consists of 103 conjuncts, 16 conjunts are in the unsatisfiable core [2019-10-22 08:57:53,622 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:57:53,677 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 08:57:53,678 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 15 [2019-10-22 08:57:53,679 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-22 08:57:53,687 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 08:57:53,690 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-22 08:57:53,693 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-10-22 08:57:53,694 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-22 08:57:53,699 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 08:57:53,699 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-22 08:57:53,699 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:40, output treesize:7 [2019-10-22 08:57:53,737 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:57:53,751 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 5 loop predicates [2019-10-22 08:57:53,752 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 17 states. Second operand 6 states. [2019-10-22 08:57:53,870 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 17 states.. Second operand 6 states. Result 65 states and 78 transitions. Complement of second has 18 states. [2019-10-22 08:57:53,870 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 9 states 1 stem states 6 non-accepting loop states 1 accepting loop states [2019-10-22 08:57:53,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2019-10-22 08:57:53,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 24 transitions. [2019-10-22 08:57:53,875 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 24 transitions. Stem has 2 letters. Loop has 9 letters. [2019-10-22 08:57:53,877 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 08:57:53,877 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 24 transitions. Stem has 11 letters. Loop has 9 letters. [2019-10-22 08:57:53,877 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 08:57:53,878 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 24 transitions. Stem has 2 letters. Loop has 18 letters. [2019-10-22 08:57:53,878 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 08:57:53,879 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 65 states and 78 transitions. [2019-10-22 08:57:53,887 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 11 [2019-10-22 08:57:53,893 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 65 states to 47 states and 58 transitions. [2019-10-22 08:57:53,894 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 29 [2019-10-22 08:57:53,894 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 30 [2019-10-22 08:57:53,895 INFO L73 IsDeterministic]: Start isDeterministic. Operand 47 states and 58 transitions. [2019-10-22 08:57:53,895 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-10-22 08:57:53,895 INFO L688 BuchiCegarLoop]: Abstraction has 47 states and 58 transitions. [2019-10-22 08:57:53,911 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states and 58 transitions. [2019-10-22 08:57:53,924 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 46. [2019-10-22 08:57:53,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2019-10-22 08:57:53,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 57 transitions. [2019-10-22 08:57:53,926 INFO L711 BuchiCegarLoop]: Abstraction has 46 states and 57 transitions. [2019-10-22 08:57:53,927 INFO L591 BuchiCegarLoop]: Abstraction has 46 states and 57 transitions. [2019-10-22 08:57:53,927 INFO L424 BuchiCegarLoop]: ======== Iteration 2============ [2019-10-22 08:57:53,927 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 46 states and 57 transitions. [2019-10-22 08:57:53,928 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 11 [2019-10-22 08:57:53,929 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 08:57:53,929 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 08:57:53,929 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 08:57:53,929 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-10-22 08:57:53,929 INFO L791 eck$LassoCheckResult]: Stem: 197#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 192#L-1 havoc main_#res;havoc main_#t~malloc6.base, main_#t~malloc6.offset, main_#t~nondet7, main_#t~malloc9.base, main_#t~malloc9.offset, main_#t~nondet10, main_#t~mem13, main_#t~ret11, main_#t~ite12, main_~pp~0.base, main_~pp~0.offset, main_#t~mem8, main_~qq~0.base, main_~qq~0.offset;call main_#t~malloc6.base, main_#t~malloc6.offset := #Ultimate.allocOnHeap(4);main_~qq~0.base, main_~qq~0.offset := main_#t~malloc6.base, main_#t~malloc6.offset;call write~int(main_#t~nondet7, main_~qq~0.base, main_~qq~0.offset, 4);havoc main_#t~nondet7; 193#L28-3 call main_#t~mem8 := read~int(main_~qq~0.base, main_~qq~0.offset, 4); 208#L28-1 assume !!(main_#t~mem8 > 1);havoc main_#t~mem8;call main_#t~malloc9.base, main_#t~malloc9.offset := #Ultimate.allocOnHeap(4);main_~pp~0.base, main_~pp~0.offset := main_#t~malloc9.base, main_#t~malloc9.offset;call write~int(main_#t~nondet10, main_~pp~0.base, main_~pp~0.offset, 4);havoc main_#t~nondet10;call main_#t~mem13 := read~int(main_~qq~0.base, main_~qq~0.offset, 4); 188#L33 call main_#t~ret11 := rec(main_~pp~0.base, main_~pp~0.offset);< 200#recENTRY ~op.base, ~op.offset := #in~op.base, #in~op.offset;call #t~mem1 := read~int(~op.base, ~op.offset, 4); 187#L9 assume !(#t~mem1 < 0);havoc #t~mem1;call #t~malloc3.base, #t~malloc3.offset := #Ultimate.allocOnHeap(4);~ip~0.base, ~ip~0.offset := #t~malloc3.base, #t~malloc3.offset;call #t~mem4 := read~int(~op.base, ~op.offset, 4);call write~int(#t~mem4 - 1, ~ip~0.base, ~ip~0.offset, 4);havoc #t~mem4;call ULTIMATE.dealloc(~op.base, ~op.offset); 175#L19 call #t~ret5 := rec(~ip~0.base, ~ip~0.offset);< 173#recENTRY [2019-10-22 08:57:53,930 INFO L793 eck$LassoCheckResult]: Loop: 173#recENTRY ~op.base, ~op.offset := #in~op.base, #in~op.offset;call #t~mem1 := read~int(~op.base, ~op.offset, 4); 176#L9 assume !(#t~mem1 < 0);havoc #t~mem1;call #t~malloc3.base, #t~malloc3.offset := #Ultimate.allocOnHeap(4);~ip~0.base, ~ip~0.offset := #t~malloc3.base, #t~malloc3.offset;call #t~mem4 := read~int(~op.base, ~op.offset, 4);call write~int(#t~mem4 - 1, ~ip~0.base, ~ip~0.offset, 4);havoc #t~mem4;call ULTIMATE.dealloc(~op.base, ~op.offset); 174#L19 call #t~ret5 := rec(~ip~0.base, ~ip~0.offset);< 173#recENTRY [2019-10-22 08:57:53,930 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:57:53,930 INFO L82 PathProgramCache]: Analyzing trace with hash -15731550, now seen corresponding path program 1 times [2019-10-22 08:57:53,930 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:57:53,930 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1575145626] [2019-10-22 08:57:53,930 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:57:53,931 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:57:53,931 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:57:53,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:57:53,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:57:54,005 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:57:54,006 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:57:54,008 INFO L82 PathProgramCache]: Analyzing trace with hash 29951, now seen corresponding path program 1 times [2019-10-22 08:57:54,008 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:57:54,009 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1073510280] [2019-10-22 08:57:54,009 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:57:54,009 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:57:54,009 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:57:54,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:57:54,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:57:54,029 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:57:54,036 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:57:54,036 INFO L82 PathProgramCache]: Analyzing trace with hash -507170626, now seen corresponding path program 2 times [2019-10-22 08:57:54,037 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:57:54,037 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1672506771] [2019-10-22 08:57:54,037 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:57:54,037 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:57:54,037 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:57:54,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:57:54,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:57:54,136 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:57:54,259 WARN L191 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 62 [2019-10-22 08:57:54,533 WARN L191 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 62 [2019-10-22 08:57:54,809 WARN L191 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 85 [2019-10-22 08:57:55,198 WARN L191 SmtUtils]: Spent 246.00 ms on a formula simplification. DAG size of input: 110 DAG size of output: 107 [2019-10-22 08:57:55,318 WARN L191 SmtUtils]: Spent 114.00 ms on a formula simplification that was a NOOP. DAG size: 74 [2019-10-22 08:57:55,320 INFO L210 LassoAnalysis]: Preferences: [2019-10-22 08:57:55,320 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-10-22 08:57:55,320 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-10-22 08:57:55,321 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-10-22 08:57:55,321 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-10-22 08:57:55,321 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 08:57:55,321 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-10-22 08:57:55,321 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-10-22 08:57:55,321 INFO L131 ssoRankerPreferences]: Filename of dumped script: rec_malloc_ex11B.i_Iteration2_Lasso [2019-10-22 08:57:55,321 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-10-22 08:57:55,321 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-10-22 08:57:55,325 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:57:55,333 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:57:55,334 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:57:55,336 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:57:55,337 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:57:55,339 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:57:55,344 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:57:55,498 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:57:55,499 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:57:55,501 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:57:55,503 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:57:55,504 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:57:55,506 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:57:55,507 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:57:55,508 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:57:55,509 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:57:55,510 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:57:55,511 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:57:55,513 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:57:55,514 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:57:55,516 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:57:55,517 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:57:55,519 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:57:55,520 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:57:55,521 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:57:55,522 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:57:55,524 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:57:55,525 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:57:55,526 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:57:55,527 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:57:55,528 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:57:55,530 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:57:55,531 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:57:55,819 WARN L191 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 29 DAG size of output: 29 [2019-10-22 08:57:55,868 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-10-22 08:57:55,868 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-10-22 08:57:55,868 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:57:55,869 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:57:55,869 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:57:55,869 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:57:55,870 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:57:55,870 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:57:55,870 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:57:55,870 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:57:55,871 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:57:55,871 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:57:55,872 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:57:55,872 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:57:55,872 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:57:55,872 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:57:55,872 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:57:55,872 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:57:55,872 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:57:55,873 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:57:55,873 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:57:55,874 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:57:55,874 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:57:55,874 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:57:55,874 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:57:55,874 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:57:55,874 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:57:55,875 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:57:55,875 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:57:55,875 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:57:55,876 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:57:55,876 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:57:55,876 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:57:55,876 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:57:55,876 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:57:55,877 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:57:55,877 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:57:55,877 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:57:55,878 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:57:55,878 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:57:55,878 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:57:55,878 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:57:55,878 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:57:55,878 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:57:55,879 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:57:55,879 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:57:55,879 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:57:55,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-10-22 08:57:55,880 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:57:55,880 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:57:55,880 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:57:55,880 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:57:55,881 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:57:55,881 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:57:55,881 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:57:55,881 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:57:55,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-10-22 08:57:55,882 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:57:55,882 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:57:55,882 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:57:55,882 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:57:55,884 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:57:55,884 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:57:55,892 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:57:55,892 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:57:55,892 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:57:55,893 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:57:55,893 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:57:55,893 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:57:55,893 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:57:55,894 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:57:55,895 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:57:55,895 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:57:55,896 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:57:55,896 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:57:55,896 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:57:55,896 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:57:55,897 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:57:55,897 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:57:55,899 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:57:55,899 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:57:55,899 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:57:55,900 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:57:55,900 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:57:55,900 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:57:55,901 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:57:55,901 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:57:55,904 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:57:55,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-10-22 08:57:55,905 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:57:55,905 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:57:55,906 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:57:55,906 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:57:55,907 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:57:55,908 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:57:55,917 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:57:55,917 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:57:55,918 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:57:55,918 INFO L202 nArgumentSynthesizer]: 8 stem disjuncts [2019-10-22 08:57:55,918 INFO L203 nArgumentSynthesizer]: 2 loop disjuncts [2019-10-22 08:57:55,918 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:57:55,924 INFO L400 nArgumentSynthesizer]: We have 44 Motzkin's Theorem applications. [2019-10-22 08:57:55,925 INFO L401 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2019-10-22 08:57:55,958 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:57:55,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-10-22 08:57:55,959 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:57:55,959 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:57:55,959 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:57:55,959 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:57:55,961 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:57:55,961 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:57:55,983 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-10-22 08:57:55,992 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-10-22 08:57:55,994 INFO L444 ModelExtractionUtils]: 13 out of 16 variables were initially zero. Simplification set additionally 0 variables to zero. [2019-10-22 08:57:55,994 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-10-22 08:57:55,995 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-10-22 08:57:55,996 INFO L510 LassoAnalysis]: Proved termination. [2019-10-22 08:57:55,996 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int rec_#in~op.base) rec_#in~op.offset)_1) = 2*v_rep(select (select #memory_int rec_#in~op.base) rec_#in~op.offset)_1 + 1 Supporting invariants [] [2019-10-22 08:57:56,001 INFO L297 tatePredicateManager]: 2 out of 2 supporting invariants were superfluous and have been removed [2019-10-22 08:57:56,004 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-10-22 08:57:56,017 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:57:56,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:57:56,042 INFO L256 TraceCheckSpWp]: Trace formula consists of 166 conjuncts, 6 conjunts are in the unsatisfiable core [2019-10-22 08:57:56,043 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:57:56,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:57:56,059 INFO L256 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 17 conjunts are in the unsatisfiable core [2019-10-22 08:57:56,059 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:57:56,102 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 08:57:56,102 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 53 [2019-10-22 08:57:56,103 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-22 08:57:56,127 INFO L567 ElimStorePlain]: treesize reduction 20, result has 67.7 percent of original size [2019-10-22 08:57:56,128 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-22 08:57:56,128 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:36, output treesize:21 [2019-10-22 08:57:56,140 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:57:56,141 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-10-22 08:57:56,141 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 46 states and 57 transitions. cyclomatic complexity: 16 Second operand 4 states. [2019-10-22 08:57:56,217 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 46 states and 57 transitions. cyclomatic complexity: 16. Second operand 4 states. Result 128 states and 165 transitions. Complement of second has 17 states. [2019-10-22 08:57:56,219 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-10-22 08:57:56,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-10-22 08:57:56,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 19 transitions. [2019-10-22 08:57:56,221 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 19 transitions. Stem has 8 letters. Loop has 3 letters. [2019-10-22 08:57:56,221 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 08:57:56,222 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 19 transitions. Stem has 11 letters. Loop has 3 letters. [2019-10-22 08:57:56,222 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 08:57:56,222 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 19 transitions. Stem has 8 letters. Loop has 6 letters. [2019-10-22 08:57:56,222 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 08:57:56,222 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 128 states and 165 transitions. [2019-10-22 08:57:56,228 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 16 [2019-10-22 08:57:56,233 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 128 states to 110 states and 147 transitions. [2019-10-22 08:57:56,233 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 57 [2019-10-22 08:57:56,233 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 61 [2019-10-22 08:57:56,233 INFO L73 IsDeterministic]: Start isDeterministic. Operand 110 states and 147 transitions. [2019-10-22 08:57:56,233 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-10-22 08:57:56,234 INFO L688 BuchiCegarLoop]: Abstraction has 110 states and 147 transitions. [2019-10-22 08:57:56,234 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states and 147 transitions. [2019-10-22 08:57:56,243 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 104. [2019-10-22 08:57:56,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2019-10-22 08:57:56,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 135 transitions. [2019-10-22 08:57:56,244 INFO L711 BuchiCegarLoop]: Abstraction has 104 states and 135 transitions. [2019-10-22 08:57:56,244 INFO L591 BuchiCegarLoop]: Abstraction has 104 states and 135 transitions. [2019-10-22 08:57:56,244 INFO L424 BuchiCegarLoop]: ======== Iteration 3============ [2019-10-22 08:57:56,244 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 104 states and 135 transitions. [2019-10-22 08:57:56,246 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 16 [2019-10-22 08:57:56,246 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 08:57:56,247 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 08:57:56,247 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 08:57:56,247 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 08:57:56,247 INFO L791 eck$LassoCheckResult]: Stem: 452#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 442#L-1 havoc main_#res;havoc main_#t~malloc6.base, main_#t~malloc6.offset, main_#t~nondet7, main_#t~malloc9.base, main_#t~malloc9.offset, main_#t~nondet10, main_#t~mem13, main_#t~ret11, main_#t~ite12, main_~pp~0.base, main_~pp~0.offset, main_#t~mem8, main_~qq~0.base, main_~qq~0.offset;call main_#t~malloc6.base, main_#t~malloc6.offset := #Ultimate.allocOnHeap(4);main_~qq~0.base, main_~qq~0.offset := main_#t~malloc6.base, main_#t~malloc6.offset;call write~int(main_#t~nondet7, main_~qq~0.base, main_~qq~0.offset, 4);havoc main_#t~nondet7; 443#L28-3 call main_#t~mem8 := read~int(main_~qq~0.base, main_~qq~0.offset, 4); 470#L28-1 assume !!(main_#t~mem8 > 1);havoc main_#t~mem8;call main_#t~malloc9.base, main_#t~malloc9.offset := #Ultimate.allocOnHeap(4);main_~pp~0.base, main_~pp~0.offset := main_#t~malloc9.base, main_#t~malloc9.offset;call write~int(main_#t~nondet10, main_~pp~0.base, main_~pp~0.offset, 4);havoc main_#t~nondet10;call main_#t~mem13 := read~int(main_~qq~0.base, main_~qq~0.offset, 4); 494#L33 call main_#t~ret11 := rec(main_~pp~0.base, main_~pp~0.offset);< 504#recENTRY ~op.base, ~op.offset := #in~op.base, #in~op.offset;call #t~mem1 := read~int(~op.base, ~op.offset, 4); 516#L9 assume #t~mem1 < 0;havoc #t~mem1;call #t~mem2 := read~int(~op.base, ~op.offset, 4);~r~0 := #t~mem2;havoc #t~mem2;call ULTIMATE.dealloc(~op.base, ~op.offset);#res := ~r~0; 515#recFINAL assume true; 493#recEXIT >#39#return; 453#L33-1 assume !(main_#t~ret11 <= -1);main_#t~ite12 := 1; 438#L33-3 [2019-10-22 08:57:56,247 INFO L793 eck$LassoCheckResult]: Loop: 438#L33-3 call write~int(main_#t~mem13 + main_#t~ite12, main_~qq~0.base, main_~qq~0.offset, 4);havoc main_#t~ret11;havoc main_#t~mem13;havoc main_#t~ite12; 439#L28-3 call main_#t~mem8 := read~int(main_~qq~0.base, main_~qq~0.offset, 4); 485#L28-1 assume !!(main_#t~mem8 > 1);havoc main_#t~mem8;call main_#t~malloc9.base, main_#t~malloc9.offset := #Ultimate.allocOnHeap(4);main_~pp~0.base, main_~pp~0.offset := main_#t~malloc9.base, main_#t~malloc9.offset;call write~int(main_#t~nondet10, main_~pp~0.base, main_~pp~0.offset, 4);havoc main_#t~nondet10;call main_#t~mem13 := read~int(main_~qq~0.base, main_~qq~0.offset, 4); 476#L33 call main_#t~ret11 := rec(main_~pp~0.base, main_~pp~0.offset);< 497#recENTRY ~op.base, ~op.offset := #in~op.base, #in~op.offset;call #t~mem1 := read~int(~op.base, ~op.offset, 4); 489#L9 assume #t~mem1 < 0;havoc #t~mem1;call #t~mem2 := read~int(~op.base, ~op.offset, 4);~r~0 := #t~mem2;havoc #t~mem2;call ULTIMATE.dealloc(~op.base, ~op.offset);#res := ~r~0; 490#recFINAL assume true; 475#recEXIT >#39#return; 472#L33-1 assume main_#t~ret11 <= -1;main_#t~ite12 := -1; 438#L33-3 [2019-10-22 08:57:56,248 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:57:56,248 INFO L82 PathProgramCache]: Analyzing trace with hash 2061793209, now seen corresponding path program 1 times [2019-10-22 08:57:56,248 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:57:56,248 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1719672985] [2019-10-22 08:57:56,248 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:57:56,248 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:57:56,248 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:57:56,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:57:56,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:57:56,331 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:57:56,331 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1719672985] [2019-10-22 08:57:56,332 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:57:56,332 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-22 08:57:56,332 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1661627824] [2019-10-22 08:57:56,334 INFO L796 eck$LassoCheckResult]: stem already infeasible [2019-10-22 08:57:56,336 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:57:56,336 INFO L82 PathProgramCache]: Analyzing trace with hash -1530037457, now seen corresponding path program 2 times [2019-10-22 08:57:56,336 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:57:56,337 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [937236655] [2019-10-22 08:57:56,337 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:57:56,337 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:57:56,337 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:57:56,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:57:56,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:57:56,368 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:57:56,703 WARN L191 SmtUtils]: Spent 214.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 97 [2019-10-22 08:57:56,777 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:57:56,778 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-22 08:57:56,779 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-22 08:57:56,779 INFO L87 Difference]: Start difference. First operand 104 states and 135 transitions. cyclomatic complexity: 41 Second operand 6 states. [2019-10-22 08:57:56,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:57:56,819 INFO L93 Difference]: Finished difference Result 98 states and 123 transitions. [2019-10-22 08:57:56,819 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-22 08:57:56,819 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 98 states and 123 transitions. [2019-10-22 08:57:56,822 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 13 [2019-10-22 08:57:56,824 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 98 states to 92 states and 117 transitions. [2019-10-22 08:57:56,824 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 47 [2019-10-22 08:57:56,824 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 47 [2019-10-22 08:57:56,824 INFO L73 IsDeterministic]: Start isDeterministic. Operand 92 states and 117 transitions. [2019-10-22 08:57:56,825 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-10-22 08:57:56,825 INFO L688 BuchiCegarLoop]: Abstraction has 92 states and 117 transitions. [2019-10-22 08:57:56,825 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states and 117 transitions. [2019-10-22 08:57:56,832 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 90. [2019-10-22 08:57:56,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90 states. [2019-10-22 08:57:56,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 115 transitions. [2019-10-22 08:57:56,833 INFO L711 BuchiCegarLoop]: Abstraction has 90 states and 115 transitions. [2019-10-22 08:57:56,834 INFO L591 BuchiCegarLoop]: Abstraction has 90 states and 115 transitions. [2019-10-22 08:57:56,834 INFO L424 BuchiCegarLoop]: ======== Iteration 4============ [2019-10-22 08:57:56,834 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 90 states and 115 transitions. [2019-10-22 08:57:56,836 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 12 [2019-10-22 08:57:56,836 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 08:57:56,836 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 08:57:56,838 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 08:57:56,838 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 08:57:56,838 INFO L791 eck$LassoCheckResult]: Stem: 669#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 659#L-1 havoc main_#res;havoc main_#t~malloc6.base, main_#t~malloc6.offset, main_#t~nondet7, main_#t~malloc9.base, main_#t~malloc9.offset, main_#t~nondet10, main_#t~mem13, main_#t~ret11, main_#t~ite12, main_~pp~0.base, main_~pp~0.offset, main_#t~mem8, main_~qq~0.base, main_~qq~0.offset;call main_#t~malloc6.base, main_#t~malloc6.offset := #Ultimate.allocOnHeap(4);main_~qq~0.base, main_~qq~0.offset := main_#t~malloc6.base, main_#t~malloc6.offset;call write~int(main_#t~nondet7, main_~qq~0.base, main_~qq~0.offset, 4);havoc main_#t~nondet7; 660#L28-3 call main_#t~mem8 := read~int(main_~qq~0.base, main_~qq~0.offset, 4); 683#L28-1 assume !!(main_#t~mem8 > 1);havoc main_#t~mem8;call main_#t~malloc9.base, main_#t~malloc9.offset := #Ultimate.allocOnHeap(4);main_~pp~0.base, main_~pp~0.offset := main_#t~malloc9.base, main_#t~malloc9.offset;call write~int(main_#t~nondet10, main_~pp~0.base, main_~pp~0.offset, 4);havoc main_#t~nondet10;call main_#t~mem13 := read~int(main_~qq~0.base, main_~qq~0.offset, 4); 703#L33 call main_#t~ret11 := rec(main_~pp~0.base, main_~pp~0.offset);< 707#recENTRY ~op.base, ~op.offset := #in~op.base, #in~op.offset;call #t~mem1 := read~int(~op.base, ~op.offset, 4); 705#L9 assume !(#t~mem1 < 0);havoc #t~mem1;call #t~malloc3.base, #t~malloc3.offset := #Ultimate.allocOnHeap(4);~ip~0.base, ~ip~0.offset := #t~malloc3.base, #t~malloc3.offset;call #t~mem4 := read~int(~op.base, ~op.offset, 4);call write~int(#t~mem4 - 1, ~ip~0.base, ~ip~0.offset, 4);havoc #t~mem4;call ULTIMATE.dealloc(~op.base, ~op.offset); 665#L19 call #t~ret5 := rec(~ip~0.base, ~ip~0.offset);< 700#recENTRY ~op.base, ~op.offset := #in~op.base, #in~op.offset;call #t~mem1 := read~int(~op.base, ~op.offset, 4); 701#L9 assume #t~mem1 < 0;havoc #t~mem1;call #t~mem2 := read~int(~op.base, ~op.offset, 4);~r~0 := #t~mem2;havoc #t~mem2;call ULTIMATE.dealloc(~op.base, ~op.offset);#res := ~r~0; 717#recFINAL assume true; 709#recEXIT >#37#return; 706#L19-1 #res := #t~ret5;havoc #t~ret5; 704#recFINAL assume true; 702#recEXIT >#39#return; 667#L33-1 assume !(main_#t~ret11 <= -1);main_#t~ite12 := 1; 655#L33-3 [2019-10-22 08:57:56,838 INFO L793 eck$LassoCheckResult]: Loop: 655#L33-3 call write~int(main_#t~mem13 + main_#t~ite12, main_~qq~0.base, main_~qq~0.offset, 4);havoc main_#t~ret11;havoc main_#t~mem13;havoc main_#t~ite12; 656#L28-3 call main_#t~mem8 := read~int(main_~qq~0.base, main_~qq~0.offset, 4); 695#L28-1 assume !!(main_#t~mem8 > 1);havoc main_#t~mem8;call main_#t~malloc9.base, main_#t~malloc9.offset := #Ultimate.allocOnHeap(4);main_~pp~0.base, main_~pp~0.offset := main_#t~malloc9.base, main_#t~malloc9.offset;call write~int(main_#t~nondet10, main_~pp~0.base, main_~pp~0.offset, 4);havoc main_#t~nondet10;call main_#t~mem13 := read~int(main_~qq~0.base, main_~qq~0.offset, 4); 692#L33 call main_#t~ret11 := rec(main_~pp~0.base, main_~pp~0.offset);< 694#recENTRY ~op.base, ~op.offset := #in~op.base, #in~op.offset;call #t~mem1 := read~int(~op.base, ~op.offset, 4); 698#L9 assume #t~mem1 < 0;havoc #t~mem1;call #t~mem2 := read~int(~op.base, ~op.offset, 4);~r~0 := #t~mem2;havoc #t~mem2;call ULTIMATE.dealloc(~op.base, ~op.offset);#res := ~r~0; 697#recFINAL assume true; 696#recEXIT >#39#return; 685#L33-1 assume main_#t~ret11 <= -1;main_#t~ite12 := -1; 655#L33-3 [2019-10-22 08:57:56,838 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:57:56,838 INFO L82 PathProgramCache]: Analyzing trace with hash 970657719, now seen corresponding path program 1 times [2019-10-22 08:57:56,839 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:57:56,839 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2016734064] [2019-10-22 08:57:56,839 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:57:56,839 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:57:56,839 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:57:56,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:57:56,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:57:56,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:57:56,911 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-10-22 08:57:56,911 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2016734064] [2019-10-22 08:57:56,911 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:57:56,911 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-22 08:57:56,911 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [379244206] [2019-10-22 08:57:56,912 INFO L796 eck$LassoCheckResult]: stem already infeasible [2019-10-22 08:57:56,912 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:57:56,912 INFO L82 PathProgramCache]: Analyzing trace with hash -1530037457, now seen corresponding path program 3 times [2019-10-22 08:57:56,912 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:57:56,912 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1676156094] [2019-10-22 08:57:56,912 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:57:56,912 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:57:56,912 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:57:56,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:57:56,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:57:56,931 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:57:57,188 WARN L191 SmtUtils]: Spent 159.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 91 [2019-10-22 08:57:57,232 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:57:57,232 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-22 08:57:57,232 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-10-22 08:57:57,232 INFO L87 Difference]: Start difference. First operand 90 states and 115 transitions. cyclomatic complexity: 33 Second operand 7 states. [2019-10-22 08:57:57,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:57:57,268 INFO L93 Difference]: Finished difference Result 76 states and 96 transitions. [2019-10-22 08:57:57,268 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-22 08:57:57,269 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 76 states and 96 transitions. [2019-10-22 08:57:57,271 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-10-22 08:57:57,272 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 76 states to 52 states and 63 transitions. [2019-10-22 08:57:57,273 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2019-10-22 08:57:57,273 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2019-10-22 08:57:57,273 INFO L73 IsDeterministic]: Start isDeterministic. Operand 52 states and 63 transitions. [2019-10-22 08:57:57,273 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-10-22 08:57:57,273 INFO L688 BuchiCegarLoop]: Abstraction has 52 states and 63 transitions. [2019-10-22 08:57:57,273 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states and 63 transitions. [2019-10-22 08:57:57,276 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 49. [2019-10-22 08:57:57,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2019-10-22 08:57:57,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 60 transitions. [2019-10-22 08:57:57,277 INFO L711 BuchiCegarLoop]: Abstraction has 49 states and 60 transitions. [2019-10-22 08:57:57,277 INFO L591 BuchiCegarLoop]: Abstraction has 49 states and 60 transitions. [2019-10-22 08:57:57,277 INFO L424 BuchiCegarLoop]: ======== Iteration 5============ [2019-10-22 08:57:57,278 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 49 states and 60 transitions. [2019-10-22 08:57:57,278 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-10-22 08:57:57,278 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 08:57:57,278 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 08:57:57,279 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 08:57:57,279 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-10-22 08:57:57,279 INFO L791 eck$LassoCheckResult]: Stem: 855#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 849#L-1 havoc main_#res;havoc main_#t~malloc6.base, main_#t~malloc6.offset, main_#t~nondet7, main_#t~malloc9.base, main_#t~malloc9.offset, main_#t~nondet10, main_#t~mem13, main_#t~ret11, main_#t~ite12, main_~pp~0.base, main_~pp~0.offset, main_#t~mem8, main_~qq~0.base, main_~qq~0.offset;call main_#t~malloc6.base, main_#t~malloc6.offset := #Ultimate.allocOnHeap(4);main_~qq~0.base, main_~qq~0.offset := main_#t~malloc6.base, main_#t~malloc6.offset;call write~int(main_#t~nondet7, main_~qq~0.base, main_~qq~0.offset, 4);havoc main_#t~nondet7; 850#L28-3 call main_#t~mem8 := read~int(main_~qq~0.base, main_~qq~0.offset, 4); 844#L28-1 assume !!(main_#t~mem8 > 1);havoc main_#t~mem8;call main_#t~malloc9.base, main_#t~malloc9.offset := #Ultimate.allocOnHeap(4);main_~pp~0.base, main_~pp~0.offset := main_#t~malloc9.base, main_#t~malloc9.offset;call write~int(main_#t~nondet10, main_~pp~0.base, main_~pp~0.offset, 4);havoc main_#t~nondet10;call main_#t~mem13 := read~int(main_~qq~0.base, main_~qq~0.offset, 4); 845#L33 call main_#t~ret11 := rec(main_~pp~0.base, main_~pp~0.offset);< 869#recENTRY ~op.base, ~op.offset := #in~op.base, #in~op.offset;call #t~mem1 := read~int(~op.base, ~op.offset, 4); 876#L9 assume !(#t~mem1 < 0);havoc #t~mem1;call #t~malloc3.base, #t~malloc3.offset := #Ultimate.allocOnHeap(4);~ip~0.base, ~ip~0.offset := #t~malloc3.base, #t~malloc3.offset;call #t~mem4 := read~int(~op.base, ~op.offset, 4);call write~int(#t~mem4 - 1, ~ip~0.base, ~ip~0.offset, 4);havoc #t~mem4;call ULTIMATE.dealloc(~op.base, ~op.offset); 858#L19 call #t~ret5 := rec(~ip~0.base, ~ip~0.offset);< 878#recENTRY ~op.base, ~op.offset := #in~op.base, #in~op.offset;call #t~mem1 := read~int(~op.base, ~op.offset, 4); 882#L9 assume #t~mem1 < 0;havoc #t~mem1;call #t~mem2 := read~int(~op.base, ~op.offset, 4);~r~0 := #t~mem2;havoc #t~mem2;call ULTIMATE.dealloc(~op.base, ~op.offset);#res := ~r~0; 880#recFINAL assume true; 861#recEXIT >#37#return; 862#L19-1 #res := #t~ret5;havoc #t~ret5; 874#recFINAL assume true; 870#recEXIT >#39#return; 854#L33-1 assume main_#t~ret11 <= -1;main_#t~ite12 := -1; 846#L33-3 call write~int(main_#t~mem13 + main_#t~ite12, main_~qq~0.base, main_~qq~0.offset, 4);havoc main_#t~ret11;havoc main_#t~mem13;havoc main_#t~ite12; 847#L28-3 call main_#t~mem8 := read~int(main_~qq~0.base, main_~qq~0.offset, 4); 843#L28-1 assume !!(main_#t~mem8 > 1);havoc main_#t~mem8;call main_#t~malloc9.base, main_#t~malloc9.offset := #Ultimate.allocOnHeap(4);main_~pp~0.base, main_~pp~0.offset := main_#t~malloc9.base, main_#t~malloc9.offset;call write~int(main_#t~nondet10, main_~pp~0.base, main_~pp~0.offset, 4);havoc main_#t~nondet10;call main_#t~mem13 := read~int(main_~qq~0.base, main_~qq~0.offset, 4); 836#L33 call main_#t~ret11 := rec(main_~pp~0.base, main_~pp~0.offset);< 835#recENTRY [2019-10-22 08:57:57,279 INFO L793 eck$LassoCheckResult]: Loop: 835#recENTRY ~op.base, ~op.offset := #in~op.base, #in~op.offset;call #t~mem1 := read~int(~op.base, ~op.offset, 4); 837#L9 assume !(#t~mem1 < 0);havoc #t~mem1;call #t~malloc3.base, #t~malloc3.offset := #Ultimate.allocOnHeap(4);~ip~0.base, ~ip~0.offset := #t~malloc3.base, #t~malloc3.offset;call #t~mem4 := read~int(~op.base, ~op.offset, 4);call write~int(#t~mem4 - 1, ~ip~0.base, ~ip~0.offset, 4);havoc #t~mem4;call ULTIMATE.dealloc(~op.base, ~op.offset); 838#L19 call #t~ret5 := rec(~ip~0.base, ~ip~0.offset);< 835#recENTRY [2019-10-22 08:57:57,279 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:57:57,280 INFO L82 PathProgramCache]: Analyzing trace with hash -1312873862, now seen corresponding path program 1 times [2019-10-22 08:57:57,280 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:57:57,280 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [873270762] [2019-10-22 08:57:57,280 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:57:57,280 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:57:57,280 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:57:57,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:57:57,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:57:57,313 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:57:57,313 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:57:57,314 INFO L82 PathProgramCache]: Analyzing trace with hash 29951, now seen corresponding path program 2 times [2019-10-22 08:57:57,314 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:57:57,314 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1855352626] [2019-10-22 08:57:57,314 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:57:57,314 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:57:57,314 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:57:57,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:57:57,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:57:57,322 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:57:57,322 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:57:57,323 INFO L82 PathProgramCache]: Analyzing trace with hash -1853025306, now seen corresponding path program 2 times [2019-10-22 08:57:57,323 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:57:57,323 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [49892232] [2019-10-22 08:57:57,323 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:57:57,323 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:57:57,323 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:57:57,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:57:57,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:57:57,365 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:57:57,802 WARN L191 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 87 [2019-10-22 08:57:59,223 WARN L191 SmtUtils]: Spent 1.26 s on a formula simplification. DAG size of input: 215 DAG size of output: 183 [2019-10-22 08:57:59,394 WARN L191 SmtUtils]: Spent 165.00 ms on a formula simplification that was a NOOP. DAG size: 115 [2019-10-22 08:57:59,622 WARN L191 SmtUtils]: Spent 207.00 ms on a formula simplification that was a NOOP. DAG size: 121 [2019-10-22 08:57:59,764 WARN L191 SmtUtils]: Spent 139.00 ms on a formula simplification that was a NOOP. DAG size: 99 [2019-10-22 08:57:59,766 INFO L210 LassoAnalysis]: Preferences: [2019-10-22 08:57:59,766 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-10-22 08:57:59,766 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-10-22 08:57:59,766 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-10-22 08:57:59,766 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-10-22 08:57:59,766 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 08:57:59,767 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-10-22 08:57:59,767 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-10-22 08:57:59,767 INFO L131 ssoRankerPreferences]: Filename of dumped script: rec_malloc_ex11B.i_Iteration5_Lasso [2019-10-22 08:57:59,767 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-10-22 08:57:59,767 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-10-22 08:57:59,769 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:57:59,771 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:57:59,773 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:57:59,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-10-22 08:57:59,775 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:57:59,778 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:57:59,779 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:57:59,780 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:57:59,781 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:57:59,782 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:57:59,784 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:57:59,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-10-22 08:57:59,786 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:57:59,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-10-22 08:57:59,788 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:57:59,925 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:57:59,926 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:57:59,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-10-22 08:57:59,928 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:57:59,929 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:57:59,930 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:57:59,931 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:57:59,936 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:57:59,938 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:57:59,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-10-22 08:57:59,940 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:57:59,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-10-22 08:57:59,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-10-22 08:57:59,943 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:57:59,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-10-22 08:57:59,945 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:57:59,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-10-22 08:57:59,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-10-22 08:58:00,390 WARN L191 SmtUtils]: Spent 305.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 43 [2019-10-22 08:58:00,429 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-10-22 08:58:00,429 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-10-22 08:58:00,429 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:58:00,430 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:58:00,430 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:58:00,430 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:58:00,430 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:58:00,430 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:58:00,430 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:58:00,430 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:58:00,431 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:58:00,431 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:58:00,432 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:58:00,432 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:58:00,432 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:58:00,432 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:58:00,432 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:58:00,432 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:58:00,433 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:58:00,434 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:58:00,434 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:58:00,434 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:58:00,434 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:58:00,435 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:58:00,435 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:58:00,435 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:58:00,435 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:58:00,435 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:58:00,435 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:58:00,436 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:58:00,436 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:58:00,436 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:58:00,436 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:58:00,436 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:58:00,437 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:58:00,437 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:58:00,437 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:58:00,437 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:58:00,438 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:58:00,439 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:58:00,439 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:58:00,439 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:58:00,439 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:58:00,440 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:58:00,440 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:58:00,441 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:58:00,441 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:58:00,441 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:58:00,442 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:58:00,442 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:58:00,442 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:58:00,442 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:58:00,442 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:58:00,442 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:58:00,443 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:58:00,443 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:58:00,443 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:58:00,444 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:58:00,444 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:58:00,444 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:58:00,444 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:58:00,444 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:58:00,444 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:58:00,445 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:58:00,445 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:58:00,445 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:58:00,445 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:58:00,446 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:58:00,446 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:58:00,446 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:58:00,446 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:58:00,446 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:58:00,447 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:58:00,447 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:58:00,447 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:58:00,448 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:58:00,448 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:58:00,448 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:58:00,448 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:58:00,448 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:58:00,448 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:58:00,448 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:58:00,449 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:58:00,449 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:58:00,449 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:58:00,450 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:58:00,450 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:58:00,451 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:58:00,451 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:58:00,452 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:58:00,452 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:58:00,452 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:58:00,452 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:58:00,453 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:58:00,453 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:58:00,453 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:58:00,453 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:58:00,453 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:58:00,454 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:58:00,454 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:58:00,454 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:58:00,455 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:58:00,455 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:58:00,455 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:58:00,455 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:58:00,455 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:58:00,455 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:58:00,456 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:58:00,456 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:58:00,456 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:58:00,457 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:58:00,457 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:58:00,457 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:58:00,457 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:58:00,457 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:58:00,457 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:58:00,458 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:58:00,458 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:58:00,458 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:58:00,458 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:58:00,459 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:58:00,459 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:58:00,459 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:58:00,459 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:58:00,459 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:58:00,459 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:58:00,460 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:58:00,460 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:58:00,460 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:58:00,460 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:58:00,460 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:58:00,461 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:58:00,461 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:58:00,463 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:58:00,463 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:58:00,463 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:58:00,464 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:58:00,464 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:58:00,464 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:58:00,465 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:58:00,465 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:58:00,469 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:58:00,469 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:58:00,470 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:58:00,470 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:58:00,470 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:58:00,470 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:58:00,471 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:58:00,471 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:58:00,473 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:58:00,473 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:58:00,474 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:58:00,474 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:58:00,474 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:58:00,474 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:58:00,475 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:58:00,475 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:58:00,475 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:58:00,476 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:58:00,476 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:58:00,476 INFO L202 nArgumentSynthesizer]: 16 stem disjuncts [2019-10-22 08:58:00,476 INFO L203 nArgumentSynthesizer]: 2 loop disjuncts [2019-10-22 08:58:00,476 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:58:00,483 INFO L400 nArgumentSynthesizer]: We have 76 Motzkin's Theorem applications. [2019-10-22 08:58:00,483 INFO L401 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2019-10-22 08:58:00,517 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:58:00,518 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:58:00,518 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:58:00,518 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:58:00,519 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:58:00,519 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:58:00,520 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:58:00,520 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:58:00,524 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:58:00,525 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:58:00,525 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:58:00,525 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:58:00,525 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:58:00,526 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:58:00,526 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:58:00,526 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:58:00,531 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-10-22 08:58:00,534 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-10-22 08:58:00,534 INFO L444 ModelExtractionUtils]: 7 out of 10 variables were initially zero. Simplification set additionally 0 variables to zero. [2019-10-22 08:58:00,534 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-10-22 08:58:00,535 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-10-22 08:58:00,535 INFO L510 LassoAnalysis]: Proved termination. [2019-10-22 08:58:00,535 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int rec_#in~op.base) rec_#in~op.offset)_2) = 2*v_rep(select (select #memory_int rec_#in~op.base) rec_#in~op.offset)_2 + 1 Supporting invariants [] [2019-10-22 08:58:00,539 INFO L297 tatePredicateManager]: 1 out of 1 supporting invariants were superfluous and have been removed [2019-10-22 08:58:00,540 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-10-22 08:58:00,551 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:58:00,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:58:00,584 INFO L256 TraceCheckSpWp]: Trace formula consists of 272 conjuncts, 8 conjunts are in the unsatisfiable core [2019-10-22 08:58:00,585 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:58:00,600 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 08:58:00,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:58:00,618 INFO L256 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 17 conjunts are in the unsatisfiable core [2019-10-22 08:58:00,619 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:58:00,645 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 08:58:00,646 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 53 [2019-10-22 08:58:00,646 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-22 08:58:00,667 INFO L567 ElimStorePlain]: treesize reduction 20, result has 67.7 percent of original size [2019-10-22 08:58:00,668 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-22 08:58:00,668 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:36, output treesize:21 [2019-10-22 08:58:00,683 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:58:00,683 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 3 loop predicates [2019-10-22 08:58:00,683 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 49 states and 60 transitions. cyclomatic complexity: 16 Second operand 5 states. [2019-10-22 08:58:00,744 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 49 states and 60 transitions. cyclomatic complexity: 16. Second operand 5 states. Result 78 states and 96 transitions. Complement of second has 16 states. [2019-10-22 08:58:00,744 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-10-22 08:58:00,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2019-10-22 08:58:00,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 10 transitions. [2019-10-22 08:58:00,745 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 10 transitions. Stem has 20 letters. Loop has 3 letters. [2019-10-22 08:58:00,745 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 08:58:00,745 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-10-22 08:58:00,755 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:58:00,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:58:00,786 INFO L256 TraceCheckSpWp]: Trace formula consists of 272 conjuncts, 8 conjunts are in the unsatisfiable core [2019-10-22 08:58:00,788 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:58:00,802 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 08:58:00,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:58:00,814 INFO L256 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 17 conjunts are in the unsatisfiable core [2019-10-22 08:58:00,814 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:58:00,841 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 08:58:00,841 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 53 [2019-10-22 08:58:00,842 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-22 08:58:00,863 INFO L567 ElimStorePlain]: treesize reduction 20, result has 67.7 percent of original size [2019-10-22 08:58:00,864 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-22 08:58:00,864 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:36, output treesize:21 [2019-10-22 08:58:00,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-10-22 08:58:00,875 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.2 stem predicates 3 loop predicates [2019-10-22 08:58:00,875 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 49 states and 60 transitions. cyclomatic complexity: 16 Second operand 5 states. [2019-10-22 08:58:00,933 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 49 states and 60 transitions. cyclomatic complexity: 16. Second operand 5 states. Result 78 states and 96 transitions. Complement of second has 16 states. [2019-10-22 08:58:00,933 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-10-22 08:58:00,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2019-10-22 08:58:00,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 10 transitions. [2019-10-22 08:58:00,934 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 10 transitions. Stem has 20 letters. Loop has 3 letters. [2019-10-22 08:58:00,934 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 08:58:00,934 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-10-22 08:58:00,944 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:58:00,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:58:00,976 INFO L256 TraceCheckSpWp]: Trace formula consists of 272 conjuncts, 8 conjunts are in the unsatisfiable core [2019-10-22 08:58:00,977 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:58:00,991 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 08:58:01,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:58:01,003 INFO L256 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 17 conjunts are in the unsatisfiable core [2019-10-22 08:58:01,004 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:58:01,031 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 08:58:01,031 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 53 [2019-10-22 08:58:01,032 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-22 08:58:01,053 INFO L567 ElimStorePlain]: treesize reduction 20, result has 67.7 percent of original size [2019-10-22 08:58:01,054 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-22 08:58:01,054 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:36, output treesize:21 [2019-10-22 08:58:01,069 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:58:01,069 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.2 stem predicates 3 loop predicates [2019-10-22 08:58:01,069 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 49 states and 60 transitions. cyclomatic complexity: 16 Second operand 5 states. [2019-10-22 08:58:01,172 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 49 states and 60 transitions. cyclomatic complexity: 16. Second operand 5 states. Result 76 states and 88 transitions. Complement of second has 17 states. [2019-10-22 08:58:01,175 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-10-22 08:58:01,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2019-10-22 08:58:01,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 21 transitions. [2019-10-22 08:58:01,176 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 21 transitions. Stem has 20 letters. Loop has 3 letters. [2019-10-22 08:58:01,176 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 08:58:01,176 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 21 transitions. Stem has 23 letters. Loop has 3 letters. [2019-10-22 08:58:01,176 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 08:58:01,176 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 21 transitions. Stem has 20 letters. Loop has 6 letters. [2019-10-22 08:58:01,176 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 08:58:01,177 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 76 states and 88 transitions. [2019-10-22 08:58:01,178 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-10-22 08:58:01,178 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 76 states to 0 states and 0 transitions. [2019-10-22 08:58:01,178 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2019-10-22 08:58:01,178 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2019-10-22 08:58:01,178 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2019-10-22 08:58:01,178 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-10-22 08:58:01,178 INFO L688 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-10-22 08:58:01,178 INFO L711 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-10-22 08:58:01,178 INFO L591 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-10-22 08:58:01,179 INFO L424 BuchiCegarLoop]: ======== Iteration 6============ [2019-10-22 08:58:01,179 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2019-10-22 08:58:01,179 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-10-22 08:58:01,179 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2019-10-22 08:58:01,186 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 22.10 08:58:01 BoogieIcfgContainer [2019-10-22 08:58:01,186 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2019-10-22 08:58:01,186 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-10-22 08:58:01,186 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-10-22 08:58:01,187 INFO L275 PluginConnector]: Witness Printer initialized [2019-10-22 08:58:01,187 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 08:57:51" (3/4) ... [2019-10-22 08:58:01,189 INFO L140 WitnessPrinter]: No result that supports witness generation found [2019-10-22 08:58:01,189 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-10-22 08:58:01,190 INFO L168 Benchmark]: Toolchain (without parser) took 10212.75 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 216.5 MB). Free memory was 944.6 MB in the beginning and 1.0 GB in the end (delta: -84.4 MB). Peak memory consumption was 132.2 MB. Max. memory is 11.5 GB. [2019-10-22 08:58:01,191 INFO L168 Benchmark]: CDTParser took 0.18 ms. Allocated memory is still 1.0 GB. Free memory is still 967.5 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-10-22 08:58:01,191 INFO L168 Benchmark]: CACSL2BoogieTranslator took 247.22 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 137.4 MB). Free memory was 944.6 MB in the beginning and 1.1 GB in the end (delta: -190.2 MB). Peak memory consumption was 23.2 MB. Max. memory is 11.5 GB. [2019-10-22 08:58:01,191 INFO L168 Benchmark]: Boogie Procedure Inliner took 35.41 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-10-22 08:58:01,192 INFO L168 Benchmark]: Boogie Preprocessor took 29.72 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2019-10-22 08:58:01,192 INFO L168 Benchmark]: RCFGBuilder took 323.76 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 23.7 MB). Peak memory consumption was 23.7 MB. Max. memory is 11.5 GB. [2019-10-22 08:58:01,193 INFO L168 Benchmark]: BuchiAutomizer took 9570.29 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 79.2 MB). Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 79.4 MB). Peak memory consumption was 158.6 MB. Max. memory is 11.5 GB. [2019-10-22 08:58:01,193 INFO L168 Benchmark]: Witness Printer took 2.72 ms. Allocated memory is still 1.2 GB. Free memory is still 1.0 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-10-22 08:58:01,195 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.18 ms. Allocated memory is still 1.0 GB. Free memory is still 967.5 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 247.22 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 137.4 MB). Free memory was 944.6 MB in the beginning and 1.1 GB in the end (delta: -190.2 MB). Peak memory consumption was 23.2 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 35.41 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 29.72 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 323.76 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 23.7 MB). Peak memory consumption was 23.7 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 9570.29 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 79.2 MB). Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 79.4 MB). Peak memory consumption was 158.6 MB. Max. memory is 11.5 GB. * Witness Printer took 2.72 ms. Allocated memory is still 1.2 GB. Free memory is still 1.0 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 5 terminating modules (2 trivial, 2 deterministic, 1 nondeterministic). One deterministic module has affine ranking function unknown-#memory_int-unknown[qq][qq] and consists of 9 locations. One deterministic module has affine ranking function 2 * unknown-#memory_int-unknown[op][op] + 1 and consists of 5 locations. One nondeterministic module has affine ranking function 2 * unknown-#memory_int-unknown[op][op] + 1 and consists of 6 locations. 2 modules have a trivial ranking function, the largest among these consists of 7 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 9.5s and 6 iterations. TraceHistogramMax:2. Analysis of lassos took 8.0s. Construction of modules took 0.1s. Büchi inclusion checks took 1.0s. Highest rank in rank-based complementation 3. Minimization of det autom 1. Minimization of nondet autom 4. Automata minimization 0.0s AutomataMinimizationTime, 4 MinimizatonAttempts, 12 StatesRemovedByMinimization, 4 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 104 states and ocurred in iteration 2. Nontrivial modules had stage [2, 0, 1, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 80 SDtfs, 61 SDslu, 119 SDs, 0 SdLazy, 197 SolverSat, 38 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.1s Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc0 concLT0 SILN0 SILU2 SILI0 SILT0 lasso3 LassoPreprocessingBenchmarks: Lassos: inital361 mio100 ax100 hnf100 lsp97 ukn44 mio100 lsp29 div100 bol100 ite100 ukn100 eq180 hnf92 smp100 dnf416 smp89 tf100 neg87 sie149 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 41ms VariablesStem: 5 VariablesLoop: 2 DisjunctsStem: 16 DisjunctsLoop: 2 SupportingInvariants: 4 MotzkinApplications: 76 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! Received shutdown request...