./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/termination-15/cstrcspn_reverse_alloca.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version cad46833 Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_79cf2810-2f9f-4d2c-9304-d9d1e804cf6b/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_79cf2810-2f9f-4d2c-9304-d9d1e804cf6b/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_79cf2810-2f9f-4d2c-9304-d9d1e804cf6b/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_79cf2810-2f9f-4d2c-9304-d9d1e804cf6b/bin/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/termination-15/cstrcspn_reverse_alloca.i -s /tmp/vcloud-vcloud-master/worker/run_dir_79cf2810-2f9f-4d2c-9304-d9d1e804cf6b/bin/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_79cf2810-2f9f-4d2c-9304-d9d1e804cf6b/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 6e6bf2d6e706b2fafcc380eb0a4d60b5a7a1666b ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-cad4683 [2019-11-15 22:41:40,679 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-15 22:41:40,680 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-15 22:41:40,690 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-15 22:41:40,691 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-15 22:41:40,692 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-15 22:41:40,693 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-15 22:41:40,695 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-15 22:41:40,697 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-15 22:41:40,698 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-15 22:41:40,698 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-15 22:41:40,700 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-15 22:41:40,700 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-15 22:41:40,701 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-15 22:41:40,702 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-15 22:41:40,703 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-15 22:41:40,703 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-15 22:41:40,704 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-15 22:41:40,706 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-15 22:41:40,708 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-15 22:41:40,709 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-15 22:41:40,710 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-15 22:41:40,711 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-15 22:41:40,712 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-15 22:41:40,714 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-15 22:41:40,714 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-15 22:41:40,715 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-15 22:41:40,715 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-15 22:41:40,716 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-15 22:41:40,717 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-15 22:41:40,717 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-15 22:41:40,718 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-15 22:41:40,718 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-15 22:41:40,719 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-15 22:41:40,720 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-15 22:41:40,720 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-15 22:41:40,721 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-15 22:41:40,721 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-15 22:41:40,722 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-15 22:41:40,723 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-15 22:41:40,723 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-15 22:41:40,724 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_79cf2810-2f9f-4d2c-9304-d9d1e804cf6b/bin/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf [2019-11-15 22:41:40,738 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-15 22:41:40,739 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-15 22:41:40,740 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-15 22:41:40,740 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-15 22:41:40,740 INFO L138 SettingsManager]: * Use SBE=true [2019-11-15 22:41:40,741 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-11-15 22:41:40,741 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-11-15 22:41:40,741 INFO L138 SettingsManager]: * Use old map elimination=false [2019-11-15 22:41:40,741 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2019-11-15 22:41:40,742 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2019-11-15 22:41:40,742 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-11-15 22:41:40,742 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-15 22:41:40,742 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-11-15 22:41:40,743 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-15 22:41:40,743 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-15 22:41:40,743 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-11-15 22:41:40,743 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-11-15 22:41:40,744 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-11-15 22:41:40,744 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-15 22:41:40,744 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-11-15 22:41:40,744 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-15 22:41:40,745 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-11-15 22:41:40,745 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-15 22:41:40,745 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-15 22:41:40,745 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-11-15 22:41:40,746 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-15 22:41:40,746 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-15 22:41:40,746 INFO L138 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-11-15 22:41:40,747 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-11-15 22:41:40,747 INFO L138 SettingsManager]: * TransformationType=MODULO_NEIGHBOR Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud-vcloud-master/worker/run_dir_79cf2810-2f9f-4d2c-9304-d9d1e804cf6b/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 -> 6e6bf2d6e706b2fafcc380eb0a4d60b5a7a1666b [2019-11-15 22:41:40,772 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-15 22:41:40,782 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-15 22:41:40,785 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-15 22:41:40,786 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-15 22:41:40,786 INFO L275 PluginConnector]: CDTParser initialized [2019-11-15 22:41:40,787 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_79cf2810-2f9f-4d2c-9304-d9d1e804cf6b/bin/uautomizer/../../sv-benchmarks/c/termination-15/cstrcspn_reverse_alloca.i [2019-11-15 22:41:40,839 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_79cf2810-2f9f-4d2c-9304-d9d1e804cf6b/bin/uautomizer/data/ff867f596/0c5118794d504e9f814f699baa595f26/FLAG9eba81cb8 [2019-11-15 22:41:41,334 INFO L306 CDTParser]: Found 1 translation units. [2019-11-15 22:41:41,335 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_79cf2810-2f9f-4d2c-9304-d9d1e804cf6b/sv-benchmarks/c/termination-15/cstrcspn_reverse_alloca.i [2019-11-15 22:41:41,344 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_79cf2810-2f9f-4d2c-9304-d9d1e804cf6b/bin/uautomizer/data/ff867f596/0c5118794d504e9f814f699baa595f26/FLAG9eba81cb8 [2019-11-15 22:41:41,627 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_79cf2810-2f9f-4d2c-9304-d9d1e804cf6b/bin/uautomizer/data/ff867f596/0c5118794d504e9f814f699baa595f26 [2019-11-15 22:41:41,629 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-15 22:41:41,630 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-15 22:41:41,631 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-15 22:41:41,631 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-15 22:41:41,634 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-15 22:41:41,635 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 10:41:41" (1/1) ... [2019-11-15 22:41:41,637 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4e3fe8b7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:41:41, skipping insertion in model container [2019-11-15 22:41:41,637 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 10:41:41" (1/1) ... [2019-11-15 22:41:41,642 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-15 22:41:41,673 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-15 22:41:42,008 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-15 22:41:42,017 INFO L188 MainTranslator]: Completed pre-run [2019-11-15 22:41:42,066 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-15 22:41:42,126 INFO L192 MainTranslator]: Completed translation [2019-11-15 22:41:42,127 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:41:42 WrapperNode [2019-11-15 22:41:42,127 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-15 22:41:42,128 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-15 22:41:42,128 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-15 22:41:42,128 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-15 22:41:42,135 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:41:42" (1/1) ... [2019-11-15 22:41:42,148 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:41:42" (1/1) ... [2019-11-15 22:41:42,171 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-15 22:41:42,172 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-15 22:41:42,172 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-15 22:41:42,172 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-15 22:41:42,181 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:41:42" (1/1) ... [2019-11-15 22:41:42,182 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:41:42" (1/1) ... [2019-11-15 22:41:42,184 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:41:42" (1/1) ... [2019-11-15 22:41:42,184 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:41:42" (1/1) ... [2019-11-15 22:41:42,192 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:41:42" (1/1) ... [2019-11-15 22:41:42,196 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:41:42" (1/1) ... [2019-11-15 22:41:42,197 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:41:42" (1/1) ... [2019-11-15 22:41:42,200 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-15 22:41:42,200 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-15 22:41:42,201 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-15 22:41:42,201 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-15 22:41:42,202 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:41:42" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_79cf2810-2f9f-4d2c-9304-d9d1e804cf6b/bin/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 22:41:42,258 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-11-15 22:41:42,258 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-11-15 22:41:42,258 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-15 22:41:42,259 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-15 22:41:42,259 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-15 22:41:42,259 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-15 22:41:42,618 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-15 22:41:42,618 INFO L284 CfgBuilder]: Removed 8 assume(true) statements. [2019-11-15 22:41:42,619 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 10:41:42 BoogieIcfgContainer [2019-11-15 22:41:42,620 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-15 22:41:42,620 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-11-15 22:41:42,620 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-11-15 22:41:42,623 INFO L275 PluginConnector]: BuchiAutomizer initialized [2019-11-15 22:41:42,624 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-15 22:41:42,624 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 15.11 10:41:41" (1/3) ... [2019-11-15 22:41:42,625 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@7460f3f6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 15.11 10:41:42, skipping insertion in model container [2019-11-15 22:41:42,626 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-15 22:41:42,626 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:41:42" (2/3) ... [2019-11-15 22:41:42,626 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@7460f3f6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 15.11 10:41:42, skipping insertion in model container [2019-11-15 22:41:42,626 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-15 22:41:42,626 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 10:41:42" (3/3) ... [2019-11-15 22:41:42,628 INFO L371 chiAutomizerObserver]: Analyzing ICFG cstrcspn_reverse_alloca.i [2019-11-15 22:41:42,673 INFO L356 BuchiCegarLoop]: Interprodecural is true [2019-11-15 22:41:42,673 INFO L357 BuchiCegarLoop]: Hoare is false [2019-11-15 22:41:42,673 INFO L358 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-11-15 22:41:42,673 INFO L359 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-15 22:41:42,673 INFO L360 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-15 22:41:42,674 INFO L361 BuchiCegarLoop]: Difference is false [2019-11-15 22:41:42,674 INFO L362 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-15 22:41:42,674 INFO L365 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-11-15 22:41:42,687 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states. [2019-11-15 22:41:42,707 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2019-11-15 22:41:42,707 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 22:41:42,707 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 22:41:42,713 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2019-11-15 22:41:42,714 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2019-11-15 22:41:42,714 INFO L424 BuchiCegarLoop]: ======== Iteration 1============ [2019-11-15 22:41:42,714 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states. [2019-11-15 22:41:42,716 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2019-11-15 22:41:42,716 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 22:41:42,716 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 22:41:42,717 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2019-11-15 22:41:42,717 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2019-11-15 22:41:42,724 INFO L791 eck$LassoCheckResult]: Stem: 13#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 11#L-1true havoc main_#res;havoc main_#t~nondet213, main_#t~nondet214, main_#t~malloc215.base, main_#t~malloc215.offset, main_#t~malloc216.base, main_#t~malloc216.offset, main_#t~ret217, 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~nondet213;havoc main_#t~nondet213;main_~length2~0 := main_#t~nondet214;havoc main_#t~nondet214; 12#L382true assume !(main_~length1~0 < 1); 15#L382-2true assume !(main_~length2~0 < 1); 9#L385-1true call main_#t~malloc215.base, main_#t~malloc215.offset := #Ultimate.allocOnStack(main_~length1~0);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc215.base, main_#t~malloc215.offset;call main_#t~malloc216.base, main_#t~malloc216.offset := #Ultimate.allocOnStack(main_~length2~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc216.base, main_#t~malloc216.offset;call write~int(0, main_~nondetString1~0.base, main_~nondetString1~0.offset, 1);call write~int(0, main_~nondetString2~0.base, main_~nondetString2~0.offset, 1);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_~nondetString1~0.base, main_~nondetString1~0.offset + (main_~length1~0 - 1);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_~nondetString2~0.base, main_~nondetString2~0.offset + (main_~length2~0 - 1);cstrcspn_#in~s1.base, cstrcspn_#in~s1.offset, cstrcspn_#in~s2.base, cstrcspn_#in~s2.offset := main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;havoc cstrcspn_#res;havoc cstrcspn_#t~mem207, cstrcspn_#t~post211.base, cstrcspn_#t~post211.offset, cstrcspn_#t~mem208, cstrcspn_#t~mem209, cstrcspn_#t~short210, cstrcspn_#t~mem212, cstrcspn_#t~post205.base, cstrcspn_#t~post205.offset, cstrcspn_#t~mem206, cstrcspn_~s1.base, cstrcspn_~s1.offset, cstrcspn_~s2.base, cstrcspn_~s2.offset, cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset, cstrcspn_~s~0.base, cstrcspn_~s~0.offset, cstrcspn_~c~0;cstrcspn_~s1.base, cstrcspn_~s1.offset := cstrcspn_#in~s1.base, cstrcspn_#in~s1.offset;cstrcspn_~s2.base, cstrcspn_~s2.offset := cstrcspn_#in~s2.base, cstrcspn_#in~s2.offset;havoc cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset;havoc cstrcspn_~s~0.base, cstrcspn_~s~0.offset;havoc cstrcspn_~c~0;cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset := cstrcspn_~s1.base, cstrcspn_~s1.offset; 6#L369-4true [2019-11-15 22:41:42,725 INFO L793 eck$LassoCheckResult]: Loop: 6#L369-4true call cstrcspn_#t~mem206 := read~int(cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset, 1); 18#L369-1true assume !!(0 != cstrcspn_#t~mem206);havoc cstrcspn_#t~mem206;cstrcspn_~s~0.base, cstrcspn_~s~0.offset := cstrcspn_~s2.base, cstrcspn_~s2.offset;call cstrcspn_#t~mem207 := read~int(cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset, 1);cstrcspn_~c~0 := cstrcspn_#t~mem207;havoc cstrcspn_#t~mem207; 20#L372-5true assume !true; 4#L372-6true call cstrcspn_#t~mem212 := read~int(cstrcspn_~s~0.base, cstrcspn_~s~0.offset, 1); 8#L374true assume !(cstrcspn_#t~mem212 == cstrcspn_~c~0);havoc cstrcspn_#t~mem212; 5#L369-3true cstrcspn_#t~post205.base, cstrcspn_#t~post205.offset := cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset;cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset := cstrcspn_#t~post205.base, cstrcspn_#t~post205.offset - 1;havoc cstrcspn_#t~post205.base, cstrcspn_#t~post205.offset; 6#L369-4true [2019-11-15 22:41:42,729 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:41:42,730 INFO L82 PathProgramCache]: Analyzing trace with hash 28695878, now seen corresponding path program 1 times [2019-11-15 22:41:42,735 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:41:42,736 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2004594638] [2019-11-15 22:41:42,736 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:41:42,736 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:41:42,736 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:41:42,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:41:42,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:41:42,877 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 22:41:42,878 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:41:42,878 INFO L82 PathProgramCache]: Analyzing trace with hash 1454917130, now seen corresponding path program 1 times [2019-11-15 22:41:42,879 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:41:42,879 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1243155208] [2019-11-15 22:41:42,879 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:41:42,879 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:41:42,879 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:41:42,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:41:42,908 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:41:42,909 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1243155208] [2019-11-15 22:41:42,909 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:41:42,910 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-15 22:41:42,910 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1102833886] [2019-11-15 22:41:42,913 INFO L808 eck$LassoCheckResult]: loop already infeasible [2019-11-15 22:41:42,914 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:41:42,927 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-11-15 22:41:42,927 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-11-15 22:41:42,929 INFO L87 Difference]: Start difference. First operand 18 states. Second operand 2 states. [2019-11-15 22:41:42,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:41:42,934 INFO L93 Difference]: Finished difference Result 18 states and 23 transitions. [2019-11-15 22:41:42,934 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-11-15 22:41:42,936 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 18 states and 23 transitions. [2019-11-15 22:41:42,937 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2019-11-15 22:41:42,940 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 18 states to 13 states and 17 transitions. [2019-11-15 22:41:42,941 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 13 [2019-11-15 22:41:42,941 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 13 [2019-11-15 22:41:42,942 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 17 transitions. [2019-11-15 22:41:42,942 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-15 22:41:42,942 INFO L688 BuchiCegarLoop]: Abstraction has 13 states and 17 transitions. [2019-11-15 22:41:42,954 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states and 17 transitions. [2019-11-15 22:41:42,960 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2019-11-15 22:41:42,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2019-11-15 22:41:42,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 17 transitions. [2019-11-15 22:41:42,962 INFO L711 BuchiCegarLoop]: Abstraction has 13 states and 17 transitions. [2019-11-15 22:41:42,962 INFO L591 BuchiCegarLoop]: Abstraction has 13 states and 17 transitions. [2019-11-15 22:41:42,962 INFO L424 BuchiCegarLoop]: ======== Iteration 2============ [2019-11-15 22:41:42,962 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 13 states and 17 transitions. [2019-11-15 22:41:42,963 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2019-11-15 22:41:42,963 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 22:41:42,963 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 22:41:42,963 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2019-11-15 22:41:42,963 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:41:42,964 INFO L791 eck$LassoCheckResult]: Stem: 55#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 50#L-1 havoc main_#res;havoc main_#t~nondet213, main_#t~nondet214, main_#t~malloc215.base, main_#t~malloc215.offset, main_#t~malloc216.base, main_#t~malloc216.offset, main_#t~ret217, 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~nondet213;havoc main_#t~nondet213;main_~length2~0 := main_#t~nondet214;havoc main_#t~nondet214; 51#L382 assume !(main_~length1~0 < 1); 52#L382-2 assume !(main_~length2~0 < 1); 49#L385-1 call main_#t~malloc215.base, main_#t~malloc215.offset := #Ultimate.allocOnStack(main_~length1~0);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc215.base, main_#t~malloc215.offset;call main_#t~malloc216.base, main_#t~malloc216.offset := #Ultimate.allocOnStack(main_~length2~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc216.base, main_#t~malloc216.offset;call write~int(0, main_~nondetString1~0.base, main_~nondetString1~0.offset, 1);call write~int(0, main_~nondetString2~0.base, main_~nondetString2~0.offset, 1);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_~nondetString1~0.base, main_~nondetString1~0.offset + (main_~length1~0 - 1);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_~nondetString2~0.base, main_~nondetString2~0.offset + (main_~length2~0 - 1);cstrcspn_#in~s1.base, cstrcspn_#in~s1.offset, cstrcspn_#in~s2.base, cstrcspn_#in~s2.offset := main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;havoc cstrcspn_#res;havoc cstrcspn_#t~mem207, cstrcspn_#t~post211.base, cstrcspn_#t~post211.offset, cstrcspn_#t~mem208, cstrcspn_#t~mem209, cstrcspn_#t~short210, cstrcspn_#t~mem212, cstrcspn_#t~post205.base, cstrcspn_#t~post205.offset, cstrcspn_#t~mem206, cstrcspn_~s1.base, cstrcspn_~s1.offset, cstrcspn_~s2.base, cstrcspn_~s2.offset, cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset, cstrcspn_~s~0.base, cstrcspn_~s~0.offset, cstrcspn_~c~0;cstrcspn_~s1.base, cstrcspn_~s1.offset := cstrcspn_#in~s1.base, cstrcspn_#in~s1.offset;cstrcspn_~s2.base, cstrcspn_~s2.offset := cstrcspn_#in~s2.base, cstrcspn_#in~s2.offset;havoc cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset;havoc cstrcspn_~s~0.base, cstrcspn_~s~0.offset;havoc cstrcspn_~c~0;cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset := cstrcspn_~s1.base, cstrcspn_~s1.offset; 47#L369-4 [2019-11-15 22:41:42,964 INFO L793 eck$LassoCheckResult]: Loop: 47#L369-4 call cstrcspn_#t~mem206 := read~int(cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset, 1); 48#L369-1 assume !!(0 != cstrcspn_#t~mem206);havoc cstrcspn_#t~mem206;cstrcspn_~s~0.base, cstrcspn_~s~0.offset := cstrcspn_~s2.base, cstrcspn_~s2.offset;call cstrcspn_#t~mem207 := read~int(cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset, 1);cstrcspn_~c~0 := cstrcspn_#t~mem207;havoc cstrcspn_#t~mem207; 56#L372-5 call cstrcspn_#t~mem208 := read~int(cstrcspn_~s~0.base, cstrcspn_~s~0.offset, 1);cstrcspn_#t~short210 := 0 != cstrcspn_#t~mem208; 53#L372-1 assume cstrcspn_#t~short210;call cstrcspn_#t~mem209 := read~int(cstrcspn_~s~0.base, cstrcspn_~s~0.offset, 1);cstrcspn_#t~short210 := cstrcspn_#t~mem209 != (if cstrcspn_~c~0 % 256 <= 127 then cstrcspn_~c~0 % 256 else cstrcspn_~c~0 % 256 - 256); 54#L372-3 assume !cstrcspn_#t~short210;havoc cstrcspn_#t~mem208;havoc cstrcspn_#t~short210;havoc cstrcspn_#t~mem209; 44#L372-6 call cstrcspn_#t~mem212 := read~int(cstrcspn_~s~0.base, cstrcspn_~s~0.offset, 1); 45#L374 assume !(cstrcspn_#t~mem212 == cstrcspn_~c~0);havoc cstrcspn_#t~mem212; 46#L369-3 cstrcspn_#t~post205.base, cstrcspn_#t~post205.offset := cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset;cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset := cstrcspn_#t~post205.base, cstrcspn_#t~post205.offset - 1;havoc cstrcspn_#t~post205.base, cstrcspn_#t~post205.offset; 47#L369-4 [2019-11-15 22:41:42,964 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:41:42,964 INFO L82 PathProgramCache]: Analyzing trace with hash 28695878, now seen corresponding path program 2 times [2019-11-15 22:41:42,964 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:41:42,965 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1234856783] [2019-11-15 22:41:42,965 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:41:42,965 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:41:42,965 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:41:42,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:41:43,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:41:43,006 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 22:41:43,006 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:41:43,007 INFO L82 PathProgramCache]: Analyzing trace with hash 1927396657, now seen corresponding path program 1 times [2019-11-15 22:41:43,007 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:41:43,007 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1866826795] [2019-11-15 22:41:43,007 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:41:43,007 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:41:43,007 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:41:43,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:41:43,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:41:43,034 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 22:41:43,035 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:41:43,035 INFO L82 PathProgramCache]: Analyzing trace with hash -102988426, now seen corresponding path program 1 times [2019-11-15 22:41:43,035 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:41:43,035 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [72570794] [2019-11-15 22:41:43,036 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:41:43,036 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:41:43,036 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:41:43,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:41:43,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:41:43,128 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 22:41:43,456 WARN L191 SmtUtils]: Spent 322.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 60 [2019-11-15 22:41:43,764 WARN L191 SmtUtils]: Spent 286.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 51 [2019-11-15 22:41:44,109 WARN L191 SmtUtils]: Spent 343.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 96 [2019-11-15 22:41:44,260 WARN L191 SmtUtils]: Spent 148.00 ms on a formula simplification that was a NOOP. DAG size: 90 [2019-11-15 22:41:44,273 INFO L210 LassoAnalysis]: Preferences: [2019-11-15 22:41:44,274 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-11-15 22:41:44,274 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-15 22:41:44,275 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-11-15 22:41:44,282 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-11-15 22:41:44,282 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 22:41:44,282 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-15 22:41:44,283 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-11-15 22:41:44,283 INFO L131 ssoRankerPreferences]: Filename of dumped script: cstrcspn_reverse_alloca.i_Iteration2_Lasso [2019-11-15 22:41:44,283 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-15 22:41:44,283 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-15 22:41:44,321 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:41:44,327 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:41:44,331 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:41:44,334 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:41:44,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-11-15 22:41:44,343 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:41:44,347 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:41:44,349 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:41:44,360 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:41:44,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-11-15 22:41:44,366 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:41:44,368 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:41:44,370 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:41:44,373 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:41:44,376 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:41:44,380 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:41:44,798 WARN L191 SmtUtils]: Spent 283.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 76 [2019-11-15 22:41:45,047 WARN L191 SmtUtils]: Spent 192.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 68 [2019-11-15 22:41:45,047 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:41:45,050 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:41:45,705 WARN L191 SmtUtils]: Spent 343.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 40 [2019-11-15 22:41:45,961 WARN L191 SmtUtils]: Spent 224.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 34 [2019-11-15 22:41:46,064 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-15 22:41:46,069 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-11-15 22:41:46,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-11-15 22:41:46,073 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:41:46,073 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 22:41:46,074 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:41:46,074 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:41:46,074 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:41:46,076 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 22:41:46,076 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 22:41:46,078 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:41:46,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-11-15 22:41:46,079 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:41:46,079 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:41:46,080 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:41:46,080 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:41:46,082 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 22:41:46,082 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 22:41:46,085 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:41:46,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-11-15 22:41:46,086 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:41:46,086 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 22:41:46,087 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:41:46,087 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:41:46,087 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:41:46,087 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 22:41:46,088 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 22:41:46,089 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:41:46,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-11-15 22:41:46,090 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:41:46,090 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:41:46,090 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:41:46,090 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:41:46,092 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 22:41:46,092 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 22:41:46,095 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:41:46,096 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 22:41:46,096 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:41:46,096 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 22:41:46,096 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:41:46,097 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:41:46,097 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:41:46,097 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 22:41:46,097 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 22:41:46,098 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:41:46,099 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 22:41:46,099 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:41:46,099 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 22:41:46,099 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:41:46,099 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:41:46,100 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:41:46,100 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 22:41:46,100 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 22:41:46,101 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:41:46,102 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 22:41:46,102 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:41:46,102 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 22:41:46,102 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:41:46,102 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:41:46,103 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:41:46,103 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 22:41:46,103 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 22:41:46,104 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:41:46,104 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 22:41:46,105 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:41:46,105 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 22:41:46,105 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:41:46,105 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:41:46,105 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:41:46,106 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 22:41:46,106 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 22:41:46,107 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:41:46,107 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 22:41:46,108 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:41:46,108 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 22:41:46,108 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:41:46,108 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:41:46,108 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:41:46,109 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 22:41:46,109 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 22:41:46,110 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:41:46,110 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 22:41:46,111 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:41:46,111 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 22:41:46,111 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:41:46,111 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:41:46,111 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:41:46,112 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 22:41:46,112 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 22:41:46,113 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:41:46,113 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 22:41:46,113 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:41:46,114 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 22:41:46,114 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:41:46,114 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:41:46,114 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:41:46,114 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 22:41:46,115 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 22:41:46,115 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:41:46,116 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 22:41:46,116 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:41:46,116 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 22:41:46,117 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:41:46,117 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:41:46,117 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:41:46,117 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 22:41:46,117 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 22:41:46,118 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:41:46,119 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 22:41:46,119 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:41:46,119 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 22:41:46,119 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:41:46,120 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:41:46,120 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:41:46,120 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 22:41:46,120 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 22:41:46,121 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:41:46,121 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 22:41:46,122 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:41:46,122 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 22:41:46,122 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:41:46,122 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:41:46,123 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:41:46,123 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 22:41:46,123 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 22:41:46,124 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:41:46,124 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 22:41:46,125 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:41:46,125 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 22:41:46,125 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:41:46,125 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:41:46,125 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:41:46,126 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 22:41:46,126 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 22:41:46,127 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:41:46,127 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 22:41:46,128 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:41:46,128 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:41:46,128 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:41:46,128 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:41:46,130 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 22:41:46,130 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 22:41:46,133 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:41:46,133 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 22:41:46,134 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:41:46,134 INFO L202 nArgumentSynthesizer]: 4 stem disjuncts [2019-11-15 22:41:46,134 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:41:46,134 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:41:46,146 INFO L400 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2019-11-15 22:41:46,146 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 22:41:46,204 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:41:46,205 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 22:41:46,205 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:41:46,206 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:41:46,206 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:41:46,206 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:41:46,208 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 22:41:46,208 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 22:41:46,211 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:41:46,211 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 22:41:46,212 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:41:46,212 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:41:46,212 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:41:46,213 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:41:46,214 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 22:41:46,215 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 22:41:46,217 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:41:46,218 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 22:41:46,218 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:41:46,218 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 22:41:46,219 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:41:46,219 INFO L203 nArgumentSynthesizer]: 4 loop disjuncts [2019-11-15 22:41:46,219 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:41:46,223 INFO L400 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2019-11-15 22:41:46,223 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 22:41:46,248 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:41:46,248 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 22:41:46,249 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:41:46,249 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:41:46,249 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:41:46,249 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:41:46,251 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 22:41:46,251 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 22:41:46,256 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:41:46,256 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 22:41:46,257 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:41:46,257 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 22:41:46,257 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:41:46,257 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:41:46,257 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:41:46,258 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 22:41:46,258 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 22:41:46,263 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:41:46,264 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 22:41:46,265 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:41:46,265 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:41:46,265 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:41:46,265 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:41:46,271 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 22:41:46,272 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 22:41:46,283 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:41:46,284 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 22:41:46,284 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:41:46,284 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:41:46,285 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:41:46,285 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:41:46,286 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 22:41:46,286 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 22:41:46,298 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:41:46,299 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 22:41:46,300 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:41:46,301 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:41:46,301 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:41:46,302 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:41:46,306 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 22:41:46,309 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 22:41:46,378 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-15 22:41:46,440 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2019-11-15 22:41:46,440 INFO L444 ModelExtractionUtils]: 43 out of 49 variables were initially zero. Simplification set additionally 3 variables to zero. [2019-11-15 22:41:46,442 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-15 22:41:46,443 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-11-15 22:41:46,444 INFO L510 LassoAnalysis]: Proved termination. [2019-11-15 22:41:46,444 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_cstrcspn_~sc1~0.offset) = 2*ULTIMATE.start_cstrcspn_~sc1~0.offset + 1 Supporting invariants [] [2019-11-15 22:41:46,486 INFO L297 tatePredicateManager]: 9 out of 9 supporting invariants were superfluous and have been removed [2019-11-15 22:41:46,513 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:41:46,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:41:46,535 INFO L256 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-15 22:41:46,541 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:41:46,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:41:46,569 INFO L256 TraceCheckSpWp]: Trace formula consists of 46 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-15 22:41:46,569 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:41:46,603 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:41:46,606 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2019-11-15 22:41:46,607 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 13 states and 17 transitions. cyclomatic complexity: 5 Second operand 3 states. [2019-11-15 22:41:46,656 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-11-15 22:41:46,658 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2019-11-15 22:41:46,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-11-15 22:41:46,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 17 transitions. [2019-11-15 22:41:46,660 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 17 transitions. Stem has 5 letters. Loop has 8 letters. [2019-11-15 22:41:46,661 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 22:41:46,661 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 17 transitions. Stem has 13 letters. Loop has 8 letters. [2019-11-15 22:41:46,662 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 22:41:46,662 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 17 transitions. Stem has 5 letters. Loop has 16 letters. [2019-11-15 22:41:46,662 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 22:41:46,663 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 21 states and 28 transitions. [2019-11-15 22:41:46,664 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-11-15 22:41:46,664 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 21 states to 18 states and 25 transitions. [2019-11-15 22:41:46,665 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9 [2019-11-15 22:41:46,665 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2019-11-15 22:41:46,665 INFO L73 IsDeterministic]: Start isDeterministic. Operand 18 states and 25 transitions. [2019-11-15 22:41:46,665 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-15 22:41:46,665 INFO L688 BuchiCegarLoop]: Abstraction has 18 states and 25 transitions. [2019-11-15 22:41:46,665 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states and 25 transitions. [2019-11-15 22:41:46,667 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2019-11-15 22:41:46,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2019-11-15 22:41:46,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 25 transitions. [2019-11-15 22:41:46,667 INFO L711 BuchiCegarLoop]: Abstraction has 18 states and 25 transitions. [2019-11-15 22:41:46,667 INFO L591 BuchiCegarLoop]: Abstraction has 18 states and 25 transitions. [2019-11-15 22:41:46,668 INFO L424 BuchiCegarLoop]: ======== Iteration 3============ [2019-11-15 22:41:46,668 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states and 25 transitions. [2019-11-15 22:41:46,668 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-11-15 22:41:46,669 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 22:41:46,669 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 22:41:46,669 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:41:46,669 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-11-15 22:41:46,669 INFO L791 eck$LassoCheckResult]: Stem: 188#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 181#L-1 havoc main_#res;havoc main_#t~nondet213, main_#t~nondet214, main_#t~malloc215.base, main_#t~malloc215.offset, main_#t~malloc216.base, main_#t~malloc216.offset, main_#t~ret217, 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~nondet213;havoc main_#t~nondet213;main_~length2~0 := main_#t~nondet214;havoc main_#t~nondet214; 182#L382 assume !(main_~length1~0 < 1); 183#L382-2 assume !(main_~length2~0 < 1); 180#L385-1 call main_#t~malloc215.base, main_#t~malloc215.offset := #Ultimate.allocOnStack(main_~length1~0);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc215.base, main_#t~malloc215.offset;call main_#t~malloc216.base, main_#t~malloc216.offset := #Ultimate.allocOnStack(main_~length2~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc216.base, main_#t~malloc216.offset;call write~int(0, main_~nondetString1~0.base, main_~nondetString1~0.offset, 1);call write~int(0, main_~nondetString2~0.base, main_~nondetString2~0.offset, 1);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_~nondetString1~0.base, main_~nondetString1~0.offset + (main_~length1~0 - 1);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_~nondetString2~0.base, main_~nondetString2~0.offset + (main_~length2~0 - 1);cstrcspn_#in~s1.base, cstrcspn_#in~s1.offset, cstrcspn_#in~s2.base, cstrcspn_#in~s2.offset := main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;havoc cstrcspn_#res;havoc cstrcspn_#t~mem207, cstrcspn_#t~post211.base, cstrcspn_#t~post211.offset, cstrcspn_#t~mem208, cstrcspn_#t~mem209, cstrcspn_#t~short210, cstrcspn_#t~mem212, cstrcspn_#t~post205.base, cstrcspn_#t~post205.offset, cstrcspn_#t~mem206, cstrcspn_~s1.base, cstrcspn_~s1.offset, cstrcspn_~s2.base, cstrcspn_~s2.offset, cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset, cstrcspn_~s~0.base, cstrcspn_~s~0.offset, cstrcspn_~c~0;cstrcspn_~s1.base, cstrcspn_~s1.offset := cstrcspn_#in~s1.base, cstrcspn_#in~s1.offset;cstrcspn_~s2.base, cstrcspn_~s2.offset := cstrcspn_#in~s2.base, cstrcspn_#in~s2.offset;havoc cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset;havoc cstrcspn_~s~0.base, cstrcspn_~s~0.offset;havoc cstrcspn_~c~0;cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset := cstrcspn_~s1.base, cstrcspn_~s1.offset; 177#L369-4 call cstrcspn_#t~mem206 := read~int(cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset, 1); 179#L369-1 assume !!(0 != cstrcspn_#t~mem206);havoc cstrcspn_#t~mem206;cstrcspn_~s~0.base, cstrcspn_~s~0.offset := cstrcspn_~s2.base, cstrcspn_~s2.offset;call cstrcspn_#t~mem207 := read~int(cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset, 1);cstrcspn_~c~0 := cstrcspn_#t~mem207;havoc cstrcspn_#t~mem207; 189#L372-5 [2019-11-15 22:41:46,670 INFO L793 eck$LassoCheckResult]: Loop: 189#L372-5 call cstrcspn_#t~mem208 := read~int(cstrcspn_~s~0.base, cstrcspn_~s~0.offset, 1);cstrcspn_#t~short210 := 0 != cstrcspn_#t~mem208; 184#L372-1 assume cstrcspn_#t~short210;call cstrcspn_#t~mem209 := read~int(cstrcspn_~s~0.base, cstrcspn_~s~0.offset, 1);cstrcspn_#t~short210 := cstrcspn_#t~mem209 != (if cstrcspn_~c~0 % 256 <= 127 then cstrcspn_~c~0 % 256 else cstrcspn_~c~0 % 256 - 256); 185#L372-3 assume !!cstrcspn_#t~short210;havoc cstrcspn_#t~mem208;havoc cstrcspn_#t~short210;havoc cstrcspn_#t~mem209;cstrcspn_#t~post211.base, cstrcspn_#t~post211.offset := cstrcspn_~s~0.base, cstrcspn_~s~0.offset;cstrcspn_~s~0.base, cstrcspn_~s~0.offset := cstrcspn_#t~post211.base, cstrcspn_#t~post211.offset - 1;havoc cstrcspn_#t~post211.base, cstrcspn_#t~post211.offset; 189#L372-5 [2019-11-15 22:41:46,670 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:41:46,670 INFO L82 PathProgramCache]: Analyzing trace with hash 1806935595, now seen corresponding path program 1 times [2019-11-15 22:41:46,670 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:41:46,670 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [235667871] [2019-11-15 22:41:46,670 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:41:46,671 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:41:46,671 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:41:46,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:41:46,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:41:46,720 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 22:41:46,720 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:41:46,720 INFO L82 PathProgramCache]: Analyzing trace with hash 58692, now seen corresponding path program 1 times [2019-11-15 22:41:46,721 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:41:46,721 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1791852749] [2019-11-15 22:41:46,721 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:41:46,721 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:41:46,721 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:41:46,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:41:46,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:41:46,743 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 22:41:46,743 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:41:46,744 INFO L82 PathProgramCache]: Analyzing trace with hash 1593218778, now seen corresponding path program 1 times [2019-11-15 22:41:46,744 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:41:46,744 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2005507227] [2019-11-15 22:41:46,744 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:41:46,744 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:41:46,744 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:41:46,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:41:46,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:41:46,783 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 22:41:46,996 WARN L191 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 36 [2019-11-15 22:41:47,320 WARN L191 SmtUtils]: Spent 321.00 ms on a formula simplification. DAG size of input: 126 DAG size of output: 111 [2019-11-15 22:41:47,483 WARN L191 SmtUtils]: Spent 161.00 ms on a formula simplification that was a NOOP. DAG size: 103 [2019-11-15 22:41:47,485 INFO L210 LassoAnalysis]: Preferences: [2019-11-15 22:41:47,485 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-11-15 22:41:47,485 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-15 22:41:47,485 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-11-15 22:41:47,485 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-11-15 22:41:47,485 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 22:41:47,485 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-15 22:41:47,486 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-11-15 22:41:47,486 INFO L131 ssoRankerPreferences]: Filename of dumped script: cstrcspn_reverse_alloca.i_Iteration3_Lasso [2019-11-15 22:41:47,486 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-15 22:41:47,486 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-15 22:41:47,493 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:41:47,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-11-15 22:41:47,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-11-15 22:41:47,500 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:41:47,503 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:41:47,504 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:41:47,507 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:41:47,509 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:41:47,510 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:41:47,511 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:41:47,513 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:41:47,521 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:41:47,523 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:41:47,525 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:41:47,527 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:41:47,834 WARN L191 SmtUtils]: Spent 209.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 93 [2019-11-15 22:41:47,952 WARN L191 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 62 [2019-11-15 22:41:47,952 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:41:47,957 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:41:47,959 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:41:48,114 WARN L191 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 56 [2019-11-15 22:41:48,635 WARN L191 SmtUtils]: Spent 192.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 36 [2019-11-15 22:41:48,987 WARN L191 SmtUtils]: Spent 350.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 43 [2019-11-15 22:41:49,011 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-15 22:41:49,011 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-11-15 22:41:49,011 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 22:41:49,012 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:41:49,012 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 22:41:49,012 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:41:49,012 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:41:49,013 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:41:49,013 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 22:41:49,013 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 22:41:49,013 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:41:49,014 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 22:41:49,014 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:41:49,014 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:41:49,014 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:41:49,014 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:41:49,015 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 22:41:49,015 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 22:41:49,016 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:41:49,017 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 22:41:49,017 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:41:49,017 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 22:41:49,017 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:41:49,018 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:41:49,018 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:41:49,018 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 22:41:49,018 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 22:41:49,018 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:41:49,019 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 22:41:49,019 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:41:49,019 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 22:41:49,019 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:41:49,019 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:41:49,019 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:41:49,020 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 22:41:49,020 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 22:41:49,020 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:41:49,020 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 22:41:49,021 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:41:49,021 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 22:41:49,021 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:41:49,021 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:41:49,021 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:41:49,021 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 22:41:49,021 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 22:41:49,022 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:41:49,022 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 22:41:49,022 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:41:49,022 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:41:49,023 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:41:49,023 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:41:49,023 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 22:41:49,023 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 22:41:49,024 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:41:49,025 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 22:41:49,025 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:41:49,025 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 22:41:49,025 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:41:49,025 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:41:49,026 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:41:49,026 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 22:41:49,026 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 22:41:49,026 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:41:49,027 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 22:41:49,027 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:41:49,027 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 22:41:49,027 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:41:49,027 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:41:49,027 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:41:49,028 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 22:41:49,028 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 22:41:49,028 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:41:49,028 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 22:41:49,029 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:41:49,029 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 22:41:49,029 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:41:49,029 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:41:49,029 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:41:49,029 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 22:41:49,030 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 22:41:49,030 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:41:49,030 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 22:41:49,030 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:41:49,031 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 22:41:49,031 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:41:49,031 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:41:49,031 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:41:49,031 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 22:41:49,031 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 22:41:49,032 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:41:49,032 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 22:41:49,032 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:41:49,032 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 22:41:49,032 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:41:49,033 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:41:49,033 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:41:49,033 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 22:41:49,033 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 22:41:49,033 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:41:49,034 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 22:41:49,034 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:41:49,034 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 22:41:49,034 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:41:49,034 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:41:49,035 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:41:49,035 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 22:41:49,035 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 22:41:49,035 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:41:49,036 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 22:41:49,036 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:41:49,036 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 22:41:49,036 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:41:49,036 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:41:49,036 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:41:49,037 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 22:41:49,037 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 22:41:49,037 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:41:49,038 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 22:41:49,038 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:41:49,038 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 22:41:49,038 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:41:49,038 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:41:49,038 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:41:49,039 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 22:41:49,039 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 22:41:49,039 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:41:49,039 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 22:41:49,040 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:41:49,040 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:41:49,040 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:41:49,040 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:41:49,043 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 22:41:49,044 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 22:41:49,076 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-15 22:41:49,103 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2019-11-15 22:41:49,103 INFO L444 ModelExtractionUtils]: 49 out of 55 variables were initially zero. Simplification set additionally 3 variables to zero. [2019-11-15 22:41:49,104 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-15 22:41:49,105 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-11-15 22:41:49,105 INFO L510 LassoAnalysis]: Proved termination. [2019-11-15 22:41:49,105 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_cstrcspn_~s~0.offset) = 2*ULTIMATE.start_cstrcspn_~s~0.offset + 1 Supporting invariants [] [2019-11-15 22:41:49,157 INFO L297 tatePredicateManager]: 16 out of 16 supporting invariants were superfluous and have been removed [2019-11-15 22:41:49,175 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:41:49,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:41:49,196 INFO L256 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-15 22:41:49,197 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:41:49,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:41:49,205 INFO L256 TraceCheckSpWp]: Trace formula consists of 22 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-15 22:41:49,205 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:41:49,220 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:41:49,220 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2019-11-15 22:41:49,220 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 18 states and 25 transitions. cyclomatic complexity: 9 Second operand 3 states. [2019-11-15 22:41:49,248 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-11-15 22:41:49,250 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2019-11-15 22:41:49,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-11-15 22:41:49,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 18 transitions. [2019-11-15 22:41:49,250 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 18 transitions. Stem has 7 letters. Loop has 3 letters. [2019-11-15 22:41:49,250 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 22:41:49,251 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 18 transitions. Stem has 10 letters. Loop has 3 letters. [2019-11-15 22:41:49,251 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 22:41:49,251 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 18 transitions. Stem has 7 letters. Loop has 6 letters. [2019-11-15 22:41:49,251 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 22:41:49,251 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 43 states and 57 transitions. [2019-11-15 22:41:49,253 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-11-15 22:41:49,254 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 43 states to 30 states and 40 transitions. [2019-11-15 22:41:49,254 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2019-11-15 22:41:49,254 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2019-11-15 22:41:49,254 INFO L73 IsDeterministic]: Start isDeterministic. Operand 30 states and 40 transitions. [2019-11-15 22:41:49,255 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-15 22:41:49,255 INFO L688 BuchiCegarLoop]: Abstraction has 30 states and 40 transitions. [2019-11-15 22:41:49,255 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states and 40 transitions. [2019-11-15 22:41:49,261 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 24. [2019-11-15 22:41:49,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2019-11-15 22:41:49,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 33 transitions. [2019-11-15 22:41:49,262 INFO L711 BuchiCegarLoop]: Abstraction has 24 states and 33 transitions. [2019-11-15 22:41:49,262 INFO L591 BuchiCegarLoop]: Abstraction has 24 states and 33 transitions. [2019-11-15 22:41:49,262 INFO L424 BuchiCegarLoop]: ======== Iteration 4============ [2019-11-15 22:41:49,262 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 24 states and 33 transitions. [2019-11-15 22:41:49,264 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-11-15 22:41:49,265 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 22:41:49,265 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 22:41:49,266 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:41:49,266 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-11-15 22:41:49,266 INFO L791 eck$LassoCheckResult]: Stem: 365#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 358#L-1 havoc main_#res;havoc main_#t~nondet213, main_#t~nondet214, main_#t~malloc215.base, main_#t~malloc215.offset, main_#t~malloc216.base, main_#t~malloc216.offset, main_#t~ret217, 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~nondet213;havoc main_#t~nondet213;main_~length2~0 := main_#t~nondet214;havoc main_#t~nondet214; 359#L382 assume !(main_~length1~0 < 1); 360#L382-2 assume !(main_~length2~0 < 1); 357#L385-1 call main_#t~malloc215.base, main_#t~malloc215.offset := #Ultimate.allocOnStack(main_~length1~0);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc215.base, main_#t~malloc215.offset;call main_#t~malloc216.base, main_#t~malloc216.offset := #Ultimate.allocOnStack(main_~length2~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc216.base, main_#t~malloc216.offset;call write~int(0, main_~nondetString1~0.base, main_~nondetString1~0.offset, 1);call write~int(0, main_~nondetString2~0.base, main_~nondetString2~0.offset, 1);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_~nondetString1~0.base, main_~nondetString1~0.offset + (main_~length1~0 - 1);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_~nondetString2~0.base, main_~nondetString2~0.offset + (main_~length2~0 - 1);cstrcspn_#in~s1.base, cstrcspn_#in~s1.offset, cstrcspn_#in~s2.base, cstrcspn_#in~s2.offset := main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;havoc cstrcspn_#res;havoc cstrcspn_#t~mem207, cstrcspn_#t~post211.base, cstrcspn_#t~post211.offset, cstrcspn_#t~mem208, cstrcspn_#t~mem209, cstrcspn_#t~short210, cstrcspn_#t~mem212, cstrcspn_#t~post205.base, cstrcspn_#t~post205.offset, cstrcspn_#t~mem206, cstrcspn_~s1.base, cstrcspn_~s1.offset, cstrcspn_~s2.base, cstrcspn_~s2.offset, cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset, cstrcspn_~s~0.base, cstrcspn_~s~0.offset, cstrcspn_~c~0;cstrcspn_~s1.base, cstrcspn_~s1.offset := cstrcspn_#in~s1.base, cstrcspn_#in~s1.offset;cstrcspn_~s2.base, cstrcspn_~s2.offset := cstrcspn_#in~s2.base, cstrcspn_#in~s2.offset;havoc cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset;havoc cstrcspn_~s~0.base, cstrcspn_~s~0.offset;havoc cstrcspn_~c~0;cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset := cstrcspn_~s1.base, cstrcspn_~s1.offset; 353#L369-4 call cstrcspn_#t~mem206 := read~int(cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset, 1); 354#L369-1 assume !!(0 != cstrcspn_#t~mem206);havoc cstrcspn_#t~mem206;cstrcspn_~s~0.base, cstrcspn_~s~0.offset := cstrcspn_~s2.base, cstrcspn_~s2.offset;call cstrcspn_#t~mem207 := read~int(cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset, 1);cstrcspn_~c~0 := cstrcspn_#t~mem207;havoc cstrcspn_#t~mem207; 367#L372-5 call cstrcspn_#t~mem208 := read~int(cstrcspn_~s~0.base, cstrcspn_~s~0.offset, 1);cstrcspn_#t~short210 := 0 != cstrcspn_#t~mem208; 363#L372-1 assume !cstrcspn_#t~short210; 364#L372-3 assume !cstrcspn_#t~short210;havoc cstrcspn_#t~mem208;havoc cstrcspn_#t~short210;havoc cstrcspn_#t~mem209; 349#L372-6 call cstrcspn_#t~mem212 := read~int(cstrcspn_~s~0.base, cstrcspn_~s~0.offset, 1); 350#L374 assume !(cstrcspn_#t~mem212 == cstrcspn_~c~0);havoc cstrcspn_#t~mem212; 351#L369-3 cstrcspn_#t~post205.base, cstrcspn_#t~post205.offset := cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset;cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset := cstrcspn_#t~post205.base, cstrcspn_#t~post205.offset - 1;havoc cstrcspn_#t~post205.base, cstrcspn_#t~post205.offset; 352#L369-4 call cstrcspn_#t~mem206 := read~int(cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset, 1); 356#L369-1 assume !!(0 != cstrcspn_#t~mem206);havoc cstrcspn_#t~mem206;cstrcspn_~s~0.base, cstrcspn_~s~0.offset := cstrcspn_~s2.base, cstrcspn_~s2.offset;call cstrcspn_#t~mem207 := read~int(cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset, 1);cstrcspn_~c~0 := cstrcspn_#t~mem207;havoc cstrcspn_#t~mem207; 366#L372-5 [2019-11-15 22:41:49,266 INFO L793 eck$LassoCheckResult]: Loop: 366#L372-5 call cstrcspn_#t~mem208 := read~int(cstrcspn_~s~0.base, cstrcspn_~s~0.offset, 1);cstrcspn_#t~short210 := 0 != cstrcspn_#t~mem208; 361#L372-1 assume cstrcspn_#t~short210;call cstrcspn_#t~mem209 := read~int(cstrcspn_~s~0.base, cstrcspn_~s~0.offset, 1);cstrcspn_#t~short210 := cstrcspn_#t~mem209 != (if cstrcspn_~c~0 % 256 <= 127 then cstrcspn_~c~0 % 256 else cstrcspn_~c~0 % 256 - 256); 362#L372-3 assume !!cstrcspn_#t~short210;havoc cstrcspn_#t~mem208;havoc cstrcspn_#t~short210;havoc cstrcspn_#t~mem209;cstrcspn_#t~post211.base, cstrcspn_#t~post211.offset := cstrcspn_~s~0.base, cstrcspn_~s~0.offset;cstrcspn_~s~0.base, cstrcspn_~s~0.offset := cstrcspn_#t~post211.base, cstrcspn_#t~post211.offset - 1;havoc cstrcspn_#t~post211.base, cstrcspn_#t~post211.offset; 366#L372-5 [2019-11-15 22:41:49,266 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:41:49,266 INFO L82 PathProgramCache]: Analyzing trace with hash 1587378397, now seen corresponding path program 1 times [2019-11-15 22:41:49,267 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:41:49,267 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1091493098] [2019-11-15 22:41:49,267 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:41:49,267 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:41:49,267 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:41:49,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:41:49,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:41:49,320 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 22:41:49,323 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:41:49,324 INFO L82 PathProgramCache]: Analyzing trace with hash 58692, now seen corresponding path program 2 times [2019-11-15 22:41:49,325 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:41:49,325 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1463656152] [2019-11-15 22:41:49,325 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:41:49,325 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:41:49,325 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:41:49,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:41:49,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:41:49,336 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 22:41:49,337 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:41:49,337 INFO L82 PathProgramCache]: Analyzing trace with hash 1999924968, now seen corresponding path program 1 times [2019-11-15 22:41:49,337 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:41:49,337 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1337771180] [2019-11-15 22:41:49,338 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:41:49,340 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:41:49,340 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:41:49,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:41:49,418 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:41:49,419 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1337771180] [2019-11-15 22:41:49,419 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1368143807] [2019-11-15 22:41:49,419 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_79cf2810-2f9f-4d2c-9304-d9d1e804cf6b/bin/uautomizer/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 22:41:49,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:41:49,510 INFO L256 TraceCheckSpWp]: Trace formula consists of 138 conjuncts, 23 conjunts are in the unsatisfiable core [2019-11-15 22:41:49,512 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:41:49,553 INFO L341 Elim1Store]: treesize reduction 50, result has 19.4 percent of original size [2019-11-15 22:41:49,553 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 25 [2019-11-15 22:41:49,554 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:41:49,568 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:41:49,569 INFO L496 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-2 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-11-15 22:41:49,570 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:42, output treesize:25 [2019-11-15 22:42:37,727 WARN L191 SmtUtils]: Spent 12.04 s on a formula simplification that was a NOOP. DAG size: 22 [2019-11-15 22:43:13,777 WARN L191 SmtUtils]: Spent 12.01 s on a formula simplification that was a NOOP. DAG size: 17 [2019-11-15 22:43:49,826 WARN L191 SmtUtils]: Spent 12.01 s on a formula simplification that was a NOOP. DAG size: 17 [2019-11-15 22:43:49,828 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:43:49,838 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:43:49,838 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 22:43:49,838 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 13 [2019-11-15 22:43:49,838 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [161885422] [2019-11-15 22:43:50,054 WARN L191 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 36 [2019-11-15 22:43:50,054 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:43:50,054 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-11-15 22:43:50,054 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=116, Unknown=7, NotChecked=0, Total=156 [2019-11-15 22:43:50,055 INFO L87 Difference]: Start difference. First operand 24 states and 33 transitions. cyclomatic complexity: 12 Second operand 13 states. [2019-11-15 22:44:14,161 WARN L191 SmtUtils]: Spent 24.06 s on a formula simplification. DAG size of input: 32 DAG size of output: 27 [2019-11-15 22:45:14,240 WARN L191 SmtUtils]: Spent 1.00 m on a formula simplification. DAG size of input: 33 DAG size of output: 24 [2019-11-15 22:46:14,296 WARN L191 SmtUtils]: Spent 24.02 s on a formula simplification. DAG size of input: 24 DAG size of output: 21 [2019-11-15 22:47:02,371 WARN L191 SmtUtils]: Spent 24.02 s on a formula simplification. DAG size of input: 27 DAG size of output: 22 [2019-11-15 22:47:14,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:47:14,443 INFO L93 Difference]: Finished difference Result 59 states and 72 transitions. [2019-11-15 22:47:14,444 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-15 22:47:14,445 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 59 states and 72 transitions. [2019-11-15 22:47:14,447 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-11-15 22:47:14,450 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 59 states to 43 states and 53 transitions. [2019-11-15 22:47:14,450 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 14 [2019-11-15 22:47:14,450 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 14 [2019-11-15 22:47:14,450 INFO L73 IsDeterministic]: Start isDeterministic. Operand 43 states and 53 transitions. [2019-11-15 22:47:14,450 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-15 22:47:14,450 INFO L688 BuchiCegarLoop]: Abstraction has 43 states and 53 transitions. [2019-11-15 22:47:14,450 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states and 53 transitions. [2019-11-15 22:47:14,453 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 28. [2019-11-15 22:47:14,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2019-11-15 22:47:14,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 36 transitions. [2019-11-15 22:47:14,454 INFO L711 BuchiCegarLoop]: Abstraction has 28 states and 36 transitions. [2019-11-15 22:47:14,455 INFO L591 BuchiCegarLoop]: Abstraction has 28 states and 36 transitions. [2019-11-15 22:47:14,455 INFO L424 BuchiCegarLoop]: ======== Iteration 5============ [2019-11-15 22:47:14,455 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 28 states and 36 transitions. [2019-11-15 22:47:14,456 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-11-15 22:47:14,456 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 22:47:14,456 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 22:47:14,457 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:47:14,457 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-11-15 22:47:14,457 INFO L791 eck$LassoCheckResult]: Stem: 528#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 521#L-1 havoc main_#res;havoc main_#t~nondet213, main_#t~nondet214, main_#t~malloc215.base, main_#t~malloc215.offset, main_#t~malloc216.base, main_#t~malloc216.offset, main_#t~ret217, 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~nondet213;havoc main_#t~nondet213;main_~length2~0 := main_#t~nondet214;havoc main_#t~nondet214; 522#L382 assume !(main_~length1~0 < 1); 523#L382-2 assume !(main_~length2~0 < 1); 520#L385-1 call main_#t~malloc215.base, main_#t~malloc215.offset := #Ultimate.allocOnStack(main_~length1~0);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc215.base, main_#t~malloc215.offset;call main_#t~malloc216.base, main_#t~malloc216.offset := #Ultimate.allocOnStack(main_~length2~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc216.base, main_#t~malloc216.offset;call write~int(0, main_~nondetString1~0.base, main_~nondetString1~0.offset, 1);call write~int(0, main_~nondetString2~0.base, main_~nondetString2~0.offset, 1);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_~nondetString1~0.base, main_~nondetString1~0.offset + (main_~length1~0 - 1);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_~nondetString2~0.base, main_~nondetString2~0.offset + (main_~length2~0 - 1);cstrcspn_#in~s1.base, cstrcspn_#in~s1.offset, cstrcspn_#in~s2.base, cstrcspn_#in~s2.offset := main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;havoc cstrcspn_#res;havoc cstrcspn_#t~mem207, cstrcspn_#t~post211.base, cstrcspn_#t~post211.offset, cstrcspn_#t~mem208, cstrcspn_#t~mem209, cstrcspn_#t~short210, cstrcspn_#t~mem212, cstrcspn_#t~post205.base, cstrcspn_#t~post205.offset, cstrcspn_#t~mem206, cstrcspn_~s1.base, cstrcspn_~s1.offset, cstrcspn_~s2.base, cstrcspn_~s2.offset, cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset, cstrcspn_~s~0.base, cstrcspn_~s~0.offset, cstrcspn_~c~0;cstrcspn_~s1.base, cstrcspn_~s1.offset := cstrcspn_#in~s1.base, cstrcspn_#in~s1.offset;cstrcspn_~s2.base, cstrcspn_~s2.offset := cstrcspn_#in~s2.base, cstrcspn_#in~s2.offset;havoc cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset;havoc cstrcspn_~s~0.base, cstrcspn_~s~0.offset;havoc cstrcspn_~c~0;cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset := cstrcspn_~s1.base, cstrcspn_~s1.offset; 516#L369-4 call cstrcspn_#t~mem206 := read~int(cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset, 1); 517#L369-1 assume !!(0 != cstrcspn_#t~mem206);havoc cstrcspn_#t~mem206;cstrcspn_~s~0.base, cstrcspn_~s~0.offset := cstrcspn_~s2.base, cstrcspn_~s2.offset;call cstrcspn_#t~mem207 := read~int(cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset, 1);cstrcspn_~c~0 := cstrcspn_#t~mem207;havoc cstrcspn_#t~mem207; 536#L372-5 call cstrcspn_#t~mem208 := read~int(cstrcspn_~s~0.base, cstrcspn_~s~0.offset, 1);cstrcspn_#t~short210 := 0 != cstrcspn_#t~mem208; 526#L372-1 assume cstrcspn_#t~short210;call cstrcspn_#t~mem209 := read~int(cstrcspn_~s~0.base, cstrcspn_~s~0.offset, 1);cstrcspn_#t~short210 := cstrcspn_#t~mem209 != (if cstrcspn_~c~0 % 256 <= 127 then cstrcspn_~c~0 % 256 else cstrcspn_~c~0 % 256 - 256); 527#L372-3 assume !cstrcspn_#t~short210;havoc cstrcspn_#t~mem208;havoc cstrcspn_#t~short210;havoc cstrcspn_#t~mem209; 512#L372-6 call cstrcspn_#t~mem212 := read~int(cstrcspn_~s~0.base, cstrcspn_~s~0.offset, 1); 513#L374 assume !(cstrcspn_#t~mem212 == cstrcspn_~c~0);havoc cstrcspn_#t~mem212; 514#L369-3 cstrcspn_#t~post205.base, cstrcspn_#t~post205.offset := cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset;cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset := cstrcspn_#t~post205.base, cstrcspn_#t~post205.offset - 1;havoc cstrcspn_#t~post205.base, cstrcspn_#t~post205.offset; 515#L369-4 call cstrcspn_#t~mem206 := read~int(cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset, 1); 519#L369-1 assume !!(0 != cstrcspn_#t~mem206);havoc cstrcspn_#t~mem206;cstrcspn_~s~0.base, cstrcspn_~s~0.offset := cstrcspn_~s2.base, cstrcspn_~s2.offset;call cstrcspn_#t~mem207 := read~int(cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset, 1);cstrcspn_~c~0 := cstrcspn_#t~mem207;havoc cstrcspn_#t~mem207; 529#L372-5 [2019-11-15 22:47:14,457 INFO L793 eck$LassoCheckResult]: Loop: 529#L372-5 call cstrcspn_#t~mem208 := read~int(cstrcspn_~s~0.base, cstrcspn_~s~0.offset, 1);cstrcspn_#t~short210 := 0 != cstrcspn_#t~mem208; 524#L372-1 assume cstrcspn_#t~short210;call cstrcspn_#t~mem209 := read~int(cstrcspn_~s~0.base, cstrcspn_~s~0.offset, 1);cstrcspn_#t~short210 := cstrcspn_#t~mem209 != (if cstrcspn_~c~0 % 256 <= 127 then cstrcspn_~c~0 % 256 else cstrcspn_~c~0 % 256 - 256); 525#L372-3 assume !!cstrcspn_#t~short210;havoc cstrcspn_#t~mem208;havoc cstrcspn_#t~short210;havoc cstrcspn_#t~mem209;cstrcspn_#t~post211.base, cstrcspn_#t~post211.offset := cstrcspn_~s~0.base, cstrcspn_~s~0.offset;cstrcspn_~s~0.base, cstrcspn_~s~0.offset := cstrcspn_#t~post211.base, cstrcspn_#t~post211.offset - 1;havoc cstrcspn_#t~post211.base, cstrcspn_#t~post211.offset; 529#L372-5 [2019-11-15 22:47:14,458 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:47:14,458 INFO L82 PathProgramCache]: Analyzing trace with hash -187628965, now seen corresponding path program 2 times [2019-11-15 22:47:14,458 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:47:14,458 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [678326915] [2019-11-15 22:47:14,459 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:47:14,459 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:47:14,459 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:47:14,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:47:14,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:47:14,486 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 22:47:14,486 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:47:14,486 INFO L82 PathProgramCache]: Analyzing trace with hash 58692, now seen corresponding path program 3 times [2019-11-15 22:47:14,487 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:47:14,487 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [824343567] [2019-11-15 22:47:14,487 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:47:14,487 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:47:14,487 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:47:14,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:47:14,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:47:14,495 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 22:47:14,495 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:47:14,496 INFO L82 PathProgramCache]: Analyzing trace with hash -1902015318, now seen corresponding path program 1 times [2019-11-15 22:47:14,496 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:47:14,496 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1620398305] [2019-11-15 22:47:14,496 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:47:14,496 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:47:14,497 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:47:14,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:47:14,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:47:14,529 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 22:47:14,726 WARN L191 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 36 [2019-11-15 22:47:15,407 WARN L191 SmtUtils]: Spent 678.00 ms on a formula simplification. DAG size of input: 185 DAG size of output: 144 [2019-11-15 22:47:16,692 WARN L191 SmtUtils]: Spent 1.27 s on a formula simplification. DAG size of input: 117 DAG size of output: 117 [2019-11-15 22:47:16,695 INFO L210 LassoAnalysis]: Preferences: [2019-11-15 22:47:16,695 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-11-15 22:47:16,695 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-15 22:47:16,695 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-11-15 22:47:16,695 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-11-15 22:47:16,695 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 22:47:16,695 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-15 22:47:16,695 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-11-15 22:47:16,696 INFO L131 ssoRankerPreferences]: Filename of dumped script: cstrcspn_reverse_alloca.i_Iteration5_Lasso [2019-11-15 22:47:16,696 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-15 22:47:16,696 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-15 22:47:16,717 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:47:16,728 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:47:16,730 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:47:16,732 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:47:16,735 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:47:16,737 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:47:16,744 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:47:16,747 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:47:16,754 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:47:16,758 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:47:16,959 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2019-11-15 22:47:17,816 WARN L191 SmtUtils]: Spent 853.00 ms on a formula simplification. DAG size of input: 116 DAG size of output: 105 [2019-11-15 22:47:17,953 WARN L191 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 62 [2019-11-15 22:47:17,954 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:47:17,955 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:47:17,957 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:47:17,958 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:47:17,960 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:47:17,961 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:47:17,963 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:47:17,965 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:47:18,772 WARN L191 SmtUtils]: Spent 438.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 43 [2019-11-15 22:47:19,450 WARN L191 SmtUtils]: Spent 554.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 46 [2019-11-15 22:47:19,622 WARN L191 SmtUtils]: Spent 172.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 36 [2019-11-15 22:47:19,634 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-15 22:47:19,634 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-11-15 22:47:19,634 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 22:47:19,635 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:47:19,635 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 22:47:19,636 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:47:19,636 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:47:19,636 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:47:19,637 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 22:47:19,637 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 22:47:19,637 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:47:19,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-11-15 22:47:19,638 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:47:19,639 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 22:47:19,639 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:47:19,639 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:47:19,639 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:47:19,639 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 22:47:19,640 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 22:47:19,640 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:47:19,640 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 22:47:19,641 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:47:19,641 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 22:47:19,642 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:47:19,642 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:47:19,642 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:47:19,642 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 22:47:19,642 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 22:47:19,643 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:47:19,643 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 22:47:19,644 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:47:19,644 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:47:19,644 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:47:19,644 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:47:19,645 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 22:47:19,645 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 22:47:19,648 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:47:19,648 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 22:47:19,649 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:47:19,649 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 22:47:19,650 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:47:19,650 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:47:19,650 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:47:19,650 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 22:47:19,650 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 22:47:19,651 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:47:19,651 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 22:47:19,652 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:47:19,652 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 22:47:19,652 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:47:19,652 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:47:19,652 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:47:19,653 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 22:47:19,653 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 22:47:19,653 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:47:19,654 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 22:47:19,654 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:47:19,655 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 22:47:19,655 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:47:19,655 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:47:19,655 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:47:19,655 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 22:47:19,656 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 22:47:19,656 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:47:19,656 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 22:47:19,657 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:47:19,657 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:47:19,657 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:47:19,658 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:47:19,658 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 22:47:19,658 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 22:47:19,660 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:47:19,660 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 22:47:19,661 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:47:19,661 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 22:47:19,661 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:47:19,661 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:47:19,662 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:47:19,662 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 22:47:19,662 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 22:47:19,663 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:47:19,663 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 22:47:19,664 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:47:19,664 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:47:19,664 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:47:19,664 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:47:19,665 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 22:47:19,665 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 22:47:19,670 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:47:19,670 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 22:47:19,671 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:47:19,671 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:47:19,671 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:47:19,672 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:47:19,672 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 22:47:19,673 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 22:47:19,674 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:47:19,674 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 22:47:19,675 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:47:19,675 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:47:19,675 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:47:19,675 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:47:19,676 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 22:47:19,676 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 22:47:19,677 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:47:19,678 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 22:47:19,679 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:47:19,679 INFO L202 nArgumentSynthesizer]: 4 stem disjuncts [2019-11-15 22:47:19,679 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:47:19,679 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:47:19,683 INFO L400 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2019-11-15 22:47:19,683 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 22:47:19,702 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:47:19,703 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 22:47:19,704 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:47:19,704 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:47:19,704 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:47:19,704 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:47:19,705 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 22:47:19,705 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 22:47:19,706 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:47:19,707 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 22:47:19,707 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:47:19,708 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:47:19,708 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:47:19,708 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:47:19,709 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 22:47:19,709 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 22:47:19,710 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:47:19,711 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 22:47:19,712 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:47:19,712 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:47:19,712 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:47:19,712 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:47:19,715 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 22:47:19,716 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 22:47:19,743 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-15 22:47:19,769 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2019-11-15 22:47:19,770 INFO L444 ModelExtractionUtils]: 47 out of 52 variables were initially zero. Simplification set additionally 2 variables to zero. [2019-11-15 22:47:19,770 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-15 22:47:19,772 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-11-15 22:47:19,772 INFO L510 LassoAnalysis]: Proved termination. [2019-11-15 22:47:19,772 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_cstrcspn_~s~0.offset) = 2*ULTIMATE.start_cstrcspn_~s~0.offset + 1 Supporting invariants [] [2019-11-15 22:47:19,912 INFO L297 tatePredicateManager]: 24 out of 24 supporting invariants were superfluous and have been removed [2019-11-15 22:47:19,928 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:47:19,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:47:19,961 INFO L256 TraceCheckSpWp]: Trace formula consists of 125 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-15 22:47:19,962 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:47:19,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:47:19,973 INFO L256 TraceCheckSpWp]: Trace formula consists of 22 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-15 22:47:19,973 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:47:19,994 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:47:19,994 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2019-11-15 22:47:19,995 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 28 states and 36 transitions. cyclomatic complexity: 11 Second operand 3 states. [2019-11-15 22:47:20,030 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 28 states and 36 transitions. cyclomatic complexity: 11. Second operand 3 states. Result 46 states and 58 transitions. Complement of second has 5 states. [2019-11-15 22:47:20,031 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2019-11-15 22:47:20,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-11-15 22:47:20,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 18 transitions. [2019-11-15 22:47:20,032 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 18 transitions. Stem has 15 letters. Loop has 3 letters. [2019-11-15 22:47:20,033 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 22:47:20,033 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-11-15 22:47:20,056 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:47:20,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:47:20,085 INFO L256 TraceCheckSpWp]: Trace formula consists of 125 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-15 22:47:20,086 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:47:20,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:47:20,095 INFO L256 TraceCheckSpWp]: Trace formula consists of 22 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-15 22:47:20,096 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:47:20,105 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:47:20,106 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.1 stem predicates 2 loop predicates [2019-11-15 22:47:20,106 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 28 states and 36 transitions. cyclomatic complexity: 11 Second operand 3 states. [2019-11-15 22:47:20,132 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 28 states and 36 transitions. cyclomatic complexity: 11. Second operand 3 states. Result 46 states and 58 transitions. Complement of second has 5 states. [2019-11-15 22:47:20,136 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2019-11-15 22:47:20,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-11-15 22:47:20,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 18 transitions. [2019-11-15 22:47:20,137 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 18 transitions. Stem has 15 letters. Loop has 3 letters. [2019-11-15 22:47:20,137 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 22:47:20,137 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-11-15 22:47:20,148 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:47:20,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:47:20,174 INFO L256 TraceCheckSpWp]: Trace formula consists of 125 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-15 22:47:20,175 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:47:20,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:47:20,186 INFO L256 TraceCheckSpWp]: Trace formula consists of 22 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-15 22:47:20,187 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:47:20,195 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:47:20,195 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2019-11-15 22:47:20,196 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 28 states and 36 transitions. cyclomatic complexity: 11 Second operand 3 states. [2019-11-15 22:47:20,219 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 28 states and 36 transitions. cyclomatic complexity: 11. Second operand 3 states. Result 45 states and 60 transitions. Complement of second has 4 states. [2019-11-15 22:47:20,222 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2019-11-15 22:47:20,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-11-15 22:47:20,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 27 transitions. [2019-11-15 22:47:20,222 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 27 transitions. Stem has 15 letters. Loop has 3 letters. [2019-11-15 22:47:20,223 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 22:47:20,223 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 27 transitions. Stem has 18 letters. Loop has 3 letters. [2019-11-15 22:47:20,223 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 22:47:20,223 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 27 transitions. Stem has 15 letters. Loop has 6 letters. [2019-11-15 22:47:20,224 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 22:47:20,224 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 45 states and 60 transitions. [2019-11-15 22:47:20,229 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-11-15 22:47:20,229 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 45 states to 0 states and 0 transitions. [2019-11-15 22:47:20,229 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2019-11-15 22:47:20,229 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2019-11-15 22:47:20,229 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2019-11-15 22:47:20,230 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-15 22:47:20,230 INFO L688 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-15 22:47:20,230 INFO L711 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-15 22:47:20,230 INFO L591 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-15 22:47:20,230 INFO L424 BuchiCegarLoop]: ======== Iteration 6============ [2019-11-15 22:47:20,230 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2019-11-15 22:47:20,230 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-11-15 22:47:20,230 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2019-11-15 22:47:20,236 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 15.11 10:47:20 BoogieIcfgContainer [2019-11-15 22:47:20,237 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2019-11-15 22:47:20,237 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-15 22:47:20,237 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-15 22:47:20,238 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-15 22:47:20,238 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 10:41:42" (3/4) ... [2019-11-15 22:47:20,242 INFO L140 WitnessPrinter]: No result that supports witness generation found [2019-11-15 22:47:20,242 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-15 22:47:20,243 INFO L168 Benchmark]: Toolchain (without parser) took 338613.31 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 210.2 MB). Free memory was 948.7 MB in the beginning and 898.2 MB in the end (delta: 50.5 MB). Peak memory consumption was 260.7 MB. Max. memory is 11.5 GB. [2019-11-15 22:47:20,244 INFO L168 Benchmark]: CDTParser took 0.23 ms. Allocated memory is still 1.0 GB. Free memory is still 966.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-15 22:47:20,245 INFO L168 Benchmark]: CACSL2BoogieTranslator took 496.49 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 136.3 MB). Free memory was 947.4 MB in the beginning and 1.1 GB in the end (delta: -167.6 MB). Peak memory consumption was 19.3 MB. Max. memory is 11.5 GB. [2019-11-15 22:47:20,245 INFO L168 Benchmark]: Boogie Procedure Inliner took 44.16 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: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2019-11-15 22:47:20,246 INFO L168 Benchmark]: Boogie Preprocessor took 28.24 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: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 11.5 GB. [2019-11-15 22:47:20,247 INFO L168 Benchmark]: RCFGBuilder took 419.27 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 22.4 MB). Peak memory consumption was 22.4 MB. Max. memory is 11.5 GB. [2019-11-15 22:47:20,248 INFO L168 Benchmark]: BuchiAutomizer took 337616.69 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 73.9 MB). Free memory was 1.1 GB in the beginning and 898.2 MB in the end (delta: 190.3 MB). Peak memory consumption was 264.2 MB. Max. memory is 11.5 GB. [2019-11-15 22:47:20,248 INFO L168 Benchmark]: Witness Printer took 4.82 ms. Allocated memory is still 1.2 GB. Free memory is still 898.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-15 22:47:20,252 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.23 ms. Allocated memory is still 1.0 GB. Free memory is still 966.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 496.49 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 136.3 MB). Free memory was 947.4 MB in the beginning and 1.1 GB in the end (delta: -167.6 MB). Peak memory consumption was 19.3 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 44.16 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: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 28.24 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: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 11.5 GB. * RCFGBuilder took 419.27 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 22.4 MB). Peak memory consumption was 22.4 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 337616.69 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 73.9 MB). Free memory was 1.1 GB in the beginning and 898.2 MB in the end (delta: 190.3 MB). Peak memory consumption was 264.2 MB. Max. memory is 11.5 GB. * Witness Printer took 4.82 ms. Allocated memory is still 1.2 GB. Free memory is still 898.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * 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 2 * sc1 + 1 and consists of 3 locations. One deterministic module has affine ranking function 2 * s + 1 and consists of 3 locations. One nondeterministic module has affine ranking function 2 * s + 1 and consists of 3 locations. 2 modules have a trivial ranking function, the largest among these consists of 13 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 337.5s and 6 iterations. TraceHistogramMax:2. Analysis of lassos took 132.4s. Construction of modules took 12.1s. Büchi inclusion checks took 192.7s. Highest rank in rank-based complementation 3. Minimization of det autom 2. Minimization of nondet autom 3. Automata minimization 0.0s AutomataMinimizationTime, 4 MinimizatonAttempts, 21 StatesRemovedByMinimization, 2 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 28 states and ocurred in iteration 4. Nontrivial modules had stage [2, 0, 1, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 117 SDtfs, 151 SDslu, 94 SDs, 0 SdLazy, 142 SolverSat, 27 SolverUnsat, 1 SolverUnknown, 0 SolverNotchecked, 12.1s Time LassoAnalysisResults: nont0 unkn0 SFLI1 SFLT0 conc1 concLT0 SILN0 SILU0 SILI0 SILT0 lasso3 LassoPreprocessingBenchmarks: Lassos: inital405 mio100 ax100 hnf99 lsp92 ukn77 mio100 lsp42 div114 bol100 ite100 ukn100 eq179 hnf77 smp93 dnf755 smp33 tf100 neg96 sie112 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 70ms VariablesStem: 10 VariablesLoop: 6 DisjunctsStem: 4 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 12 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...