./Ultimate.py --spec /storage/repos/svcomp/c/properties/termination.prp --file /storage/repos/svcomp/c/termination-memory-alloca/substring-alloca_true-termination.c.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 0ed9222f Calling Ultimate with: java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i /storage/repos/svcomp/c/termination-memory-alloca/substring-alloca_true-termination.c.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --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.24-0ed9222-m [2019-01-14 02:36:49,068 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-14 02:36:49,070 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-14 02:36:49,081 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-14 02:36:49,081 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-14 02:36:49,082 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-14 02:36:49,084 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-14 02:36:49,085 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-14 02:36:49,087 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-14 02:36:49,088 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-14 02:36:49,089 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-14 02:36:49,089 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-14 02:36:49,090 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-14 02:36:49,091 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-14 02:36:49,092 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-14 02:36:49,093 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-14 02:36:49,093 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-14 02:36:49,095 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-14 02:36:49,097 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-14 02:36:49,099 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-14 02:36:49,100 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-14 02:36:49,101 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-14 02:36:49,104 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-14 02:36:49,104 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-14 02:36:49,104 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-14 02:36:49,105 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-14 02:36:49,106 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-14 02:36:49,107 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-14 02:36:49,107 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-14 02:36:49,109 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-14 02:36:49,109 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-14 02:36:49,110 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-14 02:36:49,110 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-14 02:36:49,110 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-14 02:36:49,111 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-14 02:36:49,112 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-14 02:36:49,112 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf [2019-01-14 02:36:49,128 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-14 02:36:49,129 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-14 02:36:49,130 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-14 02:36:49,130 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-14 02:36:49,130 INFO L133 SettingsManager]: * Use SBE=true [2019-01-14 02:36:49,130 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-01-14 02:36:49,131 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-01-14 02:36:49,131 INFO L133 SettingsManager]: * Use old map elimination=false [2019-01-14 02:36:49,131 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2019-01-14 02:36:49,131 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2019-01-14 02:36:49,131 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-01-14 02:36:49,131 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-14 02:36:49,132 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-01-14 02:36:49,132 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-14 02:36:49,132 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-14 02:36:49,132 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-01-14 02:36:49,132 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-01-14 02:36:49,132 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-01-14 02:36:49,133 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-14 02:36:49,133 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-01-14 02:36:49,133 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-14 02:36:49,133 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-01-14 02:36:49,133 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-14 02:36:49,133 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-14 02:36:49,134 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-01-14 02:36:49,134 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-14 02:36:49,134 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-14 02:36:49,134 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-01-14 02:36:49,135 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-01-14 02:36:49,135 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 -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux 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 [2019-01-14 02:36:49,188 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-14 02:36:49,204 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-14 02:36:49,208 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-14 02:36:49,210 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-14 02:36:49,210 INFO L276 PluginConnector]: CDTParser initialized [2019-01-14 02:36:49,211 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/termination-memory-alloca/substring-alloca_true-termination.c.i [2019-01-14 02:36:49,273 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7af0d99da/b1865aee808b4a8184d7d220514ec5ce/FLAGc15f5c086 [2019-01-14 02:36:49,715 INFO L307 CDTParser]: Found 1 translation units. [2019-01-14 02:36:49,716 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/termination-memory-alloca/substring-alloca_true-termination.c.i [2019-01-14 02:36:49,733 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7af0d99da/b1865aee808b4a8184d7d220514ec5ce/FLAGc15f5c086 [2019-01-14 02:36:50,054 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7af0d99da/b1865aee808b4a8184d7d220514ec5ce [2019-01-14 02:36:50,058 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-14 02:36:50,059 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-01-14 02:36:50,060 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-14 02:36:50,061 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-14 02:36:50,064 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-14 02:36:50,065 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.01 02:36:50" (1/1) ... [2019-01-14 02:36:50,069 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@784edb78 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:36:50, skipping insertion in model container [2019-01-14 02:36:50,069 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.01 02:36:50" (1/1) ... [2019-01-14 02:36:50,077 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-14 02:36:50,127 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-14 02:36:50,465 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-14 02:36:50,484 INFO L191 MainTranslator]: Completed pre-run [2019-01-14 02:36:50,624 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-14 02:36:50,686 INFO L195 MainTranslator]: Completed translation [2019-01-14 02:36:50,687 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:36:50 WrapperNode [2019-01-14 02:36:50,687 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-14 02:36:50,688 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-14 02:36:50,688 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-14 02:36:50,688 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-14 02:36:50,698 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:36:50" (1/1) ... [2019-01-14 02:36:50,714 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:36:50" (1/1) ... [2019-01-14 02:36:50,744 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-14 02:36:50,744 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-14 02:36:50,744 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-14 02:36:50,744 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-14 02:36:50,754 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:36:50" (1/1) ... [2019-01-14 02:36:50,754 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:36:50" (1/1) ... [2019-01-14 02:36:50,759 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:36:50" (1/1) ... [2019-01-14 02:36:50,759 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:36:50" (1/1) ... [2019-01-14 02:36:50,768 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:36:50" (1/1) ... [2019-01-14 02:36:50,774 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:36:50" (1/1) ... [2019-01-14 02:36:50,778 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:36:50" (1/1) ... [2019-01-14 02:36:50,782 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-14 02:36:50,787 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-14 02:36:50,787 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-14 02:36:50,787 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-14 02:36:50,788 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:36:50" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 02:36:50,842 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-01-14 02:36:50,843 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-01-14 02:36:50,843 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-01-14 02:36:50,843 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-01-14 02:36:50,843 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-14 02:36:50,843 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-14 02:36:51,251 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-14 02:36:51,252 INFO L286 CfgBuilder]: Removed 8 assue(true) statements. [2019-01-14 02:36:51,253 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 02:36:51 BoogieIcfgContainer [2019-01-14 02:36:51,253 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-14 02:36:51,254 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-01-14 02:36:51,254 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-01-14 02:36:51,258 INFO L276 PluginConnector]: BuchiAutomizer initialized [2019-01-14 02:36:51,259 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-14 02:36:51,259 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 14.01 02:36:50" (1/3) ... [2019-01-14 02:36:51,260 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@64f1354 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 14.01 02:36:51, skipping insertion in model container [2019-01-14 02:36:51,260 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-14 02:36:51,260 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:36:50" (2/3) ... [2019-01-14 02:36:51,261 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@64f1354 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 14.01 02:36:51, skipping insertion in model container [2019-01-14 02:36:51,261 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-14 02:36:51,261 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 02:36:51" (3/3) ... [2019-01-14 02:36:51,263 INFO L375 chiAutomizerObserver]: Analyzing ICFG substring-alloca_true-termination.c.i [2019-01-14 02:36:51,317 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-14 02:36:51,318 INFO L374 BuchiCegarLoop]: Interprodecural is true [2019-01-14 02:36:51,318 INFO L375 BuchiCegarLoop]: Hoare is false [2019-01-14 02:36:51,318 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-01-14 02:36:51,319 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-14 02:36:51,319 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-14 02:36:51,319 INFO L379 BuchiCegarLoop]: Difference is false [2019-01-14 02:36:51,319 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-14 02:36:51,319 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-01-14 02:36:51,332 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states. [2019-01-14 02:36:51,353 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2019-01-14 02:36:51,353 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 02:36:51,354 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 02:36:51,361 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2019-01-14 02:36:51,361 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2019-01-14 02:36:51,362 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2019-01-14 02:36:51,362 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states. [2019-01-14 02:36:51,364 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2019-01-14 02:36:51,364 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 02:36:51,364 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 02:36:51,364 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2019-01-14 02:36:51,365 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2019-01-14 02:36:51,373 INFO L794 eck$LassoCheckResult]: Stem: 12#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 11#L-1true 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; 9#L565true assume !(main_~length1~0 < 1); 13#L565-2true assume !(main_~length2~0 < 1); 8#L568-1true call main_#t~malloc13.base, main_#t~malloc13.offset := #Ultimate.allocOnStack(main_~length1~0);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc13.base, main_#t~malloc13.offset;call main_#t~malloc14.base, main_#t~malloc14.offset := #Ultimate.allocOnStack(main_~length2~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc14.base, main_#t~malloc14.offset;call write~int(0, main_~nondetString1~0.base, main_~nondetString1~0.offset + (main_~length1~0 - 1), 1);call write~int(0, main_~nondetString2~0.base, main_~nondetString2~0.offset + (main_~length2~0 - 1), 1);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; 4#L550-3true [2019-01-14 02:36:51,373 INFO L796 eck$LassoCheckResult]: Loop: 4#L550-3true call substring_#t~mem2 := read~int(substring_~ps~0.base, substring_~ps~0.offset, 1); 19#L550-1true assume !!(0 != substring_#t~mem2);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; 3#L553-5true assume !true; 5#L553-6true call substring_#t~mem9 := read~int(substring_~pt~0.base, substring_~pt~0.offset, 1); 6#L557true assume !(0 == substring_#t~mem9);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, 1 + substring_#t~post10.offset;havoc substring_#t~post10.base, substring_#t~post10.offset; 4#L550-3true [2019-01-14 02:36:51,380 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:36:51,380 INFO L82 PathProgramCache]: Analyzing trace with hash 28695878, now seen corresponding path program 1 times [2019-01-14 02:36:51,382 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:36:51,383 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:36:51,444 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:36:51,445 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:36:51,445 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:36:51,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:36:51,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:36:51,580 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:36:51,580 INFO L82 PathProgramCache]: Analyzing trace with hash 47887114, now seen corresponding path program 1 times [2019-01-14 02:36:51,580 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:36:51,581 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:36:51,583 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:36:51,583 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:36:51,583 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:36:51,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:36:51,617 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 02:36:51,620 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 02:36:51,621 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-14 02:36:51,626 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-01-14 02:36:51,643 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-01-14 02:36:51,644 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-01-14 02:36:51,646 INFO L87 Difference]: Start difference. First operand 17 states. Second operand 2 states. [2019-01-14 02:36:51,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 02:36:51,653 INFO L93 Difference]: Finished difference Result 17 states and 22 transitions. [2019-01-14 02:36:51,653 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-01-14 02:36:51,655 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 17 states and 22 transitions. [2019-01-14 02:36:51,657 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2019-01-14 02:36:51,660 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 17 states to 12 states and 16 transitions. [2019-01-14 02:36:51,663 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 12 [2019-01-14 02:36:51,663 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 12 [2019-01-14 02:36:51,665 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 16 transitions. [2019-01-14 02:36:51,665 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-14 02:36:51,665 INFO L706 BuchiCegarLoop]: Abstraction has 12 states and 16 transitions. [2019-01-14 02:36:51,684 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states and 16 transitions. [2019-01-14 02:36:51,695 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2019-01-14 02:36:51,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2019-01-14 02:36:51,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 16 transitions. [2019-01-14 02:36:51,698 INFO L729 BuchiCegarLoop]: Abstraction has 12 states and 16 transitions. [2019-01-14 02:36:51,698 INFO L609 BuchiCegarLoop]: Abstraction has 12 states and 16 transitions. [2019-01-14 02:36:51,698 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2019-01-14 02:36:51,699 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 12 states and 16 transitions. [2019-01-14 02:36:51,699 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2019-01-14 02:36:51,700 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 02:36:51,700 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 02:36:51,700 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2019-01-14 02:36:51,700 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-14 02:36:51,701 INFO L794 eck$LassoCheckResult]: Stem: 48#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 44#L-1 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; 45#L565 assume !(main_~length1~0 < 1); 49#L565-2 assume !(main_~length2~0 < 1); 50#L568-1 call main_#t~malloc13.base, main_#t~malloc13.offset := #Ultimate.allocOnStack(main_~length1~0);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc13.base, main_#t~malloc13.offset;call main_#t~malloc14.base, main_#t~malloc14.offset := #Ultimate.allocOnStack(main_~length2~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc14.base, main_#t~malloc14.offset;call write~int(0, main_~nondetString1~0.base, main_~nondetString1~0.offset + (main_~length1~0 - 1), 1);call write~int(0, main_~nondetString2~0.base, main_~nondetString2~0.offset + (main_~length2~0 - 1), 1);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; 51#L550-3 [2019-01-14 02:36:51,702 INFO L796 eck$LassoCheckResult]: Loop: 51#L550-3 call substring_#t~mem2 := read~int(substring_~ps~0.base, substring_~ps~0.offset, 1); 52#L550-1 assume !!(0 != substring_#t~mem2);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; 42#L553-5 call substring_#t~mem3 := read~int(substring_~pt~0.base, substring_~pt~0.offset, 1);substring_#t~short6 := 0 != substring_#t~mem3; 43#L553-1 assume substring_#t~short6;call substring_#t~mem4 := read~int(substring_~pt~0.base, substring_~pt~0.offset, 1);call substring_#t~mem5 := read~int(substring_~ps2~0.base, substring_~ps2~0.offset, 1);substring_#t~short6 := substring_#t~mem4 == substring_#t~mem5; 53#L553-3 assume !substring_#t~short6;havoc substring_#t~mem3;havoc substring_#t~mem4;havoc substring_#t~mem5;havoc substring_#t~short6; 46#L553-6 call substring_#t~mem9 := read~int(substring_~pt~0.base, substring_~pt~0.offset, 1); 47#L557 assume !(0 == substring_#t~mem9);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, 1 + substring_#t~post10.offset;havoc substring_#t~post10.base, substring_#t~post10.offset; 51#L550-3 [2019-01-14 02:36:51,702 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:36:51,703 INFO L82 PathProgramCache]: Analyzing trace with hash 28695878, now seen corresponding path program 2 times [2019-01-14 02:36:51,703 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:36:51,703 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:36:51,705 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:36:51,705 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:36:51,705 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:36:51,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:36:51,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:36:51,792 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:36:51,796 INFO L82 PathProgramCache]: Analyzing trace with hash -1237496093, now seen corresponding path program 1 times [2019-01-14 02:36:51,796 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:36:51,796 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:36:51,801 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:36:51,802 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 02:36:51,802 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:36:51,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:36:51,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:36:51,860 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:36:51,860 INFO L82 PathProgramCache]: Analyzing trace with hash -1302992386, now seen corresponding path program 1 times [2019-01-14 02:36:51,860 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:36:51,861 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:36:51,863 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:36:51,863 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:36:51,863 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:36:51,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:36:52,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:36:52,698 WARN L181 SmtUtils]: Spent 670.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 60 [2019-01-14 02:36:52,921 WARN L181 SmtUtils]: Spent 180.00 ms on a formula simplification that was a NOOP. DAG size: 47 [2019-01-14 02:36:53,608 WARN L181 SmtUtils]: Spent 684.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 87 [2019-01-14 02:36:53,817 WARN L181 SmtUtils]: Spent 205.00 ms on a formula simplification that was a NOOP. DAG size: 81 [2019-01-14 02:36:53,833 INFO L216 LassoAnalysis]: Preferences: [2019-01-14 02:36:53,834 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-14 02:36:53,835 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-14 02:36:53,835 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-14 02:36:53,835 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-14 02:36:53,835 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 02:36:53,836 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-14 02:36:53,836 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-14 02:36:53,836 INFO L131 ssoRankerPreferences]: Filename of dumped script: substring-alloca_true-termination.c.i_Iteration2_Lasso [2019-01-14 02:36:53,836 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-14 02:36:53,836 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-14 02:36:53,863 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:36:53,875 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:36:54,421 WARN L181 SmtUtils]: Spent 298.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 65 [2019-01-14 02:36:54,632 WARN L181 SmtUtils]: Spent 171.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 52 [2019-01-14 02:36:54,633 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:36:54,636 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:36:54,639 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:36:54,641 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:36:54,644 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:36:54,647 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:36:54,651 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:36:54,653 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:36:54,657 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:36:54,659 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:36:54,662 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:36:54,664 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:36:54,667 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:36:54,671 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:36:54,677 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:36:54,682 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:36:54,686 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:36:54,703 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:36:54,718 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:36:54,721 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:36:54,727 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:36:55,320 WARN L181 SmtUtils]: Spent 173.00 ms on a formula simplification. DAG size of input: 27 DAG size of output: 25 [2019-01-14 02:36:55,782 WARN L181 SmtUtils]: Spent 448.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 40 [2019-01-14 02:36:55,946 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-14 02:36:55,952 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-14 02:36:55,954 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 [2019-01-14 02:36:55,956 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:36:55,956 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:36:55,957 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:36:55,957 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:36:55,957 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:36:55,958 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:36:55,959 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:36:55,960 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:36:55,961 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:36:55,962 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:36:55,962 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:36:55,962 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:36:55,962 INFO L206 nArgumentSynthesizer]: 6 loop disjuncts [2019-01-14 02:36:55,962 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:36:55,967 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2019-01-14 02:36:55,967 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:36:55,986 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:36:55,987 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:36:55,987 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:36:55,988 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:36:55,988 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:36:55,988 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:36:55,990 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:36:55,990 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:36:55,994 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:36:55,994 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 [2019-01-14 02:36:55,995 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:36:55,995 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:36:55,995 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:36:55,995 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:36:55,997 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:36:55,997 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:36:56,001 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:36:56,002 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:36:56,002 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:36:56,003 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:36:56,003 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:36:56,003 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:36:56,003 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:36:56,004 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:36:56,004 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:36:56,006 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:36:56,007 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 [2019-01-14 02:36:56,007 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:36:56,008 INFO L205 nArgumentSynthesizer]: 4 stem disjuncts [2019-01-14 02:36:56,008 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:36:56,008 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:36:56,027 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2019-01-14 02:36:56,027 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:36:56,079 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:36:56,079 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 [2019-01-14 02:36:56,080 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:36:56,081 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:36:56,081 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:36:56,081 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:36:56,085 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:36:56,086 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:36:56,134 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-14 02:36:56,182 INFO L443 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. [2019-01-14 02:36:56,183 INFO L444 ModelExtractionUtils]: 26 out of 31 variables were initially zero. Simplification set additionally 2 variables to zero. [2019-01-14 02:36:56,186 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-14 02:36:56,188 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-01-14 02:36:56,188 INFO L518 LassoAnalysis]: Proved termination. [2019-01-14 02:36:56,190 INFO L520 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 [] [2019-01-14 02:36:56,346 INFO L297 tatePredicateManager]: 8 out of 9 supporting invariants were superfluous and have been removed [2019-01-14 02:36:56,353 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2019-01-14 02:36:56,376 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:36:56,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:36:56,415 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:36:56,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:36:56,447 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:36:56,610 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 02:36:56,614 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2019-01-14 02:36:56,615 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 12 states and 16 transitions. cyclomatic complexity: 5 Second operand 3 states. [2019-01-14 02:36:56,727 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 12 states and 16 transitions. cyclomatic complexity: 5. Second operand 3 states. Result 19 states and 26 transitions. Complement of second has 4 states. [2019-01-14 02:36:56,728 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2019-01-14 02:36:56,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-01-14 02:36:56,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 16 transitions. [2019-01-14 02:36:56,732 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 16 transitions. Stem has 5 letters. Loop has 7 letters. [2019-01-14 02:36:56,733 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:36:56,733 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 16 transitions. Stem has 12 letters. Loop has 7 letters. [2019-01-14 02:36:56,733 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:36:56,734 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 16 transitions. Stem has 5 letters. Loop has 14 letters. [2019-01-14 02:36:56,734 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:36:56,734 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 19 states and 26 transitions. [2019-01-14 02:36:56,735 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-01-14 02:36:56,736 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 19 states to 17 states and 24 transitions. [2019-01-14 02:36:56,736 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9 [2019-01-14 02:36:56,737 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2019-01-14 02:36:56,737 INFO L73 IsDeterministic]: Start isDeterministic. Operand 17 states and 24 transitions. [2019-01-14 02:36:56,737 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-14 02:36:56,737 INFO L706 BuchiCegarLoop]: Abstraction has 17 states and 24 transitions. [2019-01-14 02:36:56,737 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states and 24 transitions. [2019-01-14 02:36:56,738 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2019-01-14 02:36:56,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2019-01-14 02:36:56,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 24 transitions. [2019-01-14 02:36:56,739 INFO L729 BuchiCegarLoop]: Abstraction has 17 states and 24 transitions. [2019-01-14 02:36:56,740 INFO L609 BuchiCegarLoop]: Abstraction has 17 states and 24 transitions. [2019-01-14 02:36:56,740 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2019-01-14 02:36:56,740 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states and 24 transitions. [2019-01-14 02:36:56,741 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-01-14 02:36:56,741 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 02:36:56,741 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 02:36:56,741 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-14 02:36:56,741 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-01-14 02:36:56,742 INFO L794 eck$LassoCheckResult]: Stem: 182#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 174#L-1 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; 175#L565 assume !(main_~length1~0 < 1); 183#L565-2 assume !(main_~length2~0 < 1); 184#L568-1 call main_#t~malloc13.base, main_#t~malloc13.offset := #Ultimate.allocOnStack(main_~length1~0);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc13.base, main_#t~malloc13.offset;call main_#t~malloc14.base, main_#t~malloc14.offset := #Ultimate.allocOnStack(main_~length2~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc14.base, main_#t~malloc14.offset;call write~int(0, main_~nondetString1~0.base, main_~nondetString1~0.offset + (main_~length1~0 - 1), 1);call write~int(0, main_~nondetString2~0.base, main_~nondetString2~0.offset + (main_~length2~0 - 1), 1);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; 178#L550-3 call substring_#t~mem2 := read~int(substring_~ps~0.base, substring_~ps~0.offset, 1); 180#L550-1 assume !!(0 != substring_#t~mem2);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; 170#L553-5 [2019-01-14 02:36:56,742 INFO L796 eck$LassoCheckResult]: Loop: 170#L553-5 call substring_#t~mem3 := read~int(substring_~pt~0.base, substring_~pt~0.offset, 1);substring_#t~short6 := 0 != substring_#t~mem3; 171#L553-1 assume substring_#t~short6;call substring_#t~mem4 := read~int(substring_~pt~0.base, substring_~pt~0.offset, 1);call substring_#t~mem5 := read~int(substring_~ps2~0.base, substring_~ps2~0.offset, 1);substring_#t~short6 := substring_#t~mem4 == substring_#t~mem5; 185#L553-3 assume !!substring_#t~short6;havoc substring_#t~mem3;havoc substring_#t~mem4;havoc substring_#t~mem5;havoc substring_#t~short6;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, 1 + substring_#t~post7.offset;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, 1 + substring_#t~post8.offset;havoc substring_#t~post8.base, substring_#t~post8.offset; 170#L553-5 [2019-01-14 02:36:56,742 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:36:56,742 INFO L82 PathProgramCache]: Analyzing trace with hash 1806935627, now seen corresponding path program 1 times [2019-01-14 02:36:56,742 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:36:56,742 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:36:56,744 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:36:56,744 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:36:56,745 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:36:56,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:36:56,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:36:56,776 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:36:56,776 INFO L82 PathProgramCache]: Analyzing trace with hash 59685, now seen corresponding path program 1 times [2019-01-14 02:36:56,776 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:36:56,776 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:36:56,777 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:36:56,778 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:36:56,778 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:36:56,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:36:56,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:36:56,787 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:36:56,787 INFO L82 PathProgramCache]: Analyzing trace with hash 1594173083, now seen corresponding path program 1 times [2019-01-14 02:36:56,787 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:36:56,787 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:36:56,788 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:36:56,788 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:36:56,788 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:36:56,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:36:56,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:36:57,045 WARN L181 SmtUtils]: Spent 220.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 45 [2019-01-14 02:36:57,530 WARN L181 SmtUtils]: Spent 436.00 ms on a formula simplification. DAG size of input: 119 DAG size of output: 103 [2019-01-14 02:36:57,686 WARN L181 SmtUtils]: Spent 153.00 ms on a formula simplification that was a NOOP. DAG size: 95 [2019-01-14 02:36:57,689 INFO L216 LassoAnalysis]: Preferences: [2019-01-14 02:36:57,689 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-14 02:36:57,689 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-14 02:36:57,689 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-14 02:36:57,689 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-14 02:36:57,689 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 02:36:57,689 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-14 02:36:57,690 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-14 02:36:57,690 INFO L131 ssoRankerPreferences]: Filename of dumped script: substring-alloca_true-termination.c.i_Iteration3_Lasso [2019-01-14 02:36:57,690 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-14 02:36:57,690 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-14 02:36:57,697 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:36:57,704 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:36:57,706 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:36:57,708 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:36:57,711 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:36:57,713 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:36:57,715 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:36:57,718 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:36:57,721 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:36:57,724 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:36:57,728 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:36:57,730 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:36:57,735 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:36:57,737 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:36:57,740 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:36:57,742 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:36:57,745 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:36:57,747 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:36:57,750 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:36:57,751 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:36:57,754 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:36:58,272 WARN L181 SmtUtils]: Spent 305.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 85 [2019-01-14 02:36:58,476 WARN L181 SmtUtils]: Spent 166.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 60 [2019-01-14 02:36:58,476 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:36:58,479 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:36:58,481 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:36:58,783 WARN L181 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 41 DAG size of output: 37 [2019-01-14 02:36:59,976 WARN L181 SmtUtils]: Spent 655.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 46 [2019-01-14 02:37:00,017 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-14 02:37:00,017 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-14 02:37:00,018 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 [2019-01-14 02:37:00,020 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:37:00,020 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:37:00,020 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:37:00,020 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:37:00,020 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:37:00,021 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:37:00,021 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:37:00,023 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:37:00,024 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 [2019-01-14 02:37:00,025 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:37:00,026 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:37:00,026 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:37:00,026 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:37:00,026 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:37:00,027 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:37:00,027 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:37:00,027 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:37:00,029 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:37:00,030 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:37:00,030 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:37:00,030 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:37:00,030 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:37:00,033 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:37:00,034 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:37:00,035 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:37:00,036 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 [2019-01-14 02:37:00,036 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:37:00,037 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:37:00,039 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:37:00,039 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:37:00,039 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:37:00,039 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:37:00,039 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:37:00,041 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:37:00,042 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 [2019-01-14 02:37:00,042 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:37:00,042 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:37:00,043 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:37:00,045 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:37:00,045 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:37:00,045 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:37:00,045 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:37:00,047 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:37:00,047 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 [2019-01-14 02:37:00,048 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:37:00,048 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:37:00,048 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:37:00,048 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:37:00,049 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:37:00,051 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:37:00,051 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:37:00,053 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:37:00,053 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 [2019-01-14 02:37:00,053 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:37:00,054 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:37:00,055 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:37:00,056 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:37:00,056 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:37:00,056 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:37:00,056 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:37:00,058 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:37:00,059 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 [2019-01-14 02:37:00,059 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:37:00,059 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:37:00,060 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:37:00,062 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:37:00,062 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:37:00,062 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:37:00,062 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:37:00,064 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:37:00,064 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 [2019-01-14 02:37:00,066 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:37:00,066 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:37:00,066 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:37:00,066 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:37:00,068 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:37:00,068 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:37:00,071 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:37:00,072 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 [2019-01-14 02:37:00,072 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:37:00,073 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:37:00,073 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:37:00,073 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:37:00,073 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:37:00,073 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:37:00,073 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:37:00,074 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:37:00,074 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 [2019-01-14 02:37:00,079 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:37:00,079 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:37:00,079 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:37:00,079 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:37:00,080 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:37:00,081 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:37:00,081 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:37:00,082 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:37:00,082 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 [2019-01-14 02:37:00,082 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:37:00,082 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:37:00,085 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:37:00,085 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:37:00,087 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:37:00,087 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:37:00,088 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:37:00,089 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 [2019-01-14 02:37:00,089 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:37:00,089 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:37:00,090 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:37:00,090 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:37:00,092 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:37:00,093 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:37:00,093 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:37:00,093 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:37:00,094 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 [2019-01-14 02:37:00,094 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:37:00,094 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:37:00,095 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:37:00,097 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:37:00,098 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:37:00,099 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:37:00,101 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:37:00,101 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 [2019-01-14 02:37:00,102 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:37:00,102 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:37:00,102 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:37:00,102 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:37:00,102 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:37:00,102 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:37:00,103 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:37:00,106 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:37:00,107 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:37:00,107 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:37:00,107 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:37:00,107 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:37:00,107 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:37:00,108 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:37:00,111 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:37:00,111 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:37:00,112 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:37:00,113 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 [2019-01-14 02:37:00,113 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:37:00,113 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:37:00,113 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:37:00,114 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:37:00,114 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:37:00,114 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:37:00,114 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:37:00,117 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:37:00,118 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 [2019-01-14 02:37:00,118 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:37:00,118 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:37:00,118 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:37:00,119 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:37:00,119 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:37:00,119 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:37:00,119 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:37:00,122 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:37:00,123 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:37:00,123 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:37:00,123 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:37:00,124 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:37:00,124 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:37:00,124 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:37:00,124 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:37:00,124 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:37:00,128 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:37:00,128 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:37:00,129 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:37:00,129 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:37:00,129 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:37:00,129 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:37:00,130 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:37:00,130 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:37:00,135 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:37:00,135 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 [2019-01-14 02:37:00,136 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:37:00,136 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:37:00,136 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:37:00,136 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:37:00,139 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:37:00,139 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:37:00,141 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:37:00,141 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:37:00,142 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:37:00,144 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:37:00,144 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:37:00,144 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:37:00,148 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:37:00,148 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:37:00,173 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-14 02:37:00,190 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2019-01-14 02:37:00,190 INFO L444 ModelExtractionUtils]: 39 out of 43 variables were initially zero. Simplification set additionally 1 variables to zero. [2019-01-14 02:37:00,190 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-14 02:37:00,191 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-01-14 02:37:00,191 INFO L518 LassoAnalysis]: Proved termination. [2019-01-14 02:37:00,192 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_substring_~pt~0.base)_2, ULTIMATE.start_substring_~pt~0.offset) = 1*v_rep(select #length ULTIMATE.start_substring_~pt~0.base)_2 - 1*ULTIMATE.start_substring_~pt~0.offset Supporting invariants [] [2019-01-14 02:37:00,469 INFO L297 tatePredicateManager]: 23 out of 23 supporting invariants were superfluous and have been removed [2019-01-14 02:37:00,471 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2019-01-14 02:37:00,482 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:37:00,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:37:00,503 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:37:00,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:37:00,515 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:37:00,554 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 02:37:00,555 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2019-01-14 02:37:00,555 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 17 states and 24 transitions. cyclomatic complexity: 9 Second operand 3 states. [2019-01-14 02:37:00,652 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 17 states and 24 transitions. cyclomatic complexity: 9. Second operand 3 states. Result 40 states and 54 transitions. Complement of second has 5 states. [2019-01-14 02:37:00,654 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2019-01-14 02:37:00,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-01-14 02:37:00,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 17 transitions. [2019-01-14 02:37:00,655 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 17 transitions. Stem has 7 letters. Loop has 3 letters. [2019-01-14 02:37:00,655 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:37:00,655 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 17 transitions. Stem has 10 letters. Loop has 3 letters. [2019-01-14 02:37:00,655 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:37:00,655 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 17 transitions. Stem has 7 letters. Loop has 6 letters. [2019-01-14 02:37:00,656 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:37:00,656 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 40 states and 54 transitions. [2019-01-14 02:37:00,658 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-01-14 02:37:00,659 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 40 states to 28 states and 38 transitions. [2019-01-14 02:37:00,659 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2019-01-14 02:37:00,659 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2019-01-14 02:37:00,659 INFO L73 IsDeterministic]: Start isDeterministic. Operand 28 states and 38 transitions. [2019-01-14 02:37:00,660 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-14 02:37:00,662 INFO L706 BuchiCegarLoop]: Abstraction has 28 states and 38 transitions. [2019-01-14 02:37:00,662 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states and 38 transitions. [2019-01-14 02:37:00,664 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 23. [2019-01-14 02:37:00,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2019-01-14 02:37:00,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 32 transitions. [2019-01-14 02:37:00,665 INFO L729 BuchiCegarLoop]: Abstraction has 23 states and 32 transitions. [2019-01-14 02:37:00,665 INFO L609 BuchiCegarLoop]: Abstraction has 23 states and 32 transitions. [2019-01-14 02:37:00,665 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2019-01-14 02:37:00,665 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 23 states and 32 transitions. [2019-01-14 02:37:00,667 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-01-14 02:37:00,668 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 02:37:00,668 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 02:37:00,669 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 02:37:00,669 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-01-14 02:37:00,669 INFO L794 eck$LassoCheckResult]: Stem: 376#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 370#L-1 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; 371#L565 assume !(main_~length1~0 < 1); 377#L565-2 assume !(main_~length2~0 < 1); 378#L568-1 call main_#t~malloc13.base, main_#t~malloc13.offset := #Ultimate.allocOnStack(main_~length1~0);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc13.base, main_#t~malloc13.offset;call main_#t~malloc14.base, main_#t~malloc14.offset := #Ultimate.allocOnStack(main_~length2~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc14.base, main_#t~malloc14.offset;call write~int(0, main_~nondetString1~0.base, main_~nondetString1~0.offset + (main_~length1~0 - 1), 1);call write~int(0, main_~nondetString2~0.base, main_~nondetString2~0.offset + (main_~length2~0 - 1), 1);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; 379#L550-3 call substring_#t~mem2 := read~int(substring_~ps~0.base, substring_~ps~0.offset, 1); 380#L550-1 assume !!(0 != substring_#t~mem2);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; 389#L553-5 call substring_#t~mem3 := read~int(substring_~pt~0.base, substring_~pt~0.offset, 1);substring_#t~short6 := 0 != substring_#t~mem3; 391#L553-1 assume !substring_#t~short6; 390#L553-3 assume !substring_#t~short6;havoc substring_#t~mem3;havoc substring_#t~mem4;havoc substring_#t~mem5;havoc substring_#t~short6; 384#L553-6 call substring_#t~mem9 := read~int(substring_~pt~0.base, substring_~pt~0.offset, 1); 385#L557 assume !(0 == substring_#t~mem9);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, 1 + substring_#t~post10.offset;havoc substring_#t~post10.base, substring_#t~post10.offset; 381#L550-3 call substring_#t~mem2 := read~int(substring_~ps~0.base, substring_~ps~0.offset, 1); 383#L550-1 assume !!(0 != substring_#t~mem2);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; 372#L553-5 [2019-01-14 02:37:00,669 INFO L796 eck$LassoCheckResult]: Loop: 372#L553-5 call substring_#t~mem3 := read~int(substring_~pt~0.base, substring_~pt~0.offset, 1);substring_#t~short6 := 0 != substring_#t~mem3; 373#L553-1 assume substring_#t~short6;call substring_#t~mem4 := read~int(substring_~pt~0.base, substring_~pt~0.offset, 1);call substring_#t~mem5 := read~int(substring_~ps2~0.base, substring_~ps2~0.offset, 1);substring_#t~short6 := substring_#t~mem4 == substring_#t~mem5; 386#L553-3 assume !!substring_#t~short6;havoc substring_#t~mem3;havoc substring_#t~mem4;havoc substring_#t~mem5;havoc substring_#t~short6;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, 1 + substring_#t~post7.offset;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, 1 + substring_#t~post8.offset;havoc substring_#t~post8.base, substring_#t~post8.offset; 372#L553-5 [2019-01-14 02:37:00,669 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:37:00,669 INFO L82 PathProgramCache]: Analyzing trace with hash 2012026433, now seen corresponding path program 1 times [2019-01-14 02:37:00,670 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:37:00,670 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:37:00,671 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:37:00,671 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:37:00,671 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:37:00,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:37:00,788 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 02:37:00,789 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 02:37:00,789 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-14 02:37:00,789 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-01-14 02:37:00,790 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:37:00,790 INFO L82 PathProgramCache]: Analyzing trace with hash 59685, now seen corresponding path program 2 times [2019-01-14 02:37:00,790 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:37:00,790 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:37:00,792 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:37:00,792 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:37:00,792 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:37:00,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:37:00,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:37:00,943 WARN L181 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 45 [2019-01-14 02:37:00,972 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-14 02:37:00,973 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-01-14 02:37:00,973 INFO L87 Difference]: Start difference. First operand 23 states and 32 transitions. cyclomatic complexity: 12 Second operand 5 states. [2019-01-14 02:37:01,030 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 02:37:01,031 INFO L93 Difference]: Finished difference Result 29 states and 38 transitions. [2019-01-14 02:37:01,031 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-14 02:37:01,032 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 29 states and 38 transitions. [2019-01-14 02:37:01,034 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2019-01-14 02:37:01,035 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 29 states to 26 states and 34 transitions. [2019-01-14 02:37:01,035 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2019-01-14 02:37:01,035 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2019-01-14 02:37:01,035 INFO L73 IsDeterministic]: Start isDeterministic. Operand 26 states and 34 transitions. [2019-01-14 02:37:01,035 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-14 02:37:01,036 INFO L706 BuchiCegarLoop]: Abstraction has 26 states and 34 transitions. [2019-01-14 02:37:01,036 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states and 34 transitions. [2019-01-14 02:37:01,040 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 24. [2019-01-14 02:37:01,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2019-01-14 02:37:01,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 32 transitions. [2019-01-14 02:37:01,041 INFO L729 BuchiCegarLoop]: Abstraction has 24 states and 32 transitions. [2019-01-14 02:37:01,041 INFO L609 BuchiCegarLoop]: Abstraction has 24 states and 32 transitions. [2019-01-14 02:37:01,041 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2019-01-14 02:37:01,041 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 24 states and 32 transitions. [2019-01-14 02:37:01,044 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-01-14 02:37:01,044 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 02:37:01,044 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 02:37:01,044 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 02:37:01,045 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-01-14 02:37:01,045 INFO L794 eck$LassoCheckResult]: Stem: 438#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 432#L-1 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; 433#L565 assume !(main_~length1~0 < 1); 439#L565-2 assume !(main_~length2~0 < 1); 440#L568-1 call main_#t~malloc13.base, main_#t~malloc13.offset := #Ultimate.allocOnStack(main_~length1~0);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc13.base, main_#t~malloc13.offset;call main_#t~malloc14.base, main_#t~malloc14.offset := #Ultimate.allocOnStack(main_~length2~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc14.base, main_#t~malloc14.offset;call write~int(0, main_~nondetString1~0.base, main_~nondetString1~0.offset + (main_~length1~0 - 1), 1);call write~int(0, main_~nondetString2~0.base, main_~nondetString2~0.offset + (main_~length2~0 - 1), 1);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; 441#L550-3 call substring_#t~mem2 := read~int(substring_~ps~0.base, substring_~ps~0.offset, 1); 442#L550-1 assume !!(0 != substring_#t~mem2);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; 451#L553-5 call substring_#t~mem3 := read~int(substring_~pt~0.base, substring_~pt~0.offset, 1);substring_#t~short6 := 0 != substring_#t~mem3; 453#L553-1 assume substring_#t~short6;call substring_#t~mem4 := read~int(substring_~pt~0.base, substring_~pt~0.offset, 1);call substring_#t~mem5 := read~int(substring_~ps2~0.base, substring_~ps2~0.offset, 1);substring_#t~short6 := substring_#t~mem4 == substring_#t~mem5; 452#L553-3 assume !substring_#t~short6;havoc substring_#t~mem3;havoc substring_#t~mem4;havoc substring_#t~mem5;havoc substring_#t~short6; 446#L553-6 call substring_#t~mem9 := read~int(substring_~pt~0.base, substring_~pt~0.offset, 1); 447#L557 assume !(0 == substring_#t~mem9);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, 1 + substring_#t~post10.offset;havoc substring_#t~post10.base, substring_#t~post10.offset; 443#L550-3 call substring_#t~mem2 := read~int(substring_~ps~0.base, substring_~ps~0.offset, 1); 445#L550-1 assume !!(0 != substring_#t~mem2);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; 434#L553-5 [2019-01-14 02:37:01,045 INFO L796 eck$LassoCheckResult]: Loop: 434#L553-5 call substring_#t~mem3 := read~int(substring_~pt~0.base, substring_~pt~0.offset, 1);substring_#t~short6 := 0 != substring_#t~mem3; 435#L553-1 assume substring_#t~short6;call substring_#t~mem4 := read~int(substring_~pt~0.base, substring_~pt~0.offset, 1);call substring_#t~mem5 := read~int(substring_~ps2~0.base, substring_~ps2~0.offset, 1);substring_#t~short6 := substring_#t~mem4 == substring_#t~mem5; 448#L553-3 assume !!substring_#t~short6;havoc substring_#t~mem3;havoc substring_#t~mem4;havoc substring_#t~mem5;havoc substring_#t~short6;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, 1 + substring_#t~post7.offset;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, 1 + substring_#t~post8.offset;havoc substring_#t~post8.base, substring_#t~post8.offset; 434#L553-5 [2019-01-14 02:37:01,045 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:37:01,045 INFO L82 PathProgramCache]: Analyzing trace with hash 1954768131, now seen corresponding path program 2 times [2019-01-14 02:37:01,045 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:37:01,046 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:37:01,046 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:37:01,046 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 02:37:01,047 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:37:01,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:37:01,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:37:01,073 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:37:01,074 INFO L82 PathProgramCache]: Analyzing trace with hash 59685, now seen corresponding path program 3 times [2019-01-14 02:37:01,074 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:37:01,074 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:37:01,075 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:37:01,075 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 02:37:01,075 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:37:01,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:37:01,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:37:01,085 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:37:01,086 INFO L82 PathProgramCache]: Analyzing trace with hash -964145949, now seen corresponding path program 1 times [2019-01-14 02:37:01,086 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:37:01,086 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:37:01,087 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:37:01,087 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 02:37:01,087 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:37:01,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:37:01,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:37:01,331 WARN L181 SmtUtils]: Spent 209.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 45 [2019-01-14 02:37:02,028 WARN L181 SmtUtils]: Spent 666.00 ms on a formula simplification. DAG size of input: 183 DAG size of output: 146 [2019-01-14 02:37:02,224 WARN L181 SmtUtils]: Spent 190.00 ms on a formula simplification that was a NOOP. DAG size: 111 [2019-01-14 02:37:02,226 INFO L216 LassoAnalysis]: Preferences: [2019-01-14 02:37:02,227 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-14 02:37:02,227 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-14 02:37:02,227 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-14 02:37:02,227 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-14 02:37:02,227 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 02:37:02,227 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-14 02:37:02,227 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-14 02:37:02,227 INFO L131 ssoRankerPreferences]: Filename of dumped script: substring-alloca_true-termination.c.i_Iteration5_Lasso [2019-01-14 02:37:02,228 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-14 02:37:02,228 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-14 02:37:02,232 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:37:02,237 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:37:02,239 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:37:02,241 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:37:02,243 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:37:02,247 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:37:02,255 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:37:02,257 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:37:02,258 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:37:02,261 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:37:02,263 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:37:02,265 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:37:02,267 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:37:02,268 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:37:02,977 WARN L181 SmtUtils]: Spent 362.00 ms on a formula simplification. DAG size of input: 119 DAG size of output: 99 [2019-01-14 02:37:03,241 WARN L181 SmtUtils]: Spent 216.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 71 [2019-01-14 02:37:03,242 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:37:03,244 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:37:03,246 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:37:03,251 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:37:03,253 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:37:03,255 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:37:03,256 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:37:03,257 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:37:03,259 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:37:03,261 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:37:03,262 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:37:03,685 WARN L181 SmtUtils]: Spent 178.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 55 [2019-01-14 02:37:04,327 WARN L181 SmtUtils]: Spent 517.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 39 [2019-01-14 02:37:04,942 WARN L181 SmtUtils]: Spent 592.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 46 [2019-01-14 02:37:05,185 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-14 02:37:05,186 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-14 02:37:05,186 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 [2019-01-14 02:37:05,187 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:37:05,187 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:37:05,187 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:37:05,187 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:37:05,191 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:37:05,191 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:37:05,192 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:37:05,194 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:37:05,194 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:37:05,194 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:37:05,194 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:37:05,194 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:37:05,195 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:37:05,195 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:37:05,195 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:37:05,195 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:37:05,200 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 [2019-01-14 02:37:05,200 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:37:05,200 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:37:05,201 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:37:05,201 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:37:05,201 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:37:05,201 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:37:05,201 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:37:05,202 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:37:05,202 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 [2019-01-14 02:37:05,203 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:37:05,203 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:37:05,203 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:37:05,203 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:37:05,203 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:37:05,203 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:37:05,203 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:37:05,204 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:37:05,204 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 [2019-01-14 02:37:05,205 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:37:05,205 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:37:05,205 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:37:05,205 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:37:05,205 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:37:05,205 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:37:05,205 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:37:05,206 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:37:05,206 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 [2019-01-14 02:37:05,207 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:37:05,207 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:37:05,207 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:37:05,207 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:37:05,207 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:37:05,207 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:37:05,207 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:37:05,208 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:37:05,208 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 [2019-01-14 02:37:05,208 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:37:05,209 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:37:05,209 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:37:05,209 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:37:05,210 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:37:05,210 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:37:05,211 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:37:05,211 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 [2019-01-14 02:37:05,211 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:37:05,212 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:37:05,212 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:37:05,212 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:37:05,212 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:37:05,212 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:37:05,212 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:37:05,213 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:37:05,213 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 [2019-01-14 02:37:05,213 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:37:05,214 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:37:05,214 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:37:05,214 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:37:05,214 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:37:05,214 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:37:05,216 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:37:05,216 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 [2019-01-14 02:37:05,217 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:37:05,217 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:37:05,217 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:37:05,217 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:37:05,217 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:37:05,217 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:37:05,218 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:37:05,218 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:37:05,218 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 [2019-01-14 02:37:05,219 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:37:05,219 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:37:05,219 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:37:05,219 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:37:05,220 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:37:05,220 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:37:05,221 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:37:05,221 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 [2019-01-14 02:37:05,221 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:37:05,222 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:37:05,222 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:37:05,222 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:37:05,222 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:37:05,222 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:37:05,222 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:37:05,223 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:37:05,223 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 [2019-01-14 02:37:05,224 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:37:05,224 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:37:05,224 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:37:05,224 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:37:05,224 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:37:05,224 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:37:05,224 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:37:05,225 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:37:05,225 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 [2019-01-14 02:37:05,225 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:37:05,226 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:37:05,226 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:37:05,226 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:37:05,227 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:37:05,227 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:37:05,230 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:37:05,231 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 [2019-01-14 02:37:05,231 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:37:05,231 INFO L205 nArgumentSynthesizer]: 12 stem disjuncts [2019-01-14 02:37:05,232 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2019-01-14 02:37:05,232 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:37:05,238 INFO L402 nArgumentSynthesizer]: We have 60 Motzkin's Theorem applications. [2019-01-14 02:37:05,239 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2019-01-14 02:37:05,287 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:37:05,288 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 [2019-01-14 02:37:05,289 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:37:05,289 INFO L205 nArgumentSynthesizer]: 4 stem disjuncts [2019-01-14 02:37:05,289 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:37:05,289 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:37:05,293 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2019-01-14 02:37:05,293 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:37:05,322 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:37:05,324 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 [2019-01-14 02:37:05,327 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:37:05,327 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:37:05,327 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:37:05,327 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:37:05,328 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:37:05,328 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:37:05,357 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:37:05,358 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 [2019-01-14 02:37:05,359 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:37:05,359 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:37:05,359 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:37:05,359 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:37:05,360 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:37:05,360 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:37:05,361 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:37:05,362 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 [2019-01-14 02:37:05,362 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:37:05,362 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:37:05,363 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:37:05,364 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:37:05,364 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:37:05,364 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:37:05,368 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:37:05,368 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 [2019-01-14 02:37:05,369 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:37:05,369 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:37:05,369 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:37:05,369 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:37:05,370 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:37:05,370 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:37:05,376 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:37:05,377 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 [2019-01-14 02:37:05,377 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:37:05,378 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:37:05,378 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:37:05,378 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:37:05,388 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:37:05,388 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:37:05,451 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-14 02:37:05,517 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2019-01-14 02:37:05,518 INFO L444 ModelExtractionUtils]: 52 out of 58 variables were initially zero. Simplification set additionally 3 variables to zero. [2019-01-14 02:37:05,518 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-14 02:37:05,519 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-01-14 02:37:05,519 INFO L518 LassoAnalysis]: Proved termination. [2019-01-14 02:37:05,519 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_main_~nondetString1~0.base)_2, ULTIMATE.start_substring_~ps2~0.offset) = 1*v_rep(select #length ULTIMATE.start_main_~nondetString1~0.base)_2 - 1*ULTIMATE.start_substring_~ps2~0.offset Supporting invariants [] [2019-01-14 02:37:06,508 INFO L297 tatePredicateManager]: 43 out of 45 supporting invariants were superfluous and have been removed [2019-01-14 02:37:06,512 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2019-01-14 02:37:06,533 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:37:06,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:37:06,556 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:37:06,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:37:06,601 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:37:06,626 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 02:37:06,627 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 [2019-01-14 02:37:06,627 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 24 states and 32 transitions. cyclomatic complexity: 11 Second operand 5 states. [2019-01-14 02:37:06,719 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 24 states and 32 transitions. cyclomatic complexity: 11. Second operand 5 states. Result 42 states and 54 transitions. Complement of second has 8 states. [2019-01-14 02:37:06,721 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 [2019-01-14 02:37:06,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2019-01-14 02:37:06,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 19 transitions. [2019-01-14 02:37:06,722 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 19 transitions. Stem has 14 letters. Loop has 3 letters. [2019-01-14 02:37:06,722 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:37:06,722 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-01-14 02:37:06,747 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:37:06,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:37:06,770 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:37:06,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:37:06,790 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:37:06,824 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 02:37:06,825 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 [2019-01-14 02:37:06,825 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 24 states and 32 transitions. cyclomatic complexity: 11 Second operand 5 states. [2019-01-14 02:37:06,878 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 24 states and 32 transitions. cyclomatic complexity: 11. Second operand 5 states. Result 42 states and 54 transitions. Complement of second has 8 states. [2019-01-14 02:37:06,880 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 [2019-01-14 02:37:06,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2019-01-14 02:37:06,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 19 transitions. [2019-01-14 02:37:06,881 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 19 transitions. Stem has 14 letters. Loop has 3 letters. [2019-01-14 02:37:06,881 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:37:06,881 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-01-14 02:37:06,899 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:37:06,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:37:06,924 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:37:06,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:37:06,949 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:37:06,967 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 02:37:06,967 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 [2019-01-14 02:37:06,967 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 24 states and 32 transitions. cyclomatic complexity: 11 Second operand 5 states. [2019-01-14 02:37:07,025 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 24 states and 32 transitions. cyclomatic complexity: 11. Second operand 5 states. Result 50 states and 66 transitions. Complement of second has 7 states. [2019-01-14 02:37:07,027 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 [2019-01-14 02:37:07,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2019-01-14 02:37:07,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 27 transitions. [2019-01-14 02:37:07,028 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 27 transitions. Stem has 14 letters. Loop has 3 letters. [2019-01-14 02:37:07,028 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:37:07,029 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 27 transitions. Stem has 17 letters. Loop has 3 letters. [2019-01-14 02:37:07,030 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:37:07,030 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 27 transitions. Stem has 14 letters. Loop has 6 letters. [2019-01-14 02:37:07,031 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:37:07,031 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 50 states and 66 transitions. [2019-01-14 02:37:07,033 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-01-14 02:37:07,035 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 50 states to 41 states and 54 transitions. [2019-01-14 02:37:07,035 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2019-01-14 02:37:07,036 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 12 [2019-01-14 02:37:07,036 INFO L73 IsDeterministic]: Start isDeterministic. Operand 41 states and 54 transitions. [2019-01-14 02:37:07,036 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-14 02:37:07,036 INFO L706 BuchiCegarLoop]: Abstraction has 41 states and 54 transitions. [2019-01-14 02:37:07,036 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states and 54 transitions. [2019-01-14 02:37:07,040 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 39. [2019-01-14 02:37:07,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2019-01-14 02:37:07,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 52 transitions. [2019-01-14 02:37:07,041 INFO L729 BuchiCegarLoop]: Abstraction has 39 states and 52 transitions. [2019-01-14 02:37:07,041 INFO L609 BuchiCegarLoop]: Abstraction has 39 states and 52 transitions. [2019-01-14 02:37:07,041 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2019-01-14 02:37:07,041 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 39 states and 52 transitions. [2019-01-14 02:37:07,043 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-01-14 02:37:07,043 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 02:37:07,043 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 02:37:07,044 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 02:37:07,044 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-01-14 02:37:07,044 INFO L794 eck$LassoCheckResult]: Stem: 988#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 986#L-1 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; 987#L565 assume !(main_~length1~0 < 1); 989#L565-2 assume !(main_~length2~0 < 1); 990#L568-1 call main_#t~malloc13.base, main_#t~malloc13.offset := #Ultimate.allocOnStack(main_~length1~0);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc13.base, main_#t~malloc13.offset;call main_#t~malloc14.base, main_#t~malloc14.offset := #Ultimate.allocOnStack(main_~length2~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc14.base, main_#t~malloc14.offset;call write~int(0, main_~nondetString1~0.base, main_~nondetString1~0.offset + (main_~length1~0 - 1), 1);call write~int(0, main_~nondetString2~0.base, main_~nondetString2~0.offset + (main_~length2~0 - 1), 1);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; 991#L550-3 call substring_#t~mem2 := read~int(substring_~ps~0.base, substring_~ps~0.offset, 1); 992#L550-1 assume !!(0 != substring_#t~mem2);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; 1018#L553-5 call substring_#t~mem3 := read~int(substring_~pt~0.base, substring_~pt~0.offset, 1);substring_#t~short6 := 0 != substring_#t~mem3; 1005#L553-1 assume substring_#t~short6;call substring_#t~mem4 := read~int(substring_~pt~0.base, substring_~pt~0.offset, 1);call substring_#t~mem5 := read~int(substring_~ps2~0.base, substring_~ps2~0.offset, 1);substring_#t~short6 := substring_#t~mem4 == substring_#t~mem5; 1004#L553-3 assume !substring_#t~short6;havoc substring_#t~mem3;havoc substring_#t~mem4;havoc substring_#t~mem5;havoc substring_#t~short6; 996#L553-6 call substring_#t~mem9 := read~int(substring_~pt~0.base, substring_~pt~0.offset, 1); 997#L557 assume !(0 == substring_#t~mem9);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, 1 + substring_#t~post10.offset;havoc substring_#t~post10.base, substring_#t~post10.offset; 993#L550-3 call substring_#t~mem2 := read~int(substring_~ps~0.base, substring_~ps~0.offset, 1); 995#L550-1 assume !!(0 != substring_#t~mem2);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; 1003#L553-5 call substring_#t~mem3 := read~int(substring_~pt~0.base, substring_~pt~0.offset, 1);substring_#t~short6 := 0 != substring_#t~mem3; 983#L553-1 [2019-01-14 02:37:07,044 INFO L796 eck$LassoCheckResult]: Loop: 983#L553-1 assume !substring_#t~short6; 998#L553-3 assume !!substring_#t~short6;havoc substring_#t~mem3;havoc substring_#t~mem4;havoc substring_#t~mem5;havoc substring_#t~short6;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, 1 + substring_#t~post7.offset;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, 1 + substring_#t~post8.offset;havoc substring_#t~post8.base, substring_#t~post8.offset; 982#L553-5 call substring_#t~mem3 := read~int(substring_~pt~0.base, substring_~pt~0.offset, 1);substring_#t~short6 := 0 != substring_#t~mem3; 983#L553-1 [2019-01-14 02:37:07,045 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:37:07,047 INFO L82 PathProgramCache]: Analyzing trace with hash 468269947, now seen corresponding path program 3 times [2019-01-14 02:37:07,047 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:37:07,047 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:37:07,048 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:37:07,049 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:37:07,049 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:37:07,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:37:07,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:37:07,083 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:37:07,085 INFO L82 PathProgramCache]: Analyzing trace with hash 64727, now seen corresponding path program 1 times [2019-01-14 02:37:07,085 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:37:07,085 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:37:07,087 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:37:07,089 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 02:37:07,089 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:37:07,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:37:07,132 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 02:37:07,133 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 02:37:07,133 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-14 02:37:07,133 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-01-14 02:37:07,133 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 02:37:07,133 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 02:37:07,133 INFO L87 Difference]: Start difference. First operand 39 states and 52 transitions. cyclomatic complexity: 18 Second operand 3 states. [2019-01-14 02:37:07,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 02:37:07,150 INFO L93 Difference]: Finished difference Result 33 states and 39 transitions. [2019-01-14 02:37:07,152 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-14 02:37:07,152 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 33 states and 39 transitions. [2019-01-14 02:37:07,153 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-01-14 02:37:07,153 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 33 states to 0 states and 0 transitions. [2019-01-14 02:37:07,154 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2019-01-14 02:37:07,154 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2019-01-14 02:37:07,154 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2019-01-14 02:37:07,154 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-14 02:37:07,154 INFO L706 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-14 02:37:07,154 INFO L729 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-14 02:37:07,154 INFO L609 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-14 02:37:07,154 INFO L442 BuchiCegarLoop]: ======== Iteration 7============ [2019-01-14 02:37:07,154 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2019-01-14 02:37:07,154 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-01-14 02:37:07,155 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2019-01-14 02:37:07,163 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 14.01 02:37:07 BoogieIcfgContainer [2019-01-14 02:37:07,164 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2019-01-14 02:37:07,164 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-14 02:37:07,164 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-14 02:37:07,164 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-14 02:37:07,165 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 02:36:51" (3/4) ... [2019-01-14 02:37:07,172 INFO L147 WitnessPrinter]: No result that supports witness generation found [2019-01-14 02:37:07,172 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-14 02:37:07,173 INFO L168 Benchmark]: Toolchain (without parser) took 17114.80 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 382.2 MB). Free memory was 951.4 MB in the beginning and 1.2 GB in the end (delta: -292.0 MB). Peak memory consumption was 90.2 MB. Max. memory is 11.5 GB. [2019-01-14 02:37:07,175 INFO L168 Benchmark]: CDTParser took 0.82 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-14 02:37:07,175 INFO L168 Benchmark]: CACSL2BoogieTranslator took 626.73 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 127.9 MB). Free memory was 946.0 MB in the beginning and 1.1 GB in the end (delta: -163.4 MB). Peak memory consumption was 24.7 MB. Max. memory is 11.5 GB. [2019-01-14 02:37:07,176 INFO L168 Benchmark]: Boogie Procedure Inliner took 56.19 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 1.7 MB). Peak memory consumption was 1.7 MB. Max. memory is 11.5 GB. [2019-01-14 02:37:07,177 INFO L168 Benchmark]: Boogie Preprocessor took 42.48 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-14 02:37:07,178 INFO L168 Benchmark]: RCFGBuilder took 466.37 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: 25.6 MB). Peak memory consumption was 25.6 MB. Max. memory is 11.5 GB. [2019-01-14 02:37:07,179 INFO L168 Benchmark]: BuchiAutomizer took 15909.71 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 254.3 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -161.3 MB). Peak memory consumption was 93.0 MB. Max. memory is 11.5 GB. [2019-01-14 02:37:07,180 INFO L168 Benchmark]: Witness Printer took 8.32 ms. Allocated memory is still 1.4 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-14 02:37:07,186 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.82 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 626.73 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 127.9 MB). Free memory was 946.0 MB in the beginning and 1.1 GB in the end (delta: -163.4 MB). Peak memory consumption was 24.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 56.19 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 1.7 MB). Peak memory consumption was 1.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 42.48 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 466.37 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: 25.6 MB). Peak memory consumption was 25.6 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 15909.71 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 254.3 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -161.3 MB). Peak memory consumption was 93.0 MB. Max. memory is 11.5 GB. * Witness Printer took 8.32 ms. Allocated memory is still 1.4 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #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 3 locations. One deterministic module has affine ranking function unknown-#length-unknown[pt] + -1 * pt and consists of 3 locations. One nondeterministic module has affine ranking function unknown-#length-unknown[nondetString1] + -1 * ps2 and consists of 5 locations. 3 modules have a trivial ranking function, the largest among these consists of 5 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 15.8s and 7 iterations. TraceHistogramMax:2. Analysis of lassos took 14.4s. Construction of modules took 0.2s. Büchi inclusion checks took 0.9s. Highest rank in rank-based complementation 3. Minimization of det autom 2. Minimization of nondet autom 4. Automata minimization 0.0s AutomataMinimizationTime, 5 MinimizatonAttempts, 9 StatesRemovedByMinimization, 3 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 39 states and ocurred in iteration 5. Nontrivial modules had stage [2, 0, 1, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 109 SDtfs, 95 SDslu, 57 SDs, 0 SdLazy, 103 SolverSat, 29 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.2s Time LassoAnalysisResults: nont0 unkn0 SFLI2 SFLT0 conc0 concLT0 SILN0 SILU1 SILI0 SILT0 lasso3 LassoPreprocessingBenchmarks: Lassos: inital255 mio100 ax107 hnf99 lsp90 ukn85 mio100 lsp39 div100 bol100 ite100 ukn100 eq194 hnf88 smp95 dnf258 smp87 tf100 neg97 sie111 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 56ms 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...