./Ultimate.py --spec ../../sv-benchmarks/c/Termination.prp --file ../../sv-benchmarks/c/termination-memory-alloca/NoriSharma-2013FSE-Fig8-alloca_true-termination.c.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 1dbac8bc Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_7b8ce021-8a8c-4a1a-8ea4-bcd66e1f5cb3/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_7b8ce021-8a8c-4a1a-8ea4-bcd66e1f5cb3/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_7b8ce021-8a8c-4a1a-8ea4-bcd66e1f5cb3/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_7b8ce021-8a8c-4a1a-8ea4-bcd66e1f5cb3/bin-2019/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/termination-memory-alloca/NoriSharma-2013FSE-Fig8-alloca_true-termination.c.i -s /tmp/vcloud-vcloud-master/worker/working_dir_7b8ce021-8a8c-4a1a-8ea4-bcd66e1f5cb3/bin-2019/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_7b8ce021-8a8c-4a1a-8ea4-bcd66e1f5cb3/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 2618f63f0acd986074ff563fe806d4dc698d3d84 .............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-1dbac8b [2018-11-10 05:59:08,711 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-10 05:59:08,712 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-10 05:59:08,718 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-10 05:59:08,718 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-10 05:59:08,719 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-10 05:59:08,720 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-10 05:59:08,721 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-10 05:59:08,722 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-10 05:59:08,723 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-10 05:59:08,723 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-10 05:59:08,723 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-10 05:59:08,724 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-10 05:59:08,725 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-10 05:59:08,725 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-10 05:59:08,727 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-10 05:59:08,727 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-10 05:59:08,728 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-10 05:59:08,730 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-10 05:59:08,731 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-10 05:59:08,732 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-10 05:59:08,733 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-10 05:59:08,734 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-10 05:59:08,734 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-10 05:59:08,734 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-10 05:59:08,736 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-10 05:59:08,736 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-10 05:59:08,737 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-10 05:59:08,737 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-10 05:59:08,738 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-10 05:59:08,738 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-10 05:59:08,739 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-10 05:59:08,740 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-10 05:59:08,740 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-10 05:59:08,740 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-10 05:59:08,741 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-10 05:59:08,741 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_7b8ce021-8a8c-4a1a-8ea4-bcd66e1f5cb3/bin-2019/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf [2018-11-10 05:59:08,751 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-10 05:59:08,751 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-10 05:59:08,752 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-10 05:59:08,752 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-10 05:59:08,752 INFO L133 SettingsManager]: * Use SBE=true [2018-11-10 05:59:08,752 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-11-10 05:59:08,752 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-11-10 05:59:08,752 INFO L133 SettingsManager]: * Use old map elimination=false [2018-11-10 05:59:08,753 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-11-10 05:59:08,753 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-11-10 05:59:08,753 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-11-10 05:59:08,753 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-10 05:59:08,753 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-10 05:59:08,753 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-10 05:59:08,754 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-10 05:59:08,754 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-11-10 05:59:08,754 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-11-10 05:59:08,754 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-11-10 05:59:08,754 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-10 05:59:08,754 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-11-10 05:59:08,755 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-11-10 05:59:08,755 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-10 05:59:08,756 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-10 05:59:08,757 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-11-10 05:59:08,757 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-10 05:59:08,757 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-10 05:59:08,757 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-11-10 05:59:08,758 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-11-10 05:59:08,758 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_7b8ce021-8a8c-4a1a-8ea4-bcd66e1f5cb3/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 -> 2618f63f0acd986074ff563fe806d4dc698d3d84 [2018-11-10 05:59:08,780 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-10 05:59:08,789 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-10 05:59:08,791 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-10 05:59:08,792 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-10 05:59:08,792 INFO L276 PluginConnector]: CDTParser initialized [2018-11-10 05:59:08,793 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_7b8ce021-8a8c-4a1a-8ea4-bcd66e1f5cb3/bin-2019/uautomizer/../../sv-benchmarks/c/termination-memory-alloca/NoriSharma-2013FSE-Fig8-alloca_true-termination.c.i [2018-11-10 05:59:08,827 INFO L218 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_7b8ce021-8a8c-4a1a-8ea4-bcd66e1f5cb3/bin-2019/uautomizer/data/8d7cebe4a/9b64528d789548a28665fc6073668a96/FLAGb1b55a465 [2018-11-10 05:59:09,232 INFO L298 CDTParser]: Found 1 translation units. [2018-11-10 05:59:09,232 INFO L158 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_7b8ce021-8a8c-4a1a-8ea4-bcd66e1f5cb3/sv-benchmarks/c/termination-memory-alloca/NoriSharma-2013FSE-Fig8-alloca_true-termination.c.i [2018-11-10 05:59:09,239 INFO L346 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_7b8ce021-8a8c-4a1a-8ea4-bcd66e1f5cb3/bin-2019/uautomizer/data/8d7cebe4a/9b64528d789548a28665fc6073668a96/FLAGb1b55a465 [2018-11-10 05:59:09,247 INFO L354 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_7b8ce021-8a8c-4a1a-8ea4-bcd66e1f5cb3/bin-2019/uautomizer/data/8d7cebe4a/9b64528d789548a28665fc6073668a96 [2018-11-10 05:59:09,249 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-10 05:59:09,250 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-10 05:59:09,250 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-10 05:59:09,250 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-10 05:59:09,253 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-10 05:59:09,253 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 05:59:09" (1/1) ... [2018-11-10 05:59:09,255 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1f4f6b59 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:59:09, skipping insertion in model container [2018-11-10 05:59:09,255 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 05:59:09" (1/1) ... [2018-11-10 05:59:09,260 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-10 05:59:09,286 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-11-10 05:59:09,459 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 05:59:09,467 INFO L189 MainTranslator]: Completed pre-run [2018-11-10 05:59:09,494 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 05:59:09,515 INFO L193 MainTranslator]: Completed translation [2018-11-10 05:59:09,516 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:59:09 WrapperNode [2018-11-10 05:59:09,516 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-10 05:59:09,516 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-10 05:59:09,516 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-10 05:59:09,517 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-10 05:59:09,522 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:59:09" (1/1) ... [2018-11-10 05:59:09,571 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:59:09" (1/1) ... [2018-11-10 05:59:09,586 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-10 05:59:09,586 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-10 05:59:09,586 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-10 05:59:09,587 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-10 05:59:09,592 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:59:09" (1/1) ... [2018-11-10 05:59:09,592 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:59:09" (1/1) ... [2018-11-10 05:59:09,594 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:59:09" (1/1) ... [2018-11-10 05:59:09,594 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:59:09" (1/1) ... [2018-11-10 05:59:09,597 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:59:09" (1/1) ... [2018-11-10 05:59:09,599 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:59:09" (1/1) ... [2018-11-10 05:59:09,600 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:59:09" (1/1) ... [2018-11-10 05:59:09,602 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-10 05:59:09,602 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-10 05:59:09,602 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-10 05:59:09,602 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-10 05:59:09,603 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:59:09" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_7b8ce021-8a8c-4a1a-8ea4-bcd66e1f5cb3/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-11-10 05:59:09,649 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-10 05:59:09,649 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-10 05:59:09,649 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-10 05:59:09,649 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-10 05:59:09,890 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-10 05:59:09,891 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 05:59:09 BoogieIcfgContainer [2018-11-10 05:59:09,891 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-10 05:59:09,891 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-11-10 05:59:09,891 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-11-10 05:59:09,894 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-11-10 05:59:09,895 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-10 05:59:09,895 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 10.11 05:59:09" (1/3) ... [2018-11-10 05:59:09,896 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@b019455 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 10.11 05:59:09, skipping insertion in model container [2018-11-10 05:59:09,896 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-10 05:59:09,896 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:59:09" (2/3) ... [2018-11-10 05:59:09,896 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@b019455 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 10.11 05:59:09, skipping insertion in model container [2018-11-10 05:59:09,896 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-10 05:59:09,897 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 05:59:09" (3/3) ... [2018-11-10 05:59:09,898 INFO L375 chiAutomizerObserver]: Analyzing ICFG NoriSharma-2013FSE-Fig8-alloca_true-termination.c.i [2018-11-10 05:59:09,945 INFO L135 ementStrategyFactory]: Using default assertion order modulation [2018-11-10 05:59:09,946 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-11-10 05:59:09,946 INFO L375 BuchiCegarLoop]: Hoare is false [2018-11-10 05:59:09,946 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-11-10 05:59:09,946 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-10 05:59:09,946 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-10 05:59:09,946 INFO L379 BuchiCegarLoop]: Difference is false [2018-11-10 05:59:09,946 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-10 05:59:09,947 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-11-10 05:59:09,959 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 35 states. [2018-11-10 05:59:09,978 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 19 [2018-11-10 05:59:09,978 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 05:59:09,978 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 05:59:09,984 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 05:59:09,984 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 05:59:09,985 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-11-10 05:59:09,985 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 35 states. [2018-11-10 05:59:09,987 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 19 [2018-11-10 05:59:09,987 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 05:59:09,987 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 05:59:09,987 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 05:59:09,987 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 05:59:09,995 INFO L793 eck$LassoCheckResult]: Stem: 29#ULTIMATE.startENTRYtrue assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 9#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;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~malloc5.base, main_#t~malloc5.offset, main_#t~malloc6.base, main_#t~malloc6.offset, main_#t~malloc7.base, main_#t~malloc7.offset, main_#t~malloc8.base, main_#t~malloc8.offset, main_#t~mem9, main_#t~mem10, main_#t~mem11, main_#t~mem14, main_#t~mem15, main_#t~mem16, main_#t~mem17, main_#t~mem18, main_#t~mem19, main_#t~mem12, main_#t~mem13, main_~u~0.base, main_~u~0.offset, main_~x~0.base, main_~x~0.offset, main_~v~0.base, main_~v~0.offset, main_~y~0.base, main_~y~0.offset, main_~w~0.base, main_~w~0.offset, main_~z~0.base, main_~z~0.offset, main_~c~0.base, main_~c~0.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~u~0.base, main_~u~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc3.base, main_#t~malloc3.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~x~0.base, main_~x~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc4.base, main_#t~malloc4.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~v~0.base, main_~v~0.offset := main_#t~malloc4.base, main_#t~malloc4.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc5.base, main_#t~malloc5.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~y~0.base, main_~y~0.offset := main_#t~malloc5.base, main_#t~malloc5.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc6.base, main_#t~malloc6.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~w~0.base, main_~w~0.offset := main_#t~malloc6.base, main_#t~malloc6.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc7.base, main_#t~malloc7.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~z~0.base, main_~z~0.offset := main_#t~malloc7.base, main_#t~malloc7.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc8.base, main_#t~malloc8.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~c~0.base, main_~c~0.offset := main_#t~malloc8.base, main_#t~malloc8.offset; 24#L554true SUMMARY for call main_#t~mem9 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L554 10#L554-1true SUMMARY for call write~int(main_#t~mem9, main_~u~0.base, main_~u~0.offset, 4); srcloc: L554-1 11#L554-2true havoc main_#t~mem9; 7#L555true SUMMARY for call main_#t~mem10 := read~int(main_~y~0.base, main_~y~0.offset, 4); srcloc: L555 8#L555-1true SUMMARY for call write~int(main_#t~mem10, main_~v~0.base, main_~v~0.offset, 4); srcloc: L555-1 28#L555-2true havoc main_#t~mem10; 21#L556true SUMMARY for call main_#t~mem11 := read~int(main_~z~0.base, main_~z~0.offset, 4); srcloc: L556 23#L556-1true SUMMARY for call write~int(main_#t~mem11, main_~w~0.base, main_~w~0.offset, 4); srcloc: L556-1 25#L556-2true havoc main_#t~mem11; 4#L557true SUMMARY for call write~int(0, main_~c~0.base, main_~c~0.offset, 4); srcloc: L557 19#L560-3true [2018-11-10 05:59:09,997 INFO L795 eck$LassoCheckResult]: Loop: 19#L560-3true assume true; 18#L558true SUMMARY for call main_#t~mem12 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L558 20#L558-1true SUMMARY for call main_#t~mem13 := read~int(main_~y~0.base, main_~y~0.offset, 4); srcloc: L558-1 22#L558-2true assume !!(main_#t~mem12 >= main_#t~mem13);havoc main_#t~mem13;havoc main_#t~mem12; 16#L559true SUMMARY for call main_#t~mem14 := read~int(main_~c~0.base, main_~c~0.offset, 4); srcloc: L559 3#L559-1true SUMMARY for call write~int(main_#t~mem14 + 1, main_~c~0.base, main_~c~0.offset, 4); srcloc: L559-1 5#L559-2true havoc main_#t~mem14; 34#L560true SUMMARY for call main_#t~mem15 := read~int(main_~z~0.base, main_~z~0.offset, 4); srcloc: L560 36#L560-1true assume !(main_#t~mem15 > 1);havoc main_#t~mem15; 27#L564true SUMMARY for call main_#t~mem19 := read~int(main_~y~0.base, main_~y~0.offset, 4); srcloc: L564 30#L564-1true SUMMARY for call write~int(main_#t~mem19 + 1, main_~y~0.base, main_~y~0.offset, 4); srcloc: L564-1 31#L564-2true havoc main_#t~mem19; 19#L560-3true [2018-11-10 05:59:10,002 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 05:59:10,002 INFO L82 PathProgramCache]: Analyzing trace with hash -1754487320, now seen corresponding path program 1 times [2018-11-10 05:59:10,004 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 05:59:10,004 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 05:59:10,050 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:59:10,051 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 05:59:10,051 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:59:10,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 05:59:10,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 05:59:10,155 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 05:59:10,155 INFO L82 PathProgramCache]: Analyzing trace with hash -1650500948, now seen corresponding path program 1 times [2018-11-10 05:59:10,155 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 05:59:10,156 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 05:59:10,157 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:59:10,157 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 05:59:10,157 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:59:10,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 05:59:10,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 05:59:10,178 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 05:59:10,178 INFO L82 PathProgramCache]: Analyzing trace with hash 511139347, now seen corresponding path program 1 times [2018-11-10 05:59:10,178 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 05:59:10,178 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 05:59:10,180 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:59:10,180 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 05:59:10,180 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:59:10,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 05:59:10,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 05:59:10,382 WARN L179 SmtUtils]: Spent 113.00 ms on a formula simplification that was a NOOP. DAG size: 72 [2018-11-10 05:59:11,210 WARN L179 SmtUtils]: Spent 770.00 ms on a formula simplification. DAG size of input: 193 DAG size of output: 166 [2018-11-10 05:59:11,620 WARN L179 SmtUtils]: Spent 407.00 ms on a formula simplification that was a NOOP. DAG size: 152 [2018-11-10 05:59:11,629 INFO L214 LassoAnalysis]: Preferences: [2018-11-10 05:59:11,630 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-10 05:59:11,630 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-10 05:59:11,631 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-10 05:59:11,631 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-10 05:59:11,631 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 05:59:11,631 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-10 05:59:11,631 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-10 05:59:11,631 INFO L131 ssoRankerPreferences]: Filename of dumped script: NoriSharma-2013FSE-Fig8-alloca_true-termination.c.i_Iteration1_Lasso [2018-11-10 05:59:11,632 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-10 05:59:11,632 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-10 05:59:11,656 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 05:59:11,667 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 05:59:11,668 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 05:59:11,669 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 05:59:11,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-11-10 05:59:11,676 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 05:59:11,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-11-10 05:59:11,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-11-10 05:59:12,740 WARN L179 SmtUtils]: Spent 466.00 ms on a formula simplification. DAG size of input: 216 DAG size of output: 166 [2018-11-10 05:59:12,964 WARN L179 SmtUtils]: Spent 214.00 ms on a formula simplification. DAG size of input: 151 DAG size of output: 133 [2018-11-10 05:59:12,964 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 05:59:12,966 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 05:59:12,967 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 05:59:12,968 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 05:59:12,971 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 05:59:12,972 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 05:59:12,973 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 05:59:12,974 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 05:59:12,976 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 05:59:12,977 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 05:59:12,979 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 05:59:12,980 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 05:59:12,981 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 05:59:13,633 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-10 05:59:13,636 INFO L496 LassoAnalysis]: Using template 'affine'. [2018-11-10 05:59:13,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-11-10 05:59:13,639 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 05:59:13,639 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 05:59:13,640 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 05:59:13,640 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 05:59:13,640 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 05:59:13,642 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 05:59:13,642 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 05:59:13,644 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 05:59:13,644 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-11-10 05:59:13,645 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 05:59:13,645 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 05:59:13,645 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 05:59:13,645 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 05:59:13,645 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 05:59:13,645 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 05:59:13,645 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 05:59:13,646 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 05:59:13,646 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-11-10 05:59:13,647 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 05:59:13,647 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 05:59:13,647 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 05:59:13,647 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 05:59:13,647 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 05:59:13,648 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 05:59:13,648 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 05:59:13,649 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 05:59:13,649 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-11-10 05:59:13,649 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 05:59:13,649 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 05:59:13,650 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 05:59:13,650 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 05:59:13,651 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 05:59:13,651 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 05:59:13,653 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 05:59:13,653 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-11-10 05:59:13,654 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 05:59:13,654 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 05:59:13,654 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 05:59:13,654 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 05:59:13,655 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 05:59:13,655 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 05:59:13,658 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 05:59:13,658 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-11-10 05:59:13,659 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 05:59:13,659 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 05:59:13,659 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 05:59:13,659 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 05:59:13,660 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 05:59:13,660 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 05:59:13,663 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 05:59:13,663 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-11-10 05:59:13,663 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 05:59:13,664 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 05:59:13,664 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 05:59:13,664 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 05:59:13,664 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 05:59:13,664 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 05:59:13,664 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 05:59:13,665 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 05:59:13,665 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-11-10 05:59:13,665 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 05:59:13,666 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 05:59:13,666 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 05:59:13,666 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 05:59:13,667 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 05:59:13,668 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 05:59:13,677 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 05:59:13,678 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-11-10 05:59:13,678 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 05:59:13,678 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 05:59:13,678 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 05:59:13,679 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 05:59:13,680 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 05:59:13,680 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 05:59:13,683 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 05:59:13,684 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-11-10 05:59:13,684 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 05:59:13,684 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 05:59:13,684 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 05:59:13,684 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 05:59:13,686 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 05:59:13,686 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 05:59:13,689 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 05:59:13,690 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-11-10 05:59:13,690 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 05:59:13,690 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 05:59:13,690 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 05:59:13,690 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 05:59:13,690 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 05:59:13,691 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 05:59:13,691 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 05:59:13,692 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 05:59:13,692 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-11-10 05:59:13,692 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 05:59:13,692 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-10 05:59:13,692 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 05:59:13,693 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 05:59:13,694 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-10 05:59:13,694 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 05:59:13,701 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 05:59:13,702 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-11-10 05:59:13,702 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 05:59:13,702 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 05:59:13,702 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 05:59:13,702 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 05:59:13,703 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 05:59:13,703 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 05:59:13,707 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 05:59:13,708 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-11-10 05:59:13,708 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 05:59:13,708 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 05:59:13,708 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 05:59:13,708 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 05:59:13,709 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 05:59:13,709 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 05:59:13,712 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 05:59:13,713 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-11-10 05:59:13,713 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 05:59:13,713 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 05:59:13,713 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 05:59:13,713 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 05:59:13,715 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 05:59:13,715 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 05:59:13,724 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 05:59:13,724 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-11-10 05:59:13,725 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 05:59:13,725 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 05:59:13,725 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 05:59:13,725 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 05:59:13,726 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 05:59:13,726 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 05:59:13,728 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 05:59:13,728 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-11-10 05:59:13,729 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 05:59:13,729 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 05:59:13,729 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 05:59:13,729 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 05:59:13,729 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 05:59:13,729 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 05:59:13,730 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 05:59:13,730 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 05:59:13,731 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-11-10 05:59:13,731 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 05:59:13,731 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-10 05:59:13,731 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 05:59:13,731 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 05:59:13,732 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-10 05:59:13,733 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 05:59:13,738 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 05:59:13,738 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-11-10 05:59:13,738 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 05:59:13,739 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 05:59:13,739 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 05:59:13,739 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 05:59:13,740 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 05:59:13,740 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 05:59:13,748 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 05:59:13,748 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-11-10 05:59:13,749 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 05:59:13,749 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 05:59:13,749 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 05:59:13,749 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 05:59:13,749 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 05:59:13,750 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 05:59:13,750 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 05:59:13,750 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 05:59:13,751 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-11-10 05:59:13,751 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 05:59:13,751 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 05:59:13,751 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 05:59:13,752 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 05:59:13,753 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 05:59:13,753 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 05:59:13,759 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 05:59:13,760 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-11-10 05:59:13,760 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 05:59:13,760 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 05:59:13,761 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 05:59:13,761 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 05:59:13,761 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 05:59:13,761 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 05:59:13,761 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 05:59:13,763 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-10 05:59:13,766 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-10 05:59:13,766 INFO L444 ModelExtractionUtils]: 0 out of 4 variables were initially zero. Simplification set additionally 0 variables to zero. [2018-11-10 05:59:13,768 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-10 05:59:13,768 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-11-10 05:59:13,768 INFO L517 LassoAnalysis]: Proved termination. [2018-11-10 05:59:13,769 INFO L519 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_~y~0.base) ULTIMATE.start_main_~y~0.offset)_1) = 2*v_rep(select (select #memory_int ULTIMATE.start_main_~x~0.base) ULTIMATE.start_main_~x~0.offset)_1 - 2*v_rep(select (select #memory_int ULTIMATE.start_main_~y~0.base) ULTIMATE.start_main_~y~0.offset)_1 + 1 Supporting invariants [] [2018-11-10 05:59:14,191 INFO L297 tatePredicateManager]: 112 out of 116 supporting invariants were superfluous and have been removed [2018-11-10 05:59:14,199 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 05:59:14,200 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 05:59:14,216 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 05:59:14,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:59:14,238 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 05:59:14,267 INFO L477 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 86 treesize of output 76 [2018-11-10 05:59:14,288 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 05:59:14,290 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 05:59:14,291 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 73 treesize of output 80 [2018-11-10 05:59:14,326 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 05:59:14,327 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 05:59:14,328 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 05:59:14,328 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 05:59:14,330 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 82 [2018-11-10 05:59:14,396 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 05:59:14,397 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 05:59:14,398 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 05:59:14,399 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 05:59:14,401 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 90 [2018-11-10 05:59:14,459 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 05:59:14,460 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 05:59:14,461 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 05:59:14,462 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 05:59:14,463 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 05:59:14,464 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 05:59:14,465 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 05:59:14,466 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 05:59:14,467 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 15 disjoint index pairs (out of 15 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 101 [2018-11-10 05:59:14,538 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 05:59:14,539 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 05:59:14,540 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 05:59:14,540 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 05:59:14,541 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 05:59:14,542 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 05:59:14,543 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 05:59:14,544 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 05:59:14,544 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 05:59:14,546 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 7 select indices, 7 select index equivalence classes, 21 disjoint index pairs (out of 21 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 81 [2018-11-10 05:59:14,547 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-10 05:59:14,605 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 05:59:14,637 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 05:59:14,661 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 05:59:14,697 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 05:59:14,720 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 05:59:14,746 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 05:59:14,747 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 5 variables, input treesize:93, output treesize:20 [2018-11-10 05:59:14,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:59:14,776 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 05:59:14,848 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 05:59:14,852 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 05:59:14,862 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 51 treesize of output 75 [2018-11-10 05:59:14,867 INFO L477 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 66 treesize of output 61 [2018-11-10 05:59:14,868 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 05:59:14,902 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 05:59:14,911 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 45 treesize of output 63 [2018-11-10 05:59:14,913 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 3 xjuncts. [2018-11-10 05:59:14,957 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 3 xjuncts. [2018-11-10 05:59:14,989 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 3 xjuncts. [2018-11-10 05:59:14,989 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:65, output treesize:147 [2018-11-10 05:59:15,161 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 05:59:15,164 INFO L477 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 65 treesize of output 69 [2018-11-10 05:59:15,168 INFO L477 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 31 treesize of output 24 [2018-11-10 05:59:15,170 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 05:59:15,180 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 05:59:15,210 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 05:59:15,210 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 65 treesize of output 68 [2018-11-10 05:59:15,213 INFO L477 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 50 treesize of output 41 [2018-11-10 05:59:15,213 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-10 05:59:15,228 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-10 05:59:15,261 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-11-10 05:59:15,261 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:131, output treesize:92 [2018-11-10 05:59:15,304 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 05:59:15,313 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 8 loop predicates [2018-11-10 05:59:15,314 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 35 states. Second operand 11 states. [2018-11-10 05:59:15,503 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 35 states.. Second operand 11 states. Result 70 states and 76 transitions. Complement of second has 19 states. [2018-11-10 05:59:15,504 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 11 states 2 stem states 7 non-accepting loop states 1 accepting loop states [2018-11-10 05:59:15,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-11-10 05:59:15,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 33 transitions. [2018-11-10 05:59:15,507 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 33 transitions. Stem has 12 letters. Loop has 12 letters. [2018-11-10 05:59:15,508 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 05:59:15,508 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 33 transitions. Stem has 24 letters. Loop has 12 letters. [2018-11-10 05:59:15,508 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 05:59:15,508 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 33 transitions. Stem has 12 letters. Loop has 24 letters. [2018-11-10 05:59:15,509 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 05:59:15,509 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 70 states and 76 transitions. [2018-11-10 05:59:15,512 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 19 [2018-11-10 05:59:15,515 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 70 states to 56 states and 59 transitions. [2018-11-10 05:59:15,516 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 42 [2018-11-10 05:59:15,516 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 44 [2018-11-10 05:59:15,517 INFO L73 IsDeterministic]: Start isDeterministic. Operand 56 states and 59 transitions. [2018-11-10 05:59:15,517 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 05:59:15,517 INFO L705 BuchiCegarLoop]: Abstraction has 56 states and 59 transitions. [2018-11-10 05:59:15,528 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states and 59 transitions. [2018-11-10 05:59:15,535 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 53. [2018-11-10 05:59:15,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2018-11-10 05:59:15,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 56 transitions. [2018-11-10 05:59:15,537 INFO L728 BuchiCegarLoop]: Abstraction has 53 states and 56 transitions. [2018-11-10 05:59:15,537 INFO L608 BuchiCegarLoop]: Abstraction has 53 states and 56 transitions. [2018-11-10 05:59:15,537 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-11-10 05:59:15,537 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 53 states and 56 transitions. [2018-11-10 05:59:15,538 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 19 [2018-11-10 05:59:15,538 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 05:59:15,538 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 05:59:15,539 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 05:59:15,539 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 05:59:15,539 INFO L793 eck$LassoCheckResult]: Stem: 736#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 709#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;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~malloc5.base, main_#t~malloc5.offset, main_#t~malloc6.base, main_#t~malloc6.offset, main_#t~malloc7.base, main_#t~malloc7.offset, main_#t~malloc8.base, main_#t~malloc8.offset, main_#t~mem9, main_#t~mem10, main_#t~mem11, main_#t~mem14, main_#t~mem15, main_#t~mem16, main_#t~mem17, main_#t~mem18, main_#t~mem19, main_#t~mem12, main_#t~mem13, main_~u~0.base, main_~u~0.offset, main_~x~0.base, main_~x~0.offset, main_~v~0.base, main_~v~0.offset, main_~y~0.base, main_~y~0.offset, main_~w~0.base, main_~w~0.offset, main_~z~0.base, main_~z~0.offset, main_~c~0.base, main_~c~0.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~u~0.base, main_~u~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc3.base, main_#t~malloc3.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~x~0.base, main_~x~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc4.base, main_#t~malloc4.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~v~0.base, main_~v~0.offset := main_#t~malloc4.base, main_#t~malloc4.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc5.base, main_#t~malloc5.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~y~0.base, main_~y~0.offset := main_#t~malloc5.base, main_#t~malloc5.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc6.base, main_#t~malloc6.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~w~0.base, main_~w~0.offset := main_#t~malloc6.base, main_#t~malloc6.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc7.base, main_#t~malloc7.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~z~0.base, main_~z~0.offset := main_#t~malloc7.base, main_#t~malloc7.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc8.base, main_#t~malloc8.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~c~0.base, main_~c~0.offset := main_#t~malloc8.base, main_#t~malloc8.offset; 710#L554 SUMMARY for call main_#t~mem9 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L554 711#L554-1 SUMMARY for call write~int(main_#t~mem9, main_~u~0.base, main_~u~0.offset, 4); srcloc: L554-1 712#L554-2 havoc main_#t~mem9; 706#L555 SUMMARY for call main_#t~mem10 := read~int(main_~y~0.base, main_~y~0.offset, 4); srcloc: L555 707#L555-1 SUMMARY for call write~int(main_#t~mem10, main_~v~0.base, main_~v~0.offset, 4); srcloc: L555-1 708#L555-2 havoc main_#t~mem10; 727#L556 SUMMARY for call main_#t~mem11 := read~int(main_~z~0.base, main_~z~0.offset, 4); srcloc: L556 728#L556-1 SUMMARY for call write~int(main_#t~mem11, main_~w~0.base, main_~w~0.offset, 4); srcloc: L556-1 729#L556-2 havoc main_#t~mem11; 704#L557 SUMMARY for call write~int(0, main_~c~0.base, main_~c~0.offset, 4); srcloc: L557 705#L560-3 assume true; 719#L558 SUMMARY for call main_#t~mem12 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L558 720#L558-1 SUMMARY for call main_#t~mem13 := read~int(main_~y~0.base, main_~y~0.offset, 4); srcloc: L558-1 725#L558-2 assume !!(main_#t~mem12 >= main_#t~mem13);havoc main_#t~mem13;havoc main_#t~mem12; 716#L559 SUMMARY for call main_#t~mem14 := read~int(main_~c~0.base, main_~c~0.offset, 4); srcloc: L559 698#L559-1 SUMMARY for call write~int(main_#t~mem14 + 1, main_~c~0.base, main_~c~0.offset, 4); srcloc: L559-1 699#L559-2 havoc main_#t~mem14; 702#L560 SUMMARY for call main_#t~mem15 := read~int(main_~z~0.base, main_~z~0.offset, 4); srcloc: L560 740#L560-1 assume main_#t~mem15 > 1;havoc main_#t~mem15; 713#L561 [2018-11-10 05:59:15,539 INFO L795 eck$LassoCheckResult]: Loop: 713#L561 SUMMARY for call main_#t~mem16 := read~int(main_~z~0.base, main_~z~0.offset, 4); srcloc: L561 714#L561-1 SUMMARY for call write~int(main_#t~mem16 - 1, main_~z~0.base, main_~z~0.offset, 4); srcloc: L561-1 715#L561-2 havoc main_#t~mem16; 718#L562 SUMMARY for call main_#t~mem17 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L562 738#L562-1 SUMMARY for call main_#t~mem18 := read~int(main_~z~0.base, main_~z~0.offset, 4); srcloc: L562-1 739#L562-2 SUMMARY for call write~int(main_#t~mem17 + main_#t~mem18, main_~x~0.base, main_~x~0.offset, 4); srcloc: L562-2 742#L562-3 havoc main_#t~mem17;havoc main_#t~mem18; 737#L560-3 assume true; 750#L558 SUMMARY for call main_#t~mem12 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L558 749#L558-1 SUMMARY for call main_#t~mem13 := read~int(main_~y~0.base, main_~y~0.offset, 4); srcloc: L558-1 748#L558-2 assume !!(main_#t~mem12 >= main_#t~mem13);havoc main_#t~mem13;havoc main_#t~mem12; 747#L559 SUMMARY for call main_#t~mem14 := read~int(main_~c~0.base, main_~c~0.offset, 4); srcloc: L559 746#L559-1 SUMMARY for call write~int(main_#t~mem14 + 1, main_~c~0.base, main_~c~0.offset, 4); srcloc: L559-1 745#L559-2 havoc main_#t~mem14; 744#L560 SUMMARY for call main_#t~mem15 := read~int(main_~z~0.base, main_~z~0.offset, 4); srcloc: L560 743#L560-1 assume main_#t~mem15 > 1;havoc main_#t~mem15; 713#L561 [2018-11-10 05:59:15,539 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 05:59:15,540 INFO L82 PathProgramCache]: Analyzing trace with hash 1679741358, now seen corresponding path program 1 times [2018-11-10 05:59:15,540 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 05:59:15,540 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 05:59:15,541 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:59:15,541 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 05:59:15,541 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:59:15,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 05:59:15,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 05:59:15,587 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 05:59:15,587 INFO L82 PathProgramCache]: Analyzing trace with hash 974138228, now seen corresponding path program 1 times [2018-11-10 05:59:15,587 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 05:59:15,587 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 05:59:15,588 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:59:15,588 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 05:59:15,588 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:59:15,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 05:59:15,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 05:59:15,598 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 05:59:15,598 INFO L82 PathProgramCache]: Analyzing trace with hash -751303903, now seen corresponding path program 1 times [2018-11-10 05:59:15,598 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 05:59:15,599 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 05:59:15,599 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:59:15,599 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 05:59:15,599 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:59:15,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 05:59:15,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 05:59:16,566 WARN L179 SmtUtils]: Spent 794.00 ms on a formula simplification. DAG size of input: 216 DAG size of output: 186 [2018-11-10 05:59:17,004 WARN L179 SmtUtils]: Spent 436.00 ms on a formula simplification that was a NOOP. DAG size: 159 [2018-11-10 05:59:17,008 INFO L214 LassoAnalysis]: Preferences: [2018-11-10 05:59:17,008 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-10 05:59:17,008 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-10 05:59:17,008 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-10 05:59:17,008 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-10 05:59:17,008 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 05:59:17,008 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-10 05:59:17,008 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-10 05:59:17,008 INFO L131 ssoRankerPreferences]: Filename of dumped script: NoriSharma-2013FSE-Fig8-alloca_true-termination.c.i_Iteration2_Lasso [2018-11-10 05:59:17,008 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-10 05:59:17,008 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-10 05:59:17,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-11-10 05:59:17,016 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 05:59:17,024 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 05:59:17,027 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 05:59:17,028 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 05:59:17,030 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 05:59:17,035 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 05:59:17,038 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 05:59:17,040 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 05:59:17,042 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 05:59:17,043 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 05:59:17,045 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 05:59:17,046 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 05:59:18,165 WARN L179 SmtUtils]: Spent 469.00 ms on a formula simplification. DAG size of input: 219 DAG size of output: 173 [2018-11-10 05:59:18,407 WARN L179 SmtUtils]: Spent 234.00 ms on a formula simplification. DAG size of input: 155 DAG size of output: 137 [2018-11-10 05:59:18,407 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 05:59:18,409 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 05:59:18,410 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 05:59:18,411 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 05:59:18,412 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 05:59:18,413 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 05:59:18,415 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 05:59:18,416 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 05:59:18,418 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 05:59:18,609 WARN L179 SmtUtils]: Spent 164.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 70 [2018-11-10 05:59:19,107 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-10 05:59:19,107 INFO L496 LassoAnalysis]: Using template 'affine'. [2018-11-10 05:59:19,107 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-11-10 05:59:19,108 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 05:59:19,108 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 05:59:19,108 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 05:59:19,108 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 05:59:19,108 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 05:59:19,109 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 05:59:19,109 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 05:59:19,109 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 05:59:19,110 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-11-10 05:59:19,110 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 05:59:19,110 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 05:59:19,110 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 05:59:19,110 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 05:59:19,110 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 05:59:19,111 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 05:59:19,111 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 05:59:19,117 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 05:59:19,117 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-11-10 05:59:19,117 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 05:59:19,117 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 05:59:19,118 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 05:59:19,118 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 05:59:19,118 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 05:59:19,118 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 05:59:19,120 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 05:59:19,120 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-11-10 05:59:19,120 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 05:59:19,120 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 05:59:19,120 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 05:59:19,120 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 05:59:19,121 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 05:59:19,121 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 05:59:19,121 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 05:59:19,121 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 05:59:19,121 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-11-10 05:59:19,122 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 05:59:19,122 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 05:59:19,122 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 05:59:19,122 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 05:59:19,122 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 05:59:19,122 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 05:59:19,122 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 05:59:19,123 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 05:59:19,123 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-11-10 05:59:19,123 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 05:59:19,123 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 05:59:19,123 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 05:59:19,124 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 05:59:19,124 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 05:59:19,124 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 05:59:19,124 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 05:59:19,124 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 05:59:19,124 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-11-10 05:59:19,125 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 05:59:19,125 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 05:59:19,125 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 05:59:19,125 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 05:59:19,125 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 05:59:19,126 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 05:59:19,127 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 05:59:19,128 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-11-10 05:59:19,129 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 05:59:19,129 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 05:59:19,129 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 05:59:19,129 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 05:59:19,130 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 05:59:19,130 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 05:59:19,132 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 05:59:19,132 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-11-10 05:59:19,132 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 05:59:19,132 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 05:59:19,132 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 05:59:19,133 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 05:59:19,133 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 05:59:19,133 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 05:59:19,134 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 05:59:19,134 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-11-10 05:59:19,135 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 05:59:19,135 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 05:59:19,135 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 05:59:19,135 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 05:59:19,136 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 05:59:19,136 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 05:59:19,137 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 05:59:19,137 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-11-10 05:59:19,137 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 05:59:19,137 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 05:59:19,138 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 05:59:19,138 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 05:59:19,138 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 05:59:19,138 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 05:59:19,139 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 05:59:19,140 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-11-10 05:59:19,140 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 05:59:19,140 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 05:59:19,140 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 05:59:19,140 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 05:59:19,140 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 05:59:19,141 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 05:59:19,141 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 05:59:19,141 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 05:59:19,141 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-11-10 05:59:19,142 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 05:59:19,142 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 05:59:19,142 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 05:59:19,142 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 05:59:19,147 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 05:59:19,147 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 05:59:19,170 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 05:59:19,171 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-11-10 05:59:19,171 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 05:59:19,171 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 05:59:19,171 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 05:59:19,171 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 05:59:19,172 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 05:59:19,172 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 05:59:19,174 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 05:59:19,174 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-11-10 05:59:19,175 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 05:59:19,175 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 05:59:19,175 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 05:59:19,175 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 05:59:19,176 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 05:59:19,176 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 05:59:19,178 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 05:59:19,178 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-11-10 05:59:19,178 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 05:59:19,178 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 05:59:19,178 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 05:59:19,179 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 05:59:19,179 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 05:59:19,179 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 05:59:19,183 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 05:59:19,184 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-11-10 05:59:19,184 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 05:59:19,184 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 05:59:19,184 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 05:59:19,184 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 05:59:19,185 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 05:59:19,185 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 05:59:19,188 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 05:59:19,188 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-11-10 05:59:19,189 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 05:59:19,189 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 05:59:19,189 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 05:59:19,189 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 05:59:19,190 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 05:59:19,190 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 05:59:19,193 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 05:59:19,194 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-11-10 05:59:19,194 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 05:59:19,194 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 05:59:19,194 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 05:59:19,194 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 05:59:19,195 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 05:59:19,195 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 05:59:19,203 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-10 05:59:19,206 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-10 05:59:19,206 INFO L444 ModelExtractionUtils]: 10 out of 13 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-11-10 05:59:19,207 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-10 05:59:19,207 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-10 05:59:19,208 INFO L517 LassoAnalysis]: Proved termination. [2018-11-10 05:59:19,208 INFO L519 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-11-10 05:59:19,759 INFO L297 tatePredicateManager]: 113 out of 116 supporting invariants were superfluous and have been removed [2018-11-10 05:59:19,762 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 05:59:19,774 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 05:59:19,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:59:19,789 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 05:59:19,793 INFO L477 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 69 treesize of output 62 [2018-11-10 05:59:19,802 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 05:59:19,804 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 05:59:19,804 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 69 [2018-11-10 05:59:19,823 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 05:59:19,824 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 05:59:19,824 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 05:59:19,825 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 05:59:19,826 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 74 [2018-11-10 05:59:19,829 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 66 [2018-11-10 05:59:19,860 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 05:59:19,861 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 05:59:19,863 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 05:59:19,864 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 05:59:19,865 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 05:59:19,866 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 85 [2018-11-10 05:59:19,907 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 05:59:19,911 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 05:59:19,911 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 05:59:19,912 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 05:59:19,913 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 05:59:19,915 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 05:59:19,916 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 7 select indices, 7 select index equivalence classes, 17 disjoint index pairs (out of 21 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 65 [2018-11-10 05:59:19,916 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-10 05:59:19,935 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 05:59:19,948 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 05:59:19,961 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 05:59:19,974 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 05:59:19,987 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 05:59:20,004 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 05:59:20,004 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 5 variables, input treesize:73, output treesize:17 [2018-11-10 05:59:20,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:59:20,020 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 05:59:20,035 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 05:59:20,036 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 28 treesize of output 29 [2018-11-10 05:59:20,038 INFO L477 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 29 treesize of output 22 [2018-11-10 05:59:20,039 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 05:59:20,044 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 05:59:20,051 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 05:59:20,051 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:39, output treesize:21 [2018-11-10 05:59:20,070 INFO L477 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 23 treesize of output 24 [2018-11-10 05:59:20,072 INFO L477 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-11-10 05:59:20,073 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 05:59:20,077 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 05:59:20,087 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 05:59:20,087 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:34, output treesize:21 [2018-11-10 05:59:20,093 INFO L477 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 24 [2018-11-10 05:59:20,095 INFO L477 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-11-10 05:59:20,095 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 05:59:20,099 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 05:59:20,104 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 05:59:20,105 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:34, output treesize:21 [2018-11-10 05:59:20,116 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 05:59:20,116 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-11-10 05:59:20,117 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 53 states and 56 transitions. cyclomatic complexity: 5 Second operand 6 states. [2018-11-10 05:59:20,192 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 53 states and 56 transitions. cyclomatic complexity: 5. Second operand 6 states. Result 89 states and 94 transitions. Complement of second has 10 states. [2018-11-10 05:59:20,192 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-11-10 05:59:20,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-10 05:59:20,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 43 transitions. [2018-11-10 05:59:20,193 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 43 transitions. Stem has 21 letters. Loop has 16 letters. [2018-11-10 05:59:20,193 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 05:59:20,193 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 43 transitions. Stem has 37 letters. Loop has 16 letters. [2018-11-10 05:59:20,193 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 05:59:20,193 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 43 transitions. Stem has 21 letters. Loop has 32 letters. [2018-11-10 05:59:20,194 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 05:59:20,194 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 89 states and 94 transitions. [2018-11-10 05:59:20,195 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 19 [2018-11-10 05:59:20,195 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 89 states to 87 states and 92 transitions. [2018-11-10 05:59:20,195 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 58 [2018-11-10 05:59:20,195 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 59 [2018-11-10 05:59:20,196 INFO L73 IsDeterministic]: Start isDeterministic. Operand 87 states and 92 transitions. [2018-11-10 05:59:20,196 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 05:59:20,196 INFO L705 BuchiCegarLoop]: Abstraction has 87 states and 92 transitions. [2018-11-10 05:59:20,196 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states and 92 transitions. [2018-11-10 05:59:20,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 85. [2018-11-10 05:59:20,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2018-11-10 05:59:20,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 90 transitions. [2018-11-10 05:59:20,198 INFO L728 BuchiCegarLoop]: Abstraction has 85 states and 90 transitions. [2018-11-10 05:59:20,198 INFO L608 BuchiCegarLoop]: Abstraction has 85 states and 90 transitions. [2018-11-10 05:59:20,198 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-11-10 05:59:20,199 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 85 states and 90 transitions. [2018-11-10 05:59:20,199 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 19 [2018-11-10 05:59:20,200 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 05:59:20,200 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 05:59:20,200 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 05:59:20,200 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 05:59:20,201 INFO L793 eck$LassoCheckResult]: Stem: 1496#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 1463#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;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~malloc5.base, main_#t~malloc5.offset, main_#t~malloc6.base, main_#t~malloc6.offset, main_#t~malloc7.base, main_#t~malloc7.offset, main_#t~malloc8.base, main_#t~malloc8.offset, main_#t~mem9, main_#t~mem10, main_#t~mem11, main_#t~mem14, main_#t~mem15, main_#t~mem16, main_#t~mem17, main_#t~mem18, main_#t~mem19, main_#t~mem12, main_#t~mem13, main_~u~0.base, main_~u~0.offset, main_~x~0.base, main_~x~0.offset, main_~v~0.base, main_~v~0.offset, main_~y~0.base, main_~y~0.offset, main_~w~0.base, main_~w~0.offset, main_~z~0.base, main_~z~0.offset, main_~c~0.base, main_~c~0.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~u~0.base, main_~u~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc3.base, main_#t~malloc3.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~x~0.base, main_~x~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc4.base, main_#t~malloc4.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~v~0.base, main_~v~0.offset := main_#t~malloc4.base, main_#t~malloc4.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc5.base, main_#t~malloc5.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~y~0.base, main_~y~0.offset := main_#t~malloc5.base, main_#t~malloc5.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc6.base, main_#t~malloc6.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~w~0.base, main_~w~0.offset := main_#t~malloc6.base, main_#t~malloc6.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc7.base, main_#t~malloc7.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~z~0.base, main_~z~0.offset := main_#t~malloc7.base, main_#t~malloc7.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc8.base, main_#t~malloc8.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~c~0.base, main_~c~0.offset := main_#t~malloc8.base, main_#t~malloc8.offset; 1464#L554 SUMMARY for call main_#t~mem9 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L554 1465#L554-1 SUMMARY for call write~int(main_#t~mem9, main_~u~0.base, main_~u~0.offset, 4); srcloc: L554-1 1466#L554-2 havoc main_#t~mem9; 1460#L555 SUMMARY for call main_#t~mem10 := read~int(main_~y~0.base, main_~y~0.offset, 4); srcloc: L555 1461#L555-1 SUMMARY for call write~int(main_#t~mem10, main_~v~0.base, main_~v~0.offset, 4); srcloc: L555-1 1462#L555-2 havoc main_#t~mem10; 1487#L556 SUMMARY for call main_#t~mem11 := read~int(main_~z~0.base, main_~z~0.offset, 4); srcloc: L556 1488#L556-1 SUMMARY for call write~int(main_#t~mem11, main_~w~0.base, main_~w~0.offset, 4); srcloc: L556-1 1489#L556-2 havoc main_#t~mem11; 1458#L557 SUMMARY for call write~int(0, main_~c~0.base, main_~c~0.offset, 4); srcloc: L557 1459#L560-3 assume true; 1526#L558 SUMMARY for call main_#t~mem12 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L558 1524#L558-1 SUMMARY for call main_#t~mem13 := read~int(main_~y~0.base, main_~y~0.offset, 4); srcloc: L558-1 1522#L558-2 assume !!(main_#t~mem12 >= main_#t~mem13);havoc main_#t~mem13;havoc main_#t~mem12; 1520#L559 SUMMARY for call main_#t~mem14 := read~int(main_~c~0.base, main_~c~0.offset, 4); srcloc: L559 1518#L559-1 SUMMARY for call write~int(main_#t~mem14 + 1, main_~c~0.base, main_~c~0.offset, 4); srcloc: L559-1 1516#L559-2 havoc main_#t~mem14; 1513#L560 SUMMARY for call main_#t~mem15 := read~int(main_~z~0.base, main_~z~0.offset, 4); srcloc: L560 1512#L560-1 assume main_#t~mem15 > 1;havoc main_#t~mem15; 1511#L561 SUMMARY for call main_#t~mem16 := read~int(main_~z~0.base, main_~z~0.offset, 4); srcloc: L561 1471#L561-1 SUMMARY for call write~int(main_#t~mem16 - 1, main_~z~0.base, main_~z~0.offset, 4); srcloc: L561-1 1472#L561-2 havoc main_#t~mem16; 1477#L562 SUMMARY for call main_#t~mem17 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L562 1500#L562-1 SUMMARY for call main_#t~mem18 := read~int(main_~z~0.base, main_~z~0.offset, 4); srcloc: L562-1 1502#L562-2 SUMMARY for call write~int(main_#t~mem17 + main_#t~mem18, main_~x~0.base, main_~x~0.offset, 4); srcloc: L562-2 1507#L562-3 havoc main_#t~mem17;havoc main_#t~mem18; 1485#L560-3 assume true; 1479#L558 SUMMARY for call main_#t~mem12 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L558 1480#L558-1 SUMMARY for call main_#t~mem13 := read~int(main_~y~0.base, main_~y~0.offset, 4); srcloc: L558-1 1483#L558-2 assume !!(main_#t~mem12 >= main_#t~mem13);havoc main_#t~mem13;havoc main_#t~mem12; 1474#L559 SUMMARY for call main_#t~mem14 := read~int(main_~c~0.base, main_~c~0.offset, 4); srcloc: L559 1452#L559-1 SUMMARY for call write~int(main_#t~mem14 + 1, main_~c~0.base, main_~c~0.offset, 4); srcloc: L559-1 1453#L559-2 havoc main_#t~mem14; 1456#L560 SUMMARY for call main_#t~mem15 := read~int(main_~z~0.base, main_~z~0.offset, 4); srcloc: L560 1504#L560-1 assume !(main_#t~mem15 > 1);havoc main_#t~mem15; 1490#L564 [2018-11-10 05:59:20,201 INFO L795 eck$LassoCheckResult]: Loop: 1490#L564 SUMMARY for call main_#t~mem19 := read~int(main_~y~0.base, main_~y~0.offset, 4); srcloc: L564 1491#L564-1 SUMMARY for call write~int(main_#t~mem19 + 1, main_~y~0.base, main_~y~0.offset, 4); srcloc: L564-1 1494#L564-2 havoc main_#t~mem19; 1497#L560-3 assume true; 1528#L558 SUMMARY for call main_#t~mem12 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L558 1527#L558-1 SUMMARY for call main_#t~mem13 := read~int(main_~y~0.base, main_~y~0.offset, 4); srcloc: L558-1 1525#L558-2 assume !!(main_#t~mem12 >= main_#t~mem13);havoc main_#t~mem13;havoc main_#t~mem12; 1523#L559 SUMMARY for call main_#t~mem14 := read~int(main_~c~0.base, main_~c~0.offset, 4); srcloc: L559 1521#L559-1 SUMMARY for call write~int(main_#t~mem14 + 1, main_~c~0.base, main_~c~0.offset, 4); srcloc: L559-1 1519#L559-2 havoc main_#t~mem14; 1517#L560 SUMMARY for call main_#t~mem15 := read~int(main_~z~0.base, main_~z~0.offset, 4); srcloc: L560 1515#L560-1 assume !(main_#t~mem15 > 1);havoc main_#t~mem15; 1490#L564 [2018-11-10 05:59:20,201 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 05:59:20,201 INFO L82 PathProgramCache]: Analyzing trace with hash -751303894, now seen corresponding path program 1 times [2018-11-10 05:59:20,201 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 05:59:20,201 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 05:59:20,202 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:59:20,202 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 05:59:20,202 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:59:20,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 05:59:20,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 05:59:20,260 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 05:59:20,261 INFO L82 PathProgramCache]: Analyzing trace with hash 1231366454, now seen corresponding path program 2 times [2018-11-10 05:59:20,261 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 05:59:20,261 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 05:59:20,261 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:59:20,262 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 05:59:20,262 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:59:20,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 05:59:20,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 05:59:20,269 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 05:59:20,269 INFO L82 PathProgramCache]: Analyzing trace with hash -995313953, now seen corresponding path program 1 times [2018-11-10 05:59:20,269 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 05:59:20,269 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 05:59:20,269 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:59:20,269 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 05:59:20,270 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:59:20,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 05:59:20,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 05:59:22,855 WARN L179 SmtUtils]: Spent 2.42 s on a formula simplification. DAG size of input: 261 DAG size of output: 230 [2018-11-10 05:59:23,844 WARN L179 SmtUtils]: Spent 985.00 ms on a formula simplification that was a NOOP. DAG size: 176 [2018-11-10 05:59:23,847 INFO L214 LassoAnalysis]: Preferences: [2018-11-10 05:59:23,847 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-10 05:59:23,847 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-10 05:59:23,848 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-10 05:59:23,848 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-10 05:59:23,848 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 05:59:23,848 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-10 05:59:23,848 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-10 05:59:23,848 INFO L131 ssoRankerPreferences]: Filename of dumped script: NoriSharma-2013FSE-Fig8-alloca_true-termination.c.i_Iteration3_Lasso [2018-11-10 05:59:23,848 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-10 05:59:23,848 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-10 05:59:23,851 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 05:59:23,855 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 05:59:23,856 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 05:59:23,857 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 05:59:23,860 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 05:59:23,861 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 05:59:23,862 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 05:59:23,863 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 05:59:23,868 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 05:59:23,869 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 05:59:23,871 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 05:59:23,874 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 05:59:25,526 WARN L179 SmtUtils]: Spent 540.00 ms on a formula simplification. DAG size of input: 223 DAG size of output: 181 [2018-11-10 05:59:25,747 WARN L179 SmtUtils]: Spent 215.00 ms on a formula simplification. DAG size of input: 142 DAG size of output: 124 [2018-11-10 05:59:25,748 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 05:59:25,749 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 05:59:25,749 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 05:59:25,750 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 05:59:25,751 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 05:59:25,752 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 05:59:25,753 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 05:59:25,754 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 05:59:25,756 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 05:59:25,952 WARN L179 SmtUtils]: Spent 170.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 81 [2018-11-10 05:59:26,440 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-10 05:59:26,440 INFO L496 LassoAnalysis]: Using template 'affine'. [2018-11-10 05:59:26,441 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-11-10 05:59:26,441 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 05:59:26,441 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 05:59:26,442 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 05:59:26,442 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 05:59:26,442 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 05:59:26,442 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 05:59:26,442 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 05:59:26,443 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 05:59:26,443 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-11-10 05:59:26,443 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 05:59:26,443 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 05:59:26,443 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 05:59:26,444 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 05:59:26,444 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 05:59:26,444 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 05:59:26,444 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 05:59:26,444 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 05:59:26,444 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-11-10 05:59:26,445 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 05:59:26,445 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 05:59:26,445 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 05:59:26,445 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 05:59:26,445 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 05:59:26,445 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 05:59:26,445 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 05:59:26,445 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 05:59:26,446 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-11-10 05:59:26,446 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 05:59:26,446 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 05:59:26,446 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 05:59:26,446 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 05:59:26,446 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 05:59:26,446 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 05:59:26,447 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 05:59:26,447 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-11-10 05:59:26,448 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 05:59:26,448 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 05:59:26,448 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 05:59:26,448 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 05:59:26,448 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 05:59:26,448 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 05:59:26,448 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 05:59:26,449 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 05:59:26,449 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-11-10 05:59:26,449 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 05:59:26,449 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 05:59:26,450 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 05:59:26,450 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 05:59:26,450 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 05:59:26,450 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 05:59:26,451 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 05:59:26,451 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-11-10 05:59:26,452 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 05:59:26,452 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 05:59:26,452 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 05:59:26,452 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 05:59:26,452 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 05:59:26,453 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 05:59:26,453 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 05:59:26,453 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 05:59:26,454 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-11-10 05:59:26,454 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 05:59:26,454 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 05:59:26,454 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 05:59:26,454 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 05:59:26,455 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 05:59:26,455 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 05:59:26,456 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 05:59:26,456 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-11-10 05:59:26,456 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 05:59:26,457 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 05:59:26,457 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 05:59:26,457 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 05:59:26,457 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 05:59:26,457 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 05:59:26,458 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 05:59:26,459 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-11-10 05:59:26,459 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 05:59:26,459 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 05:59:26,459 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 05:59:26,459 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 05:59:26,459 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 05:59:26,459 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 05:59:26,460 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 05:59:26,460 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 05:59:26,460 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-11-10 05:59:26,460 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 05:59:26,461 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 05:59:26,461 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 05:59:26,461 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 05:59:26,461 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 05:59:26,461 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 05:59:26,462 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 05:59:26,463 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-11-10 05:59:26,463 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 05:59:26,463 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 05:59:26,463 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 05:59:26,463 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 05:59:26,464 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 05:59:26,464 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 05:59:26,465 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 05:59:26,466 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-11-10 05:59:26,466 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 05:59:26,466 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 05:59:26,466 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 05:59:26,467 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 05:59:26,470 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 05:59:26,471 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 05:59:26,489 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 05:59:26,489 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-11-10 05:59:26,490 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 05:59:26,490 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-10 05:59:26,490 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 05:59:26,490 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 05:59:26,491 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-10 05:59:26,491 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 05:59:26,493 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 05:59:26,494 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-11-10 05:59:26,494 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 05:59:26,494 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-10 05:59:26,494 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 05:59:26,494 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 05:59:26,495 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-10 05:59:26,495 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 05:59:26,497 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 05:59:26,497 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-11-10 05:59:26,498 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 05:59:26,498 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 05:59:26,498 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 05:59:26,498 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 05:59:26,499 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 05:59:26,499 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 05:59:26,502 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 05:59:26,503 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-11-10 05:59:26,503 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 05:59:26,503 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 05:59:26,503 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 05:59:26,503 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 05:59:26,504 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 05:59:26,504 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 05:59:26,507 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 05:59:26,507 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-11-10 05:59:26,507 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 05:59:26,507 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 05:59:26,507 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 05:59:26,508 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 05:59:26,508 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 05:59:26,508 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 05:59:26,509 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 05:59:26,509 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-11-10 05:59:26,510 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 05:59:26,510 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 05:59:26,510 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 05:59:26,510 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 05:59:26,510 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 05:59:26,511 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 05:59:26,512 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 05:59:26,512 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-11-10 05:59:26,513 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 05:59:26,513 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 05:59:26,513 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 05:59:26,513 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 05:59:26,513 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 05:59:26,513 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 05:59:26,515 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 05:59:26,515 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-11-10 05:59:26,516 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 05:59:26,516 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 05:59:26,516 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 05:59:26,516 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 05:59:26,517 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 05:59:26,517 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 05:59:26,520 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 05:59:26,521 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-11-10 05:59:26,521 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 05:59:26,521 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 05:59:26,521 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 05:59:26,521 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 05:59:26,522 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 05:59:26,522 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 05:59:26,525 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 05:59:26,525 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-11-10 05:59:26,525 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 05:59:26,525 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-10 05:59:26,526 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 05:59:26,526 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 05:59:26,526 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-10 05:59:26,526 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 05:59:26,528 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 05:59:26,528 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-11-10 05:59:26,529 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 05:59:26,529 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-10 05:59:26,529 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 05:59:26,529 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 05:59:26,530 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-10 05:59:26,530 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 05:59:26,532 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 05:59:26,533 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-11-10 05:59:26,533 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 05:59:26,533 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 05:59:26,533 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 05:59:26,533 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 05:59:26,534 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 05:59:26,534 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 05:59:26,537 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 05:59:26,538 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-11-10 05:59:26,538 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 05:59:26,538 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 05:59:26,538 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 05:59:26,538 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 05:59:26,539 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 05:59:26,539 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 05:59:26,540 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 05:59:26,541 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-11-10 05:59:26,541 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 05:59:26,541 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 05:59:26,541 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 05:59:26,541 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 05:59:26,542 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 05:59:26,543 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 05:59:26,551 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-10 05:59:26,555 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2018-11-10 05:59:26,555 INFO L444 ModelExtractionUtils]: 18 out of 22 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-11-10 05:59:26,557 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-10 05:59:26,557 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-10 05:59:26,557 INFO L517 LassoAnalysis]: Proved termination. [2018-11-10 05:59:26,557 INFO L519 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)_3, v_rep(select (select #memory_int ULTIMATE.start_main_~y~0.base) ULTIMATE.start_main_~y~0.offset)_3) = 1*v_rep(select (select #memory_int ULTIMATE.start_main_~x~0.base) ULTIMATE.start_main_~x~0.offset)_3 - 1*v_rep(select (select #memory_int ULTIMATE.start_main_~y~0.base) ULTIMATE.start_main_~y~0.offset)_3 Supporting invariants [] [2018-11-10 05:59:27,018 INFO L297 tatePredicateManager]: 105 out of 109 supporting invariants were superfluous and have been removed [2018-11-10 05:59:27,021 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 05:59:27,022 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 05:59:27,036 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 05:59:27,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:59:27,054 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 05:59:27,057 INFO L477 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 86 treesize of output 76 [2018-11-10 05:59:27,067 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 05:59:27,069 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 05:59:27,069 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 73 treesize of output 80 [2018-11-10 05:59:27,095 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 05:59:27,096 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 05:59:27,097 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 05:59:27,098 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 05:59:27,099 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 82 [2018-11-10 05:59:27,131 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 05:59:27,135 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 05:59:27,136 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 05:59:27,136 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 05:59:27,137 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 90 [2018-11-10 05:59:27,183 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 05:59:27,184 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 05:59:27,185 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 05:59:27,185 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 05:59:27,186 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 05:59:27,186 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 05:59:27,187 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 05:59:27,188 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 05:59:27,189 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 15 disjoint index pairs (out of 15 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 101 [2018-11-10 05:59:27,231 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 05:59:27,232 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 05:59:27,233 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 05:59:27,233 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 05:59:27,234 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 05:59:27,235 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 05:59:27,236 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 05:59:27,236 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 05:59:27,237 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 05:59:27,238 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 7 select indices, 7 select index equivalence classes, 21 disjoint index pairs (out of 21 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 81 [2018-11-10 05:59:27,238 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-10 05:59:27,281 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 05:59:27,298 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 05:59:27,316 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 05:59:27,333 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 05:59:27,351 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 05:59:27,374 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 05:59:27,374 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 5 variables, input treesize:93, output treesize:20 [2018-11-10 05:59:27,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:59:27,394 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 05:59:27,413 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 05:59:27,414 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 05:59:27,415 INFO L477 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 39 [2018-11-10 05:59:27,417 INFO L477 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 35 treesize of output 28 [2018-11-10 05:59:27,418 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 05:59:27,421 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 05:59:27,429 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 05:59:27,429 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:48, output treesize:30 [2018-11-10 05:59:27,527 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 05:59:27,542 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 3 disjoint index pairs (out of 10 index pairs), introduced 2 new quantified variables, introduced 6 case distinctions, treesize of input 47 treesize of output 77 [2018-11-10 05:59:27,546 INFO L477 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 68 treesize of output 63 [2018-11-10 05:59:27,546 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 05:59:27,583 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 05:59:27,590 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 41 treesize of output 59 [2018-11-10 05:59:27,592 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 3 xjuncts. [2018-11-10 05:59:27,613 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-11-10 05:59:27,638 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-11-10 05:59:27,638 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:61, output treesize:126 [2018-11-10 05:59:27,686 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 05:59:27,686 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 8 loop predicates [2018-11-10 05:59:27,686 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 85 states and 90 transitions. cyclomatic complexity: 8 Second operand 10 states. [2018-11-10 05:59:27,765 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 85 states and 90 transitions. cyclomatic complexity: 8. Second operand 10 states. Result 176 states and 184 transitions. Complement of second has 14 states. [2018-11-10 05:59:27,765 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 8 states 2 stem states 5 non-accepting loop states 1 accepting loop states [2018-11-10 05:59:27,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-11-10 05:59:27,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 37 transitions. [2018-11-10 05:59:27,765 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 37 transitions. Stem has 37 letters. Loop has 12 letters. [2018-11-10 05:59:27,765 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 05:59:27,766 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-10 05:59:27,780 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 05:59:27,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:59:27,798 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 05:59:27,803 INFO L477 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 86 treesize of output 76 [2018-11-10 05:59:27,817 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 05:59:27,818 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 05:59:27,819 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 73 treesize of output 80 [2018-11-10 05:59:27,855 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 05:59:27,855 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 05:59:27,856 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 05:59:27,857 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 05:59:27,858 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 82 [2018-11-10 05:59:27,890 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 05:59:27,891 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 05:59:27,892 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 05:59:27,892 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 05:59:27,893 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 90 [2018-11-10 05:59:27,931 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 05:59:27,932 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 05:59:27,934 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 05:59:27,935 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 05:59:27,936 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 05:59:27,936 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 05:59:27,937 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 05:59:27,938 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 05:59:27,938 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 15 disjoint index pairs (out of 15 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 101 [2018-11-10 05:59:27,980 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 05:59:27,981 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 05:59:27,982 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 05:59:27,982 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 05:59:27,983 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 05:59:27,984 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 05:59:27,984 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 05:59:27,985 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 05:59:27,985 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 05:59:27,986 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 7 select indices, 7 select index equivalence classes, 21 disjoint index pairs (out of 21 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 81 [2018-11-10 05:59:27,986 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-10 05:59:28,009 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 05:59:28,027 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 05:59:28,045 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 05:59:28,062 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 05:59:28,081 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 05:59:28,108 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 05:59:28,109 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 5 variables, input treesize:93, output treesize:20 [2018-11-10 05:59:28,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:59:28,132 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 05:59:28,146 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 05:59:28,148 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 05:59:28,149 INFO L477 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 39 [2018-11-10 05:59:28,151 INFO L477 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 35 treesize of output 28 [2018-11-10 05:59:28,152 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 05:59:28,156 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 05:59:28,161 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 05:59:28,161 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:48, output treesize:30 [2018-11-10 05:59:28,245 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 05:59:28,258 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 3 disjoint index pairs (out of 10 index pairs), introduced 2 new quantified variables, introduced 6 case distinctions, treesize of input 47 treesize of output 77 [2018-11-10 05:59:28,261 INFO L477 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 68 treesize of output 63 [2018-11-10 05:59:28,262 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 05:59:28,289 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 05:59:28,297 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 41 treesize of output 59 [2018-11-10 05:59:28,298 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 3 xjuncts. [2018-11-10 05:59:28,320 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-11-10 05:59:28,344 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-11-10 05:59:28,344 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:61, output treesize:126 [2018-11-10 05:59:28,404 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 05:59:28,404 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.2 stem predicates 8 loop predicates [2018-11-10 05:59:28,405 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 85 states and 90 transitions. cyclomatic complexity: 8 Second operand 10 states. [2018-11-10 05:59:28,555 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 85 states and 90 transitions. cyclomatic complexity: 8. Second operand 10 states. Result 186 states and 195 transitions. Complement of second has 18 states. [2018-11-10 05:59:28,556 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 10 states 2 stem states 7 non-accepting loop states 1 accepting loop states [2018-11-10 05:59:28,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-11-10 05:59:28,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 43 transitions. [2018-11-10 05:59:28,556 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 43 transitions. Stem has 37 letters. Loop has 12 letters. [2018-11-10 05:59:28,556 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 05:59:28,556 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 43 transitions. Stem has 49 letters. Loop has 12 letters. [2018-11-10 05:59:28,557 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 05:59:28,557 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 43 transitions. Stem has 37 letters. Loop has 24 letters. [2018-11-10 05:59:28,557 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 05:59:28,557 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 186 states and 195 transitions. [2018-11-10 05:59:28,559 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 19 [2018-11-10 05:59:28,559 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 186 states to 163 states and 172 transitions. [2018-11-10 05:59:28,559 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 95 [2018-11-10 05:59:28,560 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 98 [2018-11-10 05:59:28,560 INFO L73 IsDeterministic]: Start isDeterministic. Operand 163 states and 172 transitions. [2018-11-10 05:59:28,560 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 05:59:28,560 INFO L705 BuchiCegarLoop]: Abstraction has 163 states and 172 transitions. [2018-11-10 05:59:28,560 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states and 172 transitions. [2018-11-10 05:59:28,563 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 151. [2018-11-10 05:59:28,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 151 states. [2018-11-10 05:59:28,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 160 transitions. [2018-11-10 05:59:28,564 INFO L728 BuchiCegarLoop]: Abstraction has 151 states and 160 transitions. [2018-11-10 05:59:28,565 INFO L608 BuchiCegarLoop]: Abstraction has 151 states and 160 transitions. [2018-11-10 05:59:28,565 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2018-11-10 05:59:28,565 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 151 states and 160 transitions. [2018-11-10 05:59:28,566 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 19 [2018-11-10 05:59:28,566 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 05:59:28,566 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 05:59:28,567 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 05:59:28,567 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 05:59:28,567 INFO L793 eck$LassoCheckResult]: Stem: 2756#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 2722#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;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~malloc5.base, main_#t~malloc5.offset, main_#t~malloc6.base, main_#t~malloc6.offset, main_#t~malloc7.base, main_#t~malloc7.offset, main_#t~malloc8.base, main_#t~malloc8.offset, main_#t~mem9, main_#t~mem10, main_#t~mem11, main_#t~mem14, main_#t~mem15, main_#t~mem16, main_#t~mem17, main_#t~mem18, main_#t~mem19, main_#t~mem12, main_#t~mem13, main_~u~0.base, main_~u~0.offset, main_~x~0.base, main_~x~0.offset, main_~v~0.base, main_~v~0.offset, main_~y~0.base, main_~y~0.offset, main_~w~0.base, main_~w~0.offset, main_~z~0.base, main_~z~0.offset, main_~c~0.base, main_~c~0.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~u~0.base, main_~u~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc3.base, main_#t~malloc3.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~x~0.base, main_~x~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc4.base, main_#t~malloc4.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~v~0.base, main_~v~0.offset := main_#t~malloc4.base, main_#t~malloc4.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc5.base, main_#t~malloc5.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~y~0.base, main_~y~0.offset := main_#t~malloc5.base, main_#t~malloc5.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc6.base, main_#t~malloc6.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~w~0.base, main_~w~0.offset := main_#t~malloc6.base, main_#t~malloc6.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc7.base, main_#t~malloc7.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~z~0.base, main_~z~0.offset := main_#t~malloc7.base, main_#t~malloc7.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc8.base, main_#t~malloc8.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~c~0.base, main_~c~0.offset := main_#t~malloc8.base, main_#t~malloc8.offset; 2723#L554 SUMMARY for call main_#t~mem9 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L554 2724#L554-1 SUMMARY for call write~int(main_#t~mem9, main_~u~0.base, main_~u~0.offset, 4); srcloc: L554-1 2725#L554-2 havoc main_#t~mem9; 2719#L555 SUMMARY for call main_#t~mem10 := read~int(main_~y~0.base, main_~y~0.offset, 4); srcloc: L555 2720#L555-1 SUMMARY for call write~int(main_#t~mem10, main_~v~0.base, main_~v~0.offset, 4); srcloc: L555-1 2721#L555-2 havoc main_#t~mem10; 2746#L556 SUMMARY for call main_#t~mem11 := read~int(main_~z~0.base, main_~z~0.offset, 4); srcloc: L556 2747#L556-1 SUMMARY for call write~int(main_#t~mem11, main_~w~0.base, main_~w~0.offset, 4); srcloc: L556-1 2748#L556-2 havoc main_#t~mem11; 2717#L557 SUMMARY for call write~int(0, main_~c~0.base, main_~c~0.offset, 4); srcloc: L557 2718#L560-3 assume true; 2740#L558 SUMMARY for call main_#t~mem12 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L558 2741#L558-1 SUMMARY for call main_#t~mem13 := read~int(main_~y~0.base, main_~y~0.offset, 4); srcloc: L558-1 2743#L558-2 assume !!(main_#t~mem12 >= main_#t~mem13);havoc main_#t~mem13;havoc main_#t~mem12; 2734#L559 SUMMARY for call main_#t~mem14 := read~int(main_~c~0.base, main_~c~0.offset, 4); srcloc: L559 2713#L559-1 SUMMARY for call write~int(main_#t~mem14 + 1, main_~c~0.base, main_~c~0.offset, 4); srcloc: L559-1 2714#L559-2 havoc main_#t~mem14; 2716#L560 SUMMARY for call main_#t~mem15 := read~int(main_~z~0.base, main_~z~0.offset, 4); srcloc: L560 2766#L560-1 assume !(main_#t~mem15 > 1);havoc main_#t~mem15; 2770#L564 SUMMARY for call main_#t~mem19 := read~int(main_~y~0.base, main_~y~0.offset, 4); srcloc: L564 2829#L564-1 SUMMARY for call write~int(main_#t~mem19 + 1, main_~y~0.base, main_~y~0.offset, 4); srcloc: L564-1 2828#L564-2 havoc main_#t~mem19; 2827#L560-3 assume true; 2826#L558 SUMMARY for call main_#t~mem12 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L558 2825#L558-1 SUMMARY for call main_#t~mem13 := read~int(main_~y~0.base, main_~y~0.offset, 4); srcloc: L558-1 2824#L558-2 assume !!(main_#t~mem12 >= main_#t~mem13);havoc main_#t~mem13;havoc main_#t~mem12; 2823#L559 SUMMARY for call main_#t~mem14 := read~int(main_~c~0.base, main_~c~0.offset, 4); srcloc: L559 2822#L559-1 SUMMARY for call write~int(main_#t~mem14 + 1, main_~c~0.base, main_~c~0.offset, 4); srcloc: L559-1 2821#L559-2 havoc main_#t~mem14; 2820#L560 SUMMARY for call main_#t~mem15 := read~int(main_~z~0.base, main_~z~0.offset, 4); srcloc: L560 2818#L560-1 assume main_#t~mem15 > 1;havoc main_#t~mem15; 2816#L561 SUMMARY for call main_#t~mem16 := read~int(main_~z~0.base, main_~z~0.offset, 4); srcloc: L561 2730#L561-1 SUMMARY for call write~int(main_#t~mem16 - 1, main_~z~0.base, main_~z~0.offset, 4); srcloc: L561-1 2854#L561-2 havoc main_#t~mem16; 2853#L562 SUMMARY for call main_#t~mem17 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L562 2852#L562-1 SUMMARY for call main_#t~mem18 := read~int(main_~z~0.base, main_~z~0.offset, 4); srcloc: L562-1 2851#L562-2 SUMMARY for call write~int(main_#t~mem17 + main_#t~mem18, main_~x~0.base, main_~x~0.offset, 4); srcloc: L562-2 2850#L562-3 havoc main_#t~mem17;havoc main_#t~mem18; 2849#L560-3 assume true; 2848#L558 SUMMARY for call main_#t~mem12 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L558 2847#L558-1 SUMMARY for call main_#t~mem13 := read~int(main_~y~0.base, main_~y~0.offset, 4); srcloc: L558-1 2846#L558-2 assume !!(main_#t~mem12 >= main_#t~mem13);havoc main_#t~mem13;havoc main_#t~mem12; 2845#L559 SUMMARY for call main_#t~mem14 := read~int(main_~c~0.base, main_~c~0.offset, 4); srcloc: L559 2844#L559-1 SUMMARY for call write~int(main_#t~mem14 + 1, main_~c~0.base, main_~c~0.offset, 4); srcloc: L559-1 2842#L559-2 havoc main_#t~mem14; 2811#L560 SUMMARY for call main_#t~mem15 := read~int(main_~z~0.base, main_~z~0.offset, 4); srcloc: L560 2810#L560-1 assume !(main_#t~mem15 > 1);havoc main_#t~mem15; 2749#L564 [2018-11-10 05:59:28,567 INFO L795 eck$LassoCheckResult]: Loop: 2749#L564 SUMMARY for call main_#t~mem19 := read~int(main_~y~0.base, main_~y~0.offset, 4); srcloc: L564 2750#L564-1 SUMMARY for call write~int(main_#t~mem19 + 1, main_~y~0.base, main_~y~0.offset, 4); srcloc: L564-1 2838#L564-2 havoc main_#t~mem19; 2767#L560-3 assume true; 2835#L558 SUMMARY for call main_#t~mem12 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L558 2819#L558-1 SUMMARY for call main_#t~mem13 := read~int(main_~y~0.base, main_~y~0.offset, 4); srcloc: L558-1 2817#L558-2 assume !!(main_#t~mem12 >= main_#t~mem13);havoc main_#t~mem13;havoc main_#t~mem12; 2815#L559 SUMMARY for call main_#t~mem14 := read~int(main_~c~0.base, main_~c~0.offset, 4); srcloc: L559 2814#L559-1 SUMMARY for call write~int(main_#t~mem14 + 1, main_~c~0.base, main_~c~0.offset, 4); srcloc: L559-1 2812#L559-2 havoc main_#t~mem14; 2813#L560 SUMMARY for call main_#t~mem15 := read~int(main_~z~0.base, main_~z~0.offset, 4); srcloc: L560 2832#L560-1 assume !(main_#t~mem15 > 1);havoc main_#t~mem15; 2749#L564 [2018-11-10 05:59:28,567 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 05:59:28,567 INFO L82 PathProgramCache]: Analyzing trace with hash -290635425, now seen corresponding path program 2 times [2018-11-10 05:59:28,567 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 05:59:28,568 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 05:59:28,568 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:59:28,568 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 05:59:28,568 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:59:28,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:59:28,681 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 26 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 05:59:28,683 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 05:59:28,683 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_7b8ce021-8a8c-4a1a-8ea4-bcd66e1f5cb3/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-11-10 05:59:28,698 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-10 05:59:28,734 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-10 05:59:28,734 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-10 05:59:28,737 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 05:59:28,745 INFO L477 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 69 treesize of output 62 [2018-11-10 05:59:28,758 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 05:59:28,760 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 05:59:28,761 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 69 [2018-11-10 05:59:28,789 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 05:59:28,790 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 05:59:28,791 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 05:59:28,793 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 05:59:28,794 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 74 [2018-11-10 05:59:28,799 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 66 [2018-11-10 05:59:28,838 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 05:59:28,840 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 05:59:28,841 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 05:59:28,842 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 05:59:28,847 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 05:59:28,848 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 85 [2018-11-10 05:59:28,887 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 05:59:28,890 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 05:59:28,891 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 05:59:28,892 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 05:59:28,895 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 05:59:28,896 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 05:59:28,897 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 05:59:28,898 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 05:59:28,898 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 05:59:28,903 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 05:59:28,904 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 7 select indices, 7 select index equivalence classes, 17 disjoint index pairs (out of 21 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 65 [2018-11-10 05:59:28,904 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-10 05:59:28,922 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 05:59:28,943 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 05:59:28,960 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 05:59:28,975 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 05:59:28,991 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 05:59:29,008 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 05:59:29,008 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 5 variables, input treesize:69, output treesize:13 [2018-11-10 05:59:29,039 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 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-11-10 05:59:29,040 INFO L477 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-11-10 05:59:29,040 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 05:59:29,047 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 05:59:29,053 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 05:59:29,053 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:33, output treesize:12 [2018-11-10 05:59:29,065 INFO L477 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-11-10 05:59:29,066 INFO L477 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-11-10 05:59:29,067 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 05:59:29,071 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 05:59:29,075 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 05:59:29,076 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:25, output treesize:7 [2018-11-10 05:59:29,083 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2018-11-10 05:59:29,084 INFO L477 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 11 treesize of output 7 [2018-11-10 05:59:29,085 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 05:59:29,086 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 05:59:29,087 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 05:59:29,087 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:15, output treesize:3 [2018-11-10 05:59:29,097 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 18 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 05:59:29,124 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-10 05:59:29,124 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 8] total 12 [2018-11-10 05:59:29,126 INFO L798 eck$LassoCheckResult]: stem already infeasible [2018-11-10 05:59:29,126 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 05:59:29,126 INFO L82 PathProgramCache]: Analyzing trace with hash 1231366454, now seen corresponding path program 3 times [2018-11-10 05:59:29,126 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 05:59:29,126 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 05:59:29,127 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:59:29,127 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 05:59:29,127 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:59:29,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 05:59:29,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 05:59:29,238 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-10 05:59:29,238 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2018-11-10 05:59:29,239 INFO L87 Difference]: Start difference. First operand 151 states and 160 transitions. cyclomatic complexity: 14 Second operand 12 states. [2018-11-10 05:59:29,372 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 05:59:29,372 INFO L93 Difference]: Finished difference Result 108 states and 112 transitions. [2018-11-10 05:59:29,372 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-10 05:59:29,373 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 108 states and 112 transitions. [2018-11-10 05:59:29,374 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-10 05:59:29,374 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 108 states to 0 states and 0 transitions. [2018-11-10 05:59:29,374 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2018-11-10 05:59:29,374 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2018-11-10 05:59:29,374 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2018-11-10 05:59:29,374 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-10 05:59:29,374 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-10 05:59:29,374 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-10 05:59:29,374 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-10 05:59:29,374 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2018-11-10 05:59:29,375 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2018-11-10 05:59:29,375 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-10 05:59:29,375 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2018-11-10 05:59:29,379 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 10.11 05:59:29 BoogieIcfgContainer [2018-11-10 05:59:29,380 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-11-10 05:59:29,380 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-10 05:59:29,380 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-10 05:59:29,380 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-10 05:59:29,380 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 05:59:09" (3/4) ... [2018-11-10 05:59:29,382 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-11-10 05:59:29,383 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-10 05:59:29,383 INFO L168 Benchmark]: Toolchain (without parser) took 20133.69 ms. Allocated memory was 1.0 GB in the beginning and 1.5 GB in the end (delta: 509.1 MB). Free memory was 956.5 MB in the beginning and 885.0 MB in the end (delta: 71.5 MB). Peak memory consumption was 580.6 MB. Max. memory is 11.5 GB. [2018-11-10 05:59:29,384 INFO L168 Benchmark]: CDTParser took 0.10 ms. Allocated memory is still 1.0 GB. Free memory is still 985.5 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-10 05:59:29,384 INFO L168 Benchmark]: CACSL2BoogieTranslator took 265.71 ms. Allocated memory is still 1.0 GB. Free memory was 956.5 MB in the beginning and 933.9 MB in the end (delta: 22.6 MB). Peak memory consumption was 22.6 MB. Max. memory is 11.5 GB. [2018-11-10 05:59:29,384 INFO L168 Benchmark]: Boogie Procedure Inliner took 69.83 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 162.0 MB). Free memory was 933.9 MB in the beginning and 1.2 GB in the end (delta: -222.2 MB). Peak memory consumption was 15.9 MB. Max. memory is 11.5 GB. [2018-11-10 05:59:29,385 INFO L168 Benchmark]: Boogie Preprocessor took 15.24 ms. Allocated memory is still 1.2 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-10 05:59:29,385 INFO L168 Benchmark]: RCFGBuilder took 289.00 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 34.5 MB). Peak memory consumption was 34.5 MB. Max. memory is 11.5 GB. [2018-11-10 05:59:29,385 INFO L168 Benchmark]: BuchiAutomizer took 19488.53 ms. Allocated memory was 1.2 GB in the beginning and 1.5 GB in the end (delta: 347.1 MB). Free memory was 1.1 GB in the beginning and 885.0 MB in the end (delta: 236.6 MB). Peak memory consumption was 583.7 MB. Max. memory is 11.5 GB. [2018-11-10 05:59:29,386 INFO L168 Benchmark]: Witness Printer took 2.81 ms. Allocated memory is still 1.5 GB. Free memory is still 885.0 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-10 05:59:29,387 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 985.5 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 265.71 ms. Allocated memory is still 1.0 GB. Free memory was 956.5 MB in the beginning and 933.9 MB in the end (delta: 22.6 MB). Peak memory consumption was 22.6 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 69.83 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 162.0 MB). Free memory was 933.9 MB in the beginning and 1.2 GB in the end (delta: -222.2 MB). Peak memory consumption was 15.9 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 15.24 ms. Allocated memory is still 1.2 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 289.00 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 34.5 MB). Peak memory consumption was 34.5 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 19488.53 ms. Allocated memory was 1.2 GB in the beginning and 1.5 GB in the end (delta: 347.1 MB). Free memory was 1.1 GB in the beginning and 885.0 MB in the end (delta: 236.6 MB). Peak memory consumption was 583.7 MB. Max. memory is 11.5 GB. * Witness Printer took 2.81 ms. Allocated memory is still 1.5 GB. Free memory is still 885.0 MB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - 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 4 terminating modules (1 trivial, 3 deterministic, 0 nondeterministic). One deterministic module has affine ranking function 2 * unknown-#memory_int-unknown[x][x] + -2 * unknown-#memory_int-unknown[y][y] + 1 and consists of 11 locations. One deterministic module has affine ranking function unknown-#memory_int-unknown[z][z] and consists of 6 locations. One deterministic module has affine ranking function unknown-#memory_int-unknown[x][x] + -1 * unknown-#memory_int-unknown[y][y] and consists of 10 locations. 1 modules have a trivial ranking function, the largest among these consists of 12 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 19.4s and 5 iterations. TraceHistogramMax:3. Analysis of lassos took 15.9s. Construction of modules took 0.2s. Büchi inclusion checks took 3.1s. Highest rank in rank-based complementation 3. Minimization of det autom 1. Minimization of nondet autom 3. Automata minimization 0.0s AutomataMinimizationTime, 3 MinimizatonAttempts, 17 StatesRemovedByMinimization, 3 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 151 states and ocurred in iteration 3. Nontrivial modules had stage [2, 1, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 105 SDtfs, 254 SDslu, 137 SDs, 0 SdLazy, 352 SolverSat, 50 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.2s Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc0 concLT0 SILN0 SILU1 SILI0 SILT0 lasso3 LassoPreprocessingBenchmarks: Lassos: inital4544 mio100 ax101 hnf100 lsp97 ukn27 mio100 lsp35 div100 bol100 ite100 ukn100 eq203 hnf87 smp95 dnf100 smp100 tf100 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 9ms VariablesStem: 2 VariablesLoop: 2 DisjunctsStem: 2 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 8 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...