./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/termination-memory-alloca/substring-alloca-1.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version cad46833 Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_3baab58d-b8d3-4d4f-ab09-7ab9b6229e29/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_3baab58d-b8d3-4d4f-ab09-7ab9b6229e29/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_3baab58d-b8d3-4d4f-ab09-7ab9b6229e29/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_3baab58d-b8d3-4d4f-ab09-7ab9b6229e29/bin/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/termination-memory-alloca/substring-alloca-1.i -s /tmp/vcloud-vcloud-master/worker/run_dir_3baab58d-b8d3-4d4f-ab09-7ab9b6229e29/bin/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_3baab58d-b8d3-4d4f-ab09-7ab9b6229e29/bin/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.24-cad4683 [2019-11-15 19:57:43,206 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-15 19:57:43,208 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-15 19:57:43,218 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-15 19:57:43,218 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-15 19:57:43,219 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-15 19:57:43,220 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-15 19:57:43,222 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-15 19:57:43,224 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-15 19:57:43,225 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-15 19:57:43,225 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-15 19:57:43,226 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-15 19:57:43,227 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-15 19:57:43,227 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-15 19:57:43,228 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-15 19:57:43,229 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-15 19:57:43,230 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-15 19:57:43,230 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-15 19:57:43,232 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-15 19:57:43,234 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-15 19:57:43,235 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-15 19:57:43,236 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-15 19:57:43,237 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-15 19:57:43,238 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-15 19:57:43,240 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-15 19:57:43,240 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-15 19:57:43,240 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-15 19:57:43,241 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-15 19:57:43,241 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-15 19:57:43,242 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-15 19:57:43,242 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-15 19:57:43,243 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-15 19:57:43,244 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-15 19:57:43,244 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-15 19:57:43,245 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-15 19:57:43,245 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-15 19:57:43,246 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-15 19:57:43,246 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-15 19:57:43,246 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-15 19:57:43,247 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-15 19:57:43,247 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-15 19:57:43,248 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_3baab58d-b8d3-4d4f-ab09-7ab9b6229e29/bin/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf [2019-11-15 19:57:43,263 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-15 19:57:43,263 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-15 19:57:43,264 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-15 19:57:43,265 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-15 19:57:43,265 INFO L138 SettingsManager]: * Use SBE=true [2019-11-15 19:57:43,265 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-11-15 19:57:43,265 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-11-15 19:57:43,265 INFO L138 SettingsManager]: * Use old map elimination=false [2019-11-15 19:57:43,266 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2019-11-15 19:57:43,266 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2019-11-15 19:57:43,266 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-11-15 19:57:43,266 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-15 19:57:43,266 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-11-15 19:57:43,267 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-15 19:57:43,267 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-15 19:57:43,267 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-11-15 19:57:43,267 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-11-15 19:57:43,267 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-11-15 19:57:43,268 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-15 19:57:43,268 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-11-15 19:57:43,268 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-15 19:57:43,268 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-11-15 19:57:43,268 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-15 19:57:43,269 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-15 19:57:43,269 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-11-15 19:57:43,269 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-15 19:57:43,269 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-15 19:57:43,269 INFO L138 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-11-15 19:57:43,270 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-11-15 19:57:43,270 INFO L138 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/run_dir_3baab58d-b8d3-4d4f-ab09-7ab9b6229e29/bin/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 [2019-11-15 19:57:43,301 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-15 19:57:43,311 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-15 19:57:43,315 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-15 19:57:43,317 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-15 19:57:43,317 INFO L275 PluginConnector]: CDTParser initialized [2019-11-15 19:57:43,318 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_3baab58d-b8d3-4d4f-ab09-7ab9b6229e29/bin/uautomizer/../../sv-benchmarks/c/termination-memory-alloca/substring-alloca-1.i [2019-11-15 19:57:43,378 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_3baab58d-b8d3-4d4f-ab09-7ab9b6229e29/bin/uautomizer/data/633f7c9e0/477eb87ad23f4304b84eec8707c9ed64/FLAG4e757a05e [2019-11-15 19:57:43,858 INFO L306 CDTParser]: Found 1 translation units. [2019-11-15 19:57:43,859 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_3baab58d-b8d3-4d4f-ab09-7ab9b6229e29/sv-benchmarks/c/termination-memory-alloca/substring-alloca-1.i [2019-11-15 19:57:43,873 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_3baab58d-b8d3-4d4f-ab09-7ab9b6229e29/bin/uautomizer/data/633f7c9e0/477eb87ad23f4304b84eec8707c9ed64/FLAG4e757a05e [2019-11-15 19:57:44,171 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_3baab58d-b8d3-4d4f-ab09-7ab9b6229e29/bin/uautomizer/data/633f7c9e0/477eb87ad23f4304b84eec8707c9ed64 [2019-11-15 19:57:44,174 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-15 19:57:44,175 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-15 19:57:44,176 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-15 19:57:44,176 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-15 19:57:44,179 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-15 19:57:44,180 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 07:57:44" (1/1) ... [2019-11-15 19:57:44,182 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@9b3d066 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 07:57:44, skipping insertion in model container [2019-11-15 19:57:44,182 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 07:57:44" (1/1) ... [2019-11-15 19:57:44,188 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-15 19:57:44,228 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-15 19:57:44,545 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-15 19:57:44,554 INFO L188 MainTranslator]: Completed pre-run [2019-11-15 19:57:44,601 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-15 19:57:44,654 INFO L192 MainTranslator]: Completed translation [2019-11-15 19:57:44,656 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 07:57:44 WrapperNode [2019-11-15 19:57:44,656 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-15 19:57:44,657 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-15 19:57:44,657 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-15 19:57:44,657 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-15 19:57:44,665 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 07:57:44" (1/1) ... [2019-11-15 19:57:44,680 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 07:57:44" (1/1) ... [2019-11-15 19:57:44,703 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-15 19:57:44,704 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-15 19:57:44,704 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-15 19:57:44,704 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-15 19:57:44,713 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 07:57:44" (1/1) ... [2019-11-15 19:57:44,719 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 07:57:44" (1/1) ... [2019-11-15 19:57:44,727 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 07:57:44" (1/1) ... [2019-11-15 19:57:44,727 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 07:57:44" (1/1) ... [2019-11-15 19:57:44,743 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 07:57:44" (1/1) ... [2019-11-15 19:57:44,747 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 07:57:44" (1/1) ... [2019-11-15 19:57:44,748 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 07:57:44" (1/1) ... [2019-11-15 19:57:44,751 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-15 19:57:44,751 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-15 19:57:44,751 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-15 19:57:44,751 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-15 19:57:44,752 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 07:57:44" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3baab58d-b8d3-4d4f-ab09-7ab9b6229e29/bin/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 [2019-11-15 19:57:44,832 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-11-15 19:57:44,832 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-11-15 19:57:44,832 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-15 19:57:44,833 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-15 19:57:44,833 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-15 19:57:44,834 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-15 19:57:45,136 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-15 19:57:45,136 INFO L284 CfgBuilder]: Removed 8 assume(true) statements. [2019-11-15 19:57:45,137 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 07:57:45 BoogieIcfgContainer [2019-11-15 19:57:45,137 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-15 19:57:45,138 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-11-15 19:57:45,138 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-11-15 19:57:45,141 INFO L275 PluginConnector]: BuchiAutomizer initialized [2019-11-15 19:57:45,142 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-15 19:57:45,142 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 15.11 07:57:44" (1/3) ... [2019-11-15 19:57:45,143 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@4ac89c77 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 15.11 07:57:45, skipping insertion in model container [2019-11-15 19:57:45,143 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-15 19:57:45,143 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 07:57:44" (2/3) ... [2019-11-15 19:57:45,144 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@4ac89c77 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 15.11 07:57:45, skipping insertion in model container [2019-11-15 19:57:45,144 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-15 19:57:45,144 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 07:57:45" (3/3) ... [2019-11-15 19:57:45,146 INFO L371 chiAutomizerObserver]: Analyzing ICFG substring-alloca-1.i [2019-11-15 19:57:45,187 INFO L356 BuchiCegarLoop]: Interprodecural is true [2019-11-15 19:57:45,187 INFO L357 BuchiCegarLoop]: Hoare is false [2019-11-15 19:57:45,188 INFO L358 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-11-15 19:57:45,188 INFO L359 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-15 19:57:45,188 INFO L360 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-15 19:57:45,188 INFO L361 BuchiCegarLoop]: Difference is false [2019-11-15 19:57:45,188 INFO L362 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-15 19:57:45,188 INFO L365 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-11-15 19:57:45,200 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states. [2019-11-15 19:57:45,220 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2019-11-15 19:57:45,220 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 19:57:45,221 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 19:57:45,227 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2019-11-15 19:57:45,227 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2019-11-15 19:57:45,227 INFO L424 BuchiCegarLoop]: ======== Iteration 1============ [2019-11-15 19:57:45,227 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states. [2019-11-15 19:57:45,229 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2019-11-15 19:57:45,229 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 19:57:45,229 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 19:57:45,230 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2019-11-15 19:57:45,230 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2019-11-15 19:57:45,237 INFO L791 eck$LassoCheckResult]: Stem: 12#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 11#L-1true havoc main_#res;havoc main_#t~nondet11, main_#t~nondet12, main_#t~malloc13.base, main_#t~malloc13.offset, main_#t~malloc14.base, main_#t~malloc14.offset, main_#t~ret15, main_~length1~0, main_~length2~0, main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;main_~length1~0 := main_#t~nondet11;havoc main_#t~nondet11;main_~length2~0 := main_#t~nondet12;havoc main_#t~nondet12; 9#L565true assume !(main_~length1~0 < 1); 13#L565-2true assume !(main_~length2~0 < 1); 8#L568-1true call main_#t~malloc13.base, main_#t~malloc13.offset := #Ultimate.allocOnStack(main_~length1~0);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc13.base, main_#t~malloc13.offset;call main_#t~malloc14.base, main_#t~malloc14.offset := #Ultimate.allocOnStack(main_~length2~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc14.base, main_#t~malloc14.offset;call write~int(0, main_~nondetString1~0.base, main_~nondetString1~0.offset + (main_~length1~0 - 1), 1);call write~int(0, main_~nondetString2~0.base, main_~nondetString2~0.offset + (main_~length2~0 - 1), 1);substring_#in~s.base, substring_#in~s.offset, substring_#in~t.base, substring_#in~t.offset := main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;havoc substring_#res;havoc substring_#t~post7.base, substring_#t~post7.offset, substring_#t~post8.base, substring_#t~post8.offset, substring_#t~mem3, substring_#t~mem4, substring_#t~mem5, substring_#t~short6, substring_#t~mem9, substring_#t~post10.base, substring_#t~post10.offset, substring_~ps2~0.base, substring_~ps2~0.offset, substring_~pt~0.base, substring_~pt~0.offset, substring_#t~mem2, substring_~s.base, substring_~s.offset, substring_~t.base, substring_~t.offset, substring_~ps~0.base, substring_~ps~0.offset;substring_~s.base, substring_~s.offset := substring_#in~s.base, substring_#in~s.offset;substring_~t.base, substring_~t.offset := substring_#in~t.base, substring_#in~t.offset;substring_~ps~0.base, substring_~ps~0.offset := substring_~s.base, substring_~s.offset; 4#L550-3true [2019-11-15 19:57:45,237 INFO L793 eck$LassoCheckResult]: Loop: 4#L550-3true call substring_#t~mem2 := read~int(substring_~ps~0.base, substring_~ps~0.offset, 1); 19#L550-1true assume !!(0 != substring_#t~mem2);havoc substring_#t~mem2;substring_~ps2~0.base, substring_~ps2~0.offset := substring_~ps~0.base, substring_~ps~0.offset;substring_~pt~0.base, substring_~pt~0.offset := substring_~t.base, substring_~t.offset; 3#L553-5true assume !true; 5#L553-6true call substring_#t~mem9 := read~int(substring_~pt~0.base, substring_~pt~0.offset, 1); 6#L557true assume !(0 == substring_#t~mem9);havoc substring_#t~mem9;substring_#t~post10.base, substring_#t~post10.offset := substring_~ps~0.base, substring_~ps~0.offset;substring_~ps~0.base, substring_~ps~0.offset := substring_#t~post10.base, 1 + substring_#t~post10.offset;havoc substring_#t~post10.base, substring_#t~post10.offset; 4#L550-3true [2019-11-15 19:57:45,242 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 19:57:45,243 INFO L82 PathProgramCache]: Analyzing trace with hash 28695878, now seen corresponding path program 1 times [2019-11-15 19:57:45,250 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 19:57:45,250 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1067360815] [2019-11-15 19:57:45,250 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 19:57:45,251 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 19:57:45,251 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 19:57:45,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 19:57:45,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 19:57:45,386 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 19:57:45,387 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 19:57:45,387 INFO L82 PathProgramCache]: Analyzing trace with hash 47887114, now seen corresponding path program 1 times [2019-11-15 19:57:45,387 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 19:57:45,388 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1532118589] [2019-11-15 19:57:45,388 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 19:57:45,388 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 19:57:45,388 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 19:57:45,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 19:57:45,420 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 19:57:45,420 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1532118589] [2019-11-15 19:57:45,421 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 19:57:45,421 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-15 19:57:45,421 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [29391936] [2019-11-15 19:57:45,425 INFO L808 eck$LassoCheckResult]: loop already infeasible [2019-11-15 19:57:45,426 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 19:57:45,439 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-11-15 19:57:45,439 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-11-15 19:57:45,440 INFO L87 Difference]: Start difference. First operand 17 states. Second operand 2 states. [2019-11-15 19:57:45,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 19:57:45,445 INFO L93 Difference]: Finished difference Result 17 states and 22 transitions. [2019-11-15 19:57:45,446 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-11-15 19:57:45,447 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 17 states and 22 transitions. [2019-11-15 19:57:45,448 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2019-11-15 19:57:45,451 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 17 states to 12 states and 16 transitions. [2019-11-15 19:57:45,452 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 12 [2019-11-15 19:57:45,452 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 12 [2019-11-15 19:57:45,453 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 16 transitions. [2019-11-15 19:57:45,453 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-15 19:57:45,453 INFO L688 BuchiCegarLoop]: Abstraction has 12 states and 16 transitions. [2019-11-15 19:57:45,469 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states and 16 transitions. [2019-11-15 19:57:45,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2019-11-15 19:57:45,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2019-11-15 19:57:45,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 16 transitions. [2019-11-15 19:57:45,479 INFO L711 BuchiCegarLoop]: Abstraction has 12 states and 16 transitions. [2019-11-15 19:57:45,479 INFO L591 BuchiCegarLoop]: Abstraction has 12 states and 16 transitions. [2019-11-15 19:57:45,479 INFO L424 BuchiCegarLoop]: ======== Iteration 2============ [2019-11-15 19:57:45,479 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 12 states and 16 transitions. [2019-11-15 19:57:45,480 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2019-11-15 19:57:45,480 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 19:57:45,480 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 19:57:45,481 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2019-11-15 19:57:45,481 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2019-11-15 19:57:45,481 INFO L791 eck$LassoCheckResult]: Stem: 48#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 44#L-1 havoc main_#res;havoc main_#t~nondet11, main_#t~nondet12, main_#t~malloc13.base, main_#t~malloc13.offset, main_#t~malloc14.base, main_#t~malloc14.offset, main_#t~ret15, main_~length1~0, main_~length2~0, main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;main_~length1~0 := main_#t~nondet11;havoc main_#t~nondet11;main_~length2~0 := main_#t~nondet12;havoc main_#t~nondet12; 45#L565 assume !(main_~length1~0 < 1); 49#L565-2 assume !(main_~length2~0 < 1); 50#L568-1 call main_#t~malloc13.base, main_#t~malloc13.offset := #Ultimate.allocOnStack(main_~length1~0);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc13.base, main_#t~malloc13.offset;call main_#t~malloc14.base, main_#t~malloc14.offset := #Ultimate.allocOnStack(main_~length2~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc14.base, main_#t~malloc14.offset;call write~int(0, main_~nondetString1~0.base, main_~nondetString1~0.offset + (main_~length1~0 - 1), 1);call write~int(0, main_~nondetString2~0.base, main_~nondetString2~0.offset + (main_~length2~0 - 1), 1);substring_#in~s.base, substring_#in~s.offset, substring_#in~t.base, substring_#in~t.offset := main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;havoc substring_#res;havoc substring_#t~post7.base, substring_#t~post7.offset, substring_#t~post8.base, substring_#t~post8.offset, substring_#t~mem3, substring_#t~mem4, substring_#t~mem5, substring_#t~short6, substring_#t~mem9, substring_#t~post10.base, substring_#t~post10.offset, substring_~ps2~0.base, substring_~ps2~0.offset, substring_~pt~0.base, substring_~pt~0.offset, substring_#t~mem2, substring_~s.base, substring_~s.offset, substring_~t.base, substring_~t.offset, substring_~ps~0.base, substring_~ps~0.offset;substring_~s.base, substring_~s.offset := substring_#in~s.base, substring_#in~s.offset;substring_~t.base, substring_~t.offset := substring_#in~t.base, substring_#in~t.offset;substring_~ps~0.base, substring_~ps~0.offset := substring_~s.base, substring_~s.offset; 51#L550-3 [2019-11-15 19:57:45,482 INFO L793 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~short6;havoc substring_#t~mem3;havoc substring_#t~mem4;havoc substring_#t~mem5; 46#L553-6 call substring_#t~mem9 := read~int(substring_~pt~0.base, substring_~pt~0.offset, 1); 47#L557 assume !(0 == substring_#t~mem9);havoc substring_#t~mem9;substring_#t~post10.base, substring_#t~post10.offset := substring_~ps~0.base, substring_~ps~0.offset;substring_~ps~0.base, substring_~ps~0.offset := substring_#t~post10.base, 1 + substring_#t~post10.offset;havoc substring_#t~post10.base, substring_#t~post10.offset; 51#L550-3 [2019-11-15 19:57:45,482 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 19:57:45,482 INFO L82 PathProgramCache]: Analyzing trace with hash 28695878, now seen corresponding path program 2 times [2019-11-15 19:57:45,483 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 19:57:45,483 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1768067376] [2019-11-15 19:57:45,483 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 19:57:45,484 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 19:57:45,484 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 19:57:45,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 19:57:45,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 19:57:45,529 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 19:57:45,529 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 19:57:45,529 INFO L82 PathProgramCache]: Analyzing trace with hash -1237496093, now seen corresponding path program 1 times [2019-11-15 19:57:45,530 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 19:57:45,530 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1674724663] [2019-11-15 19:57:45,530 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 19:57:45,530 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 19:57:45,530 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 19:57:45,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 19:57:45,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 19:57:45,556 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 19:57:45,557 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 19:57:45,557 INFO L82 PathProgramCache]: Analyzing trace with hash -1302992386, now seen corresponding path program 1 times [2019-11-15 19:57:45,557 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 19:57:45,557 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [196360519] [2019-11-15 19:57:45,558 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 19:57:45,558 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 19:57:45,558 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 19:57:45,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 19:57:45,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 19:57:45,645 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 19:57:45,956 WARN L191 SmtUtils]: Spent 305.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 60 [2019-11-15 19:57:46,408 WARN L191 SmtUtils]: Spent 380.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 87 [2019-11-15 19:57:46,546 WARN L191 SmtUtils]: Spent 135.00 ms on a formula simplification that was a NOOP. DAG size: 81 [2019-11-15 19:57:46,557 INFO L210 LassoAnalysis]: Preferences: [2019-11-15 19:57:46,558 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-11-15 19:57:46,558 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-15 19:57:46,559 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-11-15 19:57:46,559 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-11-15 19:57:46,559 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 19:57:46,559 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-15 19:57:46,559 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-11-15 19:57:46,560 INFO L131 ssoRankerPreferences]: Filename of dumped script: substring-alloca-1.i_Iteration2_Lasso [2019-11-15 19:57:46,560 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-15 19:57:46,560 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-15 19:57:46,598 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 19:57:46,604 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 19:57:47,025 WARN L191 SmtUtils]: Spent 208.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 65 [2019-11-15 19:57:47,220 WARN L191 SmtUtils]: Spent 156.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 52 [2019-11-15 19:57:47,220 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 19:57:47,223 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 19:57:47,228 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 19:57:47,231 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 19:57:47,234 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 19:57:47,238 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 19:57:47,241 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 19:57:47,243 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 19:57:47,246 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 19:57:47,249 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 19:57:47,252 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 19:57:47,254 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 19:57:47,257 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 19:57:47,260 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 19:57:47,264 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 19:57:47,267 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 19:57:47,271 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 19:57:47,274 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 19:57:47,277 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 19:57:47,281 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 19:57:47,285 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 19:57:47,680 WARN L191 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 27 DAG size of output: 25 [2019-11-15 19:57:48,033 WARN L191 SmtUtils]: Spent 309.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 40 [2019-11-15 19:57:48,159 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-15 19:57:48,163 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-11-15 19:57:48,165 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 19:57:48,167 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 19:57:48,168 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 19:57:48,168 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 19:57:48,168 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 19:57:48,169 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 19:57:48,170 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 19:57:48,171 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 19:57:48,172 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 19:57:48,173 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 19:57:48,174 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 19:57:48,174 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 19:57:48,174 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 19:57:48,174 INFO L203 nArgumentSynthesizer]: 6 loop disjuncts [2019-11-15 19:57:48,175 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 19:57:48,179 INFO L400 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2019-11-15 19:57:48,179 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 19:57:48,205 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 19:57:48,205 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 19:57:48,206 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 19:57:48,206 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 19:57:48,207 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 19:57:48,207 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 19:57:48,209 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 19:57:48,209 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 19:57:48,212 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 19:57:48,213 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 19:57:48,213 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 19:57:48,214 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 19:57:48,214 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 19:57:48,214 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 19:57:48,216 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 19:57:48,216 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 19:57:48,221 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 19:57:48,221 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 19:57:48,222 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 19:57:48,222 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 19:57:48,222 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 19:57:48,222 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 19:57:48,223 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 19:57:48,223 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 19:57:48,223 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 19:57:48,226 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 19:57:48,226 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 19:57:48,227 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 19:57:48,227 INFO L202 nArgumentSynthesizer]: 4 stem disjuncts [2019-11-15 19:57:48,227 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 19:57:48,228 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 19:57:48,241 INFO L400 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2019-11-15 19:57:48,241 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 19:57:48,294 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 19:57:48,295 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 19:57:48,296 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 19:57:48,296 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 19:57:48,296 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 19:57:48,296 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 19:57:48,300 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 19:57:48,301 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 19:57:48,337 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-15 19:57:48,375 INFO L443 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. [2019-11-15 19:57:48,376 INFO L444 ModelExtractionUtils]: 26 out of 31 variables were initially zero. Simplification set additionally 2 variables to zero. [2019-11-15 19:57:48,378 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-15 19:57:48,379 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-11-15 19:57:48,379 INFO L510 LassoAnalysis]: Proved termination. [2019-11-15 19:57:48,380 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_main_#t~malloc13.base)_1, ULTIMATE.start_substring_~ps~0.offset) = 1*v_rep(select #length ULTIMATE.start_main_#t~malloc13.base)_1 - 1*ULTIMATE.start_substring_~ps~0.offset Supporting invariants [] [2019-11-15 19:57:48,412 INFO L297 tatePredicateManager]: 8 out of 9 supporting invariants were superfluous and have been removed [2019-11-15 19:57:48,419 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2019-11-15 19:57:48,441 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 19:57:48,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 19:57:48,468 INFO L256 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 10 conjunts are in the unsatisfiable core [2019-11-15 19:57:48,469 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 19:57:48,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 19:57:48,493 INFO L256 TraceCheckSpWp]: Trace formula consists of 52 conjuncts, 8 conjunts are in the unsatisfiable core [2019-11-15 19:57:48,494 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 19:57:48,512 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 19:57:48,515 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2019-11-15 19:57:48,516 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 12 states and 16 transitions. cyclomatic complexity: 5 Second operand 3 states. [2019-11-15 19:57:48,589 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 12 states and 16 transitions. cyclomatic complexity: 5. Second operand 3 states. Result 19 states and 26 transitions. Complement of second has 4 states. [2019-11-15 19:57:48,589 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2019-11-15 19:57:48,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-11-15 19:57:48,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 16 transitions. [2019-11-15 19:57:48,592 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 16 transitions. Stem has 5 letters. Loop has 7 letters. [2019-11-15 19:57:48,593 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 19:57:48,593 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 16 transitions. Stem has 12 letters. Loop has 7 letters. [2019-11-15 19:57:48,593 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 19:57:48,594 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 16 transitions. Stem has 5 letters. Loop has 14 letters. [2019-11-15 19:57:48,594 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 19:57:48,594 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 19 states and 26 transitions. [2019-11-15 19:57:48,595 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-11-15 19:57:48,596 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 19 states to 17 states and 24 transitions. [2019-11-15 19:57:48,596 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9 [2019-11-15 19:57:48,596 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2019-11-15 19:57:48,596 INFO L73 IsDeterministic]: Start isDeterministic. Operand 17 states and 24 transitions. [2019-11-15 19:57:48,597 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-15 19:57:48,597 INFO L688 BuchiCegarLoop]: Abstraction has 17 states and 24 transitions. [2019-11-15 19:57:48,597 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states and 24 transitions. [2019-11-15 19:57:48,598 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2019-11-15 19:57:48,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2019-11-15 19:57:48,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 24 transitions. [2019-11-15 19:57:48,599 INFO L711 BuchiCegarLoop]: Abstraction has 17 states and 24 transitions. [2019-11-15 19:57:48,599 INFO L591 BuchiCegarLoop]: Abstraction has 17 states and 24 transitions. [2019-11-15 19:57:48,600 INFO L424 BuchiCegarLoop]: ======== Iteration 3============ [2019-11-15 19:57:48,600 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states and 24 transitions. [2019-11-15 19:57:48,601 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-11-15 19:57:48,601 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 19:57:48,601 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 19:57:48,601 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2019-11-15 19:57:48,601 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-11-15 19:57:48,602 INFO L791 eck$LassoCheckResult]: Stem: 182#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 174#L-1 havoc main_#res;havoc main_#t~nondet11, main_#t~nondet12, main_#t~malloc13.base, main_#t~malloc13.offset, main_#t~malloc14.base, main_#t~malloc14.offset, main_#t~ret15, main_~length1~0, main_~length2~0, main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;main_~length1~0 := main_#t~nondet11;havoc main_#t~nondet11;main_~length2~0 := main_#t~nondet12;havoc main_#t~nondet12; 175#L565 assume !(main_~length1~0 < 1); 183#L565-2 assume !(main_~length2~0 < 1); 184#L568-1 call main_#t~malloc13.base, main_#t~malloc13.offset := #Ultimate.allocOnStack(main_~length1~0);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc13.base, main_#t~malloc13.offset;call main_#t~malloc14.base, main_#t~malloc14.offset := #Ultimate.allocOnStack(main_~length2~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc14.base, main_#t~malloc14.offset;call write~int(0, main_~nondetString1~0.base, main_~nondetString1~0.offset + (main_~length1~0 - 1), 1);call write~int(0, main_~nondetString2~0.base, main_~nondetString2~0.offset + (main_~length2~0 - 1), 1);substring_#in~s.base, substring_#in~s.offset, substring_#in~t.base, substring_#in~t.offset := main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;havoc substring_#res;havoc substring_#t~post7.base, substring_#t~post7.offset, substring_#t~post8.base, substring_#t~post8.offset, substring_#t~mem3, substring_#t~mem4, substring_#t~mem5, substring_#t~short6, substring_#t~mem9, substring_#t~post10.base, substring_#t~post10.offset, substring_~ps2~0.base, substring_~ps2~0.offset, substring_~pt~0.base, substring_~pt~0.offset, substring_#t~mem2, substring_~s.base, substring_~s.offset, substring_~t.base, substring_~t.offset, substring_~ps~0.base, substring_~ps~0.offset;substring_~s.base, substring_~s.offset := substring_#in~s.base, substring_#in~s.offset;substring_~t.base, substring_~t.offset := substring_#in~t.base, substring_#in~t.offset;substring_~ps~0.base, substring_~ps~0.offset := substring_~s.base, substring_~s.offset; 178#L550-3 call substring_#t~mem2 := read~int(substring_~ps~0.base, substring_~ps~0.offset, 1); 180#L550-1 assume !!(0 != substring_#t~mem2);havoc substring_#t~mem2;substring_~ps2~0.base, substring_~ps2~0.offset := substring_~ps~0.base, substring_~ps~0.offset;substring_~pt~0.base, substring_~pt~0.offset := substring_~t.base, substring_~t.offset; 170#L553-5 [2019-11-15 19:57:48,602 INFO L793 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~short6;havoc substring_#t~mem3;havoc substring_#t~mem4;havoc substring_#t~mem5;substring_#t~post7.base, substring_#t~post7.offset := substring_~pt~0.base, substring_~pt~0.offset;substring_~pt~0.base, substring_~pt~0.offset := substring_#t~post7.base, 1 + substring_#t~post7.offset;havoc substring_#t~post7.base, substring_#t~post7.offset;substring_#t~post8.base, substring_#t~post8.offset := substring_~ps2~0.base, substring_~ps2~0.offset;substring_~ps2~0.base, substring_~ps2~0.offset := substring_#t~post8.base, 1 + substring_#t~post8.offset;havoc substring_#t~post8.base, substring_#t~post8.offset; 170#L553-5 [2019-11-15 19:57:48,602 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 19:57:48,602 INFO L82 PathProgramCache]: Analyzing trace with hash 1806935627, now seen corresponding path program 1 times [2019-11-15 19:57:48,603 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 19:57:48,603 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [382114046] [2019-11-15 19:57:48,603 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 19:57:48,603 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 19:57:48,603 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 19:57:48,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 19:57:48,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 19:57:48,674 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 19:57:48,674 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 19:57:48,674 INFO L82 PathProgramCache]: Analyzing trace with hash 59685, now seen corresponding path program 1 times [2019-11-15 19:57:48,674 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 19:57:48,675 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1990185124] [2019-11-15 19:57:48,675 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 19:57:48,675 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 19:57:48,675 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 19:57:48,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 19:57:48,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 19:57:48,693 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 19:57:48,694 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 19:57:48,694 INFO L82 PathProgramCache]: Analyzing trace with hash 1594173083, now seen corresponding path program 1 times [2019-11-15 19:57:48,694 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 19:57:48,694 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1439204308] [2019-11-15 19:57:48,694 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 19:57:48,694 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 19:57:48,695 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 19:57:48,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 19:57:48,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 19:57:48,774 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 19:57:48,902 WARN L191 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 45 [2019-11-15 19:57:49,278 WARN L191 SmtUtils]: Spent 347.00 ms on a formula simplification. DAG size of input: 119 DAG size of output: 103 [2019-11-15 19:57:49,390 WARN L191 SmtUtils]: Spent 110.00 ms on a formula simplification that was a NOOP. DAG size: 95 [2019-11-15 19:57:49,392 INFO L210 LassoAnalysis]: Preferences: [2019-11-15 19:57:49,392 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-11-15 19:57:49,393 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-15 19:57:49,393 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-11-15 19:57:49,393 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-11-15 19:57:49,393 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 19:57:49,393 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-15 19:57:49,393 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-11-15 19:57:49,393 INFO L131 ssoRankerPreferences]: Filename of dumped script: substring-alloca-1.i_Iteration3_Lasso [2019-11-15 19:57:49,393 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-15 19:57:49,393 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-15 19:57:49,398 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 19:57:49,409 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 19:57:49,414 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 19:57:49,418 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 19:57:49,422 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 19:57:49,425 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 19:57:49,427 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 19:57:49,429 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 19:57:49,431 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 19:57:49,433 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 19:57:49,435 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 19:57:49,436 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 19:57:49,438 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 19:57:49,440 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 19:57:49,442 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 19:57:49,444 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 19:57:49,445 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 19:57:49,447 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 19:57:49,448 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 19:57:49,449 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 19:57:49,453 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 19:57:49,873 WARN L191 SmtUtils]: Spent 267.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 85 [2019-11-15 19:57:50,047 WARN L191 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 60 [2019-11-15 19:57:50,047 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 19:57:50,050 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 19:57:50,053 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 19:57:51,022 WARN L191 SmtUtils]: Spent 428.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 46 [2019-11-15 19:57:51,054 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-15 19:57:51,054 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-11-15 19:57:51,054 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 19:57:51,055 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 19:57:51,055 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 19:57:51,055 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 19:57:51,056 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 19:57:51,056 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 19:57:51,056 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 19:57:51,056 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 19:57:51,057 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 19:57:51,057 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 19:57:51,058 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 19:57:51,058 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 19:57:51,058 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 19:57:51,058 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 19:57:51,059 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 19:57:51,059 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 19:57:51,059 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 19:57:51,059 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 19:57:51,060 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 19:57:51,060 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 19:57:51,061 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 19:57:51,061 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 19:57:51,061 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 19:57:51,062 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 19:57:51,062 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 19:57:51,063 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 19:57:51,064 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 19:57:51,064 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 19:57:51,064 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 19:57:51,065 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 19:57:51,065 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 19:57:51,065 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 19:57:51,065 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 19:57:51,066 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 19:57:51,066 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 19:57:51,067 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 19:57:51,067 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 19:57:51,067 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 19:57:51,068 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 19:57:51,068 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 19:57:51,068 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 19:57:51,068 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 19:57:51,068 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 19:57:51,069 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 19:57:51,069 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 19:57:51,070 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 19:57:51,070 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 19:57:51,070 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 19:57:51,070 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 19:57:51,071 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 19:57:51,071 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 19:57:51,071 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 19:57:51,071 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 19:57:51,072 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 19:57:51,072 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 19:57:51,072 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 19:57:51,073 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 19:57:51,073 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 19:57:51,073 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 19:57:51,073 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 19:57:51,073 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 19:57:51,074 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 19:57:51,074 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 19:57:51,075 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 19:57:51,075 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 19:57:51,075 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 19:57:51,075 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 19:57:51,075 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 19:57:51,076 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 19:57:51,076 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 19:57:51,076 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 19:57:51,077 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 19:57:51,077 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 19:57:51,077 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 19:57:51,078 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 19:57:51,078 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 19:57:51,079 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 19:57:51,079 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 19:57:51,081 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 19:57:51,081 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 19:57:51,082 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 19:57:51,082 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 19:57:51,082 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 19:57:51,082 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 19:57:51,083 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 19:57:51,083 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 19:57:51,083 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 19:57:51,084 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 19:57:51,084 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 19:57:51,084 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 19:57:51,085 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 19:57:51,085 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 19:57:51,085 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 19:57:51,085 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 19:57:51,085 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 19:57:51,086 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 19:57:51,086 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 19:57:51,087 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 19:57:51,087 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 19:57:51,087 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 19:57:51,087 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 19:57:51,088 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 19:57:51,088 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 19:57:51,089 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 19:57:51,090 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 19:57:51,091 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 19:57:51,091 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 19:57:51,091 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 19:57:51,091 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 19:57:51,092 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 19:57:51,092 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 19:57:51,092 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 19:57:51,092 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 19:57:51,093 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 19:57:51,093 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 19:57:51,094 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 19:57:51,094 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 19:57:51,094 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 19:57:51,094 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 19:57:51,095 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 19:57:51,095 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 19:57:51,097 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 19:57:51,097 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 19:57:51,098 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 19:57:51,098 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 19:57:51,098 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 19:57:51,098 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 19:57:51,098 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 19:57:51,099 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 19:57:51,099 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 19:57:51,100 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 19:57:51,100 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 19:57:51,101 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 19:57:51,101 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 19:57:51,101 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 19:57:51,101 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 19:57:51,101 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 19:57:51,102 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 19:57:51,102 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 19:57:51,102 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 19:57:51,103 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 19:57:51,103 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 19:57:51,103 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 19:57:51,104 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 19:57:51,104 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 19:57:51,104 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 19:57:51,104 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 19:57:51,104 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 19:57:51,105 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 19:57:51,105 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 19:57:51,106 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 19:57:51,106 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 19:57:51,106 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 19:57:51,106 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 19:57:51,106 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 19:57:51,107 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 19:57:51,107 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 19:57:51,107 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 19:57:51,108 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 19:57:51,108 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 19:57:51,108 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 19:57:51,109 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 19:57:51,109 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 19:57:51,109 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 19:57:51,109 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 19:57:51,109 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 19:57:51,110 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 19:57:51,110 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 19:57:51,111 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 19:57:51,111 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 19:57:51,111 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 19:57:51,111 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 19:57:51,112 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 19:57:51,112 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 19:57:51,114 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 19:57:51,114 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 19:57:51,114 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 19:57:51,115 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 19:57:51,115 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 19:57:51,115 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 19:57:51,116 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 19:57:51,116 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 19:57:51,117 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 19:57:51,117 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 19:57:51,118 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 19:57:51,118 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 19:57:51,118 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 19:57:51,118 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 19:57:51,122 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 19:57:51,122 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 19:57:51,150 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-15 19:57:51,209 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-11-15 19:57:51,209 INFO L444 ModelExtractionUtils]: 39 out of 43 variables were initially zero. Simplification set additionally 1 variables to zero. [2019-11-15 19:57:51,209 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-15 19:57:51,211 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-11-15 19:57:51,211 INFO L510 LassoAnalysis]: Proved termination. [2019-11-15 19:57:51,212 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_substring_~ps2~0.base)_2, ULTIMATE.start_substring_~ps2~0.offset) = 1*v_rep(select #length ULTIMATE.start_substring_~ps2~0.base)_2 - 1*ULTIMATE.start_substring_~ps2~0.offset Supporting invariants [] [2019-11-15 19:57:51,311 INFO L297 tatePredicateManager]: 23 out of 23 supporting invariants were superfluous and have been removed [2019-11-15 19:57:51,312 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2019-11-15 19:57:51,330 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 19:57:51,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 19:57:51,349 INFO L256 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-15 19:57:51,349 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 19:57:51,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 19:57:51,363 INFO L256 TraceCheckSpWp]: Trace formula consists of 32 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-15 19:57:51,364 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 19:57:51,390 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 19:57:51,390 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2019-11-15 19:57:51,390 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 17 states and 24 transitions. cyclomatic complexity: 9 Second operand 4 states. [2019-11-15 19:57:51,430 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 17 states and 24 transitions. cyclomatic complexity: 9. Second operand 4 states. Result 59 states and 76 transitions. Complement of second has 7 states. [2019-11-15 19:57:51,432 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2019-11-15 19:57:51,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-11-15 19:57:51,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 23 transitions. [2019-11-15 19:57:51,432 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 23 transitions. Stem has 7 letters. Loop has 3 letters. [2019-11-15 19:57:51,433 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 19:57:51,433 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 23 transitions. Stem has 10 letters. Loop has 3 letters. [2019-11-15 19:57:51,433 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 19:57:51,433 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 23 transitions. Stem has 7 letters. Loop has 6 letters. [2019-11-15 19:57:51,433 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 19:57:51,433 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 59 states and 76 transitions. [2019-11-15 19:57:51,436 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2019-11-15 19:57:51,438 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 59 states to 48 states and 64 transitions. [2019-11-15 19:57:51,438 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 17 [2019-11-15 19:57:51,439 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 18 [2019-11-15 19:57:51,439 INFO L73 IsDeterministic]: Start isDeterministic. Operand 48 states and 64 transitions. [2019-11-15 19:57:51,439 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-15 19:57:51,439 INFO L688 BuchiCegarLoop]: Abstraction has 48 states and 64 transitions. [2019-11-15 19:57:51,439 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states and 64 transitions. [2019-11-15 19:57:51,446 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 37. [2019-11-15 19:57:51,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2019-11-15 19:57:51,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 51 transitions. [2019-11-15 19:57:51,450 INFO L711 BuchiCegarLoop]: Abstraction has 37 states and 51 transitions. [2019-11-15 19:57:51,450 INFO L591 BuchiCegarLoop]: Abstraction has 37 states and 51 transitions. [2019-11-15 19:57:51,450 INFO L424 BuchiCegarLoop]: ======== Iteration 4============ [2019-11-15 19:57:51,450 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 37 states and 51 transitions. [2019-11-15 19:57:51,453 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2019-11-15 19:57:51,454 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 19:57:51,454 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 19:57:51,454 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 19:57:51,455 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-11-15 19:57:51,455 INFO L791 eck$LassoCheckResult]: Stem: 398#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 392#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; 393#L565 assume !(main_~length1~0 < 1); 401#L565-2 assume !(main_~length2~0 < 1); 402#L568-1 call main_#t~malloc13.base, main_#t~malloc13.offset := #Ultimate.allocOnStack(main_~length1~0);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc13.base, main_#t~malloc13.offset;call main_#t~malloc14.base, main_#t~malloc14.offset := #Ultimate.allocOnStack(main_~length2~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc14.base, main_#t~malloc14.offset;call write~int(0, main_~nondetString1~0.base, main_~nondetString1~0.offset + (main_~length1~0 - 1), 1);call write~int(0, main_~nondetString2~0.base, main_~nondetString2~0.offset + (main_~length2~0 - 1), 1);substring_#in~s.base, substring_#in~s.offset, substring_#in~t.base, substring_#in~t.offset := main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;havoc substring_#res;havoc substring_#t~post7.base, substring_#t~post7.offset, substring_#t~post8.base, substring_#t~post8.offset, substring_#t~mem3, substring_#t~mem4, substring_#t~mem5, substring_#t~short6, substring_#t~mem9, substring_#t~post10.base, substring_#t~post10.offset, substring_~ps2~0.base, substring_~ps2~0.offset, substring_~pt~0.base, substring_~pt~0.offset, substring_#t~mem2, substring_~s.base, substring_~s.offset, substring_~t.base, substring_~t.offset, substring_~ps~0.base, substring_~ps~0.offset;substring_~s.base, substring_~s.offset := substring_#in~s.base, substring_#in~s.offset;substring_~t.base, substring_~t.offset := substring_#in~t.base, substring_#in~t.offset;substring_~ps~0.base, substring_~ps~0.offset := substring_~s.base, substring_~s.offset; 403#L550-3 call substring_#t~mem2 := read~int(substring_~ps~0.base, substring_~ps~0.offset, 1); 405#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; 414#L553-5 call substring_#t~mem3 := read~int(substring_~pt~0.base, substring_~pt~0.offset, 1);substring_#t~short6 := 0 != substring_#t~mem3; 395#L553-1 [2019-11-15 19:57:51,455 INFO L793 eck$LassoCheckResult]: Loop: 395#L553-1 assume !substring_#t~short6; 409#L553-3 assume !!substring_#t~short6;havoc substring_#t~short6;havoc substring_#t~mem3;havoc substring_#t~mem4;havoc substring_#t~mem5;substring_#t~post7.base, substring_#t~post7.offset := substring_~pt~0.base, substring_~pt~0.offset;substring_~pt~0.base, substring_~pt~0.offset := substring_#t~post7.base, 1 + substring_#t~post7.offset;havoc substring_#t~post7.base, substring_#t~post7.offset;substring_#t~post8.base, substring_#t~post8.offset := substring_~ps2~0.base, substring_~ps2~0.offset;substring_~ps2~0.base, substring_~ps2~0.offset := substring_#t~post8.base, 1 + substring_#t~post8.offset;havoc substring_#t~post8.base, substring_#t~post8.offset; 394#L553-5 call substring_#t~mem3 := read~int(substring_~pt~0.base, substring_~pt~0.offset, 1);substring_#t~short6 := 0 != substring_#t~mem3; 395#L553-1 [2019-11-15 19:57:51,455 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 19:57:51,455 INFO L82 PathProgramCache]: Analyzing trace with hash 180429619, now seen corresponding path program 1 times [2019-11-15 19:57:51,456 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 19:57:51,456 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1491699881] [2019-11-15 19:57:51,456 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 19:57:51,456 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 19:57:51,456 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 19:57:51,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 19:57:51,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 19:57:51,514 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 19:57:51,516 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 19:57:51,517 INFO L82 PathProgramCache]: Analyzing trace with hash 64727, now seen corresponding path program 1 times [2019-11-15 19:57:51,517 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 19:57:51,517 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2094931984] [2019-11-15 19:57:51,518 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 19:57:51,518 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 19:57:51,518 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 19:57:51,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 19:57:51,538 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 19:57:51,538 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2094931984] [2019-11-15 19:57:51,538 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 19:57:51,538 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-15 19:57:51,538 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [390195451] [2019-11-15 19:57:51,539 INFO L808 eck$LassoCheckResult]: loop already infeasible [2019-11-15 19:57:51,539 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 19:57:51,539 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 19:57:51,539 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 19:57:51,539 INFO L87 Difference]: Start difference. First operand 37 states and 51 transitions. cyclomatic complexity: 20 Second operand 3 states. [2019-11-15 19:57:51,567 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 19:57:51,567 INFO L93 Difference]: Finished difference Result 35 states and 44 transitions. [2019-11-15 19:57:51,567 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 19:57:51,567 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 35 states and 44 transitions. [2019-11-15 19:57:51,568 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-11-15 19:57:51,569 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 35 states to 25 states and 32 transitions. [2019-11-15 19:57:51,569 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2019-11-15 19:57:51,569 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2019-11-15 19:57:51,569 INFO L73 IsDeterministic]: Start isDeterministic. Operand 25 states and 32 transitions. [2019-11-15 19:57:51,570 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-15 19:57:51,570 INFO L688 BuchiCegarLoop]: Abstraction has 25 states and 32 transitions. [2019-11-15 19:57:51,570 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states and 32 transitions. [2019-11-15 19:57:51,571 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 23. [2019-11-15 19:57:51,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2019-11-15 19:57:51,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 30 transitions. [2019-11-15 19:57:51,572 INFO L711 BuchiCegarLoop]: Abstraction has 23 states and 30 transitions. [2019-11-15 19:57:51,572 INFO L591 BuchiCegarLoop]: Abstraction has 23 states and 30 transitions. [2019-11-15 19:57:51,572 INFO L424 BuchiCegarLoop]: ======== Iteration 5============ [2019-11-15 19:57:51,572 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 23 states and 30 transitions. [2019-11-15 19:57:51,572 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-11-15 19:57:51,573 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 19:57:51,573 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 19:57:51,573 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 19:57:51,573 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-11-15 19:57:51,573 INFO L791 eck$LassoCheckResult]: Stem: 483#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 474#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; 475#L565 assume !(main_~length1~0 < 1); 484#L565-2 assume !(main_~length2~0 < 1); 485#L568-1 call main_#t~malloc13.base, main_#t~malloc13.offset := #Ultimate.allocOnStack(main_~length1~0);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc13.base, main_#t~malloc13.offset;call main_#t~malloc14.base, main_#t~malloc14.offset := #Ultimate.allocOnStack(main_~length2~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc14.base, main_#t~malloc14.offset;call write~int(0, main_~nondetString1~0.base, main_~nondetString1~0.offset + (main_~length1~0 - 1), 1);call write~int(0, main_~nondetString2~0.base, main_~nondetString2~0.offset + (main_~length2~0 - 1), 1);substring_#in~s.base, substring_#in~s.offset, substring_#in~t.base, substring_#in~t.offset := main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;havoc substring_#res;havoc substring_#t~post7.base, substring_#t~post7.offset, substring_#t~post8.base, substring_#t~post8.offset, substring_#t~mem3, substring_#t~mem4, substring_#t~mem5, substring_#t~short6, substring_#t~mem9, substring_#t~post10.base, substring_#t~post10.offset, substring_~ps2~0.base, substring_~ps2~0.offset, substring_~pt~0.base, substring_~pt~0.offset, substring_#t~mem2, substring_~s.base, substring_~s.offset, substring_~t.base, substring_~t.offset, substring_~ps~0.base, substring_~ps~0.offset;substring_~s.base, substring_~s.offset := substring_#in~s.base, substring_#in~s.offset;substring_~t.base, substring_~t.offset := substring_#in~t.base, substring_#in~t.offset;substring_~ps~0.base, substring_~ps~0.offset := substring_~s.base, substring_~s.offset; 478#L550-3 call substring_#t~mem2 := read~int(substring_~ps~0.base, substring_~ps~0.offset, 1); 479#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; 490#L553-5 call substring_#t~mem3 := read~int(substring_~pt~0.base, substring_~pt~0.offset, 1);substring_#t~short6 := 0 != substring_#t~mem3; 487#L553-1 assume !substring_#t~short6; 488#L553-3 assume !substring_#t~short6;havoc substring_#t~short6;havoc substring_#t~mem3;havoc substring_#t~mem4;havoc substring_#t~mem5; 476#L553-6 call substring_#t~mem9 := read~int(substring_~pt~0.base, substring_~pt~0.offset, 1); 477#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; 480#L550-3 call substring_#t~mem2 := read~int(substring_~ps~0.base, substring_~ps~0.offset, 1); 482#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; 470#L553-5 [2019-11-15 19:57:51,574 INFO L793 eck$LassoCheckResult]: Loop: 470#L553-5 call substring_#t~mem3 := read~int(substring_~pt~0.base, substring_~pt~0.offset, 1);substring_#t~short6 := 0 != substring_#t~mem3; 471#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; 486#L553-3 assume !!substring_#t~short6;havoc substring_#t~short6;havoc substring_#t~mem3;havoc substring_#t~mem4;havoc substring_#t~mem5;substring_#t~post7.base, substring_#t~post7.offset := substring_~pt~0.base, substring_~pt~0.offset;substring_~pt~0.base, substring_~pt~0.offset := substring_#t~post7.base, 1 + substring_#t~post7.offset;havoc substring_#t~post7.base, substring_#t~post7.offset;substring_#t~post8.base, substring_#t~post8.offset := substring_~ps2~0.base, substring_~ps2~0.offset;substring_~ps2~0.base, substring_~ps2~0.offset := substring_#t~post8.base, 1 + substring_#t~post8.offset;havoc substring_#t~post8.base, substring_#t~post8.offset; 470#L553-5 [2019-11-15 19:57:51,574 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 19:57:51,574 INFO L82 PathProgramCache]: Analyzing trace with hash 2012026433, now seen corresponding path program 1 times [2019-11-15 19:57:51,574 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 19:57:51,574 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [783263288] [2019-11-15 19:57:51,574 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 19:57:51,574 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 19:57:51,574 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 19:57:51,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 19:57:51,638 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 19:57:51,639 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [783263288] [2019-11-15 19:57:51,639 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 19:57:51,639 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-15 19:57:51,639 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [990059575] [2019-11-15 19:57:51,639 INFO L796 eck$LassoCheckResult]: stem already infeasible [2019-11-15 19:57:51,639 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 19:57:51,639 INFO L82 PathProgramCache]: Analyzing trace with hash 59685, now seen corresponding path program 2 times [2019-11-15 19:57:51,639 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 19:57:51,639 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1629148697] [2019-11-15 19:57:51,640 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 19:57:51,640 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 19:57:51,640 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 19:57:51,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 19:57:51,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 19:57:51,646 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 19:57:51,755 WARN L191 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 45 [2019-11-15 19:57:51,785 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 19:57:51,785 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-15 19:57:51,785 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-11-15 19:57:51,785 INFO L87 Difference]: Start difference. First operand 23 states and 30 transitions. cyclomatic complexity: 10 Second operand 5 states. [2019-11-15 19:57:51,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 19:57:51,828 INFO L93 Difference]: Finished difference Result 26 states and 32 transitions. [2019-11-15 19:57:51,830 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-15 19:57:51,830 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 26 states and 32 transitions. [2019-11-15 19:57:51,831 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-11-15 19:57:51,831 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 26 states to 23 states and 28 transitions. [2019-11-15 19:57:51,832 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2019-11-15 19:57:51,832 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2019-11-15 19:57:51,832 INFO L73 IsDeterministic]: Start isDeterministic. Operand 23 states and 28 transitions. [2019-11-15 19:57:51,832 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-15 19:57:51,832 INFO L688 BuchiCegarLoop]: Abstraction has 23 states and 28 transitions. [2019-11-15 19:57:51,832 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states and 28 transitions. [2019-11-15 19:57:51,833 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2019-11-15 19:57:51,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2019-11-15 19:57:51,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 28 transitions. [2019-11-15 19:57:51,834 INFO L711 BuchiCegarLoop]: Abstraction has 23 states and 28 transitions. [2019-11-15 19:57:51,834 INFO L591 BuchiCegarLoop]: Abstraction has 23 states and 28 transitions. [2019-11-15 19:57:51,834 INFO L424 BuchiCegarLoop]: ======== Iteration 6============ [2019-11-15 19:57:51,834 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 23 states and 28 transitions. [2019-11-15 19:57:51,835 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-11-15 19:57:51,835 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 19:57:51,835 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 19:57:51,836 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 19:57:51,836 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-11-15 19:57:51,836 INFO L791 eck$LassoCheckResult]: Stem: 542#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 533#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; 534#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.allocOnStack(main_~length1~0);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc13.base, main_#t~malloc13.offset;call main_#t~malloc14.base, main_#t~malloc14.offset := #Ultimate.allocOnStack(main_~length2~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc14.base, main_#t~malloc14.offset;call write~int(0, main_~nondetString1~0.base, main_~nondetString1~0.offset + (main_~length1~0 - 1), 1);call write~int(0, main_~nondetString2~0.base, main_~nondetString2~0.offset + (main_~length2~0 - 1), 1);substring_#in~s.base, substring_#in~s.offset, substring_#in~t.base, substring_#in~t.offset := main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;havoc substring_#res;havoc substring_#t~post7.base, substring_#t~post7.offset, substring_#t~post8.base, substring_#t~post8.offset, substring_#t~mem3, substring_#t~mem4, substring_#t~mem5, substring_#t~short6, substring_#t~mem9, substring_#t~post10.base, substring_#t~post10.offset, substring_~ps2~0.base, substring_~ps2~0.offset, substring_~pt~0.base, substring_~pt~0.offset, substring_#t~mem2, substring_~s.base, substring_~s.offset, substring_~t.base, substring_~t.offset, substring_~ps~0.base, substring_~ps~0.offset;substring_~s.base, substring_~s.offset := substring_#in~s.base, substring_#in~s.offset;substring_~t.base, substring_~t.offset := substring_#in~t.base, substring_#in~t.offset;substring_~ps~0.base, substring_~ps~0.offset := substring_~s.base, substring_~s.offset; 537#L550-3 call substring_#t~mem2 := read~int(substring_~ps~0.base, substring_~ps~0.offset, 1); 538#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; 549#L553-5 call substring_#t~mem3 := read~int(substring_~pt~0.base, substring_~pt~0.offset, 1);substring_#t~short6 := 0 != substring_#t~mem3; 546#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; 547#L553-3 assume !substring_#t~short6;havoc substring_#t~short6;havoc substring_#t~mem3;havoc substring_#t~mem4;havoc substring_#t~mem5; 535#L553-6 call substring_#t~mem9 := read~int(substring_~pt~0.base, substring_~pt~0.offset, 1); 536#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; 539#L550-3 call substring_#t~mem2 := read~int(substring_~ps~0.base, substring_~ps~0.offset, 1); 541#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; 529#L553-5 [2019-11-15 19:57:51,836 INFO L793 eck$LassoCheckResult]: Loop: 529#L553-5 call substring_#t~mem3 := read~int(substring_~pt~0.base, substring_~pt~0.offset, 1);substring_#t~short6 := 0 != substring_#t~mem3; 530#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; 545#L553-3 assume !!substring_#t~short6;havoc substring_#t~short6;havoc substring_#t~mem3;havoc substring_#t~mem4;havoc substring_#t~mem5;substring_#t~post7.base, substring_#t~post7.offset := substring_~pt~0.base, substring_~pt~0.offset;substring_~pt~0.base, substring_~pt~0.offset := substring_#t~post7.base, 1 + substring_#t~post7.offset;havoc substring_#t~post7.base, substring_#t~post7.offset;substring_#t~post8.base, substring_#t~post8.offset := substring_~ps2~0.base, substring_~ps2~0.offset;substring_~ps2~0.base, substring_~ps2~0.offset := substring_#t~post8.base, 1 + substring_#t~post8.offset;havoc substring_#t~post8.base, substring_#t~post8.offset; 529#L553-5 [2019-11-15 19:57:51,836 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 19:57:51,836 INFO L82 PathProgramCache]: Analyzing trace with hash 1954768131, now seen corresponding path program 2 times [2019-11-15 19:57:51,836 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 19:57:51,837 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2067948314] [2019-11-15 19:57:51,837 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 19:57:51,837 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 19:57:51,837 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 19:57:51,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 19:57:51,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 19:57:51,879 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 19:57:51,879 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 19:57:51,879 INFO L82 PathProgramCache]: Analyzing trace with hash 59685, now seen corresponding path program 3 times [2019-11-15 19:57:51,880 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 19:57:51,880 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [788603393] [2019-11-15 19:57:51,880 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 19:57:51,880 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 19:57:51,880 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 19:57:51,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 19:57:51,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 19:57:51,899 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 19:57:51,899 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 19:57:51,900 INFO L82 PathProgramCache]: Analyzing trace with hash -964145949, now seen corresponding path program 1 times [2019-11-15 19:57:51,900 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 19:57:51,900 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1710963877] [2019-11-15 19:57:51,900 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 19:57:51,900 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 19:57:51,900 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 19:57:51,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 19:57:51,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 19:57:51,936 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 19:57:52,054 WARN L191 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 45 [2019-11-15 19:57:52,733 WARN L191 SmtUtils]: Spent 636.00 ms on a formula simplification. DAG size of input: 183 DAG size of output: 146 [2019-11-15 19:57:52,923 WARN L191 SmtUtils]: Spent 173.00 ms on a formula simplification that was a NOOP. DAG size: 112 [2019-11-15 19:57:52,925 INFO L210 LassoAnalysis]: Preferences: [2019-11-15 19:57:52,925 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-11-15 19:57:52,925 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-15 19:57:52,925 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-11-15 19:57:52,925 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-11-15 19:57:52,925 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 19:57:52,925 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-15 19:57:52,926 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-11-15 19:57:52,926 INFO L131 ssoRankerPreferences]: Filename of dumped script: substring-alloca-1.i_Iteration6_Lasso [2019-11-15 19:57:52,926 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-15 19:57:52,926 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-15 19:57:52,930 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 19:57:52,936 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 19:57:52,938 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 19:57:52,939 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 19:57:52,941 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 19:57:52,945 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 19:57:52,950 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 19:57:52,954 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 19:57:52,956 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 19:57:52,958 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 19:57:52,959 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 19:57:52,965 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 19:57:52,966 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 19:57:52,968 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 19:57:53,520 WARN L191 SmtUtils]: Spent 297.00 ms on a formula simplification. DAG size of input: 121 DAG size of output: 101 [2019-11-15 19:57:53,720 WARN L191 SmtUtils]: Spent 160.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 73 [2019-11-15 19:57:53,721 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 19:57:53,722 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 19:57:53,730 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 19:57:53,735 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 19:57:53,737 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 19:57:53,738 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 19:57:53,740 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 19:57:53,741 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 19:57:53,742 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 19:57:53,744 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 19:57:53,746 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 19:57:54,063 WARN L191 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 54 [2019-11-15 19:57:54,553 WARN L191 SmtUtils]: Spent 395.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 46 [2019-11-15 19:57:54,925 WARN L191 SmtUtils]: Spent 318.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 39 [2019-11-15 19:57:55,083 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-15 19:57:55,083 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-11-15 19:57:55,083 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 19:57:55,084 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 19:57:55,084 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 19:57:55,085 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 19:57:55,085 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 19:57:55,085 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 19:57:55,085 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 19:57:55,087 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 19:57:55,087 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 19:57:55,088 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 19:57:55,088 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 19:57:55,088 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 19:57:55,088 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 19:57:55,089 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 19:57:55,089 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 19:57:55,089 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 19:57:55,089 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 19:57:55,090 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 19:57:55,090 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 19:57:55,090 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 19:57:55,091 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 19:57:55,091 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 19:57:55,091 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 19:57:55,091 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 19:57:55,091 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 19:57:55,092 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 19:57:55,092 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 19:57:55,092 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 19:57:55,092 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 19:57:55,093 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 19:57:55,093 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 19:57:55,093 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 19:57:55,093 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 19:57:55,093 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 19:57:55,094 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 19:57:55,094 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 19:57:55,094 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 19:57:55,095 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 19:57:55,095 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 19:57:55,095 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 19:57:55,095 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 19:57:55,095 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 19:57:55,096 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 19:57:55,096 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 19:57:55,096 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 19:57:55,097 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 19:57:55,097 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 19:57:55,097 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 19:57:55,097 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 19:57:55,097 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 19:57:55,097 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 19:57:55,098 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 19:57:55,098 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 19:57:55,098 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 19:57:55,099 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 19:57:55,099 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 19:57:55,099 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 19:57:55,099 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 19:57:55,100 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 19:57:55,100 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 19:57:55,101 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 19:57:55,101 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 19:57:55,102 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 19:57:55,102 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 19:57:55,102 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 19:57:55,102 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 19:57:55,102 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 19:57:55,103 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 19:57:55,103 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 19:57:55,103 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 19:57:55,103 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 19:57:55,104 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 19:57:55,104 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 19:57:55,104 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 19:57:55,104 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 19:57:55,105 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 19:57:55,105 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 19:57:55,107 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 19:57:55,107 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 19:57:55,107 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 19:57:55,108 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 19:57:55,108 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 19:57:55,108 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 19:57:55,108 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 19:57:55,108 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 19:57:55,108 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 19:57:55,109 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 19:57:55,109 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 19:57:55,110 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 19:57:55,110 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 19:57:55,110 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 19:57:55,110 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 19:57:55,111 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 19:57:55,111 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 19:57:55,112 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 19:57:55,112 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 19:57:55,112 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 19:57:55,112 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 19:57:55,113 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 19:57:55,113 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 19:57:55,113 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 19:57:55,113 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 19:57:55,113 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 19:57:55,114 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 19:57:55,114 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 19:57:55,114 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 19:57:55,115 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 19:57:55,115 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 19:57:55,115 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 19:57:55,115 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 19:57:55,115 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 19:57:55,115 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 19:57:55,116 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 19:57:55,116 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 19:57:55,117 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 19:57:55,117 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 19:57:55,117 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 19:57:55,117 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 19:57:55,118 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 19:57:55,118 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 19:57:55,122 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 19:57:55,122 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 19:57:55,123 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 19:57:55,123 INFO L202 nArgumentSynthesizer]: 4 stem disjuncts [2019-11-15 19:57:55,124 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 19:57:55,124 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 19:57:55,127 INFO L400 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2019-11-15 19:57:55,127 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 19:57:55,146 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 19:57:55,147 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 19:57:55,147 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 19:57:55,147 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 19:57:55,148 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 19:57:55,148 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 19:57:55,149 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 19:57:55,149 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 19:57:55,152 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 19:57:55,153 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 19:57:55,153 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 19:57:55,153 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 19:57:55,154 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 19:57:55,154 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 19:57:55,154 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 19:57:55,154 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 19:57:55,155 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 19:57:55,156 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 19:57:55,156 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 19:57:55,156 INFO L202 nArgumentSynthesizer]: 12 stem disjuncts [2019-11-15 19:57:55,156 INFO L203 nArgumentSynthesizer]: 2 loop disjuncts [2019-11-15 19:57:55,157 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 19:57:55,162 INFO L400 nArgumentSynthesizer]: We have 60 Motzkin's Theorem applications. [2019-11-15 19:57:55,162 INFO L401 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2019-11-15 19:57:55,195 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 19:57:55,196 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 19:57:55,196 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 19:57:55,197 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 19:57:55,197 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 19:57:55,197 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 19:57:55,198 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 19:57:55,198 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 19:57:55,199 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 19:57:55,199 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 19:57:55,199 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 19:57:55,199 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 19:57:55,200 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 19:57:55,200 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 19:57:55,200 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 19:57:55,200 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 19:57:55,201 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 19:57:55,202 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 19:57:55,202 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 19:57:55,202 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 19:57:55,203 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 19:57:55,203 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 19:57:55,206 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 19:57:55,206 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 19:57:55,254 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-15 19:57:55,301 INFO L443 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. [2019-11-15 19:57:55,302 INFO L444 ModelExtractionUtils]: 52 out of 58 variables were initially zero. Simplification set additionally 3 variables to zero. [2019-11-15 19:57:55,302 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-15 19:57:55,303 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-11-15 19:57:55,303 INFO L510 LassoAnalysis]: Proved termination. [2019-11-15 19:57:55,303 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_substring_~ps2~0.base)_3, ULTIMATE.start_substring_~ps2~0.offset) = 1*v_rep(select #length ULTIMATE.start_substring_~ps2~0.base)_3 - 1*ULTIMATE.start_substring_~ps2~0.offset Supporting invariants [] [2019-11-15 19:57:55,468 INFO L297 tatePredicateManager]: 45 out of 45 supporting invariants were superfluous and have been removed [2019-11-15 19:57:55,469 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2019-11-15 19:57:55,483 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 19:57:55,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 19:57:55,505 INFO L256 TraceCheckSpWp]: Trace formula consists of 127 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-15 19:57:55,506 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 19:57:55,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 19:57:55,514 INFO L256 TraceCheckSpWp]: Trace formula consists of 32 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-15 19:57:55,515 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 19:57:55,524 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 19:57:55,524 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2019-11-15 19:57:55,524 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 23 states and 28 transitions. cyclomatic complexity: 8 Second operand 4 states. [2019-11-15 19:57:55,546 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 23 states and 28 transitions. cyclomatic complexity: 8. Second operand 4 states. Result 37 states and 43 transitions. Complement of second has 7 states. [2019-11-15 19:57:55,547 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2019-11-15 19:57:55,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-11-15 19:57:55,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 16 transitions. [2019-11-15 19:57:55,548 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 16 transitions. Stem has 14 letters. Loop has 3 letters. [2019-11-15 19:57:55,548 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 19:57:55,548 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-11-15 19:57:55,558 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 19:57:55,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 19:57:55,582 INFO L256 TraceCheckSpWp]: Trace formula consists of 127 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-15 19:57:55,583 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 19:57:55,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 19:57:55,592 INFO L256 TraceCheckSpWp]: Trace formula consists of 32 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-15 19:57:55,592 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 19:57:55,601 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 19:57:55,602 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.1 stem predicates 2 loop predicates [2019-11-15 19:57:55,602 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 23 states and 28 transitions. cyclomatic complexity: 8 Second operand 4 states. [2019-11-15 19:57:55,621 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 23 states and 28 transitions. cyclomatic complexity: 8. Second operand 4 states. Result 37 states and 43 transitions. Complement of second has 7 states. [2019-11-15 19:57:55,624 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2019-11-15 19:57:55,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-11-15 19:57:55,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 16 transitions. [2019-11-15 19:57:55,625 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 16 transitions. Stem has 14 letters. Loop has 3 letters. [2019-11-15 19:57:55,625 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 19:57:55,625 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-11-15 19:57:55,638 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 19:57:55,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 19:57:55,674 INFO L256 TraceCheckSpWp]: Trace formula consists of 127 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-15 19:57:55,675 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 19:57:55,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 19:57:55,685 INFO L256 TraceCheckSpWp]: Trace formula consists of 32 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-15 19:57:55,686 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 19:57:55,696 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 19:57:55,697 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2019-11-15 19:57:55,697 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 23 states and 28 transitions. cyclomatic complexity: 8 Second operand 4 states. [2019-11-15 19:57:55,722 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 23 states and 28 transitions. cyclomatic complexity: 8. Second operand 4 states. Result 37 states and 44 transitions. Complement of second has 6 states. [2019-11-15 19:57:55,723 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2019-11-15 19:57:55,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-11-15 19:57:55,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 23 transitions. [2019-11-15 19:57:55,723 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 23 transitions. Stem has 14 letters. Loop has 3 letters. [2019-11-15 19:57:55,724 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 19:57:55,724 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 23 transitions. Stem has 17 letters. Loop has 3 letters. [2019-11-15 19:57:55,724 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 19:57:55,724 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 23 transitions. Stem has 14 letters. Loop has 6 letters. [2019-11-15 19:57:55,725 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 19:57:55,725 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 37 states and 44 transitions. [2019-11-15 19:57:55,726 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-11-15 19:57:55,727 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 37 states to 0 states and 0 transitions. [2019-11-15 19:57:55,727 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2019-11-15 19:57:55,727 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2019-11-15 19:57:55,727 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2019-11-15 19:57:55,727 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-15 19:57:55,727 INFO L688 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-15 19:57:55,727 INFO L711 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-15 19:57:55,727 INFO L591 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-15 19:57:55,727 INFO L424 BuchiCegarLoop]: ======== Iteration 7============ [2019-11-15 19:57:55,727 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2019-11-15 19:57:55,728 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-11-15 19:57:55,728 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2019-11-15 19:57:55,734 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 15.11 07:57:55 BoogieIcfgContainer [2019-11-15 19:57:55,734 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2019-11-15 19:57:55,735 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-15 19:57:55,735 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-15 19:57:55,735 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-15 19:57:55,735 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 07:57:45" (3/4) ... [2019-11-15 19:57:55,738 INFO L140 WitnessPrinter]: No result that supports witness generation found [2019-11-15 19:57:55,738 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-15 19:57:55,739 INFO L168 Benchmark]: Toolchain (without parser) took 11564.42 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 398.5 MB). Free memory was 944.7 MB in the beginning and 1.2 GB in the end (delta: -293.6 MB). Peak memory consumption was 104.9 MB. Max. memory is 11.5 GB. [2019-11-15 19:57:55,739 INFO L168 Benchmark]: CDTParser took 0.24 ms. Allocated memory is still 1.0 GB. Free memory is still 967.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-15 19:57:55,740 INFO L168 Benchmark]: CACSL2BoogieTranslator took 480.54 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 145.8 MB). Free memory was 944.7 MB in the beginning and 1.1 GB in the end (delta: -183.8 MB). Peak memory consumption was 18.1 MB. Max. memory is 11.5 GB. [2019-11-15 19:57:55,741 INFO L168 Benchmark]: Boogie Procedure Inliner took 46.99 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: 6.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 11.5 GB. [2019-11-15 19:57:55,741 INFO L168 Benchmark]: Boogie Preprocessor took 47.12 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-15 19:57:55,741 INFO L168 Benchmark]: RCFGBuilder took 386.27 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.4 MB). Peak memory consumption was 21.4 MB. Max. memory is 11.5 GB. [2019-11-15 19:57:55,742 INFO L168 Benchmark]: BuchiAutomizer took 10596.38 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 252.7 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -138.0 MB). Peak memory consumption was 114.7 MB. Max. memory is 11.5 GB. [2019-11-15 19:57:55,742 INFO L168 Benchmark]: Witness Printer took 3.40 ms. Allocated memory is still 1.4 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-15 19:57:55,745 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.24 ms. Allocated memory is still 1.0 GB. Free memory is still 967.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 480.54 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 145.8 MB). Free memory was 944.7 MB in the beginning and 1.1 GB in the end (delta: -183.8 MB). Peak memory consumption was 18.1 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 46.99 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: 6.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 47.12 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 386.27 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.4 MB). Peak memory consumption was 21.4 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 10596.38 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 252.7 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -138.0 MB). Peak memory consumption was 114.7 MB. Max. memory is 11.5 GB. * Witness Printer took 3.40 ms. Allocated memory is still 1.4 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 6 terminating modules (3 trivial, 2 deterministic, 1 nondeterministic). One deterministic module has affine ranking function unknown-#length-unknown[__builtin_alloca (length1 * sizeof(char))] + -1 * ps and consists of 3 locations. One deterministic module has affine ranking function unknown-#length-unknown[ps2] + -1 * ps2 and consists of 4 locations. One nondeterministic module has affine ranking function unknown-#length-unknown[ps2] + -1 * ps2 and consists of 4 locations. 3 modules have a trivial ranking function, the largest among these consists of 5 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 10.5s and 7 iterations. TraceHistogramMax:2. Analysis of lassos took 9.7s. Construction of modules took 0.1s. Büchi inclusion checks took 0.5s. 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: 118 SDtfs, 109 SDslu, 42 SDs, 0 SdLazy, 81 SolverSat, 13 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.1s Time LassoAnalysisResults: nont0 unkn0 SFLI2 SFLT0 conc0 concLT0 SILN0 SILU1 SILI0 SILT0 lasso3 LassoPreprocessingBenchmarks: Lassos: inital256 mio100 ax107 hnf99 lsp90 ukn85 mio100 lsp39 div100 bol100 ite100 ukn100 eq195 hnf88 smp94 dnf257 smp87 tf100 neg97 sie111 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 39ms 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...