./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/array-memsafety/substring-alloca-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- 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_863f7722-ce1d-4c98-ad94-94851eac0da5/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_863f7722-ce1d-4c98-ad94-94851eac0da5/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_863f7722-ce1d-4c98-ad94-94851eac0da5/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_863f7722-ce1d-4c98-ad94-94851eac0da5/bin/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/array-memsafety/substring-alloca-2.i -s /tmp/vcloud-vcloud-master/worker/working_dir_863f7722-ce1d-4c98-ad94-94851eac0da5/bin/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_863f7722-ce1d-4c98-ad94-94851eac0da5/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 32bit --witnessprinter.graph.data.programhash 6e748b563bb7a11726b28f7957ce1a00b7c8807b .............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. 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:41,381 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-22 08:57:41,382 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-22 08:57:41,392 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-22 08:57:41,393 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-22 08:57:41,394 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-22 08:57:41,395 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-22 08:57:41,397 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-22 08:57:41,398 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-22 08:57:41,399 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-22 08:57:41,400 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-22 08:57:41,401 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-22 08:57:41,402 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-22 08:57:41,402 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-22 08:57:41,403 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-22 08:57:41,404 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-22 08:57:41,405 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-22 08:57:41,406 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-22 08:57:41,408 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-22 08:57:41,410 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-22 08:57:41,411 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-22 08:57:41,413 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-22 08:57:41,414 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-22 08:57:41,414 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-22 08:57:41,417 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-22 08:57:41,417 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-22 08:57:41,418 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-22 08:57:41,419 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-22 08:57:41,419 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-22 08:57:41,420 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-22 08:57:41,421 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-22 08:57:41,422 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-22 08:57:41,423 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-22 08:57:41,424 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-22 08:57:41,427 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-22 08:57:41,427 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-22 08:57:41,429 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-22 08:57:41,429 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-22 08:57:41,430 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-22 08:57:41,431 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-22 08:57:41,431 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-22 08:57:41,432 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_863f7722-ce1d-4c98-ad94-94851eac0da5/bin/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf [2019-10-22 08:57:41,446 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-22 08:57:41,447 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-22 08:57:41,448 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-22 08:57:41,448 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-22 08:57:41,448 INFO L138 SettingsManager]: * Use SBE=true [2019-10-22 08:57:41,448 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-10-22 08:57:41,448 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-10-22 08:57:41,448 INFO L138 SettingsManager]: * Use old map elimination=false [2019-10-22 08:57:41,449 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2019-10-22 08:57:41,449 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2019-10-22 08:57:41,449 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-10-22 08:57:41,449 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-22 08:57:41,450 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-22 08:57:41,450 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-10-22 08:57:41,450 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-22 08:57:41,450 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-22 08:57:41,450 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-22 08:57:41,450 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-10-22 08:57:41,451 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-10-22 08:57:41,451 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-10-22 08:57:41,451 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-22 08:57:41,451 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-22 08:57:41,451 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-10-22 08:57:41,451 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-22 08:57:41,452 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-10-22 08:57:41,452 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-22 08:57:41,452 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-22 08:57:41,452 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-10-22 08:57:41,452 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-22 08:57:41,452 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-22 08:57:41,453 INFO L138 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-10-22 08:57:41,454 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-10-22 08:57:41,454 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_863f7722-ce1d-4c98-ad94-94851eac0da5/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 -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 6e748b563bb7a11726b28f7957ce1a00b7c8807b [2019-10-22 08:57:41,486 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-22 08:57:41,498 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-22 08:57:41,503 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-22 08:57:41,508 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-22 08:57:41,508 INFO L275 PluginConnector]: CDTParser initialized [2019-10-22 08:57:41,509 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_863f7722-ce1d-4c98-ad94-94851eac0da5/bin/uautomizer/../../sv-benchmarks/c/array-memsafety/substring-alloca-2.i [2019-10-22 08:57:41,567 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_863f7722-ce1d-4c98-ad94-94851eac0da5/bin/uautomizer/data/4a8954a75/de3c8e3b0ddd4edb88aec988ec106f84/FLAGc6ef609a0 [2019-10-22 08:57:41,988 INFO L306 CDTParser]: Found 1 translation units. [2019-10-22 08:57:41,989 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_863f7722-ce1d-4c98-ad94-94851eac0da5/sv-benchmarks/c/array-memsafety/substring-alloca-2.i [2019-10-22 08:57:42,001 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_863f7722-ce1d-4c98-ad94-94851eac0da5/bin/uautomizer/data/4a8954a75/de3c8e3b0ddd4edb88aec988ec106f84/FLAGc6ef609a0 [2019-10-22 08:57:42,012 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_863f7722-ce1d-4c98-ad94-94851eac0da5/bin/uautomizer/data/4a8954a75/de3c8e3b0ddd4edb88aec988ec106f84 [2019-10-22 08:57:42,014 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-22 08:57:42,015 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-10-22 08:57:42,015 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-22 08:57:42,015 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-22 08:57:42,019 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-22 08:57:42,019 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.10 08:57:42" (1/1) ... [2019-10-22 08:57:42,022 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5476c4b3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:57:42, skipping insertion in model container [2019-10-22 08:57:42,022 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.10 08:57:42" (1/1) ... [2019-10-22 08:57:42,029 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-22 08:57:42,058 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-22 08:57:42,372 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-22 08:57:42,381 INFO L188 MainTranslator]: Completed pre-run [2019-10-22 08:57:42,418 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-22 08:57:42,456 INFO L192 MainTranslator]: Completed translation [2019-10-22 08:57:42,456 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:57:42 WrapperNode [2019-10-22 08:57:42,457 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-22 08:57:42,457 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-10-22 08:57:42,457 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-10-22 08:57:42,458 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-10-22 08:57:42,466 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:57:42" (1/1) ... [2019-10-22 08:57:42,478 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:57:42" (1/1) ... [2019-10-22 08:57:42,499 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-10-22 08:57:42,500 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-22 08:57:42,500 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-22 08:57:42,500 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-22 08:57:42,509 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:57:42" (1/1) ... [2019-10-22 08:57:42,509 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:57:42" (1/1) ... [2019-10-22 08:57:42,512 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:57:42" (1/1) ... [2019-10-22 08:57:42,512 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:57:42" (1/1) ... [2019-10-22 08:57:42,518 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:57:42" (1/1) ... [2019-10-22 08:57:42,524 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:57:42" (1/1) ... [2019-10-22 08:57:42,526 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:57:42" (1/1) ... [2019-10-22 08:57:42,528 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-22 08:57:42,528 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-22 08:57:42,528 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-22 08:57:42,528 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-22 08:57:42,529 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:57:42" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_863f7722-ce1d-4c98-ad94-94851eac0da5/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:57:42,583 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-10-22 08:57:42,583 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-10-22 08:57:42,583 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-10-22 08:57:42,584 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-10-22 08:57:42,584 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-22 08:57:42,584 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-22 08:57:42,936 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-22 08:57:42,937 INFO L284 CfgBuilder]: Removed 10 assume(true) statements. [2019-10-22 08:57:42,938 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 08:57:42 BoogieIcfgContainer [2019-10-22 08:57:42,938 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-22 08:57:42,939 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-10-22 08:57:42,939 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-10-22 08:57:42,943 INFO L275 PluginConnector]: BuchiAutomizer initialized [2019-10-22 08:57:42,944 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-10-22 08:57:42,944 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 22.10 08:57:42" (1/3) ... [2019-10-22 08:57:42,946 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@202ae73f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 22.10 08:57:42, skipping insertion in model container [2019-10-22 08:57:42,946 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-10-22 08:57:42,946 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:57:42" (2/3) ... [2019-10-22 08:57:42,946 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@202ae73f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 22.10 08:57:42, skipping insertion in model container [2019-10-22 08:57:42,946 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-10-22 08:57:42,947 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 08:57:42" (3/3) ... [2019-10-22 08:57:42,948 INFO L371 chiAutomizerObserver]: Analyzing ICFG substring-alloca-2.i [2019-10-22 08:57:43,001 INFO L356 BuchiCegarLoop]: Interprodecural is true [2019-10-22 08:57:43,001 INFO L357 BuchiCegarLoop]: Hoare is false [2019-10-22 08:57:43,001 INFO L358 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-10-22 08:57:43,001 INFO L359 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-22 08:57:43,002 INFO L360 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-22 08:57:43,002 INFO L361 BuchiCegarLoop]: Difference is false [2019-10-22 08:57:43,002 INFO L362 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-22 08:57:43,002 INFO L365 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-10-22 08:57:43,017 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 23 states. [2019-10-22 08:57:43,042 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 11 [2019-10-22 08:57:43,042 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 08:57:43,042 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 08:57:43,050 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2019-10-22 08:57:43,050 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-10-22 08:57:43,050 INFO L424 BuchiCegarLoop]: ======== Iteration 1============ [2019-10-22 08:57:43,050 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 23 states. [2019-10-22 08:57:43,052 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 11 [2019-10-22 08:57:43,052 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 08:57:43,052 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 08:57:43,053 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2019-10-22 08:57:43,053 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-10-22 08:57:43,061 INFO L791 eck$LassoCheckResult]: Stem: 17#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 15#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~nondet16, main_#t~post15, main_~i~0, main_#t~nondet18, main_#t~post17, main_~i~1, main_#t~ret19, 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; 16#L532true assume !(main_~length1~0 < 1); 18#L532-2true assume !(main_~length2~0 < 1); 11#L535-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;main_~i~0 := 0; 24#L541-3true [2019-10-22 08:57:43,062 INFO L793 eck$LassoCheckResult]: Loop: 24#L541-3true assume !!(main_~i~0 < main_~length1~0 - 1);call write~int(main_#t~nondet16, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~0, 1);havoc main_#t~nondet16; 21#L541-2true main_#t~post15 := main_~i~0;main_~i~0 := 1 + main_#t~post15;havoc main_#t~post15; 24#L541-3true [2019-10-22 08:57:43,068 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:57:43,069 INFO L82 PathProgramCache]: Analyzing trace with hash 28695878, now seen corresponding path program 1 times [2019-10-22 08:57:43,078 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:57:43,078 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1065312240] [2019-10-22 08:57:43,078 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:57:43,078 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:57:43,079 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:57:43,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:57:43,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:57:43,218 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:57:43,219 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:57:43,220 INFO L82 PathProgramCache]: Analyzing trace with hash 1699, now seen corresponding path program 1 times [2019-10-22 08:57:43,220 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:57:43,220 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [965321645] [2019-10-22 08:57:43,220 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:57:43,220 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:57:43,220 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:57:43,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:57:43,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:57:43,237 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:57:43,239 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:57:43,239 INFO L82 PathProgramCache]: Analyzing trace with hash 1806935720, now seen corresponding path program 1 times [2019-10-22 08:57:43,239 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:57:43,240 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [367055657] [2019-10-22 08:57:43,240 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:57:43,240 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:57:43,240 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:57:43,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:57:43,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:57:43,286 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:57:43,498 INFO L210 LassoAnalysis]: Preferences: [2019-10-22 08:57:43,499 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-10-22 08:57:43,499 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-10-22 08:57:43,499 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-10-22 08:57:43,499 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-10-22 08:57:43,499 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 08:57:43,499 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-10-22 08:57:43,499 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-10-22 08:57:43,500 INFO L131 ssoRankerPreferences]: Filename of dumped script: substring-alloca-2.i_Iteration1_Lasso [2019-10-22 08:57:43,500 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-10-22 08:57:43,500 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-10-22 08:57:43,526 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:57:43,532 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:57:43,535 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:57:43,537 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:57:43,540 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:57:43,544 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:57:43,548 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:57:43,550 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:57:43,554 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:57:43,557 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:57:43,560 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:57:43,563 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:57:43,700 WARN L191 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 40 [2019-10-22 08:57:43,724 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:57:43,728 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:57:43,734 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:57:44,081 WARN L191 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 25 DAG size of output: 25 [2019-10-22 08:57:44,166 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-10-22 08:57:44,173 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-10-22 08:57:44,175 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:57:44,177 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:57:44,178 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:57:44,179 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:57:44,179 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:57:44,179 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:57:44,181 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:57:44,182 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:57:44,184 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:57:44,184 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:57:44,191 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:57:44,192 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:57:44,192 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:57:44,192 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:57:44,193 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:57:44,193 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:57:44,193 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:57:44,194 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:57:44,195 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:57:44,195 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:57:44,196 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:57:44,196 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:57:44,196 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:57:44,196 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:57:44,205 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:57:44,206 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:57:44,207 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:57:44,207 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:57:44,208 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:57:44,208 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:57:44,209 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:57:44,209 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:57:44,210 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:57:44,211 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:57:44,211 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:57:44,212 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:57:44,212 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:57:44,213 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:57:44,213 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:57:44,213 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:57:44,214 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:57:44,216 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:57:44,216 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:57:44,223 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:57:44,227 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:57:44,229 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:57:44,231 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:57:44,231 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:57:44,231 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:57:44,233 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:57:44,237 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:57:44,240 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:57:44,253 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:57:44,254 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:57:44,254 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:57:44,254 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:57:44,254 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:57:44,255 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:57:44,255 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:57:44,255 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:57:44,256 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:57:44,257 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:57:44,258 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:57:44,258 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:57:44,258 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:57:44,258 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:57:44,260 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:57:44,260 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:57:44,277 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:57:44,277 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:57:44,278 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:57:44,278 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:57:44,278 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:57:44,279 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:57:44,279 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:57:44,279 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:57:44,279 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:57:44,280 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:57:44,281 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:57:44,286 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:57:44,287 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:57:44,287 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:57:44,287 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:57:44,289 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:57:44,292 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:57:44,295 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:57:44,296 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:57:44,296 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:57:44,297 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:57:44,302 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:57:44,303 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:57:44,303 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:57:44,303 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:57:44,304 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:57:44,305 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:57:44,306 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:57:44,306 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:57:44,307 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:57:44,307 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:57:44,307 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:57:44,309 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:57:44,311 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:57:44,316 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:57:44,321 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:57:44,322 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:57:44,322 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:57:44,323 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:57:44,323 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:57:44,325 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:57:44,335 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:57:44,356 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:57:44,360 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:57:44,361 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:57:44,362 INFO L202 nArgumentSynthesizer]: 4 stem disjuncts [2019-10-22 08:57:44,362 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:57:44,362 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:57:44,366 INFO L400 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2019-10-22 08:57:44,366 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:57:44,401 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:57:44,406 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:57:44,407 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:57:44,407 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:57:44,408 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:57:44,408 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:57:44,408 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:57:44,409 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:57:44,409 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:57:44,410 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:57:44,410 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:57:44,411 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:57:44,411 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:57:44,411 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:57:44,411 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:57:44,413 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:57:44,423 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:57:44,428 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:57:44,428 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:57:44,432 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:57:44,432 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:57:44,432 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:57:44,432 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:57:44,434 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:57:44,438 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:57:44,440 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:57:44,441 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:57:44,445 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:57:44,445 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:57:44,445 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:57:44,445 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:57:44,445 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:57:44,446 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:57:44,446 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:57:44,447 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:57:44,448 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:57:44,448 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:57:44,451 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:57:44,452 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:57:44,457 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:57:44,460 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:57:44,460 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:57:44,544 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-10-22 08:57:44,597 INFO L443 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. [2019-10-22 08:57:44,598 INFO L444 ModelExtractionUtils]: 14 out of 22 variables were initially zero. Simplification set additionally 5 variables to zero. [2019-10-22 08:57:44,600 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-10-22 08:57:44,602 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-10-22 08:57:44,603 INFO L510 LassoAnalysis]: Proved termination. [2019-10-22 08:57:44,603 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~length1~0, ULTIMATE.start_main_~i~0) = 1*ULTIMATE.start_main_~length1~0 - 1*ULTIMATE.start_main_~i~0 Supporting invariants [] [2019-10-22 08:57:44,625 INFO L297 tatePredicateManager]: 6 out of 6 supporting invariants were superfluous and have been removed [2019-10-22 08:57:44,658 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:57:44,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:57:44,691 INFO L256 TraceCheckSpWp]: Trace formula consists of 37 conjuncts, 2 conjunts are in the unsatisfiable core [2019-10-22 08:57:44,693 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:57:44,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:57:44,711 INFO L256 TraceCheckSpWp]: Trace formula consists of 10 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-22 08:57:44,711 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:57:44,724 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:57:44,742 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:57:44,743 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 23 states. Second operand 3 states. [2019-10-22 08:57:44,801 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 23 states.. Second operand 3 states. Result 57 states and 84 transitions. Complement of second has 7 states. [2019-10-22 08:57:44,802 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2019-10-22 08:57:44,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-10-22 08:57:44,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 57 transitions. [2019-10-22 08:57:44,806 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 57 transitions. Stem has 5 letters. Loop has 2 letters. [2019-10-22 08:57:44,808 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 08:57:44,808 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 57 transitions. Stem has 7 letters. Loop has 2 letters. [2019-10-22 08:57:44,808 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 08:57:44,808 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 57 transitions. Stem has 5 letters. Loop has 4 letters. [2019-10-22 08:57:44,809 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 08:57:44,810 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 57 states and 84 transitions. [2019-10-22 08:57:44,814 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 9 [2019-10-22 08:57:44,818 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 57 states to 19 states and 26 transitions. [2019-10-22 08:57:44,821 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 16 [2019-10-22 08:57:44,821 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 17 [2019-10-22 08:57:44,822 INFO L73 IsDeterministic]: Start isDeterministic. Operand 19 states and 26 transitions. [2019-10-22 08:57:44,822 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-10-22 08:57:44,824 INFO L688 BuchiCegarLoop]: Abstraction has 19 states and 26 transitions. [2019-10-22 08:57:44,843 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states and 26 transitions. [2019-10-22 08:57:44,854 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2019-10-22 08:57:44,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2019-10-22 08:57:44,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 26 transitions. [2019-10-22 08:57:44,857 INFO L711 BuchiCegarLoop]: Abstraction has 19 states and 26 transitions. [2019-10-22 08:57:44,858 INFO L591 BuchiCegarLoop]: Abstraction has 19 states and 26 transitions. [2019-10-22 08:57:44,858 INFO L424 BuchiCegarLoop]: ======== Iteration 2============ [2019-10-22 08:57:44,858 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 19 states and 26 transitions. [2019-10-22 08:57:44,859 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 9 [2019-10-22 08:57:44,859 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 08:57:44,859 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 08:57:44,860 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2019-10-22 08:57:44,860 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-10-22 08:57:44,860 INFO L791 eck$LassoCheckResult]: Stem: 167#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 164#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~nondet16, main_#t~post15, main_~i~0, main_#t~nondet18, main_#t~post17, main_~i~1, main_#t~ret19, 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; 165#L532 assume !(main_~length1~0 < 1); 166#L532-2 assume !(main_~length2~0 < 1); 161#L535-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;main_~i~0 := 0; 162#L541-3 assume !(main_~i~0 < main_~length1~0 - 1); 154#L541-4 main_~i~1 := 0; 155#L547-3 [2019-10-22 08:57:44,860 INFO L793 eck$LassoCheckResult]: Loop: 155#L547-3 assume !!(main_~i~1 < main_~length2~0 - 1);call write~int(main_#t~nondet18, main_~nondetString2~0.base, main_~nondetString2~0.offset + main_~i~1, 1);havoc main_#t~nondet18; 160#L547-2 main_#t~post17 := main_~i~1;main_~i~1 := 1 + main_#t~post17;havoc main_#t~post17; 155#L547-3 [2019-10-22 08:57:44,861 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:57:44,861 INFO L82 PathProgramCache]: Analyzing trace with hash 1806935662, now seen corresponding path program 1 times [2019-10-22 08:57:44,861 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:57:44,861 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [21651248] [2019-10-22 08:57:44,862 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:57:44,862 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:57:44,862 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:57:44,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:57:44,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:57:44,895 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:57:44,902 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:57:44,902 INFO L82 PathProgramCache]: Analyzing trace with hash 2147, now seen corresponding path program 1 times [2019-10-22 08:57:44,902 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:57:44,902 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1435212749] [2019-10-22 08:57:44,903 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:57:44,903 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:57:44,903 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:57:44,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:57:44,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:57:44,921 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:57:44,924 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:57:44,924 INFO L82 PathProgramCache]: Analyzing trace with hash 1298384784, now seen corresponding path program 1 times [2019-10-22 08:57:44,925 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:57:44,925 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [325671715] [2019-10-22 08:57:44,925 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:57:44,925 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:57:44,925 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:57:44,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:57:44,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:57:44,958 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:57:45,186 INFO L210 LassoAnalysis]: Preferences: [2019-10-22 08:57:45,187 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-10-22 08:57:45,187 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-10-22 08:57:45,187 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-10-22 08:57:45,187 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-10-22 08:57:45,187 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 08:57:45,187 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-10-22 08:57:45,187 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-10-22 08:57:45,188 INFO L131 ssoRankerPreferences]: Filename of dumped script: substring-alloca-2.i_Iteration2_Lasso [2019-10-22 08:57:45,188 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-10-22 08:57:45,188 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-10-22 08:57:45,191 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:57:45,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:57:45,330 WARN L191 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 44 [2019-10-22 08:57:45,356 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:57:45,358 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:57:45,363 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:57:45,365 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:57:45,368 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:57:45,370 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:57:45,372 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:57:45,374 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:57:45,376 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:57:45,378 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:57:45,380 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:57:45,381 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:57:45,701 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-10-22 08:57:45,701 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-10-22 08:57:45,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:57:45,702 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:57:45,702 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:57:45,702 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:57:45,702 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:57:45,703 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:57:45,703 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:57:45,703 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:57:45,706 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:57:45,706 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:57:45,707 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:57:45,707 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:57:45,707 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:57:45,707 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:57:45,708 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:57:45,708 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:57:45,711 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:57:45,711 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:57:45,712 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:57:45,712 INFO L202 nArgumentSynthesizer]: 4 stem disjuncts [2019-10-22 08:57:45,712 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:57:45,712 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:57:45,715 INFO L400 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2019-10-22 08:57:45,715 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:57:45,727 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:57:45,727 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:57:45,728 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:57:45,728 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:57:45,728 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:57:45,728 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:57:45,729 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:57:45,729 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:57:45,735 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:57:45,735 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:57:45,736 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:57:45,736 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:57:45,736 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:57:45,736 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:57:45,736 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:57:45,736 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:57:45,737 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:57:45,737 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:57:45,738 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:57:45,738 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:57:45,738 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:57:45,739 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:57:45,739 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:57:45,739 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:57:45,740 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:57:45,741 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:57:45,742 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:57:45,742 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:57:45,742 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:57:45,743 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:57:45,743 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:57:45,743 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:57:45,743 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:57:45,743 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:57:45,744 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:57:45,744 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:57:45,744 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:57:45,745 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:57:45,745 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:57:45,745 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:57:45,747 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:57:45,747 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:57:45,762 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-10-22 08:57:45,791 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2019-10-22 08:57:45,791 INFO L444 ModelExtractionUtils]: 15 out of 22 variables were initially zero. Simplification set additionally 4 variables to zero. [2019-10-22 08:57:45,791 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-10-22 08:57:45,792 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-10-22 08:57:45,792 INFO L510 LassoAnalysis]: Proved termination. [2019-10-22 08:57:45,792 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~1, ULTIMATE.start_main_~length2~0) = -1*ULTIMATE.start_main_~i~1 + 1*ULTIMATE.start_main_~length2~0 Supporting invariants [] [2019-10-22 08:57:45,819 INFO L297 tatePredicateManager]: 6 out of 6 supporting invariants were superfluous and have been removed [2019-10-22 08:57:45,837 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:57:45,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:57:45,849 INFO L256 TraceCheckSpWp]: Trace formula consists of 40 conjuncts, 2 conjunts are in the unsatisfiable core [2019-10-22 08:57:45,849 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:57:45,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:57:45,858 INFO L256 TraceCheckSpWp]: Trace formula consists of 10 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-22 08:57:45,858 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:57:45,872 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:57:45,873 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:57:45,873 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 19 states and 26 transitions. cyclomatic complexity: 10 Second operand 3 states. [2019-10-22 08:57:45,908 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 19 states and 26 transitions. cyclomatic complexity: 10. Second operand 3 states. Result 29 states and 42 transitions. Complement of second has 6 states. [2019-10-22 08:57:45,910 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:57:45,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-10-22 08:57:45,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 24 transitions. [2019-10-22 08:57:45,911 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 24 transitions. Stem has 7 letters. Loop has 2 letters. [2019-10-22 08:57:45,912 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 08:57:45,912 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 24 transitions. Stem has 9 letters. Loop has 2 letters. [2019-10-22 08:57:45,912 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 08:57:45,912 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 24 transitions. Stem has 7 letters. Loop has 4 letters. [2019-10-22 08:57:45,912 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 08:57:45,912 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 29 states and 42 transitions. [2019-10-22 08:57:45,913 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2019-10-22 08:57:45,914 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 29 states to 20 states and 28 transitions. [2019-10-22 08:57:45,914 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 15 [2019-10-22 08:57:45,914 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 16 [2019-10-22 08:57:45,914 INFO L73 IsDeterministic]: Start isDeterministic. Operand 20 states and 28 transitions. [2019-10-22 08:57:45,915 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-10-22 08:57:45,915 INFO L688 BuchiCegarLoop]: Abstraction has 20 states and 28 transitions. [2019-10-22 08:57:45,915 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states and 28 transitions. [2019-10-22 08:57:45,916 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2019-10-22 08:57:45,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2019-10-22 08:57:45,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 28 transitions. [2019-10-22 08:57:45,919 INFO L711 BuchiCegarLoop]: Abstraction has 20 states and 28 transitions. [2019-10-22 08:57:45,919 INFO L591 BuchiCegarLoop]: Abstraction has 20 states and 28 transitions. [2019-10-22 08:57:45,920 INFO L424 BuchiCegarLoop]: ======== Iteration 3============ [2019-10-22 08:57:45,920 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 20 states and 28 transitions. [2019-10-22 08:57:45,920 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2019-10-22 08:57:45,921 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 08:57:45,921 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 08:57:45,922 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 08:57:45,922 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2019-10-22 08:57:45,922 INFO L791 eck$LassoCheckResult]: Stem: 290#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 287#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~nondet16, main_#t~post15, main_~i~0, main_#t~nondet18, main_#t~post17, main_~i~1, main_#t~ret19, 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; 288#L532 assume !(main_~length1~0 < 1); 289#L532-2 assume !(main_~length2~0 < 1); 284#L535-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;main_~i~0 := 0; 285#L541-3 assume !(main_~i~0 < main_~length1~0 - 1); 276#L541-4 main_~i~1 := 0; 277#L547-3 assume !(main_~i~1 < main_~length2~0 - 1); 286#L547-4 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; 279#L517-3 [2019-10-22 08:57:45,923 INFO L793 eck$LassoCheckResult]: Loop: 279#L517-3 call substring_#t~mem2 := read~int(substring_~ps~0.base, substring_~ps~0.offset, 1); 274#L517-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; 275#L520-5 call substring_#t~mem3 := read~int(substring_~pt~0.base, substring_~pt~0.offset, 1);substring_#t~short6 := 0 != substring_#t~mem3; 278#L520-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; 291#L520-3 assume !substring_#t~short6;havoc substring_#t~mem3;havoc substring_#t~mem5;havoc substring_#t~short6;havoc substring_#t~mem4; 280#L520-6 call substring_#t~mem9 := read~int(substring_~pt~0.base, substring_~pt~0.offset, 1); 281#L524 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; 279#L517-3 [2019-10-22 08:57:45,923 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:57:45,923 INFO L82 PathProgramCache]: Analyzing trace with hash 1298384726, now seen corresponding path program 1 times [2019-10-22 08:57:45,923 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:57:45,923 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [261749139] [2019-10-22 08:57:45,923 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:57:45,923 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:57:45,923 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:57:45,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:57:45,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:57:45,967 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:57:45,971 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:57:45,971 INFO L82 PathProgramCache]: Analyzing trace with hash -1328860033, now seen corresponding path program 1 times [2019-10-22 08:57:45,972 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:57:45,972 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1130231695] [2019-10-22 08:57:45,972 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:57:45,972 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:57:45,972 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:57:45,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:57:45,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:57:45,991 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:57:45,993 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:57:45,993 INFO L82 PathProgramCache]: Analyzing trace with hash -1515359350, now seen corresponding path program 1 times [2019-10-22 08:57:45,993 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:57:45,994 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [126630681] [2019-10-22 08:57:45,994 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:57:45,994 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:57:45,994 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:57:46,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:57:46,167 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:57:46,167 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [126630681] [2019-10-22 08:57:46,168 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:57:46,168 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-22 08:57:46,168 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1970224072] [2019-10-22 08:57:46,305 WARN L191 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 59 [2019-10-22 08:57:46,345 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:57:46,346 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-22 08:57:46,347 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-10-22 08:57:46,347 INFO L87 Difference]: Start difference. First operand 20 states and 28 transitions. cyclomatic complexity: 11 Second operand 7 states. [2019-10-22 08:57:46,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:57:46,441 INFO L93 Difference]: Finished difference Result 28 states and 37 transitions. [2019-10-22 08:57:46,442 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-22 08:57:46,442 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 28 states and 37 transitions. [2019-10-22 08:57:46,443 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2019-10-22 08:57:46,443 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 28 states to 21 states and 28 transitions. [2019-10-22 08:57:46,443 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 16 [2019-10-22 08:57:46,443 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 16 [2019-10-22 08:57:46,444 INFO L73 IsDeterministic]: Start isDeterministic. Operand 21 states and 28 transitions. [2019-10-22 08:57:46,444 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-10-22 08:57:46,444 INFO L688 BuchiCegarLoop]: Abstraction has 21 states and 28 transitions. [2019-10-22 08:57:46,444 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states and 28 transitions. [2019-10-22 08:57:46,448 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 20. [2019-10-22 08:57:46,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2019-10-22 08:57:46,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 27 transitions. [2019-10-22 08:57:46,449 INFO L711 BuchiCegarLoop]: Abstraction has 20 states and 27 transitions. [2019-10-22 08:57:46,449 INFO L591 BuchiCegarLoop]: Abstraction has 20 states and 27 transitions. [2019-10-22 08:57:46,449 INFO L424 BuchiCegarLoop]: ======== Iteration 4============ [2019-10-22 08:57:46,449 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 20 states and 27 transitions. [2019-10-22 08:57:46,450 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2019-10-22 08:57:46,450 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 08:57:46,450 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 08:57:46,451 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 08:57:46,451 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2019-10-22 08:57:46,451 INFO L791 eck$LassoCheckResult]: Stem: 354#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 351#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~nondet16, main_#t~post15, main_~i~0, main_#t~nondet18, main_#t~post17, main_~i~1, main_#t~ret19, 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; 352#L532 assume !(main_~length1~0 < 1); 353#L532-2 assume !(main_~length2~0 < 1); 348#L535-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;main_~i~0 := 0; 349#L541-3 assume !!(main_~i~0 < main_~length1~0 - 1);call write~int(main_#t~nondet16, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~0, 1);havoc main_#t~nondet16; 356#L541-2 main_#t~post15 := main_~i~0;main_~i~0 := 1 + main_#t~post15;havoc main_#t~post15; 357#L541-3 assume !(main_~i~0 < main_~length1~0 - 1); 340#L541-4 main_~i~1 := 0; 341#L547-3 assume !(main_~i~1 < main_~length2~0 - 1); 350#L547-4 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; 343#L517-3 [2019-10-22 08:57:46,451 INFO L793 eck$LassoCheckResult]: Loop: 343#L517-3 call substring_#t~mem2 := read~int(substring_~ps~0.base, substring_~ps~0.offset, 1); 338#L517-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; 339#L520-5 call substring_#t~mem3 := read~int(substring_~pt~0.base, substring_~pt~0.offset, 1);substring_#t~short6 := 0 != substring_#t~mem3; 342#L520-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; 355#L520-3 assume !substring_#t~short6;havoc substring_#t~mem3;havoc substring_#t~mem5;havoc substring_#t~short6;havoc substring_#t~mem4; 344#L520-6 call substring_#t~mem9 := read~int(substring_~pt~0.base, substring_~pt~0.offset, 1); 345#L524 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; 343#L517-3 [2019-10-22 08:57:46,451 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:57:46,451 INFO L82 PathProgramCache]: Analyzing trace with hash -2034626632, now seen corresponding path program 1 times [2019-10-22 08:57:46,451 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:57:46,452 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [246790463] [2019-10-22 08:57:46,452 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:57:46,452 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:57:46,452 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:57:46,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:57:46,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:57:46,481 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:57:46,482 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:57:46,482 INFO L82 PathProgramCache]: Analyzing trace with hash -1328860033, now seen corresponding path program 2 times [2019-10-22 08:57:46,482 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:57:46,482 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1645991662] [2019-10-22 08:57:46,482 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:57:46,482 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:57:46,482 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:57:46,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:57:46,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:57:46,491 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:57:46,492 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:57:46,492 INFO L82 PathProgramCache]: Analyzing trace with hash 2020169960, now seen corresponding path program 1 times [2019-10-22 08:57:46,492 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:57:46,492 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1174733496] [2019-10-22 08:57:46,492 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:57:46,492 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:57:46,492 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:57:46,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:57:46,610 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-10-22 08:57:46,611 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1174733496] [2019-10-22 08:57:46,611 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:57:46,611 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-10-22 08:57:46,611 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [478384491] [2019-10-22 08:57:46,738 WARN L191 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 60 [2019-10-22 08:57:46,766 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:57:46,766 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-22 08:57:46,766 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2019-10-22 08:57:46,767 INFO L87 Difference]: Start difference. First operand 20 states and 27 transitions. cyclomatic complexity: 10 Second operand 9 states. [2019-10-22 08:57:46,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:57:46,898 INFO L93 Difference]: Finished difference Result 34 states and 44 transitions. [2019-10-22 08:57:46,898 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-10-22 08:57:46,898 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 34 states and 44 transitions. [2019-10-22 08:57:46,899 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 17 [2019-10-22 08:57:46,899 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 34 states to 32 states and 42 transitions. [2019-10-22 08:57:46,899 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 27 [2019-10-22 08:57:46,899 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 27 [2019-10-22 08:57:46,899 INFO L73 IsDeterministic]: Start isDeterministic. Operand 32 states and 42 transitions. [2019-10-22 08:57:46,900 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-10-22 08:57:46,900 INFO L688 BuchiCegarLoop]: Abstraction has 32 states and 42 transitions. [2019-10-22 08:57:46,900 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states and 42 transitions. [2019-10-22 08:57:46,901 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 31. [2019-10-22 08:57:46,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2019-10-22 08:57:46,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 41 transitions. [2019-10-22 08:57:46,902 INFO L711 BuchiCegarLoop]: Abstraction has 31 states and 41 transitions. [2019-10-22 08:57:46,902 INFO L591 BuchiCegarLoop]: Abstraction has 31 states and 41 transitions. [2019-10-22 08:57:46,902 INFO L424 BuchiCegarLoop]: ======== Iteration 5============ [2019-10-22 08:57:46,902 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 31 states and 41 transitions. [2019-10-22 08:57:46,903 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 17 [2019-10-22 08:57:46,903 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 08:57:46,903 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 08:57:46,903 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 08:57:46,903 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 1, 1, 1, 1, 1, 1] [2019-10-22 08:57:46,904 INFO L791 eck$LassoCheckResult]: Stem: 433#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 430#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~nondet16, main_#t~post15, main_~i~0, main_#t~nondet18, main_#t~post17, main_~i~1, main_#t~ret19, 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; 431#L532 assume !(main_~length1~0 < 1); 432#L532-2 assume !(main_~length2~0 < 1); 426#L535-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;main_~i~0 := 0; 427#L541-3 assume !!(main_~i~0 < main_~length1~0 - 1);call write~int(main_#t~nondet16, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~0, 1);havoc main_#t~nondet16; 436#L541-2 main_#t~post15 := main_~i~0;main_~i~0 := 1 + main_#t~post15;havoc main_#t~post15; 437#L541-3 assume !(main_~i~0 < main_~length1~0 - 1); 416#L541-4 main_~i~1 := 0; 417#L547-3 assume !(main_~i~1 < main_~length2~0 - 1); 428#L547-4 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; 419#L517-3 [2019-10-22 08:57:46,904 INFO L793 eck$LassoCheckResult]: Loop: 419#L517-3 call substring_#t~mem2 := read~int(substring_~ps~0.base, substring_~ps~0.offset, 1); 420#L517-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; 440#L520-5 call substring_#t~mem3 := read~int(substring_~pt~0.base, substring_~pt~0.offset, 1);substring_#t~short6 := 0 != substring_#t~mem3; 434#L520-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; 435#L520-3 assume !!substring_#t~short6;havoc substring_#t~mem3;havoc substring_#t~mem5;havoc substring_#t~short6;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; 438#L520-5 call substring_#t~mem3 := read~int(substring_~pt~0.base, substring_~pt~0.offset, 1);substring_#t~short6 := 0 != substring_#t~mem3; 444#L520-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; 443#L520-3 assume !substring_#t~short6;havoc substring_#t~mem3;havoc substring_#t~mem5;havoc substring_#t~short6;havoc substring_#t~mem4; 442#L520-6 call substring_#t~mem9 := read~int(substring_~pt~0.base, substring_~pt~0.offset, 1); 441#L524 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; 419#L517-3 [2019-10-22 08:57:46,904 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:57:46,904 INFO L82 PathProgramCache]: Analyzing trace with hash -2034626632, now seen corresponding path program 2 times [2019-10-22 08:57:46,904 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:57:46,904 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [916091874] [2019-10-22 08:57:46,904 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:57:46,905 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:57:46,905 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:57:46,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:57:46,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:57:46,921 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:57:46,922 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:57:46,922 INFO L82 PathProgramCache]: Analyzing trace with hash -1312710103, now seen corresponding path program 1 times [2019-10-22 08:57:46,922 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:57:46,922 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1175597877] [2019-10-22 08:57:46,922 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:57:46,922 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:57:46,922 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:57:46,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:57:46,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:57:46,935 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:57:46,935 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:57:46,935 INFO L82 PathProgramCache]: Analyzing trace with hash 1844492576, now seen corresponding path program 1 times [2019-10-22 08:57:46,935 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:57:46,936 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1573672907] [2019-10-22 08:57:46,936 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:57:46,936 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:57:46,936 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:57:46,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:57:47,008 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-10-22 08:57:47,008 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1573672907] [2019-10-22 08:57:47,009 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [864730922] [2019-10-22 08:57:47,009 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_863f7722-ce1d-4c98-ad94-94851eac0da5/bin/uautomizer/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-22 08:57:47,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:57:47,078 INFO L256 TraceCheckSpWp]: Trace formula consists of 156 conjuncts, 16 conjunts are in the unsatisfiable core [2019-10-22 08:57:47,079 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:57:47,132 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 08:57:47,132 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 9 treesize of output 25 [2019-10-22 08:57:47,133 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-22 08:57:47,149 INFO L567 ElimStorePlain]: treesize reduction 10, result has 60.0 percent of original size [2019-10-22 08:57:47,149 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-10-22 08:57:47,150 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:9, output treesize:5 [2019-10-22 08:57:47,226 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-10-22 08:57:47,226 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-22 08:57:47,227 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [8] total 15 [2019-10-22 08:57:47,227 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [945925529] [2019-10-22 08:57:47,415 WARN L191 SmtUtils]: Spent 187.00 ms on a formula simplification. DAG size of input: 118 DAG size of output: 83 [2019-10-22 08:57:47,449 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:57:47,449 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-22 08:57:47,449 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=168, Unknown=0, NotChecked=0, Total=210 [2019-10-22 08:57:47,450 INFO L87 Difference]: Start difference. First operand 31 states and 41 transitions. cyclomatic complexity: 14 Second operand 9 states. [2019-10-22 08:57:47,555 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:57:47,555 INFO L93 Difference]: Finished difference Result 28 states and 35 transitions. [2019-10-22 08:57:47,555 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-10-22 08:57:47,555 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 28 states and 35 transitions. [2019-10-22 08:57:47,556 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2019-10-22 08:57:47,556 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 28 states to 21 states and 27 transitions. [2019-10-22 08:57:47,556 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 16 [2019-10-22 08:57:47,556 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 16 [2019-10-22 08:57:47,556 INFO L73 IsDeterministic]: Start isDeterministic. Operand 21 states and 27 transitions. [2019-10-22 08:57:47,556 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-10-22 08:57:47,557 INFO L688 BuchiCegarLoop]: Abstraction has 21 states and 27 transitions. [2019-10-22 08:57:47,557 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states and 27 transitions. [2019-10-22 08:57:47,558 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 20. [2019-10-22 08:57:47,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2019-10-22 08:57:47,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 26 transitions. [2019-10-22 08:57:47,558 INFO L711 BuchiCegarLoop]: Abstraction has 20 states and 26 transitions. [2019-10-22 08:57:47,558 INFO L591 BuchiCegarLoop]: Abstraction has 20 states and 26 transitions. [2019-10-22 08:57:47,558 INFO L424 BuchiCegarLoop]: ======== Iteration 6============ [2019-10-22 08:57:47,559 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 20 states and 26 transitions. [2019-10-22 08:57:47,559 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2019-10-22 08:57:47,559 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 08:57:47,559 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 08:57:47,559 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 08:57:47,560 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2019-10-22 08:57:47,560 INFO L791 eck$LassoCheckResult]: Stem: 579#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 576#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~nondet16, main_#t~post15, main_~i~0, main_#t~nondet18, main_#t~post17, main_~i~1, main_#t~ret19, 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; 577#L532 assume !(main_~length1~0 < 1); 578#L532-2 assume !(main_~length2~0 < 1); 573#L535-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;main_~i~0 := 0; 574#L541-3 assume !!(main_~i~0 < main_~length1~0 - 1);call write~int(main_#t~nondet16, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~0, 1);havoc main_#t~nondet16; 581#L541-2 main_#t~post15 := main_~i~0;main_~i~0 := 1 + main_#t~post15;havoc main_#t~post15; 582#L541-3 assume !(main_~i~0 < main_~length1~0 - 1); 565#L541-4 main_~i~1 := 0; 566#L547-3 assume !!(main_~i~1 < main_~length2~0 - 1);call write~int(main_#t~nondet18, main_~nondetString2~0.base, main_~nondetString2~0.offset + main_~i~1, 1);havoc main_#t~nondet18; 571#L547-2 main_#t~post17 := main_~i~1;main_~i~1 := 1 + main_#t~post17;havoc main_#t~post17; 572#L547-3 assume !(main_~i~1 < main_~length2~0 - 1); 575#L547-4 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; 568#L517-3 [2019-10-22 08:57:47,560 INFO L793 eck$LassoCheckResult]: Loop: 568#L517-3 call substring_#t~mem2 := read~int(substring_~ps~0.base, substring_~ps~0.offset, 1); 563#L517-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; 564#L520-5 call substring_#t~mem3 := read~int(substring_~pt~0.base, substring_~pt~0.offset, 1);substring_#t~short6 := 0 != substring_#t~mem3; 567#L520-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; 580#L520-3 assume !substring_#t~short6;havoc substring_#t~mem3;havoc substring_#t~mem5;havoc substring_#t~short6;havoc substring_#t~mem4; 569#L520-6 call substring_#t~mem9 := read~int(substring_~pt~0.base, substring_~pt~0.offset, 1); 570#L524 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; 568#L517-3 [2019-10-22 08:57:47,560 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:57:47,560 INFO L82 PathProgramCache]: Analyzing trace with hash -1066016806, now seen corresponding path program 1 times [2019-10-22 08:57:47,560 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:57:47,560 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [677651765] [2019-10-22 08:57:47,560 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:57:47,561 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:57:47,561 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:57:47,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:57:47,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:57:47,581 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:57:47,582 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:57:47,582 INFO L82 PathProgramCache]: Analyzing trace with hash -1328860033, now seen corresponding path program 3 times [2019-10-22 08:57:47,582 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:57:47,582 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1708373505] [2019-10-22 08:57:47,582 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:57:47,582 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:57:47,582 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:57:47,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:57:47,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:57:47,591 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:57:47,591 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:57:47,591 INFO L82 PathProgramCache]: Analyzing trace with hash -1498710394, now seen corresponding path program 1 times [2019-10-22 08:57:47,591 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:57:47,591 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1163998910] [2019-10-22 08:57:47,592 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:57:47,592 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:57:47,592 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:57:47,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:57:47,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:57:47,618 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:57:48,025 WARN L191 SmtUtils]: Spent 283.00 ms on a formula simplification. DAG size of input: 137 DAG size of output: 115 [2019-10-22 08:57:48,136 WARN L191 SmtUtils]: Spent 107.00 ms on a formula simplification that was a NOOP. DAG size: 98 [2019-10-22 08:57:48,138 INFO L210 LassoAnalysis]: Preferences: [2019-10-22 08:57:48,138 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-10-22 08:57:48,138 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-10-22 08:57:48,138 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-10-22 08:57:48,138 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-10-22 08:57:48,138 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 08:57:48,138 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-10-22 08:57:48,138 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-10-22 08:57:48,138 INFO L131 ssoRankerPreferences]: Filename of dumped script: substring-alloca-2.i_Iteration6_Lasso [2019-10-22 08:57:48,138 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-10-22 08:57:48,138 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-10-22 08:57:48,141 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:57:48,144 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:57:48,146 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:57:48,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:57:48,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:57:48,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:57:48,152 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:57:48,153 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:57:48,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:57:48,165 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:57:48,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:57:48,494 WARN L191 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 82 [2019-10-22 08:57:48,599 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:57:48,601 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:57:48,602 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:57:48,603 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:57:48,605 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:57:48,606 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:57:48,609 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:57:48,610 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:57:48,611 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:57:48,612 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:57:48,614 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:57:48,615 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:57:48,617 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:57:48,618 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:57:48,619 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:57:48,620 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:57:49,175 WARN L191 SmtUtils]: Spent 244.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 40 [2019-10-22 08:57:49,296 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-10-22 08:57:49,296 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-10-22 08:57:49,296 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:57:49,297 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:57:49,297 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:57:49,297 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:57:49,298 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:57:49,298 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:57:49,298 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:57:49,298 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:57:49,299 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:57:49,299 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:57:49,299 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:57:49,299 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:57:49,299 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:57:49,300 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:57:49,300 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:57:49,300 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:57:49,301 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:57:49,302 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:57:49,302 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:57:49,302 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:57:49,302 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:57:49,302 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:57:49,302 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:57:49,303 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:57:49,303 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:57:49,303 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:57:49,303 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:57:49,304 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:57:49,304 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:57:49,304 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:57:49,304 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:57:49,304 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:57:49,304 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:57:49,304 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:57:49,305 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:57:49,306 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:57:49,306 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:57:49,306 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:57:49,306 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:57:49,306 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:57:49,306 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:57:49,307 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:57:49,307 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:57:49,307 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:57:49,307 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:57:49,308 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:57:49,308 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:57:49,308 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:57:49,308 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:57:49,308 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:57:49,308 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:57:49,308 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:57:49,309 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:57:49,310 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:57:49,310 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:57:49,310 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:57:49,310 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:57:49,310 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:57:49,310 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:57:49,311 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:57:49,311 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:57:49,311 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:57:49,311 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:57:49,311 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:57:49,312 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:57:49,312 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:57:49,312 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:57:49,312 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:57:49,312 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:57:49,312 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:57:49,313 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:57:49,313 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:57:49,314 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:57:49,314 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:57:49,314 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:57:49,314 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:57:49,314 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:57:49,314 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:57:49,314 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:57:49,315 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:57:49,315 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:57:49,315 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:57:49,315 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:57:49,316 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:57:49,316 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:57:49,316 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:57:49,316 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:57:49,318 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:57:49,318 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:57:49,318 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:57:49,319 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:57:49,319 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:57:49,319 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:57:49,319 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:57:49,319 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:57:49,320 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:57:49,321 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:57:49,321 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:57:49,321 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:57:49,322 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:57:49,322 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:57:49,322 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:57:49,322 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:57:49,324 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:57:49,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:57:49,324 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:57:49,324 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:57:49,325 INFO L203 nArgumentSynthesizer]: 6 loop disjuncts [2019-10-22 08:57:49,325 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:57:49,354 INFO L400 nArgumentSynthesizer]: We have 96 Motzkin's Theorem applications. [2019-10-22 08:57:49,354 INFO L401 nArgumentSynthesizer]: A total of 12 supporting invariants were added. [2019-10-22 08:57:49,430 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:57:49,430 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:57:49,431 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:57:49,431 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:57:49,431 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:57:49,431 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:57:49,432 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:57:49,432 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:57:49,433 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:57:49,433 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:57:49,434 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:57:49,434 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:57:49,434 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:57:49,434 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:57:49,434 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:57:49,434 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:57:49,434 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:57:49,435 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:57:49,436 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:57:49,436 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:57:49,436 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:57:49,436 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:57:49,436 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:57:49,437 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:57:49,437 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:57:49,438 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:57:49,439 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:57:49,439 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:57:49,439 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:57:49,439 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:57:49,439 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:57:49,440 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:57:49,440 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:57:49,440 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:57:49,441 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:57:49,441 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:57:49,442 INFO L202 nArgumentSynthesizer]: 4 stem disjuncts [2019-10-22 08:57:49,442 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:57:49,442 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:57:49,444 INFO L400 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2019-10-22 08:57:49,444 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:57:49,457 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:57:49,458 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:57:49,458 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:57:49,458 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:57:49,458 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:57:49,459 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:57:49,459 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:57:49,459 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:57:49,462 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:57:49,463 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:57:49,463 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:57:49,463 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:57:49,463 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:57:49,463 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:57:49,464 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:57:49,464 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:57:49,465 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:57:49,465 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:57:49,466 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:57:49,466 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:57:49,466 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:57:49,466 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:57:49,469 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:57:49,469 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:57:49,495 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-10-22 08:57:49,534 INFO L443 ModelExtractionUtils]: Simplification made 7 calls to the SMT solver. [2019-10-22 08:57:49,535 INFO L444 ModelExtractionUtils]: 48 out of 58 variables were initially zero. Simplification set additionally 7 variables to zero. [2019-10-22 08:57:49,535 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-10-22 08:57:49,536 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-10-22 08:57:49,536 INFO L510 LassoAnalysis]: Proved termination. [2019-10-22 08:57:49,536 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_substring_~ps~0.offset, v_rep(select #length ULTIMATE.start_main_#t~malloc13.base)_3) = -1*ULTIMATE.start_substring_~ps~0.offset + 1*v_rep(select #length ULTIMATE.start_main_#t~malloc13.base)_3 Supporting invariants [] [2019-10-22 08:57:49,588 INFO L297 tatePredicateManager]: 14 out of 15 supporting invariants were superfluous and have been removed [2019-10-22 08:57:49,590 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2019-10-22 08:57:49,612 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:57:49,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:57:49,628 INFO L256 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 10 conjunts are in the unsatisfiable core [2019-10-22 08:57:49,628 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:57:49,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:57:49,648 INFO L256 TraceCheckSpWp]: Trace formula consists of 52 conjuncts, 8 conjunts are in the unsatisfiable core [2019-10-22 08:57:49,648 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:57:49,661 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:57:49,662 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 2 loop predicates [2019-10-22 08:57:49,662 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 20 states and 26 transitions. cyclomatic complexity: 9 Second operand 4 states. [2019-10-22 08:57:49,709 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 20 states and 26 transitions. cyclomatic complexity: 9. Second operand 4 states. Result 27 states and 36 transitions. Complement of second has 5 states. [2019-10-22 08:57:49,710 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 2 stem states 1 non-accepting loop states 1 accepting loop states [2019-10-22 08:57:49,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-10-22 08:57:49,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 24 transitions. [2019-10-22 08:57:49,711 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 24 transitions. Stem has 13 letters. Loop has 7 letters. [2019-10-22 08:57:49,711 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 08:57:49,711 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 24 transitions. Stem has 20 letters. Loop has 7 letters. [2019-10-22 08:57:49,711 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 08:57:49,711 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 24 transitions. Stem has 13 letters. Loop has 14 letters. [2019-10-22 08:57:49,712 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 08:57:49,712 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 27 states and 36 transitions. [2019-10-22 08:57:49,712 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-10-22 08:57:49,713 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 27 states to 25 states and 34 transitions. [2019-10-22 08:57:49,715 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 13 [2019-10-22 08:57:49,715 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 14 [2019-10-22 08:57:49,716 INFO L73 IsDeterministic]: Start isDeterministic. Operand 25 states and 34 transitions. [2019-10-22 08:57:49,716 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-10-22 08:57:49,716 INFO L688 BuchiCegarLoop]: Abstraction has 25 states and 34 transitions. [2019-10-22 08:57:49,716 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states and 34 transitions. [2019-10-22 08:57:49,718 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2019-10-22 08:57:49,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2019-10-22 08:57:49,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 34 transitions. [2019-10-22 08:57:49,719 INFO L711 BuchiCegarLoop]: Abstraction has 25 states and 34 transitions. [2019-10-22 08:57:49,719 INFO L591 BuchiCegarLoop]: Abstraction has 25 states and 34 transitions. [2019-10-22 08:57:49,719 INFO L424 BuchiCegarLoop]: ======== Iteration 7============ [2019-10-22 08:57:49,719 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 25 states and 34 transitions. [2019-10-22 08:57:49,720 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-10-22 08:57:49,720 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 08:57:49,720 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 08:57:49,720 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 08:57:49,720 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-10-22 08:57:49,721 INFO L791 eck$LassoCheckResult]: Stem: 778#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 775#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~nondet16, main_#t~post15, main_~i~0, main_#t~nondet18, main_#t~post17, main_~i~1, main_#t~ret19, 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; 776#L532 assume !(main_~length1~0 < 1); 777#L532-2 assume !(main_~length2~0 < 1); 772#L535-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;main_~i~0 := 0; 773#L541-3 assume !!(main_~i~0 < main_~length1~0 - 1);call write~int(main_#t~nondet16, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~0, 1);havoc main_#t~nondet16; 781#L541-2 main_#t~post15 := main_~i~0;main_~i~0 := 1 + main_#t~post15;havoc main_#t~post15; 782#L541-3 assume !(main_~i~0 < main_~length1~0 - 1); 762#L541-4 main_~i~1 := 0; 763#L547-3 assume !!(main_~i~1 < main_~length2~0 - 1);call write~int(main_#t~nondet18, main_~nondetString2~0.base, main_~nondetString2~0.offset + main_~i~1, 1);havoc main_#t~nondet18; 770#L547-2 main_#t~post17 := main_~i~1;main_~i~1 := 1 + main_#t~post17;havoc main_#t~post17; 771#L547-3 assume !(main_~i~1 < main_~length2~0 - 1); 774#L547-4 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; 766#L517-3 call substring_#t~mem2 := read~int(substring_~ps~0.base, substring_~ps~0.offset, 1); 758#L517-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; 759#L520-5 [2019-10-22 08:57:49,721 INFO L793 eck$LassoCheckResult]: Loop: 759#L520-5 call substring_#t~mem3 := read~int(substring_~pt~0.base, substring_~pt~0.offset, 1);substring_#t~short6 := 0 != substring_#t~mem3; 764#L520-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; 779#L520-3 assume !!substring_#t~short6;havoc substring_#t~mem3;havoc substring_#t~mem5;havoc substring_#t~short6;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; 759#L520-5 [2019-10-22 08:57:49,721 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:57:49,721 INFO L82 PathProgramCache]: Analyzing trace with hash 2055034719, now seen corresponding path program 1 times [2019-10-22 08:57:49,721 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:57:49,721 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2109973173] [2019-10-22 08:57:49,721 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:57:49,721 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:57:49,721 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:57:49,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:57:49,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:57:49,763 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:57:49,764 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:57:49,764 INFO L82 PathProgramCache]: Analyzing trace with hash 87489, now seen corresponding path program 1 times [2019-10-22 08:57:49,764 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:57:49,764 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [12053784] [2019-10-22 08:57:49,764 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:57:49,764 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:57:49,764 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:57:49,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:57:49,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:57:49,775 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:57:49,775 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:57:49,775 INFO L82 PathProgramCache]: Analyzing trace with hash 1075534243, now seen corresponding path program 1 times [2019-10-22 08:57:49,775 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:57:49,775 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1656551316] [2019-10-22 08:57:49,775 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:57:49,775 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:57:49,776 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:57:49,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:57:49,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:57:49,803 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:57:50,621 WARN L191 SmtUtils]: Spent 710.00 ms on a formula simplification. DAG size of input: 157 DAG size of output: 134 [2019-10-22 08:57:50,777 WARN L191 SmtUtils]: Spent 154.00 ms on a formula simplification that was a NOOP. DAG size: 116 [2019-10-22 08:57:50,779 INFO L210 LassoAnalysis]: Preferences: [2019-10-22 08:57:50,779 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-10-22 08:57:50,779 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-10-22 08:57:50,779 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-10-22 08:57:50,779 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-10-22 08:57:50,779 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 08:57:50,779 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-10-22 08:57:50,779 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-10-22 08:57:50,779 INFO L131 ssoRankerPreferences]: Filename of dumped script: substring-alloca-2.i_Iteration7_Lasso [2019-10-22 08:57:50,780 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-10-22 08:57:50,780 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-10-22 08:57:50,782 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:57:50,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:57:50,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:57:50,793 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:57:50,795 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:57:50,798 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:57:50,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:57:50,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:57:51,353 WARN L191 SmtUtils]: Spent 341.00 ms on a formula simplification. DAG size of input: 135 DAG size of output: 104 [2019-10-22 08:57:51,533 WARN L191 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 78 [2019-10-22 08:57:51,533 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:57:51,535 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:57:51,536 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:57:51,537 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:57:51,553 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:57:51,555 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:57:51,557 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:57:51,558 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:57:51,561 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:57:51,563 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:57:51,565 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:57:51,567 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:57:51,568 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:57:51,570 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:57:51,572 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:57:51,573 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:57:51,575 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:57:51,577 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:57:51,579 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:57:51,581 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:57:51,821 WARN L191 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 63 [2019-10-22 08:57:52,298 WARN L191 SmtUtils]: Spent 344.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 46 [2019-10-22 08:57:52,523 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-10-22 08:57:52,523 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-10-22 08:57:52,523 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:57:52,524 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:57:52,524 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:57:52,524 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:57:52,524 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:57:52,524 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:57:52,524 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:57:52,525 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:57:52,526 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:57:52,526 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:57:52,526 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:57:52,527 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:57:52,527 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:57:52,527 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:57:52,527 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:57:52,527 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:57:52,529 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:57:52,529 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:57:52,530 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:57:52,530 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:57:52,530 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:57:52,530 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:57:52,530 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:57:52,530 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:57:52,530 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:57:52,531 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:57:52,531 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:57:52,531 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:57:52,532 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:57:52,532 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:57:52,532 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:57:52,532 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:57:52,532 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:57:52,532 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:57:52,532 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:57:52,533 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:57:52,534 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:57:52,534 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:57:52,534 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:57:52,534 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:57:52,534 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:57:52,535 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:57:52,535 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:57:52,536 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:57:52,536 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:57:52,536 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:57:52,536 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:57:52,536 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:57:52,537 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:57:52,537 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:57:52,537 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:57:52,538 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:57:52,538 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:57:52,538 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:57:52,539 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:57:52,539 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:57:52,539 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:57:52,539 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:57:52,539 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:57:52,539 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:57:52,540 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:57:52,540 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:57:52,540 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:57:52,540 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:57:52,540 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:57:52,541 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:57:52,541 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:57:52,542 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:57:52,542 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:57:52,543 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:57:52,543 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:57:52,543 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:57:52,543 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:57:52,543 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:57:52,544 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:57:52,544 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:57:52,545 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:57:52,545 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:57:52,546 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:57:52,546 INFO L202 nArgumentSynthesizer]: 4 stem disjuncts [2019-10-22 08:57:52,546 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:57:52,546 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:57:52,549 INFO L400 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2019-10-22 08:57:52,549 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:57:52,567 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:57:52,567 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:57:52,568 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:57:52,568 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:57:52,568 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:57:52,568 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:57:52,569 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:57:52,569 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:57:52,570 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:57:52,570 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:57:52,571 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:57:52,571 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:57:52,571 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:57:52,571 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:57:52,575 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:57:52,575 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:57:52,648 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-10-22 08:57:52,802 INFO L443 ModelExtractionUtils]: Simplification made 9 calls to the SMT solver. [2019-10-22 08:57:52,802 INFO L444 ModelExtractionUtils]: 53 out of 64 variables were initially zero. Simplification set additionally 8 variables to zero. [2019-10-22 08:57:52,803 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-10-22 08:57:52,803 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-10-22 08:57:52,803 INFO L510 LassoAnalysis]: Proved termination. [2019-10-22 08:57:52,804 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_substring_~ps2~0.base)_2, ULTIMATE.start_substring_~pt~0.offset) = 1*v_rep(select #length ULTIMATE.start_substring_~ps2~0.base)_2 - 1*ULTIMATE.start_substring_~pt~0.offset Supporting invariants [] [2019-10-22 08:57:52,934 INFO L297 tatePredicateManager]: 33 out of 34 supporting invariants were superfluous and have been removed [2019-10-22 08:57:52,935 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2019-10-22 08:57:52,952 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:57:52,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:57:52,981 INFO L256 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 24 conjunts are in the unsatisfiable core [2019-10-22 08:57:52,981 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:57:53,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:57:53,020 INFO L256 TraceCheckSpWp]: Trace formula consists of 34 conjuncts, 11 conjunts are in the unsatisfiable core [2019-10-22 08:57:53,020 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:57:53,034 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:57:53,034 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.3 stem predicates 2 loop predicates [2019-10-22 08:57:53,035 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 25 states and 34 transitions. cyclomatic complexity: 13 Second operand 6 states. [2019-10-22 08:57:53,110 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 25 states and 34 transitions. cyclomatic complexity: 13. Second operand 6 states. Result 67 states and 86 transitions. Complement of second has 9 states. [2019-10-22 08:57:53,110 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 3 stem states 2 non-accepting loop states 1 accepting loop states [2019-10-22 08:57:53,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2019-10-22 08:57:53,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 31 transitions. [2019-10-22 08:57:53,111 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 31 transitions. Stem has 15 letters. Loop has 3 letters. [2019-10-22 08:57:53,111 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 08:57:53,111 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 31 transitions. Stem has 18 letters. Loop has 3 letters. [2019-10-22 08:57:53,111 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 08:57:53,111 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 31 transitions. Stem has 15 letters. Loop has 6 letters. [2019-10-22 08:57:53,112 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 08:57:53,112 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 67 states and 86 transitions. [2019-10-22 08:57:53,113 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2019-10-22 08:57:53,114 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 67 states to 56 states and 74 transitions. [2019-10-22 08:57:53,115 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 21 [2019-10-22 08:57:53,115 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 22 [2019-10-22 08:57:53,115 INFO L73 IsDeterministic]: Start isDeterministic. Operand 56 states and 74 transitions. [2019-10-22 08:57:53,115 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-10-22 08:57:53,115 INFO L688 BuchiCegarLoop]: Abstraction has 56 states and 74 transitions. [2019-10-22 08:57:53,115 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states and 74 transitions. [2019-10-22 08:57:53,118 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 45. [2019-10-22 08:57:53,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2019-10-22 08:57:53,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 61 transitions. [2019-10-22 08:57:53,119 INFO L711 BuchiCegarLoop]: Abstraction has 45 states and 61 transitions. [2019-10-22 08:57:53,119 INFO L591 BuchiCegarLoop]: Abstraction has 45 states and 61 transitions. [2019-10-22 08:57:53,119 INFO L424 BuchiCegarLoop]: ======== Iteration 8============ [2019-10-22 08:57:53,119 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 45 states and 61 transitions. [2019-10-22 08:57:53,120 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2019-10-22 08:57:53,120 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 08:57:53,120 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 08:57:53,120 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 08:57:53,120 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-10-22 08:57:53,121 INFO L791 eck$LassoCheckResult]: Stem: 1100#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 1097#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~nondet16, main_#t~post15, main_~i~0, main_#t~nondet18, main_#t~post17, main_~i~1, main_#t~ret19, 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; 1098#L532 assume !(main_~length1~0 < 1); 1099#L532-2 assume !(main_~length2~0 < 1); 1094#L535-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;main_~i~0 := 0; 1095#L541-3 assume !!(main_~i~0 < main_~length1~0 - 1);call write~int(main_#t~nondet16, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~0, 1);havoc main_#t~nondet16; 1105#L541-2 main_#t~post15 := main_~i~0;main_~i~0 := 1 + main_#t~post15;havoc main_#t~post15; 1106#L541-3 assume !(main_~i~0 < main_~length1~0 - 1); 1080#L541-4 main_~i~1 := 0; 1081#L547-3 assume !!(main_~i~1 < main_~length2~0 - 1);call write~int(main_#t~nondet18, main_~nondetString2~0.base, main_~nondetString2~0.offset + main_~i~1, 1);havoc main_#t~nondet18; 1092#L547-2 main_#t~post17 := main_~i~1;main_~i~1 := 1 + main_#t~post17;havoc main_#t~post17; 1093#L547-3 assume !(main_~i~1 < main_~length2~0 - 1); 1096#L547-4 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; 1088#L517-3 call substring_#t~mem2 := read~int(substring_~ps~0.base, substring_~ps~0.offset, 1); 1076#L517-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; 1077#L520-5 call substring_#t~mem3 := read~int(substring_~pt~0.base, substring_~pt~0.offset, 1);substring_#t~short6 := 0 != substring_#t~mem3; 1083#L520-1 [2019-10-22 08:57:53,121 INFO L793 eck$LassoCheckResult]: Loop: 1083#L520-1 assume !substring_#t~short6; 1101#L520-3 assume !!substring_#t~short6;havoc substring_#t~mem3;havoc substring_#t~mem5;havoc substring_#t~short6;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; 1082#L520-5 call substring_#t~mem3 := read~int(substring_~pt~0.base, substring_~pt~0.offset, 1);substring_#t~short6 := 0 != substring_#t~mem3; 1083#L520-1 [2019-10-22 08:57:53,121 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:57:53,121 INFO L82 PathProgramCache]: Analyzing trace with hash -718433093, now seen corresponding path program 1 times [2019-10-22 08:57:53,121 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:57:53,122 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1497990564] [2019-10-22 08:57:53,122 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:57:53,122 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:57:53,122 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:57:53,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:57:53,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:57:53,147 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:57:53,147 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:57:53,147 INFO L82 PathProgramCache]: Analyzing trace with hash 92531, now seen corresponding path program 1 times [2019-10-22 08:57:53,147 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:57:53,147 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [236805887] [2019-10-22 08:57:53,148 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:57:53,148 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:57:53,148 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:57:53,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:57:53,154 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:57:53,154 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [236805887] [2019-10-22 08:57:53,155 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:57:53,155 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-10-22 08:57:53,155 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1273052492] [2019-10-22 08:57:53,155 INFO L808 eck$LassoCheckResult]: loop already infeasible [2019-10-22 08:57:53,155 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:57:53,155 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 08:57:53,156 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 08:57:53,156 INFO L87 Difference]: Start difference. First operand 45 states and 61 transitions. cyclomatic complexity: 24 Second operand 3 states. [2019-10-22 08:57:53,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:57:53,167 INFO L93 Difference]: Finished difference Result 43 states and 54 transitions. [2019-10-22 08:57:53,168 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 08:57:53,168 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 43 states and 54 transitions. [2019-10-22 08:57:53,169 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-10-22 08:57:53,169 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 43 states to 33 states and 42 transitions. [2019-10-22 08:57:53,169 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 14 [2019-10-22 08:57:53,170 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 14 [2019-10-22 08:57:53,170 INFO L73 IsDeterministic]: Start isDeterministic. Operand 33 states and 42 transitions. [2019-10-22 08:57:53,170 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-10-22 08:57:53,170 INFO L688 BuchiCegarLoop]: Abstraction has 33 states and 42 transitions. [2019-10-22 08:57:53,170 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states and 42 transitions. [2019-10-22 08:57:53,171 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 31. [2019-10-22 08:57:53,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2019-10-22 08:57:53,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 40 transitions. [2019-10-22 08:57:53,172 INFO L711 BuchiCegarLoop]: Abstraction has 31 states and 40 transitions. [2019-10-22 08:57:53,172 INFO L591 BuchiCegarLoop]: Abstraction has 31 states and 40 transitions. [2019-10-22 08:57:53,172 INFO L424 BuchiCegarLoop]: ======== Iteration 9============ [2019-10-22 08:57:53,172 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 31 states and 40 transitions. [2019-10-22 08:57:53,173 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-10-22 08:57:53,173 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 08:57:53,173 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 08:57:53,174 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 08:57:53,174 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-10-22 08:57:53,174 INFO L791 eck$LassoCheckResult]: Stem: 1192#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 1189#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~nondet16, main_#t~post15, main_~i~0, main_#t~nondet18, main_#t~post17, main_~i~1, main_#t~ret19, 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; 1190#L532 assume !(main_~length1~0 < 1); 1191#L532-2 assume !(main_~length2~0 < 1); 1186#L535-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;main_~i~0 := 0; 1187#L541-3 assume !!(main_~i~0 < main_~length1~0 - 1);call write~int(main_#t~nondet16, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~0, 1);havoc main_#t~nondet16; 1195#L541-2 main_#t~post15 := main_~i~0;main_~i~0 := 1 + main_#t~post15;havoc main_#t~post15; 1196#L541-3 assume !(main_~i~0 < main_~length1~0 - 1); 1174#L541-4 main_~i~1 := 0; 1175#L547-3 assume !!(main_~i~1 < main_~length2~0 - 1);call write~int(main_#t~nondet18, main_~nondetString2~0.base, main_~nondetString2~0.offset + main_~i~1, 1);havoc main_#t~nondet18; 1184#L547-2 main_#t~post17 := main_~i~1;main_~i~1 := 1 + main_#t~post17;havoc main_#t~post17; 1185#L547-3 assume !(main_~i~1 < main_~length2~0 - 1); 1188#L547-4 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; 1181#L517-3 call substring_#t~mem2 := read~int(substring_~ps~0.base, substring_~ps~0.offset, 1); 1172#L517-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; 1173#L520-5 call substring_#t~mem3 := read~int(substring_~pt~0.base, substring_~pt~0.offset, 1);substring_#t~short6 := 0 != substring_#t~mem3; 1177#L520-1 assume !substring_#t~short6; 1194#L520-3 assume !substring_#t~short6;havoc substring_#t~mem3;havoc substring_#t~mem5;havoc substring_#t~short6;havoc substring_#t~mem4; 1179#L520-6 call substring_#t~mem9 := read~int(substring_~pt~0.base, substring_~pt~0.offset, 1); 1180#L524 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; 1182#L517-3 call substring_#t~mem2 := read~int(substring_~ps~0.base, substring_~ps~0.offset, 1); 1170#L517-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; 1171#L520-5 [2019-10-22 08:57:53,174 INFO L793 eck$LassoCheckResult]: Loop: 1171#L520-5 call substring_#t~mem3 := read~int(substring_~pt~0.base, substring_~pt~0.offset, 1);substring_#t~short6 := 0 != substring_#t~mem3; 1176#L520-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; 1193#L520-3 assume !!substring_#t~short6;havoc substring_#t~mem3;havoc substring_#t~mem5;havoc substring_#t~short6;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; 1171#L520-5 [2019-10-22 08:57:53,174 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:57:53,174 INFO L82 PathProgramCache]: Analyzing trace with hash -1389384631, now seen corresponding path program 1 times [2019-10-22 08:57:53,175 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:57:53,175 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [587708347] [2019-10-22 08:57:53,175 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:57:53,175 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:57:53,175 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:57:53,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:57:53,202 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-10-22 08:57:53,202 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [587708347] [2019-10-22 08:57:53,203 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:57:53,203 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-22 08:57:53,203 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [717077264] [2019-10-22 08:57:53,203 INFO L796 eck$LassoCheckResult]: stem already infeasible [2019-10-22 08:57:53,203 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:57:53,203 INFO L82 PathProgramCache]: Analyzing trace with hash 87489, now seen corresponding path program 2 times [2019-10-22 08:57:53,204 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:57:53,204 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2091138329] [2019-10-22 08:57:53,204 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:57:53,204 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:57:53,204 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:57:53,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:57:53,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:57:53,210 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:57:53,322 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:57:53,322 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-22 08:57:53,322 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-10-22 08:57:53,322 INFO L87 Difference]: Start difference. First operand 31 states and 40 transitions. cyclomatic complexity: 14 Second operand 5 states. [2019-10-22 08:57:53,346 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:57:53,346 INFO L93 Difference]: Finished difference Result 34 states and 42 transitions. [2019-10-22 08:57:53,347 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-22 08:57:53,347 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 34 states and 42 transitions. [2019-10-22 08:57:53,347 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-10-22 08:57:53,347 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 34 states to 31 states and 38 transitions. [2019-10-22 08:57:53,348 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 14 [2019-10-22 08:57:53,348 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 14 [2019-10-22 08:57:53,348 INFO L73 IsDeterministic]: Start isDeterministic. Operand 31 states and 38 transitions. [2019-10-22 08:57:53,348 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-10-22 08:57:53,348 INFO L688 BuchiCegarLoop]: Abstraction has 31 states and 38 transitions. [2019-10-22 08:57:53,348 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states and 38 transitions. [2019-10-22 08:57:53,349 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2019-10-22 08:57:53,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2019-10-22 08:57:53,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 38 transitions. [2019-10-22 08:57:53,350 INFO L711 BuchiCegarLoop]: Abstraction has 31 states and 38 transitions. [2019-10-22 08:57:53,350 INFO L591 BuchiCegarLoop]: Abstraction has 31 states and 38 transitions. [2019-10-22 08:57:53,350 INFO L424 BuchiCegarLoop]: ======== Iteration 10============ [2019-10-22 08:57:53,350 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 31 states and 38 transitions. [2019-10-22 08:57:53,351 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-10-22 08:57:53,351 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 08:57:53,351 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 08:57:53,351 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 08:57:53,351 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-10-22 08:57:53,352 INFO L791 eck$LassoCheckResult]: Stem: 1266#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 1263#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~nondet16, main_#t~post15, main_~i~0, main_#t~nondet18, main_#t~post17, main_~i~1, main_#t~ret19, 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; 1264#L532 assume !(main_~length1~0 < 1); 1265#L532-2 assume !(main_~length2~0 < 1); 1260#L535-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;main_~i~0 := 0; 1261#L541-3 assume !!(main_~i~0 < main_~length1~0 - 1);call write~int(main_#t~nondet16, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~0, 1);havoc main_#t~nondet16; 1270#L541-2 main_#t~post15 := main_~i~0;main_~i~0 := 1 + main_#t~post15;havoc main_#t~post15; 1271#L541-3 assume !(main_~i~0 < main_~length1~0 - 1); 1249#L541-4 main_~i~1 := 0; 1250#L547-3 assume !!(main_~i~1 < main_~length2~0 - 1);call write~int(main_#t~nondet18, main_~nondetString2~0.base, main_~nondetString2~0.offset + main_~i~1, 1);havoc main_#t~nondet18; 1258#L547-2 main_#t~post17 := main_~i~1;main_~i~1 := 1 + main_#t~post17;havoc main_#t~post17; 1259#L547-3 assume !(main_~i~1 < main_~length2~0 - 1); 1262#L547-4 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; 1253#L517-3 call substring_#t~mem2 := read~int(substring_~ps~0.base, substring_~ps~0.offset, 1); 1254#L517-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; 1273#L520-5 call substring_#t~mem3 := read~int(substring_~pt~0.base, substring_~pt~0.offset, 1);substring_#t~short6 := 0 != substring_#t~mem3; 1268#L520-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; 1269#L520-3 assume !substring_#t~short6;havoc substring_#t~mem3;havoc substring_#t~mem5;havoc substring_#t~short6;havoc substring_#t~mem4; 1256#L520-6 call substring_#t~mem9 := read~int(substring_~pt~0.base, substring_~pt~0.offset, 1); 1257#L524 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; 1255#L517-3 call substring_#t~mem2 := read~int(substring_~ps~0.base, substring_~ps~0.offset, 1); 1245#L517-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; 1246#L520-5 [2019-10-22 08:57:53,352 INFO L793 eck$LassoCheckResult]: Loop: 1246#L520-5 call substring_#t~mem3 := read~int(substring_~pt~0.base, substring_~pt~0.offset, 1);substring_#t~short6 := 0 != substring_#t~mem3; 1251#L520-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; 1267#L520-3 assume !!substring_#t~short6;havoc substring_#t~mem3;havoc substring_#t~mem5;havoc substring_#t~short6;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; 1246#L520-5 [2019-10-22 08:57:53,352 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:57:53,352 INFO L82 PathProgramCache]: Analyzing trace with hash -1446642933, now seen corresponding path program 2 times [2019-10-22 08:57:53,352 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:57:53,352 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1133980720] [2019-10-22 08:57:53,352 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:57:53,352 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:57:53,353 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:57:53,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:57:53,568 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-10-22 08:57:53,569 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1133980720] [2019-10-22 08:57:53,569 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [795942390] [2019-10-22 08:57:53,569 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_863f7722-ce1d-4c98-ad94-94851eac0da5/bin/uautomizer/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-22 08:57:53,641 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-10-22 08:57:53,641 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-22 08:57:53,642 INFO L256 TraceCheckSpWp]: Trace formula consists of 149 conjuncts, 31 conjunts are in the unsatisfiable core [2019-10-22 08:57:53,643 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:57:53,653 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2019-10-22 08:57:53,653 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-22 08:57:53,657 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 08:57:53,657 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-10-22 08:57:53,657 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:8 [2019-10-22 08:57:53,729 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 21 [2019-10-22 08:57:53,730 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-22 08:57:53,746 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 08:57:53,748 INFO L496 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-10-22 08:57:53,748 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:47, output treesize:31 [2019-10-22 08:57:53,866 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 08:57:53,867 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 21 [2019-10-22 08:57:53,868 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-10-22 08:57:53,883 INFO L567 ElimStorePlain]: treesize reduction 8, result has 63.6 percent of original size [2019-10-22 08:57:53,884 INFO L496 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-22 08:57:53,885 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 7 variables, input treesize:38, output treesize:3 [2019-10-22 08:57:53,909 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-10-22 08:57:53,910 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-22 08:57:53,910 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 15 [2019-10-22 08:57:53,910 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1563901065] [2019-10-22 08:57:53,910 INFO L796 eck$LassoCheckResult]: stem already infeasible [2019-10-22 08:57:53,911 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:57:53,911 INFO L82 PathProgramCache]: Analyzing trace with hash 87489, now seen corresponding path program 3 times [2019-10-22 08:57:53,911 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:57:53,911 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [406103159] [2019-10-22 08:57:53,911 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:57:53,911 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:57:53,911 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:57:53,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:57:53,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:57:53,919 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:57:54,046 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:57:54,046 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-10-22 08:57:54,046 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=202, Unknown=0, NotChecked=0, Total=240 [2019-10-22 08:57:54,046 INFO L87 Difference]: Start difference. First operand 31 states and 38 transitions. cyclomatic complexity: 12 Second operand 16 states. [2019-10-22 08:57:54,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:57:54,403 INFO L93 Difference]: Finished difference Result 51 states and 60 transitions. [2019-10-22 08:57:54,403 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-10-22 08:57:54,403 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 51 states and 60 transitions. [2019-10-22 08:57:54,404 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-10-22 08:57:54,404 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 51 states to 34 states and 41 transitions. [2019-10-22 08:57:54,404 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 14 [2019-10-22 08:57:54,404 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 14 [2019-10-22 08:57:54,404 INFO L73 IsDeterministic]: Start isDeterministic. Operand 34 states and 41 transitions. [2019-10-22 08:57:54,405 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-10-22 08:57:54,405 INFO L688 BuchiCegarLoop]: Abstraction has 34 states and 41 transitions. [2019-10-22 08:57:54,405 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states and 41 transitions. [2019-10-22 08:57:54,406 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 33. [2019-10-22 08:57:54,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2019-10-22 08:57:54,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 40 transitions. [2019-10-22 08:57:54,407 INFO L711 BuchiCegarLoop]: Abstraction has 33 states and 40 transitions. [2019-10-22 08:57:54,407 INFO L591 BuchiCegarLoop]: Abstraction has 33 states and 40 transitions. [2019-10-22 08:57:54,407 INFO L424 BuchiCegarLoop]: ======== Iteration 11============ [2019-10-22 08:57:54,407 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 33 states and 40 transitions. [2019-10-22 08:57:54,407 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-10-22 08:57:54,407 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 08:57:54,407 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 08:57:54,408 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 08:57:54,408 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-10-22 08:57:54,408 INFO L791 eck$LassoCheckResult]: Stem: 1444#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 1441#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~nondet16, main_#t~post15, main_~i~0, main_#t~nondet18, main_#t~post17, main_~i~1, main_#t~ret19, 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; 1442#L532 assume !(main_~length1~0 < 1); 1443#L532-2 assume !(main_~length2~0 < 1); 1438#L535-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;main_~i~0 := 0; 1439#L541-3 assume !!(main_~i~0 < main_~length1~0 - 1);call write~int(main_#t~nondet16, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~0, 1);havoc main_#t~nondet16; 1448#L541-2 main_#t~post15 := main_~i~0;main_~i~0 := 1 + main_#t~post15;havoc main_#t~post15; 1449#L541-3 assume !!(main_~i~0 < main_~length1~0 - 1);call write~int(main_#t~nondet16, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~0, 1);havoc main_#t~nondet16; 1452#L541-2 main_#t~post15 := main_~i~0;main_~i~0 := 1 + main_#t~post15;havoc main_#t~post15; 1453#L541-3 assume !(main_~i~0 < main_~length1~0 - 1); 1427#L541-4 main_~i~1 := 0; 1428#L547-3 assume !!(main_~i~1 < main_~length2~0 - 1);call write~int(main_#t~nondet18, main_~nondetString2~0.base, main_~nondetString2~0.offset + main_~i~1, 1);havoc main_#t~nondet18; 1436#L547-2 main_#t~post17 := main_~i~1;main_~i~1 := 1 + main_#t~post17;havoc main_#t~post17; 1437#L547-3 assume !(main_~i~1 < main_~length2~0 - 1); 1440#L547-4 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; 1433#L517-3 call substring_#t~mem2 := read~int(substring_~ps~0.base, substring_~ps~0.offset, 1); 1434#L517-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; 1451#L520-5 call substring_#t~mem3 := read~int(substring_~pt~0.base, substring_~pt~0.offset, 1);substring_#t~short6 := 0 != substring_#t~mem3; 1446#L520-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; 1447#L520-3 assume !substring_#t~short6;havoc substring_#t~mem3;havoc substring_#t~mem5;havoc substring_#t~short6;havoc substring_#t~mem4; 1431#L520-6 call substring_#t~mem9 := read~int(substring_~pt~0.base, substring_~pt~0.offset, 1); 1432#L524 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; 1435#L517-3 call substring_#t~mem2 := read~int(substring_~ps~0.base, substring_~ps~0.offset, 1); 1423#L517-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; 1424#L520-5 [2019-10-22 08:57:54,408 INFO L793 eck$LassoCheckResult]: Loop: 1424#L520-5 call substring_#t~mem3 := read~int(substring_~pt~0.base, substring_~pt~0.offset, 1);substring_#t~short6 := 0 != substring_#t~mem3; 1429#L520-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; 1445#L520-3 assume !!substring_#t~short6;havoc substring_#t~mem3;havoc substring_#t~mem5;havoc substring_#t~short6;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; 1424#L520-5 [2019-10-22 08:57:54,409 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:57:54,409 INFO L82 PathProgramCache]: Analyzing trace with hash -1546919447, now seen corresponding path program 3 times [2019-10-22 08:57:54,409 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:57:54,409 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [419515979] [2019-10-22 08:57:54,409 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:57:54,410 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:57:54,410 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:57:54,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:57:54,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:57:54,436 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:57:54,437 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:57:54,437 INFO L82 PathProgramCache]: Analyzing trace with hash 87489, now seen corresponding path program 4 times [2019-10-22 08:57:54,437 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:57:54,437 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [864834902] [2019-10-22 08:57:54,437 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:57:54,438 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:57:54,438 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:57:54,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:57:54,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:57:54,443 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:57:54,444 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:57:54,444 INFO L82 PathProgramCache]: Analyzing trace with hash 721898201, now seen corresponding path program 1 times [2019-10-22 08:57:54,444 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:57:54,444 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1230697932] [2019-10-22 08:57:54,444 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:57:54,444 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:57:54,444 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:57:54,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:57:54,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:57:54,476 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:57:55,527 WARN L191 SmtUtils]: Spent 918.00 ms on a formula simplification. DAG size of input: 235 DAG size of output: 179 [2019-10-22 08:57:55,739 WARN L191 SmtUtils]: Spent 185.00 ms on a formula simplification that was a NOOP. DAG size: 128 [2019-10-22 08:57:55,741 INFO L210 LassoAnalysis]: Preferences: [2019-10-22 08:57:55,741 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-10-22 08:57:55,742 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-10-22 08:57:55,742 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-10-22 08:57:55,742 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-10-22 08:57:55,742 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 08:57:55,742 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-10-22 08:57:55,742 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-10-22 08:57:55,742 INFO L131 ssoRankerPreferences]: Filename of dumped script: substring-alloca-2.i_Iteration11_Lasso [2019-10-22 08:57:55,742 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-10-22 08:57:55,742 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-10-22 08:57:55,745 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:57:55,751 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:57:55,754 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:57:55,756 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:57:55,758 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:57:55,760 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:57:55,762 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:57:55,764 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:57:55,766 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:57:55,768 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:57:55,769 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:57:55,770 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:57:55,773 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:57:55,778 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:57:55,780 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:57:55,782 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:57:55,784 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:57:55,786 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:57:55,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:57:55,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:57:55,793 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:57:56,322 WARN L191 SmtUtils]: Spent 283.00 ms on a formula simplification. DAG size of input: 134 DAG size of output: 113 [2019-10-22 08:57:56,480 WARN L191 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 77 [2019-10-22 08:57:56,480 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:57:56,487 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:57:56,488 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:57:56,489 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:57:56,490 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:57:56,491 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:57:57,266 WARN L191 SmtUtils]: Spent 351.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 46 [2019-10-22 08:57:57,707 WARN L191 SmtUtils]: Spent 405.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 45 [2019-10-22 08:57:57,743 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-10-22 08:57:57,744 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-10-22 08:57:57,744 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:57:57,744 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:57:57,744 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:57:57,745 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:57:57,745 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:57:57,745 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:57:57,745 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:57:57,745 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:57:57,746 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:57:57,746 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:57:57,746 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:57:57,746 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:57:57,747 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:57:57,747 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:57:57,747 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:57:57,747 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:57:57,747 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:57:57,747 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:57:57,748 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:57:57,748 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:57:57,748 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:57:57,748 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:57:57,748 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:57:57,748 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:57:57,748 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:57:57,749 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:57:57,749 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:57:57,750 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:57:57,750 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:57:57,750 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:57:57,750 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:57:57,750 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:57:57,751 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:57:57,751 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:57:57,752 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:57:57,752 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:57:57,752 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:57:57,752 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:57:57,752 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:57:57,753 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:57:57,753 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:57:57,753 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:57:57,754 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:57:57,754 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:57:57,754 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:57:57,754 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:57:57,755 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:57:57,755 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:57:57,755 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:57:57,755 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:57:57,755 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:57:57,755 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:57:57,755 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:57:57,756 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:57:57,756 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:57:57,756 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:57:57,756 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:57:57,756 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:57:57,757 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:57:57,757 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:57:57,758 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:57:57,759 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:57:57,759 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:57:57,759 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:57:57,759 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:57:57,759 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:57:57,759 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:57:57,760 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:57:57,760 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:57:57,760 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:57:57,760 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:57:57,761 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:57:57,761 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:57:57,761 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:57:57,762 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:57:57,762 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:57:57,762 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:57:57,762 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:57:57,762 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:57:57,763 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:57:57,763 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:57:57,763 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:57:57,763 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:57:57,763 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:57:57,763 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:57:57,763 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:57:57,764 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:57:57,764 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:57:57,764 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:57:57,764 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:57:57,765 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:57:57,765 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:57:57,765 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:57:57,765 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:57:57,766 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:57:57,766 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:57:57,766 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:57:57,766 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:57:57,767 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:57:57,767 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:57:57,767 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:57:57,767 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:57:57,767 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:57:57,767 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:57:57,767 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:57:57,768 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:57:57,768 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:57:57,768 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:57:57,768 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:57:57,768 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:57:57,769 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:57:57,769 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:57:57,769 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:57:57,770 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:57:57,770 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:57:57,770 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:57:57,770 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:57:57,771 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:57:57,771 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:57:57,771 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:57:57,771 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:57:57,771 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:57:57,771 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:57:57,772 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:57:57,772 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:57:57,772 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:57:57,772 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:57:57,772 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:57:57,772 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:57:57,773 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:57:57,773 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:57:57,773 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:57:57,774 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:57:57,774 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:57:57,774 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:57:57,774 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:57:57,775 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:57:57,775 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:57:57,775 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:57:57,775 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:57:57,775 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:57:57,775 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:57:57,776 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:57:57,776 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:57:57,776 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:57:57,776 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:57:57,776 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:57:57,776 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:57:57,777 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:57:57,777 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:57:57,778 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:57:57,778 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:57:57,778 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:57:57,778 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:57:57,778 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:57:57,778 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:57:57,779 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:57:57,779 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:57:57,780 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:57:57,780 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:57:57,780 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:57:57,780 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:57:57,781 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:57:57,781 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:57:57,781 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:57:57,782 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:57:57,782 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:57:57,782 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:57:57,782 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:57:57,783 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:57:57,783 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:57:57,783 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:57:57,783 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:57:57,783 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:57:57,783 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:57:57,783 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:57:57,784 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:57:57,784 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:57:57,784 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:57:57,784 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:57:57,785 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:57:57,785 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:57:57,788 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:57:57,788 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:57:57,828 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-10-22 08:57:57,841 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2019-10-22 08:57:57,841 INFO L444 ModelExtractionUtils]: 48 out of 52 variables were initially zero. Simplification set additionally 1 variables to zero. [2019-10-22 08:57:57,841 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-10-22 08:57:57,842 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-10-22 08:57:57,842 INFO L510 LassoAnalysis]: Proved termination. [2019-10-22 08:57:57,842 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_substring_~pt~0.base)_3, ULTIMATE.start_substring_~pt~0.offset) = 1*v_rep(select #length ULTIMATE.start_substring_~pt~0.base)_3 - 1*ULTIMATE.start_substring_~pt~0.offset Supporting invariants [] [2019-10-22 08:57:58,030 INFO L297 tatePredicateManager]: 42 out of 42 supporting invariants were superfluous and have been removed [2019-10-22 08:57:58,031 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2019-10-22 08:57:58,042 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:57:58,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:57:58,065 INFO L256 TraceCheckSpWp]: Trace formula consists of 157 conjuncts, 2 conjunts are in the unsatisfiable core [2019-10-22 08:57:58,066 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:57:58,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:57:58,074 INFO L256 TraceCheckSpWp]: Trace formula consists of 32 conjuncts, 6 conjunts are in the unsatisfiable core [2019-10-22 08:57:58,075 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:57:58,084 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:57:58,084 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:57:58,084 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 33 states and 40 transitions. cyclomatic complexity: 12 Second operand 3 states. [2019-10-22 08:57:58,103 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 33 states and 40 transitions. cyclomatic complexity: 12. Second operand 3 states. Result 47 states and 55 transitions. Complement of second has 5 states. [2019-10-22 08:57:58,104 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:57:58,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-10-22 08:57:58,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 24 transitions. [2019-10-22 08:57:58,104 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 24 transitions. Stem has 24 letters. Loop has 3 letters. [2019-10-22 08:57:58,105 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 08:57:58,105 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-10-22 08:57:58,116 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:57:58,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:57:58,139 INFO L256 TraceCheckSpWp]: Trace formula consists of 157 conjuncts, 2 conjunts are in the unsatisfiable core [2019-10-22 08:57:58,139 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:57:58,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:57:58,150 INFO L256 TraceCheckSpWp]: Trace formula consists of 32 conjuncts, 6 conjunts are in the unsatisfiable core [2019-10-22 08:57:58,150 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:57:58,159 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:57:58,160 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:57:58,160 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 33 states and 40 transitions. cyclomatic complexity: 12 Second operand 3 states. [2019-10-22 08:57:58,176 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 33 states and 40 transitions. cyclomatic complexity: 12. Second operand 3 states. Result 47 states and 55 transitions. Complement of second has 5 states. [2019-10-22 08:57:58,177 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:57:58,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-10-22 08:57:58,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 24 transitions. [2019-10-22 08:57:58,178 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 24 transitions. Stem has 24 letters. Loop has 3 letters. [2019-10-22 08:57:58,178 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 08:57:58,178 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-10-22 08:57:58,189 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:57:58,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:57:58,212 INFO L256 TraceCheckSpWp]: Trace formula consists of 157 conjuncts, 2 conjunts are in the unsatisfiable core [2019-10-22 08:57:58,213 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:57:58,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:57:58,222 INFO L256 TraceCheckSpWp]: Trace formula consists of 32 conjuncts, 6 conjunts are in the unsatisfiable core [2019-10-22 08:57:58,222 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:57:58,232 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:57:58,233 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:57:58,233 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 33 states and 40 transitions. cyclomatic complexity: 12 Second operand 3 states. [2019-10-22 08:57:58,256 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 33 states and 40 transitions. cyclomatic complexity: 12. Second operand 3 states. Result 47 states and 56 transitions. Complement of second has 4 states. [2019-10-22 08:57:58,257 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:57:58,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-10-22 08:57:58,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 31 transitions. [2019-10-22 08:57:58,257 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 31 transitions. Stem has 24 letters. Loop has 3 letters. [2019-10-22 08:57:58,258 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 08:57:58,258 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 31 transitions. Stem has 27 letters. Loop has 3 letters. [2019-10-22 08:57:58,258 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 08:57:58,258 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 31 transitions. Stem has 24 letters. Loop has 6 letters. [2019-10-22 08:57:58,259 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 08:57:58,259 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 47 states and 56 transitions. [2019-10-22 08:57:58,259 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-10-22 08:57:58,259 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 47 states to 0 states and 0 transitions. [2019-10-22 08:57:58,260 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2019-10-22 08:57:58,260 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2019-10-22 08:57:58,260 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2019-10-22 08:57:58,260 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-10-22 08:57:58,260 INFO L688 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-10-22 08:57:58,260 INFO L711 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-10-22 08:57:58,260 INFO L591 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-10-22 08:57:58,260 INFO L424 BuchiCegarLoop]: ======== Iteration 12============ [2019-10-22 08:57:58,260 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2019-10-22 08:57:58,260 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-10-22 08:57:58,260 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2019-10-22 08:57:58,270 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 22.10 08:57:58 BoogieIcfgContainer [2019-10-22 08:57:58,271 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2019-10-22 08:57:58,272 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-10-22 08:57:58,272 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-10-22 08:57:58,272 INFO L275 PluginConnector]: Witness Printer initialized [2019-10-22 08:57:58,272 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 08:57:42" (3/4) ... [2019-10-22 08:57:58,276 INFO L140 WitnessPrinter]: No result that supports witness generation found [2019-10-22 08:57:58,276 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-10-22 08:57:58,279 INFO L168 Benchmark]: Toolchain (without parser) took 16262.54 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 390.6 MB). Free memory was 935.6 MB in the beginning and 1.1 GB in the end (delta: -144.8 MB). Peak memory consumption was 245.7 MB. Max. memory is 11.5 GB. [2019-10-22 08:57:58,280 INFO L168 Benchmark]: CDTParser took 0.20 ms. Allocated memory is still 1.0 GB. Free memory is still 958.5 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-10-22 08:57:58,281 INFO L168 Benchmark]: CACSL2BoogieTranslator took 441.59 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 147.3 MB). Free memory was 935.6 MB in the beginning and 1.1 GB in the end (delta: -195.4 MB). Peak memory consumption was 18.4 MB. Max. memory is 11.5 GB. [2019-10-22 08:57:58,281 INFO L168 Benchmark]: Boogie Procedure Inliner took 41.97 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:57:58,282 INFO L168 Benchmark]: Boogie Preprocessor took 28.35 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:57:58,282 INFO L168 Benchmark]: RCFGBuilder took 410.23 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: 23.7 MB). Peak memory consumption was 23.7 MB. Max. memory is 11.5 GB. [2019-10-22 08:57:58,283 INFO L168 Benchmark]: BuchiAutomizer took 15332.47 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 243.3 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 20.2 MB). Peak memory consumption was 263.4 MB. Max. memory is 11.5 GB. [2019-10-22 08:57:58,287 INFO L168 Benchmark]: Witness Printer took 4.38 ms. Allocated memory is still 1.4 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-10-22 08:57:58,291 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.20 ms. Allocated memory is still 1.0 GB. Free memory is still 958.5 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 441.59 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 147.3 MB). Free memory was 935.6 MB in the beginning and 1.1 GB in the end (delta: -195.4 MB). Peak memory consumption was 18.4 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 41.97 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 28.35 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. * RCFGBuilder took 410.23 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: 23.7 MB). Peak memory consumption was 23.7 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 15332.47 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 243.3 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 20.2 MB). Peak memory consumption was 263.4 MB. Max. memory is 11.5 GB. * Witness Printer took 4.38 ms. Allocated memory is still 1.4 GB. Free memory is still 1.1 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 11 terminating modules (6 trivial, 4 deterministic, 1 nondeterministic). One deterministic module has affine ranking function length1 + -1 * i and consists of 5 locations. One deterministic module has affine ranking function -1 * i + length2 and consists of 4 locations. One deterministic module has affine ranking function -1 * ps + unknown-#length-unknown[__builtin_alloca (length1 * sizeof(char))] and consists of 4 locations. One deterministic module has affine ranking function unknown-#length-unknown[ps2] + -1 * pt and consists of 6 locations. One nondeterministic module has affine ranking function unknown-#length-unknown[pt] + -1 * pt and consists of 3 locations. 6 modules have a trivial ranking function, the largest among these consists of 16 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 15.2s and 12 iterations. TraceHistogramMax:2. Analysis of lassos took 13.5s. Construction of modules took 0.4s. Büchi inclusion checks took 1.0s. Highest rank in rank-based complementation 3. Minimization of det autom 6. Minimization of nondet autom 5. Automata minimization 0.0s AutomataMinimizationTime, 10 MinimizatonAttempts, 17 StatesRemovedByMinimization, 6 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 45 states and ocurred in iteration 7. Nontrivial modules had stage [4, 0, 1, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 247 SDtfs, 408 SDslu, 471 SDs, 0 SdLazy, 435 SolverSat, 43 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.4s Time LassoAnalysisResults: nont0 unkn0 SFLI1 SFLT0 conc3 concLT0 SILN0 SILU2 SILI0 SILT0 lasso5 LassoPreprocessingBenchmarks: Lassos: inital295 mio100 ax108 hnf99 lsp88 ukn70 mio100 lsp47 div100 bol100 ite100 ukn100 eq185 hnf89 smp98 dnf187 smp90 tf100 neg94 sie118 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 106ms VariablesStem: 3 VariablesLoop: 3 DisjunctsStem: 1 DisjunctsLoop: 6 SupportingInvariants: 12 MotzkinApplications: 96 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...