./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/termination-memory-alloca/c.07-alloca.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version cad46833 Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_dc651cde-95e5-4633-9144-9a65e68473aa/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_dc651cde-95e5-4633-9144-9a65e68473aa/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_dc651cde-95e5-4633-9144-9a65e68473aa/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_dc651cde-95e5-4633-9144-9a65e68473aa/bin/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/termination-memory-alloca/c.07-alloca.i -s /tmp/vcloud-vcloud-master/worker/run_dir_dc651cde-95e5-4633-9144-9a65e68473aa/bin/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_dc651cde-95e5-4633-9144-9a65e68473aa/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 b6b0b5eb73c85bd27f01305782cc76399fba05e9 ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-cad4683 [2019-11-15 21:06:58,329 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-15 21:06:58,330 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-15 21:06:58,340 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-15 21:06:58,340 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-15 21:06:58,341 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-15 21:06:58,343 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-15 21:06:58,345 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-15 21:06:58,346 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-15 21:06:58,347 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-15 21:06:58,348 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-15 21:06:58,349 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-15 21:06:58,350 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-15 21:06:58,351 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-15 21:06:58,352 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-15 21:06:58,353 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-15 21:06:58,353 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-15 21:06:58,354 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-15 21:06:58,356 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-15 21:06:58,358 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-15 21:06:58,359 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-15 21:06:58,360 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-15 21:06:58,361 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-15 21:06:58,362 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-15 21:06:58,364 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-15 21:06:58,365 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-15 21:06:58,365 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-15 21:06:58,366 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-15 21:06:58,366 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-15 21:06:58,367 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-15 21:06:58,367 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-15 21:06:58,368 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-15 21:06:58,369 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-15 21:06:58,369 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-15 21:06:58,370 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-15 21:06:58,371 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-15 21:06:58,371 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-15 21:06:58,371 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-15 21:06:58,372 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-15 21:06:58,372 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-15 21:06:58,373 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-15 21:06:58,374 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_dc651cde-95e5-4633-9144-9a65e68473aa/bin/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf [2019-11-15 21:06:58,389 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-15 21:06:58,389 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-15 21:06:58,390 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-15 21:06:58,390 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-15 21:06:58,391 INFO L138 SettingsManager]: * Use SBE=true [2019-11-15 21:06:58,391 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-11-15 21:06:58,391 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-11-15 21:06:58,391 INFO L138 SettingsManager]: * Use old map elimination=false [2019-11-15 21:06:58,392 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2019-11-15 21:06:58,392 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2019-11-15 21:06:58,392 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-11-15 21:06:58,392 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-15 21:06:58,393 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-11-15 21:06:58,393 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-15 21:06:58,393 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-15 21:06:58,393 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-11-15 21:06:58,393 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-11-15 21:06:58,394 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-11-15 21:06:58,394 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-15 21:06:58,394 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-11-15 21:06:58,394 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-15 21:06:58,395 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-11-15 21:06:58,395 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-15 21:06:58,395 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-15 21:06:58,395 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-11-15 21:06:58,396 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-15 21:06:58,396 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-15 21:06:58,396 INFO L138 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-11-15 21:06:58,397 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-11-15 21:06:58,397 INFO L138 SettingsManager]: * TransformationType=MODULO_NEIGHBOR Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud-vcloud-master/worker/run_dir_dc651cde-95e5-4633-9144-9a65e68473aa/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 -> b6b0b5eb73c85bd27f01305782cc76399fba05e9 [2019-11-15 21:06:58,422 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-15 21:06:58,431 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-15 21:06:58,434 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-15 21:06:58,437 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-15 21:06:58,438 INFO L275 PluginConnector]: CDTParser initialized [2019-11-15 21:06:58,439 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_dc651cde-95e5-4633-9144-9a65e68473aa/bin/uautomizer/../../sv-benchmarks/c/termination-memory-alloca/c.07-alloca.i [2019-11-15 21:06:58,495 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_dc651cde-95e5-4633-9144-9a65e68473aa/bin/uautomizer/data/198b7b995/e216cb47ebdb4d8aabf0b1ec6d0ee673/FLAGa70473da7 [2019-11-15 21:06:58,930 INFO L306 CDTParser]: Found 1 translation units. [2019-11-15 21:06:58,934 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_dc651cde-95e5-4633-9144-9a65e68473aa/sv-benchmarks/c/termination-memory-alloca/c.07-alloca.i [2019-11-15 21:06:58,946 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_dc651cde-95e5-4633-9144-9a65e68473aa/bin/uautomizer/data/198b7b995/e216cb47ebdb4d8aabf0b1ec6d0ee673/FLAGa70473da7 [2019-11-15 21:06:59,456 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_dc651cde-95e5-4633-9144-9a65e68473aa/bin/uautomizer/data/198b7b995/e216cb47ebdb4d8aabf0b1ec6d0ee673 [2019-11-15 21:06:59,460 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-15 21:06:59,462 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-15 21:06:59,464 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-15 21:06:59,464 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-15 21:06:59,467 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-15 21:06:59,468 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 09:06:59" (1/1) ... [2019-11-15 21:06:59,470 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@717ba0f8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:06:59, skipping insertion in model container [2019-11-15 21:06:59,470 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 09:06:59" (1/1) ... [2019-11-15 21:06:59,476 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-15 21:06:59,513 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-15 21:06:59,809 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-15 21:06:59,818 INFO L188 MainTranslator]: Completed pre-run [2019-11-15 21:06:59,853 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-15 21:06:59,893 INFO L192 MainTranslator]: Completed translation [2019-11-15 21:06:59,893 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:06:59 WrapperNode [2019-11-15 21:06:59,893 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-15 21:06:59,894 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-15 21:06:59,894 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-15 21:06:59,894 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-15 21:06:59,902 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:06:59" (1/1) ... [2019-11-15 21:06:59,916 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:06:59" (1/1) ... [2019-11-15 21:06:59,937 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-15 21:06:59,937 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-15 21:06:59,937 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-15 21:06:59,938 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-15 21:06:59,946 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:06:59" (1/1) ... [2019-11-15 21:06:59,946 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:06:59" (1/1) ... [2019-11-15 21:06:59,950 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:06:59" (1/1) ... [2019-11-15 21:06:59,950 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:06:59" (1/1) ... [2019-11-15 21:06:59,955 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:06:59" (1/1) ... [2019-11-15 21:06:59,959 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:06:59" (1/1) ... [2019-11-15 21:06:59,961 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:06:59" (1/1) ... [2019-11-15 21:06:59,963 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-15 21:06:59,964 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-15 21:06:59,964 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-15 21:06:59,964 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-15 21:06:59,965 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:06:59" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_dc651cde-95e5-4633-9144-9a65e68473aa/bin/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 21:07:00,028 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-11-15 21:07:00,029 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-11-15 21:07:00,029 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-15 21:07:00,029 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-15 21:07:00,029 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-15 21:07:00,029 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-15 21:07:00,326 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-15 21:07:00,326 INFO L284 CfgBuilder]: Removed 7 assume(true) statements. [2019-11-15 21:07:00,327 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 09:07:00 BoogieIcfgContainer [2019-11-15 21:07:00,327 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-15 21:07:00,328 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-11-15 21:07:00,328 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-11-15 21:07:00,331 INFO L275 PluginConnector]: BuchiAutomizer initialized [2019-11-15 21:07:00,332 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-15 21:07:00,332 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 15.11 09:06:59" (1/3) ... [2019-11-15 21:07:00,333 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@599228b0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 15.11 09:07:00, skipping insertion in model container [2019-11-15 21:07:00,334 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-15 21:07:00,334 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:06:59" (2/3) ... [2019-11-15 21:07:00,334 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@599228b0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 15.11 09:07:00, skipping insertion in model container [2019-11-15 21:07:00,334 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-15 21:07:00,334 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 09:07:00" (3/3) ... [2019-11-15 21:07:00,336 INFO L371 chiAutomizerObserver]: Analyzing ICFG c.07-alloca.i [2019-11-15 21:07:00,370 INFO L356 BuchiCegarLoop]: Interprodecural is true [2019-11-15 21:07:00,371 INFO L357 BuchiCegarLoop]: Hoare is false [2019-11-15 21:07:00,371 INFO L358 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-11-15 21:07:00,371 INFO L359 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-15 21:07:00,371 INFO L360 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-15 21:07:00,371 INFO L361 BuchiCegarLoop]: Difference is false [2019-11-15 21:07:00,371 INFO L362 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-15 21:07:00,371 INFO L365 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-11-15 21:07:00,382 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 12 states. [2019-11-15 21:07:00,398 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2019-11-15 21:07:00,399 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 21:07:00,399 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 21:07:00,405 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2019-11-15 21:07:00,405 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2019-11-15 21:07:00,405 INFO L424 BuchiCegarLoop]: ======== Iteration 1============ [2019-11-15 21:07:00,405 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 12 states. [2019-11-15 21:07:00,406 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2019-11-15 21:07:00,406 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 21:07:00,406 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 21:07:00,407 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2019-11-15 21:07:00,407 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2019-11-15 21:07:00,414 INFO L791 eck$LassoCheckResult]: Stem: 6#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 3#L-1true havoc main_#res;havoc main_#t~nondet17, main_#t~nondet18, main_#t~nondet19, main_#t~nondet20, main_#t~ret21;test_fun_#in~i, test_fun_#in~j, test_fun_#in~k, test_fun_#in~tmp := main_#t~nondet17, main_#t~nondet18, main_#t~nondet19, main_#t~nondet20;havoc test_fun_#res;havoc test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset, test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset, test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset, test_fun_#t~malloc5.base, test_fun_#t~malloc5.offset, test_fun_#t~malloc6.base, test_fun_#t~malloc6.offset, test_fun_#t~mem12, test_fun_#t~mem13, test_fun_#t~mem14, test_fun_#t~mem15, test_fun_#t~mem7, test_fun_#t~mem8, test_fun_#t~short9, test_fun_#t~mem10, test_fun_#t~short11, test_fun_#t~mem16, test_fun_~i, test_fun_~j, test_fun_~k, test_fun_~tmp, test_fun_~i_ref~0.base, test_fun_~i_ref~0.offset, test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, test_fun_~k_ref~0.base, test_fun_~k_ref~0.offset, test_fun_~tmp_ref~0.base, test_fun_~tmp_ref~0.offset, test_fun_~c~0.base, test_fun_~c~0.offset;test_fun_~i := test_fun_#in~i;test_fun_~j := test_fun_#in~j;test_fun_~k := test_fun_#in~k;test_fun_~tmp := test_fun_#in~tmp;call test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset := #Ultimate.allocOnStack(4);test_fun_~i_ref~0.base, test_fun_~i_ref~0.offset := test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset;call test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset := #Ultimate.allocOnStack(4);test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset := test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset;call test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset := #Ultimate.allocOnStack(4);test_fun_~k_ref~0.base, test_fun_~k_ref~0.offset := test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset;call test_fun_#t~malloc5.base, test_fun_#t~malloc5.offset := #Ultimate.allocOnStack(4);test_fun_~tmp_ref~0.base, test_fun_~tmp_ref~0.offset := test_fun_#t~malloc5.base, test_fun_#t~malloc5.offset;call test_fun_#t~malloc6.base, test_fun_#t~malloc6.offset := #Ultimate.allocOnStack(4);test_fun_~c~0.base, test_fun_~c~0.offset := test_fun_#t~malloc6.base, test_fun_#t~malloc6.offset;call write~int(test_fun_~i, test_fun_~i_ref~0.base, test_fun_~i_ref~0.offset, 4);call write~int(test_fun_~j, test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call write~int(test_fun_~k, test_fun_~k_ref~0.base, test_fun_~k_ref~0.offset, 4);call write~int(test_fun_~tmp, test_fun_~tmp_ref~0.base, test_fun_~tmp_ref~0.offset, 4);call write~int(0, test_fun_~c~0.base, test_fun_~c~0.offset, 4); 8#L559-8true [2019-11-15 21:07:00,414 INFO L793 eck$LassoCheckResult]: Loop: 8#L559-8true call test_fun_#t~mem7 := read~int(test_fun_~i_ref~0.base, test_fun_~i_ref~0.offset, 4);test_fun_#t~short9 := test_fun_#t~mem7 <= 100; 5#L559-1true assume test_fun_#t~short9;call test_fun_#t~mem8 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);test_fun_#t~short9 := test_fun_#t~mem8 <= test_fun_~k; 9#L559-3true test_fun_#t~short11 := test_fun_#t~short9; 12#L559-4true assume test_fun_#t~short11;call test_fun_#t~mem10 := read~int(test_fun_~k_ref~0.base, test_fun_~k_ref~0.offset, 4);test_fun_#t~short11 := test_fun_#t~mem10 > -2147483648; 4#L559-6true assume !!test_fun_#t~short11;havoc test_fun_#t~mem8;havoc test_fun_#t~short11;havoc test_fun_#t~short9;havoc test_fun_#t~mem10;havoc test_fun_#t~mem7;call test_fun_#t~mem12 := read~int(test_fun_~i_ref~0.base, test_fun_~i_ref~0.offset, 4);call write~int(test_fun_#t~mem12, test_fun_~tmp_ref~0.base, test_fun_~tmp_ref~0.offset, 4);havoc test_fun_#t~mem12;call test_fun_#t~mem13 := read~int(test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);call write~int(test_fun_#t~mem13, test_fun_~i_ref~0.base, test_fun_~i_ref~0.offset, 4);havoc test_fun_#t~mem13;call test_fun_#t~mem14 := read~int(test_fun_~tmp_ref~0.base, test_fun_~tmp_ref~0.offset, 4);call write~int(1 + test_fun_#t~mem14, test_fun_~j_ref~0.base, test_fun_~j_ref~0.offset, 4);havoc test_fun_#t~mem14;call test_fun_#t~mem15 := read~int(test_fun_~k_ref~0.base, test_fun_~k_ref~0.offset, 4);call write~int(test_fun_#t~mem15 - 1, test_fun_~k_ref~0.base, test_fun_~k_ref~0.offset, 4);havoc test_fun_#t~mem15; 8#L559-8true [2019-11-15 21:07:00,419 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:07:00,419 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2019-11-15 21:07:00,427 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:07:00,427 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [694410376] [2019-11-15 21:07:00,427 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:07:00,427 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:07:00,427 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:07:00,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 21:07:00,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 21:07:00,641 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 21:07:00,642 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:07:00,642 INFO L82 PathProgramCache]: Analyzing trace with hash 35405714, now seen corresponding path program 1 times [2019-11-15 21:07:00,642 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:07:00,643 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [233573054] [2019-11-15 21:07:00,643 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:07:00,643 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:07:00,643 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:07:00,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 21:07:00,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 21:07:00,698 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 21:07:00,699 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:07:00,699 INFO L82 PathProgramCache]: Analyzing trace with hash 1806845200, now seen corresponding path program 1 times [2019-11-15 21:07:00,700 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:07:00,700 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1597977019] [2019-11-15 21:07:00,700 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:07:00,700 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:07:00,700 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:07:00,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 21:07:00,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 21:07:00,842 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 21:07:01,341 WARN L191 SmtUtils]: Spent 483.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 84 [2019-11-15 21:07:01,491 WARN L191 SmtUtils]: Spent 115.00 ms on a formula simplification that was a NOOP. DAG size: 74 [2019-11-15 21:07:03,007 WARN L191 SmtUtils]: Spent 1.51 s on a formula simplification. DAG size of input: 156 DAG size of output: 135 [2019-11-15 21:07:03,368 WARN L191 SmtUtils]: Spent 359.00 ms on a formula simplification that was a NOOP. DAG size: 133 [2019-11-15 21:07:03,389 INFO L210 LassoAnalysis]: Preferences: [2019-11-15 21:07:03,390 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-11-15 21:07:03,390 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-15 21:07:03,390 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-11-15 21:07:03,390 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-11-15 21:07:03,390 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 21:07:03,391 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-15 21:07:03,391 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-11-15 21:07:03,391 INFO L131 ssoRankerPreferences]: Filename of dumped script: c.07-alloca.i_Iteration1_Lasso [2019-11-15 21:07:03,391 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-15 21:07:03,391 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-15 21:07:03,416 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:07:03,426 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:07:03,430 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:07:03,432 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:07:03,435 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:07:03,441 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:07:03,446 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:07:03,454 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:07:03,462 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:07:03,467 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:07:03,478 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:07:03,483 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:07:04,539 WARN L191 SmtUtils]: Spent 477.00 ms on a formula simplification. DAG size of input: 146 DAG size of output: 123 [2019-11-15 21:07:04,811 WARN L191 SmtUtils]: Spent 247.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 91 [2019-11-15 21:07:04,811 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:07:04,814 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:07:04,815 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:07:04,817 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:07:04,819 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:07:04,821 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:07:04,823 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:07:04,825 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:07:04,832 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:07:05,166 WARN L191 SmtUtils]: Spent 181.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 53 [2019-11-15 21:07:07,793 WARN L191 SmtUtils]: Spent 2.45 s on a formula simplification. DAG size of input: 80 DAG size of output: 80 [2019-11-15 21:07:08,073 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-15 21:07:08,078 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-11-15 21:07:08,080 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 21:07:08,081 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:07:08,082 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 21:07:08,082 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:07:08,083 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:07:08,083 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 21:07:08,085 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 21:07:08,085 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 21:07:08,087 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:07:08,087 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 21:07:08,088 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:07:08,088 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:07:08,089 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:07:08,089 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 21:07:08,091 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 21:07:08,091 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 21:07:08,094 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:07:08,095 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 21:07:08,096 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:07:08,096 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 21:07:08,096 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:07:08,096 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:07:08,096 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 21:07:08,097 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 21:07:08,097 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 21:07:08,098 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:07:08,098 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 21:07:08,099 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:07:08,099 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 21:07:08,099 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:07:08,100 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:07:08,100 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 21:07:08,100 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 21:07:08,100 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 21:07:08,101 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:07:08,102 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 21:07:08,102 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:07:08,102 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 21:07:08,103 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:07:08,103 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:07:08,103 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 21:07:08,104 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 21:07:08,104 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 21:07:08,104 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:07:08,105 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 21:07:08,106 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:07:08,106 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:07:08,106 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:07:08,106 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 21:07:08,108 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 21:07:08,108 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 21:07:08,110 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:07:08,111 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 21:07:08,112 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:07:08,112 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 21:07:08,112 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:07:08,112 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:07:08,112 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 21:07:08,113 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 21:07:08,113 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 21:07:08,114 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:07:08,114 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 21:07:08,115 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:07:08,115 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 21:07:08,115 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:07:08,115 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:07:08,116 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 21:07:08,116 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 21:07:08,116 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 21:07:08,117 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:07:08,118 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 21:07:08,118 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:07:08,118 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 21:07:08,119 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:07:08,119 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:07:08,119 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 21:07:08,119 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 21:07:08,120 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 21:07:08,121 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:07:08,121 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 21:07:08,122 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:07:08,122 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 21:07:08,122 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:07:08,122 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:07:08,122 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 21:07:08,123 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 21:07:08,123 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 21:07:08,124 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:07:08,124 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 21:07:08,125 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:07:08,125 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:07:08,125 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:07:08,125 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 21:07:08,127 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 21:07:08,127 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 21:07:08,131 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:07:08,131 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 21:07:08,132 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:07:08,133 INFO L202 nArgumentSynthesizer]: 32 stem disjuncts [2019-11-15 21:07:08,133 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:07:08,133 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 21:07:08,166 INFO L400 nArgumentSynthesizer]: We have 68 Motzkin's Theorem applications. [2019-11-15 21:07:08,166 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 21:07:08,358 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:07:08,359 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 21:07:08,359 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:07:08,360 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:07:08,360 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:07:08,360 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 21:07:08,361 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 21:07:08,361 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 21:07:08,363 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:07:08,364 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 21:07:08,365 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:07:08,366 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:07:08,366 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:07:08,366 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 21:07:08,367 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 21:07:08,367 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 21:07:08,374 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:07:08,375 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 21:07:08,375 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:07:08,375 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:07:08,375 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:07:08,376 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 21:07:08,377 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 21:07:08,377 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 21:07:08,382 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:07:08,383 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 21:07:08,383 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:07:08,384 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:07:08,384 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:07:08,384 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 21:07:08,386 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 21:07:08,387 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 21:07:08,389 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:07:08,392 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 21:07:08,393 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:07:08,394 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:07:08,394 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:07:08,394 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 21:07:08,401 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 21:07:08,401 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 21:07:08,403 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:07:08,404 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 21:07:08,404 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:07:08,405 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:07:08,405 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:07:08,410 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 21:07:08,411 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 21:07:08,412 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 21:07:08,414 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:07:08,414 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 21:07:08,415 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:07:08,416 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:07:08,416 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:07:08,416 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 21:07:08,421 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 21:07:08,421 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 21:07:08,458 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:07:08,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-11-15 21:07:08,461 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:07:08,461 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:07:08,461 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:07:08,461 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 21:07:08,463 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 21:07:08,463 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 21:07:08,481 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:07:08,481 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 21:07:08,482 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:07:08,482 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:07:08,482 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:07:08,482 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 21:07:08,486 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 21:07:08,494 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 21:07:08,546 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-15 21:07:08,613 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2019-11-15 21:07:08,613 INFO L444 ModelExtractionUtils]: 41 out of 52 variables were initially zero. Simplification set additionally 8 variables to zero. [2019-11-15 21:07:08,615 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-15 21:07:08,616 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-11-15 21:07:08,617 INFO L510 LassoAnalysis]: Proved termination. [2019-11-15 21:07:08,617 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_test_fun_~k_ref~0.base) ULTIMATE.start_test_fun_~k_ref~0.offset)_1) = 2*v_rep(select (select #memory_int ULTIMATE.start_test_fun_~k_ref~0.base) ULTIMATE.start_test_fun_~k_ref~0.offset)_1 + 4294967295 Supporting invariants [] [2019-11-15 21:07:09,006 INFO L297 tatePredicateManager]: 58 out of 64 supporting invariants were superfluous and have been removed [2019-11-15 21:07:09,023 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-11-15 21:07:09,060 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:07:09,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:07:09,100 INFO L256 TraceCheckSpWp]: Trace formula consists of 96 conjuncts, 14 conjunts are in the unsatisfiable core [2019-11-15 21:07:09,102 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 21:07:09,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:07:09,130 INFO L256 TraceCheckSpWp]: Trace formula consists of 53 conjuncts, 15 conjunts are in the unsatisfiable core [2019-11-15 21:07:09,132 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 21:07:09,142 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:07:09,208 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 21:07:09,222 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2019-11-15 21:07:09,223 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 12 states. Second operand 4 states. [2019-11-15 21:07:09,339 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 12 states.. Second operand 4 states. Result 23 states and 29 transitions. Complement of second has 8 states. [2019-11-15 21:07:09,339 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2019-11-15 21:07:09,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-11-15 21:07:09,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 15 transitions. [2019-11-15 21:07:09,343 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 15 transitions. Stem has 2 letters. Loop has 5 letters. [2019-11-15 21:07:09,344 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 21:07:09,344 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 15 transitions. Stem has 7 letters. Loop has 5 letters. [2019-11-15 21:07:09,344 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 21:07:09,344 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 15 transitions. Stem has 2 letters. Loop has 10 letters. [2019-11-15 21:07:09,345 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 21:07:09,345 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 23 states and 29 transitions. [2019-11-15 21:07:09,350 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-11-15 21:07:09,353 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 23 states to 0 states and 0 transitions. [2019-11-15 21:07:09,354 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2019-11-15 21:07:09,354 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2019-11-15 21:07:09,354 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2019-11-15 21:07:09,355 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-15 21:07:09,355 INFO L688 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-15 21:07:09,356 INFO L711 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-15 21:07:09,356 INFO L591 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-15 21:07:09,356 INFO L424 BuchiCegarLoop]: ======== Iteration 2============ [2019-11-15 21:07:09,356 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2019-11-15 21:07:09,356 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-11-15 21:07:09,357 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2019-11-15 21:07:09,362 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 15.11 09:07:09 BoogieIcfgContainer [2019-11-15 21:07:09,362 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2019-11-15 21:07:09,363 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-15 21:07:09,363 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-15 21:07:09,363 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-15 21:07:09,364 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 09:07:00" (3/4) ... [2019-11-15 21:07:09,366 INFO L140 WitnessPrinter]: No result that supports witness generation found [2019-11-15 21:07:09,367 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-15 21:07:09,369 INFO L168 Benchmark]: Toolchain (without parser) took 9905.84 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 241.2 MB). Free memory was 943.4 MB in the beginning and 1.0 GB in the end (delta: -58.0 MB). Peak memory consumption was 183.1 MB. Max. memory is 11.5 GB. [2019-11-15 21:07:09,369 INFO L168 Benchmark]: CDTParser took 0.44 ms. Allocated memory is still 1.0 GB. Free memory is still 967.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-15 21:07:09,370 INFO L168 Benchmark]: CACSL2BoogieTranslator took 429.83 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 163.1 MB). Free memory was 943.4 MB in the beginning and 1.1 GB in the end (delta: -203.5 MB). Peak memory consumption was 18.2 MB. Max. memory is 11.5 GB. [2019-11-15 21:07:09,371 INFO L168 Benchmark]: Boogie Procedure Inliner took 42.97 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: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 11.5 GB. [2019-11-15 21:07:09,372 INFO L168 Benchmark]: Boogie Preprocessor took 26.39 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2019-11-15 21:07:09,373 INFO L168 Benchmark]: RCFGBuilder took 363.65 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: 22.4 MB). Peak memory consumption was 22.4 MB. Max. memory is 11.5 GB. [2019-11-15 21:07:09,374 INFO L168 Benchmark]: BuchiAutomizer took 9034.27 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 78.1 MB). Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 116.4 MB). Peak memory consumption was 194.5 MB. Max. memory is 11.5 GB. [2019-11-15 21:07:09,374 INFO L168 Benchmark]: Witness Printer took 3.77 ms. Allocated memory is still 1.3 GB. Free memory is still 1.0 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-15 21:07:09,383 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.44 ms. Allocated memory is still 1.0 GB. Free memory is still 967.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 429.83 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 163.1 MB). Free memory was 943.4 MB in the beginning and 1.1 GB in the end (delta: -203.5 MB). Peak memory consumption was 18.2 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 42.97 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: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 26.39 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 363.65 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: 22.4 MB). Peak memory consumption was 22.4 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 9034.27 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 78.1 MB). Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 116.4 MB). Peak memory consumption was 194.5 MB. Max. memory is 11.5 GB. * Witness Printer took 3.77 ms. Allocated memory is still 1.3 GB. Free memory is still 1.0 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 1 terminating modules (0 trivial, 1 deterministic, 0 nondeterministic). One deterministic module has affine ranking function 2 * unknown-#memory_int-unknown[k_ref][k_ref] + 4294967295 and consists of 5 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 8.9s and 2 iterations. TraceHistogramMax:1. Analysis of lassos took 8.6s. Construction of modules took 0.0s. Büchi inclusion checks took 0.2s. Highest rank in rank-based complementation 3. Minimization of det autom 1. Minimization of nondet autom 0. Automata minimization No data available. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 0 states and ocurred in iteration 1. Nontrivial modules had stage [1, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 5 SDtfs, 5 SDslu, 4 SDs, 0 SdLazy, 17 SolverSat, 6 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc0 concLT0 SILN0 SILU0 SILI0 SILT0 lasso1 LassoPreprocessingBenchmarks: Lassos: inital1067 mio100 ax101 hnf100 lsp97 ukn28 mio100 lsp36 div100 bol100 ite100 ukn100 eq192 hnf87 smp96 dnf1211 smp89 tf100 neg91 sie127 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 226ms VariablesStem: 11 VariablesLoop: 10 DisjunctsStem: 32 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 68 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...