./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 2e94e6aa 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-2e94e6a [2019-01-01 21:53:59,366 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-01 21:53:59,368 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-01 21:53:59,383 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-01 21:53:59,384 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-01 21:53:59,385 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-01 21:53:59,389 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-01 21:53:59,391 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-01 21:53:59,393 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-01 21:53:59,395 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-01 21:53:59,396 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-01 21:53:59,396 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-01 21:53:59,397 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-01 21:53:59,402 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-01 21:53:59,408 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-01 21:53:59,408 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-01 21:53:59,409 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-01 21:53:59,414 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-01 21:53:59,420 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-01 21:53:59,423 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-01 21:53:59,424 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-01 21:53:59,426 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-01 21:53:59,428 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-01 21:53:59,428 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-01 21:53:59,428 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-01 21:53:59,429 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-01 21:53:59,430 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-01 21:53:59,430 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-01 21:53:59,431 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-01 21:53:59,432 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-01 21:53:59,432 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-01 21:53:59,433 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-01 21:53:59,433 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-01 21:53:59,433 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-01 21:53:59,434 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-01 21:53:59,435 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-01 21:53:59,435 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf [2019-01-01 21:53:59,468 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-01 21:53:59,468 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-01 21:53:59,469 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-01 21:53:59,469 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-01 21:53:59,471 INFO L133 SettingsManager]: * Use SBE=true [2019-01-01 21:53:59,471 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-01-01 21:53:59,471 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-01-01 21:53:59,472 INFO L133 SettingsManager]: * Use old map elimination=false [2019-01-01 21:53:59,472 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2019-01-01 21:53:59,472 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2019-01-01 21:53:59,472 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-01-01 21:53:59,472 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-01 21:53:59,473 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-01-01 21:53:59,474 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-01 21:53:59,474 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-01 21:53:59,474 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-01-01 21:53:59,475 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-01-01 21:53:59,475 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-01-01 21:53:59,475 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-01 21:53:59,475 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-01-01 21:53:59,475 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-01 21:53:59,475 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-01-01 21:53:59,478 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-01 21:53:59,478 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-01 21:53:59,478 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-01-01 21:53:59,479 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-01 21:53:59,479 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-01 21:53:59,479 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-01-01 21:53:59,480 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-01-01 21:53:59,483 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-01 21:53:59,549 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-01 21:53:59,567 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-01 21:53:59,573 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-01 21:53:59,575 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-01 21:53:59,575 INFO L276 PluginConnector]: CDTParser initialized [2019-01-01 21:53:59,576 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/termination-memory-alloca/substring-alloca_true-termination.c.i [2019-01-01 21:53:59,633 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/242b017c6/2cd910f0aa124df291ec6619f72df7dd/FLAG761d11fab [2019-01-01 21:54:00,143 INFO L307 CDTParser]: Found 1 translation units. [2019-01-01 21:54:00,145 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/termination-memory-alloca/substring-alloca_true-termination.c.i [2019-01-01 21:54:00,163 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/242b017c6/2cd910f0aa124df291ec6619f72df7dd/FLAG761d11fab [2019-01-01 21:54:00,438 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/242b017c6/2cd910f0aa124df291ec6619f72df7dd [2019-01-01 21:54:00,442 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-01 21:54:00,444 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-01-01 21:54:00,445 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-01 21:54:00,445 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-01 21:54:00,449 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-01 21:54:00,451 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.01 09:54:00" (1/1) ... [2019-01-01 21:54:00,455 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@18240abb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:54:00, skipping insertion in model container [2019-01-01 21:54:00,456 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.01 09:54:00" (1/1) ... [2019-01-01 21:54:00,466 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-01 21:54:00,526 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-01 21:54:00,914 INFO L204 PostProcessor]: Analyzing one entry point: main [2019-01-01 21:54:00,933 INFO L191 MainTranslator]: Completed pre-run [2019-01-01 21:54:01,070 INFO L204 PostProcessor]: Analyzing one entry point: main [2019-01-01 21:54:01,127 INFO L195 MainTranslator]: Completed translation [2019-01-01 21:54:01,127 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:54:01 WrapperNode [2019-01-01 21:54:01,127 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-01 21:54:01,128 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-01 21:54:01,128 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-01 21:54:01,129 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-01 21:54:01,139 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:54:01" (1/1) ... [2019-01-01 21:54:01,160 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:54:01" (1/1) ... [2019-01-01 21:54:01,190 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-01 21:54:01,191 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-01 21:54:01,191 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-01 21:54:01,191 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-01 21:54:01,200 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:54:01" (1/1) ... [2019-01-01 21:54:01,200 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:54:01" (1/1) ... [2019-01-01 21:54:01,204 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:54:01" (1/1) ... [2019-01-01 21:54:01,204 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:54:01" (1/1) ... [2019-01-01 21:54:01,211 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:54:01" (1/1) ... [2019-01-01 21:54:01,216 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:54:01" (1/1) ... [2019-01-01 21:54:01,217 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:54:01" (1/1) ... [2019-01-01 21:54:01,220 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-01 21:54:01,221 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-01 21:54:01,221 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-01 21:54:01,221 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-01 21:54:01,222 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:54:01" (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-01 21:54:01,276 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-01-01 21:54:01,277 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-01-01 21:54:01,278 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-01-01 21:54:01,279 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-01-01 21:54:01,279 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-01 21:54:01,279 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-01 21:54:01,701 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-01 21:54:01,701 INFO L280 CfgBuilder]: Removed 8 assue(true) statements. [2019-01-01 21:54:01,702 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.01 09:54:01 BoogieIcfgContainer [2019-01-01 21:54:01,702 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-01 21:54:01,703 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-01-01 21:54:01,704 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-01-01 21:54:01,707 INFO L276 PluginConnector]: BuchiAutomizer initialized [2019-01-01 21:54:01,708 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-01 21:54:01,709 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 01.01 09:54:00" (1/3) ... [2019-01-01 21:54:01,710 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@37f3c978 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 01.01 09:54:01, skipping insertion in model container [2019-01-01 21:54:01,710 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-01 21:54:01,710 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:54:01" (2/3) ... [2019-01-01 21:54:01,711 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@37f3c978 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 01.01 09:54:01, skipping insertion in model container [2019-01-01 21:54:01,711 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-01 21:54:01,711 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.01 09:54:01" (3/3) ... [2019-01-01 21:54:01,714 INFO L375 chiAutomizerObserver]: Analyzing ICFG substring-alloca_true-termination.c.i [2019-01-01 21:54:01,775 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-01 21:54:01,776 INFO L374 BuchiCegarLoop]: Interprodecural is true [2019-01-01 21:54:01,776 INFO L375 BuchiCegarLoop]: Hoare is false [2019-01-01 21:54:01,777 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-01-01 21:54:01,777 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-01 21:54:01,777 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-01 21:54:01,778 INFO L379 BuchiCegarLoop]: Difference is false [2019-01-01 21:54:01,778 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-01 21:54:01,778 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-01-01 21:54:01,793 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states. [2019-01-01 21:54:01,815 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2019-01-01 21:54:01,815 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 21:54:01,816 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 21:54:01,823 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2019-01-01 21:54:01,824 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2019-01-01 21:54:01,824 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2019-01-01 21:54:01,824 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states. [2019-01-01 21:54:01,826 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2019-01-01 21:54:01,826 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 21:54:01,826 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 21:54:01,827 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2019-01-01 21:54:01,827 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2019-01-01 21:54:01,836 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-01 21:54:01,836 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-01 21:54:01,842 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:54:01,843 INFO L82 PathProgramCache]: Analyzing trace with hash 28695878, now seen corresponding path program 1 times [2019-01-01 21:54:01,844 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:54:01,845 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:54:01,895 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:54:01,895 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 21:54:01,895 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:54:01,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:54:02,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:54:02,028 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:54:02,028 INFO L82 PathProgramCache]: Analyzing trace with hash 47887114, now seen corresponding path program 1 times [2019-01-01 21:54:02,028 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:54:02,028 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:54:02,030 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:54:02,030 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 21:54:02,030 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:54:02,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:54:02,066 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-01 21:54:02,068 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 21:54:02,069 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-01 21:54:02,073 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-01-01 21:54:02,088 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-01-01 21:54:02,089 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-01-01 21:54:02,090 INFO L87 Difference]: Start difference. First operand 17 states. Second operand 2 states. [2019-01-01 21:54:02,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 21:54:02,097 INFO L93 Difference]: Finished difference Result 17 states and 22 transitions. [2019-01-01 21:54:02,097 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-01-01 21:54:02,100 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 17 states and 22 transitions. [2019-01-01 21:54:02,101 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2019-01-01 21:54:02,106 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 17 states to 12 states and 16 transitions. [2019-01-01 21:54:02,107 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 12 [2019-01-01 21:54:02,107 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 12 [2019-01-01 21:54:02,108 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 16 transitions. [2019-01-01 21:54:02,108 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-01 21:54:02,109 INFO L705 BuchiCegarLoop]: Abstraction has 12 states and 16 transitions. [2019-01-01 21:54:02,128 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states and 16 transitions. [2019-01-01 21:54:02,139 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2019-01-01 21:54:02,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2019-01-01 21:54:02,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 16 transitions. [2019-01-01 21:54:02,143 INFO L728 BuchiCegarLoop]: Abstraction has 12 states and 16 transitions. [2019-01-01 21:54:02,143 INFO L608 BuchiCegarLoop]: Abstraction has 12 states and 16 transitions. [2019-01-01 21:54:02,143 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2019-01-01 21:54:02,143 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 12 states and 16 transitions. [2019-01-01 21:54:02,145 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2019-01-01 21:54:02,145 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 21:54:02,145 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 21:54:02,146 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2019-01-01 21:54:02,146 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-01 21:54:02,146 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-01 21:54:02,146 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~mem4;havoc substring_#t~short6;havoc substring_#t~mem3;havoc substring_#t~mem5; 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-01 21:54:02,148 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:54:02,148 INFO L82 PathProgramCache]: Analyzing trace with hash 28695878, now seen corresponding path program 2 times [2019-01-01 21:54:02,148 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:54:02,148 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:54:02,154 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:54:02,154 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 21:54:02,154 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:54:02,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:54:02,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:54:02,224 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:54:02,224 INFO L82 PathProgramCache]: Analyzing trace with hash -1237496093, now seen corresponding path program 1 times [2019-01-01 21:54:02,224 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:54:02,224 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:54:02,225 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:54:02,226 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 21:54:02,226 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:54:02,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:54:02,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:54:02,254 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:54:02,255 INFO L82 PathProgramCache]: Analyzing trace with hash -1302992386, now seen corresponding path program 1 times [2019-01-01 21:54:02,255 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:54:02,255 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:54:02,256 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:54:02,257 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 21:54:02,257 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:54:02,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:54:02,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:54:02,981 WARN L181 SmtUtils]: Spent 623.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 60 [2019-01-01 21:54:03,158 WARN L181 SmtUtils]: Spent 125.00 ms on a formula simplification that was a NOOP. DAG size: 47 [2019-01-01 21:54:03,914 WARN L181 SmtUtils]: Spent 752.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 87 [2019-01-01 21:54:04,133 WARN L181 SmtUtils]: Spent 215.00 ms on a formula simplification that was a NOOP. DAG size: 81 [2019-01-01 21:54:04,146 INFO L216 LassoAnalysis]: Preferences: [2019-01-01 21:54:04,148 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-01 21:54:04,148 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-01 21:54:04,148 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-01 21:54:04,148 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-01 21:54:04,149 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 21:54:04,149 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-01 21:54:04,149 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-01 21:54:04,149 INFO L131 ssoRankerPreferences]: Filename of dumped script: substring-alloca_true-termination.c.i_Iteration2_Lasso [2019-01-01 21:54:04,149 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-01 21:54:04,150 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-01 21:54:04,177 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-01 21:54:04,203 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-01 21:54:04,741 WARN L181 SmtUtils]: Spent 301.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 65 [2019-01-01 21:54:04,935 WARN L181 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 52 [2019-01-01 21:54:04,937 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-01 21:54:04,945 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-01 21:54:04,948 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-01 21:54:04,951 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-01 21:54:04,954 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-01 21:54:04,958 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-01 21:54:04,987 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-01 21:54:04,996 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-01 21:54:04,999 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-01 21:54:05,001 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-01 21:54:05,005 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-01 21:54:05,016 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-01 21:54:05,020 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-01 21:54:05,024 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-01 21:54:05,031 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-01 21:54:05,037 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-01 21:54:05,040 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-01 21:54:05,044 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-01 21:54:05,047 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-01 21:54:05,050 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-01 21:54:05,055 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-01 21:54:05,659 WARN L181 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 27 DAG size of output: 25 [2019-01-01 21:54:06,141 WARN L181 SmtUtils]: Spent 466.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 40 [2019-01-01 21:54:06,312 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-01 21:54:06,318 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-01 21:54:06,320 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-01 21:54:06,322 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:54:06,323 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:54:06,324 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:54:06,324 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:54:06,324 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:54:06,326 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:54:06,326 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:54:06,329 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:54:06,329 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-01 21:54:06,330 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:54:06,330 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:54:06,330 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:54:06,330 INFO L206 nArgumentSynthesizer]: 6 loop disjuncts [2019-01-01 21:54:06,331 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:54:06,335 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2019-01-01 21:54:06,335 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:54:06,356 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:54:06,356 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-01 21:54:06,357 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:54:06,357 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:54:06,357 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:54:06,358 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:54:06,365 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:54:06,365 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:54:06,368 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:54:06,369 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-01 21:54:06,369 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:54:06,369 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:54:06,370 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:54:06,370 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:54:06,371 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:54:06,372 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:54:06,376 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:54:06,376 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-01 21:54:06,377 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:54:06,377 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:54:06,377 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:54:06,377 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:54:06,377 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:54:06,378 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:54:06,378 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:54:06,380 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:54:06,381 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-01 21:54:06,381 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:54:06,382 INFO L205 nArgumentSynthesizer]: 4 stem disjuncts [2019-01-01 21:54:06,382 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:54:06,382 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:54:06,398 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2019-01-01 21:54:06,398 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:54:06,465 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:54:06,466 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:54:06,466 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:54:06,468 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:54:06,468 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:54:06,468 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:54:06,473 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:54:06,473 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:54:06,505 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-01 21:54:06,538 INFO L443 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. [2019-01-01 21:54:06,539 INFO L444 ModelExtractionUtils]: 26 out of 31 variables were initially zero. Simplification set additionally 2 variables to zero. [2019-01-01 21:54:06,542 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-01 21:54:06,546 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-01-01 21:54:06,546 INFO L518 LassoAnalysis]: Proved termination. [2019-01-01 21:54:06,547 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-01 21:54:06,752 INFO L297 tatePredicateManager]: 8 out of 9 supporting invariants were superfluous and have been removed [2019-01-01 21:54:06,771 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2019-01-01 21:54:06,800 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:54:06,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:54:06,846 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:54:06,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:54:06,881 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:54:06,941 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-01 21:54:06,945 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-01 21:54:06,946 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 12 states and 16 transitions. cyclomatic complexity: 5 Second operand 3 states. [2019-01-01 21:54:07,046 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-01 21:54:07,047 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-01 21:54:07,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-01-01 21:54:07,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 16 transitions. [2019-01-01 21:54:07,052 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 16 transitions. Stem has 5 letters. Loop has 7 letters. [2019-01-01 21:54:07,053 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:54:07,053 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 16 transitions. Stem has 12 letters. Loop has 7 letters. [2019-01-01 21:54:07,054 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:54:07,054 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 16 transitions. Stem has 5 letters. Loop has 14 letters. [2019-01-01 21:54:07,054 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:54:07,055 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 19 states and 26 transitions. [2019-01-01 21:54:07,056 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-01-01 21:54:07,057 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 19 states to 17 states and 24 transitions. [2019-01-01 21:54:07,057 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9 [2019-01-01 21:54:07,057 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2019-01-01 21:54:07,057 INFO L73 IsDeterministic]: Start isDeterministic. Operand 17 states and 24 transitions. [2019-01-01 21:54:07,057 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-01 21:54:07,058 INFO L705 BuchiCegarLoop]: Abstraction has 17 states and 24 transitions. [2019-01-01 21:54:07,058 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states and 24 transitions. [2019-01-01 21:54:07,059 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2019-01-01 21:54:07,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2019-01-01 21:54:07,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 24 transitions. [2019-01-01 21:54:07,060 INFO L728 BuchiCegarLoop]: Abstraction has 17 states and 24 transitions. [2019-01-01 21:54:07,060 INFO L608 BuchiCegarLoop]: Abstraction has 17 states and 24 transitions. [2019-01-01 21:54:07,060 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2019-01-01 21:54:07,060 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states and 24 transitions. [2019-01-01 21:54:07,061 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-01-01 21:54:07,061 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 21:54:07,061 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 21:54:07,062 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-01 21:54:07,062 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-01-01 21:54:07,062 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-01 21:54:07,062 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~mem4;havoc substring_#t~short6;havoc substring_#t~mem3;havoc substring_#t~mem5;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-01 21:54:07,063 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:54:07,063 INFO L82 PathProgramCache]: Analyzing trace with hash 1806935627, now seen corresponding path program 1 times [2019-01-01 21:54:07,063 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:54:07,063 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:54:07,065 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:54:07,065 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 21:54:07,065 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:54:07,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:54:07,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:54:07,103 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:54:07,104 INFO L82 PathProgramCache]: Analyzing trace with hash 59685, now seen corresponding path program 1 times [2019-01-01 21:54:07,104 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:54:07,104 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:54:07,110 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:54:07,110 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 21:54:07,110 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:54:07,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:54:07,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:54:07,131 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:54:07,131 INFO L82 PathProgramCache]: Analyzing trace with hash 1594173083, now seen corresponding path program 1 times [2019-01-01 21:54:07,131 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:54:07,131 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:54:07,132 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:54:07,132 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 21:54:07,132 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:54:07,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:54:07,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:54:07,382 WARN L181 SmtUtils]: Spent 186.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 45 [2019-01-01 21:54:07,850 WARN L181 SmtUtils]: Spent 421.00 ms on a formula simplification. DAG size of input: 119 DAG size of output: 103 [2019-01-01 21:54:08,080 WARN L181 SmtUtils]: Spent 227.00 ms on a formula simplification that was a NOOP. DAG size: 95 [2019-01-01 21:54:08,083 INFO L216 LassoAnalysis]: Preferences: [2019-01-01 21:54:08,083 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-01 21:54:08,083 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-01 21:54:08,083 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-01 21:54:08,083 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-01 21:54:08,083 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 21:54:08,084 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-01 21:54:08,084 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-01 21:54:08,084 INFO L131 ssoRankerPreferences]: Filename of dumped script: substring-alloca_true-termination.c.i_Iteration3_Lasso [2019-01-01 21:54:08,084 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-01 21:54:08,084 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-01 21:54:08,090 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-01 21:54:08,102 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-01 21:54:08,103 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-01 21:54:08,107 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-01 21:54:08,108 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-01 21:54:08,111 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-01 21:54:08,113 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-01 21:54:08,117 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-01 21:54:08,119 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-01 21:54:08,121 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-01 21:54:08,123 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-01 21:54:08,126 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-01 21:54:08,128 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-01 21:54:08,130 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-01 21:54:08,132 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-01 21:54:08,136 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-01 21:54:08,138 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-01 21:54:08,141 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-01 21:54:08,144 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-01 21:54:08,149 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-01 21:54:08,151 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-01 21:54:08,648 WARN L181 SmtUtils]: Spent 294.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 85 [2019-01-01 21:54:08,863 WARN L181 SmtUtils]: Spent 189.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 60 [2019-01-01 21:54:08,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-01 21:54:08,867 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-01 21:54:08,870 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-01 21:54:09,227 WARN L181 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 41 DAG size of output: 37 [2019-01-01 21:54:10,353 WARN L181 SmtUtils]: Spent 627.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 46 [2019-01-01 21:54:10,395 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-01 21:54:10,395 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-01 21:54:10,396 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-01 21:54:10,396 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:54:10,396 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:54:10,399 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:54:10,399 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:54:10,399 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:54:10,400 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:54:10,400 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:54:10,401 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:54:10,401 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-01 21:54:10,402 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:54:10,402 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:54:10,402 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:54:10,402 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:54:10,402 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:54:10,405 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:54:10,405 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:54:10,406 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:54:10,407 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-01 21:54:10,407 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:54:10,407 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:54:10,407 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:54:10,408 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:54:10,408 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:54:10,411 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:54:10,413 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:54:10,414 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-01 21:54:10,414 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:54:10,414 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:54:10,414 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:54:10,414 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:54:10,415 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:54:10,417 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:54:10,417 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:54:10,418 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:54:10,418 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-01 21:54:10,419 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:54:10,419 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:54:10,419 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:54:10,419 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:54:10,419 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:54:10,422 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:54:10,422 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:54:10,423 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:54:10,424 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:54:10,424 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:54:10,424 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:54:10,424 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:54:10,424 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:54:10,427 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:54:10,427 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:54:10,427 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:54:10,428 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:54:10,428 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:54:10,429 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:54:10,429 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:54:10,429 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:54:10,429 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:54:10,429 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:54:10,433 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:54:10,433 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:54:10,434 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:54:10,434 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:54:10,434 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:54:10,434 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:54:10,435 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:54:10,435 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:54:10,435 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:54:10,435 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:54:10,435 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:54:10,439 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:54:10,439 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:54:10,440 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:54:10,440 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:54:10,440 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:54:10,440 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:54:10,443 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:54:10,443 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:54:10,446 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:54:10,446 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:54:10,447 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:54:10,447 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:54:10,447 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:54:10,447 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:54:10,447 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:54:10,450 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:54:10,450 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:54:10,451 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:54:10,451 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:54:10,452 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:54:10,452 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:54:10,452 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:54:10,452 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:54:10,452 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:54:10,453 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:54:10,453 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:54:10,453 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:54:10,457 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-01 21:54:10,457 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:54:10,458 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:54:10,458 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:54:10,458 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:54:10,459 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:54:10,459 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:54:10,463 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:54:10,464 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-01 21:54:10,464 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:54:10,464 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:54:10,464 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:54:10,464 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:54:10,464 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:54:10,467 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:54:10,467 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:54:10,468 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:54:10,468 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:54:10,469 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:54:10,471 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:54:10,471 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:54:10,471 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:54:10,473 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:54:10,473 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:54:10,475 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:54:10,475 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-01 21:54:10,477 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:54:10,478 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:54:10,478 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:54:10,478 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:54:10,478 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:54:10,480 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:54:10,480 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:54:10,481 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:54:10,481 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-01 21:54:10,481 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:54:10,482 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:54:10,484 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:54:10,484 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:54:10,484 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:54:10,485 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:54:10,485 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:54:10,485 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:54:10,486 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-01 21:54:10,486 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:54:10,486 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:54:10,487 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:54:10,490 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:54:10,490 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:54:10,490 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:54:10,490 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:54:10,491 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:54:10,491 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-01 21:54:10,494 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:54:10,494 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:54:10,494 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:54:10,495 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:54:10,495 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:54:10,496 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:54:10,496 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:54:10,496 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:54:10,498 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-01 21:54:10,498 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:54:10,498 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:54:10,499 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:54:10,499 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:54:10,499 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:54:10,499 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:54:10,499 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:54:10,500 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:54:10,500 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-01 21:54:10,500 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:54:10,501 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:54:10,505 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:54:10,505 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:54:10,506 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:54:10,506 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:54:10,509 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:54:10,509 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:54:10,510 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:54:10,510 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:54:10,510 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:54:10,510 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:54:10,511 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:54:10,511 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:54:10,515 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:54:10,516 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-01 21:54:10,516 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:54:10,516 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:54:10,517 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:54:10,519 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:54:10,523 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:54:10,523 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:54:10,551 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-01 21:54:10,570 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2019-01-01 21:54:10,570 INFO L444 ModelExtractionUtils]: 39 out of 43 variables were initially zero. Simplification set additionally 1 variables to zero. [2019-01-01 21:54:10,571 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-01 21:54:10,573 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-01-01 21:54:10,573 INFO L518 LassoAnalysis]: Proved termination. [2019-01-01 21:54:10,573 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-01 21:54:11,048 INFO L297 tatePredicateManager]: 23 out of 23 supporting invariants were superfluous and have been removed [2019-01-01 21:54:11,063 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2019-01-01 21:54:11,299 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:54:11,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:54:11,319 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:54:11,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:54:11,330 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:54:11,441 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-01 21:54:11,441 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-01 21:54:11,441 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 17 states and 24 transitions. cyclomatic complexity: 9 Second operand 3 states. [2019-01-01 21:54:11,485 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-01 21:54:11,486 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-01 21:54:11,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-01-01 21:54:11,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 17 transitions. [2019-01-01 21:54:11,487 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 17 transitions. Stem has 7 letters. Loop has 3 letters. [2019-01-01 21:54:11,487 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:54:11,487 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 17 transitions. Stem has 10 letters. Loop has 3 letters. [2019-01-01 21:54:11,487 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:54:11,488 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 17 transitions. Stem has 7 letters. Loop has 6 letters. [2019-01-01 21:54:11,488 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:54:11,488 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 40 states and 54 transitions. [2019-01-01 21:54:11,493 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-01-01 21:54:11,494 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 40 states to 28 states and 38 transitions. [2019-01-01 21:54:11,494 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2019-01-01 21:54:11,496 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2019-01-01 21:54:11,496 INFO L73 IsDeterministic]: Start isDeterministic. Operand 28 states and 38 transitions. [2019-01-01 21:54:11,496 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-01 21:54:11,496 INFO L705 BuchiCegarLoop]: Abstraction has 28 states and 38 transitions. [2019-01-01 21:54:11,496 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states and 38 transitions. [2019-01-01 21:54:11,498 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 23. [2019-01-01 21:54:11,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2019-01-01 21:54:11,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 32 transitions. [2019-01-01 21:54:11,500 INFO L728 BuchiCegarLoop]: Abstraction has 23 states and 32 transitions. [2019-01-01 21:54:11,500 INFO L608 BuchiCegarLoop]: Abstraction has 23 states and 32 transitions. [2019-01-01 21:54:11,500 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2019-01-01 21:54:11,500 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 23 states and 32 transitions. [2019-01-01 21:54:11,501 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-01-01 21:54:11,501 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 21:54:11,501 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 21:54:11,502 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 21:54:11,502 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-01-01 21:54:11,502 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~mem4;havoc substring_#t~short6;havoc substring_#t~mem3;havoc substring_#t~mem5; 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-01 21:54:11,505 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~mem4;havoc substring_#t~short6;havoc substring_#t~mem3;havoc substring_#t~mem5;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-01 21:54:11,505 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:54:11,506 INFO L82 PathProgramCache]: Analyzing trace with hash 2012026433, now seen corresponding path program 1 times [2019-01-01 21:54:11,506 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:54:11,506 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:54:11,507 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:54:11,507 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 21:54:11,507 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:54:11,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:54:11,801 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-01 21:54:11,801 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 21:54:11,801 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-01 21:54:11,801 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-01-01 21:54:11,802 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:54:11,802 INFO L82 PathProgramCache]: Analyzing trace with hash 59685, now seen corresponding path program 2 times [2019-01-01 21:54:11,802 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:54:11,802 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:54:11,804 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:54:11,804 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 21:54:11,804 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:54:11,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:54:11,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:54:12,316 WARN L181 SmtUtils]: Spent 499.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 45 [2019-01-01 21:54:12,348 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-01 21:54:12,348 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-01-01 21:54:12,349 INFO L87 Difference]: Start difference. First operand 23 states and 32 transitions. cyclomatic complexity: 12 Second operand 5 states. [2019-01-01 21:54:12,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 21:54:12,398 INFO L93 Difference]: Finished difference Result 29 states and 38 transitions. [2019-01-01 21:54:12,399 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-01 21:54:12,399 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 29 states and 38 transitions. [2019-01-01 21:54:12,401 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2019-01-01 21:54:12,402 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 29 states to 26 states and 34 transitions. [2019-01-01 21:54:12,402 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2019-01-01 21:54:12,402 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2019-01-01 21:54:12,402 INFO L73 IsDeterministic]: Start isDeterministic. Operand 26 states and 34 transitions. [2019-01-01 21:54:12,403 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-01 21:54:12,403 INFO L705 BuchiCegarLoop]: Abstraction has 26 states and 34 transitions. [2019-01-01 21:54:12,403 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states and 34 transitions. [2019-01-01 21:54:12,407 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 24. [2019-01-01 21:54:12,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2019-01-01 21:54:12,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 32 transitions. [2019-01-01 21:54:12,408 INFO L728 BuchiCegarLoop]: Abstraction has 24 states and 32 transitions. [2019-01-01 21:54:12,408 INFO L608 BuchiCegarLoop]: Abstraction has 24 states and 32 transitions. [2019-01-01 21:54:12,408 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2019-01-01 21:54:12,408 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 24 states and 32 transitions. [2019-01-01 21:54:12,410 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-01-01 21:54:12,411 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 21:54:12,411 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 21:54:12,411 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 21:54:12,411 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-01-01 21:54:12,412 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~mem4;havoc substring_#t~short6;havoc substring_#t~mem3;havoc substring_#t~mem5; 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-01 21:54:12,413 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~mem4;havoc substring_#t~short6;havoc substring_#t~mem3;havoc substring_#t~mem5;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-01 21:54:12,413 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:54:12,413 INFO L82 PathProgramCache]: Analyzing trace with hash 1954768131, now seen corresponding path program 2 times [2019-01-01 21:54:12,413 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:54:12,413 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:54:12,414 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:54:12,414 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 21:54:12,414 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:54:12,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:54:12,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:54:12,451 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:54:12,451 INFO L82 PathProgramCache]: Analyzing trace with hash 59685, now seen corresponding path program 3 times [2019-01-01 21:54:12,451 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:54:12,451 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:54:12,452 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:54:12,452 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 21:54:12,452 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:54:12,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:54:12,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:54:12,464 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:54:12,468 INFO L82 PathProgramCache]: Analyzing trace with hash -964145949, now seen corresponding path program 1 times [2019-01-01 21:54:12,469 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:54:12,469 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:54:12,471 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:54:12,477 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 21:54:12,477 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:54:12,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:54:12,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:54:12,659 WARN L181 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 45 [2019-01-01 21:54:13,390 WARN L181 SmtUtils]: Spent 699.00 ms on a formula simplification. DAG size of input: 183 DAG size of output: 146 [2019-01-01 21:54:13,580 WARN L181 SmtUtils]: Spent 184.00 ms on a formula simplification that was a NOOP. DAG size: 111 [2019-01-01 21:54:13,583 INFO L216 LassoAnalysis]: Preferences: [2019-01-01 21:54:13,583 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-01 21:54:13,583 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-01 21:54:13,583 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-01 21:54:13,583 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-01 21:54:13,583 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 21:54:13,583 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-01 21:54:13,584 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-01 21:54:13,584 INFO L131 ssoRankerPreferences]: Filename of dumped script: substring-alloca_true-termination.c.i_Iteration5_Lasso [2019-01-01 21:54:13,584 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-01 21:54:13,584 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-01 21:54:13,591 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-01 21:54:13,606 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-01 21:54:13,607 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-01 21:54:13,609 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-01 21:54:13,611 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-01 21:54:13,615 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-01 21:54:13,621 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-01 21:54:13,624 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-01 21:54:13,626 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-01 21:54:13,630 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-01 21:54:13,632 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-01 21:54:13,635 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-01 21:54:13,638 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-01 21:54:13,640 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-01 21:54:14,348 WARN L181 SmtUtils]: Spent 361.00 ms on a formula simplification. DAG size of input: 119 DAG size of output: 99 [2019-01-01 21:54:14,643 WARN L181 SmtUtils]: Spent 208.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 71 [2019-01-01 21:54:14,643 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-01 21:54:14,676 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-01 21:54:14,678 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-01 21:54:14,684 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-01 21:54:14,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-01 21:54:14,687 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-01 21:54:14,689 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-01 21:54:14,691 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-01 21:54:14,693 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-01 21:54:14,696 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-01 21:54:14,699 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-01 21:54:15,140 WARN L181 SmtUtils]: Spent 186.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 55 [2019-01-01 21:54:15,797 WARN L181 SmtUtils]: Spent 529.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 39 [2019-01-01 21:54:16,367 WARN L181 SmtUtils]: Spent 555.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 46 [2019-01-01 21:54:16,614 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-01 21:54:16,614 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-01 21:54:16,614 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-01 21:54:16,617 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:54:16,618 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:54:16,618 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:54:16,618 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:54:16,618 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:54:16,619 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:54:16,622 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:54:16,622 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:54:16,622 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:54:16,623 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:54:16,623 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:54:16,623 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:54:16,623 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:54:16,623 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:54:16,623 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:54:16,624 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:54:16,624 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-01 21:54:16,624 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:54:16,624 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:54:16,626 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:54:16,626 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:54:16,626 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:54:16,626 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:54:16,626 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:54:16,632 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:54:16,632 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-01 21:54:16,632 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:54:16,633 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:54:16,633 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:54:16,633 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:54:16,633 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:54:16,633 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:54:16,636 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:54:16,637 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:54:16,637 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-01 21:54:16,637 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:54:16,637 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:54:16,638 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:54:16,641 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:54:16,641 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:54:16,642 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:54:16,642 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:54:16,643 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:54:16,643 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-01 21:54:16,643 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:54:16,643 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:54:16,644 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:54:16,644 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:54:16,644 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:54:16,644 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:54:16,644 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:54:16,645 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:54:16,645 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-01 21:54:16,645 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:54:16,645 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:54:16,646 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:54:16,646 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:54:16,646 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:54:16,646 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:54:16,647 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:54:16,655 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-01 21:54:16,655 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:54:16,655 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:54:16,656 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:54:16,656 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:54:16,656 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:54:16,656 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:54:16,656 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:54:16,659 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:54:16,659 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-01 21:54:16,660 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:54:16,660 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:54:16,660 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:54:16,660 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:54:16,663 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:54:16,663 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:54:16,665 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:54:16,665 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:54:16,669 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:54:16,669 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:54:16,669 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:54:16,669 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:54:16,669 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:54:16,670 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:54:16,670 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:54:16,670 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:54:16,670 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-01 21:54:16,671 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:54:16,671 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:54:16,671 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:54:16,671 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:54:16,672 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:54:16,672 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:54:16,673 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:54:16,674 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-01 21:54:16,674 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:54:16,674 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:54:16,674 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:54:16,674 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:54:16,675 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:54:16,675 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:54:16,675 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:54:16,675 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:54:16,677 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-01 21:54:16,678 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:54:16,678 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:54:16,678 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:54:16,678 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:54:16,678 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:54:16,679 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:54:16,679 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:54:16,679 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:54:16,680 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-01 21:54:16,680 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:54:16,680 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:54:16,680 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:54:16,680 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:54:16,682 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:54:16,682 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:54:16,690 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:54:16,690 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:54:16,690 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:54:16,696 INFO L205 nArgumentSynthesizer]: 12 stem disjuncts [2019-01-01 21:54:16,696 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2019-01-01 21:54:16,696 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:54:16,711 INFO L402 nArgumentSynthesizer]: We have 60 Motzkin's Theorem applications. [2019-01-01 21:54:16,714 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2019-01-01 21:54:16,751 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:54:16,752 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-01 21:54:16,753 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:54:16,753 INFO L205 nArgumentSynthesizer]: 4 stem disjuncts [2019-01-01 21:54:16,753 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:54:16,753 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:54:16,761 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2019-01-01 21:54:16,762 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:54:16,814 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:54:16,818 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-01 21:54:16,819 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:54:16,819 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:54:16,819 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:54:16,819 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:54:16,820 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:54:16,820 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:54:16,829 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:54:16,829 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-01 21:54:16,830 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:54:16,830 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:54:16,830 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:54:16,830 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:54:16,835 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:54:16,836 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:54:16,837 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:54:16,838 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-01 21:54:16,839 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:54:16,839 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:54:16,839 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:54:16,839 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:54:16,843 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:54:16,843 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:54:16,845 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:54:16,846 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-01 21:54:16,847 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:54:16,847 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:54:16,847 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:54:16,847 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:54:16,851 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:54:16,852 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:54:16,854 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:54:16,854 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-01 21:54:16,857 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:54:16,858 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:54:16,858 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:54:16,858 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:54:16,864 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:54:16,864 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:54:16,923 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-01 21:54:16,979 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2019-01-01 21:54:16,979 INFO L444 ModelExtractionUtils]: 52 out of 58 variables were initially zero. Simplification set additionally 3 variables to zero. [2019-01-01 21:54:16,980 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-01 21:54:16,980 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-01-01 21:54:16,981 INFO L518 LassoAnalysis]: Proved termination. [2019-01-01 21:54:16,981 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-01 21:54:17,512 INFO L297 tatePredicateManager]: 43 out of 45 supporting invariants were superfluous and have been removed [2019-01-01 21:54:17,518 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2019-01-01 21:54:17,541 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:54:17,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:54:17,576 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:54:17,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:54:17,612 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:54:17,657 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-01 21:54:17,658 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-01 21:54:17,658 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 24 states and 32 transitions. cyclomatic complexity: 11 Second operand 5 states. [2019-01-01 21:54:17,756 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-01 21:54:17,759 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-01 21:54:17,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2019-01-01 21:54:17,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 19 transitions. [2019-01-01 21:54:17,760 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 19 transitions. Stem has 14 letters. Loop has 3 letters. [2019-01-01 21:54:17,760 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:54:17,760 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-01-01 21:54:17,782 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:54:17,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:54:17,817 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:54:17,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:54:17,843 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:54:17,886 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-01 21:54:17,887 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-01 21:54:17,887 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 24 states and 32 transitions. cyclomatic complexity: 11 Second operand 5 states. [2019-01-01 21:54:17,972 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-01 21:54:17,974 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-01 21:54:17,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2019-01-01 21:54:17,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 19 transitions. [2019-01-01 21:54:17,975 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 19 transitions. Stem has 14 letters. Loop has 3 letters. [2019-01-01 21:54:17,975 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:54:17,975 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-01-01 21:54:18,059 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:54:18,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:54:18,094 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:54:18,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:54:18,137 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:54:18,162 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-01 21:54:18,163 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-01 21:54:18,163 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 24 states and 32 transitions. cyclomatic complexity: 11 Second operand 5 states. [2019-01-01 21:54:18,276 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-01 21:54:18,279 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-01 21:54:18,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2019-01-01 21:54:18,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 27 transitions. [2019-01-01 21:54:18,280 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 27 transitions. Stem has 14 letters. Loop has 3 letters. [2019-01-01 21:54:18,281 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:54:18,281 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 27 transitions. Stem has 17 letters. Loop has 3 letters. [2019-01-01 21:54:18,282 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:54:18,282 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 27 transitions. Stem has 14 letters. Loop has 6 letters. [2019-01-01 21:54:18,282 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:54:18,282 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 50 states and 66 transitions. [2019-01-01 21:54:18,285 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-01-01 21:54:18,285 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 50 states to 41 states and 54 transitions. [2019-01-01 21:54:18,286 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2019-01-01 21:54:18,286 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 12 [2019-01-01 21:54:18,286 INFO L73 IsDeterministic]: Start isDeterministic. Operand 41 states and 54 transitions. [2019-01-01 21:54:18,286 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-01 21:54:18,286 INFO L705 BuchiCegarLoop]: Abstraction has 41 states and 54 transitions. [2019-01-01 21:54:18,286 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states and 54 transitions. [2019-01-01 21:54:18,289 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 39. [2019-01-01 21:54:18,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2019-01-01 21:54:18,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 52 transitions. [2019-01-01 21:54:18,290 INFO L728 BuchiCegarLoop]: Abstraction has 39 states and 52 transitions. [2019-01-01 21:54:18,290 INFO L608 BuchiCegarLoop]: Abstraction has 39 states and 52 transitions. [2019-01-01 21:54:18,290 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2019-01-01 21:54:18,290 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 39 states and 52 transitions. [2019-01-01 21:54:18,291 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-01-01 21:54:18,291 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 21:54:18,291 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 21:54:18,292 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 21:54:18,292 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-01-01 21:54:18,292 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~mem4;havoc substring_#t~short6;havoc substring_#t~mem3;havoc substring_#t~mem5; 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-01 21:54:18,292 INFO L796 eck$LassoCheckResult]: Loop: 983#L553-1 assume !substring_#t~short6; 998#L553-3 assume !!substring_#t~short6;havoc substring_#t~mem4;havoc substring_#t~short6;havoc substring_#t~mem3;havoc substring_#t~mem5;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-01 21:54:18,292 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:54:18,293 INFO L82 PathProgramCache]: Analyzing trace with hash 468269947, now seen corresponding path program 3 times [2019-01-01 21:54:18,293 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:54:18,293 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:54:18,294 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:54:18,294 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 21:54:18,294 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:54:18,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:54:18,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:54:18,322 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:54:18,322 INFO L82 PathProgramCache]: Analyzing trace with hash 64727, now seen corresponding path program 1 times [2019-01-01 21:54:18,322 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:54:18,322 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:54:18,323 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:54:18,323 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 21:54:18,324 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:54:18,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:54:18,385 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-01 21:54:18,386 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 21:54:18,386 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-01 21:54:18,386 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-01-01 21:54:18,386 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-01 21:54:18,386 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-01 21:54:18,389 INFO L87 Difference]: Start difference. First operand 39 states and 52 transitions. cyclomatic complexity: 18 Second operand 3 states. [2019-01-01 21:54:18,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 21:54:18,455 INFO L93 Difference]: Finished difference Result 33 states and 39 transitions. [2019-01-01 21:54:18,458 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-01 21:54:18,458 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 33 states and 39 transitions. [2019-01-01 21:54:18,459 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-01-01 21:54:18,459 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 33 states to 0 states and 0 transitions. [2019-01-01 21:54:18,459 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2019-01-01 21:54:18,459 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2019-01-01 21:54:18,459 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2019-01-01 21:54:18,459 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-01 21:54:18,459 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-01 21:54:18,461 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-01 21:54:18,461 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-01 21:54:18,461 INFO L442 BuchiCegarLoop]: ======== Iteration 7============ [2019-01-01 21:54:18,461 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2019-01-01 21:54:18,461 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-01-01 21:54:18,461 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2019-01-01 21:54:18,469 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 01.01 09:54:18 BoogieIcfgContainer [2019-01-01 21:54:18,469 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2019-01-01 21:54:18,469 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-01 21:54:18,469 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-01 21:54:18,470 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-01 21:54:18,470 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.01 09:54:01" (3/4) ... [2019-01-01 21:54:18,475 INFO L147 WitnessPrinter]: No result that supports witness generation found [2019-01-01 21:54:18,475 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-01 21:54:18,476 INFO L168 Benchmark]: Toolchain (without parser) took 18033.84 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 388.5 MB). Free memory was 952.7 MB in the beginning and 1.2 GB in the end (delta: -287.4 MB). Peak memory consumption was 101.1 MB. Max. memory is 11.5 GB. [2019-01-01 21:54:18,477 INFO L168 Benchmark]: CDTParser took 0.16 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-01 21:54:18,478 INFO L168 Benchmark]: CACSL2BoogieTranslator took 682.92 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 139.5 MB). Free memory was 947.3 MB in the beginning and 1.1 GB in the end (delta: -173.4 MB). Peak memory consumption was 26.5 MB. Max. memory is 11.5 GB. [2019-01-01 21:54:18,480 INFO L168 Benchmark]: Boogie Procedure Inliner took 62.28 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-01 21:54:18,481 INFO L168 Benchmark]: Boogie Preprocessor took 29.45 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-01 21:54:18,481 INFO L168 Benchmark]: RCFGBuilder took 481.62 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-01 21:54:18,482 INFO L168 Benchmark]: BuchiAutomizer took 16765.38 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 249.0 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -145.0 MB). Peak memory consumption was 104.0 MB. Max. memory is 11.5 GB. [2019-01-01 21:54:18,484 INFO L168 Benchmark]: Witness Printer took 6.27 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-01 21:54:18,490 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.16 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 682.92 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 139.5 MB). Free memory was 947.3 MB in the beginning and 1.1 GB in the end (delta: -173.4 MB). Peak memory consumption was 26.5 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 62.28 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. * Boogie Preprocessor took 29.45 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 481.62 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 16765.38 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 249.0 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -145.0 MB). Peak memory consumption was 104.0 MB. Max. memory is 11.5 GB. * Witness Printer took 6.27 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 16.7s and 7 iterations. TraceHistogramMax:2. Analysis of lassos took 14.9s. Construction of modules took 0.2s. Büchi inclusion checks took 1.3s. 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: 60ms 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...