./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 91b1670e 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-91b1670 [2018-11-28 23:21:48,077 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-28 23:21:48,079 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-28 23:21:48,091 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-28 23:21:48,092 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-28 23:21:48,093 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-28 23:21:48,094 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-28 23:21:48,096 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-28 23:21:48,098 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-28 23:21:48,099 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-28 23:21:48,100 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-28 23:21:48,100 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-28 23:21:48,101 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-28 23:21:48,102 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-28 23:21:48,103 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-28 23:21:48,104 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-28 23:21:48,105 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-28 23:21:48,107 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-28 23:21:48,111 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-28 23:21:48,113 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-28 23:21:48,117 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-28 23:21:48,121 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-28 23:21:48,123 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-28 23:21:48,123 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-28 23:21:48,124 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-28 23:21:48,124 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-28 23:21:48,125 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-28 23:21:48,126 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-28 23:21:48,127 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-28 23:21:48,128 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-28 23:21:48,128 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-28 23:21:48,129 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-28 23:21:48,129 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-28 23:21:48,129 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-28 23:21:48,130 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-28 23:21:48,131 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-28 23:21:48,132 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf [2018-11-28 23:21:48,149 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-28 23:21:48,149 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-28 23:21:48,151 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-28 23:21:48,151 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-28 23:21:48,151 INFO L133 SettingsManager]: * Use SBE=true [2018-11-28 23:21:48,151 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-11-28 23:21:48,152 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-11-28 23:21:48,152 INFO L133 SettingsManager]: * Use old map elimination=false [2018-11-28 23:21:48,152 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-11-28 23:21:48,152 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-11-28 23:21:48,152 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-11-28 23:21:48,153 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-28 23:21:48,153 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-28 23:21:48,153 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-28 23:21:48,153 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-28 23:21:48,153 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-11-28 23:21:48,153 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-11-28 23:21:48,154 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-11-28 23:21:48,154 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-28 23:21:48,154 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-11-28 23:21:48,154 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-28 23:21:48,154 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-11-28 23:21:48,155 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-28 23:21:48,155 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-28 23:21:48,155 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-11-28 23:21:48,155 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-28 23:21:48,155 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-28 23:21:48,155 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-11-28 23:21:48,156 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-11-28 23:21:48,157 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 [2018-11-28 23:21:48,199 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-28 23:21:48,216 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-28 23:21:48,222 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-28 23:21:48,224 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-28 23:21:48,224 INFO L276 PluginConnector]: CDTParser initialized [2018-11-28 23:21:48,225 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/termination-memory-alloca/substring-alloca_true-termination.c.i [2018-11-28 23:21:48,293 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f59a55efa/0cd02b0869304ec6b49a795948336533/FLAG37ac5ca56 [2018-11-28 23:21:48,869 INFO L307 CDTParser]: Found 1 translation units. [2018-11-28 23:21:48,871 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/termination-memory-alloca/substring-alloca_true-termination.c.i [2018-11-28 23:21:48,885 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f59a55efa/0cd02b0869304ec6b49a795948336533/FLAG37ac5ca56 [2018-11-28 23:21:49,154 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f59a55efa/0cd02b0869304ec6b49a795948336533 [2018-11-28 23:21:49,158 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-28 23:21:49,160 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-28 23:21:49,161 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-28 23:21:49,162 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-28 23:21:49,169 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-28 23:21:49,170 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 11:21:49" (1/1) ... [2018-11-28 23:21:49,174 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@940847a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:21:49, skipping insertion in model container [2018-11-28 23:21:49,175 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 11:21:49" (1/1) ... [2018-11-28 23:21:49,184 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-28 23:21:49,230 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-28 23:21:49,579 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-11-28 23:21:49,593 INFO L191 MainTranslator]: Completed pre-run [2018-11-28 23:21:49,655 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-11-28 23:21:49,733 INFO L195 MainTranslator]: Completed translation [2018-11-28 23:21:49,733 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:21:49 WrapperNode [2018-11-28 23:21:49,734 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-28 23:21:49,735 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-28 23:21:49,736 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-28 23:21:49,736 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-28 23:21:49,817 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:21:49" (1/1) ... [2018-11-28 23:21:49,838 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:21:49" (1/1) ... [2018-11-28 23:21:49,871 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-28 23:21:49,872 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-28 23:21:49,873 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-28 23:21:49,873 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-28 23:21:49,884 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:21:49" (1/1) ... [2018-11-28 23:21:49,884 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:21:49" (1/1) ... [2018-11-28 23:21:49,888 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:21:49" (1/1) ... [2018-11-28 23:21:49,889 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:21:49" (1/1) ... [2018-11-28 23:21:49,897 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:21:49" (1/1) ... [2018-11-28 23:21:49,907 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:21:49" (1/1) ... [2018-11-28 23:21:49,910 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:21:49" (1/1) ... [2018-11-28 23:21:49,913 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-28 23:21:49,914 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-28 23:21:49,914 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-28 23:21:49,914 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-28 23:21:49,915 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:21:49" (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 [2018-11-28 23:21:49,980 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-28 23:21:49,980 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-28 23:21:49,981 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-28 23:21:49,981 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-28 23:21:49,981 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-28 23:21:49,981 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-28 23:21:50,409 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-28 23:21:50,410 INFO L280 CfgBuilder]: Removed 8 assue(true) statements. [2018-11-28 23:21:50,410 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 11:21:50 BoogieIcfgContainer [2018-11-28 23:21:50,410 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-28 23:21:50,411 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-11-28 23:21:50,411 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-11-28 23:21:50,415 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-11-28 23:21:50,416 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-28 23:21:50,417 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 28.11 11:21:49" (1/3) ... [2018-11-28 23:21:50,418 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@1b443f9a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 28.11 11:21:50, skipping insertion in model container [2018-11-28 23:21:50,418 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-28 23:21:50,418 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:21:49" (2/3) ... [2018-11-28 23:21:50,418 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@1b443f9a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 28.11 11:21:50, skipping insertion in model container [2018-11-28 23:21:50,419 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-28 23:21:50,419 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 11:21:50" (3/3) ... [2018-11-28 23:21:50,421 INFO L375 chiAutomizerObserver]: Analyzing ICFG substring-alloca_true-termination.c.i [2018-11-28 23:21:50,482 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-28 23:21:50,483 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-11-28 23:21:50,483 INFO L375 BuchiCegarLoop]: Hoare is false [2018-11-28 23:21:50,483 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-11-28 23:21:50,484 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-28 23:21:50,484 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-28 23:21:50,484 INFO L379 BuchiCegarLoop]: Difference is false [2018-11-28 23:21:50,484 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-28 23:21:50,484 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-11-28 23:21:50,500 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states. [2018-11-28 23:21:50,522 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2018-11-28 23:21:50,523 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 23:21:50,523 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 23:21:50,530 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2018-11-28 23:21:50,530 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2018-11-28 23:21:50,530 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-11-28 23:21:50,530 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states. [2018-11-28 23:21:50,532 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2018-11-28 23:21:50,532 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 23:21:50,533 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 23:21:50,533 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2018-11-28 23:21:50,533 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2018-11-28 23:21:50,543 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.alloc(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.alloc(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 [2018-11-28 23:21:50,543 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 [2018-11-28 23:21:50,552 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:21:50,553 INFO L82 PathProgramCache]: Analyzing trace with hash 28695878, now seen corresponding path program 1 times [2018-11-28 23:21:50,555 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:21:50,556 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:21:50,623 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:21:50,623 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:21:50,623 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:21:50,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:21:50,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:21:50,735 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:21:50,735 INFO L82 PathProgramCache]: Analyzing trace with hash 47887114, now seen corresponding path program 1 times [2018-11-28 23:21:50,735 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:21:50,736 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:21:50,740 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:21:50,741 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:21:50,741 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:21:50,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:21:50,794 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 23:21:50,799 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 23:21:50,799 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-28 23:21:50,805 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-11-28 23:21:50,828 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-28 23:21:50,828 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-28 23:21:50,831 INFO L87 Difference]: Start difference. First operand 17 states. Second operand 2 states. [2018-11-28 23:21:50,839 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 23:21:50,842 INFO L93 Difference]: Finished difference Result 17 states and 22 transitions. [2018-11-28 23:21:50,843 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-28 23:21:50,846 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 17 states and 22 transitions. [2018-11-28 23:21:50,849 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2018-11-28 23:21:50,855 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 17 states to 12 states and 16 transitions. [2018-11-28 23:21:50,859 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 12 [2018-11-28 23:21:50,860 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 12 [2018-11-28 23:21:50,860 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 16 transitions. [2018-11-28 23:21:50,861 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-28 23:21:50,861 INFO L705 BuchiCegarLoop]: Abstraction has 12 states and 16 transitions. [2018-11-28 23:21:50,882 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states and 16 transitions. [2018-11-28 23:21:50,894 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2018-11-28 23:21:50,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-11-28 23:21:50,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 16 transitions. [2018-11-28 23:21:50,898 INFO L728 BuchiCegarLoop]: Abstraction has 12 states and 16 transitions. [2018-11-28 23:21:50,898 INFO L608 BuchiCegarLoop]: Abstraction has 12 states and 16 transitions. [2018-11-28 23:21:50,898 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-11-28 23:21:50,898 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 12 states and 16 transitions. [2018-11-28 23:21:50,899 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2018-11-28 23:21:50,899 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 23:21:50,900 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 23:21:50,900 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2018-11-28 23:21:50,900 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2018-11-28 23:21:50,900 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.alloc(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.alloc(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 [2018-11-28 23:21:50,901 INFO L796 eck$LassoCheckResult]: Loop: 51#L550-3 call substring_#t~mem2 := read~int(substring_~ps~0.base, substring_~ps~0.offset, 1); 52#L550-1 assume !!(0 != substring_#t~mem2);havoc substring_#t~mem2;substring_~ps2~0.base, substring_~ps2~0.offset := substring_~ps~0.base, substring_~ps~0.offset;substring_~pt~0.base, substring_~pt~0.offset := substring_~t.base, substring_~t.offset; 42#L553-5 call substring_#t~mem3 := read~int(substring_~pt~0.base, substring_~pt~0.offset, 1);substring_#t~short6 := 0 != substring_#t~mem3; 43#L553-1 assume substring_#t~short6;call substring_#t~mem4 := read~int(substring_~pt~0.base, substring_~pt~0.offset, 1);call substring_#t~mem5 := read~int(substring_~ps2~0.base, substring_~ps2~0.offset, 1);substring_#t~short6 := substring_#t~mem4 == substring_#t~mem5; 53#L553-3 assume !substring_#t~short6;havoc substring_#t~mem3;havoc substring_#t~mem4;havoc substring_#t~short6;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 [2018-11-28 23:21:50,901 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:21:50,901 INFO L82 PathProgramCache]: Analyzing trace with hash 28695878, now seen corresponding path program 2 times [2018-11-28 23:21:50,901 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:21:50,902 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:21:50,904 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:21:50,904 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:21:50,904 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:21:50,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:21:50,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:21:50,995 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:21:50,996 INFO L82 PathProgramCache]: Analyzing trace with hash -1237496093, now seen corresponding path program 1 times [2018-11-28 23:21:50,996 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:21:50,996 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:21:51,001 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:21:51,001 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 23:21:51,001 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:21:51,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:21:51,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:21:51,061 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:21:51,061 INFO L82 PathProgramCache]: Analyzing trace with hash -1302992386, now seen corresponding path program 1 times [2018-11-28 23:21:51,061 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:21:51,061 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:21:51,066 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:21:51,066 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:21:51,066 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:21:51,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:21:51,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:21:51,804 WARN L180 SmtUtils]: Spent 577.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 60 [2018-11-28 23:21:52,022 WARN L180 SmtUtils]: Spent 184.00 ms on a formula simplification that was a NOOP. DAG size: 47 [2018-11-28 23:21:52,747 WARN L180 SmtUtils]: Spent 720.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 84 [2018-11-28 23:21:52,889 WARN L180 SmtUtils]: Spent 137.00 ms on a formula simplification that was a NOOP. DAG size: 78 [2018-11-28 23:21:52,915 INFO L216 LassoAnalysis]: Preferences: [2018-11-28 23:21:52,916 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-28 23:21:52,917 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-28 23:21:52,917 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-28 23:21:52,917 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-28 23:21:52,917 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 23:21:52,917 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-28 23:21:52,918 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-28 23:21:52,918 INFO L131 ssoRankerPreferences]: Filename of dumped script: substring-alloca_true-termination.c.i_Iteration2_Lasso [2018-11-28 23:21:52,918 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-28 23:21:52,918 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-28 23:21:52,948 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:21:52,968 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:21:52,972 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:21:52,989 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:21:53,473 WARN L180 SmtUtils]: Spent 271.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 62 [2018-11-28 23:21:53,671 WARN L180 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 52 [2018-11-28 23:21:53,672 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:21:53,676 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:21:53,687 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:21:53,690 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:21:53,692 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:21:53,725 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:21:53,730 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:21:53,735 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:21:53,739 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:21:53,741 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:21:53,745 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:21:53,747 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:21:53,757 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:21:53,763 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:21:53,767 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:21:53,797 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:21:53,801 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:21:53,807 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:21:53,810 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:21:54,284 WARN L180 SmtUtils]: Spent 143.00 ms on a formula simplification that was a NOOP. DAG size: 21 [2018-11-28 23:21:54,452 WARN L180 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 27 DAG size of output: 25 [2018-11-28 23:21:54,713 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-28 23:21:54,719 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-28 23:21:54,721 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:21:54,724 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:21:54,724 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:21:54,725 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:21:54,725 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:21:54,725 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:21:54,727 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:21:54,727 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:21:54,729 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:21:54,730 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:21:54,731 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:21:54,731 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:21:54,731 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:21:54,731 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:21:54,731 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:21:54,732 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:21:54,732 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:21:54,733 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:21:54,734 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:21:54,734 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:21:54,734 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:21:54,734 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:21:54,735 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:21:54,739 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:21:54,739 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:21:54,742 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:21:54,742 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:21:54,743 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:21:54,743 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-28 23:21:54,743 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:21:54,743 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:21:54,751 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-28 23:21:54,751 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:21:54,776 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:21:54,779 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:21:54,779 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:21:54,780 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:21:54,780 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:21:54,780 INFO L206 nArgumentSynthesizer]: 6 loop disjuncts [2018-11-28 23:21:54,780 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:21:54,783 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2018-11-28 23:21:54,784 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:21:54,800 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:21:54,802 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:21:54,804 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:21:54,804 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:21:54,805 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:21:54,805 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:21:54,806 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:21:54,806 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:21:54,811 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:21:54,817 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:21:54,817 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:21:54,818 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:21:54,818 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:21:54,818 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:21:54,822 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:21:54,822 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:21:54,829 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:21:54,830 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:21:54,830 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:21:54,830 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:21:54,831 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:21:54,831 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:21:54,831 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:21:54,831 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:21:54,831 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:21:54,838 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:21:54,839 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:21:54,839 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:21:54,840 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:21:54,840 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:21:54,840 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:21:54,847 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:21:54,847 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:21:54,905 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-28 23:21:54,935 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2018-11-28 23:21:54,935 INFO L444 ModelExtractionUtils]: 27 out of 31 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-11-28 23:21:54,939 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-28 23:21:54,941 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-28 23:21:54,944 INFO L518 LassoAnalysis]: Proved termination. [2018-11-28 23:21:54,945 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 [] [2018-11-28 23:21:55,071 INFO L297 tatePredicateManager]: 8 out of 9 supporting invariants were superfluous and have been removed [2018-11-28 23:21:55,079 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2018-11-28 23:21:55,108 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:21:55,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:21:55,139 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:21:55,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:21:55,167 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:21:55,212 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 23:21:55,216 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 [2018-11-28 23:21:55,217 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 12 states and 16 transitions. cyclomatic complexity: 5 Second operand 3 states. [2018-11-28 23:21:55,406 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. [2018-11-28 23:21:55,407 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 [2018-11-28 23:21:55,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-28 23:21:55,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 16 transitions. [2018-11-28 23:21:55,411 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 16 transitions. Stem has 5 letters. Loop has 7 letters. [2018-11-28 23:21:55,412 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:21:55,413 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 16 transitions. Stem has 12 letters. Loop has 7 letters. [2018-11-28 23:21:55,413 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:21:55,413 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 16 transitions. Stem has 5 letters. Loop has 14 letters. [2018-11-28 23:21:55,413 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:21:55,415 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 19 states and 26 transitions. [2018-11-28 23:21:55,416 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-11-28 23:21:55,417 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 19 states to 17 states and 24 transitions. [2018-11-28 23:21:55,417 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9 [2018-11-28 23:21:55,418 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2018-11-28 23:21:55,418 INFO L73 IsDeterministic]: Start isDeterministic. Operand 17 states and 24 transitions. [2018-11-28 23:21:55,418 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-28 23:21:55,418 INFO L705 BuchiCegarLoop]: Abstraction has 17 states and 24 transitions. [2018-11-28 23:21:55,418 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states and 24 transitions. [2018-11-28 23:21:55,419 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2018-11-28 23:21:55,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-11-28 23:21:55,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 24 transitions. [2018-11-28 23:21:55,422 INFO L728 BuchiCegarLoop]: Abstraction has 17 states and 24 transitions. [2018-11-28 23:21:55,422 INFO L608 BuchiCegarLoop]: Abstraction has 17 states and 24 transitions. [2018-11-28 23:21:55,423 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-11-28 23:21:55,423 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states and 24 transitions. [2018-11-28 23:21:55,424 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-11-28 23:21:55,424 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 23:21:55,424 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 23:21:55,424 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2018-11-28 23:21:55,424 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-11-28 23:21:55,426 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.alloc(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.alloc(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 [2018-11-28 23:21:55,426 INFO L796 eck$LassoCheckResult]: Loop: 170#L553-5 call substring_#t~mem3 := read~int(substring_~pt~0.base, substring_~pt~0.offset, 1);substring_#t~short6 := 0 != substring_#t~mem3; 171#L553-1 assume substring_#t~short6;call substring_#t~mem4 := read~int(substring_~pt~0.base, substring_~pt~0.offset, 1);call substring_#t~mem5 := read~int(substring_~ps2~0.base, substring_~ps2~0.offset, 1);substring_#t~short6 := substring_#t~mem4 == substring_#t~mem5; 185#L553-3 assume !!substring_#t~short6;havoc substring_#t~mem3;havoc substring_#t~mem4;havoc substring_#t~short6;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 [2018-11-28 23:21:55,426 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:21:55,429 INFO L82 PathProgramCache]: Analyzing trace with hash 1806935627, now seen corresponding path program 1 times [2018-11-28 23:21:55,429 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:21:55,429 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:21:55,432 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:21:55,432 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:21:55,432 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:21:55,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:21:55,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:21:55,460 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:21:55,461 INFO L82 PathProgramCache]: Analyzing trace with hash 59685, now seen corresponding path program 1 times [2018-11-28 23:21:55,461 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:21:55,461 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:21:55,462 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:21:55,462 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:21:55,462 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:21:55,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:21:55,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:21:55,476 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:21:55,476 INFO L82 PathProgramCache]: Analyzing trace with hash 1594173083, now seen corresponding path program 1 times [2018-11-28 23:21:55,476 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:21:55,476 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:21:55,477 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:21:55,477 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:21:55,477 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:21:55,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:21:55,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:21:55,709 WARN L180 SmtUtils]: Spent 199.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 45 [2018-11-28 23:21:56,176 WARN L180 SmtUtils]: Spent 417.00 ms on a formula simplification. DAG size of input: 116 DAG size of output: 100 [2018-11-28 23:21:56,363 WARN L180 SmtUtils]: Spent 184.00 ms on a formula simplification that was a NOOP. DAG size: 92 [2018-11-28 23:21:56,366 INFO L216 LassoAnalysis]: Preferences: [2018-11-28 23:21:56,366 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-28 23:21:56,366 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-28 23:21:56,366 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-28 23:21:56,366 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-28 23:21:56,366 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 23:21:56,366 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-28 23:21:56,367 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-28 23:21:56,367 INFO L131 ssoRankerPreferences]: Filename of dumped script: substring-alloca_true-termination.c.i_Iteration3_Lasso [2018-11-28 23:21:56,367 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-28 23:21:56,367 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-28 23:21:56,372 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:21:56,377 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:21:56,378 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:21:56,380 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:21:56,411 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:21:56,412 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:21:56,418 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:21:56,867 WARN L180 SmtUtils]: Spent 256.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 82 [2018-11-28 23:21:57,068 WARN L180 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 60 [2018-11-28 23:21:57,069 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:21:57,072 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:21:57,074 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:21:57,106 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:21:57,110 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:21:57,113 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:21:57,117 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:21:57,125 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:21:57,127 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:21:57,133 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:21:57,135 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:21:57,138 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:21:57,144 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:21:57,150 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:21:57,159 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:21:57,163 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:21:57,170 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:21:57,405 WARN L180 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 41 DAG size of output: 37 [2018-11-28 23:21:57,683 WARN L180 SmtUtils]: Spent 115.00 ms on a formula simplification that was a NOOP. DAG size: 19 [2018-11-28 23:21:58,245 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-28 23:21:58,245 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-28 23:21:58,249 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:21:58,250 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:21:58,250 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:21:58,250 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:21:58,250 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:21:58,250 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:21:58,254 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:21:58,254 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:21:58,255 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:21:58,259 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:21:58,259 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:21:58,259 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:21:58,260 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:21:58,260 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:21:58,260 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:21:58,260 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:21:58,260 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:21:58,264 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:21:58,265 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:21:58,265 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:21:58,265 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:21:58,265 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:21:58,266 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:21:58,271 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:21:58,272 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:21:58,278 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:21:58,280 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:21:58,284 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:21:58,285 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:21:58,285 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:21:58,285 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:21:58,285 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:21:58,286 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:21:58,286 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:21:58,289 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:21:58,292 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:21:58,292 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:21:58,293 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:21:58,293 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:21:58,293 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:21:58,293 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:21:58,293 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:21:58,294 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:21:58,294 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:21:58,299 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:21:58,300 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:21:58,300 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:21:58,300 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:21:58,300 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:21:58,300 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:21:58,300 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:21:58,301 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:21:58,301 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:21:58,305 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:21:58,305 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:21:58,306 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-28 23:21:58,306 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:21:58,306 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:21:58,314 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-28 23:21:58,315 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:21:58,340 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:21:58,341 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:21:58,343 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:21:58,344 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:21:58,344 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:21:58,344 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:21:58,345 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:21:58,345 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:21:58,353 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:21:58,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 [2018-11-28 23:21:58,359 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:21:58,359 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:21:58,359 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:21:58,359 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:21:58,365 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:21:58,365 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:21:58,426 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-28 23:21:58,489 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2018-11-28 23:21:58,490 INFO L444 ModelExtractionUtils]: 36 out of 43 variables were initially zero. Simplification set additionally 4 variables to zero. [2018-11-28 23:21:58,490 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-28 23:21:58,492 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-28 23:21:58,493 INFO L518 LassoAnalysis]: Proved termination. [2018-11-28 23:21:58,494 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_main_~nondetString1~0.base)_1, ULTIMATE.start_substring_~pt~0.offset) = 1*v_rep(select #length ULTIMATE.start_main_~nondetString1~0.base)_1 - 1*ULTIMATE.start_substring_~pt~0.offset Supporting invariants [] [2018-11-28 23:21:58,841 INFO L297 tatePredicateManager]: 20 out of 23 supporting invariants were superfluous and have been removed [2018-11-28 23:21:58,875 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2018-11-28 23:21:58,903 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:21:58,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:21:58,924 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:21:58,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:21:58,959 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:21:59,085 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 23:21:59,085 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 2 loop predicates [2018-11-28 23:21:59,086 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 17 states and 24 transitions. cyclomatic complexity: 9 Second operand 5 states. [2018-11-28 23:21:59,173 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 17 states and 24 transitions. cyclomatic complexity: 9. Second operand 5 states. Result 59 states and 76 transitions. Complement of second has 8 states. [2018-11-28 23:21:59,175 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 2 stem states 2 non-accepting loop states 1 accepting loop states [2018-11-28 23:21:59,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-28 23:21:59,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 23 transitions. [2018-11-28 23:21:59,176 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 23 transitions. Stem has 7 letters. Loop has 3 letters. [2018-11-28 23:21:59,176 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:21:59,176 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 23 transitions. Stem has 10 letters. Loop has 3 letters. [2018-11-28 23:21:59,176 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:21:59,176 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 23 transitions. Stem has 7 letters. Loop has 6 letters. [2018-11-28 23:21:59,177 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:21:59,177 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 59 states and 76 transitions. [2018-11-28 23:21:59,180 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2018-11-28 23:21:59,184 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 59 states to 48 states and 64 transitions. [2018-11-28 23:21:59,184 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 17 [2018-11-28 23:21:59,184 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 18 [2018-11-28 23:21:59,184 INFO L73 IsDeterministic]: Start isDeterministic. Operand 48 states and 64 transitions. [2018-11-28 23:21:59,185 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-28 23:21:59,185 INFO L705 BuchiCegarLoop]: Abstraction has 48 states and 64 transitions. [2018-11-28 23:21:59,186 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states and 64 transitions. [2018-11-28 23:21:59,189 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 37. [2018-11-28 23:21:59,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2018-11-28 23:21:59,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 51 transitions. [2018-11-28 23:21:59,191 INFO L728 BuchiCegarLoop]: Abstraction has 37 states and 51 transitions. [2018-11-28 23:21:59,191 INFO L608 BuchiCegarLoop]: Abstraction has 37 states and 51 transitions. [2018-11-28 23:21:59,191 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2018-11-28 23:21:59,192 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 37 states and 51 transitions. [2018-11-28 23:21:59,194 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2018-11-28 23:21:59,194 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 23:21:59,195 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 23:21:59,195 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 23:21:59,195 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-11-28 23:21:59,195 INFO L794 eck$LassoCheckResult]: Stem: 406#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 404#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; 405#L565 assume !(main_~length1~0 < 1); 407#L565-2 assume !(main_~length2~0 < 1); 408#L568-1 call main_#t~malloc13.base, main_#t~malloc13.offset := #Ultimate.alloc(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.alloc(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; 411#L550-3 call substring_#t~mem2 := read~int(substring_~ps~0.base, substring_~ps~0.offset, 1); 413#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; 422#L553-5 call substring_#t~mem3 := read~int(substring_~pt~0.base, substring_~pt~0.offset, 1);substring_#t~short6 := 0 != substring_#t~mem3; 401#L553-1 [2018-11-28 23:21:59,195 INFO L796 eck$LassoCheckResult]: Loop: 401#L553-1 assume !substring_#t~short6; 417#L553-3 assume !!substring_#t~short6;havoc substring_#t~mem3;havoc substring_#t~mem4;havoc substring_#t~short6;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; 400#L553-5 call substring_#t~mem3 := read~int(substring_~pt~0.base, substring_~pt~0.offset, 1);substring_#t~short6 := 0 != substring_#t~mem3; 401#L553-1 [2018-11-28 23:21:59,196 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:21:59,196 INFO L82 PathProgramCache]: Analyzing trace with hash 180429619, now seen corresponding path program 1 times [2018-11-28 23:21:59,196 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:21:59,196 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:21:59,197 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:21:59,197 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:21:59,197 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:21:59,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:21:59,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:21:59,219 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:21:59,220 INFO L82 PathProgramCache]: Analyzing trace with hash 64727, now seen corresponding path program 1 times [2018-11-28 23:21:59,220 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:21:59,220 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:21:59,221 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:21:59,221 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:21:59,221 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:21:59,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:21:59,278 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 23:21:59,278 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 23:21:59,279 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-28 23:21:59,279 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-11-28 23:21:59,279 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 23:21:59,279 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 23:21:59,281 INFO L87 Difference]: Start difference. First operand 37 states and 51 transitions. cyclomatic complexity: 20 Second operand 3 states. [2018-11-28 23:21:59,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 23:21:59,388 INFO L93 Difference]: Finished difference Result 35 states and 44 transitions. [2018-11-28 23:21:59,390 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 23:21:59,390 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 35 states and 44 transitions. [2018-11-28 23:21:59,392 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-11-28 23:21:59,392 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 35 states to 25 states and 32 transitions. [2018-11-28 23:21:59,392 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2018-11-28 23:21:59,392 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2018-11-28 23:21:59,393 INFO L73 IsDeterministic]: Start isDeterministic. Operand 25 states and 32 transitions. [2018-11-28 23:21:59,397 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-28 23:21:59,397 INFO L705 BuchiCegarLoop]: Abstraction has 25 states and 32 transitions. [2018-11-28 23:21:59,397 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states and 32 transitions. [2018-11-28 23:21:59,400 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 23. [2018-11-28 23:21:59,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2018-11-28 23:21:59,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 30 transitions. [2018-11-28 23:21:59,403 INFO L728 BuchiCegarLoop]: Abstraction has 23 states and 30 transitions. [2018-11-28 23:21:59,404 INFO L608 BuchiCegarLoop]: Abstraction has 23 states and 30 transitions. [2018-11-28 23:21:59,405 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2018-11-28 23:21:59,405 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 23 states and 30 transitions. [2018-11-28 23:21:59,406 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-11-28 23:21:59,406 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 23:21:59,406 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 23:21:59,410 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 23:21:59,410 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-11-28 23:21:59,411 INFO L794 eck$LassoCheckResult]: Stem: 491#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 482#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; 483#L565 assume !(main_~length1~0 < 1); 492#L565-2 assume !(main_~length2~0 < 1); 493#L568-1 call main_#t~malloc13.base, main_#t~malloc13.offset := #Ultimate.alloc(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.alloc(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; 484#L550-3 call substring_#t~mem2 := read~int(substring_~ps~0.base, substring_~ps~0.offset, 1); 485#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; 498#L553-5 call substring_#t~mem3 := read~int(substring_~pt~0.base, substring_~pt~0.offset, 1);substring_#t~short6 := 0 != substring_#t~mem3; 495#L553-1 assume !substring_#t~short6; 496#L553-3 assume !substring_#t~short6;havoc substring_#t~mem3;havoc substring_#t~mem4;havoc substring_#t~short6;havoc substring_#t~mem5; 489#L553-6 call substring_#t~mem9 := read~int(substring_~pt~0.base, substring_~pt~0.offset, 1); 490#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; 486#L550-3 call substring_#t~mem2 := read~int(substring_~ps~0.base, substring_~ps~0.offset, 1); 487#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; 478#L553-5 [2018-11-28 23:21:59,411 INFO L796 eck$LassoCheckResult]: Loop: 478#L553-5 call substring_#t~mem3 := read~int(substring_~pt~0.base, substring_~pt~0.offset, 1);substring_#t~short6 := 0 != substring_#t~mem3; 479#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; 494#L553-3 assume !!substring_#t~short6;havoc substring_#t~mem3;havoc substring_#t~mem4;havoc substring_#t~short6;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; 478#L553-5 [2018-11-28 23:21:59,411 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:21:59,411 INFO L82 PathProgramCache]: Analyzing trace with hash 2012026433, now seen corresponding path program 1 times [2018-11-28 23:21:59,411 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:21:59,411 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:21:59,417 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:21:59,418 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:21:59,418 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:21:59,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:21:59,718 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 23:21:59,718 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 23:21:59,718 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-28 23:21:59,719 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-28 23:21:59,719 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:21:59,719 INFO L82 PathProgramCache]: Analyzing trace with hash 59685, now seen corresponding path program 2 times [2018-11-28 23:21:59,719 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:21:59,719 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:21:59,722 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:21:59,723 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:21:59,723 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:21:59,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:21:59,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:21:59,908 WARN L180 SmtUtils]: Spent 175.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 45 [2018-11-28 23:21:59,942 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-28 23:21:59,942 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-11-28 23:21:59,943 INFO L87 Difference]: Start difference. First operand 23 states and 30 transitions. cyclomatic complexity: 10 Second operand 5 states. [2018-11-28 23:21:59,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 23:21:59,981 INFO L93 Difference]: Finished difference Result 26 states and 32 transitions. [2018-11-28 23:21:59,982 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-28 23:21:59,983 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 26 states and 32 transitions. [2018-11-28 23:21:59,984 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-11-28 23:21:59,984 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 26 states to 23 states and 28 transitions. [2018-11-28 23:21:59,984 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2018-11-28 23:21:59,985 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2018-11-28 23:21:59,985 INFO L73 IsDeterministic]: Start isDeterministic. Operand 23 states and 28 transitions. [2018-11-28 23:21:59,985 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-28 23:21:59,985 INFO L705 BuchiCegarLoop]: Abstraction has 23 states and 28 transitions. [2018-11-28 23:21:59,985 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states and 28 transitions. [2018-11-28 23:21:59,987 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2018-11-28 23:21:59,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2018-11-28 23:21:59,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 28 transitions. [2018-11-28 23:21:59,989 INFO L728 BuchiCegarLoop]: Abstraction has 23 states and 28 transitions. [2018-11-28 23:21:59,989 INFO L608 BuchiCegarLoop]: Abstraction has 23 states and 28 transitions. [2018-11-28 23:21:59,989 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2018-11-28 23:21:59,989 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 23 states and 28 transitions. [2018-11-28 23:21:59,991 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-11-28 23:21:59,991 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 23:21:59,991 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 23:21:59,992 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 23:21:59,992 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-11-28 23:21:59,992 INFO L794 eck$LassoCheckResult]: Stem: 552#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 541#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; 542#L565 assume !(main_~length1~0 < 1); 543#L565-2 assume !(main_~length2~0 < 1); 544#L568-1 call main_#t~malloc13.base, main_#t~malloc13.offset := #Ultimate.alloc(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.alloc(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; 545#L550-3 call substring_#t~mem2 := read~int(substring_~ps~0.base, substring_~ps~0.offset, 1); 546#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; 557#L553-5 call substring_#t~mem3 := read~int(substring_~pt~0.base, substring_~pt~0.offset, 1);substring_#t~short6 := 0 != substring_#t~mem3; 554#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; 555#L553-3 assume !substring_#t~short6;havoc substring_#t~mem3;havoc substring_#t~mem4;havoc substring_#t~short6;havoc substring_#t~mem5; 550#L553-6 call substring_#t~mem9 := read~int(substring_~pt~0.base, substring_~pt~0.offset, 1); 551#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; 547#L550-3 call substring_#t~mem2 := read~int(substring_~ps~0.base, substring_~ps~0.offset, 1); 548#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; 537#L553-5 [2018-11-28 23:21:59,992 INFO L796 eck$LassoCheckResult]: Loop: 537#L553-5 call substring_#t~mem3 := read~int(substring_~pt~0.base, substring_~pt~0.offset, 1);substring_#t~short6 := 0 != substring_#t~mem3; 538#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; 553#L553-3 assume !!substring_#t~short6;havoc substring_#t~mem3;havoc substring_#t~mem4;havoc substring_#t~short6;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; 537#L553-5 [2018-11-28 23:21:59,992 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:21:59,992 INFO L82 PathProgramCache]: Analyzing trace with hash 1954768131, now seen corresponding path program 2 times [2018-11-28 23:21:59,993 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:21:59,994 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:21:59,995 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:21:59,995 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 23:21:59,995 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:22:00,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:22:00,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:22:00,042 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:22:00,042 INFO L82 PathProgramCache]: Analyzing trace with hash 59685, now seen corresponding path program 3 times [2018-11-28 23:22:00,042 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:22:00,042 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:22:00,043 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:22:00,043 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 23:22:00,043 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:22:00,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:22:00,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:22:00,053 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:22:00,053 INFO L82 PathProgramCache]: Analyzing trace with hash -964145949, now seen corresponding path program 1 times [2018-11-28 23:22:00,053 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:22:00,053 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:22:00,054 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:22:00,054 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 23:22:00,054 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:22:00,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:22:00,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:22:00,894 WARN L180 SmtUtils]: Spent 801.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 45 [2018-11-28 23:22:01,699 WARN L180 SmtUtils]: Spent 767.00 ms on a formula simplification. DAG size of input: 180 DAG size of output: 143 [2018-11-28 23:22:01,903 WARN L180 SmtUtils]: Spent 174.00 ms on a formula simplification that was a NOOP. DAG size: 108 [2018-11-28 23:22:01,905 INFO L216 LassoAnalysis]: Preferences: [2018-11-28 23:22:01,905 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-28 23:22:01,905 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-28 23:22:01,905 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-28 23:22:01,905 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-28 23:22:01,905 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 23:22:01,906 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-28 23:22:01,906 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-28 23:22:01,906 INFO L131 ssoRankerPreferences]: Filename of dumped script: substring-alloca_true-termination.c.i_Iteration6_Lasso [2018-11-28 23:22:01,906 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-28 23:22:01,906 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-28 23:22:01,911 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:22:01,922 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:22:01,923 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:22:01,925 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:22:01,926 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:22:01,929 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:22:01,931 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:22:01,933 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:22:01,936 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:22:01,939 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:22:01,941 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:22:01,945 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:22:01,947 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:22:01,949 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:22:01,952 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:22:01,959 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:22:01,960 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:22:02,728 WARN L180 SmtUtils]: Spent 412.00 ms on a formula simplification. DAG size of input: 116 DAG size of output: 96 [2018-11-28 23:22:03,067 WARN L180 SmtUtils]: Spent 248.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 71 [2018-11-28 23:22:03,068 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:22:03,077 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:22:03,079 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:22:03,081 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:22:03,083 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:22:03,086 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:22:03,090 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:22:03,093 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:22:03,517 WARN L180 SmtUtils]: Spent 187.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 55 [2018-11-28 23:22:04,135 WARN L180 SmtUtils]: Spent 428.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 39 [2018-11-28 23:22:04,458 WARN L180 SmtUtils]: Spent 109.00 ms on a formula simplification that was a NOOP. DAG size: 44 [2018-11-28 23:22:04,481 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-28 23:22:04,481 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-28 23:22:04,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 [2018-11-28 23:22:04,482 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:22:04,482 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:22:04,482 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:22:04,482 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:22:04,487 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:22:04,487 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:22:04,489 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:22:04,490 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:22:04,490 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:22:04,490 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:22:04,491 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:22:04,491 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:22:04,491 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:22:04,491 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:22:04,491 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:22:04,492 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:22:04,492 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:22:04,492 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:22:04,492 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:22:04,492 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:22:04,499 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:22:04,499 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:22:04,499 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:22:04,499 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:22:04,500 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:22:04,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 [2018-11-28 23:22:04,500 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:22:04,500 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:22:04,504 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:22:04,504 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:22:04,504 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:22:04,504 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:22:04,505 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:22:04,505 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:22:04,508 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:22:04,510 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:22:04,510 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:22:04,510 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:22:04,510 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:22:04,510 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:22:04,511 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:22:04,511 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:22:04,512 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:22:04,512 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:22:04,513 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:22:04,516 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:22:04,516 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:22:04,516 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:22:04,516 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:22:04,517 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:22:04,517 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:22:04,517 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:22:04,518 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:22:04,518 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:22:04,518 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:22:04,518 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:22:04,518 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:22:04,523 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:22:04,523 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:22:04,524 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:22:04,525 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:22:04,525 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:22:04,525 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:22:04,525 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:22:04,525 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:22:04,526 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:22:04,529 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:22:04,529 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:22:04,530 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:22:04,530 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:22:04,531 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:22:04,531 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:22:04,531 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:22:04,531 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:22:04,532 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:22:04,534 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:22:04,535 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:22:04,536 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:22:04,536 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:22:04,536 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:22:04,536 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:22:04,536 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:22:04,536 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:22:04,540 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:22:04,540 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:22:04,540 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:22:04,541 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:22:04,541 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:22:04,541 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:22:04,541 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:22:04,545 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:22:04,545 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:22:04,546 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:22:04,547 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:22:04,547 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:22:04,547 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:22:04,547 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:22:04,548 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:22:04,548 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:22:04,548 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:22:04,548 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:22:04,548 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:22:04,552 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:22:04,552 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:22:04,553 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:22:04,553 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:22:04,553 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:22:04,553 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:22:04,553 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:22:04,555 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:22:04,555 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:22:04,556 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:22:04,556 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:22:04,556 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:22:04,557 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:22:04,560 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:22:04,560 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:22:04,560 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:22:04,560 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:22:04,561 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:22:04,561 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:22:04,561 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:22:04,566 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:22:04,566 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:22:04,566 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:22:04,566 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:22:04,567 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:22:04,567 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:22:04,567 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:22:04,568 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:22:04,568 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:22:04,569 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:22:04,569 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:22:04,569 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:22:04,569 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:22:04,569 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:22:04,569 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:22:04,570 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:22:04,570 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:22:04,570 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:22:04,572 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:22:04,573 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:22:04,573 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:22:04,573 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:22:04,576 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:22:04,576 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:22:04,585 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:22:04,585 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:22:04,586 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:22:04,586 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-28 23:22:04,586 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:22:04,586 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:22:04,587 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-28 23:22:04,588 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:22:04,605 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:22:04,605 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:22:04,606 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:22:04,606 INFO L205 nArgumentSynthesizer]: 12 stem disjuncts [2018-11-28 23:22:04,606 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-28 23:22:04,606 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:22:04,619 INFO L402 nArgumentSynthesizer]: We have 60 Motzkin's Theorem applications. [2018-11-28 23:22:04,619 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2018-11-28 23:22:04,651 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:22:04,651 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:22:04,652 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:22:04,652 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:22:04,652 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:22:04,652 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:22:04,657 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:22:04,657 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:22:04,662 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:22:04,662 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:22:04,662 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:22:04,663 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:22:04,663 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:22:04,663 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:22:04,663 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:22:04,663 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:22:04,668 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:22:04,669 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:22:04,669 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:22:04,669 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:22:04,669 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:22:04,669 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:22:04,670 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:22:04,670 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:22:04,674 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:22:04,675 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:22:04,675 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:22:04,675 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:22:04,675 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:22:04,678 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:22:04,679 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:22:04,679 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:22:04,680 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:22:04,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 [2018-11-28 23:22:04,681 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:22:04,684 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-28 23:22:04,684 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:22:04,684 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:22:04,687 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-28 23:22:04,687 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:22:04,695 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:22:04,695 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:22:04,696 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:22:04,696 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:22:04,696 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:22:04,696 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:22:04,702 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:22:04,702 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:22:04,742 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-28 23:22:04,767 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2018-11-28 23:22:04,767 INFO L444 ModelExtractionUtils]: 54 out of 58 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-11-28 23:22:04,767 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-28 23:22:04,768 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-28 23:22:04,768 INFO L518 LassoAnalysis]: Proved termination. [2018-11-28 23:22:04,768 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 [] [2018-11-28 23:22:05,185 INFO L297 tatePredicateManager]: 43 out of 45 supporting invariants were superfluous and have been removed [2018-11-28 23:22:05,191 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2018-11-28 23:22:05,215 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:22:05,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:22:05,249 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:22:05,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:22:05,284 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:22:05,306 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 23:22:05,307 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 2 loop predicates [2018-11-28 23:22:05,307 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 23 states and 28 transitions. cyclomatic complexity: 8 Second operand 5 states. [2018-11-28 23:22:05,384 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 23 states and 28 transitions. cyclomatic complexity: 8. Second operand 5 states. Result 37 states and 43 transitions. Complement of second has 8 states. [2018-11-28 23:22:05,386 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 2 stem states 2 non-accepting loop states 1 accepting loop states [2018-11-28 23:22:05,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-28 23:22:05,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 16 transitions. [2018-11-28 23:22:05,386 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 16 transitions. Stem has 14 letters. Loop has 3 letters. [2018-11-28 23:22:05,387 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:22:05,387 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-28 23:22:05,405 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:22:05,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:22:05,442 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:22:05,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:22:05,463 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:22:05,479 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 23:22:05,480 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.2 stem predicates 2 loop predicates [2018-11-28 23:22:05,480 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 23 states and 28 transitions. cyclomatic complexity: 8 Second operand 5 states. [2018-11-28 23:22:05,533 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 23 states and 28 transitions. cyclomatic complexity: 8. Second operand 5 states. Result 37 states and 43 transitions. Complement of second has 8 states. [2018-11-28 23:22:05,534 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 2 stem states 2 non-accepting loop states 1 accepting loop states [2018-11-28 23:22:05,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-28 23:22:05,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 16 transitions. [2018-11-28 23:22:05,535 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 16 transitions. Stem has 14 letters. Loop has 3 letters. [2018-11-28 23:22:05,535 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:22:05,535 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-28 23:22:05,597 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:22:05,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:22:05,625 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:22:05,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:22:05,648 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:22:05,663 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 23:22:05,664 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.2 stem predicates 2 loop predicates [2018-11-28 23:22:05,664 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 23 states and 28 transitions. cyclomatic complexity: 8 Second operand 5 states. [2018-11-28 23:22:05,725 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 23 states and 28 transitions. cyclomatic complexity: 8. Second operand 5 states. Result 37 states and 44 transitions. Complement of second has 7 states. [2018-11-28 23:22:05,726 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 2 stem states 2 non-accepting loop states 1 accepting loop states [2018-11-28 23:22:05,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-28 23:22:05,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 23 transitions. [2018-11-28 23:22:05,726 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 23 transitions. Stem has 14 letters. Loop has 3 letters. [2018-11-28 23:22:05,727 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:22:05,727 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 23 transitions. Stem has 17 letters. Loop has 3 letters. [2018-11-28 23:22:05,727 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:22:05,727 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 23 transitions. Stem has 14 letters. Loop has 6 letters. [2018-11-28 23:22:05,728 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:22:05,728 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 37 states and 44 transitions. [2018-11-28 23:22:05,732 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-28 23:22:05,732 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 37 states to 0 states and 0 transitions. [2018-11-28 23:22:05,732 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2018-11-28 23:22:05,733 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2018-11-28 23:22:05,733 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2018-11-28 23:22:05,733 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-28 23:22:05,733 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-28 23:22:05,733 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-28 23:22:05,733 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-28 23:22:05,733 INFO L442 BuchiCegarLoop]: ======== Iteration 7============ [2018-11-28 23:22:05,733 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2018-11-28 23:22:05,733 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-28 23:22:05,733 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2018-11-28 23:22:05,746 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 28.11 11:22:05 BoogieIcfgContainer [2018-11-28 23:22:05,747 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-11-28 23:22:05,748 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-28 23:22:05,748 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-28 23:22:05,749 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-28 23:22:05,749 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 11:21:50" (3/4) ... [2018-11-28 23:22:05,755 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-11-28 23:22:05,756 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-28 23:22:05,757 INFO L168 Benchmark]: Toolchain (without parser) took 16598.06 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 319.3 MB). Free memory was 951.4 MB in the beginning and 947.3 MB in the end (delta: 4.1 MB). Peak memory consumption was 323.4 MB. Max. memory is 11.5 GB. [2018-11-28 23:22:05,760 INFO L168 Benchmark]: CDTParser took 0.20 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. [2018-11-28 23:22:05,761 INFO L168 Benchmark]: CACSL2BoogieTranslator took 573.16 ms. Allocated memory is still 1.0 GB. Free memory was 951.4 MB in the beginning and 929.9 MB in the end (delta: 21.5 MB). Peak memory consumption was 21.5 MB. Max. memory is 11.5 GB. [2018-11-28 23:22:05,762 INFO L168 Benchmark]: Boogie Procedure Inliner took 136.81 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 132.6 MB). Free memory was 929.9 MB in the beginning and 1.1 GB in the end (delta: -189.2 MB). Peak memory consumption was 14.1 MB. Max. memory is 11.5 GB. [2018-11-28 23:22:05,763 INFO L168 Benchmark]: Boogie Preprocessor took 40.99 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. [2018-11-28 23:22:05,763 INFO L168 Benchmark]: RCFGBuilder took 496.76 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: 18.8 MB). Peak memory consumption was 18.8 MB. Max. memory is 11.5 GB. [2018-11-28 23:22:05,764 INFO L168 Benchmark]: BuchiAutomizer took 15335.58 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 186.6 MB). Free memory was 1.1 GB in the beginning and 947.3 MB in the end (delta: 153.0 MB). Peak memory consumption was 339.7 MB. Max. memory is 11.5 GB. [2018-11-28 23:22:05,766 INFO L168 Benchmark]: Witness Printer took 7.77 ms. Allocated memory is still 1.3 GB. Free memory is still 947.3 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-28 23:22:05,771 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.20 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 573.16 ms. Allocated memory is still 1.0 GB. Free memory was 951.4 MB in the beginning and 929.9 MB in the end (delta: 21.5 MB). Peak memory consumption was 21.5 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 136.81 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 132.6 MB). Free memory was 929.9 MB in the beginning and 1.1 GB in the end (delta: -189.2 MB). Peak memory consumption was 14.1 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 40.99 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 496.76 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: 18.8 MB). Peak memory consumption was 18.8 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 15335.58 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 186.6 MB). Free memory was 1.1 GB in the beginning and 947.3 MB in the end (delta: 153.0 MB). Peak memory consumption was 339.7 MB. Max. memory is 11.5 GB. * Witness Printer took 7.77 ms. Allocated memory is still 1.3 GB. Free memory is still 947.3 MB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 6 terminating modules (3 trivial, 2 deterministic, 1 nondeterministic). One deterministic module has affine ranking function unknown-#length-unknown[__builtin_alloca (length1 * sizeof(char))] + -1 * ps and consists of 3 locations. One deterministic module has affine ranking function unknown-#length-unknown[nondetString1] + -1 * pt and consists of 5 locations. One nondeterministic module has affine ranking function unknown-#length-unknown[nondetString1] + -1 * ps2 and consists of 5 locations. 3 modules have a trivial ranking function, the largest among these consists of 5 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 15.2s and 7 iterations. TraceHistogramMax:2. Analysis of lassos took 13.7s. Construction of modules took 0.3s. Büchi inclusion checks took 1.0s. Highest rank in rank-based complementation 3. Minimization of det autom 2. Minimization of nondet autom 4. Automata minimization 0.0s AutomataMinimizationTime, 5 MinimizatonAttempts, 13 StatesRemovedByMinimization, 2 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 37 states and ocurred in iteration 3. Nontrivial modules had stage [2, 0, 1, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 103 SDtfs, 95 SDslu, 60 SDs, 0 SdLazy, 104 SolverSat, 31 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.3s Time LassoAnalysisResults: nont0 unkn0 SFLI2 SFLT0 conc0 concLT0 SILN0 SILU1 SILI0 SILT0 lasso3 LassoPreprocessingBenchmarks: Lassos: inital249 mio100 ax107 hnf99 lsp89 ukn85 mio100 lsp38 div100 bol100 ite100 ukn100 eq189 hnf88 smp95 dnf192 smp75 tf100 neg91 sie118 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 45ms 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...