./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/termination-memory-alloca/Ben-Amram-2010LMCS-Ex2.3-alloca_true-termination.c.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 635dfa2a Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_41b4fb8e-dbc5-497d-ad27-664a79a2e78b/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_41b4fb8e-dbc5-497d-ad27-664a79a2e78b/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_41b4fb8e-dbc5-497d-ad27-664a79a2e78b/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_41b4fb8e-dbc5-497d-ad27-664a79a2e78b/bin-2019/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/termination-memory-alloca/Ben-Amram-2010LMCS-Ex2.3-alloca_true-termination.c.i -s /tmp/vcloud-vcloud-master/worker/working_dir_41b4fb8e-dbc5-497d-ad27-664a79a2e78b/bin-2019/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_41b4fb8e-dbc5-497d-ad27-664a79a2e78b/bin-2019/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 4ab4fc7901859c456c176827e7d5fcf9e4988b17 ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-635dfa2 [2018-12-09 15:06:40,343 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-09 15:06:40,344 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-09 15:06:40,350 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-09 15:06:40,350 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-09 15:06:40,350 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-09 15:06:40,351 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-09 15:06:40,352 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-09 15:06:40,352 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-09 15:06:40,353 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-09 15:06:40,353 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-09 15:06:40,353 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-09 15:06:40,354 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-09 15:06:40,354 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-09 15:06:40,355 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-09 15:06:40,355 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-09 15:06:40,355 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-09 15:06:40,356 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-09 15:06:40,357 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-09 15:06:40,358 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-09 15:06:40,359 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-09 15:06:40,359 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-09 15:06:40,360 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-09 15:06:40,360 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-09 15:06:40,360 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-09 15:06:40,361 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-09 15:06:40,361 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-09 15:06:40,362 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-09 15:06:40,362 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-09 15:06:40,363 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-09 15:06:40,363 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-09 15:06:40,363 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-09 15:06:40,363 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-09 15:06:40,363 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-09 15:06:40,364 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-09 15:06:40,364 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-09 15:06:40,364 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_41b4fb8e-dbc5-497d-ad27-664a79a2e78b/bin-2019/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf [2018-12-09 15:06:40,373 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-09 15:06:40,373 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-09 15:06:40,374 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-09 15:06:40,374 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-09 15:06:40,374 INFO L133 SettingsManager]: * Use SBE=true [2018-12-09 15:06:40,375 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-12-09 15:06:40,375 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-12-09 15:06:40,375 INFO L133 SettingsManager]: * Use old map elimination=false [2018-12-09 15:06:40,375 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-12-09 15:06:40,375 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-12-09 15:06:40,375 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-12-09 15:06:40,376 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-09 15:06:40,376 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-12-09 15:06:40,376 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-09 15:06:40,376 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-09 15:06:40,376 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-12-09 15:06:40,376 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-12-09 15:06:40,376 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-12-09 15:06:40,377 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-09 15:06:40,377 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-12-09 15:06:40,377 INFO L133 SettingsManager]: * Use constant arrays=true [2018-12-09 15:06:40,377 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-12-09 15:06:40,377 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-09 15:06:40,377 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-09 15:06:40,377 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-12-09 15:06:40,378 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-09 15:06:40,378 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-12-09 15:06:40,378 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-12-09 15:06:40,379 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-12-09 15:06:40,379 INFO L133 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_41b4fb8e-dbc5-497d-ad27-664a79a2e78b/bin-2019/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 -> 4ab4fc7901859c456c176827e7d5fcf9e4988b17 [2018-12-09 15:06:40,398 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-09 15:06:40,407 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-09 15:06:40,410 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-09 15:06:40,411 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-09 15:06:40,411 INFO L276 PluginConnector]: CDTParser initialized [2018-12-09 15:06:40,411 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_41b4fb8e-dbc5-497d-ad27-664a79a2e78b/bin-2019/uautomizer/../../sv-benchmarks/c/termination-memory-alloca/Ben-Amram-2010LMCS-Ex2.3-alloca_true-termination.c.i [2018-12-09 15:06:40,451 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_41b4fb8e-dbc5-497d-ad27-664a79a2e78b/bin-2019/uautomizer/data/d8079ef4c/3618f48eb69848b7b6033904c4277a8a/FLAGc0d078117 [2018-12-09 15:06:40,774 INFO L307 CDTParser]: Found 1 translation units. [2018-12-09 15:06:40,775 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_41b4fb8e-dbc5-497d-ad27-664a79a2e78b/sv-benchmarks/c/termination-memory-alloca/Ben-Amram-2010LMCS-Ex2.3-alloca_true-termination.c.i [2018-12-09 15:06:40,780 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_41b4fb8e-dbc5-497d-ad27-664a79a2e78b/bin-2019/uautomizer/data/d8079ef4c/3618f48eb69848b7b6033904c4277a8a/FLAGc0d078117 [2018-12-09 15:06:41,193 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_41b4fb8e-dbc5-497d-ad27-664a79a2e78b/bin-2019/uautomizer/data/d8079ef4c/3618f48eb69848b7b6033904c4277a8a [2018-12-09 15:06:41,195 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-09 15:06:41,196 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-09 15:06:41,197 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-09 15:06:41,197 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-09 15:06:41,201 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-09 15:06:41,201 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 03:06:41" (1/1) ... [2018-12-09 15:06:41,204 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@54cb9e92 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 03:06:41, skipping insertion in model container [2018-12-09 15:06:41,204 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 03:06:41" (1/1) ... [2018-12-09 15:06:41,210 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-09 15:06:41,234 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-09 15:06:41,393 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-09 15:06:41,401 INFO L191 MainTranslator]: Completed pre-run [2018-12-09 15:06:41,459 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-09 15:06:41,489 INFO L195 MainTranslator]: Completed translation [2018-12-09 15:06:41,489 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 03:06:41 WrapperNode [2018-12-09 15:06:41,489 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-09 15:06:41,490 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-09 15:06:41,490 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-09 15:06:41,490 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-09 15:06:41,495 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 03:06:41" (1/1) ... [2018-12-09 15:06:41,502 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 03:06:41" (1/1) ... [2018-12-09 15:06:41,514 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-09 15:06:41,514 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-09 15:06:41,514 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-09 15:06:41,514 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-09 15:06:41,519 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 03:06:41" (1/1) ... [2018-12-09 15:06:41,520 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 03:06:41" (1/1) ... [2018-12-09 15:06:41,521 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 03:06:41" (1/1) ... [2018-12-09 15:06:41,521 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 03:06:41" (1/1) ... [2018-12-09 15:06:41,523 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 03:06:41" (1/1) ... [2018-12-09 15:06:41,526 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 03:06:41" (1/1) ... [2018-12-09 15:06:41,526 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 03:06:41" (1/1) ... [2018-12-09 15:06:41,527 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-09 15:06:41,528 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-09 15:06:41,528 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-09 15:06:41,528 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-09 15:06:41,528 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 03:06:41" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_41b4fb8e-dbc5-497d-ad27-664a79a2e78b/bin-2019/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 [2018-12-09 15:06:41,559 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-12-09 15:06:41,559 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-12-09 15:06:41,559 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-12-09 15:06:41,559 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-12-09 15:06:41,559 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-09 15:06:41,559 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-09 15:06:41,694 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-09 15:06:41,694 INFO L280 CfgBuilder]: Removed 5 assue(true) statements. [2018-12-09 15:06:41,694 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 03:06:41 BoogieIcfgContainer [2018-12-09 15:06:41,694 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-09 15:06:41,695 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-12-09 15:06:41,695 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-12-09 15:06:41,699 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-12-09 15:06:41,700 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-12-09 15:06:41,700 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 09.12 03:06:41" (1/3) ... [2018-12-09 15:06:41,700 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@19d584de and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 09.12 03:06:41, skipping insertion in model container [2018-12-09 15:06:41,700 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-12-09 15:06:41,701 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 03:06:41" (2/3) ... [2018-12-09 15:06:41,701 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@19d584de and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 09.12 03:06:41, skipping insertion in model container [2018-12-09 15:06:41,701 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-12-09 15:06:41,701 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 03:06:41" (3/3) ... [2018-12-09 15:06:41,702 INFO L375 chiAutomizerObserver]: Analyzing ICFG Ben-Amram-2010LMCS-Ex2.3-alloca_true-termination.c.i [2018-12-09 15:06:41,733 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-12-09 15:06:41,734 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-12-09 15:06:41,734 INFO L375 BuchiCegarLoop]: Hoare is false [2018-12-09 15:06:41,734 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-12-09 15:06:41,734 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-09 15:06:41,734 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-09 15:06:41,734 INFO L379 BuchiCegarLoop]: Difference is false [2018-12-09 15:06:41,734 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-09 15:06:41,734 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-12-09 15:06:41,742 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 12 states. [2018-12-09 15:06:41,755 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2018-12-09 15:06:41,755 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-09 15:06:41,755 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-09 15:06:41,759 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-12-09 15:06:41,759 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2018-12-09 15:06:41,759 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-12-09 15:06:41,759 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 12 states. [2018-12-09 15:06:41,760 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2018-12-09 15:06:41,760 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-09 15:06:41,760 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-09 15:06:41,760 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-12-09 15:06:41,760 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2018-12-09 15:06:41,765 INFO L794 eck$LassoCheckResult]: Stem: 7#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 3#L-1true havoc main_#res;havoc main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~malloc3.base, main_#t~malloc3.offset, main_#t~malloc4.base, main_#t~malloc4.offset, main_#t~nondet5, main_#t~nondet6, main_#t~nondet7, main_#t~mem13, main_#t~mem14, main_#t~mem15, main_#t~nondet16, main_#t~mem17, main_#t~mem18, main_#t~nondet19, main_#t~mem20, main_#t~mem8, main_#t~mem9, main_#t~short10, main_#t~mem11, main_#t~short12, main_~x~0.base, main_~x~0.offset, main_~y~0.base, main_~y~0.offset, main_~z~0.base, main_~z~0.offset;call main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.alloc(4);main_~x~0.base, main_~x~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset;call main_#t~malloc3.base, main_#t~malloc3.offset := #Ultimate.alloc(4);main_~y~0.base, main_~y~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset;call main_#t~malloc4.base, main_#t~malloc4.offset := #Ultimate.alloc(4);main_~z~0.base, main_~z~0.offset := main_#t~malloc4.base, main_#t~malloc4.offset;call write~int(main_#t~nondet5, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~nondet5;call write~int(main_#t~nondet6, main_~y~0.base, main_~y~0.offset, 4);havoc main_#t~nondet6;call write~int(main_#t~nondet7, main_~z~0.base, main_~z~0.offset, 4);havoc main_#t~nondet7; 5#L555-2true [2018-12-09 15:06:41,765 INFO L796 eck$LassoCheckResult]: Loop: 5#L555-2true call main_#t~mem8 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~short10 := main_#t~mem8 > 0; 6#L554-1true assume main_#t~short10;call main_#t~mem9 := read~int(main_~y~0.base, main_~y~0.offset, 4);main_#t~short10 := main_#t~mem9 > 0; 9#L554-3true main_#t~short12 := main_#t~short10; 11#L554-4true assume main_#t~short12;call main_#t~mem11 := read~int(main_~z~0.base, main_~z~0.offset, 4);main_#t~short12 := main_#t~mem11 > 0; 4#L554-6true assume !!main_#t~short12;havoc main_#t~mem11;havoc main_#t~short12;havoc main_#t~short10;havoc main_#t~mem8;havoc main_#t~mem9;call main_#t~mem13 := read~int(main_~y~0.base, main_~y~0.offset, 4);call main_#t~mem14 := read~int(main_~x~0.base, main_~x~0.offset, 4); 12#L555true assume main_#t~mem13 > main_#t~mem14;havoc main_#t~mem13;havoc main_#t~mem14;call main_#t~mem15 := read~int(main_~z~0.base, main_~z~0.offset, 4);call write~int(main_#t~mem15, main_~y~0.base, main_~y~0.offset, 4);havoc main_#t~mem15;call write~int(main_#t~nondet16, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~nondet16;call main_#t~mem17 := read~int(main_~x~0.base, main_~x~0.offset, 4);call write~int(main_#t~mem17 - 1, main_~z~0.base, main_~z~0.offset, 4);havoc main_#t~mem17; 5#L555-2true [2018-12-09 15:06:41,769 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 15:06:41,769 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2018-12-09 15:06:41,770 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 15:06:41,771 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 15:06:41,803 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 15:06:41,803 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 15:06:41,804 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 15:06:41,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 15:06:41,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 15:06:41,856 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 15:06:41,857 INFO L82 PathProgramCache]: Analyzing trace with hash 1097577162, now seen corresponding path program 1 times [2018-12-09 15:06:41,857 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 15:06:41,857 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 15:06:41,858 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 15:06:41,858 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 15:06:41,858 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 15:06:41,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 15:06:41,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 15:06:41,878 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 15:06:41,879 INFO L82 PathProgramCache]: Analyzing trace with hash 177626380, now seen corresponding path program 1 times [2018-12-09 15:06:41,879 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 15:06:41,879 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 15:06:41,880 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 15:06:41,880 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 15:06:41,880 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 15:06:41,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 15:06:41,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 15:06:42,090 WARN L180 SmtUtils]: Spent 171.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 67 [2018-12-09 15:06:42,267 WARN L180 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 77 [2018-12-09 15:06:42,326 INFO L216 LassoAnalysis]: Preferences: [2018-12-09 15:06:42,327 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-09 15:06:42,327 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-09 15:06:42,327 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-09 15:06:42,327 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-12-09 15:06:42,327 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-09 15:06:42,327 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-09 15:06:42,328 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-09 15:06:42,328 INFO L131 ssoRankerPreferences]: Filename of dumped script: Ben-Amram-2010LMCS-Ex2.3-alloca_true-termination.c.i_Iteration1_Lasso [2018-12-09 15:06:42,328 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-09 15:06:42,328 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-09 15:06:42,342 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 15:06:42,346 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 15:06:42,349 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 15:06:42,351 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 15:06:42,352 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 15:06:42,353 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 15:06:42,354 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 15:06:42,356 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 15:06:42,358 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 15:06:42,359 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 15:06:42,360 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 15:06:42,362 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 15:06:42,364 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 15:06:42,365 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 15:06:42,367 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 15:06:42,368 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 15:06:42,369 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 15:06:42,371 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 15:06:42,372 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 15:06:42,374 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 15:06:42,375 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 15:06:42,627 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 15:06:42,953 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-09 15:06:42,956 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-12-09 15:06:42,957 INFO L122 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 [2018-12-09 15:06:42,958 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 15:06:42,958 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 15:06:42,958 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 15:06:42,958 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 15:06:42,959 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 15:06:42,960 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 15:06:42,960 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 15:06:42,961 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 15:06:42,961 INFO L122 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 [2018-12-09 15:06:42,962 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 15:06:42,962 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 15:06:42,962 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 15:06:42,962 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 15:06:42,962 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 15:06:42,962 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 15:06:42,962 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 15:06:42,963 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 15:06:42,963 INFO L122 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 [2018-12-09 15:06:42,963 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 15:06:42,963 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 15:06:42,963 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 15:06:42,964 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 15:06:42,964 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 15:06:42,964 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 15:06:42,964 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 15:06:42,964 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 15:06:42,965 INFO L122 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 [2018-12-09 15:06:42,965 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 15:06:42,965 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 15:06:42,965 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 15:06:42,965 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 15:06:42,965 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 15:06:42,966 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 15:06:42,966 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 15:06:42,966 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 15:06:42,966 INFO L122 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 [2018-12-09 15:06:42,966 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 15:06:42,967 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 15:06:42,967 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 15:06:42,967 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 15:06:42,967 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 15:06:42,967 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 15:06:42,967 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 15:06:42,968 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 15:06:42,968 INFO L122 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 [2018-12-09 15:06:42,968 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 15:06:42,968 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 15:06:42,968 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 15:06:42,968 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 15:06:42,968 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 15:06:42,969 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 15:06:42,969 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 15:06:42,969 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 15:06:42,969 INFO L122 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 [2018-12-09 15:06:42,970 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 15:06:42,970 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 15:06:42,970 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 15:06:42,970 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 15:06:42,970 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 15:06:42,970 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 15:06:42,970 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 15:06:42,971 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 15:06:42,971 INFO L122 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 [2018-12-09 15:06:42,971 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 15:06:42,971 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 15:06:42,971 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 15:06:42,971 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 15:06:42,972 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 15:06:42,973 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 15:06:42,974 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 15:06:42,975 INFO L122 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 [2018-12-09 15:06:42,975 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 15:06:42,975 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 15:06:42,975 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 15:06:42,975 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 15:06:42,975 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 15:06:42,975 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 15:06:42,975 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 15:06:42,976 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 15:06:42,976 INFO L122 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 [2018-12-09 15:06:42,976 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 15:06:42,976 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 15:06:42,976 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 15:06:42,976 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 15:06:42,977 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 15:06:42,977 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 15:06:42,977 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 15:06:42,977 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 15:06:42,978 INFO L122 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 [2018-12-09 15:06:42,978 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 15:06:42,978 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 15:06:42,978 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 15:06:42,978 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 15:06:42,979 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 15:06:42,979 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 15:06:42,982 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 15:06:42,982 INFO L122 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 [2018-12-09 15:06:42,982 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 15:06:42,983 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 15:06:42,983 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 15:06:42,983 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 15:06:42,983 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 15:06:42,983 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 15:06:42,985 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 15:06:42,985 INFO L122 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 [2018-12-09 15:06:42,986 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 15:06:42,986 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 15:06:42,986 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 15:06:42,986 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 15:06:42,986 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 15:06:42,986 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 15:06:42,986 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 15:06:42,987 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 15:06:42,987 INFO L122 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 [2018-12-09 15:06:42,987 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 15:06:42,987 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 15:06:42,988 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 15:06:42,988 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 15:06:42,988 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 15:06:42,988 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 15:06:42,988 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 15:06:42,988 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 15:06:42,989 INFO L122 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 [2018-12-09 15:06:42,989 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 15:06:42,989 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 15:06:42,989 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 15:06:42,989 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 15:06:42,989 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 15:06:42,989 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 15:06:42,989 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 15:06:42,990 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 15:06:42,990 INFO L122 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 [2018-12-09 15:06:42,990 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 15:06:42,990 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 15:06:42,990 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 15:06:42,991 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 15:06:42,991 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 15:06:42,991 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 15:06:42,993 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 15:06:42,993 INFO L122 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 [2018-12-09 15:06:42,994 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 15:06:42,994 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 15:06:42,994 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 15:06:42,994 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 15:06:42,994 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 15:06:42,994 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 15:06:42,994 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 15:06:42,995 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 15:06:42,995 INFO L122 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 [2018-12-09 15:06:42,995 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 15:06:42,995 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 15:06:42,995 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 15:06:42,996 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 15:06:42,996 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 15:06:42,996 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 15:06:42,996 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 15:06:42,996 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 15:06:42,997 INFO L122 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 [2018-12-09 15:06:42,997 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 15:06:42,997 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 15:06:42,997 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 15:06:42,997 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 15:06:42,997 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 15:06:42,997 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 15:06:42,997 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 15:06:42,998 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 15:06:42,998 INFO L122 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 [2018-12-09 15:06:42,999 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 15:06:42,999 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 15:06:42,999 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 15:06:42,999 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 15:06:43,000 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 15:06:43,000 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 15:06:43,002 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 15:06:43,002 INFO L122 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 [2018-12-09 15:06:43,003 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 15:06:43,003 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-12-09 15:06:43,003 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 15:06:43,003 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 15:06:43,004 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-12-09 15:06:43,004 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 15:06:43,009 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 15:06:43,009 INFO L122 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 [2018-12-09 15:06:43,010 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 15:06:43,010 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 15:06:43,010 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 15:06:43,010 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 15:06:43,011 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 15:06:43,011 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 15:06:43,016 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 15:06:43,016 INFO L122 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 [2018-12-09 15:06:43,017 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 15:06:43,017 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-12-09 15:06:43,017 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 15:06:43,017 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 15:06:43,018 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-12-09 15:06:43,018 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 15:06:43,022 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 15:06:43,023 INFO L122 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 [2018-12-09 15:06:43,023 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 15:06:43,023 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 15:06:43,023 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 15:06:43,023 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 15:06:43,024 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 15:06:43,024 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 15:06:43,029 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 15:06:43,029 INFO L122 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 [2018-12-09 15:06:43,029 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 15:06:43,030 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 15:06:43,030 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 15:06:43,030 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 15:06:43,030 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 15:06:43,030 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 15:06:43,032 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 15:06:43,032 INFO L122 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 [2018-12-09 15:06:43,032 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 15:06:43,032 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-12-09 15:06:43,032 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 15:06:43,032 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 15:06:43,033 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-12-09 15:06:43,033 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 15:06:43,037 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 15:06:43,037 INFO L122 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 [2018-12-09 15:06:43,038 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 15:06:43,038 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 15:06:43,038 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 15:06:43,038 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 15:06:43,040 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 15:06:43,040 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 15:06:43,052 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 15:06:43,052 INFO L122 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 [2018-12-09 15:06:43,053 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 15:06:43,053 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 15:06:43,053 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 15:06:43,053 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 15:06:43,054 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 15:06:43,054 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 15:06:43,057 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 15:06:43,058 INFO L122 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 [2018-12-09 15:06:43,058 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 15:06:43,058 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 15:06:43,058 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 15:06:43,058 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 15:06:43,059 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 15:06:43,059 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 15:06:43,072 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-12-09 15:06:43,080 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2018-12-09 15:06:43,080 INFO L444 ModelExtractionUtils]: 11 out of 16 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-12-09 15:06:43,081 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-12-09 15:06:43,082 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-12-09 15:06:43,082 INFO L518 LassoAnalysis]: Proved termination. [2018-12-09 15:06:43,083 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_main_~x~0.base) ULTIMATE.start_main_~x~0.offset)_1, v_rep(select (select #memory_int ULTIMATE.start_main_~z~0.base) ULTIMATE.start_main_~z~0.offset)_1, v_rep(select (select #memory_int ULTIMATE.start_main_~y~0.base) ULTIMATE.start_main_~y~0.offset)_1) = -1*v_rep(select (select #memory_int ULTIMATE.start_main_~x~0.base) ULTIMATE.start_main_~x~0.offset)_1 + 1*v_rep(select (select #memory_int ULTIMATE.start_main_~z~0.base) ULTIMATE.start_main_~z~0.offset)_1 + 1*v_rep(select (select #memory_int ULTIMATE.start_main_~y~0.base) ULTIMATE.start_main_~y~0.offset)_1 Supporting invariants [] [2018-12-09 15:06:43,158 INFO L297 tatePredicateManager]: 23 out of 24 supporting invariants were superfluous and have been removed [2018-12-09 15:06:43,164 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-09 15:06:43,164 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-09 15:06:43,165 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-09 15:06:43,184 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 15:06:43,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 15:06:43,197 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 15:06:43,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 15:06:43,210 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 15:06:43,252 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 15:06:43,262 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 [2018-12-09 15:06:43,263 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 12 states. Second operand 5 states. [2018-12-09 15:06:43,339 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 12 states.. Second operand 5 states. Result 36 states and 47 transitions. Complement of second has 10 states. [2018-12-09 15:06:43,340 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 1 stem states 3 non-accepting loop states 1 accepting loop states [2018-12-09 15:06:43,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-12-09 15:06:43,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 18 transitions. [2018-12-09 15:06:43,343 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 18 transitions. Stem has 2 letters. Loop has 6 letters. [2018-12-09 15:06:43,343 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-09 15:06:43,344 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 18 transitions. Stem has 8 letters. Loop has 6 letters. [2018-12-09 15:06:43,344 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-09 15:06:43,344 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 18 transitions. Stem has 2 letters. Loop has 12 letters. [2018-12-09 15:06:43,344 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-09 15:06:43,345 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 36 states and 47 transitions. [2018-12-09 15:06:43,347 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2018-12-09 15:06:43,350 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 36 states to 20 states and 29 transitions. [2018-12-09 15:06:43,351 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 13 [2018-12-09 15:06:43,351 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 14 [2018-12-09 15:06:43,352 INFO L73 IsDeterministic]: Start isDeterministic. Operand 20 states and 29 transitions. [2018-12-09 15:06:43,352 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-09 15:06:43,352 INFO L705 BuchiCegarLoop]: Abstraction has 20 states and 29 transitions. [2018-12-09 15:06:43,364 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states and 29 transitions. [2018-12-09 15:06:43,370 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2018-12-09 15:06:43,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-12-09 15:06:43,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 29 transitions. [2018-12-09 15:06:43,371 INFO L728 BuchiCegarLoop]: Abstraction has 20 states and 29 transitions. [2018-12-09 15:06:43,371 INFO L608 BuchiCegarLoop]: Abstraction has 20 states and 29 transitions. [2018-12-09 15:06:43,371 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-12-09 15:06:43,371 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 20 states and 29 transitions. [2018-12-09 15:06:43,372 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2018-12-09 15:06:43,372 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-09 15:06:43,372 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-09 15:06:43,373 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 15:06:43,373 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2018-12-09 15:06:43,373 INFO L794 eck$LassoCheckResult]: Stem: 218#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 209#L-1 havoc main_#res;havoc main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~malloc3.base, main_#t~malloc3.offset, main_#t~malloc4.base, main_#t~malloc4.offset, main_#t~nondet5, main_#t~nondet6, main_#t~nondet7, main_#t~mem13, main_#t~mem14, main_#t~mem15, main_#t~nondet16, main_#t~mem17, main_#t~mem18, main_#t~nondet19, main_#t~mem20, main_#t~mem8, main_#t~mem9, main_#t~short10, main_#t~mem11, main_#t~short12, main_~x~0.base, main_~x~0.offset, main_~y~0.base, main_~y~0.offset, main_~z~0.base, main_~z~0.offset;call main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.alloc(4);main_~x~0.base, main_~x~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset;call main_#t~malloc3.base, main_#t~malloc3.offset := #Ultimate.alloc(4);main_~y~0.base, main_~y~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset;call main_#t~malloc4.base, main_#t~malloc4.offset := #Ultimate.alloc(4);main_~z~0.base, main_~z~0.offset := main_#t~malloc4.base, main_#t~malloc4.offset;call write~int(main_#t~nondet5, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~nondet5;call write~int(main_#t~nondet6, main_~y~0.base, main_~y~0.offset, 4);havoc main_#t~nondet6;call write~int(main_#t~nondet7, main_~z~0.base, main_~z~0.offset, 4);havoc main_#t~nondet7; 210#L555-2 call main_#t~mem8 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~short10 := main_#t~mem8 > 0; 215#L554-1 assume !main_#t~short10; 216#L554-3 main_#t~short12 := main_#t~short10; 219#L554-4 assume !main_#t~short12; 205#L554-6 assume !!main_#t~short12;havoc main_#t~mem11;havoc main_#t~short12;havoc main_#t~short10;havoc main_#t~mem8;havoc main_#t~mem9;call main_#t~mem13 := read~int(main_~y~0.base, main_~y~0.offset, 4);call main_#t~mem14 := read~int(main_~x~0.base, main_~x~0.offset, 4); 206#L555 assume !(main_#t~mem13 > main_#t~mem14);havoc main_#t~mem13;havoc main_#t~mem14;call main_#t~mem18 := read~int(main_~z~0.base, main_~z~0.offset, 4);call write~int(main_#t~mem18 - 1, main_~z~0.base, main_~z~0.offset, 4);havoc main_#t~mem18;call write~int(main_#t~nondet19, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~nondet19;call main_#t~mem20 := read~int(main_~x~0.base, main_~x~0.offset, 4);call write~int(main_#t~mem20 - 1, main_~y~0.base, main_~y~0.offset, 4);havoc main_#t~mem20; 211#L555-2 [2018-12-09 15:06:43,373 INFO L796 eck$LassoCheckResult]: Loop: 211#L555-2 call main_#t~mem8 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~short10 := main_#t~mem8 > 0; 212#L554-1 assume main_#t~short10;call main_#t~mem9 := read~int(main_~y~0.base, main_~y~0.offset, 4);main_#t~short10 := main_#t~mem9 > 0; 224#L554-3 main_#t~short12 := main_#t~short10; 223#L554-4 assume main_#t~short12;call main_#t~mem11 := read~int(main_~z~0.base, main_~z~0.offset, 4);main_#t~short12 := main_#t~mem11 > 0; 222#L554-6 assume !!main_#t~short12;havoc main_#t~mem11;havoc main_#t~short12;havoc main_#t~short10;havoc main_#t~mem8;havoc main_#t~mem9;call main_#t~mem13 := read~int(main_~y~0.base, main_~y~0.offset, 4);call main_#t~mem14 := read~int(main_~x~0.base, main_~x~0.offset, 4); 221#L555 assume main_#t~mem13 > main_#t~mem14;havoc main_#t~mem13;havoc main_#t~mem14;call main_#t~mem15 := read~int(main_~z~0.base, main_~z~0.offset, 4);call write~int(main_#t~mem15, main_~y~0.base, main_~y~0.offset, 4);havoc main_#t~mem15;call write~int(main_#t~nondet16, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~nondet16;call main_#t~mem17 := read~int(main_~x~0.base, main_~x~0.offset, 4);call write~int(main_#t~mem17 - 1, main_~z~0.base, main_~z~0.offset, 4);havoc main_#t~mem17; 211#L555-2 [2018-12-09 15:06:43,373 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 15:06:43,373 INFO L82 PathProgramCache]: Analyzing trace with hash 179475346, now seen corresponding path program 1 times [2018-12-09 15:06:43,373 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 15:06:43,373 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 15:06:43,374 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 15:06:43,374 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 15:06:43,374 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 15:06:43,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 15:06:43,402 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 15:06:43,403 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 15:06:43,403 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 15:06:43,405 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-12-09 15:06:43,405 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 15:06:43,405 INFO L82 PathProgramCache]: Analyzing trace with hash 1097577162, now seen corresponding path program 2 times [2018-12-09 15:06:43,405 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 15:06:43,405 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 15:06:43,406 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 15:06:43,406 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 15:06:43,406 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 15:06:43,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 15:06:43,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 15:06:43,566 WARN L180 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 67 [2018-12-09 15:06:43,601 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 15:06:43,601 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 15:06:43,602 INFO L87 Difference]: Start difference. First operand 20 states and 29 transitions. cyclomatic complexity: 11 Second operand 3 states. [2018-12-09 15:06:43,610 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 15:06:43,610 INFO L93 Difference]: Finished difference Result 23 states and 29 transitions. [2018-12-09 15:06:43,611 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 15:06:43,611 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 23 states and 29 transitions. [2018-12-09 15:06:43,612 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2018-12-09 15:06:43,612 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 23 states to 20 states and 26 transitions. [2018-12-09 15:06:43,612 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 14 [2018-12-09 15:06:43,612 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 14 [2018-12-09 15:06:43,612 INFO L73 IsDeterministic]: Start isDeterministic. Operand 20 states and 26 transitions. [2018-12-09 15:06:43,612 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-09 15:06:43,612 INFO L705 BuchiCegarLoop]: Abstraction has 20 states and 26 transitions. [2018-12-09 15:06:43,613 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states and 26 transitions. [2018-12-09 15:06:43,613 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2018-12-09 15:06:43,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-12-09 15:06:43,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 26 transitions. [2018-12-09 15:06:43,614 INFO L728 BuchiCegarLoop]: Abstraction has 20 states and 26 transitions. [2018-12-09 15:06:43,614 INFO L608 BuchiCegarLoop]: Abstraction has 20 states and 26 transitions. [2018-12-09 15:06:43,614 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-12-09 15:06:43,614 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 20 states and 26 transitions. [2018-12-09 15:06:43,614 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2018-12-09 15:06:43,614 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-09 15:06:43,614 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-09 15:06:43,615 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 15:06:43,615 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2018-12-09 15:06:43,615 INFO L794 eck$LassoCheckResult]: Stem: 267#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 254#L-1 havoc main_#res;havoc main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~malloc3.base, main_#t~malloc3.offset, main_#t~malloc4.base, main_#t~malloc4.offset, main_#t~nondet5, main_#t~nondet6, main_#t~nondet7, main_#t~mem13, main_#t~mem14, main_#t~mem15, main_#t~nondet16, main_#t~mem17, main_#t~mem18, main_#t~nondet19, main_#t~mem20, main_#t~mem8, main_#t~mem9, main_#t~short10, main_#t~mem11, main_#t~short12, main_~x~0.base, main_~x~0.offset, main_~y~0.base, main_~y~0.offset, main_~z~0.base, main_~z~0.offset;call main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.alloc(4);main_~x~0.base, main_~x~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset;call main_#t~malloc3.base, main_#t~malloc3.offset := #Ultimate.alloc(4);main_~y~0.base, main_~y~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset;call main_#t~malloc4.base, main_#t~malloc4.offset := #Ultimate.alloc(4);main_~z~0.base, main_~z~0.offset := main_#t~malloc4.base, main_#t~malloc4.offset;call write~int(main_#t~nondet5, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~nondet5;call write~int(main_#t~nondet6, main_~y~0.base, main_~y~0.offset, 4);havoc main_#t~nondet6;call write~int(main_#t~nondet7, main_~z~0.base, main_~z~0.offset, 4);havoc main_#t~nondet7; 255#L555-2 call main_#t~mem8 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~short10 := main_#t~mem8 > 0; 264#L554-1 assume !main_#t~short10; 265#L554-3 main_#t~short12 := main_#t~short10; 268#L554-4 assume main_#t~short12;call main_#t~mem11 := read~int(main_~z~0.base, main_~z~0.offset, 4);main_#t~short12 := main_#t~mem11 > 0; 256#L554-6 assume !!main_#t~short12;havoc main_#t~mem11;havoc main_#t~short12;havoc main_#t~short10;havoc main_#t~mem8;havoc main_#t~mem9;call main_#t~mem13 := read~int(main_~y~0.base, main_~y~0.offset, 4);call main_#t~mem14 := read~int(main_~x~0.base, main_~x~0.offset, 4); 257#L555 assume !(main_#t~mem13 > main_#t~mem14);havoc main_#t~mem13;havoc main_#t~mem14;call main_#t~mem18 := read~int(main_~z~0.base, main_~z~0.offset, 4);call write~int(main_#t~mem18 - 1, main_~z~0.base, main_~z~0.offset, 4);havoc main_#t~mem18;call write~int(main_#t~nondet19, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~nondet19;call main_#t~mem20 := read~int(main_~x~0.base, main_~x~0.offset, 4);call write~int(main_#t~mem20 - 1, main_~y~0.base, main_~y~0.offset, 4);havoc main_#t~mem20; 260#L555-2 [2018-12-09 15:06:43,615 INFO L796 eck$LassoCheckResult]: Loop: 260#L555-2 call main_#t~mem8 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~short10 := main_#t~mem8 > 0; 261#L554-1 assume main_#t~short10;call main_#t~mem9 := read~int(main_~y~0.base, main_~y~0.offset, 4);main_#t~short10 := main_#t~mem9 > 0; 273#L554-3 main_#t~short12 := main_#t~short10; 272#L554-4 assume main_#t~short12;call main_#t~mem11 := read~int(main_~z~0.base, main_~z~0.offset, 4);main_#t~short12 := main_#t~mem11 > 0; 271#L554-6 assume !!main_#t~short12;havoc main_#t~mem11;havoc main_#t~short12;havoc main_#t~short10;havoc main_#t~mem8;havoc main_#t~mem9;call main_#t~mem13 := read~int(main_~y~0.base, main_~y~0.offset, 4);call main_#t~mem14 := read~int(main_~x~0.base, main_~x~0.offset, 4); 270#L555 assume main_#t~mem13 > main_#t~mem14;havoc main_#t~mem13;havoc main_#t~mem14;call main_#t~mem15 := read~int(main_~z~0.base, main_~z~0.offset, 4);call write~int(main_#t~mem15, main_~y~0.base, main_~y~0.offset, 4);havoc main_#t~mem15;call write~int(main_#t~nondet16, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~nondet16;call main_#t~mem17 := read~int(main_~x~0.base, main_~x~0.offset, 4);call write~int(main_#t~mem17 - 1, main_~z~0.base, main_~z~0.offset, 4);havoc main_#t~mem17; 260#L555-2 [2018-12-09 15:06:43,615 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 15:06:43,615 INFO L82 PathProgramCache]: Analyzing trace with hash 179473424, now seen corresponding path program 1 times [2018-12-09 15:06:43,615 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 15:06:43,615 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 15:06:43,616 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 15:06:43,616 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 15:06:43,616 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 15:06:43,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 15:06:43,628 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 15:06:43,628 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 15:06:43,628 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 15:06:43,628 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-12-09 15:06:43,628 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 15:06:43,628 INFO L82 PathProgramCache]: Analyzing trace with hash 1097577162, now seen corresponding path program 3 times [2018-12-09 15:06:43,628 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 15:06:43,628 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 15:06:43,629 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 15:06:43,629 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 15:06:43,629 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 15:06:43,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 15:06:43,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 15:06:43,769 WARN L180 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 67 [2018-12-09 15:06:43,799 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 15:06:43,800 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 15:06:43,800 INFO L87 Difference]: Start difference. First operand 20 states and 26 transitions. cyclomatic complexity: 8 Second operand 4 states. [2018-12-09 15:06:43,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 15:06:43,812 INFO L93 Difference]: Finished difference Result 26 states and 29 transitions. [2018-12-09 15:06:43,813 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 15:06:43,813 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 26 states and 29 transitions. [2018-12-09 15:06:43,814 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2018-12-09 15:06:43,814 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 26 states to 20 states and 23 transitions. [2018-12-09 15:06:43,814 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 14 [2018-12-09 15:06:43,814 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 14 [2018-12-09 15:06:43,815 INFO L73 IsDeterministic]: Start isDeterministic. Operand 20 states and 23 transitions. [2018-12-09 15:06:43,815 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-09 15:06:43,815 INFO L705 BuchiCegarLoop]: Abstraction has 20 states and 23 transitions. [2018-12-09 15:06:43,815 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states and 23 transitions. [2018-12-09 15:06:43,816 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2018-12-09 15:06:43,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-12-09 15:06:43,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 23 transitions. [2018-12-09 15:06:43,817 INFO L728 BuchiCegarLoop]: Abstraction has 20 states and 23 transitions. [2018-12-09 15:06:43,817 INFO L608 BuchiCegarLoop]: Abstraction has 20 states and 23 transitions. [2018-12-09 15:06:43,817 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2018-12-09 15:06:43,817 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 20 states and 23 transitions. [2018-12-09 15:06:43,817 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2018-12-09 15:06:43,818 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-09 15:06:43,818 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-09 15:06:43,818 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 15:06:43,818 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2018-12-09 15:06:43,818 INFO L794 eck$LassoCheckResult]: Stem: 322#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 313#L-1 havoc main_#res;havoc main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~malloc3.base, main_#t~malloc3.offset, main_#t~malloc4.base, main_#t~malloc4.offset, main_#t~nondet5, main_#t~nondet6, main_#t~nondet7, main_#t~mem13, main_#t~mem14, main_#t~mem15, main_#t~nondet16, main_#t~mem17, main_#t~mem18, main_#t~nondet19, main_#t~mem20, main_#t~mem8, main_#t~mem9, main_#t~short10, main_#t~mem11, main_#t~short12, main_~x~0.base, main_~x~0.offset, main_~y~0.base, main_~y~0.offset, main_~z~0.base, main_~z~0.offset;call main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.alloc(4);main_~x~0.base, main_~x~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset;call main_#t~malloc3.base, main_#t~malloc3.offset := #Ultimate.alloc(4);main_~y~0.base, main_~y~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset;call main_#t~malloc4.base, main_#t~malloc4.offset := #Ultimate.alloc(4);main_~z~0.base, main_~z~0.offset := main_#t~malloc4.base, main_#t~malloc4.offset;call write~int(main_#t~nondet5, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~nondet5;call write~int(main_#t~nondet6, main_~y~0.base, main_~y~0.offset, 4);havoc main_#t~nondet6;call write~int(main_#t~nondet7, main_~z~0.base, main_~z~0.offset, 4);havoc main_#t~nondet7; 314#L555-2 call main_#t~mem8 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~short10 := main_#t~mem8 > 0; 319#L554-1 assume main_#t~short10;call main_#t~mem9 := read~int(main_~y~0.base, main_~y~0.offset, 4);main_#t~short10 := main_#t~mem9 > 0; 320#L554-3 main_#t~short12 := main_#t~short10; 323#L554-4 assume main_#t~short12;call main_#t~mem11 := read~int(main_~z~0.base, main_~z~0.offset, 4);main_#t~short12 := main_#t~mem11 > 0; 309#L554-6 assume !!main_#t~short12;havoc main_#t~mem11;havoc main_#t~short12;havoc main_#t~short10;havoc main_#t~mem8;havoc main_#t~mem9;call main_#t~mem13 := read~int(main_~y~0.base, main_~y~0.offset, 4);call main_#t~mem14 := read~int(main_~x~0.base, main_~x~0.offset, 4); 310#L555 assume !(main_#t~mem13 > main_#t~mem14);havoc main_#t~mem13;havoc main_#t~mem14;call main_#t~mem18 := read~int(main_~z~0.base, main_~z~0.offset, 4);call write~int(main_#t~mem18 - 1, main_~z~0.base, main_~z~0.offset, 4);havoc main_#t~mem18;call write~int(main_#t~nondet19, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~nondet19;call main_#t~mem20 := read~int(main_~x~0.base, main_~x~0.offset, 4);call write~int(main_#t~mem20 - 1, main_~y~0.base, main_~y~0.offset, 4);havoc main_#t~mem20; 315#L555-2 [2018-12-09 15:06:43,818 INFO L796 eck$LassoCheckResult]: Loop: 315#L555-2 call main_#t~mem8 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~short10 := main_#t~mem8 > 0; 316#L554-1 assume main_#t~short10;call main_#t~mem9 := read~int(main_~y~0.base, main_~y~0.offset, 4);main_#t~short10 := main_#t~mem9 > 0; 328#L554-3 main_#t~short12 := main_#t~short10; 327#L554-4 assume main_#t~short12;call main_#t~mem11 := read~int(main_~z~0.base, main_~z~0.offset, 4);main_#t~short12 := main_#t~mem11 > 0; 326#L554-6 assume !!main_#t~short12;havoc main_#t~mem11;havoc main_#t~short12;havoc main_#t~short10;havoc main_#t~mem8;havoc main_#t~mem9;call main_#t~mem13 := read~int(main_~y~0.base, main_~y~0.offset, 4);call main_#t~mem14 := read~int(main_~x~0.base, main_~x~0.offset, 4); 325#L555 assume main_#t~mem13 > main_#t~mem14;havoc main_#t~mem13;havoc main_#t~mem14;call main_#t~mem15 := read~int(main_~z~0.base, main_~z~0.offset, 4);call write~int(main_#t~mem15, main_~y~0.base, main_~y~0.offset, 4);havoc main_#t~mem15;call write~int(main_#t~nondet16, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~nondet16;call main_#t~mem17 := read~int(main_~x~0.base, main_~x~0.offset, 4);call write~int(main_#t~mem17 - 1, main_~z~0.base, main_~z~0.offset, 4);havoc main_#t~mem17; 315#L555-2 [2018-12-09 15:06:43,818 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 15:06:43,819 INFO L82 PathProgramCache]: Analyzing trace with hash 177626382, now seen corresponding path program 1 times [2018-12-09 15:06:43,819 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 15:06:43,819 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 15:06:43,820 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 15:06:43,820 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 15:06:43,820 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 15:06:43,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 15:06:43,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 15:06:43,840 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 15:06:43,840 INFO L82 PathProgramCache]: Analyzing trace with hash 1097577162, now seen corresponding path program 4 times [2018-12-09 15:06:43,840 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 15:06:43,840 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 15:06:43,841 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 15:06:43,841 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 15:06:43,841 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 15:06:43,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 15:06:43,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 15:06:43,851 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 15:06:43,852 INFO L82 PathProgramCache]: Analyzing trace with hash -692497897, now seen corresponding path program 1 times [2018-12-09 15:06:43,852 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 15:06:43,852 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 15:06:43,852 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 15:06:43,853 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 15:06:43,853 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 15:06:43,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 15:06:43,922 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 15:06:43,922 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 15:06:43,922 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_41b4fb8e-dbc5-497d-ad27-664a79a2e78b/bin-2019/uautomizer/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-09 15:06:43,929 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 15:06:43,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 15:06:43,948 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 15:06:43,964 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-12-09 15:06:43,964 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 15:06:43,965 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 15:06:43,966 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:8, output treesize:4 [2018-12-09 15:06:43,974 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 15:06:43,976 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 85 treesize of output 52 [2018-12-09 15:06:43,979 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 15:06:43,980 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 16 [2018-12-09 15:06:43,980 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 15:06:43,989 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 22 [2018-12-09 15:06:43,991 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-12-09 15:06:43,991 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-09 15:06:43,999 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 22 [2018-12-09 15:06:44,002 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-12-09 15:06:44,002 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-12-09 15:06:44,009 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 15:06:44,012 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 15:06:44,014 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 15:06:44,018 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 15:06:44,018 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 4 variables, input treesize:90, output treesize:18 [2018-12-09 15:06:44,043 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 24 [2018-12-09 15:06:44,045 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2018-12-09 15:06:44,045 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 15:06:44,049 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2018-12-09 15:06:44,050 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-09 15:06:44,051 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 15:06:44,053 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 15:06:44,053 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:32, output treesize:5 [2018-12-09 15:06:44,062 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 15:06:44,077 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-09 15:06:44,077 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4] total 7 [2018-12-09 15:06:44,242 WARN L180 SmtUtils]: Spent 163.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 67 [2018-12-09 15:06:44,276 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-09 15:06:44,276 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2018-12-09 15:06:44,276 INFO L87 Difference]: Start difference. First operand 20 states and 23 transitions. cyclomatic complexity: 5 Second operand 8 states. [2018-12-09 15:06:44,310 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 15:06:44,310 INFO L93 Difference]: Finished difference Result 20 states and 22 transitions. [2018-12-09 15:06:44,310 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-09 15:06:44,311 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 20 states and 22 transitions. [2018-12-09 15:06:44,311 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2018-12-09 15:06:44,311 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 20 states to 20 states and 22 transitions. [2018-12-09 15:06:44,311 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 14 [2018-12-09 15:06:44,311 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 14 [2018-12-09 15:06:44,311 INFO L73 IsDeterministic]: Start isDeterministic. Operand 20 states and 22 transitions. [2018-12-09 15:06:44,312 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-09 15:06:44,312 INFO L705 BuchiCegarLoop]: Abstraction has 20 states and 22 transitions. [2018-12-09 15:06:44,312 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states and 22 transitions. [2018-12-09 15:06:44,312 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 15. [2018-12-09 15:06:44,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-12-09 15:06:44,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 17 transitions. [2018-12-09 15:06:44,313 INFO L728 BuchiCegarLoop]: Abstraction has 15 states and 17 transitions. [2018-12-09 15:06:44,313 INFO L608 BuchiCegarLoop]: Abstraction has 15 states and 17 transitions. [2018-12-09 15:06:44,313 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2018-12-09 15:06:44,313 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states and 17 transitions. [2018-12-09 15:06:44,313 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2018-12-09 15:06:44,313 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-09 15:06:44,313 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-09 15:06:44,313 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2018-12-09 15:06:44,313 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2018-12-09 15:06:44,313 INFO L794 eck$LassoCheckResult]: Stem: 415#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 407#L-1 havoc main_#res;havoc main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~malloc3.base, main_#t~malloc3.offset, main_#t~malloc4.base, main_#t~malloc4.offset, main_#t~nondet5, main_#t~nondet6, main_#t~nondet7, main_#t~mem13, main_#t~mem14, main_#t~mem15, main_#t~nondet16, main_#t~mem17, main_#t~mem18, main_#t~nondet19, main_#t~mem20, main_#t~mem8, main_#t~mem9, main_#t~short10, main_#t~mem11, main_#t~short12, main_~x~0.base, main_~x~0.offset, main_~y~0.base, main_~y~0.offset, main_~z~0.base, main_~z~0.offset;call main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.alloc(4);main_~x~0.base, main_~x~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset;call main_#t~malloc3.base, main_#t~malloc3.offset := #Ultimate.alloc(4);main_~y~0.base, main_~y~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset;call main_#t~malloc4.base, main_#t~malloc4.offset := #Ultimate.alloc(4);main_~z~0.base, main_~z~0.offset := main_#t~malloc4.base, main_#t~malloc4.offset;call write~int(main_#t~nondet5, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~nondet5;call write~int(main_#t~nondet6, main_~y~0.base, main_~y~0.offset, 4);havoc main_#t~nondet6;call write~int(main_#t~nondet7, main_~z~0.base, main_~z~0.offset, 4);havoc main_#t~nondet7; 408#L555-2 call main_#t~mem8 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~short10 := main_#t~mem8 > 0; 409#L554-1 [2018-12-09 15:06:44,313 INFO L796 eck$LassoCheckResult]: Loop: 409#L554-1 assume main_#t~short10;call main_#t~mem9 := read~int(main_~y~0.base, main_~y~0.offset, 4);main_#t~short10 := main_#t~mem9 > 0; 410#L554-3 main_#t~short12 := main_#t~short10; 416#L554-4 assume main_#t~short12;call main_#t~mem11 := read~int(main_~z~0.base, main_~z~0.offset, 4);main_#t~short12 := main_#t~mem11 > 0; 403#L554-6 assume !!main_#t~short12;havoc main_#t~mem11;havoc main_#t~short12;havoc main_#t~short10;havoc main_#t~mem8;havoc main_#t~mem9;call main_#t~mem13 := read~int(main_~y~0.base, main_~y~0.offset, 4);call main_#t~mem14 := read~int(main_~x~0.base, main_~x~0.offset, 4); 404#L555 assume !(main_#t~mem13 > main_#t~mem14);havoc main_#t~mem13;havoc main_#t~mem14;call main_#t~mem18 := read~int(main_~z~0.base, main_~z~0.offset, 4);call write~int(main_#t~mem18 - 1, main_~z~0.base, main_~z~0.offset, 4);havoc main_#t~mem18;call write~int(main_#t~nondet19, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~nondet19;call main_#t~mem20 := read~int(main_~x~0.base, main_~x~0.offset, 4);call write~int(main_#t~mem20 - 1, main_~y~0.base, main_~y~0.offset, 4);havoc main_#t~mem20; 413#L555-2 call main_#t~mem8 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~short10 := main_#t~mem8 > 0; 409#L554-1 [2018-12-09 15:06:44,313 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 15:06:44,314 INFO L82 PathProgramCache]: Analyzing trace with hash 29860, now seen corresponding path program 1 times [2018-12-09 15:06:44,314 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 15:06:44,314 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 15:06:44,314 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 15:06:44,315 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 15:06:44,315 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 15:06:44,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 15:06:44,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 15:06:44,325 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 15:06:44,325 INFO L82 PathProgramCache]: Analyzing trace with hash 1187255894, now seen corresponding path program 1 times [2018-12-09 15:06:44,326 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 15:06:44,326 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 15:06:44,326 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 15:06:44,326 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 15:06:44,327 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 15:06:44,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 15:06:44,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 15:06:44,337 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 15:06:44,338 INFO L82 PathProgramCache]: Analyzing trace with hash 1211450553, now seen corresponding path program 2 times [2018-12-09 15:06:44,338 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 15:06:44,338 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 15:06:44,338 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 15:06:44,339 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 15:06:44,339 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 15:06:44,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 15:06:44,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 15:06:44,531 WARN L180 SmtUtils]: Spent 177.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 78 [2018-12-09 15:06:44,640 WARN L180 SmtUtils]: Spent 105.00 ms on a formula simplification that was a NOOP. DAG size: 65 [2018-12-09 15:06:44,805 WARN L180 SmtUtils]: Spent 164.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 88 [2018-12-09 15:06:44,983 WARN L180 SmtUtils]: Spent 175.00 ms on a formula simplification that was a NOOP. DAG size: 85 [2018-12-09 15:06:44,985 INFO L216 LassoAnalysis]: Preferences: [2018-12-09 15:06:44,985 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-09 15:06:44,985 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-09 15:06:44,985 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-09 15:06:44,985 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-12-09 15:06:44,985 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-09 15:06:44,985 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-09 15:06:44,985 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-09 15:06:44,985 INFO L131 ssoRankerPreferences]: Filename of dumped script: Ben-Amram-2010LMCS-Ex2.3-alloca_true-termination.c.i_Iteration5_Lasso [2018-12-09 15:06:44,985 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-09 15:06:44,985 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-09 15:06:44,991 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 15:06:44,992 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 15:06:45,009 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 15:06:45,010 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 15:06:45,011 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 15:06:45,012 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 15:06:45,325 WARN L180 SmtUtils]: Spent 248.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 72 [2018-12-09 15:06:45,422 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 15:06:45,423 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 15:06:45,424 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 15:06:45,426 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 15:06:45,426 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 15:06:45,427 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 15:06:45,428 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 15:06:45,430 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 15:06:45,433 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 15:06:45,434 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 15:06:45,435 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 15:06:45,436 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 15:06:45,438 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 15:06:45,438 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 15:06:45,439 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 15:06:45,441 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 15:06:45,788 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-09 15:06:45,788 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-12-09 15:06:45,789 INFO L122 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 [2018-12-09 15:06:45,789 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 15:06:45,789 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 15:06:45,789 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 15:06:45,789 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 15:06:45,789 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 15:06:45,790 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 15:06:45,790 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 15:06:45,790 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 15:06:45,790 INFO L122 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 [2018-12-09 15:06:45,790 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 15:06:45,790 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 15:06:45,790 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 15:06:45,791 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 15:06:45,791 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 15:06:45,791 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 15:06:45,791 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 15:06:45,791 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 15:06:45,791 INFO L122 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 [2018-12-09 15:06:45,791 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 15:06:45,791 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 15:06:45,791 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 15:06:45,791 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 15:06:45,792 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 15:06:45,792 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 15:06:45,792 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 15:06:45,792 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 15:06:45,792 INFO L122 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 [2018-12-09 15:06:45,792 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 15:06:45,792 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 15:06:45,792 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 15:06:45,793 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 15:06:45,793 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 15:06:45,793 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 15:06:45,793 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 15:06:45,793 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 15:06:45,793 INFO L122 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 [2018-12-09 15:06:45,793 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 15:06:45,793 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 15:06:45,793 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 15:06:45,793 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 15:06:45,794 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 15:06:45,794 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 15:06:45,795 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 15:06:45,795 INFO L122 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 [2018-12-09 15:06:45,795 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 15:06:45,795 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 15:06:45,795 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 15:06:45,795 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 15:06:45,797 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 15:06:45,797 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 15:06:45,806 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 15:06:45,806 INFO L122 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 [2018-12-09 15:06:45,806 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 15:06:45,807 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 15:06:45,807 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 15:06:45,807 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 15:06:45,808 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 15:06:45,808 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 15:06:45,811 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 15:06:45,811 INFO L122 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 [2018-12-09 15:06:45,811 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 15:06:45,811 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-12-09 15:06:45,812 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 15:06:45,812 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 15:06:45,812 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-12-09 15:06:45,813 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 15:06:45,815 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 15:06:45,815 INFO L122 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 [2018-12-09 15:06:45,816 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 15:06:45,816 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-12-09 15:06:45,816 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 15:06:45,816 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 15:06:45,817 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-12-09 15:06:45,817 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 15:06:45,819 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 15:06:45,820 INFO L122 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 [2018-12-09 15:06:45,820 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 15:06:45,820 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 15:06:45,820 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 15:06:45,820 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 15:06:45,821 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 15:06:45,821 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 15:06:45,822 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 15:06:45,822 INFO L122 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 [2018-12-09 15:06:45,823 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 15:06:45,823 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 15:06:45,823 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 15:06:45,823 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 15:06:45,824 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 15:06:45,824 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 15:06:45,827 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-12-09 15:06:45,828 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-12-09 15:06:45,828 INFO L444 ModelExtractionUtils]: 4 out of 7 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-12-09 15:06:45,829 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-12-09 15:06:45,829 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-12-09 15:06:45,830 INFO L518 LassoAnalysis]: Proved termination. [2018-12-09 15:06:45,830 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_main_~z~0.base) ULTIMATE.start_main_~z~0.offset)_2) = 1*v_rep(select (select #memory_int ULTIMATE.start_main_~z~0.base) ULTIMATE.start_main_~z~0.offset)_2 Supporting invariants [] [2018-12-09 15:06:45,889 INFO L297 tatePredicateManager]: 22 out of 24 supporting invariants were superfluous and have been removed [2018-12-09 15:06:45,891 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-09 15:06:45,904 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 15:06:45,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 15:06:45,910 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 15:06:45,917 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 15:06:45,918 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 29 [2018-12-09 15:06:45,929 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 15:06:45,929 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 15:06:45,930 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2018-12-09 15:06:45,930 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 15:06:45,933 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 15:06:45,937 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 15:06:45,937 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:21, output treesize:14 [2018-12-09 15:06:45,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 15:06:45,951 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 15:06:45,986 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 15:06:45,987 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 100 treesize of output 62 [2018-12-09 15:06:45,990 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 15:06:45,990 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 22 [2018-12-09 15:06:45,991 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 15:06:46,002 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 42 [2018-12-09 15:06:46,004 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-12-09 15:06:46,004 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-09 15:06:46,025 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 37 treesize of output 57 [2018-12-09 15:06:46,028 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 45 [2018-12-09 15:06:46,028 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-12-09 15:06:46,055 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 15:06:46,060 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 35 treesize of output 46 [2018-12-09 15:06:46,061 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 2 xjuncts. [2018-12-09 15:06:46,081 INFO L267 ElimStorePlain]: Start of recursive call 6: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-09 15:06:46,110 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-12-09 15:06:46,124 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-12-09 15:06:46,140 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-12-09 15:06:46,140 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 4 variables, input treesize:108, output treesize:67 [2018-12-09 15:06:46,179 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 15:06:46,179 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 4 loop predicates [2018-12-09 15:06:46,179 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 15 states and 17 transitions. cyclomatic complexity: 4 Second operand 7 states. [2018-12-09 15:06:46,221 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 15 states and 17 transitions. cyclomatic complexity: 4. Second operand 7 states. Result 37 states and 40 transitions. Complement of second has 10 states. [2018-12-09 15:06:46,221 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 [2018-12-09 15:06:46,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-12-09 15:06:46,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 10 transitions. [2018-12-09 15:06:46,222 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 10 transitions. Stem has 3 letters. Loop has 6 letters. [2018-12-09 15:06:46,222 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-09 15:06:46,222 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 10 transitions. Stem has 9 letters. Loop has 6 letters. [2018-12-09 15:06:46,222 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-09 15:06:46,222 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 10 transitions. Stem has 3 letters. Loop has 12 letters. [2018-12-09 15:06:46,223 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-09 15:06:46,223 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 37 states and 40 transitions. [2018-12-09 15:06:46,223 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2018-12-09 15:06:46,224 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 37 states to 20 states and 21 transitions. [2018-12-09 15:06:46,224 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9 [2018-12-09 15:06:46,224 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 9 [2018-12-09 15:06:46,224 INFO L73 IsDeterministic]: Start isDeterministic. Operand 20 states and 21 transitions. [2018-12-09 15:06:46,224 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-09 15:06:46,224 INFO L705 BuchiCegarLoop]: Abstraction has 20 states and 21 transitions. [2018-12-09 15:06:46,224 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states and 21 transitions. [2018-12-09 15:06:46,225 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 15. [2018-12-09 15:06:46,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-12-09 15:06:46,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 16 transitions. [2018-12-09 15:06:46,225 INFO L728 BuchiCegarLoop]: Abstraction has 15 states and 16 transitions. [2018-12-09 15:06:46,225 INFO L608 BuchiCegarLoop]: Abstraction has 15 states and 16 transitions. [2018-12-09 15:06:46,225 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2018-12-09 15:06:46,226 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states and 16 transitions. [2018-12-09 15:06:46,226 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2018-12-09 15:06:46,226 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-09 15:06:46,226 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-09 15:06:46,226 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 15:06:46,226 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2018-12-09 15:06:46,226 INFO L794 eck$LassoCheckResult]: Stem: 626#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 619#L-1 havoc main_#res;havoc main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~malloc3.base, main_#t~malloc3.offset, main_#t~malloc4.base, main_#t~malloc4.offset, main_#t~nondet5, main_#t~nondet6, main_#t~nondet7, main_#t~mem13, main_#t~mem14, main_#t~mem15, main_#t~nondet16, main_#t~mem17, main_#t~mem18, main_#t~nondet19, main_#t~mem20, main_#t~mem8, main_#t~mem9, main_#t~short10, main_#t~mem11, main_#t~short12, main_~x~0.base, main_~x~0.offset, main_~y~0.base, main_~y~0.offset, main_~z~0.base, main_~z~0.offset;call main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.alloc(4);main_~x~0.base, main_~x~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset;call main_#t~malloc3.base, main_#t~malloc3.offset := #Ultimate.alloc(4);main_~y~0.base, main_~y~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset;call main_#t~malloc4.base, main_#t~malloc4.offset := #Ultimate.alloc(4);main_~z~0.base, main_~z~0.offset := main_#t~malloc4.base, main_#t~malloc4.offset;call write~int(main_#t~nondet5, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~nondet5;call write~int(main_#t~nondet6, main_~y~0.base, main_~y~0.offset, 4);havoc main_#t~nondet6;call write~int(main_#t~nondet7, main_~z~0.base, main_~z~0.offset, 4);havoc main_#t~nondet7; 620#L555-2 call main_#t~mem8 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~short10 := main_#t~mem8 > 0; 621#L554-1 assume main_#t~short10;call main_#t~mem9 := read~int(main_~y~0.base, main_~y~0.offset, 4);main_#t~short10 := main_#t~mem9 > 0; 625#L554-3 main_#t~short12 := main_#t~short10; 628#L554-4 assume main_#t~short12;call main_#t~mem11 := read~int(main_~z~0.base, main_~z~0.offset, 4);main_#t~short12 := main_#t~mem11 > 0; 617#L554-6 assume !!main_#t~short12;havoc main_#t~mem11;havoc main_#t~short12;havoc main_#t~short10;havoc main_#t~mem8;havoc main_#t~mem9;call main_#t~mem13 := read~int(main_~y~0.base, main_~y~0.offset, 4);call main_#t~mem14 := read~int(main_~x~0.base, main_~x~0.offset, 4); 618#L555 assume main_#t~mem13 > main_#t~mem14;havoc main_#t~mem13;havoc main_#t~mem14;call main_#t~mem15 := read~int(main_~z~0.base, main_~z~0.offset, 4);call write~int(main_#t~mem15, main_~y~0.base, main_~y~0.offset, 4);havoc main_#t~mem15;call write~int(main_#t~nondet16, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~nondet16;call main_#t~mem17 := read~int(main_~x~0.base, main_~x~0.offset, 4);call write~int(main_#t~mem17 - 1, main_~z~0.base, main_~z~0.offset, 4);havoc main_#t~mem17; 622#L555-2 call main_#t~mem8 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~short10 := main_#t~mem8 > 0; 623#L554-1 [2018-12-09 15:06:46,227 INFO L796 eck$LassoCheckResult]: Loop: 623#L554-1 assume main_#t~short10;call main_#t~mem9 := read~int(main_~y~0.base, main_~y~0.offset, 4);main_#t~short10 := main_#t~mem9 > 0; 624#L554-3 main_#t~short12 := main_#t~short10; 627#L554-4 assume main_#t~short12;call main_#t~mem11 := read~int(main_~z~0.base, main_~z~0.offset, 4);main_#t~short12 := main_#t~mem11 > 0; 615#L554-6 assume !!main_#t~short12;havoc main_#t~mem11;havoc main_#t~short12;havoc main_#t~short10;havoc main_#t~mem8;havoc main_#t~mem9;call main_#t~mem13 := read~int(main_~y~0.base, main_~y~0.offset, 4);call main_#t~mem14 := read~int(main_~x~0.base, main_~x~0.offset, 4); 616#L555 assume !(main_#t~mem13 > main_#t~mem14);havoc main_#t~mem13;havoc main_#t~mem14;call main_#t~mem18 := read~int(main_~z~0.base, main_~z~0.offset, 4);call write~int(main_#t~mem18 - 1, main_~z~0.base, main_~z~0.offset, 4);havoc main_#t~mem18;call write~int(main_#t~nondet19, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~nondet19;call main_#t~mem20 := read~int(main_~x~0.base, main_~x~0.offset, 4);call write~int(main_#t~mem20 - 1, main_~y~0.base, main_~y~0.offset, 4);havoc main_#t~mem20; 629#L555-2 call main_#t~mem8 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~short10 := main_#t~mem8 > 0; 623#L554-1 [2018-12-09 15:06:46,227 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 15:06:46,227 INFO L82 PathProgramCache]: Analyzing trace with hash 1211450491, now seen corresponding path program 2 times [2018-12-09 15:06:46,227 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 15:06:46,227 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 15:06:46,228 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 15:06:46,228 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 15:06:46,228 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 15:06:46,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 15:06:46,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 15:06:46,244 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 15:06:46,244 INFO L82 PathProgramCache]: Analyzing trace with hash 1187255894, now seen corresponding path program 2 times [2018-12-09 15:06:46,244 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 15:06:46,244 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 15:06:46,245 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 15:06:46,245 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 15:06:46,245 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 15:06:46,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 15:06:46,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 15:06:46,254 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 15:06:46,254 INFO L82 PathProgramCache]: Analyzing trace with hash 816748368, now seen corresponding path program 2 times [2018-12-09 15:06:46,255 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 15:06:46,255 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 15:06:46,255 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 15:06:46,255 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 15:06:46,255 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 15:06:46,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 15:06:46,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 15:06:46,442 WARN L180 SmtUtils]: Spent 166.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 78 [2018-12-09 15:06:46,553 WARN L180 SmtUtils]: Spent 106.00 ms on a formula simplification that was a NOOP. DAG size: 65 [2018-12-09 15:06:47,121 WARN L180 SmtUtils]: Spent 566.00 ms on a formula simplification. DAG size of input: 156 DAG size of output: 124 [2018-12-09 15:06:47,666 WARN L180 SmtUtils]: Spent 540.00 ms on a formula simplification that was a NOOP. DAG size: 103 [2018-12-09 15:06:47,669 INFO L216 LassoAnalysis]: Preferences: [2018-12-09 15:06:47,670 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-09 15:06:47,670 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-09 15:06:47,670 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-09 15:06:47,670 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-12-09 15:06:47,670 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-09 15:06:47,670 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-09 15:06:47,670 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-09 15:06:47,670 INFO L131 ssoRankerPreferences]: Filename of dumped script: Ben-Amram-2010LMCS-Ex2.3-alloca_true-termination.c.i_Iteration6_Lasso [2018-12-09 15:06:47,670 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-09 15:06:47,670 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-09 15:06:47,673 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 15:06:47,674 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 15:06:47,675 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 15:06:47,677 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 15:06:47,678 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 15:06:47,678 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 15:06:47,679 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 15:06:47,681 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 15:06:47,682 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 15:06:47,683 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 15:06:47,684 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 15:06:47,684 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 15:06:47,685 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 15:06:47,686 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 15:06:47,687 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 15:06:47,688 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 15:06:47,689 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 15:06:47,690 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 15:06:48,067 WARN L180 SmtUtils]: Spent 277.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 78 [2018-12-09 15:06:48,156 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 15:06:48,157 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 15:06:48,158 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 15:06:48,159 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 15:06:48,582 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-09 15:06:48,582 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-12-09 15:06:48,583 INFO L122 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 [2018-12-09 15:06:48,583 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 15:06:48,583 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 15:06:48,583 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 15:06:48,584 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 15:06:48,584 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 15:06:48,584 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 15:06:48,584 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 15:06:48,585 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 15:06:48,585 INFO L122 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 [2018-12-09 15:06:48,585 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 15:06:48,585 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 15:06:48,585 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 15:06:48,586 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 15:06:48,586 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 15:06:48,586 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 15:06:48,586 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 15:06:48,586 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 15:06:48,587 INFO L122 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 [2018-12-09 15:06:48,587 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 15:06:48,587 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 15:06:48,587 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 15:06:48,587 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 15:06:48,588 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 15:06:48,588 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 15:06:48,589 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 15:06:48,589 INFO L122 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 [2018-12-09 15:06:48,589 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 15:06:48,590 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 15:06:48,590 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 15:06:48,590 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 15:06:48,590 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 15:06:48,590 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 15:06:48,590 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 15:06:48,590 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 15:06:48,591 INFO L122 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 [2018-12-09 15:06:48,591 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 15:06:48,591 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 15:06:48,591 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 15:06:48,591 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 15:06:48,591 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 15:06:48,592 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 15:06:48,592 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 15:06:48,592 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 15:06:48,592 INFO L122 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 [2018-12-09 15:06:48,593 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 15:06:48,593 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 15:06:48,593 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 15:06:48,593 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 15:06:48,593 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 15:06:48,593 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 15:06:48,595 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 15:06:48,595 INFO L122 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 [2018-12-09 15:06:48,595 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 15:06:48,595 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 15:06:48,596 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 15:06:48,596 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 15:06:48,596 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 15:06:48,596 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 15:06:48,597 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 15:06:48,597 INFO L122 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 [2018-12-09 15:06:48,598 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 15:06:48,598 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 15:06:48,598 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 15:06:48,598 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 15:06:48,598 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 15:06:48,598 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 15:06:48,598 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 15:06:48,599 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 15:06:48,599 INFO L122 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 [2018-12-09 15:06:48,599 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 15:06:48,599 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 15:06:48,600 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 15:06:48,600 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 15:06:48,600 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 15:06:48,600 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 15:06:48,600 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 15:06:48,600 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 15:06:48,601 INFO L122 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 [2018-12-09 15:06:48,601 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 15:06:48,601 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 15:06:48,601 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 15:06:48,601 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 15:06:48,602 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 15:06:48,602 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 15:06:48,603 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 15:06:48,603 INFO L122 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 [2018-12-09 15:06:48,603 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 15:06:48,603 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 15:06:48,603 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 15:06:48,604 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 15:06:48,604 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 15:06:48,604 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 15:06:48,604 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 15:06:48,604 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 15:06:48,605 INFO L122 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 [2018-12-09 15:06:48,605 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 15:06:48,605 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 15:06:48,605 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 15:06:48,605 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 15:06:48,605 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 15:06:48,605 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 15:06:48,605 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 15:06:48,606 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 15:06:48,606 INFO L122 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 [2018-12-09 15:06:48,606 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 15:06:48,606 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 15:06:48,607 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 15:06:48,607 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 15:06:48,607 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 15:06:48,607 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 15:06:48,607 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 15:06:48,607 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 15:06:48,608 INFO L122 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 [2018-12-09 15:06:48,608 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 15:06:48,608 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 15:06:48,608 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 15:06:48,608 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 15:06:48,608 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 15:06:48,609 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 15:06:48,609 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 15:06:48,609 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 15:06:48,609 INFO L122 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 [2018-12-09 15:06:48,610 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 15:06:48,610 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 15:06:48,610 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 15:06:48,610 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 15:06:48,610 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 15:06:48,610 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 15:06:48,611 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 15:06:48,611 INFO L122 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 [2018-12-09 15:06:48,612 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 15:06:48,612 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 15:06:48,612 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 15:06:48,612 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 15:06:48,612 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 15:06:48,612 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 15:06:48,612 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 15:06:48,613 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 15:06:48,613 INFO L122 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 [2018-12-09 15:06:48,614 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 15:06:48,614 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 15:06:48,614 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 15:06:48,614 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 15:06:48,614 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 15:06:48,614 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 15:06:48,615 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 15:06:48,615 INFO L122 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 [2018-12-09 15:06:48,615 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 15:06:48,615 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-12-09 15:06:48,615 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 15:06:48,616 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 15:06:48,616 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-12-09 15:06:48,616 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 15:06:48,618 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 15:06:48,618 INFO L122 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 [2018-12-09 15:06:48,619 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 15:06:48,619 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 15:06:48,619 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 15:06:48,619 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 15:06:48,620 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 15:06:48,620 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 15:06:48,622 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 15:06:48,622 INFO L122 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 [2018-12-09 15:06:48,623 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 15:06:48,623 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 15:06:48,623 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 15:06:48,623 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 15:06:48,623 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 15:06:48,624 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 15:06:48,626 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 15:06:48,626 INFO L122 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 [2018-12-09 15:06:48,627 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 15:06:48,627 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 15:06:48,627 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 15:06:48,627 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 15:06:48,628 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 15:06:48,628 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 15:06:48,635 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 15:06:48,636 INFO L122 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 [2018-12-09 15:06:48,636 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 15:06:48,636 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 15:06:48,636 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 15:06:48,636 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 15:06:48,637 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 15:06:48,637 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 15:06:48,638 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 15:06:48,638 INFO L122 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 [2018-12-09 15:06:48,639 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 15:06:48,639 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-12-09 15:06:48,639 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-12-09 15:06:48,639 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 15:06:48,643 INFO L402 nArgumentSynthesizer]: We have 20 Motzkin's Theorem applications. [2018-12-09 15:06:48,643 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2018-12-09 15:06:48,714 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-12-09 15:06:48,733 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-12-09 15:06:48,733 INFO L444 ModelExtractionUtils]: 33 out of 36 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-12-09 15:06:48,733 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-12-09 15:06:48,734 INFO L440 nArgumentSynthesizer]: Removed 4 redundant supporting invariants from a total of 4. [2018-12-09 15:06:48,734 INFO L518 LassoAnalysis]: Proved termination. [2018-12-09 15:06:48,734 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_main_~z~0.base) ULTIMATE.start_main_~z~0.offset)_3) = 1*v_rep(select (select #memory_int ULTIMATE.start_main_~z~0.base) ULTIMATE.start_main_~z~0.offset)_3 Supporting invariants [] [2018-12-09 15:06:48,805 INFO L297 tatePredicateManager]: 22 out of 24 supporting invariants were superfluous and have been removed [2018-12-09 15:06:48,807 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-09 15:06:48,833 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 15:06:48,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 15:06:48,844 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 15:06:48,852 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 15:06:48,852 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 29 [2018-12-09 15:06:48,864 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 15:06:48,864 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 15:06:48,865 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2018-12-09 15:06:48,865 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 15:06:48,868 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 15:06:48,872 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 15:06:48,872 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:21, output treesize:14 [2018-12-09 15:06:48,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 15:06:48,888 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 15:06:48,922 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 15:06:48,923 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 100 treesize of output 62 [2018-12-09 15:06:48,925 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 15:06:48,926 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 22 [2018-12-09 15:06:48,926 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 15:06:48,936 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 42 [2018-12-09 15:06:48,938 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-12-09 15:06:48,938 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-09 15:06:48,957 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 37 treesize of output 57 [2018-12-09 15:06:48,959 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 45 [2018-12-09 15:06:48,960 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-12-09 15:06:48,984 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 15:06:48,988 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 35 treesize of output 46 [2018-12-09 15:06:48,989 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 2 xjuncts. [2018-12-09 15:06:49,010 INFO L267 ElimStorePlain]: Start of recursive call 6: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-09 15:06:49,021 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-12-09 15:06:49,032 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-12-09 15:06:49,047 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-12-09 15:06:49,047 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 4 variables, input treesize:108, output treesize:67 [2018-12-09 15:06:49,081 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 15:06:49,081 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 4 loop predicates [2018-12-09 15:06:49,081 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 15 states and 16 transitions. cyclomatic complexity: 3 Second operand 7 states. [2018-12-09 15:06:49,112 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 15 states and 16 transitions. cyclomatic complexity: 3. Second operand 7 states. Result 24 states and 25 transitions. Complement of second has 10 states. [2018-12-09 15:06:49,113 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 [2018-12-09 15:06:49,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-12-09 15:06:49,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 7 transitions. [2018-12-09 15:06:49,113 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 7 transitions. Stem has 9 letters. Loop has 6 letters. [2018-12-09 15:06:49,113 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-09 15:06:49,113 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-12-09 15:06:49,125 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 15:06:49,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 15:06:49,134 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 15:06:49,142 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 15:06:49,143 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 29 [2018-12-09 15:06:49,152 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 15:06:49,153 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 15:06:49,153 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2018-12-09 15:06:49,153 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 15:06:49,158 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 15:06:49,162 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 15:06:49,162 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:21, output treesize:14 [2018-12-09 15:06:49,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 15:06:49,175 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 15:06:49,204 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 15:06:49,204 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 100 treesize of output 62 [2018-12-09 15:06:49,207 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 15:06:49,208 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 22 [2018-12-09 15:06:49,208 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 15:06:49,219 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 42 [2018-12-09 15:06:49,220 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-12-09 15:06:49,221 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-09 15:06:49,242 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 37 treesize of output 57 [2018-12-09 15:06:49,244 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 45 [2018-12-09 15:06:49,244 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-12-09 15:06:49,271 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 15:06:49,275 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 35 treesize of output 46 [2018-12-09 15:06:49,276 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 2 xjuncts. [2018-12-09 15:06:49,293 INFO L267 ElimStorePlain]: Start of recursive call 6: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-09 15:06:49,304 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-12-09 15:06:49,317 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-12-09 15:06:49,331 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-12-09 15:06:49,332 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 4 variables, input treesize:108, output treesize:67 [2018-12-09 15:06:49,364 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 15:06:49,364 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.2 stem predicates 4 loop predicates [2018-12-09 15:06:49,364 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 15 states and 16 transitions. cyclomatic complexity: 3 Second operand 7 states. [2018-12-09 15:06:49,395 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 15 states and 16 transitions. cyclomatic complexity: 3. Second operand 7 states. Result 24 states and 25 transitions. Complement of second has 10 states. [2018-12-09 15:06:49,396 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 [2018-12-09 15:06:49,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-12-09 15:06:49,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 7 transitions. [2018-12-09 15:06:49,396 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 7 transitions. Stem has 9 letters. Loop has 6 letters. [2018-12-09 15:06:49,396 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-09 15:06:49,396 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-12-09 15:06:49,408 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 15:06:49,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 15:06:49,417 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 15:06:49,424 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 15:06:49,424 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 29 [2018-12-09 15:06:49,433 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 15:06:49,434 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 15:06:49,434 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2018-12-09 15:06:49,434 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 15:06:49,438 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 15:06:49,441 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 15:06:49,441 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:21, output treesize:14 [2018-12-09 15:06:49,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 15:06:49,454 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 15:06:49,483 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 15:06:49,483 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 100 treesize of output 62 [2018-12-09 15:06:49,486 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 15:06:49,487 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 22 [2018-12-09 15:06:49,487 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 15:06:49,496 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 42 [2018-12-09 15:06:49,498 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-12-09 15:06:49,498 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-09 15:06:49,516 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 37 treesize of output 57 [2018-12-09 15:06:49,519 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 15:06:49,524 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 43 treesize of output 54 [2018-12-09 15:06:49,524 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 2 xjuncts. [2018-12-09 15:06:49,571 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 33 [2018-12-09 15:06:49,571 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-12-09 15:06:49,585 INFO L267 ElimStorePlain]: Start of recursive call 6: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-09 15:06:49,596 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-12-09 15:06:49,608 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-12-09 15:06:49,624 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-12-09 15:06:49,624 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 4 variables, input treesize:108, output treesize:67 [2018-12-09 15:06:49,658 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 15:06:49,659 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 4 loop predicates [2018-12-09 15:06:49,659 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 15 states and 16 transitions. cyclomatic complexity: 3 Second operand 7 states. [2018-12-09 15:06:49,704 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 15 states and 16 transitions. cyclomatic complexity: 3. Second operand 7 states. Result 26 states and 28 transitions. Complement of second has 11 states. [2018-12-09 15:06:49,704 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 [2018-12-09 15:06:49,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-12-09 15:06:49,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 17 transitions. [2018-12-09 15:06:49,704 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 17 transitions. Stem has 9 letters. Loop has 6 letters. [2018-12-09 15:06:49,704 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-09 15:06:49,704 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 17 transitions. Stem has 15 letters. Loop has 6 letters. [2018-12-09 15:06:49,705 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-09 15:06:49,705 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 17 transitions. Stem has 9 letters. Loop has 12 letters. [2018-12-09 15:06:49,705 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-09 15:06:49,705 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 26 states and 28 transitions. [2018-12-09 15:06:49,706 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-12-09 15:06:49,706 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 26 states to 0 states and 0 transitions. [2018-12-09 15:06:49,706 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2018-12-09 15:06:49,706 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2018-12-09 15:06:49,706 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2018-12-09 15:06:49,706 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-12-09 15:06:49,706 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-09 15:06:49,706 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-09 15:06:49,706 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-09 15:06:49,706 INFO L442 BuchiCegarLoop]: ======== Iteration 7============ [2018-12-09 15:06:49,706 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2018-12-09 15:06:49,706 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-12-09 15:06:49,706 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2018-12-09 15:06:49,710 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 09.12 03:06:49 BoogieIcfgContainer [2018-12-09 15:06:49,710 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-12-09 15:06:49,710 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-09 15:06:49,710 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-09 15:06:49,711 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-09 15:06:49,711 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 03:06:41" (3/4) ... [2018-12-09 15:06:49,713 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-12-09 15:06:49,713 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-09 15:06:49,713 INFO L168 Benchmark]: Toolchain (without parser) took 8518.04 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 294.6 MB). Free memory was 950.6 MB in the beginning and 1.2 GB in the end (delta: -296.2 MB). There was no memory consumed. Max. memory is 11.5 GB. [2018-12-09 15:06:49,714 INFO L168 Benchmark]: CDTParser took 0.10 ms. Allocated memory is still 1.0 GB. Free memory is still 979.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-09 15:06:49,714 INFO L168 Benchmark]: CACSL2BoogieTranslator took 292.78 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 100.7 MB). Free memory was 950.6 MB in the beginning and 1.1 GB in the end (delta: -134.2 MB). Peak memory consumption was 24.6 MB. Max. memory is 11.5 GB. [2018-12-09 15:06:49,714 INFO L168 Benchmark]: Boogie Procedure Inliner took 24.17 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2018-12-09 15:06:49,714 INFO L168 Benchmark]: Boogie Preprocessor took 13.17 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-09 15:06:49,715 INFO L168 Benchmark]: RCFGBuilder took 166.96 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 19.7 MB). Peak memory consumption was 19.7 MB. Max. memory is 11.5 GB. [2018-12-09 15:06:49,715 INFO L168 Benchmark]: BuchiAutomizer took 8015.44 ms. Allocated memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: 194.0 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -184.4 MB). Peak memory consumption was 9.6 MB. Max. memory is 11.5 GB. [2018-12-09 15:06:49,715 INFO L168 Benchmark]: Witness Printer took 2.69 ms. Allocated memory is still 1.3 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-09 15:06:49,717 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.10 ms. Allocated memory is still 1.0 GB. Free memory is still 979.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 292.78 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 100.7 MB). Free memory was 950.6 MB in the beginning and 1.1 GB in the end (delta: -134.2 MB). Peak memory consumption was 24.6 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 24.17 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 13.17 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 166.96 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 19.7 MB). Peak memory consumption was 19.7 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 8015.44 ms. Allocated memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: 194.0 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -184.4 MB). Peak memory consumption was 9.6 MB. Max. memory is 11.5 GB. * Witness Printer took 2.69 ms. Allocated memory is still 1.3 GB. Free memory is still 1.2 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 - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 6 terminating modules (3 trivial, 2 deterministic, 1 nondeterministic). One deterministic module has affine ranking function -1 * unknown-#memory_int-unknown[x][x] + unknown-#memory_int-unknown[z][z] + unknown-#memory_int-unknown[y][y] and consists of 6 locations. One deterministic module has affine ranking function unknown-#memory_int-unknown[z][z] and consists of 6 locations. One nondeterministic module has affine ranking function unknown-#memory_int-unknown[z][z] and consists of 6 locations. 3 modules have a trivial ranking function, the largest among these consists of 8 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 7.9s and 7 iterations. TraceHistogramMax:2. Analysis of lassos took 6.4s. Construction of modules took 0.1s. Büchi inclusion checks took 1.3s. Highest rank in rank-based complementation 3. Minimization of det autom 1. Minimization of nondet autom 5. Automata minimization 0.0s AutomataMinimizationTime, 5 MinimizatonAttempts, 10 StatesRemovedByMinimization, 2 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 20 states and ocurred in iteration 1. Nontrivial modules had stage [2, 0, 1, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 47 SDtfs, 46 SDslu, 46 SDs, 0 SdLazy, 136 SolverSat, 28 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.1s Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc1 concLT0 SILN0 SILU2 SILI0 SILT0 lasso3 LassoPreprocessingBenchmarks: Lassos: inital1016 mio100 ax103 hnf99 lsp64 ukn53 mio100 lsp30 div100 bol104 ite100 ukn100 eq171 hnf88 smp97 dnf220 smp66 tf100 neg100 sie106 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: sat Degree: 0 Time: 96ms VariablesStem: 7 VariablesLoop: 10 DisjunctsStem: 2 DisjunctsLoop: 2 SupportingInvariants: 4 MotzkinApplications: 20 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...