./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/termination-memory-alloca/substring-alloca_true-termination.c.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 0cd3be1d Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_168aced9-166e-4fe3-9d78-1e2474c48217/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_168aced9-166e-4fe3-9d78-1e2474c48217/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_168aced9-166e-4fe3-9d78-1e2474c48217/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_168aced9-166e-4fe3-9d78-1e2474c48217/bin-2019/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/termination-memory-alloca/substring-alloca_true-termination.c.i -s /tmp/vcloud-vcloud-master/worker/working_dir_168aced9-166e-4fe3-9d78-1e2474c48217/bin-2019/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_168aced9-166e-4fe3-9d78-1e2474c48217/bin-2019/uautomizer --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash 29f46a81991b9bc0fef856343662e1cc264d2d45 ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-0cd3be1 [2018-11-28 13:08:54,194 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-28 13:08:54,195 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-28 13:08:54,203 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-28 13:08:54,203 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-28 13:08:54,204 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-28 13:08:54,205 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-28 13:08:54,206 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-28 13:08:54,207 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-28 13:08:54,208 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-28 13:08:54,208 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-28 13:08:54,208 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-28 13:08:54,209 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-28 13:08:54,210 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-28 13:08:54,210 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-28 13:08:54,211 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-28 13:08:54,211 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-28 13:08:54,212 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-28 13:08:54,213 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-28 13:08:54,214 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-28 13:08:54,215 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-28 13:08:54,216 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-28 13:08:54,217 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-28 13:08:54,217 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-28 13:08:54,217 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-28 13:08:54,217 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-28 13:08:54,218 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-28 13:08:54,218 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-28 13:08:54,218 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-28 13:08:54,219 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-28 13:08:54,219 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-28 13:08:54,219 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-28 13:08:54,220 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-28 13:08:54,220 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-28 13:08:54,220 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-28 13:08:54,220 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-28 13:08:54,221 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_168aced9-166e-4fe3-9d78-1e2474c48217/bin-2019/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf [2018-11-28 13:08:54,229 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-28 13:08:54,229 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-28 13:08:54,230 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-28 13:08:54,230 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-28 13:08:54,230 INFO L133 SettingsManager]: * Use SBE=true [2018-11-28 13:08:54,230 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-11-28 13:08:54,231 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-11-28 13:08:54,231 INFO L133 SettingsManager]: * Use old map elimination=false [2018-11-28 13:08:54,231 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-11-28 13:08:54,231 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-11-28 13:08:54,231 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-11-28 13:08:54,231 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-28 13:08:54,231 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-28 13:08:54,232 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-28 13:08:54,232 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-28 13:08:54,232 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-11-28 13:08:54,232 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-11-28 13:08:54,232 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-11-28 13:08:54,232 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-28 13:08:54,232 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-11-28 13:08:54,233 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-28 13:08:54,233 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-11-28 13:08:54,233 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-28 13:08:54,233 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-28 13:08:54,233 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-11-28 13:08:54,233 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-28 13:08:54,233 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-28 13:08:54,234 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-11-28 13:08:54,234 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-11-28 13:08:54,234 INFO L133 SettingsManager]: * TransformationType=MODULO_NEIGHBOR Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud-vcloud-master/worker/working_dir_168aced9-166e-4fe3-9d78-1e2474c48217/bin-2019/uautomizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(F end) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 29f46a81991b9bc0fef856343662e1cc264d2d45 [2018-11-28 13:08:54,256 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-28 13:08:54,265 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-28 13:08:54,267 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-28 13:08:54,268 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-28 13:08:54,268 INFO L276 PluginConnector]: CDTParser initialized [2018-11-28 13:08:54,269 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_168aced9-166e-4fe3-9d78-1e2474c48217/bin-2019/uautomizer/../../sv-benchmarks/c/termination-memory-alloca/substring-alloca_true-termination.c.i [2018-11-28 13:08:54,306 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_168aced9-166e-4fe3-9d78-1e2474c48217/bin-2019/uautomizer/data/571791cfc/b946accb36124abdbeb0ef5018803447/FLAGe6c474b3d [2018-11-28 13:08:54,723 INFO L307 CDTParser]: Found 1 translation units. [2018-11-28 13:08:54,724 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_168aced9-166e-4fe3-9d78-1e2474c48217/sv-benchmarks/c/termination-memory-alloca/substring-alloca_true-termination.c.i [2018-11-28 13:08:54,731 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_168aced9-166e-4fe3-9d78-1e2474c48217/bin-2019/uautomizer/data/571791cfc/b946accb36124abdbeb0ef5018803447/FLAGe6c474b3d [2018-11-28 13:08:54,741 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_168aced9-166e-4fe3-9d78-1e2474c48217/bin-2019/uautomizer/data/571791cfc/b946accb36124abdbeb0ef5018803447 [2018-11-28 13:08:54,743 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-28 13:08:54,744 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-28 13:08:54,745 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-28 13:08:54,745 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-28 13:08:54,747 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-28 13:08:54,748 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 01:08:54" (1/1) ... [2018-11-28 13:08:54,750 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5717fb9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 01:08:54, skipping insertion in model container [2018-11-28 13:08:54,750 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 01:08:54" (1/1) ... [2018-11-28 13:08:54,756 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-28 13:08:54,782 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-28 13:08:54,959 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-11-28 13:08:55,012 INFO L191 MainTranslator]: Completed pre-run [2018-11-28 13:08:55,040 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-11-28 13:08:55,071 INFO L195 MainTranslator]: Completed translation [2018-11-28 13:08:55,071 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 01:08:55 WrapperNode [2018-11-28 13:08:55,071 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-28 13:08:55,072 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-28 13:08:55,072 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-28 13:08:55,072 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-28 13:08:55,079 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 01:08:55" (1/1) ... [2018-11-28 13:08:55,087 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 01:08:55" (1/1) ... [2018-11-28 13:08:55,101 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-28 13:08:55,101 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-28 13:08:55,101 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-28 13:08:55,101 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-28 13:08:55,107 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 01:08:55" (1/1) ... [2018-11-28 13:08:55,107 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 01:08:55" (1/1) ... [2018-11-28 13:08:55,108 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 01:08:55" (1/1) ... [2018-11-28 13:08:55,109 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 01:08:55" (1/1) ... [2018-11-28 13:08:55,112 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 01:08:55" (1/1) ... [2018-11-28 13:08:55,115 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 01:08:55" (1/1) ... [2018-11-28 13:08:55,116 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 01:08:55" (1/1) ... [2018-11-28 13:08:55,117 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-28 13:08:55,117 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-28 13:08:55,118 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-28 13:08:55,118 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-28 13:08:55,118 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 01:08:55" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_168aced9-166e-4fe3-9d78-1e2474c48217/bin-2019/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 13:08:55,154 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-28 13:08:55,154 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-28 13:08:55,154 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-28 13:08:55,154 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-28 13:08:55,154 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-28 13:08:55,155 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-28 13:08:55,362 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-28 13:08:55,362 INFO L280 CfgBuilder]: Removed 8 assue(true) statements. [2018-11-28 13:08:55,363 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 01:08:55 BoogieIcfgContainer [2018-11-28 13:08:55,363 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-28 13:08:55,363 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-11-28 13:08:55,363 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-11-28 13:08:55,366 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-11-28 13:08:55,367 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-28 13:08:55,367 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 28.11 01:08:54" (1/3) ... [2018-11-28 13:08:55,368 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@5eb5d52a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 28.11 01:08:55, skipping insertion in model container [2018-11-28 13:08:55,368 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-28 13:08:55,368 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 01:08:55" (2/3) ... [2018-11-28 13:08:55,369 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@5eb5d52a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 28.11 01:08:55, skipping insertion in model container [2018-11-28 13:08:55,369 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-28 13:08:55,369 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 01:08:55" (3/3) ... [2018-11-28 13:08:55,370 INFO L375 chiAutomizerObserver]: Analyzing ICFG substring-alloca_true-termination.c.i [2018-11-28 13:08:55,416 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-28 13:08:55,416 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-11-28 13:08:55,417 INFO L375 BuchiCegarLoop]: Hoare is false [2018-11-28 13:08:55,417 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-11-28 13:08:55,417 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-28 13:08:55,417 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-28 13:08:55,417 INFO L379 BuchiCegarLoop]: Difference is false [2018-11-28 13:08:55,417 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-28 13:08:55,417 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-11-28 13:08:55,429 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states. [2018-11-28 13:08:55,448 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2018-11-28 13:08:55,448 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 13:08:55,448 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 13:08:55,454 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2018-11-28 13:08:55,454 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2018-11-28 13:08:55,454 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-11-28 13:08:55,454 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states. [2018-11-28 13:08:55,455 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2018-11-28 13:08:55,456 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 13:08:55,456 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 13:08:55,456 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2018-11-28 13:08:55,456 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2018-11-28 13:08:55,463 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 13:08:55,464 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 13:08:55,468 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:08:55,469 INFO L82 PathProgramCache]: Analyzing trace with hash 28695878, now seen corresponding path program 1 times [2018-11-28 13:08:55,470 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:08:55,471 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:08:55,517 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:08:55,517 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:08:55,517 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:08:55,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 13:08:55,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 13:08:55,585 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:08:55,585 INFO L82 PathProgramCache]: Analyzing trace with hash 47887114, now seen corresponding path program 1 times [2018-11-28 13:08:55,585 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:08:55,585 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:08:55,586 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:08:55,586 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:08:55,586 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:08:55,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:08:55,613 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 13:08:55,615 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 13:08:55,615 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-28 13:08:55,618 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-11-28 13:08:55,627 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-28 13:08:55,627 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-28 13:08:55,629 INFO L87 Difference]: Start difference. First operand 17 states. Second operand 2 states. [2018-11-28 13:08:55,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:08:55,633 INFO L93 Difference]: Finished difference Result 17 states and 22 transitions. [2018-11-28 13:08:55,633 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-28 13:08:55,634 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 17 states and 22 transitions. [2018-11-28 13:08:55,635 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2018-11-28 13:08:55,637 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 17 states to 12 states and 16 transitions. [2018-11-28 13:08:55,638 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 12 [2018-11-28 13:08:55,638 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 12 [2018-11-28 13:08:55,638 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 16 transitions. [2018-11-28 13:08:55,639 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-28 13:08:55,639 INFO L705 BuchiCegarLoop]: Abstraction has 12 states and 16 transitions. [2018-11-28 13:08:55,650 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states and 16 transitions. [2018-11-28 13:08:55,657 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2018-11-28 13:08:55,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-11-28 13:08:55,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 16 transitions. [2018-11-28 13:08:55,659 INFO L728 BuchiCegarLoop]: Abstraction has 12 states and 16 transitions. [2018-11-28 13:08:55,659 INFO L608 BuchiCegarLoop]: Abstraction has 12 states and 16 transitions. [2018-11-28 13:08:55,659 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-11-28 13:08:55,659 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 12 states and 16 transitions. [2018-11-28 13:08:55,660 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2018-11-28 13:08:55,660 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 13:08:55,660 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 13:08:55,660 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2018-11-28 13:08:55,661 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2018-11-28 13:08:55,661 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 13:08:55,661 INFO L796 eck$LassoCheckResult]: Loop: 51#L550-3 call substring_#t~mem2 := read~int(substring_~ps~0.base, substring_~ps~0.offset, 1); 52#L550-1 assume !!(0 != substring_#t~mem2);havoc substring_#t~mem2;substring_~ps2~0.base, substring_~ps2~0.offset := substring_~ps~0.base, substring_~ps~0.offset;substring_~pt~0.base, substring_~pt~0.offset := substring_~t.base, substring_~t.offset; 42#L553-5 call substring_#t~mem3 := read~int(substring_~pt~0.base, substring_~pt~0.offset, 1);substring_#t~short6 := 0 != substring_#t~mem3; 43#L553-1 assume substring_#t~short6;call substring_#t~mem4 := read~int(substring_~pt~0.base, substring_~pt~0.offset, 1);call substring_#t~mem5 := read~int(substring_~ps2~0.base, substring_~ps2~0.offset, 1);substring_#t~short6 := substring_#t~mem4 == substring_#t~mem5; 53#L553-3 assume !substring_#t~short6;havoc substring_#t~mem3;havoc substring_#t~mem4;havoc substring_#t~mem5;havoc substring_#t~short6; 46#L553-6 call substring_#t~mem9 := read~int(substring_~pt~0.base, substring_~pt~0.offset, 1); 47#L557 assume !(0 == substring_#t~mem9);havoc substring_#t~mem9;substring_#t~post10.base, substring_#t~post10.offset := substring_~ps~0.base, substring_~ps~0.offset;substring_~ps~0.base, substring_~ps~0.offset := substring_#t~post10.base, 1 + substring_#t~post10.offset;havoc substring_#t~post10.base, substring_#t~post10.offset; 51#L550-3 [2018-11-28 13:08:55,661 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:08:55,661 INFO L82 PathProgramCache]: Analyzing trace with hash 28695878, now seen corresponding path program 2 times [2018-11-28 13:08:55,661 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:08:55,662 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:08:55,663 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:08:55,663 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:08:55,663 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:08:55,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 13:08:55,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 13:08:55,690 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:08:55,690 INFO L82 PathProgramCache]: Analyzing trace with hash -1237496093, now seen corresponding path program 1 times [2018-11-28 13:08:55,691 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:08:55,691 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:08:55,692 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:08:55,692 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 13:08:55,692 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:08:55,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 13:08:55,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 13:08:55,709 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:08:55,709 INFO L82 PathProgramCache]: Analyzing trace with hash -1302992386, now seen corresponding path program 1 times [2018-11-28 13:08:55,709 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:08:55,710 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:08:55,710 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:08:55,711 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:08:55,711 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:08:55,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 13:08:55,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 13:08:55,905 WARN L180 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 60 [2018-11-28 13:08:56,150 WARN L180 SmtUtils]: Spent 180.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 84 [2018-11-28 13:08:56,237 INFO L216 LassoAnalysis]: Preferences: [2018-11-28 13:08:56,237 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-28 13:08:56,237 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-28 13:08:56,238 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-28 13:08:56,238 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-28 13:08:56,238 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 13:08:56,238 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-28 13:08:56,238 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-28 13:08:56,238 INFO L131 ssoRankerPreferences]: Filename of dumped script: substring-alloca_true-termination.c.i_Iteration2_Lasso [2018-11-28 13:08:56,238 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-28 13:08:56,239 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-28 13:08:56,256 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 13:08:56,260 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 13:08:56,262 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 13:08:56,265 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 13:08:56,465 WARN L180 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 62 [2018-11-28 13:08:56,542 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 13:08:56,543 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 13:08:56,544 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 13:08:56,546 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 13:08:56,551 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 13:08:56,552 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 13:08:56,553 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 13:08:56,554 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 13:08:56,556 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 13:08:56,557 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 13:08:56,558 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 13:08:56,559 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 13:08:56,561 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 13:08:56,562 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 13:08:56,564 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 13:08:56,565 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 13:08:56,566 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 13:08:56,567 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 13:08:56,569 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 13:08:56,923 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-28 13:08:56,928 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-28 13:08:56,930 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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 13:08:56,931 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:08:56,931 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 13:08:56,932 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:08:56,932 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:08:56,932 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:08:56,934 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 13:08:56,934 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 13:08:56,935 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:08:56,936 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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 13:08:56,936 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:08:56,936 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 13:08:56,937 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:08:56,937 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:08:56,937 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:08:56,937 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 13:08:56,937 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 13:08:56,938 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:08:56,938 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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 13:08:56,939 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:08:56,939 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:08:56,939 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:08:56,939 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:08:56,941 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 13:08:56,941 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 13:08:56,943 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:08:56,944 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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 13:08:56,944 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:08:56,944 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-28 13:08:56,944 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:08:56,945 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:08:56,949 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-28 13:08:56,949 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 13:08:56,967 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:08:56,967 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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 13:08:56,968 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:08:56,968 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 13:08:56,968 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:08:56,968 INFO L206 nArgumentSynthesizer]: 6 loop disjuncts [2018-11-28 13:08:56,969 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:08:56,970 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2018-11-28 13:08:56,971 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 13:08:56,981 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:08:56,982 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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 13:08:56,982 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:08:56,982 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:08:56,982 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:08:56,982 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:08:56,983 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 13:08:56,983 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 13:08:56,985 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:08:56,985 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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 13:08:56,986 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:08:56,986 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:08:56,986 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:08:56,986 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:08:56,987 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 13:08:56,987 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 13:08:56,989 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:08:56,990 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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 13:08:56,990 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:08:56,990 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 13:08:56,990 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:08:56,991 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:08:56,991 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:08:56,991 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 13:08:56,991 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 13:08:56,992 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:08:56,993 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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 13:08:56,993 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:08:56,993 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:08:56,993 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:08:56,994 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:08:56,996 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 13:08:56,996 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 13:08:57,016 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-28 13:08:57,034 INFO L443 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. [2018-11-28 13:08:57,034 INFO L444 ModelExtractionUtils]: 26 out of 31 variables were initially zero. Simplification set additionally 2 variables to zero. [2018-11-28 13:08:57,036 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-28 13:08:57,037 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-28 13:08:57,037 INFO L518 LassoAnalysis]: Proved termination. [2018-11-28 13:08:57,038 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 13:08:57,075 INFO L297 tatePredicateManager]: 8 out of 9 supporting invariants were superfluous and have been removed [2018-11-28 13:08:57,080 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2018-11-28 13:08:57,094 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:08:57,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:08:57,107 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 13:08:57,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:08:57,122 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 13:08:57,143 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 13:08:57,145 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 13:08:57,146 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 12 states and 16 transitions. cyclomatic complexity: 5 Second operand 3 states. [2018-11-28 13:08:57,186 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 13:08:57,187 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 13:08:57,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-28 13:08:57,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 16 transitions. [2018-11-28 13:08:57,189 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 16 transitions. Stem has 5 letters. Loop has 7 letters. [2018-11-28 13:08:57,190 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 13:08:57,190 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 16 transitions. Stem has 12 letters. Loop has 7 letters. [2018-11-28 13:08:57,190 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 13:08:57,190 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 16 transitions. Stem has 5 letters. Loop has 14 letters. [2018-11-28 13:08:57,190 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 13:08:57,190 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 19 states and 26 transitions. [2018-11-28 13:08:57,191 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-11-28 13:08:57,192 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 19 states to 17 states and 24 transitions. [2018-11-28 13:08:57,192 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9 [2018-11-28 13:08:57,192 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2018-11-28 13:08:57,192 INFO L73 IsDeterministic]: Start isDeterministic. Operand 17 states and 24 transitions. [2018-11-28 13:08:57,192 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-28 13:08:57,192 INFO L705 BuchiCegarLoop]: Abstraction has 17 states and 24 transitions. [2018-11-28 13:08:57,192 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states and 24 transitions. [2018-11-28 13:08:57,193 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2018-11-28 13:08:57,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-11-28 13:08:57,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 24 transitions. [2018-11-28 13:08:57,194 INFO L728 BuchiCegarLoop]: Abstraction has 17 states and 24 transitions. [2018-11-28 13:08:57,194 INFO L608 BuchiCegarLoop]: Abstraction has 17 states and 24 transitions. [2018-11-28 13:08:57,194 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-11-28 13:08:57,194 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states and 24 transitions. [2018-11-28 13:08:57,194 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-11-28 13:08:57,194 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 13:08:57,194 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 13:08:57,195 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2018-11-28 13:08:57,195 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-11-28 13:08:57,195 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 13:08:57,195 INFO L796 eck$LassoCheckResult]: Loop: 170#L553-5 call substring_#t~mem3 := read~int(substring_~pt~0.base, substring_~pt~0.offset, 1);substring_#t~short6 := 0 != substring_#t~mem3; 171#L553-1 assume substring_#t~short6;call substring_#t~mem4 := read~int(substring_~pt~0.base, substring_~pt~0.offset, 1);call substring_#t~mem5 := read~int(substring_~ps2~0.base, substring_~ps2~0.offset, 1);substring_#t~short6 := substring_#t~mem4 == substring_#t~mem5; 185#L553-3 assume !!substring_#t~short6;havoc substring_#t~mem3;havoc substring_#t~mem4;havoc substring_#t~mem5;havoc substring_#t~short6;substring_#t~post7.base, substring_#t~post7.offset := substring_~pt~0.base, substring_~pt~0.offset;substring_~pt~0.base, substring_~pt~0.offset := substring_#t~post7.base, 1 + substring_#t~post7.offset;havoc substring_#t~post7.base, substring_#t~post7.offset;substring_#t~post8.base, substring_#t~post8.offset := substring_~ps2~0.base, substring_~ps2~0.offset;substring_~ps2~0.base, substring_~ps2~0.offset := substring_#t~post8.base, 1 + substring_#t~post8.offset;havoc substring_#t~post8.base, substring_#t~post8.offset; 170#L553-5 [2018-11-28 13:08:57,195 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:08:57,195 INFO L82 PathProgramCache]: Analyzing trace with hash 1806935627, now seen corresponding path program 1 times [2018-11-28 13:08:57,195 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:08:57,196 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:08:57,196 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:08:57,197 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:08:57,197 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:08:57,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 13:08:57,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 13:08:57,216 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:08:57,216 INFO L82 PathProgramCache]: Analyzing trace with hash 59685, now seen corresponding path program 1 times [2018-11-28 13:08:57,216 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:08:57,216 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:08:57,217 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:08:57,217 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:08:57,217 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:08:57,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 13:08:57,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 13:08:57,225 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:08:57,225 INFO L82 PathProgramCache]: Analyzing trace with hash 1594173083, now seen corresponding path program 1 times [2018-11-28 13:08:57,225 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:08:57,225 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:08:57,226 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:08:57,226 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:08:57,226 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:08:57,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 13:08:57,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 13:08:57,553 WARN L180 SmtUtils]: Spent 206.00 ms on a formula simplification. DAG size of input: 116 DAG size of output: 100 [2018-11-28 13:08:57,628 INFO L216 LassoAnalysis]: Preferences: [2018-11-28 13:08:57,628 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-28 13:08:57,628 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-28 13:08:57,628 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-28 13:08:57,628 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-28 13:08:57,628 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 13:08:57,628 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-28 13:08:57,628 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-28 13:08:57,629 INFO L131 ssoRankerPreferences]: Filename of dumped script: substring-alloca_true-termination.c.i_Iteration3_Lasso [2018-11-28 13:08:57,629 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-28 13:08:57,629 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-28 13:08:57,632 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 13:08:57,635 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 13:08:57,636 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 13:08:57,637 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 13:08:57,638 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 13:08:57,639 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 13:08:57,641 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 13:08:57,853 WARN L180 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 82 [2018-11-28 13:08:57,932 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 13:08:57,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 13:08:57,934 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 13:08:57,935 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 13:08:57,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 13:08:57,937 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:08:57,938 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 13:08:57,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 13:08:57,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 13:08:57,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 13:08:57,943 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 13:08:57,943 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 13:08:57,944 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:08:57,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 13:08:57,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 13:08:57,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 13:08:57,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 13:08:58,317 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-28 13:08:58,318 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-28 13:08:58,318 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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 13:08:58,318 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:08:58,319 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 13:08:58,319 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:08:58,319 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:08:58,319 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:08:58,319 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 13:08:58,319 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 13:08:58,320 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:08:58,320 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 13:08:58,321 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:08:58,321 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 13:08:58,321 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:08:58,321 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:08:58,321 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:08:58,321 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 13:08:58,322 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 13:08:58,322 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:08:58,326 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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 13:08:58,326 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:08:58,326 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:08:58,326 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:08:58,327 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:08:58,327 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 13:08:58,327 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 13:08:58,329 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:08:58,329 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 13:08:58,329 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:08:58,329 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 13:08:58,330 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:08:58,330 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:08:58,330 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:08:58,330 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 13:08:58,330 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 13:08:58,331 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:08:58,331 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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 13:08:58,331 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:08:58,331 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 13:08:58,331 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:08:58,331 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:08:58,332 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:08:58,332 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 13:08:58,332 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 13:08:58,332 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:08:58,332 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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 13:08:58,333 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:08:58,333 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 13:08:58,333 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:08:58,333 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:08:58,333 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:08:58,333 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 13:08:58,334 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 13:08:58,334 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:08:58,334 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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 13:08:58,335 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:08:58,335 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-28 13:08:58,335 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:08:58,335 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:08:58,337 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-28 13:08:58,337 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 13:08:58,345 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:08:58,346 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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 13:08:58,346 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:08:58,346 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:08:58,346 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:08:58,347 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:08:58,347 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 13:08:58,347 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 13:08:58,349 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:08:58,349 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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 13:08:58,349 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:08:58,349 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:08:58,349 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:08:58,349 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:08:58,354 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 13:08:58,354 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 13:08:58,381 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-28 13:08:58,404 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2018-11-28 13:08:58,405 INFO L444 ModelExtractionUtils]: 36 out of 43 variables were initially zero. Simplification set additionally 4 variables to zero. [2018-11-28 13:08:58,405 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-28 13:08:58,406 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-28 13:08:58,406 INFO L518 LassoAnalysis]: Proved termination. [2018-11-28 13:08:58,406 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 13:08:58,474 INFO L297 tatePredicateManager]: 20 out of 23 supporting invariants were superfluous and have been removed [2018-11-28 13:08:58,477 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2018-11-28 13:08:58,493 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:08:58,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:08:58,505 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 13:08:58,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:08:58,524 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 13:08:58,539 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 13:08:58,539 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 13:08:58,539 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 17 states and 24 transitions. cyclomatic complexity: 9 Second operand 5 states. [2018-11-28 13:08:58,579 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 13:08:58,580 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 13:08:58,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-28 13:08:58,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 23 transitions. [2018-11-28 13:08:58,580 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 23 transitions. Stem has 7 letters. Loop has 3 letters. [2018-11-28 13:08:58,580 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 13:08:58,581 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 23 transitions. Stem has 10 letters. Loop has 3 letters. [2018-11-28 13:08:58,581 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 13:08:58,581 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 23 transitions. Stem has 7 letters. Loop has 6 letters. [2018-11-28 13:08:58,581 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 13:08:58,581 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 59 states and 76 transitions. [2018-11-28 13:08:58,582 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2018-11-28 13:08:58,584 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 59 states to 48 states and 64 transitions. [2018-11-28 13:08:58,585 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 17 [2018-11-28 13:08:58,585 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 18 [2018-11-28 13:08:58,585 INFO L73 IsDeterministic]: Start isDeterministic. Operand 48 states and 64 transitions. [2018-11-28 13:08:58,585 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-28 13:08:58,585 INFO L705 BuchiCegarLoop]: Abstraction has 48 states and 64 transitions. [2018-11-28 13:08:58,585 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states and 64 transitions. [2018-11-28 13:08:58,588 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 37. [2018-11-28 13:08:58,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2018-11-28 13:08:58,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 51 transitions. [2018-11-28 13:08:58,589 INFO L728 BuchiCegarLoop]: Abstraction has 37 states and 51 transitions. [2018-11-28 13:08:58,589 INFO L608 BuchiCegarLoop]: Abstraction has 37 states and 51 transitions. [2018-11-28 13:08:58,589 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2018-11-28 13:08:58,590 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 37 states and 51 transitions. [2018-11-28 13:08:58,590 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2018-11-28 13:08:58,590 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 13:08:58,590 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 13:08:58,591 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 13:08:58,591 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-11-28 13:08:58,591 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 13:08:58,591 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~mem5;havoc substring_#t~short6;substring_#t~post7.base, substring_#t~post7.offset := substring_~pt~0.base, substring_~pt~0.offset;substring_~pt~0.base, substring_~pt~0.offset := substring_#t~post7.base, 1 + substring_#t~post7.offset;havoc substring_#t~post7.base, substring_#t~post7.offset;substring_#t~post8.base, substring_#t~post8.offset := substring_~ps2~0.base, substring_~ps2~0.offset;substring_~ps2~0.base, substring_~ps2~0.offset := substring_#t~post8.base, 1 + substring_#t~post8.offset;havoc substring_#t~post8.base, substring_#t~post8.offset; 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 13:08:58,591 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:08:58,591 INFO L82 PathProgramCache]: Analyzing trace with hash 180429619, now seen corresponding path program 1 times [2018-11-28 13:08:58,591 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:08:58,591 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:08:58,592 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:08:58,592 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:08:58,592 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:08:58,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 13:08:58,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 13:08:58,609 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:08:58,609 INFO L82 PathProgramCache]: Analyzing trace with hash 64727, now seen corresponding path program 1 times [2018-11-28 13:08:58,609 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:08:58,609 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:08:58,611 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:08:58,611 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:08:58,611 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:08:58,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:08:58,617 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 13:08:58,618 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 13:08:58,618 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-28 13:08:58,618 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-11-28 13:08:58,618 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 13:08:58,618 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 13:08:58,618 INFO L87 Difference]: Start difference. First operand 37 states and 51 transitions. cyclomatic complexity: 20 Second operand 3 states. [2018-11-28 13:08:58,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:08:58,640 INFO L93 Difference]: Finished difference Result 35 states and 44 transitions. [2018-11-28 13:08:58,640 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 13:08:58,640 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 35 states and 44 transitions. [2018-11-28 13:08:58,641 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-11-28 13:08:58,641 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 35 states to 25 states and 32 transitions. [2018-11-28 13:08:58,642 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2018-11-28 13:08:58,642 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2018-11-28 13:08:58,642 INFO L73 IsDeterministic]: Start isDeterministic. Operand 25 states and 32 transitions. [2018-11-28 13:08:58,642 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-28 13:08:58,642 INFO L705 BuchiCegarLoop]: Abstraction has 25 states and 32 transitions. [2018-11-28 13:08:58,642 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states and 32 transitions. [2018-11-28 13:08:58,643 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 23. [2018-11-28 13:08:58,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2018-11-28 13:08:58,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 30 transitions. [2018-11-28 13:08:58,643 INFO L728 BuchiCegarLoop]: Abstraction has 23 states and 30 transitions. [2018-11-28 13:08:58,644 INFO L608 BuchiCegarLoop]: Abstraction has 23 states and 30 transitions. [2018-11-28 13:08:58,644 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2018-11-28 13:08:58,644 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 23 states and 30 transitions. [2018-11-28 13:08:58,644 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-11-28 13:08:58,644 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 13:08:58,644 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 13:08:58,645 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 13:08:58,645 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-11-28 13:08:58,645 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~mem5;havoc substring_#t~short6; 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 13:08:58,645 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~mem5;havoc substring_#t~short6;substring_#t~post7.base, substring_#t~post7.offset := substring_~pt~0.base, substring_~pt~0.offset;substring_~pt~0.base, substring_~pt~0.offset := substring_#t~post7.base, 1 + substring_#t~post7.offset;havoc substring_#t~post7.base, substring_#t~post7.offset;substring_#t~post8.base, substring_#t~post8.offset := substring_~ps2~0.base, substring_~ps2~0.offset;substring_~ps2~0.base, substring_~ps2~0.offset := substring_#t~post8.base, 1 + substring_#t~post8.offset;havoc substring_#t~post8.base, substring_#t~post8.offset; 478#L553-5 [2018-11-28 13:08:58,645 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:08:58,645 INFO L82 PathProgramCache]: Analyzing trace with hash 2012026433, now seen corresponding path program 1 times [2018-11-28 13:08:58,645 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:08:58,645 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:08:58,646 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:08:58,646 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:08:58,646 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:08:58,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:08:58,684 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 13:08:58,685 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 13:08:58,685 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-28 13:08:58,685 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-28 13:08:58,685 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:08:58,685 INFO L82 PathProgramCache]: Analyzing trace with hash 59685, now seen corresponding path program 2 times [2018-11-28 13:08:58,685 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:08:58,685 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:08:58,686 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:08:58,686 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:08:58,686 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:08:58,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 13:08:58,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 13:08:58,764 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-28 13:08:58,764 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-11-28 13:08:58,764 INFO L87 Difference]: Start difference. First operand 23 states and 30 transitions. cyclomatic complexity: 10 Second operand 5 states. [2018-11-28 13:08:58,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:08:58,785 INFO L93 Difference]: Finished difference Result 26 states and 32 transitions. [2018-11-28 13:08:58,786 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-28 13:08:58,786 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 26 states and 32 transitions. [2018-11-28 13:08:58,787 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-11-28 13:08:58,787 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 26 states to 23 states and 28 transitions. [2018-11-28 13:08:58,787 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2018-11-28 13:08:58,787 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2018-11-28 13:08:58,787 INFO L73 IsDeterministic]: Start isDeterministic. Operand 23 states and 28 transitions. [2018-11-28 13:08:58,787 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-28 13:08:58,788 INFO L705 BuchiCegarLoop]: Abstraction has 23 states and 28 transitions. [2018-11-28 13:08:58,788 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states and 28 transitions. [2018-11-28 13:08:58,791 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2018-11-28 13:08:58,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2018-11-28 13:08:58,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 28 transitions. [2018-11-28 13:08:58,791 INFO L728 BuchiCegarLoop]: Abstraction has 23 states and 28 transitions. [2018-11-28 13:08:58,791 INFO L608 BuchiCegarLoop]: Abstraction has 23 states and 28 transitions. [2018-11-28 13:08:58,791 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2018-11-28 13:08:58,792 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 23 states and 28 transitions. [2018-11-28 13:08:58,792 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-11-28 13:08:58,792 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 13:08:58,792 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 13:08:58,792 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 13:08:58,792 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-11-28 13:08:58,793 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~mem5;havoc substring_#t~short6; 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 13:08:58,793 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~mem5;havoc substring_#t~short6;substring_#t~post7.base, substring_#t~post7.offset := substring_~pt~0.base, substring_~pt~0.offset;substring_~pt~0.base, substring_~pt~0.offset := substring_#t~post7.base, 1 + substring_#t~post7.offset;havoc substring_#t~post7.base, substring_#t~post7.offset;substring_#t~post8.base, substring_#t~post8.offset := substring_~ps2~0.base, substring_~ps2~0.offset;substring_~ps2~0.base, substring_~ps2~0.offset := substring_#t~post8.base, 1 + substring_#t~post8.offset;havoc substring_#t~post8.base, substring_#t~post8.offset; 537#L553-5 [2018-11-28 13:08:58,793 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:08:58,793 INFO L82 PathProgramCache]: Analyzing trace with hash 1954768131, now seen corresponding path program 2 times [2018-11-28 13:08:58,793 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:08:58,793 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:08:58,794 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:08:58,794 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 13:08:58,794 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:08:58,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 13:08:58,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 13:08:58,810 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:08:58,810 INFO L82 PathProgramCache]: Analyzing trace with hash 59685, now seen corresponding path program 3 times [2018-11-28 13:08:58,810 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:08:58,810 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:08:58,811 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:08:58,811 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 13:08:58,811 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:08:58,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 13:08:58,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 13:08:58,818 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:08:58,818 INFO L82 PathProgramCache]: Analyzing trace with hash -964145949, now seen corresponding path program 1 times [2018-11-28 13:08:58,818 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:08:58,818 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:08:58,818 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:08:58,819 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 13:08:58,819 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:08:58,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 13:08:58,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 13:08:59,327 WARN L180 SmtUtils]: Spent 398.00 ms on a formula simplification. DAG size of input: 180 DAG size of output: 143 [2018-11-28 13:08:59,432 INFO L216 LassoAnalysis]: Preferences: [2018-11-28 13:08:59,432 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-28 13:08:59,432 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-28 13:08:59,432 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-28 13:08:59,432 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-28 13:08:59,432 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 13:08:59,432 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-28 13:08:59,432 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-28 13:08:59,433 INFO L131 ssoRankerPreferences]: Filename of dumped script: substring-alloca_true-termination.c.i_Iteration6_Lasso [2018-11-28 13:08:59,433 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-28 13:08:59,433 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-28 13:08:59,436 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:08:59,442 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:08:59,443 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:08:59,444 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 13:08:59,445 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 13:08:59,447 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 13:08:59,448 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 13:08:59,449 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 13:08:59,450 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 13:08:59,452 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 13:08:59,453 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 13:08:59,454 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 13:08:59,455 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 13:08:59,456 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 13:08:59,457 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 13:08:59,458 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 13:08:59,459 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 13:08:59,835 WARN L180 SmtUtils]: Spent 181.00 ms on a formula simplification. DAG size of input: 116 DAG size of output: 96 [2018-11-28 13:08:59,974 WARN L180 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 71 [2018-11-28 13:08:59,974 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:08:59,976 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:08:59,977 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:08:59,978 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 13:08:59,979 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:08:59,980 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:08:59,982 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 13:08:59,983 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 13:09:00,451 WARN L180 SmtUtils]: Spent 185.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 39 [2018-11-28 13:09:00,586 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-28 13:09:00,586 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-28 13:09:00,586 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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 13:09:00,587 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:09:00,587 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:09:00,587 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:09:00,587 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:09:00,587 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 13:09:00,587 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 13:09:00,589 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:09:00,589 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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 13:09:00,589 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:09:00,589 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 13:09:00,589 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:09:00,590 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:09:00,590 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:09:00,590 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 13:09:00,590 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 13:09:00,590 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:09:00,591 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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 13:09:00,591 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:09:00,591 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 13:09:00,591 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:09:00,591 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:09:00,591 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:09:00,591 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 13:09:00,591 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 13:09:00,592 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:09:00,592 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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 13:09:00,592 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:09:00,592 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 13:09:00,592 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:09:00,592 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:09:00,593 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:09:00,593 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 13:09:00,593 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 13:09:00,593 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:09:00,593 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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 13:09:00,594 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:09:00,594 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 13:09:00,594 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:09:00,594 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:09:00,594 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:09:00,594 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 13:09:00,594 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 13:09:00,598 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:09:00,599 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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 13:09:00,599 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:09:00,599 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 13:09:00,599 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:09:00,599 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:09:00,599 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:09:00,600 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 13:09:00,600 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 13:09:00,600 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:09:00,600 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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 13:09:00,601 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:09:00,601 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:09:00,601 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:09:00,601 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:09:00,601 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 13:09:00,602 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 13:09:00,603 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:09:00,603 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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 13:09:00,603 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:09:00,603 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 13:09:00,603 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:09:00,603 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:09:00,603 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:09:00,604 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 13:09:00,604 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 13:09:00,604 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:09:00,604 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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 13:09:00,605 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:09:00,605 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:09:00,605 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:09:00,605 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:09:00,606 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 13:09:00,606 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 13:09:00,607 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:09:00,608 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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 13:09:00,608 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:09:00,608 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 13:09:00,608 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:09:00,608 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:09:00,608 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:09:00,608 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 13:09:00,609 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 13:09:00,609 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:09:00,609 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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 13:09:00,609 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:09:00,610 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:09:00,610 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:09:00,610 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:09:00,610 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 13:09:00,610 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 13:09:00,611 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:09:00,612 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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 13:09:00,612 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:09:00,612 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 13:09:00,612 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:09:00,612 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:09:00,612 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:09:00,612 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 13:09:00,613 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 13:09:00,613 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:09:00,613 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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 13:09:00,614 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:09:00,614 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 13:09:00,614 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:09:00,614 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:09:00,614 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:09:00,614 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 13:09:00,614 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 13:09:00,615 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:09:00,615 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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 13:09:00,615 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:09:00,615 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 13:09:00,615 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:09:00,615 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:09:00,615 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:09:00,616 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 13:09:00,616 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 13:09:00,616 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:09:00,616 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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 13:09:00,616 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:09:00,617 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 13:09:00,617 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:09:00,617 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:09:00,617 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:09:00,617 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 13:09:00,617 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 13:09:00,617 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:09:00,618 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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 13:09:00,618 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:09:00,618 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 13:09:00,618 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:09:00,618 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:09:00,618 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:09:00,619 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 13:09:00,619 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 13:09:00,619 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:09:00,619 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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 13:09:00,620 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:09:00,620 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:09:00,620 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:09:00,620 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:09:00,621 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 13:09:00,621 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 13:09:00,624 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:09:00,624 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 13:09:00,625 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:09:00,625 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-28 13:09:00,625 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:09:00,625 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:09:00,626 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-28 13:09:00,626 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 13:09:00,632 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:09:00,632 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 13:09:00,633 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:09:00,633 INFO L205 nArgumentSynthesizer]: 12 stem disjuncts [2018-11-28 13:09:00,633 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-28 13:09:00,633 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:09:00,638 INFO L402 nArgumentSynthesizer]: We have 60 Motzkin's Theorem applications. [2018-11-28 13:09:00,638 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2018-11-28 13:09:00,674 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:09:00,674 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 13:09:00,675 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:09:00,675 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:09:00,675 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:09:00,675 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:09:00,676 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 13:09:00,676 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 13:09:00,680 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:09:00,681 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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 13:09:00,681 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:09:00,681 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:09:00,681 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:09:00,681 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:09:00,682 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 13:09:00,682 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 13:09:00,683 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:09:00,683 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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 13:09:00,684 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:09:00,684 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:09:00,684 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:09:00,684 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:09:00,684 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 13:09:00,684 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 13:09:00,685 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:09:00,686 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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 13:09:00,686 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:09:00,686 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:09:00,686 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:09:00,686 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:09:00,687 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 13:09:00,687 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 13:09:00,688 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:09:00,688 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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 13:09:00,689 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:09:00,689 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-28 13:09:00,689 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:09:00,689 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:09:00,690 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-28 13:09:00,690 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 13:09:00,698 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:09:00,699 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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 13:09:00,699 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:09:00,699 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:09:00,699 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:09:00,699 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:09:00,702 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 13:09:00,702 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 13:09:00,726 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-28 13:09:00,742 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2018-11-28 13:09:00,742 INFO L444 ModelExtractionUtils]: 54 out of 58 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-11-28 13:09:00,742 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-28 13:09:00,743 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-28 13:09:00,743 INFO L518 LassoAnalysis]: Proved termination. [2018-11-28 13:09:00,743 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 13:09:00,861 INFO L297 tatePredicateManager]: 43 out of 45 supporting invariants were superfluous and have been removed [2018-11-28 13:09:00,866 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2018-11-28 13:09:00,881 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:09:00,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:09:00,897 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 13:09:00,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:09:00,913 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 13:09:00,932 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 13:09:00,932 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 13:09:00,932 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 23 states and 28 transitions. cyclomatic complexity: 8 Second operand 5 states. [2018-11-28 13:09:00,963 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 13:09:00,963 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 13:09:00,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-28 13:09:00,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 16 transitions. [2018-11-28 13:09:00,964 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 16 transitions. Stem has 14 letters. Loop has 3 letters. [2018-11-28 13:09:00,964 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 13:09:00,964 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-28 13:09:00,979 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:09:00,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:09:00,996 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 13:09:01,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:09:01,016 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 13:09:01,025 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 13:09:01,026 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 13:09:01,026 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 23 states and 28 transitions. cyclomatic complexity: 8 Second operand 5 states. [2018-11-28 13:09:01,053 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 13:09:01,054 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 13:09:01,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-28 13:09:01,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 16 transitions. [2018-11-28 13:09:01,054 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 16 transitions. Stem has 14 letters. Loop has 3 letters. [2018-11-28 13:09:01,054 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 13:09:01,055 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-28 13:09:01,069 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:09:01,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:09:01,082 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 13:09:01,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:09:01,093 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 13:09:01,103 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 13:09:01,103 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 13:09:01,103 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 23 states and 28 transitions. cyclomatic complexity: 8 Second operand 5 states. [2018-11-28 13:09:01,150 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 13:09:01,150 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 13:09:01,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-28 13:09:01,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 23 transitions. [2018-11-28 13:09:01,151 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 23 transitions. Stem has 14 letters. Loop has 3 letters. [2018-11-28 13:09:01,151 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 13:09:01,151 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 23 transitions. Stem has 17 letters. Loop has 3 letters. [2018-11-28 13:09:01,151 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 13:09:01,151 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 23 transitions. Stem has 14 letters. Loop has 6 letters. [2018-11-28 13:09:01,151 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 13:09:01,152 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 37 states and 44 transitions. [2018-11-28 13:09:01,153 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-28 13:09:01,153 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 37 states to 0 states and 0 transitions. [2018-11-28 13:09:01,153 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2018-11-28 13:09:01,153 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2018-11-28 13:09:01,153 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2018-11-28 13:09:01,153 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-28 13:09:01,153 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-28 13:09:01,153 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-28 13:09:01,153 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-28 13:09:01,153 INFO L442 BuchiCegarLoop]: ======== Iteration 7============ [2018-11-28 13:09:01,154 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2018-11-28 13:09:01,154 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-28 13:09:01,154 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2018-11-28 13:09:01,159 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 28.11 01:09:01 BoogieIcfgContainer [2018-11-28 13:09:01,159 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-11-28 13:09:01,159 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-28 13:09:01,159 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-28 13:09:01,159 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-28 13:09:01,160 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 01:08:55" (3/4) ... [2018-11-28 13:09:01,163 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-11-28 13:09:01,163 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-28 13:09:01,163 INFO L168 Benchmark]: Toolchain (without parser) took 6419.74 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 331.4 MB). Free memory was 951.7 MB in the beginning and 965.9 MB in the end (delta: -14.2 MB). Peak memory consumption was 317.2 MB. Max. memory is 11.5 GB. [2018-11-28 13:09:01,164 INFO L168 Benchmark]: CDTParser took 0.10 ms. Allocated memory is still 1.0 GB. Free memory is still 979.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-28 13:09:01,164 INFO L168 Benchmark]: CACSL2BoogieTranslator took 326.72 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 147.8 MB). Free memory was 951.7 MB in the beginning and 1.1 GB in the end (delta: -183.9 MB). Peak memory consumption was 24.5 MB. Max. memory is 11.5 GB. [2018-11-28 13:09:01,165 INFO L168 Benchmark]: Boogie Procedure Inliner took 28.70 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: 3.4 MB). Peak memory consumption was 3.4 MB. Max. memory is 11.5 GB. [2018-11-28 13:09:01,166 INFO L168 Benchmark]: Boogie Preprocessor took 16.36 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: 3.4 MB). Peak memory consumption was 3.4 MB. Max. memory is 11.5 GB. [2018-11-28 13:09:01,166 INFO L168 Benchmark]: RCFGBuilder took 245.32 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: 21.7 MB). Peak memory consumption was 21.7 MB. Max. memory is 11.5 GB. [2018-11-28 13:09:01,167 INFO L168 Benchmark]: BuchiAutomizer took 5795.92 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 183.5 MB). Free memory was 1.1 GB in the beginning and 965.9 MB in the end (delta: 141.3 MB). Peak memory consumption was 324.8 MB. Max. memory is 11.5 GB. [2018-11-28 13:09:01,167 INFO L168 Benchmark]: Witness Printer took 3.54 ms. Allocated memory is still 1.4 GB. Free memory is still 965.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-28 13:09:01,170 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.10 ms. Allocated memory is still 1.0 GB. Free memory is still 979.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 326.72 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 147.8 MB). Free memory was 951.7 MB in the beginning and 1.1 GB in the end (delta: -183.9 MB). Peak memory consumption was 24.5 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 28.70 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: 3.4 MB). Peak memory consumption was 3.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 16.36 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: 3.4 MB). Peak memory consumption was 3.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 245.32 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: 21.7 MB). Peak memory consumption was 21.7 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 5795.92 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 183.5 MB). Free memory was 1.1 GB in the beginning and 965.9 MB in the end (delta: 141.3 MB). Peak memory consumption was 324.8 MB. Max. memory is 11.5 GB. * Witness Printer took 3.54 ms. Allocated memory is still 1.4 GB. Free memory is still 965.9 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 5.7s and 7 iterations. TraceHistogramMax:2. Analysis of lassos took 5.0s. Construction of modules took 0.1s. Büchi inclusion checks took 0.4s. 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.1s 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: 41ms 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...