./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/working_dir_e7e69944-b355-4b5c-9fa3-53d7b673672e/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_e7e69944-b355-4b5c-9fa3-53d7b673672e/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_e7e69944-b355-4b5c-9fa3-53d7b673672e/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_e7e69944-b355-4b5c-9fa3-53d7b673672e/bin/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/termination-memory-alloca/substring-alloca-1.i -s /tmp/vcloud-vcloud-master/worker/working_dir_e7e69944-b355-4b5c-9fa3-53d7b673672e/bin/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_e7e69944-b355-4b5c-9fa3-53d7b673672e/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-10-22 08:57:59,456 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-22 08:57:59,457 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-22 08:57:59,468 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-22 08:57:59,469 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-22 08:57:59,470 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-22 08:57:59,471 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-22 08:57:59,473 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-22 08:57:59,474 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-22 08:57:59,476 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-22 08:57:59,477 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-22 08:57:59,477 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-22 08:57:59,478 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-22 08:57:59,478 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-22 08:57:59,479 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-22 08:57:59,480 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-22 08:57:59,481 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-22 08:57:59,481 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-22 08:57:59,482 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-22 08:57:59,491 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-22 08:57:59,492 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-22 08:57:59,493 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-22 08:57:59,494 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-22 08:57:59,498 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-22 08:57:59,500 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-22 08:57:59,500 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-22 08:57:59,500 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-22 08:57:59,501 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-22 08:57:59,501 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-22 08:57:59,502 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-22 08:57:59,502 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-22 08:57:59,505 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-22 08:57:59,506 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-22 08:57:59,506 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-22 08:57:59,507 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-22 08:57:59,507 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-22 08:57:59,507 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-22 08:57:59,508 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-22 08:57:59,508 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-22 08:57:59,508 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-22 08:57:59,509 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-22 08:57:59,509 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_e7e69944-b355-4b5c-9fa3-53d7b673672e/bin/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf [2019-10-22 08:57:59,525 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-22 08:57:59,525 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-22 08:57:59,526 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-22 08:57:59,526 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-22 08:57:59,537 INFO L138 SettingsManager]: * Use SBE=true [2019-10-22 08:57:59,537 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-10-22 08:57:59,537 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-10-22 08:57:59,537 INFO L138 SettingsManager]: * Use old map elimination=false [2019-10-22 08:57:59,537 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2019-10-22 08:57:59,538 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2019-10-22 08:57:59,538 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-10-22 08:57:59,538 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-22 08:57:59,538 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-10-22 08:57:59,538 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-22 08:57:59,539 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-22 08:57:59,539 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-10-22 08:57:59,539 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-10-22 08:57:59,539 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-10-22 08:57:59,539 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-22 08:57:59,539 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-10-22 08:57:59,540 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-22 08:57:59,540 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-10-22 08:57:59,540 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-22 08:57:59,540 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-22 08:57:59,540 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-10-22 08:57:59,541 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-22 08:57:59,541 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-22 08:57:59,541 INFO L138 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-10-22 08:57:59,542 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-10-22 08:57:59,542 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/working_dir_e7e69944-b355-4b5c-9fa3-53d7b673672e/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-10-22 08:57:59,576 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-22 08:57:59,587 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-22 08:57:59,590 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-22 08:57:59,592 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-22 08:57:59,592 INFO L275 PluginConnector]: CDTParser initialized [2019-10-22 08:57:59,593 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_e7e69944-b355-4b5c-9fa3-53d7b673672e/bin/uautomizer/../../sv-benchmarks/c/termination-memory-alloca/substring-alloca-1.i [2019-10-22 08:57:59,645 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_e7e69944-b355-4b5c-9fa3-53d7b673672e/bin/uautomizer/data/abc9a863b/4e013e88236747228c32efcc151051de/FLAGb755b0ddb [2019-10-22 08:58:00,071 INFO L306 CDTParser]: Found 1 translation units. [2019-10-22 08:58:00,072 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_e7e69944-b355-4b5c-9fa3-53d7b673672e/sv-benchmarks/c/termination-memory-alloca/substring-alloca-1.i [2019-10-22 08:58:00,081 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_e7e69944-b355-4b5c-9fa3-53d7b673672e/bin/uautomizer/data/abc9a863b/4e013e88236747228c32efcc151051de/FLAGb755b0ddb [2019-10-22 08:58:00,432 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_e7e69944-b355-4b5c-9fa3-53d7b673672e/bin/uautomizer/data/abc9a863b/4e013e88236747228c32efcc151051de [2019-10-22 08:58:00,434 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-22 08:58:00,436 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-10-22 08:58:00,436 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-22 08:58:00,437 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-22 08:58:00,440 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-22 08:58:00,441 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.10 08:58:00" (1/1) ... [2019-10-22 08:58:00,443 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@53867d70 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:58:00, skipping insertion in model container [2019-10-22 08:58:00,443 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.10 08:58:00" (1/1) ... [2019-10-22 08:58:00,450 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-22 08:58:00,490 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-22 08:58:00,903 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-22 08:58:00,913 INFO L188 MainTranslator]: Completed pre-run [2019-10-22 08:58:00,958 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-22 08:58:00,994 INFO L192 MainTranslator]: Completed translation [2019-10-22 08:58:00,994 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:58:00 WrapperNode [2019-10-22 08:58:00,995 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-22 08:58:00,995 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-10-22 08:58:00,995 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-10-22 08:58:00,995 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-10-22 08:58:01,003 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:58:00" (1/1) ... [2019-10-22 08:58:01,014 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:58:00" (1/1) ... [2019-10-22 08:58:01,030 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-10-22 08:58:01,031 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-22 08:58:01,031 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-22 08:58:01,031 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-22 08:58:01,037 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:58:00" (1/1) ... [2019-10-22 08:58:01,038 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:58:00" (1/1) ... [2019-10-22 08:58:01,040 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:58:00" (1/1) ... [2019-10-22 08:58:01,040 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:58:00" (1/1) ... [2019-10-22 08:58:01,045 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:58:00" (1/1) ... [2019-10-22 08:58:01,050 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:58:00" (1/1) ... [2019-10-22 08:58:01,051 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:58:00" (1/1) ... [2019-10-22 08:58:01,053 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-22 08:58:01,053 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-22 08:58:01,053 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-22 08:58:01,053 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-22 08:58:01,054 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:58:00" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_e7e69944-b355-4b5c-9fa3-53d7b673672e/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-10-22 08:58:01,099 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-10-22 08:58:01,099 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-10-22 08:58:01,100 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-10-22 08:58:01,100 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-10-22 08:58:01,100 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-22 08:58:01,100 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-22 08:58:01,298 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-22 08:58:01,298 INFO L284 CfgBuilder]: Removed 8 assume(true) statements. [2019-10-22 08:58:01,299 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 08:58:01 BoogieIcfgContainer [2019-10-22 08:58:01,299 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-22 08:58:01,300 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-10-22 08:58:01,300 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-10-22 08:58:01,303 INFO L275 PluginConnector]: BuchiAutomizer initialized [2019-10-22 08:58:01,304 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-10-22 08:58:01,304 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 22.10 08:58:00" (1/3) ... [2019-10-22 08:58:01,305 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@1f63eab6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 22.10 08:58:01, skipping insertion in model container [2019-10-22 08:58:01,305 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-10-22 08:58:01,305 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:58:00" (2/3) ... [2019-10-22 08:58:01,306 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@1f63eab6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 22.10 08:58:01, skipping insertion in model container [2019-10-22 08:58:01,306 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-10-22 08:58:01,306 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 08:58:01" (3/3) ... [2019-10-22 08:58:01,307 INFO L371 chiAutomizerObserver]: Analyzing ICFG substring-alloca-1.i [2019-10-22 08:58:01,380 INFO L356 BuchiCegarLoop]: Interprodecural is true [2019-10-22 08:58:01,381 INFO L357 BuchiCegarLoop]: Hoare is false [2019-10-22 08:58:01,382 INFO L358 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-10-22 08:58:01,382 INFO L359 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-22 08:58:01,382 INFO L360 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-22 08:58:01,382 INFO L361 BuchiCegarLoop]: Difference is false [2019-10-22 08:58:01,382 INFO L362 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-22 08:58:01,382 INFO L365 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-10-22 08:58:01,397 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states. [2019-10-22 08:58:01,418 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2019-10-22 08:58:01,418 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 08:58:01,418 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 08:58:01,426 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2019-10-22 08:58:01,426 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2019-10-22 08:58:01,426 INFO L424 BuchiCegarLoop]: ======== Iteration 1============ [2019-10-22 08:58:01,427 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states. [2019-10-22 08:58:01,428 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2019-10-22 08:58:01,428 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 08:58:01,428 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 08:58:01,428 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2019-10-22 08:58:01,428 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2019-10-22 08:58:01,437 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-10-22 08:58:01,437 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-10-22 08:58:01,443 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:58:01,443 INFO L82 PathProgramCache]: Analyzing trace with hash 28695878, now seen corresponding path program 1 times [2019-10-22 08:58:01,451 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:58:01,451 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [613951641] [2019-10-22 08:58:01,451 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:58:01,452 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:58:01,452 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:58:01,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:58:01,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:58:01,630 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:58:01,632 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:58:01,632 INFO L82 PathProgramCache]: Analyzing trace with hash 47887114, now seen corresponding path program 1 times [2019-10-22 08:58:01,632 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:58:01,632 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1706891110] [2019-10-22 08:58:01,633 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:58:01,633 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:58:01,633 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:58:01,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:58:01,666 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:58:01,666 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1706891110] [2019-10-22 08:58:01,667 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:58:01,667 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-10-22 08:58:01,667 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2122124912] [2019-10-22 08:58:01,671 INFO L808 eck$LassoCheckResult]: loop already infeasible [2019-10-22 08:58:01,672 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:58:01,682 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-10-22 08:58:01,683 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-10-22 08:58:01,684 INFO L87 Difference]: Start difference. First operand 17 states. Second operand 2 states. [2019-10-22 08:58:01,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:58:01,690 INFO L93 Difference]: Finished difference Result 17 states and 22 transitions. [2019-10-22 08:58:01,690 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-10-22 08:58:01,692 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 17 states and 22 transitions. [2019-10-22 08:58:01,693 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2019-10-22 08:58:01,697 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 17 states to 12 states and 16 transitions. [2019-10-22 08:58:01,698 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 12 [2019-10-22 08:58:01,698 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 12 [2019-10-22 08:58:01,699 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 16 transitions. [2019-10-22 08:58:01,700 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-10-22 08:58:01,700 INFO L688 BuchiCegarLoop]: Abstraction has 12 states and 16 transitions. [2019-10-22 08:58:01,716 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states and 16 transitions. [2019-10-22 08:58:01,723 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2019-10-22 08:58:01,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2019-10-22 08:58:01,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 16 transitions. [2019-10-22 08:58:01,725 INFO L711 BuchiCegarLoop]: Abstraction has 12 states and 16 transitions. [2019-10-22 08:58:01,726 INFO L591 BuchiCegarLoop]: Abstraction has 12 states and 16 transitions. [2019-10-22 08:58:01,726 INFO L424 BuchiCegarLoop]: ======== Iteration 2============ [2019-10-22 08:58:01,726 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 12 states and 16 transitions. [2019-10-22 08:58:01,726 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2019-10-22 08:58:01,726 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 08:58:01,727 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 08:58:01,727 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2019-10-22 08:58:01,727 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2019-10-22 08:58:01,727 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-10-22 08:58:01,728 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~mem5;havoc substring_#t~short6;havoc substring_#t~mem3;havoc substring_#t~mem4; 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-10-22 08:58:01,728 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:58:01,728 INFO L82 PathProgramCache]: Analyzing trace with hash 28695878, now seen corresponding path program 2 times [2019-10-22 08:58:01,728 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:58:01,728 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [978469431] [2019-10-22 08:58:01,728 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:58:01,729 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:58:01,729 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:58:01,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:58:01,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:58:01,762 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:58:01,763 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:58:01,763 INFO L82 PathProgramCache]: Analyzing trace with hash -1237496093, now seen corresponding path program 1 times [2019-10-22 08:58:01,763 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:58:01,763 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1629592555] [2019-10-22 08:58:01,764 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:58:01,764 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:58:01,764 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:58:01,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:58:01,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:58:01,796 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:58:01,800 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:58:01,800 INFO L82 PathProgramCache]: Analyzing trace with hash -1302992386, now seen corresponding path program 1 times [2019-10-22 08:58:01,800 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:58:01,801 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [634068622] [2019-10-22 08:58:01,801 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:58:01,801 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:58:01,801 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:58:01,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:58:01,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:58:01,925 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:58:02,165 WARN L191 SmtUtils]: Spent 234.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 60 [2019-10-22 08:58:02,511 WARN L191 SmtUtils]: Spent 287.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 87 [2019-10-22 08:58:02,621 WARN L191 SmtUtils]: Spent 107.00 ms on a formula simplification that was a NOOP. DAG size: 81 [2019-10-22 08:58:02,633 INFO L210 LassoAnalysis]: Preferences: [2019-10-22 08:58:02,634 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-10-22 08:58:02,635 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-10-22 08:58:02,635 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-10-22 08:58:02,635 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-10-22 08:58:02,636 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 08:58:02,636 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-10-22 08:58:02,636 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-10-22 08:58:02,637 INFO L131 ssoRankerPreferences]: Filename of dumped script: substring-alloca-1.i_Iteration2_Lasso [2019-10-22 08:58:02,637 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-10-22 08:58:02,637 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-10-22 08:58:02,662 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:58:02,669 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:58:03,028 WARN L191 SmtUtils]: Spent 174.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 65 [2019-10-22 08:58:03,186 WARN L191 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 52 [2019-10-22 08:58:03,186 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:58:03,189 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:58:03,192 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:58:03,194 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:58:03,197 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:58:03,201 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:58:03,203 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:58:03,206 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:58:03,208 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:58:03,210 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:58:03,213 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:58:03,215 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:58:03,218 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:58:03,222 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:58:03,224 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:58:03,226 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:58:03,229 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:58:03,232 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:58:03,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-10-22 08:58:03,236 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:58:03,239 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:58:03,641 WARN L191 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 27 DAG size of output: 25 [2019-10-22 08:58:04,002 WARN L191 SmtUtils]: Spent 344.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 40 [2019-10-22 08:58:04,141 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-10-22 08:58:04,151 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-10-22 08:58:04,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-10-22 08:58:04,154 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:58:04,154 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:58:04,155 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:58:04,156 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:58:04,156 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:58:04,157 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:58:04,158 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:58:04,159 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:58:04,161 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-10-22 08:58:04,161 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:58:04,161 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:58:04,162 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:58:04,162 INFO L203 nArgumentSynthesizer]: 6 loop disjuncts [2019-10-22 08:58:04,162 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:58:04,165 INFO L400 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2019-10-22 08:58:04,165 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:58:04,205 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:58:04,206 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-10-22 08:58:04,207 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:58:04,209 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:58:04,209 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:58:04,209 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:58:04,212 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:58:04,213 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:58:04,215 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:58:04,220 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-10-22 08:58:04,222 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:58:04,222 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:58:04,223 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:58:04,223 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:58:04,225 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:58:04,225 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:58:04,233 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:58:04,238 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-10-22 08:58:04,239 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:58:04,239 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:58:04,239 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:58:04,239 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:58:04,240 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:58:04,240 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:58:04,240 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:58:04,241 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:58:04,242 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-10-22 08:58:04,242 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:58:04,243 INFO L202 nArgumentSynthesizer]: 4 stem disjuncts [2019-10-22 08:58:04,243 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:58:04,243 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:58:04,255 INFO L400 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2019-10-22 08:58:04,258 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:58:04,321 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:58:04,324 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-10-22 08:58:04,326 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:58:04,326 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:58:04,327 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:58:04,327 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:58:04,330 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:58:04,330 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:58:04,367 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-10-22 08:58:04,394 INFO L443 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. [2019-10-22 08:58:04,394 INFO L444 ModelExtractionUtils]: 26 out of 31 variables were initially zero. Simplification set additionally 2 variables to zero. [2019-10-22 08:58:04,396 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-10-22 08:58:04,397 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-10-22 08:58:04,398 INFO L510 LassoAnalysis]: Proved termination. [2019-10-22 08:58:04,398 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-10-22 08:58:04,425 INFO L297 tatePredicateManager]: 8 out of 9 supporting invariants were superfluous and have been removed [2019-10-22 08:58:04,434 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2019-10-22 08:58:04,461 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:58:04,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:58:04,481 INFO L256 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 10 conjunts are in the unsatisfiable core [2019-10-22 08:58:04,482 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:58:04,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:58:04,499 INFO L256 TraceCheckSpWp]: Trace formula consists of 52 conjuncts, 8 conjunts are in the unsatisfiable core [2019-10-22 08:58:04,500 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:58:04,516 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:58:04,520 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-10-22 08:58:04,521 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 12 states and 16 transitions. cyclomatic complexity: 5 Second operand 3 states. [2019-10-22 08:58:04,583 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-10-22 08:58:04,584 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-10-22 08:58:04,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-10-22 08:58:04,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 16 transitions. [2019-10-22 08:58:04,587 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 16 transitions. Stem has 5 letters. Loop has 7 letters. [2019-10-22 08:58:04,588 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 08:58:04,588 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 16 transitions. Stem has 12 letters. Loop has 7 letters. [2019-10-22 08:58:04,588 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 08:58:04,589 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 16 transitions. Stem has 5 letters. Loop has 14 letters. [2019-10-22 08:58:04,589 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 08:58:04,589 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 19 states and 26 transitions. [2019-10-22 08:58:04,590 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-10-22 08:58:04,591 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 19 states to 17 states and 24 transitions. [2019-10-22 08:58:04,591 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9 [2019-10-22 08:58:04,591 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2019-10-22 08:58:04,591 INFO L73 IsDeterministic]: Start isDeterministic. Operand 17 states and 24 transitions. [2019-10-22 08:58:04,592 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-10-22 08:58:04,592 INFO L688 BuchiCegarLoop]: Abstraction has 17 states and 24 transitions. [2019-10-22 08:58:04,592 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states and 24 transitions. [2019-10-22 08:58:04,593 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2019-10-22 08:58:04,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2019-10-22 08:58:04,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 24 transitions. [2019-10-22 08:58:04,594 INFO L711 BuchiCegarLoop]: Abstraction has 17 states and 24 transitions. [2019-10-22 08:58:04,594 INFO L591 BuchiCegarLoop]: Abstraction has 17 states and 24 transitions. [2019-10-22 08:58:04,594 INFO L424 BuchiCegarLoop]: ======== Iteration 3============ [2019-10-22 08:58:04,594 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states and 24 transitions. [2019-10-22 08:58:04,595 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-10-22 08:58:04,595 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 08:58:04,595 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 08:58:04,596 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2019-10-22 08:58:04,596 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-10-22 08:58:04,596 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-10-22 08:58:04,596 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~mem5;havoc substring_#t~short6;havoc substring_#t~mem3;havoc substring_#t~mem4;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-10-22 08:58:04,596 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:58:04,597 INFO L82 PathProgramCache]: Analyzing trace with hash 1806935627, now seen corresponding path program 1 times [2019-10-22 08:58:04,597 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:58:04,597 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2071072374] [2019-10-22 08:58:04,597 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:58:04,597 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:58:04,597 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:58:04,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:58:04,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:58:04,629 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:58:04,630 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:58:04,630 INFO L82 PathProgramCache]: Analyzing trace with hash 59685, now seen corresponding path program 1 times [2019-10-22 08:58:04,630 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:58:04,630 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [802793726] [2019-10-22 08:58:04,631 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:58:04,631 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:58:04,631 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:58:04,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:58:04,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:58:04,642 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:58:04,642 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:58:04,642 INFO L82 PathProgramCache]: Analyzing trace with hash 1594173083, now seen corresponding path program 1 times [2019-10-22 08:58:04,643 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:58:04,643 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [236814063] [2019-10-22 08:58:04,643 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:58:04,643 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:58:04,643 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:58:04,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:58:04,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:58:04,694 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:58:04,803 WARN L191 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 45 [2019-10-22 08:58:05,161 WARN L191 SmtUtils]: Spent 326.00 ms on a formula simplification. DAG size of input: 119 DAG size of output: 103 [2019-10-22 08:58:05,278 WARN L191 SmtUtils]: Spent 115.00 ms on a formula simplification that was a NOOP. DAG size: 95 [2019-10-22 08:58:05,280 INFO L210 LassoAnalysis]: Preferences: [2019-10-22 08:58:05,280 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-10-22 08:58:05,280 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-10-22 08:58:05,280 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-10-22 08:58:05,280 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-10-22 08:58:05,281 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 08:58:05,281 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-10-22 08:58:05,281 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-10-22 08:58:05,281 INFO L131 ssoRankerPreferences]: Filename of dumped script: substring-alloca-1.i_Iteration3_Lasso [2019-10-22 08:58:05,281 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-10-22 08:58:05,281 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-10-22 08:58:05,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-10-22 08:58:05,289 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:58:05,290 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:58:05,292 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:58:05,293 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:58:05,295 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:58:05,296 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:58:05,298 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:58:05,299 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:58:05,308 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:58:05,310 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:58:05,312 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:58:05,315 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:58:05,316 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:58:05,319 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:58:05,321 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:58:05,323 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:58:05,325 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:58:05,327 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:58:05,328 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:58:05,331 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:58:05,669 WARN L191 SmtUtils]: Spent 193.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 85 [2019-10-22 08:58:05,820 WARN L191 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 60 [2019-10-22 08:58:05,820 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:58:05,822 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:58:05,824 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:58:06,599 WARN L191 SmtUtils]: Spent 323.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 46 [2019-10-22 08:58:06,651 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-10-22 08:58:06,651 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-10-22 08:58:06,651 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-10-22 08:58:06,652 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:58:06,652 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:58:06,652 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:58:06,652 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:58:06,652 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:58:06,653 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:58:06,653 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:58:06,653 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:58:06,654 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-10-22 08:58:06,654 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:58:06,654 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:58:06,654 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:58:06,662 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:58:06,662 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:58:06,662 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:58:06,662 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:58:06,663 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:58:06,663 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-10-22 08:58:06,663 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:58:06,664 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:58:06,664 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:58:06,664 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:58:06,665 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:58:06,665 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:58:06,667 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:58:06,667 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-10-22 08:58:06,668 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:58:06,668 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:58:06,668 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:58:06,668 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:58:06,668 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:58:06,669 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:58:06,669 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:58:06,669 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:58:06,670 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-10-22 08:58:06,670 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:58:06,670 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:58:06,670 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:58:06,671 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:58:06,671 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:58:06,671 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:58:06,671 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:58:06,672 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:58:06,672 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-10-22 08:58:06,673 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:58:06,673 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:58:06,673 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:58:06,673 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:58:06,673 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:58:06,673 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:58:06,673 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:58:06,674 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:58:06,674 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-10-22 08:58:06,675 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:58:06,675 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:58:06,675 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:58:06,676 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:58:06,676 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:58:06,676 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:58:06,676 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:58:06,676 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:58:06,677 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-10-22 08:58:06,677 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:58:06,677 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:58:06,677 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:58:06,678 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:58:06,678 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:58:06,678 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:58:06,678 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:58:06,679 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:58:06,679 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-10-22 08:58:06,680 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:58:06,680 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:58:06,680 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:58:06,680 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:58:06,681 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:58:06,681 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:58:06,684 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:58:06,684 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-10-22 08:58:06,684 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:58:06,685 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:58:06,685 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:58:06,685 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:58:06,685 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:58:06,685 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:58:06,685 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:58:06,686 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:58:06,686 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-10-22 08:58:06,687 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:58:06,687 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:58:06,687 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:58:06,687 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:58:06,687 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:58:06,688 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:58:06,688 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:58:06,688 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:58:06,689 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-10-22 08:58:06,689 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:58:06,689 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:58:06,689 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:58:06,689 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:58:06,690 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:58:06,690 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:58:06,692 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:58:06,692 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-10-22 08:58:06,693 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:58:06,693 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:58:06,693 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:58:06,693 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:58:06,693 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:58:06,694 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:58:06,694 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:58:06,694 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:58:06,695 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-10-22 08:58:06,695 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:58:06,695 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:58:06,695 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:58:06,695 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:58:06,696 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:58:06,696 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:58:06,697 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:58:06,698 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-10-22 08:58:06,698 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:58:06,698 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:58:06,699 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:58:06,699 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:58:06,699 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:58:06,700 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:58:06,700 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:58:06,700 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:58:06,701 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-10-22 08:58:06,701 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:58:06,701 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:58:06,701 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:58:06,701 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:58:06,701 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:58:06,702 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:58:06,702 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:58:06,702 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:58:06,703 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-10-22 08:58:06,703 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:58:06,703 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:58:06,704 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:58:06,704 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:58:06,704 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:58:06,704 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:58:06,704 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:58:06,705 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:58:06,705 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-10-22 08:58:06,705 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:58:06,705 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:58:06,706 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:58:06,706 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:58:06,706 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:58:06,706 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:58:06,706 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:58:06,707 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:58:06,707 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-10-22 08:58:06,708 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:58:06,708 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:58:06,708 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:58:06,708 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:58:06,708 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:58:06,709 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:58:06,709 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:58:06,709 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:58:06,710 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-10-22 08:58:06,710 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:58:06,710 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:58:06,710 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:58:06,711 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:58:06,712 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:58:06,712 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:58:06,713 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:58:06,713 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-10-22 08:58:06,714 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:58:06,714 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:58:06,714 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:58:06,714 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:58:06,715 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:58:06,715 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:58:06,717 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:58:06,717 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-10-22 08:58:06,717 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:58:06,718 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:58:06,718 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:58:06,718 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:58:06,721 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:58:06,721 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:58:06,752 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-10-22 08:58:06,803 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-10-22 08:58:06,803 INFO L444 ModelExtractionUtils]: 39 out of 43 variables were initially zero. Simplification set additionally 1 variables to zero. [2019-10-22 08:58:06,804 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-10-22 08:58:06,804 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-10-22 08:58:06,805 INFO L510 LassoAnalysis]: Proved termination. [2019-10-22 08:58:06,805 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_substring_~ps2~0.offset, v_rep(select #length ULTIMATE.start_substring_~ps2~0.base)_2) = -1*ULTIMATE.start_substring_~ps2~0.offset + 1*v_rep(select #length ULTIMATE.start_substring_~ps2~0.base)_2 Supporting invariants [] [2019-10-22 08:58:06,872 INFO L297 tatePredicateManager]: 23 out of 23 supporting invariants were superfluous and have been removed [2019-10-22 08:58:06,874 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2019-10-22 08:58:06,885 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:58:06,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:58:06,906 INFO L256 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 2 conjunts are in the unsatisfiable core [2019-10-22 08:58:06,907 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:58:06,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:58:06,920 INFO L256 TraceCheckSpWp]: Trace formula consists of 32 conjuncts, 6 conjunts are in the unsatisfiable core [2019-10-22 08:58:06,920 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:58:06,936 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:58:06,936 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-10-22 08:58:06,936 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 17 states and 24 transitions. cyclomatic complexity: 9 Second operand 4 states. [2019-10-22 08:58:06,970 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-10-22 08:58:06,972 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-10-22 08:58:06,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-10-22 08:58:06,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 23 transitions. [2019-10-22 08:58:06,972 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 23 transitions. Stem has 7 letters. Loop has 3 letters. [2019-10-22 08:58:06,973 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 08:58:06,973 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 23 transitions. Stem has 10 letters. Loop has 3 letters. [2019-10-22 08:58:06,973 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 08:58:06,973 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 23 transitions. Stem has 7 letters. Loop has 6 letters. [2019-10-22 08:58:06,973 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 08:58:06,973 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 59 states and 76 transitions. [2019-10-22 08:58:06,975 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2019-10-22 08:58:06,977 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 59 states to 48 states and 64 transitions. [2019-10-22 08:58:06,978 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 17 [2019-10-22 08:58:06,978 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 18 [2019-10-22 08:58:06,978 INFO L73 IsDeterministic]: Start isDeterministic. Operand 48 states and 64 transitions. [2019-10-22 08:58:06,978 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-10-22 08:58:06,978 INFO L688 BuchiCegarLoop]: Abstraction has 48 states and 64 transitions. [2019-10-22 08:58:06,978 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states and 64 transitions. [2019-10-22 08:58:06,983 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 37. [2019-10-22 08:58:06,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2019-10-22 08:58:06,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 51 transitions. [2019-10-22 08:58:06,987 INFO L711 BuchiCegarLoop]: Abstraction has 37 states and 51 transitions. [2019-10-22 08:58:06,988 INFO L591 BuchiCegarLoop]: Abstraction has 37 states and 51 transitions. [2019-10-22 08:58:06,988 INFO L424 BuchiCegarLoop]: ======== Iteration 4============ [2019-10-22 08:58:06,988 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 37 states and 51 transitions. [2019-10-22 08:58:06,989 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2019-10-22 08:58:06,989 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 08:58:06,989 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 08:58:06,989 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 08:58:06,989 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-10-22 08:58:06,989 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-10-22 08:58:06,989 INFO L793 eck$LassoCheckResult]: Loop: 395#L553-1 assume !substring_#t~short6; 409#L553-3 assume !!substring_#t~short6;havoc substring_#t~mem5;havoc substring_#t~short6;havoc substring_#t~mem3;havoc substring_#t~mem4;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-10-22 08:58:06,990 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:58:06,990 INFO L82 PathProgramCache]: Analyzing trace with hash 180429619, now seen corresponding path program 1 times [2019-10-22 08:58:06,990 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:58:06,990 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1976501592] [2019-10-22 08:58:06,990 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:58:06,990 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:58:06,990 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:58:07,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:58:07,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:58:07,030 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:58:07,030 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:58:07,030 INFO L82 PathProgramCache]: Analyzing trace with hash 64727, now seen corresponding path program 1 times [2019-10-22 08:58:07,030 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:58:07,030 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [513681244] [2019-10-22 08:58:07,031 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:58:07,031 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:58:07,031 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:58:07,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:58:07,039 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:58:07,039 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [513681244] [2019-10-22 08:58:07,040 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:58:07,040 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-10-22 08:58:07,040 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1809727469] [2019-10-22 08:58:07,040 INFO L808 eck$LassoCheckResult]: loop already infeasible [2019-10-22 08:58:07,040 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:58:07,040 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 08:58:07,041 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 08:58:07,041 INFO L87 Difference]: Start difference. First operand 37 states and 51 transitions. cyclomatic complexity: 20 Second operand 3 states. [2019-10-22 08:58:07,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:58:07,052 INFO L93 Difference]: Finished difference Result 35 states and 44 transitions. [2019-10-22 08:58:07,053 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 08:58:07,053 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 35 states and 44 transitions. [2019-10-22 08:58:07,054 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-10-22 08:58:07,054 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 35 states to 25 states and 32 transitions. [2019-10-22 08:58:07,054 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2019-10-22 08:58:07,054 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2019-10-22 08:58:07,055 INFO L73 IsDeterministic]: Start isDeterministic. Operand 25 states and 32 transitions. [2019-10-22 08:58:07,055 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-10-22 08:58:07,055 INFO L688 BuchiCegarLoop]: Abstraction has 25 states and 32 transitions. [2019-10-22 08:58:07,055 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states and 32 transitions. [2019-10-22 08:58:07,056 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 23. [2019-10-22 08:58:07,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2019-10-22 08:58:07,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 30 transitions. [2019-10-22 08:58:07,056 INFO L711 BuchiCegarLoop]: Abstraction has 23 states and 30 transitions. [2019-10-22 08:58:07,057 INFO L591 BuchiCegarLoop]: Abstraction has 23 states and 30 transitions. [2019-10-22 08:58:07,057 INFO L424 BuchiCegarLoop]: ======== Iteration 5============ [2019-10-22 08:58:07,057 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 23 states and 30 transitions. [2019-10-22 08:58:07,057 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-10-22 08:58:07,057 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 08:58:07,057 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 08:58:07,058 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 08:58:07,058 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-10-22 08:58:07,058 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~mem5;havoc substring_#t~short6;havoc substring_#t~mem3;havoc substring_#t~mem4; 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-10-22 08:58:07,058 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~mem5;havoc substring_#t~short6;havoc substring_#t~mem3;havoc substring_#t~mem4;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-10-22 08:58:07,058 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:58:07,059 INFO L82 PathProgramCache]: Analyzing trace with hash 2012026433, now seen corresponding path program 1 times [2019-10-22 08:58:07,059 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:58:07,059 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1229701481] [2019-10-22 08:58:07,059 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:58:07,059 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:58:07,059 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:58:07,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:58:07,090 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:58:07,090 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1229701481] [2019-10-22 08:58:07,090 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:58:07,090 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-22 08:58:07,090 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1818671377] [2019-10-22 08:58:07,091 INFO L796 eck$LassoCheckResult]: stem already infeasible [2019-10-22 08:58:07,091 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:58:07,091 INFO L82 PathProgramCache]: Analyzing trace with hash 59685, now seen corresponding path program 2 times [2019-10-22 08:58:07,091 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:58:07,091 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1889341737] [2019-10-22 08:58:07,091 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:58:07,092 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:58:07,092 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:58:07,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:58:07,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:58:07,099 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:58:07,212 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:58:07,212 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-22 08:58:07,212 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-10-22 08:58:07,212 INFO L87 Difference]: Start difference. First operand 23 states and 30 transitions. cyclomatic complexity: 10 Second operand 5 states. [2019-10-22 08:58:07,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:58:07,242 INFO L93 Difference]: Finished difference Result 26 states and 32 transitions. [2019-10-22 08:58:07,243 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-22 08:58:07,243 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 26 states and 32 transitions. [2019-10-22 08:58:07,244 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-10-22 08:58:07,244 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 26 states to 23 states and 28 transitions. [2019-10-22 08:58:07,244 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2019-10-22 08:58:07,244 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2019-10-22 08:58:07,244 INFO L73 IsDeterministic]: Start isDeterministic. Operand 23 states and 28 transitions. [2019-10-22 08:58:07,244 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-10-22 08:58:07,244 INFO L688 BuchiCegarLoop]: Abstraction has 23 states and 28 transitions. [2019-10-22 08:58:07,245 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states and 28 transitions. [2019-10-22 08:58:07,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2019-10-22 08:58:07,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2019-10-22 08:58:07,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 28 transitions. [2019-10-22 08:58:07,246 INFO L711 BuchiCegarLoop]: Abstraction has 23 states and 28 transitions. [2019-10-22 08:58:07,246 INFO L591 BuchiCegarLoop]: Abstraction has 23 states and 28 transitions. [2019-10-22 08:58:07,246 INFO L424 BuchiCegarLoop]: ======== Iteration 6============ [2019-10-22 08:58:07,247 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 23 states and 28 transitions. [2019-10-22 08:58:07,247 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-10-22 08:58:07,247 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 08:58:07,247 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 08:58:07,248 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 08:58:07,248 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-10-22 08:58:07,248 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~mem5;havoc substring_#t~short6;havoc substring_#t~mem3;havoc substring_#t~mem4; 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-10-22 08:58:07,248 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~mem5;havoc substring_#t~short6;havoc substring_#t~mem3;havoc substring_#t~mem4;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-10-22 08:58:07,248 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:58:07,248 INFO L82 PathProgramCache]: Analyzing trace with hash 1954768131, now seen corresponding path program 2 times [2019-10-22 08:58:07,248 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:58:07,249 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1203817650] [2019-10-22 08:58:07,249 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:58:07,249 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:58:07,249 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:58:07,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:58:07,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:58:07,286 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:58:07,289 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:58:07,289 INFO L82 PathProgramCache]: Analyzing trace with hash 59685, now seen corresponding path program 3 times [2019-10-22 08:58:07,289 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:58:07,289 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [425980030] [2019-10-22 08:58:07,289 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:58:07,289 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:58:07,289 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:58:07,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:58:07,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:58:07,301 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:58:07,302 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:58:07,302 INFO L82 PathProgramCache]: Analyzing trace with hash -964145949, now seen corresponding path program 1 times [2019-10-22 08:58:07,302 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:58:07,302 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1709680173] [2019-10-22 08:58:07,302 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:58:07,302 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:58:07,302 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:58:07,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:58:07,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:58:07,338 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:58:07,973 WARN L191 SmtUtils]: Spent 517.00 ms on a formula simplification. DAG size of input: 183 DAG size of output: 146 [2019-10-22 08:58:08,129 WARN L191 SmtUtils]: Spent 145.00 ms on a formula simplification that was a NOOP. DAG size: 112 [2019-10-22 08:58:08,137 INFO L210 LassoAnalysis]: Preferences: [2019-10-22 08:58:08,137 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-10-22 08:58:08,137 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-10-22 08:58:08,137 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-10-22 08:58:08,137 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-10-22 08:58:08,137 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 08:58:08,137 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-10-22 08:58:08,137 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-10-22 08:58:08,137 INFO L131 ssoRankerPreferences]: Filename of dumped script: substring-alloca-1.i_Iteration6_Lasso [2019-10-22 08:58:08,137 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-10-22 08:58:08,137 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-10-22 08:58:08,140 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:58:08,147 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:58:08,149 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:58:08,150 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:58:08,151 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:58:08,156 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:58:08,158 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:58:08,160 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:58:08,161 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:58:08,162 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:58:08,164 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:58:08,166 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:58:08,167 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:58:08,168 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:58:08,620 WARN L191 SmtUtils]: Spent 221.00 ms on a formula simplification. DAG size of input: 121 DAG size of output: 101 [2019-10-22 08:58:08,789 WARN L191 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 73 [2019-10-22 08:58:08,789 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:58:08,791 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:58:08,792 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:58:08,796 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:58:08,797 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:58:08,799 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:58:08,800 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:58:08,801 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:58:08,802 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:58:08,804 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:58:08,806 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:58:09,051 WARN L191 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 54 [2019-10-22 08:58:09,419 WARN L191 SmtUtils]: Spent 291.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 46 [2019-10-22 08:58:09,717 WARN L191 SmtUtils]: Spent 264.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 39 [2019-10-22 08:58:09,826 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-10-22 08:58:09,826 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-10-22 08:58:09,826 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-10-22 08:58:09,827 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:58:09,827 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:58:09,827 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:58:09,828 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:58:09,831 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:58:09,831 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:58:09,832 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:58:09,833 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-10-22 08:58:09,833 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:58:09,833 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:58:09,833 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:58:09,833 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:58:09,833 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:58:09,834 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:58:09,834 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:58:09,834 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:58:09,835 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-10-22 08:58:09,835 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:58:09,835 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:58:09,835 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:58:09,836 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:58:09,836 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:58:09,836 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:58:09,836 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:58:09,836 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:58:09,837 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-10-22 08:58:09,837 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:58:09,837 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:58:09,837 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:58:09,837 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:58:09,837 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:58:09,838 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:58:09,838 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:58:09,838 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:58:09,839 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-10-22 08:58:09,839 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:58:09,839 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:58:09,840 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:58:09,840 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:58:09,840 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:58:09,840 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:58:09,840 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:58:09,840 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:58:09,841 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-10-22 08:58:09,841 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:58:09,841 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:58:09,841 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:58:09,841 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:58:09,841 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:58:09,842 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:58:09,842 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:58:09,843 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:58:09,843 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-10-22 08:58:09,843 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:58:09,844 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:58:09,844 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:58:09,844 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:58:09,844 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:58:09,844 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:58:09,845 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:58:09,846 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-10-22 08:58:09,846 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:58:09,846 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:58:09,846 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:58:09,846 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:58:09,847 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:58:09,847 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:58:09,847 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:58:09,848 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:58:09,848 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-10-22 08:58:09,848 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:58:09,848 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:58:09,848 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:58:09,849 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:58:09,849 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:58:09,849 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:58:09,851 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:58:09,851 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-10-22 08:58:09,852 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:58:09,852 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:58:09,852 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:58:09,852 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:58:09,852 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:58:09,852 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:58:09,852 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:58:09,853 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:58:09,853 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-10-22 08:58:09,853 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:58:09,854 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:58:09,854 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:58:09,854 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:58:09,854 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:58:09,855 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:58:09,856 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:58:09,856 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-10-22 08:58:09,857 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:58:09,857 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:58:09,857 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:58:09,857 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:58:09,857 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:58:09,857 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:58:09,857 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:58:09,858 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:58:09,858 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-10-22 08:58:09,858 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:58:09,859 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:58:09,859 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:58:09,859 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:58:09,859 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:58:09,859 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:58:09,860 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:58:09,860 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:58:09,860 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-10-22 08:58:09,861 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:58:09,861 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:58:09,861 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:58:09,861 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:58:09,862 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:58:09,862 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:58:09,866 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:58:09,866 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-10-22 08:58:09,867 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:58:09,867 INFO L202 nArgumentSynthesizer]: 4 stem disjuncts [2019-10-22 08:58:09,867 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:58:09,867 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:58:09,870 INFO L400 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2019-10-22 08:58:09,871 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:58:09,890 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:58:09,890 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-10-22 08:58:09,890 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:58:09,891 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:58:09,891 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:58:09,891 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:58:09,892 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:58:09,892 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:58:09,895 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:58:09,896 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-10-22 08:58:09,896 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:58:09,896 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:58:09,896 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:58:09,896 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:58:09,897 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:58:09,897 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:58:09,898 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:58:09,898 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-10-22 08:58:09,898 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:58:09,899 INFO L202 nArgumentSynthesizer]: 12 stem disjuncts [2019-10-22 08:58:09,899 INFO L203 nArgumentSynthesizer]: 2 loop disjuncts [2019-10-22 08:58:09,899 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:58:09,905 INFO L400 nArgumentSynthesizer]: We have 60 Motzkin's Theorem applications. [2019-10-22 08:58:09,905 INFO L401 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2019-10-22 08:58:09,939 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:58:09,940 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-10-22 08:58:09,940 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:58:09,940 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:58:09,940 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:58:09,940 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:58:09,941 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:58:09,941 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:58:09,942 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:58:09,942 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-10-22 08:58:09,943 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:58:09,943 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:58:09,943 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:58:09,943 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:58:09,944 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:58:09,944 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:58:09,945 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:58:09,945 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-10-22 08:58:09,945 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:58:09,945 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:58:09,946 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:58:09,946 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:58:09,949 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:58:09,949 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:58:09,998 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-10-22 08:58:10,050 INFO L443 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. [2019-10-22 08:58:10,051 INFO L444 ModelExtractionUtils]: 52 out of 58 variables were initially zero. Simplification set additionally 3 variables to zero. [2019-10-22 08:58:10,051 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-10-22 08:58:10,052 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-10-22 08:58:10,052 INFO L510 LassoAnalysis]: Proved termination. [2019-10-22 08:58:10,052 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-10-22 08:58:10,221 INFO L297 tatePredicateManager]: 45 out of 45 supporting invariants were superfluous and have been removed [2019-10-22 08:58:10,222 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2019-10-22 08:58:10,233 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:58:10,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:58:10,251 INFO L256 TraceCheckSpWp]: Trace formula consists of 127 conjuncts, 2 conjunts are in the unsatisfiable core [2019-10-22 08:58:10,252 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:58:10,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:58:10,259 INFO L256 TraceCheckSpWp]: Trace formula consists of 32 conjuncts, 6 conjunts are in the unsatisfiable core [2019-10-22 08:58:10,259 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:58:10,268 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:58:10,269 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-10-22 08:58:10,269 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 23 states and 28 transitions. cyclomatic complexity: 8 Second operand 4 states. [2019-10-22 08:58:10,286 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-10-22 08:58:10,287 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-10-22 08:58:10,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-10-22 08:58:10,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 16 transitions. [2019-10-22 08:58:10,287 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 16 transitions. Stem has 14 letters. Loop has 3 letters. [2019-10-22 08:58:10,288 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 08:58:10,288 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-10-22 08:58:10,298 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:58:10,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:58:10,318 INFO L256 TraceCheckSpWp]: Trace formula consists of 127 conjuncts, 2 conjunts are in the unsatisfiable core [2019-10-22 08:58:10,318 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:58:10,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:58:10,326 INFO L256 TraceCheckSpWp]: Trace formula consists of 32 conjuncts, 6 conjunts are in the unsatisfiable core [2019-10-22 08:58:10,326 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:58:10,335 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:58:10,336 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-10-22 08:58:10,336 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 23 states and 28 transitions. cyclomatic complexity: 8 Second operand 4 states. [2019-10-22 08:58:10,350 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-10-22 08:58:10,351 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-10-22 08:58:10,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-10-22 08:58:10,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 16 transitions. [2019-10-22 08:58:10,351 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 16 transitions. Stem has 14 letters. Loop has 3 letters. [2019-10-22 08:58:10,352 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 08:58:10,352 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-10-22 08:58:10,369 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:58:10,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:58:10,388 INFO L256 TraceCheckSpWp]: Trace formula consists of 127 conjuncts, 2 conjunts are in the unsatisfiable core [2019-10-22 08:58:10,389 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:58:10,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:58:10,396 INFO L256 TraceCheckSpWp]: Trace formula consists of 32 conjuncts, 6 conjunts are in the unsatisfiable core [2019-10-22 08:58:10,397 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:58:10,409 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:58:10,410 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-10-22 08:58:10,410 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 23 states and 28 transitions. cyclomatic complexity: 8 Second operand 4 states. [2019-10-22 08:58:10,428 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-10-22 08:58:10,429 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-10-22 08:58:10,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-10-22 08:58:10,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 23 transitions. [2019-10-22 08:58:10,429 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 23 transitions. Stem has 14 letters. Loop has 3 letters. [2019-10-22 08:58:10,430 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 08:58:10,430 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 23 transitions. Stem has 17 letters. Loop has 3 letters. [2019-10-22 08:58:10,430 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 08:58:10,430 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 23 transitions. Stem has 14 letters. Loop has 6 letters. [2019-10-22 08:58:10,430 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 08:58:10,430 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 37 states and 44 transitions. [2019-10-22 08:58:10,432 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-10-22 08:58:10,432 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 37 states to 0 states and 0 transitions. [2019-10-22 08:58:10,432 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2019-10-22 08:58:10,433 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2019-10-22 08:58:10,433 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2019-10-22 08:58:10,433 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-10-22 08:58:10,433 INFO L688 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-10-22 08:58:10,433 INFO L711 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-10-22 08:58:10,433 INFO L591 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-10-22 08:58:10,433 INFO L424 BuchiCegarLoop]: ======== Iteration 7============ [2019-10-22 08:58:10,433 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2019-10-22 08:58:10,433 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-10-22 08:58:10,433 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2019-10-22 08:58:10,439 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 22.10 08:58:10 BoogieIcfgContainer [2019-10-22 08:58:10,439 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2019-10-22 08:58:10,440 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-10-22 08:58:10,440 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-10-22 08:58:10,440 INFO L275 PluginConnector]: Witness Printer initialized [2019-10-22 08:58:10,440 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 08:58:01" (3/4) ... [2019-10-22 08:58:10,444 INFO L140 WitnessPrinter]: No result that supports witness generation found [2019-10-22 08:58:10,444 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-10-22 08:58:10,445 INFO L168 Benchmark]: Toolchain (without parser) took 10009.89 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 379.1 MB). Free memory was 944.5 MB in the beginning and 1.2 GB in the end (delta: -255.7 MB). Peak memory consumption was 123.4 MB. Max. memory is 11.5 GB. [2019-10-22 08:58:10,446 INFO L168 Benchmark]: CDTParser took 0.19 ms. Allocated memory is still 1.0 GB. Free memory is still 967.3 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-10-22 08:58:10,446 INFO L168 Benchmark]: CACSL2BoogieTranslator took 558.41 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 138.9 MB). Free memory was 944.5 MB in the beginning and 1.1 GB in the end (delta: -177.2 MB). Peak memory consumption was 17.9 MB. Max. memory is 11.5 GB. [2019-10-22 08:58:10,447 INFO L168 Benchmark]: Boogie Procedure Inliner took 35.45 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.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. [2019-10-22 08:58:10,447 INFO L168 Benchmark]: Boogie Preprocessor took 22.05 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-10-22 08:58:10,448 INFO L168 Benchmark]: RCFGBuilder took 246.11 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.3 MB). Peak memory consumption was 21.3 MB. Max. memory is 11.5 GB. [2019-10-22 08:58:10,448 INFO L168 Benchmark]: BuchiAutomizer took 9139.72 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 240.1 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -106.5 MB). Peak memory consumption was 133.6 MB. Max. memory is 11.5 GB. [2019-10-22 08:58:10,448 INFO L168 Benchmark]: Witness Printer took 4.59 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-10-22 08:58:10,451 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.19 ms. Allocated memory is still 1.0 GB. Free memory is still 967.3 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 558.41 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 138.9 MB). Free memory was 944.5 MB in the beginning and 1.1 GB in the end (delta: -177.2 MB). Peak memory consumption was 17.9 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 35.45 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.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 22.05 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 246.11 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.3 MB). Peak memory consumption was 21.3 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 9139.72 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 240.1 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -106.5 MB). Peak memory consumption was 133.6 MB. Max. memory is 11.5 GB. * Witness Printer took 4.59 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 -1 * ps2 + unknown-#length-unknown[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 9.0s and 7 iterations. TraceHistogramMax:2. Analysis of lassos took 8.3s. Construction of modules took 0.0s. Büchi inclusion checks took 0.4s. Highest rank in rank-based complementation 3. Minimization of det autom 2. Minimization of nondet autom 4. Automata minimization 0.0s AutomataMinimizationTime, 5 MinimizatonAttempts, 13 StatesRemovedByMinimization, 2 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 37 states and ocurred in iteration 3. Nontrivial modules had stage [2, 0, 1, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 118 SDtfs, 109 SDslu, 42 SDs, 0 SdLazy, 81 SolverSat, 13 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s 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: 41ms VariablesStem: 5 VariablesLoop: 2 DisjunctsStem: 12 DisjunctsLoop: 2 SupportingInvariants: 4 MotzkinApplications: 60 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! Received shutdown request...