./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/termination-memory-alloca/cstrspn-alloca-2.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version cad46833 Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_4d7fdd98-4193-4d97-b71d-212c7438fa93/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_4d7fdd98-4193-4d97-b71d-212c7438fa93/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_4d7fdd98-4193-4d97-b71d-212c7438fa93/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_4d7fdd98-4193-4d97-b71d-212c7438fa93/bin/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/termination-memory-alloca/cstrspn-alloca-2.i -s /tmp/vcloud-vcloud-master/worker/working_dir_4d7fdd98-4193-4d97-b71d-212c7438fa93/bin/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_4d7fdd98-4193-4d97-b71d-212c7438fa93/bin/uautomizer --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash 5bb7c0b0be083ae28de17688b83fb766e3f101f5 .............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. 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:54:25,907 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-22 08:54:25,910 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-22 08:54:25,920 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-22 08:54:25,921 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-22 08:54:25,922 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-22 08:54:25,923 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-22 08:54:25,924 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-22 08:54:25,926 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-22 08:54:25,929 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-22 08:54:25,930 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-22 08:54:25,931 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-22 08:54:25,936 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-22 08:54:25,938 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-22 08:54:25,939 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-22 08:54:25,940 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-22 08:54:25,941 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-22 08:54:25,941 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-22 08:54:25,942 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-22 08:54:25,946 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-22 08:54:25,947 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-22 08:54:25,947 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-22 08:54:25,948 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-22 08:54:25,948 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-22 08:54:25,950 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-22 08:54:25,950 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-22 08:54:25,950 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-22 08:54:25,951 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-22 08:54:25,951 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-22 08:54:25,954 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-22 08:54:25,955 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-22 08:54:25,955 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-22 08:54:25,956 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-22 08:54:25,956 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-22 08:54:25,957 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-22 08:54:25,958 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-22 08:54:25,958 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-22 08:54:25,959 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-22 08:54:25,959 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-22 08:54:25,960 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-22 08:54:25,962 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-22 08:54:25,963 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_4d7fdd98-4193-4d97-b71d-212c7438fa93/bin/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf [2019-10-22 08:54:25,974 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-22 08:54:25,983 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-22 08:54:25,985 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-22 08:54:25,985 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-22 08:54:25,986 INFO L138 SettingsManager]: * Use SBE=true [2019-10-22 08:54:25,986 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-10-22 08:54:25,986 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-10-22 08:54:25,986 INFO L138 SettingsManager]: * Use old map elimination=false [2019-10-22 08:54:25,986 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2019-10-22 08:54:25,986 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2019-10-22 08:54:25,987 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-10-22 08:54:25,987 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-22 08:54:25,987 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-10-22 08:54:25,987 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-22 08:54:25,987 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-22 08:54:25,987 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-10-22 08:54:25,987 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-10-22 08:54:25,988 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-10-22 08:54:25,988 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-22 08:54:25,988 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-10-22 08:54:25,988 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-22 08:54:25,988 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-10-22 08:54:25,988 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-22 08:54:25,989 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-22 08:54:25,989 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-10-22 08:54:25,989 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-22 08:54:25,989 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-22 08:54:25,989 INFO L138 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-10-22 08:54:25,990 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-10-22 08:54:25,990 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_4d7fdd98-4193-4d97-b71d-212c7438fa93/bin/uautomizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(F end) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 5bb7c0b0be083ae28de17688b83fb766e3f101f5 [2019-10-22 08:54:26,019 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-22 08:54:26,030 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-22 08:54:26,033 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-22 08:54:26,034 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-22 08:54:26,034 INFO L275 PluginConnector]: CDTParser initialized [2019-10-22 08:54:26,035 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_4d7fdd98-4193-4d97-b71d-212c7438fa93/bin/uautomizer/../../sv-benchmarks/c/termination-memory-alloca/cstrspn-alloca-2.i [2019-10-22 08:54:26,082 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_4d7fdd98-4193-4d97-b71d-212c7438fa93/bin/uautomizer/data/1ae349575/a2e3bf2ad00a476ba556589d5ff42ece/FLAG85e3db544 [2019-10-22 08:54:26,539 INFO L306 CDTParser]: Found 1 translation units. [2019-10-22 08:54:26,542 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_4d7fdd98-4193-4d97-b71d-212c7438fa93/sv-benchmarks/c/termination-memory-alloca/cstrspn-alloca-2.i [2019-10-22 08:54:26,555 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_4d7fdd98-4193-4d97-b71d-212c7438fa93/bin/uautomizer/data/1ae349575/a2e3bf2ad00a476ba556589d5ff42ece/FLAG85e3db544 [2019-10-22 08:54:27,054 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_4d7fdd98-4193-4d97-b71d-212c7438fa93/bin/uautomizer/data/1ae349575/a2e3bf2ad00a476ba556589d5ff42ece [2019-10-22 08:54:27,057 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-22 08:54:27,058 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-10-22 08:54:27,059 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-22 08:54:27,059 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-22 08:54:27,066 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-22 08:54:27,067 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.10 08:54:27" (1/1) ... [2019-10-22 08:54:27,070 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@75c07f2f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:54:27, skipping insertion in model container [2019-10-22 08:54:27,071 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.10 08:54:27" (1/1) ... [2019-10-22 08:54:27,080 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-22 08:54:27,118 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-22 08:54:27,436 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-22 08:54:27,446 INFO L188 MainTranslator]: Completed pre-run [2019-10-22 08:54:27,501 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-22 08:54:27,545 INFO L192 MainTranslator]: Completed translation [2019-10-22 08:54:27,545 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:54:27 WrapperNode [2019-10-22 08:54:27,546 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-22 08:54:27,546 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-10-22 08:54:27,546 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-10-22 08:54:27,547 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-10-22 08:54:27,554 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:54:27" (1/1) ... [2019-10-22 08:54:27,570 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:54:27" (1/1) ... [2019-10-22 08:54:27,594 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-10-22 08:54:27,598 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-22 08:54:27,599 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-22 08:54:27,599 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-22 08:54:27,607 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:54:27" (1/1) ... [2019-10-22 08:54:27,608 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:54:27" (1/1) ... [2019-10-22 08:54:27,610 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:54:27" (1/1) ... [2019-10-22 08:54:27,610 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:54:27" (1/1) ... [2019-10-22 08:54:27,629 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:54:27" (1/1) ... [2019-10-22 08:54:27,633 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:54:27" (1/1) ... [2019-10-22 08:54:27,635 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:54:27" (1/1) ... [2019-10-22 08:54:27,639 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-22 08:54:27,644 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-22 08:54:27,644 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-22 08:54:27,644 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-22 08:54:27,645 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:54:27" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_4d7fdd98-4193-4d97-b71d-212c7438fa93/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:54:27,717 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-10-22 08:54:27,717 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-10-22 08:54:27,717 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-10-22 08:54:27,717 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-10-22 08:54:27,717 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-22 08:54:27,718 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-22 08:54:28,031 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-22 08:54:28,031 INFO L284 CfgBuilder]: Removed 8 assume(true) statements. [2019-10-22 08:54:28,032 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 08:54:28 BoogieIcfgContainer [2019-10-22 08:54:28,033 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-22 08:54:28,033 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-10-22 08:54:28,033 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-10-22 08:54:28,036 INFO L275 PluginConnector]: BuchiAutomizer initialized [2019-10-22 08:54:28,037 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-10-22 08:54:28,037 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 22.10 08:54:27" (1/3) ... [2019-10-22 08:54:28,038 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@7f18ac49 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 22.10 08:54:28, skipping insertion in model container [2019-10-22 08:54:28,038 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-10-22 08:54:28,038 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:54:27" (2/3) ... [2019-10-22 08:54:28,039 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@7f18ac49 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 22.10 08:54:28, skipping insertion in model container [2019-10-22 08:54:28,039 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-10-22 08:54:28,039 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 08:54:28" (3/3) ... [2019-10-22 08:54:28,041 INFO L371 chiAutomizerObserver]: Analyzing ICFG cstrspn-alloca-2.i [2019-10-22 08:54:28,080 INFO L356 BuchiCegarLoop]: Interprodecural is true [2019-10-22 08:54:28,081 INFO L357 BuchiCegarLoop]: Hoare is false [2019-10-22 08:54:28,081 INFO L358 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-10-22 08:54:28,081 INFO L359 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-22 08:54:28,081 INFO L360 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-22 08:54:28,081 INFO L361 BuchiCegarLoop]: Difference is false [2019-10-22 08:54:28,081 INFO L362 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-22 08:54:28,081 INFO L365 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-10-22 08:54:28,095 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states. [2019-10-22 08:54:28,117 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2019-10-22 08:54:28,117 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 08:54:28,117 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 08:54:28,124 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2019-10-22 08:54:28,124 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2019-10-22 08:54:28,124 INFO L424 BuchiCegarLoop]: ======== Iteration 1============ [2019-10-22 08:54:28,125 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states. [2019-10-22 08:54:28,126 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2019-10-22 08:54:28,126 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 08:54:28,126 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 08:54:28,126 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2019-10-22 08:54:28,127 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2019-10-22 08:54:28,134 INFO L791 eck$LassoCheckResult]: Stem: 11#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 10#L-1true havoc main_#res;havoc main_#t~nondet10, main_#t~nondet11, main_#t~malloc12.base, main_#t~malloc12.offset, main_#t~malloc13.base, main_#t~malloc13.offset, main_#t~ret14, 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~nondet10;havoc main_#t~nondet10;main_~length2~0 := main_#t~nondet11;havoc main_#t~nondet11; 7#L565true assume !(main_~length1~0 < 1); 12#L565-2true assume !(main_~length2~0 < 1); 6#L568-1true call main_#t~malloc12.base, main_#t~malloc12.offset := #Ultimate.allocOnStack(main_~length1~0);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc12.base, main_#t~malloc12.offset;call main_#t~malloc13.base, main_#t~malloc13.offset := #Ultimate.allocOnStack(main_~length2~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc13.base, main_#t~malloc13.offset;call write~int(0, main_~nondetString1~0.base, main_~nondetString1~0.offset + (main_~length1~0 - 1), 1);call write~int(0, main_~nondetString2~0.base, main_~nondetString2~0.offset + (main_~length2~0 - 1), 1);cstrspn_#in~s1.base, cstrspn_#in~s1.offset, cstrspn_#in~s2.base, cstrspn_#in~s2.offset := main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;havoc cstrspn_#res;havoc cstrspn_#t~mem4, cstrspn_#t~post8.base, cstrspn_#t~post8.offset, cstrspn_#t~mem5, cstrspn_#t~mem6, cstrspn_#t~short7, cstrspn_#t~mem9, cstrspn_#t~post2.base, cstrspn_#t~post2.offset, cstrspn_#t~mem3, cstrspn_~s1.base, cstrspn_~s1.offset, cstrspn_~s2.base, cstrspn_~s2.offset, cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset, cstrspn_~s~0.base, cstrspn_~s~0.offset, cstrspn_~c~0;cstrspn_~s1.base, cstrspn_~s1.offset := cstrspn_#in~s1.base, cstrspn_#in~s1.offset;cstrspn_~s2.base, cstrspn_~s2.offset := cstrspn_#in~s2.base, cstrspn_#in~s2.offset;havoc cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset;havoc cstrspn_~s~0.base, cstrspn_~s~0.offset;havoc cstrspn_~c~0;cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset := cstrspn_~s1.base, cstrspn_~s1.offset; 3#L552-4true [2019-10-22 08:54:28,134 INFO L793 eck$LassoCheckResult]: Loop: 3#L552-4true call cstrspn_#t~mem3 := read~int(cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset, 1); 14#L552-1true assume !!(0 != cstrspn_#t~mem3);havoc cstrspn_#t~mem3;cstrspn_~s~0.base, cstrspn_~s~0.offset := cstrspn_~s2.base, cstrspn_~s2.offset;call cstrspn_#t~mem4 := read~int(cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset, 1);cstrspn_~c~0 := cstrspn_#t~mem4;havoc cstrspn_#t~mem4; 16#L555-5true assume !true; 19#L555-6true call cstrspn_#t~mem9 := read~int(cstrspn_~s~0.base, cstrspn_~s~0.offset, 1); 5#L557true assume !(cstrspn_#t~mem9 != cstrspn_~c~0);havoc cstrspn_#t~mem9; 20#L552-3true cstrspn_#t~post2.base, cstrspn_#t~post2.offset := cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset;cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset := cstrspn_#t~post2.base, 1 + cstrspn_#t~post2.offset;havoc cstrspn_#t~post2.base, cstrspn_#t~post2.offset; 3#L552-4true [2019-10-22 08:54:28,144 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:54:28,144 INFO L82 PathProgramCache]: Analyzing trace with hash 28695878, now seen corresponding path program 1 times [2019-10-22 08:54:28,152 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:54:28,153 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1946891488] [2019-10-22 08:54:28,153 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:54:28,153 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:54:28,153 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:54:28,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:54:28,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:54:28,325 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:54:28,326 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:54:28,326 INFO L82 PathProgramCache]: Analyzing trace with hash 1454917130, now seen corresponding path program 1 times [2019-10-22 08:54:28,326 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:54:28,327 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1383298724] [2019-10-22 08:54:28,327 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:54:28,327 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:54:28,328 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:54:28,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:54:28,361 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:54:28,361 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1383298724] [2019-10-22 08:54:28,362 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:54:28,362 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-10-22 08:54:28,362 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2075230906] [2019-10-22 08:54:28,367 INFO L808 eck$LassoCheckResult]: loop already infeasible [2019-10-22 08:54:28,368 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:54:28,382 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-10-22 08:54:28,383 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-10-22 08:54:28,385 INFO L87 Difference]: Start difference. First operand 18 states. Second operand 2 states. [2019-10-22 08:54:28,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:54:28,390 INFO L93 Difference]: Finished difference Result 18 states and 23 transitions. [2019-10-22 08:54:28,390 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-10-22 08:54:28,393 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 18 states and 23 transitions. [2019-10-22 08:54:28,394 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2019-10-22 08:54:28,398 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 18 states to 13 states and 17 transitions. [2019-10-22 08:54:28,399 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 13 [2019-10-22 08:54:28,399 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 13 [2019-10-22 08:54:28,400 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 17 transitions. [2019-10-22 08:54:28,400 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-10-22 08:54:28,400 INFO L688 BuchiCegarLoop]: Abstraction has 13 states and 17 transitions. [2019-10-22 08:54:28,415 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states and 17 transitions. [2019-10-22 08:54:28,423 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2019-10-22 08:54:28,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2019-10-22 08:54:28,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 17 transitions. [2019-10-22 08:54:28,425 INFO L711 BuchiCegarLoop]: Abstraction has 13 states and 17 transitions. [2019-10-22 08:54:28,425 INFO L591 BuchiCegarLoop]: Abstraction has 13 states and 17 transitions. [2019-10-22 08:54:28,425 INFO L424 BuchiCegarLoop]: ======== Iteration 2============ [2019-10-22 08:54:28,426 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 13 states and 17 transitions. [2019-10-22 08:54:28,426 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2019-10-22 08:54:28,426 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 08:54:28,426 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 08:54:28,427 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2019-10-22 08:54:28,427 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 08:54:28,427 INFO L791 eck$LassoCheckResult]: Stem: 54#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 53#L-1 havoc main_#res;havoc main_#t~nondet10, main_#t~nondet11, main_#t~malloc12.base, main_#t~malloc12.offset, main_#t~malloc13.base, main_#t~malloc13.offset, main_#t~ret14, 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~nondet10;havoc main_#t~nondet10;main_~length2~0 := main_#t~nondet11;havoc main_#t~nondet11; 49#L565 assume !(main_~length1~0 < 1); 50#L565-2 assume !(main_~length2~0 < 1); 48#L568-1 call main_#t~malloc12.base, main_#t~malloc12.offset := #Ultimate.allocOnStack(main_~length1~0);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc12.base, main_#t~malloc12.offset;call main_#t~malloc13.base, main_#t~malloc13.offset := #Ultimate.allocOnStack(main_~length2~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc13.base, main_#t~malloc13.offset;call write~int(0, main_~nondetString1~0.base, main_~nondetString1~0.offset + (main_~length1~0 - 1), 1);call write~int(0, main_~nondetString2~0.base, main_~nondetString2~0.offset + (main_~length2~0 - 1), 1);cstrspn_#in~s1.base, cstrspn_#in~s1.offset, cstrspn_#in~s2.base, cstrspn_#in~s2.offset := main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;havoc cstrspn_#res;havoc cstrspn_#t~mem4, cstrspn_#t~post8.base, cstrspn_#t~post8.offset, cstrspn_#t~mem5, cstrspn_#t~mem6, cstrspn_#t~short7, cstrspn_#t~mem9, cstrspn_#t~post2.base, cstrspn_#t~post2.offset, cstrspn_#t~mem3, cstrspn_~s1.base, cstrspn_~s1.offset, cstrspn_~s2.base, cstrspn_~s2.offset, cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset, cstrspn_~s~0.base, cstrspn_~s~0.offset, cstrspn_~c~0;cstrspn_~s1.base, cstrspn_~s1.offset := cstrspn_#in~s1.base, cstrspn_#in~s1.offset;cstrspn_~s2.base, cstrspn_~s2.offset := cstrspn_#in~s2.base, cstrspn_#in~s2.offset;havoc cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset;havoc cstrspn_~s~0.base, cstrspn_~s~0.offset;havoc cstrspn_~c~0;cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset := cstrspn_~s1.base, cstrspn_~s1.offset; 44#L552-4 [2019-10-22 08:54:28,428 INFO L793 eck$LassoCheckResult]: Loop: 44#L552-4 call cstrspn_#t~mem3 := read~int(cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset, 1); 45#L552-1 assume !!(0 != cstrspn_#t~mem3);havoc cstrspn_#t~mem3;cstrspn_~s~0.base, cstrspn_~s~0.offset := cstrspn_~s2.base, cstrspn_~s2.offset;call cstrspn_#t~mem4 := read~int(cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset, 1);cstrspn_~c~0 := cstrspn_#t~mem4;havoc cstrspn_#t~mem4; 56#L555-5 call cstrspn_#t~mem5 := read~int(cstrspn_~s~0.base, cstrspn_~s~0.offset, 1);cstrspn_#t~short7 := 0 != cstrspn_#t~mem5; 51#L555-1 assume cstrspn_#t~short7;call cstrspn_#t~mem6 := read~int(cstrspn_~s~0.base, cstrspn_~s~0.offset, 1);cstrspn_#t~short7 := cstrspn_#t~mem6 != (if cstrspn_~c~0 % 256 <= 127 then cstrspn_~c~0 % 256 else cstrspn_~c~0 % 256 - 256); 52#L555-3 assume !cstrspn_#t~short7;havoc cstrspn_#t~mem6;havoc cstrspn_#t~mem5;havoc cstrspn_#t~short7; 55#L555-6 call cstrspn_#t~mem9 := read~int(cstrspn_~s~0.base, cstrspn_~s~0.offset, 1); 46#L557 assume !(cstrspn_#t~mem9 != cstrspn_~c~0);havoc cstrspn_#t~mem9; 47#L552-3 cstrspn_#t~post2.base, cstrspn_#t~post2.offset := cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset;cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset := cstrspn_#t~post2.base, 1 + cstrspn_#t~post2.offset;havoc cstrspn_#t~post2.base, cstrspn_#t~post2.offset; 44#L552-4 [2019-10-22 08:54:28,428 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:54:28,428 INFO L82 PathProgramCache]: Analyzing trace with hash 28695878, now seen corresponding path program 2 times [2019-10-22 08:54:28,428 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:54:28,429 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [978766069] [2019-10-22 08:54:28,429 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:54:28,429 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:54:28,429 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:54:28,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:54:28,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:54:28,485 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:54:28,486 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:54:28,486 INFO L82 PathProgramCache]: Analyzing trace with hash 1927396657, now seen corresponding path program 1 times [2019-10-22 08:54:28,486 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:54:28,486 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [702306573] [2019-10-22 08:54:28,486 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:54:28,486 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:54:28,487 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:54:28,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:54:28,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:54:28,541 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:54:28,543 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:54:28,543 INFO L82 PathProgramCache]: Analyzing trace with hash -102988426, now seen corresponding path program 1 times [2019-10-22 08:54:28,543 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:54:28,543 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1866216332] [2019-10-22 08:54:28,544 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:54:28,544 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:54:28,544 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:54:28,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:54:28,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:54:28,631 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:54:28,869 WARN L191 SmtUtils]: Spent 226.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 58 [2019-10-22 08:54:29,105 WARN L191 SmtUtils]: Spent 213.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 49 [2019-10-22 08:54:29,368 WARN L191 SmtUtils]: Spent 261.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 87 [2019-10-22 08:54:29,483 WARN L191 SmtUtils]: Spent 112.00 ms on a formula simplification that was a NOOP. DAG size: 81 [2019-10-22 08:54:29,496 INFO L210 LassoAnalysis]: Preferences: [2019-10-22 08:54:29,497 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-10-22 08:54:29,497 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-10-22 08:54:29,497 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-10-22 08:54:29,498 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-10-22 08:54:29,498 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 08:54:29,498 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-10-22 08:54:29,499 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-10-22 08:54:29,499 INFO L131 ssoRankerPreferences]: Filename of dumped script: cstrspn-alloca-2.i_Iteration2_Lasso [2019-10-22 08:54:29,500 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-10-22 08:54:29,500 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-10-22 08:54:29,530 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:54:29,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:54:29,538 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:54:29,541 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:54:29,543 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:54:29,545 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:54:29,547 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:54:29,549 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:54:29,552 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:54:29,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:54:29,564 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:54:29,566 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:54:29,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:54:29,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:54:29,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:54:29,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:54:29,588 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:54:29,885 WARN L191 SmtUtils]: Spent 181.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 67 [2019-10-22 08:54:30,033 WARN L191 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 56 [2019-10-22 08:54:30,033 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:54:30,035 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:54:30,037 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:54:30,039 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:54:30,667 WARN L191 SmtUtils]: Spent 327.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 40 [2019-10-22 08:54:30,871 WARN L191 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 29 [2019-10-22 08:54:30,885 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-10-22 08:54:30,890 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-10-22 08:54:30,892 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:54:30,899 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:54:30,900 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:54:30,901 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:54:30,901 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:54:30,901 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:54:30,902 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:54:30,903 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:54:30,905 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:54:30,910 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:54:30,911 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:54:30,911 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:54:30,911 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:54:30,911 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:54:30,913 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:54:30,913 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:54:30,915 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:54:30,915 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:54:30,921 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:54:30,921 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:54:30,921 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:54:30,921 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:54:30,921 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:54:30,921 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:54:30,922 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:54:30,922 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:54:30,923 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:54:30,923 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:54:30,923 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:54:30,923 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:54:30,923 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:54:30,923 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:54:30,924 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:54:30,924 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:54:30,924 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:54:30,925 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:54:30,925 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:54:30,925 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:54:30,926 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:54:30,926 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:54:30,926 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:54:30,926 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:54:30,926 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:54:30,927 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:54:30,928 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:54:30,928 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:54:30,928 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:54:30,928 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:54:30,928 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:54:30,929 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:54:30,929 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:54:30,929 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:54:30,930 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:54:30,930 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:54:30,931 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:54:30,931 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:54:30,931 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:54:30,931 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:54:30,931 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:54:30,932 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:54:30,932 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:54:30,933 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:54:30,933 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:54:30,933 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:54:30,934 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:54:30,934 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:54:30,934 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:54:30,935 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:54:30,935 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:54:30,939 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:54:30,939 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:54:30,940 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:54:30,940 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:54:30,940 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:54:30,940 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:54:30,940 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:54:30,941 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:54:30,941 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:54:30,942 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:54:30,942 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:54:30,942 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:54:30,942 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:54:30,943 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:54:30,943 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:54:30,945 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:54:30,945 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:54:30,947 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:54:30,948 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:54:30,948 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:54:30,948 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:54:30,948 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:54:30,949 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:54:30,949 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:54:30,949 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:54:30,949 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:54:30,950 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:54:30,950 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:54:30,951 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:54:30,951 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:54:30,951 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:54:30,951 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:54:30,955 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:54:30,956 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:54:30,956 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:54:30,957 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:54:30,957 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:54:30,958 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:54:30,958 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:54:30,958 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:54:30,958 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:54:30,958 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:54:30,959 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:54:30,959 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:54:30,961 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:54:30,962 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:54:30,963 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:54:30,964 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:54:30,964 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:54:30,964 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:54:30,965 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:54:30,965 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:54:30,971 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:54:30,972 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:54:30,973 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:54:30,973 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:54:30,973 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:54:30,973 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:54:30,974 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:54:30,974 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:54:30,974 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:54:30,975 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:54:30,976 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:54:30,978 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:54:30,979 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:54:30,980 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:54:30,980 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:54:30,980 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:54:30,980 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:54:30,980 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:54:30,981 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:54:30,981 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:54:30,982 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:54:30,982 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:54:30,982 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:54:30,982 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:54:30,989 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:54:30,991 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:54:30,993 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:54:30,994 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:54:30,994 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:54:30,994 INFO L202 nArgumentSynthesizer]: 4 stem disjuncts [2019-10-22 08:54:30,995 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:54:30,995 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:54:31,005 INFO L400 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2019-10-22 08:54:31,007 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:54:31,068 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:54:31,068 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:54:31,069 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:54:31,069 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:54:31,069 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:54:31,069 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:54:31,071 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:54:31,073 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:54:31,085 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:54:31,086 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:54:31,086 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:54:31,087 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:54:31,087 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:54:31,087 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:54:31,087 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:54:31,087 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:54:31,087 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:54:31,089 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:54:31,089 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:54:31,089 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:54:31,090 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:54:31,090 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:54:31,090 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:54:31,091 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:54:31,091 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:54:31,094 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:54:31,094 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:54:31,094 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:54:31,095 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:54:31,095 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:54:31,095 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:54:31,097 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:54:31,097 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:54:31,106 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:54:31,106 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:54:31,107 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:54:31,107 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:54:31,107 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:54:31,108 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:54:31,110 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:54:31,110 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:54:31,134 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-10-22 08:54:31,153 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-10-22 08:54:31,153 INFO L444 ModelExtractionUtils]: 23 out of 28 variables were initially zero. Simplification set additionally 2 variables to zero. [2019-10-22 08:54:31,155 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-10-22 08:54:31,156 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-10-22 08:54:31,156 INFO L510 LassoAnalysis]: Proved termination. [2019-10-22 08:54:31,157 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_cstrspn_~sc1~0.base)_1, ULTIMATE.start_cstrspn_~sc1~0.offset) = 1*v_rep(select #length ULTIMATE.start_cstrspn_~sc1~0.base)_1 - 1*ULTIMATE.start_cstrspn_~sc1~0.offset Supporting invariants [] [2019-10-22 08:54:31,184 INFO L297 tatePredicateManager]: 9 out of 9 supporting invariants were superfluous and have been removed [2019-10-22 08:54:31,191 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2019-10-22 08:54:31,208 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:54:31,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:54:31,225 INFO L256 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 2 conjunts are in the unsatisfiable core [2019-10-22 08:54:31,227 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:54:31,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:54:31,241 INFO L256 TraceCheckSpWp]: Trace formula consists of 47 conjuncts, 6 conjunts are in the unsatisfiable core [2019-10-22 08:54:31,242 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:54:31,253 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:54:31,256 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:54:31,257 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 13 states and 17 transitions. cyclomatic complexity: 5 Second operand 3 states. [2019-10-22 08:54:31,294 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 13 states and 17 transitions. cyclomatic complexity: 5. Second operand 3 states. Result 21 states and 28 transitions. Complement of second has 4 states. [2019-10-22 08:54:31,295 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:54:31,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-10-22 08:54:31,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 17 transitions. [2019-10-22 08:54:31,297 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 17 transitions. Stem has 5 letters. Loop has 8 letters. [2019-10-22 08:54:31,298 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 08:54:31,298 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 17 transitions. Stem has 13 letters. Loop has 8 letters. [2019-10-22 08:54:31,299 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 08:54:31,299 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 17 transitions. Stem has 5 letters. Loop has 16 letters. [2019-10-22 08:54:31,299 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 08:54:31,299 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 21 states and 28 transitions. [2019-10-22 08:54:31,300 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-10-22 08:54:31,300 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 21 states to 18 states and 25 transitions. [2019-10-22 08:54:31,301 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9 [2019-10-22 08:54:31,301 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2019-10-22 08:54:31,301 INFO L73 IsDeterministic]: Start isDeterministic. Operand 18 states and 25 transitions. [2019-10-22 08:54:31,301 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-10-22 08:54:31,301 INFO L688 BuchiCegarLoop]: Abstraction has 18 states and 25 transitions. [2019-10-22 08:54:31,301 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states and 25 transitions. [2019-10-22 08:54:31,302 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2019-10-22 08:54:31,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2019-10-22 08:54:31,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 25 transitions. [2019-10-22 08:54:31,303 INFO L711 BuchiCegarLoop]: Abstraction has 18 states and 25 transitions. [2019-10-22 08:54:31,303 INFO L591 BuchiCegarLoop]: Abstraction has 18 states and 25 transitions. [2019-10-22 08:54:31,303 INFO L424 BuchiCegarLoop]: ======== Iteration 3============ [2019-10-22 08:54:31,303 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states and 25 transitions. [2019-10-22 08:54:31,304 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-10-22 08:54:31,304 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 08:54:31,304 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 08:54:31,304 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2019-10-22 08:54:31,304 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-10-22 08:54:31,304 INFO L791 eck$LassoCheckResult]: Stem: 187#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 186#L-1 havoc main_#res;havoc main_#t~nondet10, main_#t~nondet11, main_#t~malloc12.base, main_#t~malloc12.offset, main_#t~malloc13.base, main_#t~malloc13.offset, main_#t~ret14, 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~nondet10;havoc main_#t~nondet10;main_~length2~0 := main_#t~nondet11;havoc main_#t~nondet11; 180#L565 assume !(main_~length1~0 < 1); 181#L565-2 assume !(main_~length2~0 < 1); 179#L568-1 call main_#t~malloc12.base, main_#t~malloc12.offset := #Ultimate.allocOnStack(main_~length1~0);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc12.base, main_#t~malloc12.offset;call main_#t~malloc13.base, main_#t~malloc13.offset := #Ultimate.allocOnStack(main_~length2~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc13.base, main_#t~malloc13.offset;call write~int(0, main_~nondetString1~0.base, main_~nondetString1~0.offset + (main_~length1~0 - 1), 1);call write~int(0, main_~nondetString2~0.base, main_~nondetString2~0.offset + (main_~length2~0 - 1), 1);cstrspn_#in~s1.base, cstrspn_#in~s1.offset, cstrspn_#in~s2.base, cstrspn_#in~s2.offset := main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;havoc cstrspn_#res;havoc cstrspn_#t~mem4, cstrspn_#t~post8.base, cstrspn_#t~post8.offset, cstrspn_#t~mem5, cstrspn_#t~mem6, cstrspn_#t~short7, cstrspn_#t~mem9, cstrspn_#t~post2.base, cstrspn_#t~post2.offset, cstrspn_#t~mem3, cstrspn_~s1.base, cstrspn_~s1.offset, cstrspn_~s2.base, cstrspn_~s2.offset, cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset, cstrspn_~s~0.base, cstrspn_~s~0.offset, cstrspn_~c~0;cstrspn_~s1.base, cstrspn_~s1.offset := cstrspn_#in~s1.base, cstrspn_#in~s1.offset;cstrspn_~s2.base, cstrspn_~s2.offset := cstrspn_#in~s2.base, cstrspn_#in~s2.offset;havoc cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset;havoc cstrspn_~s~0.base, cstrspn_~s~0.offset;havoc cstrspn_~c~0;cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset := cstrspn_~s1.base, cstrspn_~s1.offset; 173#L552-4 call cstrspn_#t~mem3 := read~int(cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset, 1); 175#L552-1 assume !!(0 != cstrspn_#t~mem3);havoc cstrspn_#t~mem3;cstrspn_~s~0.base, cstrspn_~s~0.offset := cstrspn_~s2.base, cstrspn_~s2.offset;call cstrspn_#t~mem4 := read~int(cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset, 1);cstrspn_~c~0 := cstrspn_#t~mem4;havoc cstrspn_#t~mem4; 188#L555-5 [2019-10-22 08:54:31,305 INFO L793 eck$LassoCheckResult]: Loop: 188#L555-5 call cstrspn_#t~mem5 := read~int(cstrspn_~s~0.base, cstrspn_~s~0.offset, 1);cstrspn_#t~short7 := 0 != cstrspn_#t~mem5; 182#L555-1 assume cstrspn_#t~short7;call cstrspn_#t~mem6 := read~int(cstrspn_~s~0.base, cstrspn_~s~0.offset, 1);cstrspn_#t~short7 := cstrspn_#t~mem6 != (if cstrspn_~c~0 % 256 <= 127 then cstrspn_~c~0 % 256 else cstrspn_~c~0 % 256 - 256); 183#L555-3 assume !!cstrspn_#t~short7;havoc cstrspn_#t~mem6;havoc cstrspn_#t~mem5;havoc cstrspn_#t~short7;cstrspn_#t~post8.base, cstrspn_#t~post8.offset := cstrspn_~s~0.base, cstrspn_~s~0.offset;cstrspn_~s~0.base, cstrspn_~s~0.offset := cstrspn_#t~post8.base, 1 + cstrspn_#t~post8.offset;havoc cstrspn_#t~post8.base, cstrspn_#t~post8.offset; 188#L555-5 [2019-10-22 08:54:31,305 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:54:31,305 INFO L82 PathProgramCache]: Analyzing trace with hash 1806935595, now seen corresponding path program 1 times [2019-10-22 08:54:31,305 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:54:31,305 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1877778054] [2019-10-22 08:54:31,305 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:54:31,305 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:54:31,306 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:54:31,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:54:31,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:54:31,328 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:54:31,328 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:54:31,328 INFO L82 PathProgramCache]: Analyzing trace with hash 58692, now seen corresponding path program 1 times [2019-10-22 08:54:31,328 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:54:31,328 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2002907571] [2019-10-22 08:54:31,329 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:54:31,329 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:54:31,329 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:54:31,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:54:31,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:54:31,337 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:54:31,337 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:54:31,337 INFO L82 PathProgramCache]: Analyzing trace with hash 1593218778, now seen corresponding path program 1 times [2019-10-22 08:54:31,338 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:54:31,338 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [804539770] [2019-10-22 08:54:31,338 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:54:31,338 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:54:31,338 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:54:31,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:54:31,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:54:31,364 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:54:31,766 WARN L191 SmtUtils]: Spent 261.00 ms on a formula simplification. DAG size of input: 117 DAG size of output: 100 [2019-10-22 08:54:31,868 INFO L210 LassoAnalysis]: Preferences: [2019-10-22 08:54:31,868 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-10-22 08:54:31,868 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-10-22 08:54:31,868 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-10-22 08:54:31,868 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-10-22 08:54:31,868 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 08:54:31,868 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-10-22 08:54:31,868 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-10-22 08:54:31,868 INFO L131 ssoRankerPreferences]: Filename of dumped script: cstrspn-alloca-2.i_Iteration3_Lasso [2019-10-22 08:54:31,868 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-10-22 08:54:31,868 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-10-22 08:54:31,873 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:54:31,877 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:54:31,878 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:54:31,879 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:54:31,881 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:54:31,882 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:54:31,883 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:54:31,885 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:54:31,886 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:54:31,888 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:54:31,890 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:54:31,892 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:54:31,895 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:54:31,896 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:54:31,897 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:54:31,899 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:54:32,184 WARN L191 SmtUtils]: Spent 190.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 78 [2019-10-22 08:54:32,267 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:54:32,269 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:54:32,270 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:54:32,272 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:54:32,273 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:54:32,853 WARN L191 SmtUtils]: Spent 302.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 43 [2019-10-22 08:54:32,993 WARN L191 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 36 [2019-10-22 08:54:33,059 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-10-22 08:54:33,059 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-10-22 08:54:33,060 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:54:33,060 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:54:33,060 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:54:33,061 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:54:33,061 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:54:33,061 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:54:33,061 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:54:33,061 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:54:33,062 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:54:33,062 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:54:33,062 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:54:33,063 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:54:33,063 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:54:33,063 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:54:33,063 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:54:33,063 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:54:33,063 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:54:33,064 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:54:33,064 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:54:33,064 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:54:33,064 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:54:33,065 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:54:33,065 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:54:33,065 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:54:33,065 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:54:33,065 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:54:33,066 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:54:33,066 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:54:33,066 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:54:33,067 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:54:33,067 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:54:33,067 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:54:33,067 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:54:33,068 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:54:33,069 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:54:33,069 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:54:33,070 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:54:33,070 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:54:33,070 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:54:33,070 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:54:33,070 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:54:33,070 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:54:33,071 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:54:33,071 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:54:33,071 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:54:33,072 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:54:33,072 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:54:33,072 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:54:33,072 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:54:33,072 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:54:33,072 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:54:33,072 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:54:33,073 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:54:33,073 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:54:33,074 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:54:33,074 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:54:33,074 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:54:33,074 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:54:33,075 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:54:33,075 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:54:33,077 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:54:33,077 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:54:33,077 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:54:33,078 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:54:33,078 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:54:33,078 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:54:33,078 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:54:33,078 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:54:33,078 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:54:33,079 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:54:33,079 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:54:33,080 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:54:33,080 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:54:33,080 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:54:33,080 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:54:33,081 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:54:33,081 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:54:33,082 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:54:33,082 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:54:33,083 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:54:33,083 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:54:33,083 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:54:33,084 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:54:33,084 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:54:33,084 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:54:33,084 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:54:33,085 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:54:33,085 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:54:33,085 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:54:33,085 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:54:33,086 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:54:33,086 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:54:33,086 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:54:33,086 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:54:33,086 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:54:33,087 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:54:33,087 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:54:33,087 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:54:33,088 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:54:33,088 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:54:33,088 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:54:33,088 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:54:33,088 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:54:33,088 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:54:33,089 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:54:33,089 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:54:33,090 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:54:33,090 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:54:33,090 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:54:33,090 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:54:33,090 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:54:33,090 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:54:33,090 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:54:33,091 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:54:33,091 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:54:33,092 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:54:33,092 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:54:33,092 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:54:33,092 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:54:33,092 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:54:33,093 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:54:33,093 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:54:33,093 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:54:33,093 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:54:33,094 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:54:33,094 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:54:33,094 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:54:33,094 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:54:33,094 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:54:33,094 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:54:33,094 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:54:33,095 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:54:33,095 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:54:33,096 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:54:33,096 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:54:33,096 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:54:33,096 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:54:33,097 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:54:33,097 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:54:33,098 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:54:33,098 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:54:33,099 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:54:33,099 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:54:33,099 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:54:33,099 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:54:33,100 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:54:33,101 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:54:33,105 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:54:33,105 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:54:33,106 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:54:33,106 INFO L202 nArgumentSynthesizer]: 4 stem disjuncts [2019-10-22 08:54:33,106 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:54:33,106 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:54:33,111 INFO L400 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2019-10-22 08:54:33,111 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:54:33,130 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:54:33,130 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:54:33,131 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:54:33,131 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:54:33,131 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:54:33,132 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:54:33,132 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:54:33,133 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:54:33,134 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:54:33,135 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:54:33,135 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:54:33,136 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:54:33,136 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:54:33,136 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:54:33,136 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:54:33,137 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:54:33,138 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:54:33,138 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:54:33,139 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:54:33,139 INFO L202 nArgumentSynthesizer]: 2 stem disjuncts [2019-10-22 08:54:33,139 INFO L203 nArgumentSynthesizer]: 6 loop disjuncts [2019-10-22 08:54:33,139 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:54:33,160 INFO L400 nArgumentSynthesizer]: We have 108 Motzkin's Theorem applications. [2019-10-22 08:54:33,160 INFO L401 nArgumentSynthesizer]: A total of 12 supporting invariants were added. [2019-10-22 08:54:33,273 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:54:33,274 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:54:33,274 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:54:33,274 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:54:33,274 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:54:33,274 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:54:33,275 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:54:33,275 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:54:33,277 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:54:33,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:54:33,277 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:54:33,278 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:54:33,278 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:54:33,278 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:54:33,280 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:54:33,280 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:54:33,309 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-10-22 08:54:33,331 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2019-10-22 08:54:33,331 INFO L444 ModelExtractionUtils]: 39 out of 46 variables were initially zero. Simplification set additionally 4 variables to zero. [2019-10-22 08:54:33,332 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-10-22 08:54:33,333 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-10-22 08:54:33,333 INFO L510 LassoAnalysis]: Proved termination. [2019-10-22 08:54:33,333 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_cstrspn_~s~0.base)_2, ULTIMATE.start_cstrspn_~s~0.offset) = 1*v_rep(select #length ULTIMATE.start_cstrspn_~s~0.base)_2 - 1*ULTIMATE.start_cstrspn_~s~0.offset Supporting invariants [] [2019-10-22 08:54:33,380 INFO L297 tatePredicateManager]: 15 out of 15 supporting invariants were superfluous and have been removed [2019-10-22 08:54:33,381 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2019-10-22 08:54:33,392 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:54:33,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:54:33,409 INFO L256 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 2 conjunts are in the unsatisfiable core [2019-10-22 08:54:33,410 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:54:33,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:54:33,417 INFO L256 TraceCheckSpWp]: Trace formula consists of 22 conjuncts, 6 conjunts are in the unsatisfiable core [2019-10-22 08:54:33,417 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:54:33,429 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:54:33,430 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:54:33,430 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 18 states and 25 transitions. cyclomatic complexity: 9 Second operand 3 states. [2019-10-22 08:54:33,457 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 18 states and 25 transitions. cyclomatic complexity: 9. Second operand 3 states. Result 43 states and 57 transitions. Complement of second has 5 states. [2019-10-22 08:54:33,458 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:54:33,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-10-22 08:54:33,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 18 transitions. [2019-10-22 08:54:33,459 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 18 transitions. Stem has 7 letters. Loop has 3 letters. [2019-10-22 08:54:33,459 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 08:54:33,459 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 18 transitions. Stem has 10 letters. Loop has 3 letters. [2019-10-22 08:54:33,459 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 08:54:33,459 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 18 transitions. Stem has 7 letters. Loop has 6 letters. [2019-10-22 08:54:33,459 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 08:54:33,460 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 43 states and 57 transitions. [2019-10-22 08:54:33,461 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-10-22 08:54:33,461 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 43 states to 30 states and 40 transitions. [2019-10-22 08:54:33,462 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2019-10-22 08:54:33,462 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2019-10-22 08:54:33,462 INFO L73 IsDeterministic]: Start isDeterministic. Operand 30 states and 40 transitions. [2019-10-22 08:54:33,462 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-10-22 08:54:33,462 INFO L688 BuchiCegarLoop]: Abstraction has 30 states and 40 transitions. [2019-10-22 08:54:33,462 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states and 40 transitions. [2019-10-22 08:54:33,465 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 24. [2019-10-22 08:54:33,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2019-10-22 08:54:33,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 33 transitions. [2019-10-22 08:54:33,467 INFO L711 BuchiCegarLoop]: Abstraction has 24 states and 33 transitions. [2019-10-22 08:54:33,467 INFO L591 BuchiCegarLoop]: Abstraction has 24 states and 33 transitions. [2019-10-22 08:54:33,467 INFO L424 BuchiCegarLoop]: ======== Iteration 4============ [2019-10-22 08:54:33,467 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 24 states and 33 transitions. [2019-10-22 08:54:33,468 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-10-22 08:54:33,469 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 08:54:33,469 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 08:54:33,469 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 08:54:33,469 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-10-22 08:54:33,470 INFO L791 eck$LassoCheckResult]: Stem: 360#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 359#L-1 havoc main_#res;havoc main_#t~nondet10, main_#t~nondet11, main_#t~malloc12.base, main_#t~malloc12.offset, main_#t~malloc13.base, main_#t~malloc13.offset, main_#t~ret14, 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~nondet10;havoc main_#t~nondet10;main_~length2~0 := main_#t~nondet11;havoc main_#t~nondet11; 353#L565 assume !(main_~length1~0 < 1); 354#L565-2 assume !(main_~length2~0 < 1); 352#L568-1 call main_#t~malloc12.base, main_#t~malloc12.offset := #Ultimate.allocOnStack(main_~length1~0);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc12.base, main_#t~malloc12.offset;call main_#t~malloc13.base, main_#t~malloc13.offset := #Ultimate.allocOnStack(main_~length2~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc13.base, main_#t~malloc13.offset;call write~int(0, main_~nondetString1~0.base, main_~nondetString1~0.offset + (main_~length1~0 - 1), 1);call write~int(0, main_~nondetString2~0.base, main_~nondetString2~0.offset + (main_~length2~0 - 1), 1);cstrspn_#in~s1.base, cstrspn_#in~s1.offset, cstrspn_#in~s2.base, cstrspn_#in~s2.offset := main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;havoc cstrspn_#res;havoc cstrspn_#t~mem4, cstrspn_#t~post8.base, cstrspn_#t~post8.offset, cstrspn_#t~mem5, cstrspn_#t~mem6, cstrspn_#t~short7, cstrspn_#t~mem9, cstrspn_#t~post2.base, cstrspn_#t~post2.offset, cstrspn_#t~mem3, cstrspn_~s1.base, cstrspn_~s1.offset, cstrspn_~s2.base, cstrspn_~s2.offset, cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset, cstrspn_~s~0.base, cstrspn_~s~0.offset, cstrspn_~c~0;cstrspn_~s1.base, cstrspn_~s1.offset := cstrspn_#in~s1.base, cstrspn_#in~s1.offset;cstrspn_~s2.base, cstrspn_~s2.offset := cstrspn_#in~s2.base, cstrspn_#in~s2.offset;havoc cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset;havoc cstrspn_~s~0.base, cstrspn_~s~0.offset;havoc cstrspn_~c~0;cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset := cstrspn_~s1.base, cstrspn_~s1.offset; 345#L552-4 call cstrspn_#t~mem3 := read~int(cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset, 1); 346#L552-1 assume !!(0 != cstrspn_#t~mem3);havoc cstrspn_#t~mem3;cstrspn_~s~0.base, cstrspn_~s~0.offset := cstrspn_~s2.base, cstrspn_~s2.offset;call cstrspn_#t~mem4 := read~int(cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset, 1);cstrspn_~c~0 := cstrspn_#t~mem4;havoc cstrspn_#t~mem4; 362#L555-5 call cstrspn_#t~mem5 := read~int(cstrspn_~s~0.base, cstrspn_~s~0.offset, 1);cstrspn_#t~short7 := 0 != cstrspn_#t~mem5; 367#L555-1 assume !cstrspn_#t~short7; 366#L555-3 assume !cstrspn_#t~short7;havoc cstrspn_#t~mem6;havoc cstrspn_#t~mem5;havoc cstrspn_#t~short7; 365#L555-6 call cstrspn_#t~mem9 := read~int(cstrspn_~s~0.base, cstrspn_~s~0.offset, 1); 350#L557 assume !(cstrspn_#t~mem9 != cstrspn_~c~0);havoc cstrspn_#t~mem9; 351#L552-3 cstrspn_#t~post2.base, cstrspn_#t~post2.offset := cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset;cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset := cstrspn_#t~post2.base, 1 + cstrspn_#t~post2.offset;havoc cstrspn_#t~post2.base, cstrspn_#t~post2.offset; 347#L552-4 call cstrspn_#t~mem3 := read~int(cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset, 1); 349#L552-1 assume !!(0 != cstrspn_#t~mem3);havoc cstrspn_#t~mem3;cstrspn_~s~0.base, cstrspn_~s~0.offset := cstrspn_~s2.base, cstrspn_~s2.offset;call cstrspn_#t~mem4 := read~int(cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset, 1);cstrspn_~c~0 := cstrspn_#t~mem4;havoc cstrspn_#t~mem4; 361#L555-5 [2019-10-22 08:54:33,470 INFO L793 eck$LassoCheckResult]: Loop: 361#L555-5 call cstrspn_#t~mem5 := read~int(cstrspn_~s~0.base, cstrspn_~s~0.offset, 1);cstrspn_#t~short7 := 0 != cstrspn_#t~mem5; 355#L555-1 assume cstrspn_#t~short7;call cstrspn_#t~mem6 := read~int(cstrspn_~s~0.base, cstrspn_~s~0.offset, 1);cstrspn_#t~short7 := cstrspn_#t~mem6 != (if cstrspn_~c~0 % 256 <= 127 then cstrspn_~c~0 % 256 else cstrspn_~c~0 % 256 - 256); 356#L555-3 assume !!cstrspn_#t~short7;havoc cstrspn_#t~mem6;havoc cstrspn_#t~mem5;havoc cstrspn_#t~short7;cstrspn_#t~post8.base, cstrspn_#t~post8.offset := cstrspn_~s~0.base, cstrspn_~s~0.offset;cstrspn_~s~0.base, cstrspn_~s~0.offset := cstrspn_#t~post8.base, 1 + cstrspn_#t~post8.offset;havoc cstrspn_#t~post8.base, cstrspn_#t~post8.offset; 361#L555-5 [2019-10-22 08:54:33,470 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:54:33,470 INFO L82 PathProgramCache]: Analyzing trace with hash 1587378397, now seen corresponding path program 1 times [2019-10-22 08:54:33,470 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:54:33,470 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1640955149] [2019-10-22 08:54:33,470 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:54:33,470 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:54:33,470 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:54:33,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:54:33,541 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:54:33,541 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1640955149] [2019-10-22 08:54:33,541 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:54:33,541 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-22 08:54:33,541 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [334002093] [2019-10-22 08:54:33,542 INFO L796 eck$LassoCheckResult]: stem already infeasible [2019-10-22 08:54:33,542 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:54:33,542 INFO L82 PathProgramCache]: Analyzing trace with hash 58692, now seen corresponding path program 2 times [2019-10-22 08:54:33,542 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:54:33,542 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [742493169] [2019-10-22 08:54:33,542 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:54:33,542 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:54:33,542 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:54:33,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:54:33,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:54:33,552 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:54:33,709 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:54:33,709 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-22 08:54:33,709 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-10-22 08:54:33,709 INFO L87 Difference]: Start difference. First operand 24 states and 33 transitions. cyclomatic complexity: 12 Second operand 7 states. [2019-10-22 08:54:33,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:54:33,808 INFO L93 Difference]: Finished difference Result 30 states and 39 transitions. [2019-10-22 08:54:33,809 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-22 08:54:33,809 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 30 states and 39 transitions. [2019-10-22 08:54:33,810 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2019-10-22 08:54:33,810 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 30 states to 27 states and 35 transitions. [2019-10-22 08:54:33,810 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2019-10-22 08:54:33,811 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2019-10-22 08:54:33,811 INFO L73 IsDeterministic]: Start isDeterministic. Operand 27 states and 35 transitions. [2019-10-22 08:54:33,811 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-10-22 08:54:33,811 INFO L688 BuchiCegarLoop]: Abstraction has 27 states and 35 transitions. [2019-10-22 08:54:33,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states and 35 transitions. [2019-10-22 08:54:33,812 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 25. [2019-10-22 08:54:33,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2019-10-22 08:54:33,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 33 transitions. [2019-10-22 08:54:33,813 INFO L711 BuchiCegarLoop]: Abstraction has 25 states and 33 transitions. [2019-10-22 08:54:33,813 INFO L591 BuchiCegarLoop]: Abstraction has 25 states and 33 transitions. [2019-10-22 08:54:33,813 INFO L424 BuchiCegarLoop]: ======== Iteration 5============ [2019-10-22 08:54:33,813 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 25 states and 33 transitions. [2019-10-22 08:54:33,813 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-10-22 08:54:33,814 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 08:54:33,814 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 08:54:33,814 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 08:54:33,814 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-10-22 08:54:33,814 INFO L791 eck$LassoCheckResult]: Stem: 432#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 431#L-1 havoc main_#res;havoc main_#t~nondet10, main_#t~nondet11, main_#t~malloc12.base, main_#t~malloc12.offset, main_#t~malloc13.base, main_#t~malloc13.offset, main_#t~ret14, 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~nondet10;havoc main_#t~nondet10;main_~length2~0 := main_#t~nondet11;havoc main_#t~nondet11; 425#L565 assume !(main_~length1~0 < 1); 426#L565-2 assume !(main_~length2~0 < 1); 424#L568-1 call main_#t~malloc12.base, main_#t~malloc12.offset := #Ultimate.allocOnStack(main_~length1~0);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc12.base, main_#t~malloc12.offset;call main_#t~malloc13.base, main_#t~malloc13.offset := #Ultimate.allocOnStack(main_~length2~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc13.base, main_#t~malloc13.offset;call write~int(0, main_~nondetString1~0.base, main_~nondetString1~0.offset + (main_~length1~0 - 1), 1);call write~int(0, main_~nondetString2~0.base, main_~nondetString2~0.offset + (main_~length2~0 - 1), 1);cstrspn_#in~s1.base, cstrspn_#in~s1.offset, cstrspn_#in~s2.base, cstrspn_#in~s2.offset := main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;havoc cstrspn_#res;havoc cstrspn_#t~mem4, cstrspn_#t~post8.base, cstrspn_#t~post8.offset, cstrspn_#t~mem5, cstrspn_#t~mem6, cstrspn_#t~short7, cstrspn_#t~mem9, cstrspn_#t~post2.base, cstrspn_#t~post2.offset, cstrspn_#t~mem3, cstrspn_~s1.base, cstrspn_~s1.offset, cstrspn_~s2.base, cstrspn_~s2.offset, cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset, cstrspn_~s~0.base, cstrspn_~s~0.offset, cstrspn_~c~0;cstrspn_~s1.base, cstrspn_~s1.offset := cstrspn_#in~s1.base, cstrspn_#in~s1.offset;cstrspn_~s2.base, cstrspn_~s2.offset := cstrspn_#in~s2.base, cstrspn_#in~s2.offset;havoc cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset;havoc cstrspn_~s~0.base, cstrspn_~s~0.offset;havoc cstrspn_~c~0;cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset := cstrspn_~s1.base, cstrspn_~s1.offset; 417#L552-4 call cstrspn_#t~mem3 := read~int(cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset, 1); 418#L552-1 assume !!(0 != cstrspn_#t~mem3);havoc cstrspn_#t~mem3;cstrspn_~s~0.base, cstrspn_~s~0.offset := cstrspn_~s2.base, cstrspn_~s2.offset;call cstrspn_#t~mem4 := read~int(cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset, 1);cstrspn_~c~0 := cstrspn_#t~mem4;havoc cstrspn_#t~mem4; 434#L555-5 call cstrspn_#t~mem5 := read~int(cstrspn_~s~0.base, cstrspn_~s~0.offset, 1);cstrspn_#t~short7 := 0 != cstrspn_#t~mem5; 435#L555-1 assume cstrspn_#t~short7;call cstrspn_#t~mem6 := read~int(cstrspn_~s~0.base, cstrspn_~s~0.offset, 1);cstrspn_#t~short7 := cstrspn_#t~mem6 != (if cstrspn_~c~0 % 256 <= 127 then cstrspn_~c~0 % 256 else cstrspn_~c~0 % 256 - 256); 437#L555-3 assume !cstrspn_#t~short7;havoc cstrspn_#t~mem6;havoc cstrspn_#t~mem5;havoc cstrspn_#t~short7; 436#L555-6 call cstrspn_#t~mem9 := read~int(cstrspn_~s~0.base, cstrspn_~s~0.offset, 1); 422#L557 assume !(cstrspn_#t~mem9 != cstrspn_~c~0);havoc cstrspn_#t~mem9; 423#L552-3 cstrspn_#t~post2.base, cstrspn_#t~post2.offset := cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset;cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset := cstrspn_#t~post2.base, 1 + cstrspn_#t~post2.offset;havoc cstrspn_#t~post2.base, cstrspn_#t~post2.offset; 419#L552-4 call cstrspn_#t~mem3 := read~int(cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset, 1); 421#L552-1 assume !!(0 != cstrspn_#t~mem3);havoc cstrspn_#t~mem3;cstrspn_~s~0.base, cstrspn_~s~0.offset := cstrspn_~s2.base, cstrspn_~s2.offset;call cstrspn_#t~mem4 := read~int(cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset, 1);cstrspn_~c~0 := cstrspn_#t~mem4;havoc cstrspn_#t~mem4; 433#L555-5 [2019-10-22 08:54:33,814 INFO L793 eck$LassoCheckResult]: Loop: 433#L555-5 call cstrspn_#t~mem5 := read~int(cstrspn_~s~0.base, cstrspn_~s~0.offset, 1);cstrspn_#t~short7 := 0 != cstrspn_#t~mem5; 427#L555-1 assume cstrspn_#t~short7;call cstrspn_#t~mem6 := read~int(cstrspn_~s~0.base, cstrspn_~s~0.offset, 1);cstrspn_#t~short7 := cstrspn_#t~mem6 != (if cstrspn_~c~0 % 256 <= 127 then cstrspn_~c~0 % 256 else cstrspn_~c~0 % 256 - 256); 428#L555-3 assume !!cstrspn_#t~short7;havoc cstrspn_#t~mem6;havoc cstrspn_#t~mem5;havoc cstrspn_#t~short7;cstrspn_#t~post8.base, cstrspn_#t~post8.offset := cstrspn_~s~0.base, cstrspn_~s~0.offset;cstrspn_~s~0.base, cstrspn_~s~0.offset := cstrspn_#t~post8.base, 1 + cstrspn_#t~post8.offset;havoc cstrspn_#t~post8.base, cstrspn_#t~post8.offset; 433#L555-5 [2019-10-22 08:54:33,814 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:54:33,814 INFO L82 PathProgramCache]: Analyzing trace with hash -187628965, now seen corresponding path program 2 times [2019-10-22 08:54:33,814 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:54:33,815 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1447925860] [2019-10-22 08:54:33,815 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:54:33,815 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:54:33,815 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:54:33,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:54:33,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:54:33,843 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:54:33,847 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:54:33,847 INFO L82 PathProgramCache]: Analyzing trace with hash 58692, now seen corresponding path program 3 times [2019-10-22 08:54:33,847 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:54:33,847 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1672171479] [2019-10-22 08:54:33,847 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:54:33,848 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:54:33,848 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:54:33,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:54:33,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:54:33,854 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:54:33,854 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:54:33,854 INFO L82 PathProgramCache]: Analyzing trace with hash -1902015318, now seen corresponding path program 1 times [2019-10-22 08:54:33,855 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:54:33,855 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [993989673] [2019-10-22 08:54:33,855 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:54:33,855 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:54:33,855 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:54:33,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:54:33,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:54:33,886 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:54:34,696 WARN L191 SmtUtils]: Spent 651.00 ms on a formula simplification. DAG size of input: 175 DAG size of output: 138 [2019-10-22 08:54:35,459 WARN L191 SmtUtils]: Spent 751.00 ms on a formula simplification. DAG size of input: 110 DAG size of output: 110 [2019-10-22 08:54:35,460 INFO L210 LassoAnalysis]: Preferences: [2019-10-22 08:54:35,461 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-10-22 08:54:35,461 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-10-22 08:54:35,461 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-10-22 08:54:35,461 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-10-22 08:54:35,461 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 08:54:35,461 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-10-22 08:54:35,461 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-10-22 08:54:35,461 INFO L131 ssoRankerPreferences]: Filename of dumped script: cstrspn-alloca-2.i_Iteration5_Lasso [2019-10-22 08:54:35,461 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-10-22 08:54:35,461 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-10-22 08:54:35,467 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:54:35,469 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:54:35,473 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:54:35,474 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:54:35,475 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:54:35,477 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:54:35,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:54:35,492 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:54:35,494 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:54:35,496 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:54:35,498 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:54:35,499 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:54:35,665 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2019-10-22 08:54:36,239 WARN L191 SmtUtils]: Spent 570.00 ms on a formula simplification. DAG size of input: 111 DAG size of output: 99 [2019-10-22 08:54:36,338 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:54:36,340 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:54:36,351 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:54:36,352 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:54:36,353 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:54:36,354 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:54:36,359 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:54:36,361 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:54:36,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:54:36,862 WARN L191 SmtUtils]: Spent 210.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 39 [2019-10-22 08:54:36,980 WARN L191 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 36 [2019-10-22 08:54:37,238 WARN L191 SmtUtils]: Spent 257.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 43 [2019-10-22 08:54:37,363 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-10-22 08:54:37,363 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-10-22 08:54:37,363 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:54:37,364 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:54:37,364 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:54:37,364 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:54:37,364 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:54:37,365 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:54:37,365 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:54:37,365 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:54:37,366 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:54:37,366 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:54:37,366 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:54:37,366 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:54:37,367 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:54:37,367 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:54:37,367 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:54:37,368 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:54:37,369 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:54:37,369 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:54:37,370 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:54:37,370 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:54:37,370 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:54:37,370 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:54:37,370 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:54:37,370 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:54:37,370 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:54:37,371 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:54:37,371 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:54:37,372 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:54:37,372 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:54:37,372 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:54:37,372 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:54:37,372 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:54:37,372 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:54:37,373 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:54:37,373 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:54:37,373 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:54:37,374 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:54:37,374 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:54:37,374 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:54:37,374 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:54:37,374 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:54:37,374 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:54:37,374 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:54:37,375 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:54:37,375 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:54:37,375 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:54:37,376 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:54:37,376 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:54:37,376 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:54:37,376 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:54:37,377 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:54:37,377 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:54:37,377 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:54:37,377 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:54:37,378 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:54:37,378 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:54:37,378 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:54:37,378 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:54:37,378 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:54:37,379 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:54:37,380 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:54:37,381 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:54:37,381 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:54:37,381 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:54:37,381 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:54:37,381 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:54:37,381 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:54:37,382 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:54:37,382 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:54:37,382 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:54:37,382 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:54:37,383 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:54:37,383 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:54:37,383 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:54:37,383 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:54:37,384 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:54:37,384 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:54:37,385 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:54:37,385 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:54:37,386 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:54:37,386 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:54:37,386 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:54:37,386 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:54:37,386 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:54:37,386 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:54:37,386 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:54:37,387 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:54:37,387 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:54:37,388 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:54:37,388 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:54:37,388 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:54:37,388 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:54:37,388 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:54:37,389 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:54:37,389 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:54:37,389 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:54:37,389 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:54:37,390 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:54:37,390 INFO L202 nArgumentSynthesizer]: 4 stem disjuncts [2019-10-22 08:54:37,390 INFO L203 nArgumentSynthesizer]: 6 loop disjuncts [2019-10-22 08:54:37,390 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:54:37,414 INFO L400 nArgumentSynthesizer]: We have 132 Motzkin's Theorem applications. [2019-10-22 08:54:37,414 INFO L401 nArgumentSynthesizer]: A total of 12 supporting invariants were added. [2019-10-22 08:54:37,637 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:54:37,638 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:54:37,638 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:54:37,638 INFO L202 nArgumentSynthesizer]: 4 stem disjuncts [2019-10-22 08:54:37,638 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:54:37,638 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:54:37,642 INFO L400 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2019-10-22 08:54:37,642 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:54:37,659 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:54:37,659 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:54:37,660 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:54:37,660 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:54:37,660 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:54:37,660 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:54:37,663 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:54:37,663 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:54:37,701 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-10-22 08:54:37,723 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2019-10-22 08:54:37,723 INFO L444 ModelExtractionUtils]: 48 out of 52 variables were initially zero. Simplification set additionally 1 variables to zero. [2019-10-22 08:54:37,723 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-10-22 08:54:37,724 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-10-22 08:54:37,724 INFO L510 LassoAnalysis]: Proved termination. [2019-10-22 08:54:37,724 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_cstrspn_~s~0.base)_3, ULTIMATE.start_cstrspn_~s~0.offset) = 1*v_rep(select #length ULTIMATE.start_cstrspn_~s~0.base)_3 - 1*ULTIMATE.start_cstrspn_~s~0.offset Supporting invariants [] [2019-10-22 08:54:37,832 INFO L297 tatePredicateManager]: 28 out of 28 supporting invariants were superfluous and have been removed [2019-10-22 08:54:37,833 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2019-10-22 08:54:37,845 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:54:37,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:54:37,862 INFO L256 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 2 conjunts are in the unsatisfiable core [2019-10-22 08:54:37,863 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:54:37,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:54:37,869 INFO L256 TraceCheckSpWp]: Trace formula consists of 22 conjuncts, 6 conjunts are in the unsatisfiable core [2019-10-22 08:54:37,870 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:54:37,879 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:54:37,880 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:54:37,880 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 25 states and 33 transitions. cyclomatic complexity: 11 Second operand 3 states. [2019-10-22 08:54:37,899 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 25 states and 33 transitions. cyclomatic complexity: 11. Second operand 3 states. Result 41 states and 51 transitions. Complement of second has 5 states. [2019-10-22 08:54:37,899 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:54:37,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-10-22 08:54:37,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 18 transitions. [2019-10-22 08:54:37,900 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 18 transitions. Stem has 15 letters. Loop has 3 letters. [2019-10-22 08:54:37,900 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 08:54:37,900 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-10-22 08:54:37,911 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:54:37,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:54:37,929 INFO L256 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 2 conjunts are in the unsatisfiable core [2019-10-22 08:54:37,930 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:54:37,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:54:37,937 INFO L256 TraceCheckSpWp]: Trace formula consists of 22 conjuncts, 6 conjunts are in the unsatisfiable core [2019-10-22 08:54:37,937 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:54:37,946 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:54:37,947 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:54:37,947 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 25 states and 33 transitions. cyclomatic complexity: 11 Second operand 3 states. [2019-10-22 08:54:37,962 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 25 states and 33 transitions. cyclomatic complexity: 11. Second operand 3 states. Result 41 states and 51 transitions. Complement of second has 5 states. [2019-10-22 08:54:37,963 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:54:37,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-10-22 08:54:37,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 18 transitions. [2019-10-22 08:54:37,963 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 18 transitions. Stem has 15 letters. Loop has 3 letters. [2019-10-22 08:54:37,964 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 08:54:37,964 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-10-22 08:54:37,976 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:54:37,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:54:37,995 INFO L256 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 2 conjunts are in the unsatisfiable core [2019-10-22 08:54:37,996 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:54:38,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:54:38,002 INFO L256 TraceCheckSpWp]: Trace formula consists of 22 conjuncts, 6 conjunts are in the unsatisfiable core [2019-10-22 08:54:38,003 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:54:38,013 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:54:38,013 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:54:38,013 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 25 states and 33 transitions. cyclomatic complexity: 11 Second operand 3 states. [2019-10-22 08:54:38,033 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 25 states and 33 transitions. cyclomatic complexity: 11. Second operand 3 states. Result 41 states and 53 transitions. Complement of second has 4 states. [2019-10-22 08:54:38,033 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:54:38,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-10-22 08:54:38,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 27 transitions. [2019-10-22 08:54:38,034 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 27 transitions. Stem has 15 letters. Loop has 3 letters. [2019-10-22 08:54:38,034 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 08:54:38,034 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 27 transitions. Stem has 18 letters. Loop has 3 letters. [2019-10-22 08:54:38,035 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 08:54:38,035 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 27 transitions. Stem has 15 letters. Loop has 6 letters. [2019-10-22 08:54:38,035 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 08:54:38,035 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 41 states and 53 transitions. [2019-10-22 08:54:38,037 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-10-22 08:54:38,038 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 41 states to 0 states and 0 transitions. [2019-10-22 08:54:38,038 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2019-10-22 08:54:38,038 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2019-10-22 08:54:38,038 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2019-10-22 08:54:38,038 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-10-22 08:54:38,038 INFO L688 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-10-22 08:54:38,038 INFO L711 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-10-22 08:54:38,038 INFO L591 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-10-22 08:54:38,038 INFO L424 BuchiCegarLoop]: ======== Iteration 6============ [2019-10-22 08:54:38,038 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2019-10-22 08:54:38,039 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-10-22 08:54:38,039 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2019-10-22 08:54:38,044 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 22.10 08:54:38 BoogieIcfgContainer [2019-10-22 08:54:38,044 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2019-10-22 08:54:38,045 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-10-22 08:54:38,045 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-10-22 08:54:38,045 INFO L275 PluginConnector]: Witness Printer initialized [2019-10-22 08:54:38,046 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 08:54:28" (3/4) ... [2019-10-22 08:54:38,049 INFO L140 WitnessPrinter]: No result that supports witness generation found [2019-10-22 08:54:38,049 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-10-22 08:54:38,050 INFO L168 Benchmark]: Toolchain (without parser) took 10992.39 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 397.9 MB). Free memory was 940.5 MB in the beginning and 940.3 MB in the end (delta: 223.2 kB). Peak memory consumption was 398.2 MB. Max. memory is 11.5 GB. [2019-10-22 08:54:38,051 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 1.0 GB. Free memory is still 967.3 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-10-22 08:54:38,051 INFO L168 Benchmark]: CACSL2BoogieTranslator took 487.11 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 156.2 MB). Free memory was 940.5 MB in the beginning and 1.1 GB in the end (delta: -193.2 MB). Peak memory consumption was 18.0 MB. Max. memory is 11.5 GB. [2019-10-22 08:54:38,052 INFO L168 Benchmark]: Boogie Procedure Inliner took 51.76 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:54:38,052 INFO L168 Benchmark]: Boogie Preprocessor took 45.39 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:54:38,052 INFO L168 Benchmark]: RCFGBuilder took 388.66 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: 26.8 MB). Peak memory consumption was 26.8 MB. Max. memory is 11.5 GB. [2019-10-22 08:54:38,053 INFO L168 Benchmark]: BuchiAutomizer took 10011.46 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 241.7 MB). Free memory was 1.1 GB in the beginning and 940.3 MB in the end (delta: 166.6 MB). Peak memory consumption was 408.3 MB. Max. memory is 11.5 GB. [2019-10-22 08:54:38,053 INFO L168 Benchmark]: Witness Printer took 4.22 ms. Allocated memory is still 1.4 GB. Free memory is still 940.3 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-10-22 08:54:38,055 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.16 ms. Allocated memory is still 1.0 GB. Free memory is still 967.3 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 487.11 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 156.2 MB). Free memory was 940.5 MB in the beginning and 1.1 GB in the end (delta: -193.2 MB). Peak memory consumption was 18.0 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 51.76 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 45.39 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 388.66 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: 26.8 MB). Peak memory consumption was 26.8 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 10011.46 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 241.7 MB). Free memory was 1.1 GB in the beginning and 940.3 MB in the end (delta: 166.6 MB). Peak memory consumption was 408.3 MB. Max. memory is 11.5 GB. * Witness Printer took 4.22 ms. Allocated memory is still 1.4 GB. Free memory is still 940.3 MB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 5 terminating modules (2 trivial, 2 deterministic, 1 nondeterministic). One deterministic module has affine ranking function unknown-#length-unknown[sc1] + -1 * sc1 and consists of 3 locations. One deterministic module has affine ranking function unknown-#length-unknown[s] + -1 * s and consists of 3 locations. One nondeterministic module has affine ranking function unknown-#length-unknown[s] + -1 * s and consists of 3 locations. 2 modules have a trivial ranking function, the largest among these consists of 7 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 9.9s and 6 iterations. TraceHistogramMax:2. Analysis of lassos took 9.3s. Construction of modules took 0.1s. Büchi inclusion checks took 0.4s. Highest rank in rank-based complementation 3. Minimization of det autom 2. Minimization of nondet autom 3. Automata minimization 0.0s AutomataMinimizationTime, 4 MinimizatonAttempts, 8 StatesRemovedByMinimization, 2 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 25 states and ocurred in iteration 4. Nontrivial modules had stage [2, 0, 1, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 109 SDtfs, 120 SDslu, 52 SDs, 0 SdLazy, 95 SolverSat, 11 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.1s Time LassoAnalysisResults: nont0 unkn0 SFLI1 SFLT0 conc0 concLT0 SILN0 SILU1 SILI0 SILT0 lasso3 LassoPreprocessingBenchmarks: Lassos: inital375 mio100 ax105 hnf99 lsp87 ukn72 mio100 lsp31 div127 bol100 ite100 ukn100 eq168 hnf81 smp92 dnf666 smp43 tf100 neg96 sie110 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 247ms VariablesStem: 7 VariablesLoop: 4 DisjunctsStem: 4 DisjunctsLoop: 6 SupportingInvariants: 12 MotzkinApplications: 132 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...