./Ultimate.py --spec ../../sv-benchmarks/c/Termination.prp --file ../../sv-benchmarks/c/termination-memory-alloca/substring-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_e8f80d31-1eae-4f1b-95bf-19d78e70ae98/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_e8f80d31-1eae-4f1b-95bf-19d78e70ae98/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_e8f80d31-1eae-4f1b-95bf-19d78e70ae98/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_e8f80d31-1eae-4f1b-95bf-19d78e70ae98/bin-2019/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/termination-memory-alloca/substring-alloca_true-termination.c.i -s /tmp/vcloud-vcloud-master/worker/working_dir_e8f80d31-1eae-4f1b-95bf-19d78e70ae98/bin-2019/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_e8f80d31-1eae-4f1b-95bf-19d78e70ae98/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 29f46a81991b9bc0fef856343662e1cc264d2d45 ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ 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:37:34,658 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-10 05:37:34,659 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-10 05:37:34,666 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-10 05:37:34,666 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-10 05:37:34,667 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-10 05:37:34,667 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-10 05:37:34,668 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-10 05:37:34,669 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-10 05:37:34,670 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-10 05:37:34,671 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-10 05:37:34,671 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-10 05:37:34,672 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-10 05:37:34,672 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-10 05:37:34,673 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-10 05:37:34,674 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-10 05:37:34,674 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-10 05:37:34,675 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-10 05:37:34,677 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-10 05:37:34,678 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-10 05:37:34,679 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-10 05:37:34,680 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-10 05:37:34,681 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-10 05:37:34,681 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-10 05:37:34,682 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-10 05:37:34,682 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-10 05:37:34,683 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-10 05:37:34,684 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-10 05:37:34,684 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-10 05:37:34,685 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-10 05:37:34,685 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-10 05:37:34,686 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-10 05:37:34,686 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-10 05:37:34,686 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-10 05:37:34,687 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-10 05:37:34,687 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-10 05:37:34,687 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_e8f80d31-1eae-4f1b-95bf-19d78e70ae98/bin-2019/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf [2018-11-10 05:37:34,698 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-10 05:37:34,698 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-10 05:37:34,699 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-10 05:37:34,699 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-10 05:37:34,700 INFO L133 SettingsManager]: * Use SBE=true [2018-11-10 05:37:34,700 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-11-10 05:37:34,700 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-11-10 05:37:34,700 INFO L133 SettingsManager]: * Use old map elimination=false [2018-11-10 05:37:34,700 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-11-10 05:37:34,700 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-11-10 05:37:34,700 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-11-10 05:37:34,701 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-10 05:37:34,701 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-10 05:37:34,701 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-10 05:37:34,701 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-10 05:37:34,701 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-11-10 05:37:34,701 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-11-10 05:37:34,701 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-11-10 05:37:34,701 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-10 05:37:34,702 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-11-10 05:37:34,702 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-11-10 05:37:34,702 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-10 05:37:34,702 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-10 05:37:34,702 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-11-10 05:37:34,702 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-10 05:37:34,703 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-10 05:37:34,703 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-11-10 05:37:34,703 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-11-10 05:37:34,703 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_e8f80d31-1eae-4f1b-95bf-19d78e70ae98/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 -> 29f46a81991b9bc0fef856343662e1cc264d2d45 [2018-11-10 05:37:34,727 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-10 05:37:34,737 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-10 05:37:34,739 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-10 05:37:34,740 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-10 05:37:34,740 INFO L276 PluginConnector]: CDTParser initialized [2018-11-10 05:37:34,741 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_e8f80d31-1eae-4f1b-95bf-19d78e70ae98/bin-2019/uautomizer/../../sv-benchmarks/c/termination-memory-alloca/substring-alloca_true-termination.c.i [2018-11-10 05:37:34,779 INFO L218 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_e8f80d31-1eae-4f1b-95bf-19d78e70ae98/bin-2019/uautomizer/data/ec2ece0a8/2411eb5cf4144440b728f96fc7ef31aa/FLAG07143620a [2018-11-10 05:37:35,198 INFO L298 CDTParser]: Found 1 translation units. [2018-11-10 05:37:35,199 INFO L158 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_e8f80d31-1eae-4f1b-95bf-19d78e70ae98/sv-benchmarks/c/termination-memory-alloca/substring-alloca_true-termination.c.i [2018-11-10 05:37:35,206 INFO L346 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_e8f80d31-1eae-4f1b-95bf-19d78e70ae98/bin-2019/uautomizer/data/ec2ece0a8/2411eb5cf4144440b728f96fc7ef31aa/FLAG07143620a [2018-11-10 05:37:35,214 INFO L354 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_e8f80d31-1eae-4f1b-95bf-19d78e70ae98/bin-2019/uautomizer/data/ec2ece0a8/2411eb5cf4144440b728f96fc7ef31aa [2018-11-10 05:37:35,216 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-10 05:37:35,217 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-10 05:37:35,217 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-10 05:37:35,217 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-10 05:37:35,219 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-10 05:37:35,220 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 05:37:35" (1/1) ... [2018-11-10 05:37:35,221 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3ff1ee4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:37:35, skipping insertion in model container [2018-11-10 05:37:35,222 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 05:37:35" (1/1) ... [2018-11-10 05:37:35,228 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-10 05:37:35,254 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-11-10 05:37:35,428 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 05:37:35,436 INFO L189 MainTranslator]: Completed pre-run [2018-11-10 05:37:35,459 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 05:37:35,490 INFO L193 MainTranslator]: Completed translation [2018-11-10 05:37:35,490 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:37:35 WrapperNode [2018-11-10 05:37:35,490 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-10 05:37:35,491 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-10 05:37:35,491 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-10 05:37:35,491 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-10 05:37:35,537 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:37:35" (1/1) ... [2018-11-10 05:37:35,547 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:37:35" (1/1) ... [2018-11-10 05:37:35,562 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-10 05:37:35,563 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-10 05:37:35,563 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-10 05:37:35,563 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-10 05:37:35,570 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:37:35" (1/1) ... [2018-11-10 05:37:35,571 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:37:35" (1/1) ... [2018-11-10 05:37:35,573 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:37:35" (1/1) ... [2018-11-10 05:37:35,573 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:37:35" (1/1) ... [2018-11-10 05:37:35,578 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:37:35" (1/1) ... [2018-11-10 05:37:35,581 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:37:35" (1/1) ... [2018-11-10 05:37:35,582 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:37:35" (1/1) ... [2018-11-10 05:37:35,584 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-10 05:37:35,585 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-10 05:37:35,585 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-10 05:37:35,585 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-10 05:37:35,585 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:37:35" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_e8f80d31-1eae-4f1b-95bf-19d78e70ae98/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:37:35,625 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-10 05:37:35,626 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-10 05:37:35,626 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-10 05:37:35,626 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-10 05:37:35,850 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-10 05:37:35,850 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 05:37:35 BoogieIcfgContainer [2018-11-10 05:37:35,850 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-10 05:37:35,851 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-11-10 05:37:35,851 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-11-10 05:37:35,854 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-11-10 05:37:35,855 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-10 05:37:35,855 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 10.11 05:37:35" (1/3) ... [2018-11-10 05:37:35,856 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@16413a7f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 10.11 05:37:35, skipping insertion in model container [2018-11-10 05:37:35,856 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-10 05:37:35,856 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:37:35" (2/3) ... [2018-11-10 05:37:35,857 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@16413a7f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 10.11 05:37:35, skipping insertion in model container [2018-11-10 05:37:35,857 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-10 05:37:35,857 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 05:37:35" (3/3) ... [2018-11-10 05:37:35,858 INFO L375 chiAutomizerObserver]: Analyzing ICFG substring-alloca_true-termination.c.i [2018-11-10 05:37:35,898 INFO L135 ementStrategyFactory]: Using default assertion order modulation [2018-11-10 05:37:35,898 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-11-10 05:37:35,898 INFO L375 BuchiCegarLoop]: Hoare is false [2018-11-10 05:37:35,898 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-11-10 05:37:35,898 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-10 05:37:35,899 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-10 05:37:35,899 INFO L379 BuchiCegarLoop]: Difference is false [2018-11-10 05:37:35,899 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-10 05:37:35,899 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-11-10 05:37:35,911 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 26 states. [2018-11-10 05:37:35,929 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 13 [2018-11-10 05:37:35,929 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 05:37:35,929 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 05:37:35,934 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 05:37:35,934 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2018-11-10 05:37:35,934 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-11-10 05:37:35,934 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 26 states. [2018-11-10 05:37:35,936 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 13 [2018-11-10 05:37:35,936 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 05:37:35,936 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 05:37:35,936 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 05:37:35,937 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2018-11-10 05:37:35,944 INFO L793 eck$LassoCheckResult]: Stem: 21#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~nondet11, main_#t~nondet12, main_#t~malloc13.base, main_#t~malloc13.offset, main_#t~malloc14.base, main_#t~malloc14.offset, main_#t~ret15, main_~length1~0, main_~length2~0, main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;main_~length1~0 := main_#t~nondet11;havoc main_#t~nondet11;main_~length2~0 := main_#t~nondet12;havoc main_#t~nondet12; 19#L565true assume !(main_~length1~0 < 1); 12#L565-2true assume !(main_~length2~0 < 1); 6#L568-1true #Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := main_~length1~0 * 1;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~malloc13.base, main_#t~malloc13.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc13.base, main_#t~malloc13.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := main_~length2~0 * 1;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~malloc14.base, main_#t~malloc14.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc14.base, main_#t~malloc14.offset; 23#L573true SUMMARY for call write~int(0, main_~nondetString1~0.base, main_~nondetString1~0.offset + (main_~length1~0 - 1) * 1, 1); srcloc: L573 25#L573-1true SUMMARY for call write~int(0, main_~nondetString2~0.base, main_~nondetString2~0.offset + (main_~length2~0 - 1) * 1, 1); srcloc: L573-1 10#L574true assume { :begin_inline_substring } true;substring_#in~s.base, substring_#in~s.offset, substring_#in~t.base, substring_#in~t.offset := main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;havoc substring_#res;havoc substring_#t~post7.base, substring_#t~post7.offset, substring_#t~post8.base, substring_#t~post8.offset, substring_#t~mem3, substring_#t~mem4, substring_#t~mem5, substring_#t~short6, substring_#t~mem9, substring_#t~post10.base, substring_#t~post10.offset, substring_~ps2~0.base, substring_~ps2~0.offset, substring_~pt~0.base, substring_~pt~0.offset, substring_#t~mem2, substring_~s.base, substring_~s.offset, substring_~t.base, substring_~t.offset, substring_~ps~0.base, substring_~ps~0.offset;substring_~s.base, substring_~s.offset := substring_#in~s.base, substring_#in~s.offset;substring_~t.base, substring_~t.offset := substring_#in~t.base, substring_#in~t.offset;substring_~ps~0.base, substring_~ps~0.offset := substring_~s.base, substring_~s.offset; 5#L550-4true [2018-11-10 05:37:35,944 INFO L795 eck$LassoCheckResult]: Loop: 5#L550-4true assume true; 15#L550-1true SUMMARY for call substring_#t~mem2 := read~int(substring_~ps~0.base, substring_~ps~0.offset, 1); srcloc: L550-1 3#L550-2true assume !!(substring_#t~mem2 != 0);havoc substring_#t~mem2;substring_~ps2~0.base, substring_~ps2~0.offset := substring_~ps~0.base, substring_~ps~0.offset;substring_~pt~0.base, substring_~pt~0.offset := substring_~t.base, substring_~t.offset; 20#L553-10true assume !true; 11#L553-11true SUMMARY for call substring_#t~mem9 := read~int(substring_~pt~0.base, substring_~pt~0.offset, 1); srcloc: L553-11 4#L557true assume !(substring_#t~mem9 == 0);havoc substring_#t~mem9;substring_#t~post10.base, substring_#t~post10.offset := substring_~ps~0.base, substring_~ps~0.offset;substring_~ps~0.base, substring_~ps~0.offset := substring_#t~post10.base, substring_#t~post10.offset + 1;havoc substring_#t~post10.base, substring_#t~post10.offset; 5#L550-4true [2018-11-10 05:37:35,949 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 05:37:35,949 INFO L82 PathProgramCache]: Analyzing trace with hash 180425515, now seen corresponding path program 1 times [2018-11-10 05:37:35,951 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 05:37:35,951 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 05:37:35,988 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:37:35,988 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 05:37:35,988 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:37:36,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 05:37:36,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 05:37:36,061 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 05:37:36,061 INFO L82 PathProgramCache]: Analyzing trace with hash 1540425151, now seen corresponding path program 1 times [2018-11-10 05:37:36,061 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 05:37:36,061 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 05:37:36,063 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:37:36,063 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 05:37:36,063 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:37:36,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:37:36,083 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:37:36,084 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 05:37:36,084 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-10 05:37:36,087 INFO L810 eck$LassoCheckResult]: loop already infeasible [2018-11-10 05:37:36,096 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-10 05:37:36,096 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-10 05:37:36,098 INFO L87 Difference]: Start difference. First operand 26 states. Second operand 2 states. [2018-11-10 05:37:36,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 05:37:36,103 INFO L93 Difference]: Finished difference Result 26 states and 31 transitions. [2018-11-10 05:37:36,103 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-10 05:37:36,105 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 26 states and 31 transitions. [2018-11-10 05:37:36,106 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 13 [2018-11-10 05:37:36,109 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 26 states to 21 states and 25 transitions. [2018-11-10 05:37:36,110 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 21 [2018-11-10 05:37:36,111 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 21 [2018-11-10 05:37:36,111 INFO L73 IsDeterministic]: Start isDeterministic. Operand 21 states and 25 transitions. [2018-11-10 05:37:36,111 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-10 05:37:36,112 INFO L705 BuchiCegarLoop]: Abstraction has 21 states and 25 transitions. [2018-11-10 05:37:36,123 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states and 25 transitions. [2018-11-10 05:37:36,129 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2018-11-10 05:37:36,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2018-11-10 05:37:36,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 25 transitions. [2018-11-10 05:37:36,131 INFO L728 BuchiCegarLoop]: Abstraction has 21 states and 25 transitions. [2018-11-10 05:37:36,131 INFO L608 BuchiCegarLoop]: Abstraction has 21 states and 25 transitions. [2018-11-10 05:37:36,131 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-11-10 05:37:36,131 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 21 states and 25 transitions. [2018-11-10 05:37:36,132 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 13 [2018-11-10 05:37:36,132 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 05:37:36,132 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 05:37:36,133 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 05:37:36,133 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 05:37:36,133 INFO L793 eck$LassoCheckResult]: Stem: 76#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 74#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet11, main_#t~nondet12, main_#t~malloc13.base, main_#t~malloc13.offset, main_#t~malloc14.base, main_#t~malloc14.offset, main_#t~ret15, main_~length1~0, main_~length2~0, main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;main_~length1~0 := main_#t~nondet11;havoc main_#t~nondet11;main_~length2~0 := main_#t~nondet12;havoc main_#t~nondet12; 71#L565 assume !(main_~length1~0 < 1); 72#L565-2 assume !(main_~length2~0 < 1); 68#L568-1 #Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := main_~length1~0 * 1;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~malloc13.base, main_#t~malloc13.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc13.base, main_#t~malloc13.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := main_~length2~0 * 1;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~malloc14.base, main_#t~malloc14.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc14.base, main_#t~malloc14.offset; 69#L573 SUMMARY for call write~int(0, main_~nondetString1~0.base, main_~nondetString1~0.offset + (main_~length1~0 - 1) * 1, 1); srcloc: L573 78#L573-1 SUMMARY for call write~int(0, main_~nondetString2~0.base, main_~nondetString2~0.offset + (main_~length2~0 - 1) * 1, 1); srcloc: L573-1 75#L574 assume { :begin_inline_substring } true;substring_#in~s.base, substring_#in~s.offset, substring_#in~t.base, substring_#in~t.offset := main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;havoc substring_#res;havoc substring_#t~post7.base, substring_#t~post7.offset, substring_#t~post8.base, substring_#t~post8.offset, substring_#t~mem3, substring_#t~mem4, substring_#t~mem5, substring_#t~short6, substring_#t~mem9, substring_#t~post10.base, substring_#t~post10.offset, substring_~ps2~0.base, substring_~ps2~0.offset, substring_~pt~0.base, substring_~pt~0.offset, substring_#t~mem2, substring_~s.base, substring_~s.offset, substring_~t.base, substring_~t.offset, substring_~ps~0.base, substring_~ps~0.offset;substring_~s.base, substring_~s.offset := substring_#in~s.base, substring_#in~s.offset;substring_~t.base, substring_~t.offset := substring_#in~t.base, substring_#in~t.offset;substring_~ps~0.base, substring_~ps~0.offset := substring_~s.base, substring_~s.offset; 66#L550-4 [2018-11-10 05:37:36,133 INFO L795 eck$LassoCheckResult]: Loop: 66#L550-4 assume true; 67#L550-1 SUMMARY for call substring_#t~mem2 := read~int(substring_~ps~0.base, substring_~ps~0.offset, 1); srcloc: L550-1 60#L550-2 assume !!(substring_#t~mem2 != 0);havoc substring_#t~mem2;substring_~ps2~0.base, substring_~ps2~0.offset := substring_~ps~0.base, substring_~ps~0.offset;substring_~pt~0.base, substring_~pt~0.offset := substring_~t.base, substring_~t.offset; 61#L553-10 assume true; 73#L553-1 SUMMARY for call substring_#t~mem3 := read~int(substring_~pt~0.base, substring_~pt~0.offset, 1); srcloc: L553-1 77#L553-2 substring_#t~short6 := substring_#t~mem3 != 0; 79#L553-3 assume !substring_#t~short6; 64#L553-8 assume !substring_#t~short6;havoc substring_#t~mem3;havoc substring_#t~mem5;havoc substring_#t~short6;havoc substring_#t~mem4; 70#L553-11 SUMMARY for call substring_#t~mem9 := read~int(substring_~pt~0.base, substring_~pt~0.offset, 1); srcloc: L553-11 65#L557 assume !(substring_#t~mem9 == 0);havoc substring_#t~mem9;substring_#t~post10.base, substring_#t~post10.offset := substring_~ps~0.base, substring_~ps~0.offset;substring_~ps~0.base, substring_~ps~0.offset := substring_#t~post10.base, substring_#t~post10.offset + 1;havoc substring_#t~post10.base, substring_#t~post10.offset; 66#L550-4 [2018-11-10 05:37:36,134 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 05:37:36,134 INFO L82 PathProgramCache]: Analyzing trace with hash 180425515, now seen corresponding path program 2 times [2018-11-10 05:37:36,134 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 05:37:36,134 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 05:37:36,135 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:37:36,135 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 05:37:36,135 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:37:36,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 05:37:36,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 05:37:36,161 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 05:37:36,161 INFO L82 PathProgramCache]: Analyzing trace with hash 1301820241, now seen corresponding path program 1 times [2018-11-10 05:37:36,161 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 05:37:36,161 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 05:37:36,162 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:37:36,162 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 05:37:36,163 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:37:36,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:37:36,230 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:37:36,230 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 05:37:36,230 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-10 05:37:36,230 INFO L810 eck$LassoCheckResult]: loop already infeasible [2018-11-10 05:37:36,231 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-10 05:37:36,231 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-11-10 05:37:36,231 INFO L87 Difference]: Start difference. First operand 21 states and 25 transitions. cyclomatic complexity: 5 Second operand 6 states. [2018-11-10 05:37:36,318 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 05:37:36,318 INFO L93 Difference]: Finished difference Result 24 states and 28 transitions. [2018-11-10 05:37:36,319 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-10 05:37:36,319 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 24 states and 28 transitions. [2018-11-10 05:37:36,320 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 14 [2018-11-10 05:37:36,320 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 24 states to 22 states and 26 transitions. [2018-11-10 05:37:36,321 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 22 [2018-11-10 05:37:36,321 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 22 [2018-11-10 05:37:36,321 INFO L73 IsDeterministic]: Start isDeterministic. Operand 22 states and 26 transitions. [2018-11-10 05:37:36,321 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-10 05:37:36,321 INFO L705 BuchiCegarLoop]: Abstraction has 22 states and 26 transitions. [2018-11-10 05:37:36,321 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states and 26 transitions. [2018-11-10 05:37:36,322 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2018-11-10 05:37:36,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2018-11-10 05:37:36,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 26 transitions. [2018-11-10 05:37:36,323 INFO L728 BuchiCegarLoop]: Abstraction has 22 states and 26 transitions. [2018-11-10 05:37:36,323 INFO L608 BuchiCegarLoop]: Abstraction has 22 states and 26 transitions. [2018-11-10 05:37:36,323 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-11-10 05:37:36,323 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 22 states and 26 transitions. [2018-11-10 05:37:36,324 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 14 [2018-11-10 05:37:36,324 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 05:37:36,324 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 05:37:36,324 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 05:37:36,324 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 05:37:36,325 INFO L793 eck$LassoCheckResult]: Stem: 137#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 134#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet11, main_#t~nondet12, main_#t~malloc13.base, main_#t~malloc13.offset, main_#t~malloc14.base, main_#t~malloc14.offset, main_#t~ret15, main_~length1~0, main_~length2~0, main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;main_~length1~0 := main_#t~nondet11;havoc main_#t~nondet11;main_~length2~0 := main_#t~nondet12;havoc main_#t~nondet12; 131#L565 assume !(main_~length1~0 < 1); 132#L565-2 assume !(main_~length2~0 < 1); 128#L568-1 #Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := main_~length1~0 * 1;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~malloc13.base, main_#t~malloc13.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc13.base, main_#t~malloc13.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := main_~length2~0 * 1;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~malloc14.base, main_#t~malloc14.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc14.base, main_#t~malloc14.offset; 129#L573 SUMMARY for call write~int(0, main_~nondetString1~0.base, main_~nondetString1~0.offset + (main_~length1~0 - 1) * 1, 1); srcloc: L573 139#L573-1 SUMMARY for call write~int(0, main_~nondetString2~0.base, main_~nondetString2~0.offset + (main_~length2~0 - 1) * 1, 1); srcloc: L573-1 135#L574 assume { :begin_inline_substring } true;substring_#in~s.base, substring_#in~s.offset, substring_#in~t.base, substring_#in~t.offset := main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;havoc substring_#res;havoc substring_#t~post7.base, substring_#t~post7.offset, substring_#t~post8.base, substring_#t~post8.offset, substring_#t~mem3, substring_#t~mem4, substring_#t~mem5, substring_#t~short6, substring_#t~mem9, substring_#t~post10.base, substring_#t~post10.offset, substring_~ps2~0.base, substring_~ps2~0.offset, substring_~pt~0.base, substring_~pt~0.offset, substring_#t~mem2, substring_~s.base, substring_~s.offset, substring_~t.base, substring_~t.offset, substring_~ps~0.base, substring_~ps~0.offset;substring_~s.base, substring_~s.offset := substring_#in~s.base, substring_#in~s.offset;substring_~t.base, substring_~t.offset := substring_#in~t.base, substring_#in~t.offset;substring_~ps~0.base, substring_~ps~0.offset := substring_~s.base, substring_~s.offset; 126#L550-4 [2018-11-10 05:37:36,325 INFO L795 eck$LassoCheckResult]: Loop: 126#L550-4 assume true; 127#L550-1 SUMMARY for call substring_#t~mem2 := read~int(substring_~ps~0.base, substring_~ps~0.offset, 1); srcloc: L550-1 120#L550-2 assume !!(substring_#t~mem2 != 0);havoc substring_#t~mem2;substring_~ps2~0.base, substring_~ps2~0.offset := substring_~ps~0.base, substring_~ps~0.offset;substring_~pt~0.base, substring_~pt~0.offset := substring_~t.base, substring_~t.offset; 121#L553-10 assume true; 133#L553-1 SUMMARY for call substring_#t~mem3 := read~int(substring_~pt~0.base, substring_~pt~0.offset, 1); srcloc: L553-1 138#L553-2 substring_#t~short6 := substring_#t~mem3 != 0; 140#L553-3 assume substring_#t~short6; 141#L553-4 SUMMARY for call substring_#t~mem4 := read~int(substring_~pt~0.base, substring_~pt~0.offset, 1); srcloc: L553-4 122#L553-5 SUMMARY for call substring_#t~mem5 := read~int(substring_~ps2~0.base, substring_~ps2~0.offset, 1); srcloc: L553-5 123#L553-6 substring_#t~short6 := substring_#t~mem4 == substring_#t~mem5; 124#L553-8 assume !substring_#t~short6;havoc substring_#t~mem3;havoc substring_#t~mem5;havoc substring_#t~short6;havoc substring_#t~mem4; 136#L553-11 SUMMARY for call substring_#t~mem9 := read~int(substring_~pt~0.base, substring_~pt~0.offset, 1); srcloc: L553-11 125#L557 assume !(substring_#t~mem9 == 0);havoc substring_#t~mem9;substring_#t~post10.base, substring_#t~post10.offset := substring_~ps~0.base, substring_~ps~0.offset;substring_~ps~0.base, substring_~ps~0.offset := substring_#t~post10.base, substring_#t~post10.offset + 1;havoc substring_#t~post10.base, substring_#t~post10.offset; 126#L550-4 [2018-11-10 05:37:36,325 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 05:37:36,325 INFO L82 PathProgramCache]: Analyzing trace with hash 180425515, now seen corresponding path program 3 times [2018-11-10 05:37:36,325 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 05:37:36,325 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 05:37:36,326 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:37:36,326 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 05:37:36,326 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:37:36,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 05:37:36,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 05:37:36,349 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 05:37:36,349 INFO L82 PathProgramCache]: Analyzing trace with hash -1411931925, now seen corresponding path program 1 times [2018-11-10 05:37:36,349 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 05:37:36,349 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 05:37:36,350 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:37:36,350 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 05:37:36,350 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:37:36,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 05:37:36,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 05:37:36,368 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 05:37:36,368 INFO L82 PathProgramCache]: Analyzing trace with hash 1729135105, now seen corresponding path program 1 times [2018-11-10 05:37:36,368 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 05:37:36,368 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 05:37:36,369 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:37:36,369 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 05:37:36,369 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:37:36,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 05:37:36,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 05:37:36,593 WARN L179 SmtUtils]: Spent 178.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 59 [2018-11-10 05:37:36,832 WARN L179 SmtUtils]: Spent 193.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 92 [2018-11-10 05:37:36,919 INFO L214 LassoAnalysis]: Preferences: [2018-11-10 05:37:36,920 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-10 05:37:36,920 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-10 05:37:36,920 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-10 05:37:36,920 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-10 05:37:36,920 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 05:37:36,921 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-10 05:37:36,921 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-10 05:37:36,921 INFO L131 ssoRankerPreferences]: Filename of dumped script: substring-alloca_true-termination.c.i_Iteration3_Lasso [2018-11-10 05:37:36,921 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-10 05:37:36,921 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-10 05:37:36,937 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:37:36,940 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:37:36,942 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:37:36,944 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:37:36,946 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:37:36,947 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:37:36,949 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:37:36,950 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:37:36,951 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:37:36,952 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:37:36,953 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:37:36,955 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:37:36,956 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:37:36,958 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:37:36,960 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:37:36,962 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:37:36,963 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:37:36,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:37:36,965 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:37:36,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:37:37,202 WARN L179 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 82 [2018-11-10 05:37:37,320 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:37:37,321 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:37:37,322 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:37:37,716 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-10 05:37:37,720 INFO L496 LassoAnalysis]: Using template 'affine'. [2018-11-10 05:37:37,722 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:37:37,723 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 05:37:37,723 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 05:37:37,723 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 05:37:37,723 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 05:37:37,723 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 05:37:37,725 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 05:37:37,725 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 05:37:37,726 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 05:37:37,726 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:37:37,727 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 05:37:37,727 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 05:37:37,727 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 05:37:37,727 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 05:37:37,727 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 05:37:37,728 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 05:37:37,728 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 05:37:37,729 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 05:37:37,729 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:37:37,730 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 05:37:37,730 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 05:37:37,730 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 05:37:37,730 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 05:37:37,731 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 05:37:37,732 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 05:37:37,735 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 05:37:37,735 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:37:37,736 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 05:37:37,736 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 05:37:37,736 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 05:37:37,736 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 05:37:37,736 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 05:37:37,737 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 05:37:37,737 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 05:37:37,739 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 05:37:37,739 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:37:37,739 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 05:37:37,739 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 05:37:37,740 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 05:37:37,740 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 05:37:37,741 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 05:37:37,741 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 05:37:37,745 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 05:37:37,746 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:37:37,746 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 05:37:37,747 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 05:37:37,747 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 05:37:37,747 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 05:37:37,748 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 05:37:37,748 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 05:37:37,751 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 05:37:37,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:37:37,752 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 05:37:37,752 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 05:37:37,752 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 05:37:37,752 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 05:37:37,755 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 05:37:37,756 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 05:37:37,756 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 05:37:37,757 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 05:37:37,757 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:37:37,757 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 05:37:37,758 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 05:37:37,758 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 05:37:37,758 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 05:37:37,758 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 05:37:37,758 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 05:37:37,758 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 05:37:37,759 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 05:37:37,759 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:37:37,760 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 05:37:37,760 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 05:37:37,764 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 05:37:37,764 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 05:37:37,764 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 05:37:37,765 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 05:37:37,765 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 05:37:37,765 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 05:37:37,766 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:37:37,766 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 05:37:37,766 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 05:37:37,766 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 05:37:37,766 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 05:37:37,766 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 05:37:37,767 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 05:37:37,767 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 05:37:37,767 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 05:37:37,768 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:37:37,768 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 05:37:37,772 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 05:37:37,772 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 05:37:37,772 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 05:37:37,772 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 05:37:37,773 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 05:37:37,773 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 05:37:37,774 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 05:37:37,774 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:37:37,774 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 05:37:37,774 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 05:37:37,775 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 05:37:37,775 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 05:37:37,775 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 05:37:37,775 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 05:37:37,775 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 05:37:37,776 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 05:37:37,776 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:37:37,777 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 05:37:37,777 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 05:37:37,777 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 05:37:37,777 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 05:37:37,777 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 05:37:37,777 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 05:37:37,777 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 05:37:37,778 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 05:37:37,778 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:37:37,779 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 05:37:37,779 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 05:37:37,779 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 05:37:37,779 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 05:37:37,779 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 05:37:37,779 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 05:37:37,780 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 05:37:37,792 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 05:37:37,793 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 05:37:37,793 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 05:37:37,793 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 05:37:37,793 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 05:37:37,794 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 05:37:37,794 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 05:37:37,794 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 05:37:37,794 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 05:37:37,795 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 05:37:37,795 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 05:37:37,796 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 05:37:37,796 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 05:37:37,796 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 05:37:37,796 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 05:37:37,796 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 05:37:37,796 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 05:37:37,796 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 05:37:37,797 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 05:37:37,797 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:37:37,797 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 05:37:37,798 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 05:37:37,798 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 05:37:37,798 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 05:37:37,799 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 05:37:37,799 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 05:37:37,801 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 05:37:37,801 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:37:37,801 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 05:37:37,802 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 05:37:37,802 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 05:37:37,802 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 05:37:37,802 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 05:37:37,802 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 05:37:37,802 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 05:37:37,803 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 05:37:37,803 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:37:37,804 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 05:37:37,804 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 05:37:37,804 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 05:37:37,804 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 05:37:37,804 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 05:37:37,804 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 05:37:37,805 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 05:37:37,805 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 05:37:37,805 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:37:37,806 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 05:37:37,806 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 05:37:37,806 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 05:37:37,806 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 05:37:37,807 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 05:37:37,807 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 05:37:37,809 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 05:37:37,809 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:37:37,810 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 05:37:37,810 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 05:37:37,810 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 05:37:37,810 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 05:37:37,812 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 05:37:37,812 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 05:37:37,827 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 05:37:37,827 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:37:37,828 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 05:37:37,828 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 05:37:37,828 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 05:37:37,828 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 05:37:37,829 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 05:37:37,829 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 05:37:37,832 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 05:37:37,832 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:37:37,832 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 05:37:37,832 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 05:37:37,833 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 05:37:37,833 INFO L206 nArgumentSynthesizer]: 6 loop disjuncts [2018-11-10 05:37:37,833 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 05:37:37,834 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2018-11-10 05:37:37,834 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 05:37:37,844 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 05:37:37,844 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:37:37,844 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 05:37:37,845 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 05:37:37,845 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 05:37:37,845 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 05:37:37,848 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 05:37:37,848 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 05:37:37,870 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-10 05:37:37,895 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2018-11-10 05:37:37,895 INFO L444 ModelExtractionUtils]: 32 out of 37 variables were initially zero. Simplification set additionally 2 variables to zero. [2018-11-10 05:37:37,897 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-10 05:37:37,898 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-10 05:37:37,898 INFO L517 LassoAnalysis]: Proved termination. [2018-11-10 05:37:37,899 INFO L519 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_main_#t~malloc13.base)_1, ULTIMATE.start_substring_~ps~0.offset) = 1*v_rep(select #length ULTIMATE.start_main_#t~malloc13.base)_1 - 1*ULTIMATE.start_substring_~ps~0.offset Supporting invariants [] [2018-11-10 05:37:37,938 INFO L297 tatePredicateManager]: 8 out of 9 supporting invariants were superfluous and have been removed [2018-11-10 05:37:37,943 WARN L1239 BoogieBacktranslator]: unknown boogie variable #length [2018-11-10 05:37:37,959 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 05:37:37,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:37:37,976 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 05:37:38,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:37:38,001 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 05:37:38,013 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:37:38,015 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 2 loop predicates [2018-11-10 05:37:38,016 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 22 states and 26 transitions. cyclomatic complexity: 5 Second operand 5 states. [2018-11-10 05:37:38,061 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 22 states and 26 transitions. cyclomatic complexity: 5. Second operand 5 states. Result 36 states and 43 transitions. Complement of second has 7 states. [2018-11-10 05:37:38,061 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 2 stem states 2 non-accepting loop states 1 accepting loop states [2018-11-10 05:37:38,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-10 05:37:38,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 25 transitions. [2018-11-10 05:37:38,063 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 25 transitions. Stem has 8 letters. Loop has 13 letters. [2018-11-10 05:37:38,064 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 05:37:38,064 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 25 transitions. Stem has 21 letters. Loop has 13 letters. [2018-11-10 05:37:38,064 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 05:37:38,064 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 25 transitions. Stem has 8 letters. Loop has 26 letters. [2018-11-10 05:37:38,064 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 05:37:38,065 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 36 states and 43 transitions. [2018-11-10 05:37:38,065 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 9 [2018-11-10 05:37:38,066 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 36 states to 34 states and 41 transitions. [2018-11-10 05:37:38,066 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 19 [2018-11-10 05:37:38,066 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 20 [2018-11-10 05:37:38,066 INFO L73 IsDeterministic]: Start isDeterministic. Operand 34 states and 41 transitions. [2018-11-10 05:37:38,067 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 05:37:38,067 INFO L705 BuchiCegarLoop]: Abstraction has 34 states and 41 transitions. [2018-11-10 05:37:38,067 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states and 41 transitions. [2018-11-10 05:37:38,068 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 33. [2018-11-10 05:37:38,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2018-11-10 05:37:38,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 40 transitions. [2018-11-10 05:37:38,069 INFO L728 BuchiCegarLoop]: Abstraction has 33 states and 40 transitions. [2018-11-10 05:37:38,069 INFO L608 BuchiCegarLoop]: Abstraction has 33 states and 40 transitions. [2018-11-10 05:37:38,069 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2018-11-10 05:37:38,069 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 33 states and 40 transitions. [2018-11-10 05:37:38,069 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2018-11-10 05:37:38,069 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 05:37:38,070 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 05:37:38,070 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 05:37:38,070 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2018-11-10 05:37:38,070 INFO L793 eck$LassoCheckResult]: Stem: 333#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 330#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet11, main_#t~nondet12, main_#t~malloc13.base, main_#t~malloc13.offset, main_#t~malloc14.base, main_#t~malloc14.offset, main_#t~ret15, main_~length1~0, main_~length2~0, main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;main_~length1~0 := main_#t~nondet11;havoc main_#t~nondet11;main_~length2~0 := main_#t~nondet12;havoc main_#t~nondet12; 326#L565 assume !(main_~length1~0 < 1); 327#L565-2 assume !(main_~length2~0 < 1); 323#L568-1 #Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := main_~length1~0 * 1;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~malloc13.base, main_#t~malloc13.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc13.base, main_#t~malloc13.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := main_~length2~0 * 1;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~malloc14.base, main_#t~malloc14.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc14.base, main_#t~malloc14.offset; 324#L573 SUMMARY for call write~int(0, main_~nondetString1~0.base, main_~nondetString1~0.offset + (main_~length1~0 - 1) * 1, 1); srcloc: L573 336#L573-1 SUMMARY for call write~int(0, main_~nondetString2~0.base, main_~nondetString2~0.offset + (main_~length2~0 - 1) * 1, 1); srcloc: L573-1 331#L574 assume { :begin_inline_substring } true;substring_#in~s.base, substring_#in~s.offset, substring_#in~t.base, substring_#in~t.offset := main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;havoc substring_#res;havoc substring_#t~post7.base, substring_#t~post7.offset, substring_#t~post8.base, substring_#t~post8.offset, substring_#t~mem3, substring_#t~mem4, substring_#t~mem5, substring_#t~short6, substring_#t~mem9, substring_#t~post10.base, substring_#t~post10.offset, substring_~ps2~0.base, substring_~ps2~0.offset, substring_~pt~0.base, substring_~pt~0.offset, substring_#t~mem2, substring_~s.base, substring_~s.offset, substring_~t.base, substring_~t.offset, substring_~ps~0.base, substring_~ps~0.offset;substring_~s.base, substring_~s.offset := substring_#in~s.base, substring_#in~s.offset;substring_~t.base, substring_~t.offset := substring_#in~t.base, substring_#in~t.offset;substring_~ps~0.base, substring_~ps~0.offset := substring_~s.base, substring_~s.offset; 320#L550-4 assume true; 322#L550-1 SUMMARY for call substring_#t~mem2 := read~int(substring_~ps~0.base, substring_~ps~0.offset, 1); srcloc: L550-1 308#L550-2 assume !!(substring_#t~mem2 != 0);havoc substring_#t~mem2;substring_~ps2~0.base, substring_~ps2~0.offset := substring_~ps~0.base, substring_~ps~0.offset;substring_~pt~0.base, substring_~pt~0.offset := substring_~t.base, substring_~t.offset; 309#L553-10 [2018-11-10 05:37:38,070 INFO L795 eck$LassoCheckResult]: Loop: 309#L553-10 assume true; 328#L553-1 SUMMARY for call substring_#t~mem3 := read~int(substring_~pt~0.base, substring_~pt~0.offset, 1); srcloc: L553-1 334#L553-2 substring_#t~short6 := substring_#t~mem3 != 0; 337#L553-3 assume !substring_#t~short6; 316#L553-8 assume !!substring_#t~short6;havoc substring_#t~mem3;havoc substring_#t~mem5;havoc substring_#t~short6;havoc substring_#t~mem4;substring_#t~post7.base, substring_#t~post7.offset := substring_~pt~0.base, substring_~pt~0.offset;substring_~pt~0.base, substring_~pt~0.offset := substring_#t~post7.base, substring_#t~post7.offset + 1;havoc substring_#t~post7.base, substring_#t~post7.offset;substring_#t~post8.base, substring_#t~post8.offset := substring_~ps2~0.base, substring_~ps2~0.offset;substring_~ps2~0.base, substring_~ps2~0.offset := substring_#t~post8.base, substring_#t~post8.offset + 1;havoc substring_#t~post8.base, substring_#t~post8.offset; 309#L553-10 [2018-11-10 05:37:38,070 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 05:37:38,070 INFO L82 PathProgramCache]: Analyzing trace with hash 2052451984, now seen corresponding path program 1 times [2018-11-10 05:37:38,070 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 05:37:38,070 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 05:37:38,071 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:37:38,071 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 05:37:38,071 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:37:38,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 05:37:38,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 05:37:38,088 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 05:37:38,088 INFO L82 PathProgramCache]: Analyzing trace with hash 60184039, now seen corresponding path program 1 times [2018-11-10 05:37:38,088 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 05:37:38,089 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 05:37:38,089 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:37:38,089 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 05:37:38,090 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:37:38,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:37:38,112 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:37:38,112 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 05:37:38,113 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-10 05:37:38,113 INFO L810 eck$LassoCheckResult]: loop already infeasible [2018-11-10 05:37:38,113 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 05:37:38,113 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 05:37:38,113 INFO L87 Difference]: Start difference. First operand 33 states and 40 transitions. cyclomatic complexity: 9 Second operand 3 states. [2018-11-10 05:37:38,122 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 05:37:38,122 INFO L93 Difference]: Finished difference Result 34 states and 39 transitions. [2018-11-10 05:37:38,122 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 05:37:38,123 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 34 states and 39 transitions. [2018-11-10 05:37:38,123 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2018-11-10 05:37:38,124 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 34 states to 32 states and 37 transitions. [2018-11-10 05:37:38,124 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 19 [2018-11-10 05:37:38,124 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 19 [2018-11-10 05:37:38,124 INFO L73 IsDeterministic]: Start isDeterministic. Operand 32 states and 37 transitions. [2018-11-10 05:37:38,124 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 05:37:38,124 INFO L705 BuchiCegarLoop]: Abstraction has 32 states and 37 transitions. [2018-11-10 05:37:38,124 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states and 37 transitions. [2018-11-10 05:37:38,126 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2018-11-10 05:37:38,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2018-11-10 05:37:38,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 37 transitions. [2018-11-10 05:37:38,126 INFO L728 BuchiCegarLoop]: Abstraction has 32 states and 37 transitions. [2018-11-10 05:37:38,126 INFO L608 BuchiCegarLoop]: Abstraction has 32 states and 37 transitions. [2018-11-10 05:37:38,126 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2018-11-10 05:37:38,126 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 32 states and 37 transitions. [2018-11-10 05:37:38,127 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2018-11-10 05:37:38,127 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 05:37:38,127 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 05:37:38,127 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 05:37:38,128 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 05:37:38,128 INFO L793 eck$LassoCheckResult]: Stem: 405#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 403#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet11, main_#t~nondet12, main_#t~malloc13.base, main_#t~malloc13.offset, main_#t~malloc14.base, main_#t~malloc14.offset, main_#t~ret15, main_~length1~0, main_~length2~0, main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;main_~length1~0 := main_#t~nondet11;havoc main_#t~nondet11;main_~length2~0 := main_#t~nondet12;havoc main_#t~nondet12; 399#L565 assume !(main_~length1~0 < 1); 400#L565-2 assume !(main_~length2~0 < 1); 396#L568-1 #Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := main_~length1~0 * 1;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~malloc13.base, main_#t~malloc13.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc13.base, main_#t~malloc13.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := main_~length2~0 * 1;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~malloc14.base, main_#t~malloc14.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc14.base, main_#t~malloc14.offset; 397#L573 SUMMARY for call write~int(0, main_~nondetString1~0.base, main_~nondetString1~0.offset + (main_~length1~0 - 1) * 1, 1); srcloc: L573 408#L573-1 SUMMARY for call write~int(0, main_~nondetString2~0.base, main_~nondetString2~0.offset + (main_~length2~0 - 1) * 1, 1); srcloc: L573-1 404#L574 assume { :begin_inline_substring } true;substring_#in~s.base, substring_#in~s.offset, substring_#in~t.base, substring_#in~t.offset := main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;havoc substring_#res;havoc substring_#t~post7.base, substring_#t~post7.offset, substring_#t~post8.base, substring_#t~post8.offset, substring_#t~mem3, substring_#t~mem4, substring_#t~mem5, substring_#t~short6, substring_#t~mem9, substring_#t~post10.base, substring_#t~post10.offset, substring_~ps2~0.base, substring_~ps2~0.offset, substring_~pt~0.base, substring_~pt~0.offset, substring_#t~mem2, substring_~s.base, substring_~s.offset, substring_~t.base, substring_~t.offset, substring_~ps~0.base, substring_~ps~0.offset;substring_~s.base, substring_~s.offset := substring_#in~s.base, substring_#in~s.offset;substring_~t.base, substring_~t.offset := substring_#in~t.base, substring_#in~t.offset;substring_~ps~0.base, substring_~ps~0.offset := substring_~s.base, substring_~s.offset; 393#L550-4 assume true; 395#L550-1 SUMMARY for call substring_#t~mem2 := read~int(substring_~ps~0.base, substring_~ps~0.offset, 1); srcloc: L550-1 381#L550-2 assume !!(substring_#t~mem2 != 0);havoc substring_#t~mem2;substring_~ps2~0.base, substring_~ps2~0.offset := substring_~ps~0.base, substring_~ps~0.offset;substring_~pt~0.base, substring_~pt~0.offset := substring_~t.base, substring_~t.offset; 382#L553-10 [2018-11-10 05:37:38,128 INFO L795 eck$LassoCheckResult]: Loop: 382#L553-10 assume true; 401#L553-1 SUMMARY for call substring_#t~mem3 := read~int(substring_~pt~0.base, substring_~pt~0.offset, 1); srcloc: L553-1 406#L553-2 substring_#t~short6 := substring_#t~mem3 != 0; 409#L553-3 assume substring_#t~short6; 411#L553-4 SUMMARY for call substring_#t~mem4 := read~int(substring_~pt~0.base, substring_~pt~0.offset, 1); srcloc: L553-4 385#L553-5 SUMMARY for call substring_#t~mem5 := read~int(substring_~ps2~0.base, substring_~ps2~0.offset, 1); srcloc: L553-5 386#L553-6 substring_#t~short6 := substring_#t~mem4 == substring_#t~mem5; 389#L553-8 assume !!substring_#t~short6;havoc substring_#t~mem3;havoc substring_#t~mem5;havoc substring_#t~short6;havoc substring_#t~mem4;substring_#t~post7.base, substring_#t~post7.offset := substring_~pt~0.base, substring_~pt~0.offset;substring_~pt~0.base, substring_~pt~0.offset := substring_#t~post7.base, substring_#t~post7.offset + 1;havoc substring_#t~post7.base, substring_#t~post7.offset;substring_#t~post8.base, substring_#t~post8.offset := substring_~ps2~0.base, substring_~ps2~0.offset;substring_~ps2~0.base, substring_~ps2~0.offset := substring_#t~post8.base, substring_#t~post8.offset + 1;havoc substring_#t~post8.base, substring_#t~post8.offset; 382#L553-10 [2018-11-10 05:37:38,128 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 05:37:38,128 INFO L82 PathProgramCache]: Analyzing trace with hash 2052451984, now seen corresponding path program 2 times [2018-11-10 05:37:38,128 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 05:37:38,128 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 05:37:38,129 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:37:38,129 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 05:37:38,129 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:37:38,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 05:37:38,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 05:37:38,143 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 05:37:38,143 INFO L82 PathProgramCache]: Analyzing trace with hash 1936468655, now seen corresponding path program 1 times [2018-11-10 05:37:38,143 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 05:37:38,143 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 05:37:38,144 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:37:38,144 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 05:37:38,144 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:37:38,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 05:37:38,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 05:37:38,151 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 05:37:38,151 INFO L82 PathProgramCache]: Analyzing trace with hash 976099902, now seen corresponding path program 1 times [2018-11-10 05:37:38,151 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 05:37:38,151 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 05:37:38,152 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:37:38,152 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 05:37:38,152 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:37:38,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 05:37:38,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 05:37:38,487 WARN L179 SmtUtils]: Spent 211.00 ms on a formula simplification. DAG size of input: 124 DAG size of output: 106 [2018-11-10 05:37:38,564 INFO L214 LassoAnalysis]: Preferences: [2018-11-10 05:37:38,564 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-10 05:37:38,564 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-10 05:37:38,564 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-10 05:37:38,564 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-10 05:37:38,564 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 05:37:38,564 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-10 05:37:38,564 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-10 05:37:38,564 INFO L131 ssoRankerPreferences]: Filename of dumped script: substring-alloca_true-termination.c.i_Iteration5_Lasso [2018-11-10 05:37:38,564 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-10 05:37:38,564 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-10 05:37:38,571 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:37:38,573 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:37:38,575 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:37:38,576 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:37:38,578 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:37:38,579 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:37:38,579 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:37:38,580 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:37:38,581 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:37:38,583 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:37:38,584 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:37:38,587 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:37:38,589 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:37:38,591 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:37:38,592 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:37:38,593 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:37:38,594 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:37:38,595 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:37:38,597 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:37:38,599 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:37:38,848 WARN L179 SmtUtils]: Spent 166.00 ms on a formula simplification. DAG size of input: 117 DAG size of output: 104 [2018-11-10 05:37:38,962 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:37:38,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:37:38,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:37:39,423 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-10 05:37:39,423 INFO L496 LassoAnalysis]: Using template 'affine'. [2018-11-10 05:37:39,424 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:37:39,424 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 05:37:39,424 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 05:37:39,424 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 05:37:39,424 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 05:37:39,425 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 05:37:39,425 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 05:37:39,425 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 05:37:39,426 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 05:37:39,426 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:37:39,426 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 05:37:39,426 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 05:37:39,427 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 05:37:39,427 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 05:37:39,427 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 05:37:39,427 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 05:37:39,427 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 05:37:39,427 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 05:37:39,428 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:37:39,428 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 05:37:39,428 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 05:37:39,428 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 05:37:39,428 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 05:37:39,429 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 05:37:39,429 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 05:37:39,430 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 05:37:39,430 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:37:39,431 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 05:37:39,431 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 05:37:39,431 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 05:37:39,431 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 05:37:39,431 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 05:37:39,431 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 05:37:39,431 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 05:37:39,432 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 05:37:39,432 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:37:39,432 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 05:37:39,433 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 05:37:39,433 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 05:37:39,433 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 05:37:39,433 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 05:37:39,433 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 05:37:39,433 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 05:37:39,434 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 05:37:39,434 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:37:39,434 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 05:37:39,434 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 05:37:39,434 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 05:37:39,434 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 05:37:39,435 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 05:37:39,435 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 05:37:39,435 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 05:37:39,435 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 05:37:39,436 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:37:39,436 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 05:37:39,436 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 05:37:39,436 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 05:37:39,436 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 05:37:39,436 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 05:37:39,436 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 05:37:39,437 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 05:37:39,437 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 05:37:39,437 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:37:39,438 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 05:37:39,438 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 05:37:39,438 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 05:37:39,438 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 05:37:39,438 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 05:37:39,438 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 05:37:39,438 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 05:37:39,439 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 05:37:39,439 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:37:39,439 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 05:37:39,440 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 05:37:39,440 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 05:37:39,440 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 05:37:39,440 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 05:37:39,441 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 05:37:39,442 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 05:37:39,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:37:39,443 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 05:37:39,443 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 05:37:39,443 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 05:37:39,443 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 05:37:39,443 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 05:37:39,444 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 05:37:39,444 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 05:37:39,444 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 05:37:39,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:37:39,445 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 05:37:39,445 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 05:37:39,445 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 05:37:39,445 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 05:37:39,445 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 05:37:39,445 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 05:37:39,445 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 05:37:39,446 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 05:37:39,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:37:39,446 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 05:37:39,447 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 05:37:39,447 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 05:37:39,447 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 05:37:39,447 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 05:37:39,447 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 05:37:39,449 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 05:37:39,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:37:39,449 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 05:37:39,450 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 05:37:39,450 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 05:37:39,450 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 05:37:39,450 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 05:37:39,450 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 05:37:39,450 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 05:37:39,451 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 05:37:39,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:37:39,451 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 05:37:39,451 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 05:37:39,451 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 05:37:39,452 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 05:37:39,452 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 05:37:39,452 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 05:37:39,452 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 05:37:39,452 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 05:37:39,453 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:37:39,453 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 05:37:39,453 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 05:37:39,453 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 05:37:39,453 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 05:37:39,453 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 05:37:39,454 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 05:37:39,454 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 05:37:39,454 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 05:37:39,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:37:39,455 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 05:37:39,455 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 05:37:39,455 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 05:37:39,455 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 05:37:39,455 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 05:37:39,455 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 05:37:39,455 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 05:37:39,456 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 05:37:39,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:37:39,456 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 05:37:39,456 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 05:37:39,457 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 05:37:39,457 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 05:37:39,457 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 05:37:39,457 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 05:37:39,457 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 05:37:39,457 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 05:37:39,458 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:37:39,458 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 05:37:39,458 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 05:37:39,458 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 05:37:39,458 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 05:37:39,458 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 05:37:39,459 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 05:37:39,459 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 05:37:39,459 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 05:37:39,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:37:39,460 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 05:37:39,460 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 05:37:39,460 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 05:37:39,460 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 05:37:39,461 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 05:37:39,461 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 05:37:39,462 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 05:37:39,462 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:37:39,463 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 05:37:39,463 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 05:37:39,463 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 05:37:39,463 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 05:37:39,464 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 05:37:39,464 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 05:37:39,465 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 05:37:39,465 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:37:39,466 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 05:37:39,466 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 05:37:39,466 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 05:37:39,466 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 05:37:39,466 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 05:37:39,467 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 05:37:39,468 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 05:37:39,468 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:37:39,469 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 05:37:39,469 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 05:37:39,469 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 05:37:39,469 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 05:37:39,472 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 05:37:39,473 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 05:37:39,507 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-10 05:37:39,533 INFO L443 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. [2018-11-10 05:37:39,533 INFO L444 ModelExtractionUtils]: 56 out of 61 variables were initially zero. Simplification set additionally 2 variables to zero. [2018-11-10 05:37:39,533 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-10 05:37:39,534 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-10 05:37:39,534 INFO L517 LassoAnalysis]: Proved termination. [2018-11-10 05:37:39,534 INFO L519 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_main_#t~malloc13.base)_2, ULTIMATE.start_substring_~pt~0.offset) = 1*v_rep(select #length ULTIMATE.start_main_#t~malloc13.base)_2 - 1*ULTIMATE.start_substring_~pt~0.offset Supporting invariants [] [2018-11-10 05:37:39,598 INFO L297 tatePredicateManager]: 19 out of 21 supporting invariants were superfluous and have been removed [2018-11-10 05:37:39,601 WARN L1239 BoogieBacktranslator]: unknown boogie variable #length [2018-11-10 05:37:39,622 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 05:37:39,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:37:39,638 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 05:37:39,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:37:39,680 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 05:37:39,696 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:37:39,697 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.3 stem predicates 2 loop predicates [2018-11-10 05:37:39,697 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 32 states and 37 transitions. cyclomatic complexity: 7 Second operand 6 states. [2018-11-10 05:37:39,776 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 32 states and 37 transitions. cyclomatic complexity: 7. Second operand 6 states. Result 81 states and 89 transitions. Complement of second has 9 states. [2018-11-10 05:37:39,777 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 3 stem states 2 non-accepting loop states 1 accepting loop states [2018-11-10 05:37:39,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-10 05:37:39,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 26 transitions. [2018-11-10 05:37:39,777 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 26 transitions. Stem has 11 letters. Loop has 8 letters. [2018-11-10 05:37:39,777 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 05:37:39,778 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 26 transitions. Stem has 19 letters. Loop has 8 letters. [2018-11-10 05:37:39,778 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 05:37:39,778 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 26 transitions. Stem has 11 letters. Loop has 16 letters. [2018-11-10 05:37:39,778 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 05:37:39,778 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 81 states and 89 transitions. [2018-11-10 05:37:39,779 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2018-11-10 05:37:39,780 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 81 states to 56 states and 62 transitions. [2018-11-10 05:37:39,780 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 21 [2018-11-10 05:37:39,780 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 21 [2018-11-10 05:37:39,780 INFO L73 IsDeterministic]: Start isDeterministic. Operand 56 states and 62 transitions. [2018-11-10 05:37:39,780 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 05:37:39,780 INFO L705 BuchiCegarLoop]: Abstraction has 56 states and 62 transitions. [2018-11-10 05:37:39,780 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states and 62 transitions. [2018-11-10 05:37:39,782 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 49. [2018-11-10 05:37:39,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2018-11-10 05:37:39,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 54 transitions. [2018-11-10 05:37:39,783 INFO L728 BuchiCegarLoop]: Abstraction has 49 states and 54 transitions. [2018-11-10 05:37:39,783 INFO L608 BuchiCegarLoop]: Abstraction has 49 states and 54 transitions. [2018-11-10 05:37:39,783 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2018-11-10 05:37:39,783 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 49 states and 54 transitions. [2018-11-10 05:37:39,783 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2018-11-10 05:37:39,784 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 05:37:39,784 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 05:37:39,788 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 05:37:39,788 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 05:37:39,789 INFO L793 eck$LassoCheckResult]: Stem: 697#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 695#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet11, main_#t~nondet12, main_#t~malloc13.base, main_#t~malloc13.offset, main_#t~malloc14.base, main_#t~malloc14.offset, main_#t~ret15, main_~length1~0, main_~length2~0, main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;main_~length1~0 := main_#t~nondet11;havoc main_#t~nondet11;main_~length2~0 := main_#t~nondet12;havoc main_#t~nondet12; 690#L565 assume !(main_~length1~0 < 1); 691#L565-2 assume !(main_~length2~0 < 1); 687#L568-1 #Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := main_~length1~0 * 1;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~malloc13.base, main_#t~malloc13.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc13.base, main_#t~malloc13.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := main_~length2~0 * 1;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~malloc14.base, main_#t~malloc14.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc14.base, main_#t~malloc14.offset; 688#L573 SUMMARY for call write~int(0, main_~nondetString1~0.base, main_~nondetString1~0.offset + (main_~length1~0 - 1) * 1, 1); srcloc: L573 700#L573-1 SUMMARY for call write~int(0, main_~nondetString2~0.base, main_~nondetString2~0.offset + (main_~length2~0 - 1) * 1, 1); srcloc: L573-1 696#L574 assume { :begin_inline_substring } true;substring_#in~s.base, substring_#in~s.offset, substring_#in~t.base, substring_#in~t.offset := main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;havoc substring_#res;havoc substring_#t~post7.base, substring_#t~post7.offset, substring_#t~post8.base, substring_#t~post8.offset, substring_#t~mem3, substring_#t~mem4, substring_#t~mem5, substring_#t~short6, substring_#t~mem9, substring_#t~post10.base, substring_#t~post10.offset, substring_~ps2~0.base, substring_~ps2~0.offset, substring_~pt~0.base, substring_~pt~0.offset, substring_#t~mem2, substring_~s.base, substring_~s.offset, substring_~t.base, substring_~t.offset, substring_~ps~0.base, substring_~ps~0.offset;substring_~s.base, substring_~s.offset := substring_#in~s.base, substring_#in~s.offset;substring_~t.base, substring_~t.offset := substring_#in~t.base, substring_#in~t.offset;substring_~ps~0.base, substring_~ps~0.offset := substring_~s.base, substring_~s.offset; 683#L550-4 assume true; 684#L550-1 SUMMARY for call substring_#t~mem2 := read~int(substring_~ps~0.base, substring_~ps~0.offset, 1); srcloc: L550-1 673#L550-2 assume !!(substring_#t~mem2 != 0);havoc substring_#t~mem2;substring_~ps2~0.base, substring_~ps2~0.offset := substring_~ps~0.base, substring_~ps~0.offset;substring_~pt~0.base, substring_~pt~0.offset := substring_~t.base, substring_~t.offset; 674#L553-10 assume true; 718#L553-1 SUMMARY for call substring_#t~mem3 := read~int(substring_~pt~0.base, substring_~pt~0.offset, 1); srcloc: L553-1 716#L553-2 substring_#t~short6 := substring_#t~mem3 != 0; 704#L553-3 assume substring_#t~short6; 705#L553-4 SUMMARY for call substring_#t~mem4 := read~int(substring_~pt~0.base, substring_~pt~0.offset, 1); srcloc: L553-4 677#L553-5 SUMMARY for call substring_#t~mem5 := read~int(substring_~ps2~0.base, substring_~ps2~0.offset, 1); srcloc: L553-5 678#L553-6 substring_#t~short6 := substring_#t~mem4 == substring_#t~mem5; 680#L553-8 assume !substring_#t~short6;havoc substring_#t~mem3;havoc substring_#t~mem5;havoc substring_#t~short6;havoc substring_#t~mem4; 689#L553-11 SUMMARY for call substring_#t~mem9 := read~int(substring_~pt~0.base, substring_~pt~0.offset, 1); srcloc: L553-11 681#L557 assume !(substring_#t~mem9 == 0);havoc substring_#t~mem9;substring_#t~post10.base, substring_#t~post10.offset := substring_~ps~0.base, substring_~ps~0.offset;substring_~ps~0.base, substring_~ps~0.offset := substring_#t~post10.base, substring_#t~post10.offset + 1;havoc substring_#t~post10.base, substring_#t~post10.offset; 682#L550-4 assume true; 686#L550-1 SUMMARY for call substring_#t~mem2 := read~int(substring_~ps~0.base, substring_~ps~0.offset, 1); srcloc: L550-1 671#L550-2 assume !!(substring_#t~mem2 != 0);havoc substring_#t~mem2;substring_~ps2~0.base, substring_~ps2~0.offset := substring_~ps~0.base, substring_~ps~0.offset;substring_~pt~0.base, substring_~pt~0.offset := substring_~t.base, substring_~t.offset; 672#L553-10 [2018-11-10 05:37:39,789 INFO L795 eck$LassoCheckResult]: Loop: 672#L553-10 assume true; 692#L553-1 SUMMARY for call substring_#t~mem3 := read~int(substring_~pt~0.base, substring_~pt~0.offset, 1); srcloc: L553-1 698#L553-2 substring_#t~short6 := substring_#t~mem3 != 0; 701#L553-3 assume substring_#t~short6; 703#L553-4 SUMMARY for call substring_#t~mem4 := read~int(substring_~pt~0.base, substring_~pt~0.offset, 1); srcloc: L553-4 675#L553-5 SUMMARY for call substring_#t~mem5 := read~int(substring_~ps2~0.base, substring_~ps2~0.offset, 1); srcloc: L553-5 676#L553-6 substring_#t~short6 := substring_#t~mem4 == substring_#t~mem5; 679#L553-8 assume !!substring_#t~short6;havoc substring_#t~mem3;havoc substring_#t~mem5;havoc substring_#t~short6;havoc substring_#t~mem4;substring_#t~post7.base, substring_#t~post7.offset := substring_~pt~0.base, substring_~pt~0.offset;substring_~pt~0.base, substring_~pt~0.offset := substring_#t~post7.base, substring_#t~post7.offset + 1;havoc substring_#t~post7.base, substring_#t~post7.offset;substring_#t~post8.base, substring_#t~post8.offset := substring_~ps2~0.base, substring_~ps2~0.offset;substring_~ps2~0.base, substring_~ps2~0.offset := substring_#t~post8.base, substring_#t~post8.offset + 1;havoc substring_#t~post8.base, substring_#t~post8.offset; 672#L553-10 [2018-11-10 05:37:39,789 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 05:37:39,789 INFO L82 PathProgramCache]: Analyzing trace with hash -1173813254, now seen corresponding path program 2 times [2018-11-10 05:37:39,789 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 05:37:39,789 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 05:37:39,790 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:37:39,790 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 05:37:39,790 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:37:39,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 05:37:39,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 05:37:39,811 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 05:37:39,811 INFO L82 PathProgramCache]: Analyzing trace with hash 1936468655, now seen corresponding path program 2 times [2018-11-10 05:37:39,811 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 05:37:39,811 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 05:37:39,812 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:37:39,812 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 05:37:39,814 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:37:39,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 05:37:39,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 05:37:39,820 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 05:37:39,820 INFO L82 PathProgramCache]: Analyzing trace with hash 705571240, now seen corresponding path program 1 times [2018-11-10 05:37:39,820 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 05:37:39,820 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 05:37:39,821 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:37:39,821 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 05:37:39,821 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:37:39,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 05:37:39,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 05:37:39,946 WARN L179 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 45 [2018-11-10 05:37:40,320 WARN L179 SmtUtils]: Spent 356.00 ms on a formula simplification. DAG size of input: 188 DAG size of output: 147 [2018-11-10 05:37:40,426 WARN L179 SmtUtils]: Spent 103.00 ms on a formula simplification that was a NOOP. DAG size: 113 [2018-11-10 05:37:40,428 INFO L214 LassoAnalysis]: Preferences: [2018-11-10 05:37:40,428 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-10 05:37:40,428 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-10 05:37:40,428 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-10 05:37:40,428 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-10 05:37:40,428 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 05:37:40,428 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-10 05:37:40,428 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-10 05:37:40,428 INFO L131 ssoRankerPreferences]: Filename of dumped script: substring-alloca_true-termination.c.i_Iteration6_Lasso [2018-11-10 05:37:40,428 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-10 05:37:40,428 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-10 05:37:40,431 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:37:40,433 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 05:37:40,434 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 05:37:40,436 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 05:37:40,437 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:37:40,438 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 05:37:40,440 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:37:40,441 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 05:37:40,442 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:37:40,443 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:37:40,879 WARN L179 SmtUtils]: Spent 289.00 ms on a formula simplification. DAG size of input: 142 DAG size of output: 123 [2018-11-10 05:37:41,029 WARN L179 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 91 [2018-11-10 05:37:41,029 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:37:41,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:37:41,031 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:37:41,032 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:37:41,033 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:37:41,034 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:37:41,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:37:41,036 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:37:41,037 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:37:41,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:37:41,039 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:37:41,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:37:41,041 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:37:41,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:37:41,227 WARN L179 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 62 [2018-11-10 05:37:41,558 WARN L179 SmtUtils]: Spent 200.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 39 [2018-11-10 05:37:41,762 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-10 05:37:41,762 INFO L496 LassoAnalysis]: Using template 'affine'. [2018-11-10 05:37:41,762 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:37:41,763 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 05:37:41,763 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 05:37:41,763 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 05:37:41,763 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 05:37:41,763 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 05:37:41,763 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 05:37:41,763 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 05:37:41,764 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 05:37:41,764 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:37:41,764 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 05:37:41,764 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 05:37:41,764 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 05:37:41,765 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 05:37:41,765 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 05:37:41,765 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 05:37:41,765 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 05:37:41,765 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 05:37:41,765 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:37:41,765 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 05:37:41,765 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 05:37:41,766 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 05:37:41,766 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 05:37:41,766 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 05:37:41,766 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 05:37:41,767 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 05:37:41,767 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:37:41,767 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 05:37:41,767 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 05:37:41,767 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 05:37:41,767 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 05:37:41,767 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 05:37:41,767 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 05:37:41,767 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 05:37:41,768 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 05:37:41,768 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:37:41,768 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 05:37:41,768 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 05:37:41,768 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 05:37:41,768 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 05:37:41,768 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 05:37:41,768 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 05:37:41,769 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 05:37:41,769 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 05:37:41,769 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:37:41,769 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 05:37:41,770 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 05:37:41,770 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 05:37:41,770 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 05:37:41,770 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 05:37:41,770 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 05:37:41,772 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 05:37:41,772 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:37:41,772 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 05:37:41,773 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 05:37:41,773 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 05:37:41,773 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 05:37:41,773 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 05:37:41,773 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 05:37:41,773 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 05:37:41,774 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 05:37:41,774 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:37:41,774 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 05:37:41,774 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 05:37:41,774 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 05:37:41,774 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 05:37:41,775 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 05:37:41,775 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 05:37:41,776 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 05:37:41,776 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:37:41,777 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 05:37:41,777 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 05:37:41,777 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 05:37:41,777 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 05:37:41,777 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 05:37:41,777 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 05:37:41,777 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 05:37:41,778 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 05:37:41,778 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:37:41,778 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 05:37:41,778 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 05:37:41,779 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 05:37:41,779 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 05:37:41,779 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 05:37:41,779 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 05:37:41,780 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 05:37:41,781 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:37:41,781 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 05:37:41,781 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 05:37:41,781 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 05:37:41,781 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 05:37:41,782 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 05:37:41,782 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 05:37:41,783 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 05:37:41,783 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:37:41,784 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 05:37:41,784 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 05:37:41,784 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 05:37:41,784 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 05:37:41,785 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 05:37:41,785 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 05:37:41,790 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 05:37:41,790 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 05:37:41,790 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 05:37:41,791 INFO L205 nArgumentSynthesizer]: 12 stem disjuncts [2018-11-10 05:37:41,791 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-10 05:37:41,791 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 05:37:41,796 INFO L402 nArgumentSynthesizer]: We have 60 Motzkin's Theorem applications. [2018-11-10 05:37:41,796 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2018-11-10 05:37:41,825 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 05:37:41,826 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:37:41,826 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 05:37:41,826 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-10 05:37:41,826 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 05:37:41,826 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 05:37:41,827 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-10 05:37:41,828 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 05:37:41,837 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 05:37:41,837 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:37:41,838 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 05:37:41,838 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 05:37:41,838 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 05:37:41,838 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 05:37:41,845 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 05:37:41,845 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 05:37:41,884 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-10 05:37:41,901 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2018-11-10 05:37:41,901 INFO L444 ModelExtractionUtils]: 63 out of 67 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-11-10 05:37:41,902 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-10 05:37:41,902 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-10 05:37:41,902 INFO L517 LassoAnalysis]: Proved termination. [2018-11-10 05:37:41,903 INFO L519 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_main_~nondetString2~0.base)_1, ULTIMATE.start_substring_~pt~0.offset) = 1*v_rep(select #length ULTIMATE.start_main_~nondetString2~0.base)_1 - 1*ULTIMATE.start_substring_~pt~0.offset Supporting invariants [] [2018-11-10 05:37:42,016 INFO L297 tatePredicateManager]: 35 out of 37 supporting invariants were superfluous and have been removed [2018-11-10 05:37:42,018 WARN L1239 BoogieBacktranslator]: unknown boogie variable #length [2018-11-10 05:37:42,032 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 05:37:42,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:37:42,045 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 05:37:42,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:37:42,059 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 05:37:42,070 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:37:42,070 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 2 loop predicates [2018-11-10 05:37:42,070 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 49 states and 54 transitions. cyclomatic complexity: 8 Second operand 5 states. [2018-11-10 05:37:42,104 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 49 states and 54 transitions. cyclomatic complexity: 8. Second operand 5 states. Result 77 states and 83 transitions. Complement of second has 8 states. [2018-11-10 05:37:42,105 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 2 stem states 2 non-accepting loop states 1 accepting loop states [2018-11-10 05:37:42,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-10 05:37:42,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 26 transitions. [2018-11-10 05:37:42,105 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 26 transitions. Stem has 24 letters. Loop has 8 letters. [2018-11-10 05:37:42,106 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 05:37:42,106 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-10 05:37:42,122 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 05:37:42,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:37:42,135 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 05:37:42,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:37:42,154 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 05:37:42,169 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:37:42,169 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.2 stem predicates 2 loop predicates [2018-11-10 05:37:42,170 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 49 states and 54 transitions. cyclomatic complexity: 8 Second operand 5 states. [2018-11-10 05:37:42,217 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 49 states and 54 transitions. cyclomatic complexity: 8. Second operand 5 states. Result 77 states and 83 transitions. Complement of second has 8 states. [2018-11-10 05:37:42,219 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 2 stem states 2 non-accepting loop states 1 accepting loop states [2018-11-10 05:37:42,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-10 05:37:42,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 26 transitions. [2018-11-10 05:37:42,220 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 26 transitions. Stem has 24 letters. Loop has 8 letters. [2018-11-10 05:37:42,220 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 05:37:42,220 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-10 05:37:42,239 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 05:37:42,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:37:42,252 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 05:37:42,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:37:42,274 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 05:37:42,284 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:37:42,285 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.2 stem predicates 2 loop predicates [2018-11-10 05:37:42,285 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 49 states and 54 transitions. cyclomatic complexity: 8 Second operand 5 states. [2018-11-10 05:37:42,312 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 49 states and 54 transitions. cyclomatic complexity: 8. Second operand 5 states. Result 85 states and 92 transitions. Complement of second has 7 states. [2018-11-10 05:37:42,313 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 2 stem states 2 non-accepting loop states 1 accepting loop states [2018-11-10 05:37:42,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-10 05:37:42,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 38 transitions. [2018-11-10 05:37:42,313 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 38 transitions. Stem has 24 letters. Loop has 8 letters. [2018-11-10 05:37:42,313 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 05:37:42,313 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 38 transitions. Stem has 32 letters. Loop has 8 letters. [2018-11-10 05:37:42,314 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 05:37:42,314 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 38 transitions. Stem has 24 letters. Loop has 16 letters. [2018-11-10 05:37:42,314 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 05:37:42,315 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 85 states and 92 transitions. [2018-11-10 05:37:42,317 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-10 05:37:42,317 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 85 states to 0 states and 0 transitions. [2018-11-10 05:37:42,317 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2018-11-10 05:37:42,317 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2018-11-10 05:37:42,317 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2018-11-10 05:37:42,317 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-10 05:37:42,317 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-10 05:37:42,317 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-10 05:37:42,317 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-10 05:37:42,317 INFO L442 BuchiCegarLoop]: ======== Iteration 7============ [2018-11-10 05:37:42,318 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2018-11-10 05:37:42,318 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-10 05:37:42,318 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2018-11-10 05:37:42,322 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 10.11 05:37:42 BoogieIcfgContainer [2018-11-10 05:37:42,322 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-11-10 05:37:42,323 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-10 05:37:42,323 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-10 05:37:42,323 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-10 05:37:42,323 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 05:37:35" (3/4) ... [2018-11-10 05:37:42,325 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-11-10 05:37:42,325 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-10 05:37:42,326 INFO L168 Benchmark]: Toolchain (without parser) took 7109.45 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 234.4 MB). Free memory was 957.6 MB in the beginning and 954.3 MB in the end (delta: 3.3 MB). Peak memory consumption was 237.7 MB. Max. memory is 11.5 GB. [2018-11-10 05:37:42,326 INFO L168 Benchmark]: CDTParser took 0.11 ms. Allocated memory is still 1.0 GB. Free memory is still 985.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-10 05:37:42,327 INFO L168 Benchmark]: CACSL2BoogieTranslator took 273.35 ms. Allocated memory is still 1.0 GB. Free memory was 957.6 MB in the beginning and 936.2 MB in the end (delta: 21.5 MB). Peak memory consumption was 21.5 MB. Max. memory is 11.5 GB. [2018-11-10 05:37:42,327 INFO L168 Benchmark]: Boogie Procedure Inliner took 71.61 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 136.8 MB). Free memory was 936.2 MB in the beginning and 1.1 GB in the end (delta: -197.5 MB). Peak memory consumption was 15.8 MB. Max. memory is 11.5 GB. [2018-11-10 05:37:42,330 INFO L168 Benchmark]: Boogie Preprocessor took 21.51 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2018-11-10 05:37:42,330 INFO L168 Benchmark]: RCFGBuilder took 265.97 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 20.8 MB). Peak memory consumption was 20.8 MB. Max. memory is 11.5 GB. [2018-11-10 05:37:42,330 INFO L168 Benchmark]: BuchiAutomizer took 6471.62 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 97.5 MB). Free memory was 1.1 GB in the beginning and 954.3 MB in the end (delta: 155.9 MB). Peak memory consumption was 253.4 MB. Max. memory is 11.5 GB. [2018-11-10 05:37:42,331 INFO L168 Benchmark]: Witness Printer took 2.72 ms. Allocated memory is still 1.3 GB. Free memory is still 954.3 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-10 05:37:42,333 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.11 ms. Allocated memory is still 1.0 GB. Free memory is still 985.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 273.35 ms. Allocated memory is still 1.0 GB. Free memory was 957.6 MB in the beginning and 936.2 MB in the end (delta: 21.5 MB). Peak memory consumption was 21.5 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 71.61 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 136.8 MB). Free memory was 936.2 MB in the beginning and 1.1 GB in the end (delta: -197.5 MB). Peak memory consumption was 15.8 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 21.51 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 265.97 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 20.8 MB). Peak memory consumption was 20.8 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 6471.62 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 97.5 MB). Free memory was 1.1 GB in the beginning and 954.3 MB in the end (delta: 155.9 MB). Peak memory consumption was 253.4 MB. Max. memory is 11.5 GB. * Witness Printer took 2.72 ms. Allocated memory is still 1.3 GB. Free memory is still 954.3 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 #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 6 terminating modules (3 trivial, 2 deterministic, 1 nondeterministic). One deterministic module has affine ranking function unknown-#length-unknown[__builtin_alloca (length1 * sizeof(char))] + -1 * ps and consists of 5 locations. One deterministic module has affine ranking function unknown-#length-unknown[__builtin_alloca (length1 * sizeof(char))] + -1 * pt and consists of 6 locations. One nondeterministic module has affine ranking function unknown-#length-unknown[nondetString2] + -1 * pt and consists of 5 locations. 3 modules have a trivial ranking function, the largest among these consists of 6 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 6.4s and 7 iterations. TraceHistogramMax:2. Analysis of lassos took 5.6s. Construction of modules took 0.1s. Büchi inclusion checks took 0.5s. Highest rank in rank-based complementation 3. Minimization of det autom 3. Minimization of nondet autom 3. Automata minimization 0.0s AutomataMinimizationTime, 5 MinimizatonAttempts, 8 StatesRemovedByMinimization, 2 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 49 states and ocurred in iteration 5. Nontrivial modules had stage [2, 0, 1, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 174 SDtfs, 200 SDslu, 123 SDs, 0 SdLazy, 133 SolverSat, 27 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.1s Time LassoAnalysisResults: nont0 unkn0 SFLI3 SFLT0 conc0 concLT0 SILN0 SILU0 SILI0 SILT0 lasso3 LassoPreprocessingBenchmarks: Lassos: inital254 mio100 ax107 hnf99 lsp90 ukn104 mio100 lsp37 div100 bol100 ite100 ukn100 eq200 hnf87 smp97 dnf157 smp78 tf100 neg96 sie108 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 35ms VariablesStem: 5 VariablesLoop: 2 DisjunctsStem: 12 DisjunctsLoop: 2 SupportingInvariants: 4 MotzkinApplications: 60 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...