./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/termination-memory-alloca/cstrspn-alloca-2.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version cad46833 Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_ff5aac58-efbf-458f-b252-f1120c0bae21/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_ff5aac58-efbf-458f-b252-f1120c0bae21/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_ff5aac58-efbf-458f-b252-f1120c0bae21/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_ff5aac58-efbf-458f-b252-f1120c0bae21/bin/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/termination-memory-alloca/cstrspn-alloca-2.i -s /tmp/vcloud-vcloud-master/worker/run_dir_ff5aac58-efbf-458f-b252-f1120c0bae21/bin/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_ff5aac58-efbf-458f-b252-f1120c0bae21/bin/uautomizer --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash 5bb7c0b0be083ae28de17688b83fb766e3f101f5 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-cad4683 [2019-11-15 22:08:41,562 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-15 22:08:41,564 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-15 22:08:41,574 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-15 22:08:41,574 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-15 22:08:41,575 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-15 22:08:41,576 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-15 22:08:41,578 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-15 22:08:41,587 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-15 22:08:41,590 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-15 22:08:41,591 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-15 22:08:41,592 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-15 22:08:41,592 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-15 22:08:41,593 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-15 22:08:41,593 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-15 22:08:41,594 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-15 22:08:41,595 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-15 22:08:41,595 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-15 22:08:41,597 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-15 22:08:41,598 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-15 22:08:41,600 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-15 22:08:41,600 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-15 22:08:41,601 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-15 22:08:41,605 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-15 22:08:41,610 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-15 22:08:41,610 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-15 22:08:41,610 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-15 22:08:41,611 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-15 22:08:41,612 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-15 22:08:41,614 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-15 22:08:41,614 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-15 22:08:41,614 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-15 22:08:41,615 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-15 22:08:41,615 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-15 22:08:41,618 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-15 22:08:41,618 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-15 22:08:41,619 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-15 22:08:41,619 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-15 22:08:41,620 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-15 22:08:41,622 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-15 22:08:41,623 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-15 22:08:41,624 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_ff5aac58-efbf-458f-b252-f1120c0bae21/bin/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf [2019-11-15 22:08:41,650 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-15 22:08:41,650 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-15 22:08:41,651 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-15 22:08:41,651 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-15 22:08:41,651 INFO L138 SettingsManager]: * Use SBE=true [2019-11-15 22:08:41,652 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-11-15 22:08:41,652 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-11-15 22:08:41,652 INFO L138 SettingsManager]: * Use old map elimination=false [2019-11-15 22:08:41,652 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2019-11-15 22:08:41,653 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2019-11-15 22:08:41,653 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-11-15 22:08:41,653 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-15 22:08:41,653 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-11-15 22:08:41,653 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-15 22:08:41,654 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-15 22:08:41,654 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-11-15 22:08:41,654 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-11-15 22:08:41,654 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-11-15 22:08:41,654 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-15 22:08:41,655 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-11-15 22:08:41,655 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-15 22:08:41,655 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-11-15 22:08:41,655 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-15 22:08:41,655 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-15 22:08:41,656 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-11-15 22:08:41,656 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-15 22:08:41,656 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-15 22:08:41,656 INFO L138 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-11-15 22:08:41,657 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-11-15 22:08:41,657 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_ff5aac58-efbf-458f-b252-f1120c0bae21/bin/uautomizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(F end) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 5bb7c0b0be083ae28de17688b83fb766e3f101f5 [2019-11-15 22:08:41,701 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-15 22:08:41,714 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-15 22:08:41,718 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-15 22:08:41,720 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-15 22:08:41,721 INFO L275 PluginConnector]: CDTParser initialized [2019-11-15 22:08:41,722 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_ff5aac58-efbf-458f-b252-f1120c0bae21/bin/uautomizer/../../sv-benchmarks/c/termination-memory-alloca/cstrspn-alloca-2.i [2019-11-15 22:08:41,778 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_ff5aac58-efbf-458f-b252-f1120c0bae21/bin/uautomizer/data/d0aa5986b/30d1bc27bea5473f846399587980ddbc/FLAGc551a25c5 [2019-11-15 22:08:42,307 INFO L306 CDTParser]: Found 1 translation units. [2019-11-15 22:08:42,308 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_ff5aac58-efbf-458f-b252-f1120c0bae21/sv-benchmarks/c/termination-memory-alloca/cstrspn-alloca-2.i [2019-11-15 22:08:42,326 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_ff5aac58-efbf-458f-b252-f1120c0bae21/bin/uautomizer/data/d0aa5986b/30d1bc27bea5473f846399587980ddbc/FLAGc551a25c5 [2019-11-15 22:08:42,750 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_ff5aac58-efbf-458f-b252-f1120c0bae21/bin/uautomizer/data/d0aa5986b/30d1bc27bea5473f846399587980ddbc [2019-11-15 22:08:42,752 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-15 22:08:42,753 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-15 22:08:42,754 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-15 22:08:42,754 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-15 22:08:42,758 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-15 22:08:42,758 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 10:08:42" (1/1) ... [2019-11-15 22:08:42,761 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@584dbc2a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:08:42, skipping insertion in model container [2019-11-15 22:08:42,761 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 10:08:42" (1/1) ... [2019-11-15 22:08:42,767 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-15 22:08:42,821 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-15 22:08:43,179 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-15 22:08:43,188 INFO L188 MainTranslator]: Completed pre-run [2019-11-15 22:08:43,235 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-15 22:08:43,281 INFO L192 MainTranslator]: Completed translation [2019-11-15 22:08:43,281 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:08:43 WrapperNode [2019-11-15 22:08:43,282 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-15 22:08:43,282 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-15 22:08:43,283 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-15 22:08:43,283 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-15 22:08:43,290 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:08:43" (1/1) ... [2019-11-15 22:08:43,303 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:08:43" (1/1) ... [2019-11-15 22:08:43,323 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-15 22:08:43,326 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-15 22:08:43,326 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-15 22:08:43,326 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-15 22:08:43,332 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:08:43" (1/1) ... [2019-11-15 22:08:43,333 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:08:43" (1/1) ... [2019-11-15 22:08:43,337 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:08:43" (1/1) ... [2019-11-15 22:08:43,337 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:08:43" (1/1) ... [2019-11-15 22:08:43,345 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:08:43" (1/1) ... [2019-11-15 22:08:43,349 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:08:43" (1/1) ... [2019-11-15 22:08:43,351 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:08:43" (1/1) ... [2019-11-15 22:08:43,354 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-15 22:08:43,354 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-15 22:08:43,354 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-15 22:08:43,354 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-15 22:08:43,355 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:08:43" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_ff5aac58-efbf-458f-b252-f1120c0bae21/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:08:43,424 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-11-15 22:08:43,424 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-11-15 22:08:43,424 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-15 22:08:43,424 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-15 22:08:43,424 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-15 22:08:43,424 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-15 22:08:43,743 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-15 22:08:43,744 INFO L284 CfgBuilder]: Removed 8 assume(true) statements. [2019-11-15 22:08:43,744 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 10:08:43 BoogieIcfgContainer [2019-11-15 22:08:43,745 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-15 22:08:43,745 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-11-15 22:08:43,745 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-11-15 22:08:43,748 INFO L275 PluginConnector]: BuchiAutomizer initialized [2019-11-15 22:08:43,749 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-15 22:08:43,749 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 15.11 10:08:42" (1/3) ... [2019-11-15 22:08:43,750 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@342ed84a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 15.11 10:08:43, skipping insertion in model container [2019-11-15 22:08:43,750 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-15 22:08:43,750 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:08:43" (2/3) ... [2019-11-15 22:08:43,750 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@342ed84a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 15.11 10:08:43, skipping insertion in model container [2019-11-15 22:08:43,750 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-15 22:08:43,750 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 10:08:43" (3/3) ... [2019-11-15 22:08:43,752 INFO L371 chiAutomizerObserver]: Analyzing ICFG cstrspn-alloca-2.i [2019-11-15 22:08:43,793 INFO L356 BuchiCegarLoop]: Interprodecural is true [2019-11-15 22:08:43,794 INFO L357 BuchiCegarLoop]: Hoare is false [2019-11-15 22:08:43,794 INFO L358 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-11-15 22:08:43,794 INFO L359 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-15 22:08:43,794 INFO L360 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-15 22:08:43,794 INFO L361 BuchiCegarLoop]: Difference is false [2019-11-15 22:08:43,794 INFO L362 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-15 22:08:43,794 INFO L365 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-11-15 22:08:43,806 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states. [2019-11-15 22:08:43,823 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2019-11-15 22:08:43,823 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 22:08:43,824 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 22:08:43,830 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2019-11-15 22:08:43,830 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2019-11-15 22:08:43,830 INFO L424 BuchiCegarLoop]: ======== Iteration 1============ [2019-11-15 22:08:43,830 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states. [2019-11-15 22:08:43,832 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2019-11-15 22:08:43,832 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 22:08:43,832 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 22:08:43,832 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2019-11-15 22:08:43,833 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2019-11-15 22:08:43,840 INFO L791 eck$LassoCheckResult]: Stem: 11#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 10#L-1true havoc main_#res;havoc main_#t~nondet10, main_#t~nondet11, main_#t~malloc12.base, main_#t~malloc12.offset, main_#t~malloc13.base, main_#t~malloc13.offset, main_#t~ret14, main_~length1~0, main_~length2~0, main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;main_~length1~0 := main_#t~nondet10;havoc main_#t~nondet10;main_~length2~0 := main_#t~nondet11;havoc main_#t~nondet11; 7#L565true assume !(main_~length1~0 < 1); 12#L565-2true assume !(main_~length2~0 < 1); 6#L568-1true call main_#t~malloc12.base, main_#t~malloc12.offset := #Ultimate.allocOnStack(main_~length1~0);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc12.base, main_#t~malloc12.offset;call main_#t~malloc13.base, main_#t~malloc13.offset := #Ultimate.allocOnStack(main_~length2~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc13.base, main_#t~malloc13.offset;call write~int(0, main_~nondetString1~0.base, main_~nondetString1~0.offset + (main_~length1~0 - 1), 1);call write~int(0, main_~nondetString2~0.base, main_~nondetString2~0.offset + (main_~length2~0 - 1), 1);cstrspn_#in~s1.base, cstrspn_#in~s1.offset, cstrspn_#in~s2.base, cstrspn_#in~s2.offset := main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;havoc cstrspn_#res;havoc cstrspn_#t~mem4, cstrspn_#t~post8.base, cstrspn_#t~post8.offset, cstrspn_#t~mem5, cstrspn_#t~mem6, cstrspn_#t~short7, cstrspn_#t~mem9, cstrspn_#t~post2.base, cstrspn_#t~post2.offset, cstrspn_#t~mem3, cstrspn_~s1.base, cstrspn_~s1.offset, cstrspn_~s2.base, cstrspn_~s2.offset, cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset, cstrspn_~s~0.base, cstrspn_~s~0.offset, cstrspn_~c~0;cstrspn_~s1.base, cstrspn_~s1.offset := cstrspn_#in~s1.base, cstrspn_#in~s1.offset;cstrspn_~s2.base, cstrspn_~s2.offset := cstrspn_#in~s2.base, cstrspn_#in~s2.offset;havoc cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset;havoc cstrspn_~s~0.base, cstrspn_~s~0.offset;havoc cstrspn_~c~0;cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset := cstrspn_~s1.base, cstrspn_~s1.offset; 3#L552-4true [2019-11-15 22:08:43,840 INFO L793 eck$LassoCheckResult]: Loop: 3#L552-4true call cstrspn_#t~mem3 := read~int(cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset, 1); 14#L552-1true assume !!(0 != cstrspn_#t~mem3);havoc cstrspn_#t~mem3;cstrspn_~s~0.base, cstrspn_~s~0.offset := cstrspn_~s2.base, cstrspn_~s2.offset;call cstrspn_#t~mem4 := read~int(cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset, 1);cstrspn_~c~0 := cstrspn_#t~mem4;havoc cstrspn_#t~mem4; 16#L555-5true assume !true; 19#L555-6true call cstrspn_#t~mem9 := read~int(cstrspn_~s~0.base, cstrspn_~s~0.offset, 1); 5#L557true assume !(cstrspn_#t~mem9 != cstrspn_~c~0);havoc cstrspn_#t~mem9; 20#L552-3true cstrspn_#t~post2.base, cstrspn_#t~post2.offset := cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset;cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset := cstrspn_#t~post2.base, 1 + cstrspn_#t~post2.offset;havoc cstrspn_#t~post2.base, cstrspn_#t~post2.offset; 3#L552-4true [2019-11-15 22:08:43,845 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:08:43,845 INFO L82 PathProgramCache]: Analyzing trace with hash 28695878, now seen corresponding path program 1 times [2019-11-15 22:08:43,850 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:08:43,850 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2072528297] [2019-11-15 22:08:43,851 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:08:43,851 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:08:43,851 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:08:43,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:08:43,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:08:43,984 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 22:08:43,986 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:08:43,986 INFO L82 PathProgramCache]: Analyzing trace with hash 1454917130, now seen corresponding path program 1 times [2019-11-15 22:08:43,986 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:08:43,986 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [305981636] [2019-11-15 22:08:43,986 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:08:43,987 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:08:43,987 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:08:43,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:08:44,034 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:08:44,034 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [305981636] [2019-11-15 22:08:44,035 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:08:44,035 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-15 22:08:44,035 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [147783117] [2019-11-15 22:08:44,039 INFO L808 eck$LassoCheckResult]: loop already infeasible [2019-11-15 22:08:44,040 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:08:44,050 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-11-15 22:08:44,050 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-11-15 22:08:44,051 INFO L87 Difference]: Start difference. First operand 18 states. Second operand 2 states. [2019-11-15 22:08:44,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:08:44,056 INFO L93 Difference]: Finished difference Result 18 states and 23 transitions. [2019-11-15 22:08:44,057 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-11-15 22:08:44,058 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 18 states and 23 transitions. [2019-11-15 22:08:44,059 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2019-11-15 22:08:44,062 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 18 states to 13 states and 17 transitions. [2019-11-15 22:08:44,063 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 13 [2019-11-15 22:08:44,063 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 13 [2019-11-15 22:08:44,064 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 17 transitions. [2019-11-15 22:08:44,064 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-15 22:08:44,065 INFO L688 BuchiCegarLoop]: Abstraction has 13 states and 17 transitions. [2019-11-15 22:08:44,077 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states and 17 transitions. [2019-11-15 22:08:44,085 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2019-11-15 22:08:44,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2019-11-15 22:08:44,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 17 transitions. [2019-11-15 22:08:44,087 INFO L711 BuchiCegarLoop]: Abstraction has 13 states and 17 transitions. [2019-11-15 22:08:44,087 INFO L591 BuchiCegarLoop]: Abstraction has 13 states and 17 transitions. [2019-11-15 22:08:44,087 INFO L424 BuchiCegarLoop]: ======== Iteration 2============ [2019-11-15 22:08:44,087 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 13 states and 17 transitions. [2019-11-15 22:08:44,088 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2019-11-15 22:08:44,088 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 22:08:44,088 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 22:08:44,089 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2019-11-15 22:08:44,089 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:08:44,089 INFO L791 eck$LassoCheckResult]: Stem: 54#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 53#L-1 havoc main_#res;havoc main_#t~nondet10, main_#t~nondet11, main_#t~malloc12.base, main_#t~malloc12.offset, main_#t~malloc13.base, main_#t~malloc13.offset, main_#t~ret14, main_~length1~0, main_~length2~0, main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;main_~length1~0 := main_#t~nondet10;havoc main_#t~nondet10;main_~length2~0 := main_#t~nondet11;havoc main_#t~nondet11; 49#L565 assume !(main_~length1~0 < 1); 50#L565-2 assume !(main_~length2~0 < 1); 48#L568-1 call main_#t~malloc12.base, main_#t~malloc12.offset := #Ultimate.allocOnStack(main_~length1~0);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc12.base, main_#t~malloc12.offset;call main_#t~malloc13.base, main_#t~malloc13.offset := #Ultimate.allocOnStack(main_~length2~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc13.base, main_#t~malloc13.offset;call write~int(0, main_~nondetString1~0.base, main_~nondetString1~0.offset + (main_~length1~0 - 1), 1);call write~int(0, main_~nondetString2~0.base, main_~nondetString2~0.offset + (main_~length2~0 - 1), 1);cstrspn_#in~s1.base, cstrspn_#in~s1.offset, cstrspn_#in~s2.base, cstrspn_#in~s2.offset := main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;havoc cstrspn_#res;havoc cstrspn_#t~mem4, cstrspn_#t~post8.base, cstrspn_#t~post8.offset, cstrspn_#t~mem5, cstrspn_#t~mem6, cstrspn_#t~short7, cstrspn_#t~mem9, cstrspn_#t~post2.base, cstrspn_#t~post2.offset, cstrspn_#t~mem3, cstrspn_~s1.base, cstrspn_~s1.offset, cstrspn_~s2.base, cstrspn_~s2.offset, cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset, cstrspn_~s~0.base, cstrspn_~s~0.offset, cstrspn_~c~0;cstrspn_~s1.base, cstrspn_~s1.offset := cstrspn_#in~s1.base, cstrspn_#in~s1.offset;cstrspn_~s2.base, cstrspn_~s2.offset := cstrspn_#in~s2.base, cstrspn_#in~s2.offset;havoc cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset;havoc cstrspn_~s~0.base, cstrspn_~s~0.offset;havoc cstrspn_~c~0;cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset := cstrspn_~s1.base, cstrspn_~s1.offset; 44#L552-4 [2019-11-15 22:08:44,090 INFO L793 eck$LassoCheckResult]: Loop: 44#L552-4 call cstrspn_#t~mem3 := read~int(cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset, 1); 45#L552-1 assume !!(0 != cstrspn_#t~mem3);havoc cstrspn_#t~mem3;cstrspn_~s~0.base, cstrspn_~s~0.offset := cstrspn_~s2.base, cstrspn_~s2.offset;call cstrspn_#t~mem4 := read~int(cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset, 1);cstrspn_~c~0 := cstrspn_#t~mem4;havoc cstrspn_#t~mem4; 56#L555-5 call cstrspn_#t~mem5 := read~int(cstrspn_~s~0.base, cstrspn_~s~0.offset, 1);cstrspn_#t~short7 := 0 != cstrspn_#t~mem5; 51#L555-1 assume cstrspn_#t~short7;call cstrspn_#t~mem6 := read~int(cstrspn_~s~0.base, cstrspn_~s~0.offset, 1);cstrspn_#t~short7 := cstrspn_#t~mem6 != (if cstrspn_~c~0 % 256 <= 127 then cstrspn_~c~0 % 256 else cstrspn_~c~0 % 256 - 256); 52#L555-3 assume !cstrspn_#t~short7;havoc cstrspn_#t~short7;havoc cstrspn_#t~mem6;havoc cstrspn_#t~mem5; 55#L555-6 call cstrspn_#t~mem9 := read~int(cstrspn_~s~0.base, cstrspn_~s~0.offset, 1); 46#L557 assume !(cstrspn_#t~mem9 != cstrspn_~c~0);havoc cstrspn_#t~mem9; 47#L552-3 cstrspn_#t~post2.base, cstrspn_#t~post2.offset := cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset;cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset := cstrspn_#t~post2.base, 1 + cstrspn_#t~post2.offset;havoc cstrspn_#t~post2.base, cstrspn_#t~post2.offset; 44#L552-4 [2019-11-15 22:08:44,090 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:08:44,090 INFO L82 PathProgramCache]: Analyzing trace with hash 28695878, now seen corresponding path program 2 times [2019-11-15 22:08:44,090 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:08:44,090 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [532701205] [2019-11-15 22:08:44,091 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:08:44,091 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:08:44,091 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:08:44,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:08:44,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:08:44,129 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 22:08:44,129 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:08:44,129 INFO L82 PathProgramCache]: Analyzing trace with hash 1927396657, now seen corresponding path program 1 times [2019-11-15 22:08:44,129 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:08:44,130 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1571421239] [2019-11-15 22:08:44,130 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:08:44,130 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:08:44,130 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:08:44,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:08:44,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:08:44,160 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 22:08:44,161 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:08:44,161 INFO L82 PathProgramCache]: Analyzing trace with hash -102988426, now seen corresponding path program 1 times [2019-11-15 22:08:44,161 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:08:44,161 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [962610833] [2019-11-15 22:08:44,161 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:08:44,162 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:08:44,162 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:08:44,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:08:44,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:08:44,234 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 22:08:44,473 WARN L191 SmtUtils]: Spent 234.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 58 [2019-11-15 22:08:44,748 WARN L191 SmtUtils]: Spent 248.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 49 [2019-11-15 22:08:45,065 WARN L191 SmtUtils]: Spent 314.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 87 [2019-11-15 22:08:45,195 WARN L191 SmtUtils]: Spent 127.00 ms on a formula simplification that was a NOOP. DAG size: 81 [2019-11-15 22:08:45,207 INFO L210 LassoAnalysis]: Preferences: [2019-11-15 22:08:45,208 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-11-15 22:08:45,208 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-15 22:08:45,208 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-11-15 22:08:45,215 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-11-15 22:08:45,215 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 22:08:45,216 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-15 22:08:45,216 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-11-15 22:08:45,216 INFO L131 ssoRankerPreferences]: Filename of dumped script: cstrspn-alloca-2.i_Iteration2_Lasso [2019-11-15 22:08:45,216 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-15 22:08:45,216 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-15 22:08:45,242 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:08:45,248 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:08:45,252 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:08:45,254 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:08:45,256 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:08:45,260 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:08:45,262 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:08:45,265 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:08:45,274 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:08:45,279 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:08:45,283 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:08:45,290 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:08:45,292 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:08:45,295 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:08:45,298 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:08:45,300 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:08:45,303 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:08:45,685 WARN L191 SmtUtils]: Spent 244.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 67 [2019-11-15 22:08:45,908 WARN L191 SmtUtils]: Spent 196.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 56 [2019-11-15 22:08:45,908 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:08:45,912 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:08:45,914 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:08:45,916 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:08:46,724 WARN L191 SmtUtils]: Spent 452.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 40 [2019-11-15 22:08:47,008 WARN L191 SmtUtils]: Spent 176.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 29 [2019-11-15 22:08:47,022 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-15 22:08:47,027 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-11-15 22:08:47,029 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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:08:47,031 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:08:47,031 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 22:08:47,031 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:08:47,032 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:08:47,032 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:08:47,034 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 22:08:47,034 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 22:08:47,036 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:08:47,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:08:47,037 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:08:47,037 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:08:47,037 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:08:47,038 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:08:47,040 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 22:08:47,040 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 22:08:47,043 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:08:47,044 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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:08:47,044 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:08:47,044 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 22:08:47,045 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:08:47,045 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:08:47,045 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:08:47,045 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 22:08:47,046 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 22:08:47,046 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:08:47,047 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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:08:47,047 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:08:47,048 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 22:08:47,048 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:08:47,048 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:08:47,048 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:08:47,049 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 22:08:47,049 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 22:08:47,049 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:08:47,050 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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:08:47,051 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:08:47,051 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 22:08:47,051 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:08:47,051 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:08:47,051 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:08:47,052 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 22:08:47,052 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 22:08:47,053 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:08:47,053 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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:08:47,054 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:08:47,054 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 22:08:47,054 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:08:47,054 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:08:47,054 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:08:47,055 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 22:08:47,055 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 22:08:47,056 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:08:47,056 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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:08:47,057 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:08:47,057 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 22:08:47,057 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:08:47,057 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:08:47,058 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:08:47,058 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 22:08:47,058 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 22:08:47,059 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:08:47,059 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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:08:47,060 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:08:47,060 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:08:47,060 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:08:47,061 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:08:47,062 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 22:08:47,063 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 22:08:47,066 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:08:47,067 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 22:08:47,067 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:08:47,068 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 22:08:47,068 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:08:47,068 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:08:47,068 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:08:47,069 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 22:08:47,069 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 22:08:47,070 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:08:47,070 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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:08:47,071 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:08:47,071 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:08:47,071 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:08:47,071 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:08:47,073 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 22:08:47,073 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 22:08:47,076 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:08:47,077 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 22:08:47,077 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:08:47,077 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 22:08:47,078 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:08:47,078 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:08:47,078 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:08:47,078 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 22:08:47,079 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 22:08:47,079 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:08:47,080 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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:08:47,080 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:08:47,080 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 22:08:47,081 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:08:47,081 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:08:47,081 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:08:47,081 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 22:08:47,082 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 22:08:47,082 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:08:47,083 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 22:08:47,083 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:08:47,083 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 22:08:47,084 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:08:47,084 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:08:47,084 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:08:47,084 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 22:08:47,085 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 22:08:47,086 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:08:47,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:08:47,086 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:08:47,087 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:08:47,087 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:08:47,087 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:08:47,089 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 22:08:47,089 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 22:08:47,091 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:08:47,092 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 22:08:47,092 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:08:47,092 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 22:08:47,093 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:08:47,093 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:08:47,093 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:08:47,093 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 22:08:47,094 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 22:08:47,094 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:08:47,095 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 22:08:47,095 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:08:47,096 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 22:08:47,096 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:08:47,096 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:08:47,096 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:08:47,097 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 22:08:47,097 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 22:08:47,098 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:08:47,098 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 22:08:47,099 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:08:47,099 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:08:47,099 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:08:47,099 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:08:47,101 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 22:08:47,101 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 22:08:47,103 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:08:47,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:08:47,105 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:08:47,105 INFO L202 nArgumentSynthesizer]: 4 stem disjuncts [2019-11-15 22:08:47,105 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:08:47,105 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:08:47,113 INFO L400 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2019-11-15 22:08:47,113 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 22:08:47,161 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:08:47,169 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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:08:47,171 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:08:47,173 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:08:47,173 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:08:47,173 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:08:47,180 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 22:08:47,180 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 22:08:47,190 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:08:47,204 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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:08:47,205 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:08:47,205 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 22:08:47,205 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:08:47,206 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:08:47,206 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:08:47,206 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 22:08:47,207 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 22:08:47,208 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:08:47,214 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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:08:47,214 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:08:47,214 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:08:47,214 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:08:47,215 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:08:47,215 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 22:08:47,215 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 22:08:47,218 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:08:47,222 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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:08:47,223 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:08:47,224 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:08:47,224 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:08:47,224 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:08:47,226 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 22:08:47,226 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 22:08:47,247 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:08:47,247 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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:08:47,249 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:08:47,249 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:08:47,249 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:08:47,249 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:08:47,252 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 22:08:47,252 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 22:08:47,315 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-15 22:08:47,346 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-11-15 22:08:47,346 INFO L444 ModelExtractionUtils]: 23 out of 28 variables were initially zero. Simplification set additionally 2 variables to zero. [2019-11-15 22:08:47,348 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-15 22:08:47,349 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-11-15 22:08:47,350 INFO L510 LassoAnalysis]: Proved termination. [2019-11-15 22:08:47,351 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_cstrspn_~sc1~0.base)_1, ULTIMATE.start_cstrspn_~sc1~0.offset) = 1*v_rep(select #length ULTIMATE.start_cstrspn_~sc1~0.base)_1 - 1*ULTIMATE.start_cstrspn_~sc1~0.offset Supporting invariants [] [2019-11-15 22:08:47,396 INFO L297 tatePredicateManager]: 9 out of 9 supporting invariants were superfluous and have been removed [2019-11-15 22:08:47,402 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2019-11-15 22:08:47,415 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:08:47,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:08:47,439 INFO L256 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-15 22:08:47,441 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:08:47,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:08:47,463 INFO L256 TraceCheckSpWp]: Trace formula consists of 47 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-15 22:08:47,464 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:08:47,477 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:08:47,479 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:08:47,480 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 13 states and 17 transitions. cyclomatic complexity: 5 Second operand 3 states. [2019-11-15 22:08:47,534 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:08:47,535 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:08:47,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-11-15 22:08:47,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 17 transitions. [2019-11-15 22:08:47,537 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 17 transitions. Stem has 5 letters. Loop has 8 letters. [2019-11-15 22:08:47,538 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 22:08:47,539 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 17 transitions. Stem has 13 letters. Loop has 8 letters. [2019-11-15 22:08:47,539 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 22:08:47,539 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 17 transitions. Stem has 5 letters. Loop has 16 letters. [2019-11-15 22:08:47,539 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 22:08:47,540 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 21 states and 28 transitions. [2019-11-15 22:08:47,541 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-11-15 22:08:47,541 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 21 states to 18 states and 25 transitions. [2019-11-15 22:08:47,541 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9 [2019-11-15 22:08:47,542 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2019-11-15 22:08:47,542 INFO L73 IsDeterministic]: Start isDeterministic. Operand 18 states and 25 transitions. [2019-11-15 22:08:47,542 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-15 22:08:47,542 INFO L688 BuchiCegarLoop]: Abstraction has 18 states and 25 transitions. [2019-11-15 22:08:47,542 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states and 25 transitions. [2019-11-15 22:08:47,543 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2019-11-15 22:08:47,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2019-11-15 22:08:47,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 25 transitions. [2019-11-15 22:08:47,544 INFO L711 BuchiCegarLoop]: Abstraction has 18 states and 25 transitions. [2019-11-15 22:08:47,544 INFO L591 BuchiCegarLoop]: Abstraction has 18 states and 25 transitions. [2019-11-15 22:08:47,544 INFO L424 BuchiCegarLoop]: ======== Iteration 3============ [2019-11-15 22:08:47,544 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states and 25 transitions. [2019-11-15 22:08:47,545 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-11-15 22:08:47,545 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 22:08:47,545 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 22:08:47,545 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:08:47,545 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-11-15 22:08:47,549 INFO L791 eck$LassoCheckResult]: Stem: 187#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 186#L-1 havoc main_#res;havoc main_#t~nondet10, main_#t~nondet11, main_#t~malloc12.base, main_#t~malloc12.offset, main_#t~malloc13.base, main_#t~malloc13.offset, main_#t~ret14, main_~length1~0, main_~length2~0, main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;main_~length1~0 := main_#t~nondet10;havoc main_#t~nondet10;main_~length2~0 := main_#t~nondet11;havoc main_#t~nondet11; 180#L565 assume !(main_~length1~0 < 1); 181#L565-2 assume !(main_~length2~0 < 1); 179#L568-1 call main_#t~malloc12.base, main_#t~malloc12.offset := #Ultimate.allocOnStack(main_~length1~0);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc12.base, main_#t~malloc12.offset;call main_#t~malloc13.base, main_#t~malloc13.offset := #Ultimate.allocOnStack(main_~length2~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc13.base, main_#t~malloc13.offset;call write~int(0, main_~nondetString1~0.base, main_~nondetString1~0.offset + (main_~length1~0 - 1), 1);call write~int(0, main_~nondetString2~0.base, main_~nondetString2~0.offset + (main_~length2~0 - 1), 1);cstrspn_#in~s1.base, cstrspn_#in~s1.offset, cstrspn_#in~s2.base, cstrspn_#in~s2.offset := main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;havoc cstrspn_#res;havoc cstrspn_#t~mem4, cstrspn_#t~post8.base, cstrspn_#t~post8.offset, cstrspn_#t~mem5, cstrspn_#t~mem6, cstrspn_#t~short7, cstrspn_#t~mem9, cstrspn_#t~post2.base, cstrspn_#t~post2.offset, cstrspn_#t~mem3, cstrspn_~s1.base, cstrspn_~s1.offset, cstrspn_~s2.base, cstrspn_~s2.offset, cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset, cstrspn_~s~0.base, cstrspn_~s~0.offset, cstrspn_~c~0;cstrspn_~s1.base, cstrspn_~s1.offset := cstrspn_#in~s1.base, cstrspn_#in~s1.offset;cstrspn_~s2.base, cstrspn_~s2.offset := cstrspn_#in~s2.base, cstrspn_#in~s2.offset;havoc cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset;havoc cstrspn_~s~0.base, cstrspn_~s~0.offset;havoc cstrspn_~c~0;cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset := cstrspn_~s1.base, cstrspn_~s1.offset; 173#L552-4 call cstrspn_#t~mem3 := read~int(cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset, 1); 175#L552-1 assume !!(0 != cstrspn_#t~mem3);havoc cstrspn_#t~mem3;cstrspn_~s~0.base, cstrspn_~s~0.offset := cstrspn_~s2.base, cstrspn_~s2.offset;call cstrspn_#t~mem4 := read~int(cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset, 1);cstrspn_~c~0 := cstrspn_#t~mem4;havoc cstrspn_#t~mem4; 188#L555-5 [2019-11-15 22:08:47,549 INFO L793 eck$LassoCheckResult]: Loop: 188#L555-5 call cstrspn_#t~mem5 := read~int(cstrspn_~s~0.base, cstrspn_~s~0.offset, 1);cstrspn_#t~short7 := 0 != cstrspn_#t~mem5; 182#L555-1 assume cstrspn_#t~short7;call cstrspn_#t~mem6 := read~int(cstrspn_~s~0.base, cstrspn_~s~0.offset, 1);cstrspn_#t~short7 := cstrspn_#t~mem6 != (if cstrspn_~c~0 % 256 <= 127 then cstrspn_~c~0 % 256 else cstrspn_~c~0 % 256 - 256); 183#L555-3 assume !!cstrspn_#t~short7;havoc cstrspn_#t~short7;havoc cstrspn_#t~mem6;havoc cstrspn_#t~mem5;cstrspn_#t~post8.base, cstrspn_#t~post8.offset := cstrspn_~s~0.base, cstrspn_~s~0.offset;cstrspn_~s~0.base, cstrspn_~s~0.offset := cstrspn_#t~post8.base, 1 + cstrspn_#t~post8.offset;havoc cstrspn_#t~post8.base, cstrspn_#t~post8.offset; 188#L555-5 [2019-11-15 22:08:47,549 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:08:47,550 INFO L82 PathProgramCache]: Analyzing trace with hash 1806935595, now seen corresponding path program 1 times [2019-11-15 22:08:47,550 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:08:47,550 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [844250991] [2019-11-15 22:08:47,550 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:08:47,550 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:08:47,551 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:08:47,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:08:47,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:08:47,599 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 22:08:47,602 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:08:47,602 INFO L82 PathProgramCache]: Analyzing trace with hash 58692, now seen corresponding path program 1 times [2019-11-15 22:08:47,603 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:08:47,603 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [220144819] [2019-11-15 22:08:47,603 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:08:47,603 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:08:47,603 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:08:47,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:08:47,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:08:47,622 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 22:08:47,623 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:08:47,624 INFO L82 PathProgramCache]: Analyzing trace with hash 1593218778, now seen corresponding path program 1 times [2019-11-15 22:08:47,624 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:08:47,624 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1220102920] [2019-11-15 22:08:47,624 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:08:47,624 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:08:47,624 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:08:47,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:08:47,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:08:47,660 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 22:08:47,787 WARN L191 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 38 [2019-11-15 22:08:47,908 WARN L191 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 36 DAG size of output: 35 [2019-11-15 22:08:48,223 WARN L191 SmtUtils]: Spent 313.00 ms on a formula simplification. DAG size of input: 117 DAG size of output: 100 [2019-11-15 22:08:48,326 WARN L191 SmtUtils]: Spent 100.00 ms on a formula simplification that was a NOOP. DAG size: 92 [2019-11-15 22:08:48,329 INFO L210 LassoAnalysis]: Preferences: [2019-11-15 22:08:48,329 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-11-15 22:08:48,329 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-15 22:08:48,329 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-11-15 22:08:48,329 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-11-15 22:08:48,329 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 22:08:48,329 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-15 22:08:48,329 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-11-15 22:08:48,330 INFO L131 ssoRankerPreferences]: Filename of dumped script: cstrspn-alloca-2.i_Iteration3_Lasso [2019-11-15 22:08:48,330 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-15 22:08:48,330 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-15 22:08:48,335 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:08:48,341 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:08:48,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:08:48,344 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:08:48,346 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:08:48,348 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:08:48,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:08:48,351 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:08:48,356 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:08:48,358 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:08:48,359 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:08:48,361 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:08:48,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:08:48,364 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:08:48,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:08:48,367 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:08:48,650 WARN L191 SmtUtils]: Spent 181.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 78 [2019-11-15 22:08:48,736 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:08:48,739 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:08:48,740 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:08:48,742 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:08:48,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:08:49,568 WARN L191 SmtUtils]: Spent 465.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 43 [2019-11-15 22:08:49,744 WARN L191 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 36 [2019-11-15 22:08:49,831 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-15 22:08:49,832 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-11-15 22:08:49,832 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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:08:49,833 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:08:49,833 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 22:08:49,833 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:08:49,833 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:08:49,833 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:08:49,834 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 22:08:49,834 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 22:08:49,834 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:08:49,835 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 22:08:49,835 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:08:49,835 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 22:08:49,836 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:08:49,836 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:08:49,836 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:08:49,836 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 22:08:49,836 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 22:08:49,837 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:08:49,837 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 22:08:49,838 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:08:49,838 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 22:08:49,838 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:08:49,838 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:08:49,838 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:08:49,839 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 22:08:49,839 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 22:08:49,839 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:08:49,839 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 22:08:49,840 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:08:49,840 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:08:49,840 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:08:49,840 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:08:49,841 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 22:08:49,841 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 22:08:49,842 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:08:49,843 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 22:08:49,843 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:08:49,844 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 22:08:49,844 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:08:49,844 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:08:49,844 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:08:49,844 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 22:08:49,844 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 22:08:49,845 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:08:49,845 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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:08:49,846 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:08:49,846 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 22:08:49,846 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:08:49,846 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:08:49,846 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:08:49,847 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 22:08:49,847 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 22:08:49,847 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:08:49,848 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 22:08:49,848 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:08:49,848 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:08:49,848 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:08:49,849 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:08:49,849 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 22:08:49,849 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 22:08:49,851 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:08:49,852 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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:08:49,852 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:08:49,852 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 22:08:49,852 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:08:49,853 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:08:49,853 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:08:49,853 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 22:08:49,853 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 22:08:49,854 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:08:49,854 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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:08:49,854 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:08:49,855 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:08:49,855 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:08:49,855 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:08:49,856 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 22:08:49,856 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 22:08:49,857 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:08:49,857 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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:08:49,858 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:08:49,858 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 22:08:49,858 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:08:49,858 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:08:49,858 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:08:49,859 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 22:08:49,859 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 22:08:49,859 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:08:49,860 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 22:08:49,860 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:08:49,860 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 22:08:49,860 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:08:49,861 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:08:49,861 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:08:49,861 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 22:08:49,861 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 22:08:49,862 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:08:49,862 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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:08:49,862 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:08:49,862 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 22:08:49,863 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:08:49,863 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:08:49,863 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:08:49,863 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 22:08:49,863 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 22:08:49,864 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:08:49,864 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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:08:49,864 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:08:49,865 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 22:08:49,865 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:08:49,865 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:08:49,865 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:08:49,865 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 22:08:49,866 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 22:08:49,866 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:08:49,866 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 22:08:49,867 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:08:49,867 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 22:08:49,867 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:08:49,867 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:08:49,867 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:08:49,868 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 22:08:49,868 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 22:08:49,868 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:08:49,869 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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:08:49,869 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:08:49,869 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 22:08:49,869 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:08:49,870 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:08:49,870 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:08:49,870 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 22:08:49,870 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 22:08:49,871 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:08:49,871 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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:08:49,871 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:08:49,872 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:08:49,872 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:08:49,872 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:08:49,873 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 22:08:49,873 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 22:08:49,874 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:08:49,874 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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:08:49,875 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:08:49,875 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:08:49,875 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:08:49,875 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:08:49,876 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 22:08:49,877 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 22:08:49,881 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:08:49,881 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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:08:49,882 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:08:49,882 INFO L202 nArgumentSynthesizer]: 4 stem disjuncts [2019-11-15 22:08:49,882 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:08:49,883 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:08:49,886 INFO L400 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2019-11-15 22:08:49,887 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 22:08:49,905 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:08:49,906 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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:08:49,906 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:08:49,906 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:08:49,907 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:08:49,907 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:08:49,908 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 22:08:49,908 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 22:08:49,909 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:08:49,910 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 22:08:49,910 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:08:49,911 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:08:49,911 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:08:49,911 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:08:49,911 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 22:08:49,912 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 22:08:49,913 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:08:49,913 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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:08:49,914 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:08:49,914 INFO L202 nArgumentSynthesizer]: 2 stem disjuncts [2019-11-15 22:08:49,914 INFO L203 nArgumentSynthesizer]: 6 loop disjuncts [2019-11-15 22:08:49,914 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:08:49,933 INFO L400 nArgumentSynthesizer]: We have 108 Motzkin's Theorem applications. [2019-11-15 22:08:49,933 INFO L401 nArgumentSynthesizer]: A total of 12 supporting invariants were added. [2019-11-15 22:08:50,037 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:08:50,037 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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:08:50,038 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:08:50,038 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:08:50,038 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:08:50,038 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:08:50,039 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 22:08:50,039 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 22:08:50,041 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:08:50,041 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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:08:50,042 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:08:50,042 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:08:50,042 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:08:50,042 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:08:50,045 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 22:08:50,045 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 22:08:50,075 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-15 22:08:50,099 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2019-11-15 22:08:50,100 INFO L444 ModelExtractionUtils]: 39 out of 46 variables were initially zero. Simplification set additionally 4 variables to zero. [2019-11-15 22:08:50,100 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-15 22:08:50,101 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-11-15 22:08:50,101 INFO L510 LassoAnalysis]: Proved termination. [2019-11-15 22:08:50,101 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_cstrspn_~s~0.base)_2, ULTIMATE.start_cstrspn_~s~0.offset) = 1*v_rep(select #length ULTIMATE.start_cstrspn_~s~0.base)_2 - 1*ULTIMATE.start_cstrspn_~s~0.offset Supporting invariants [] [2019-11-15 22:08:50,153 INFO L297 tatePredicateManager]: 15 out of 15 supporting invariants were superfluous and have been removed [2019-11-15 22:08:50,154 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2019-11-15 22:08:50,171 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:08:50,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:08:50,188 INFO L256 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-15 22:08:50,189 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:08:50,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:08:50,197 INFO L256 TraceCheckSpWp]: Trace formula consists of 22 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-15 22:08:50,197 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:08:50,213 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:08:50,213 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:08:50,213 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 18 states and 25 transitions. cyclomatic complexity: 9 Second operand 3 states. [2019-11-15 22:08:50,244 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:08:50,245 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:08:50,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-11-15 22:08:50,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 18 transitions. [2019-11-15 22:08:50,245 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 18 transitions. Stem has 7 letters. Loop has 3 letters. [2019-11-15 22:08:50,245 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 22:08:50,246 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 18 transitions. Stem has 10 letters. Loop has 3 letters. [2019-11-15 22:08:50,246 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 22:08:50,246 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 18 transitions. Stem has 7 letters. Loop has 6 letters. [2019-11-15 22:08:50,246 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 22:08:50,246 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 43 states and 57 transitions. [2019-11-15 22:08:50,249 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-11-15 22:08:50,249 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 43 states to 30 states and 40 transitions. [2019-11-15 22:08:50,250 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2019-11-15 22:08:50,250 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2019-11-15 22:08:50,250 INFO L73 IsDeterministic]: Start isDeterministic. Operand 30 states and 40 transitions. [2019-11-15 22:08:50,250 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-15 22:08:50,250 INFO L688 BuchiCegarLoop]: Abstraction has 30 states and 40 transitions. [2019-11-15 22:08:50,250 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states and 40 transitions. [2019-11-15 22:08:50,252 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 24. [2019-11-15 22:08:50,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2019-11-15 22:08:50,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 33 transitions. [2019-11-15 22:08:50,254 INFO L711 BuchiCegarLoop]: Abstraction has 24 states and 33 transitions. [2019-11-15 22:08:50,254 INFO L591 BuchiCegarLoop]: Abstraction has 24 states and 33 transitions. [2019-11-15 22:08:50,254 INFO L424 BuchiCegarLoop]: ======== Iteration 4============ [2019-11-15 22:08:50,254 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 24 states and 33 transitions. [2019-11-15 22:08:50,256 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-11-15 22:08:50,256 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 22:08:50,257 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 22:08:50,257 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:08:50,257 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-11-15 22:08:50,258 INFO L791 eck$LassoCheckResult]: Stem: 360#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 359#L-1 havoc main_#res;havoc main_#t~nondet10, main_#t~nondet11, main_#t~malloc12.base, main_#t~malloc12.offset, main_#t~malloc13.base, main_#t~malloc13.offset, main_#t~ret14, main_~length1~0, main_~length2~0, main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;main_~length1~0 := main_#t~nondet10;havoc main_#t~nondet10;main_~length2~0 := main_#t~nondet11;havoc main_#t~nondet11; 353#L565 assume !(main_~length1~0 < 1); 354#L565-2 assume !(main_~length2~0 < 1); 352#L568-1 call main_#t~malloc12.base, main_#t~malloc12.offset := #Ultimate.allocOnStack(main_~length1~0);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc12.base, main_#t~malloc12.offset;call main_#t~malloc13.base, main_#t~malloc13.offset := #Ultimate.allocOnStack(main_~length2~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc13.base, main_#t~malloc13.offset;call write~int(0, main_~nondetString1~0.base, main_~nondetString1~0.offset + (main_~length1~0 - 1), 1);call write~int(0, main_~nondetString2~0.base, main_~nondetString2~0.offset + (main_~length2~0 - 1), 1);cstrspn_#in~s1.base, cstrspn_#in~s1.offset, cstrspn_#in~s2.base, cstrspn_#in~s2.offset := main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;havoc cstrspn_#res;havoc cstrspn_#t~mem4, cstrspn_#t~post8.base, cstrspn_#t~post8.offset, cstrspn_#t~mem5, cstrspn_#t~mem6, cstrspn_#t~short7, cstrspn_#t~mem9, cstrspn_#t~post2.base, cstrspn_#t~post2.offset, cstrspn_#t~mem3, cstrspn_~s1.base, cstrspn_~s1.offset, cstrspn_~s2.base, cstrspn_~s2.offset, cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset, cstrspn_~s~0.base, cstrspn_~s~0.offset, cstrspn_~c~0;cstrspn_~s1.base, cstrspn_~s1.offset := cstrspn_#in~s1.base, cstrspn_#in~s1.offset;cstrspn_~s2.base, cstrspn_~s2.offset := cstrspn_#in~s2.base, cstrspn_#in~s2.offset;havoc cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset;havoc cstrspn_~s~0.base, cstrspn_~s~0.offset;havoc cstrspn_~c~0;cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset := cstrspn_~s1.base, cstrspn_~s1.offset; 345#L552-4 call cstrspn_#t~mem3 := read~int(cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset, 1); 346#L552-1 assume !!(0 != cstrspn_#t~mem3);havoc cstrspn_#t~mem3;cstrspn_~s~0.base, cstrspn_~s~0.offset := cstrspn_~s2.base, cstrspn_~s2.offset;call cstrspn_#t~mem4 := read~int(cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset, 1);cstrspn_~c~0 := cstrspn_#t~mem4;havoc cstrspn_#t~mem4; 362#L555-5 call cstrspn_#t~mem5 := read~int(cstrspn_~s~0.base, cstrspn_~s~0.offset, 1);cstrspn_#t~short7 := 0 != cstrspn_#t~mem5; 367#L555-1 assume !cstrspn_#t~short7; 366#L555-3 assume !cstrspn_#t~short7;havoc cstrspn_#t~short7;havoc cstrspn_#t~mem6;havoc cstrspn_#t~mem5; 365#L555-6 call cstrspn_#t~mem9 := read~int(cstrspn_~s~0.base, cstrspn_~s~0.offset, 1); 350#L557 assume !(cstrspn_#t~mem9 != cstrspn_~c~0);havoc cstrspn_#t~mem9; 351#L552-3 cstrspn_#t~post2.base, cstrspn_#t~post2.offset := cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset;cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset := cstrspn_#t~post2.base, 1 + cstrspn_#t~post2.offset;havoc cstrspn_#t~post2.base, cstrspn_#t~post2.offset; 347#L552-4 call cstrspn_#t~mem3 := read~int(cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset, 1); 349#L552-1 assume !!(0 != cstrspn_#t~mem3);havoc cstrspn_#t~mem3;cstrspn_~s~0.base, cstrspn_~s~0.offset := cstrspn_~s2.base, cstrspn_~s2.offset;call cstrspn_#t~mem4 := read~int(cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset, 1);cstrspn_~c~0 := cstrspn_#t~mem4;havoc cstrspn_#t~mem4; 361#L555-5 [2019-11-15 22:08:50,258 INFO L793 eck$LassoCheckResult]: Loop: 361#L555-5 call cstrspn_#t~mem5 := read~int(cstrspn_~s~0.base, cstrspn_~s~0.offset, 1);cstrspn_#t~short7 := 0 != cstrspn_#t~mem5; 355#L555-1 assume cstrspn_#t~short7;call cstrspn_#t~mem6 := read~int(cstrspn_~s~0.base, cstrspn_~s~0.offset, 1);cstrspn_#t~short7 := cstrspn_#t~mem6 != (if cstrspn_~c~0 % 256 <= 127 then cstrspn_~c~0 % 256 else cstrspn_~c~0 % 256 - 256); 356#L555-3 assume !!cstrspn_#t~short7;havoc cstrspn_#t~short7;havoc cstrspn_#t~mem6;havoc cstrspn_#t~mem5;cstrspn_#t~post8.base, cstrspn_#t~post8.offset := cstrspn_~s~0.base, cstrspn_~s~0.offset;cstrspn_~s~0.base, cstrspn_~s~0.offset := cstrspn_#t~post8.base, 1 + cstrspn_#t~post8.offset;havoc cstrspn_#t~post8.base, cstrspn_#t~post8.offset; 361#L555-5 [2019-11-15 22:08:50,258 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:08:50,258 INFO L82 PathProgramCache]: Analyzing trace with hash 1587378397, now seen corresponding path program 1 times [2019-11-15 22:08:50,258 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:08:50,259 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1083689052] [2019-11-15 22:08:50,259 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:08:50,259 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:08:50,259 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:08:50,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:08:50,337 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:08:50,338 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1083689052] [2019-11-15 22:08:50,338 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:08:50,338 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-15 22:08:50,338 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1702385298] [2019-11-15 22:08:50,338 INFO L796 eck$LassoCheckResult]: stem already infeasible [2019-11-15 22:08:50,339 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:08:50,339 INFO L82 PathProgramCache]: Analyzing trace with hash 58692, now seen corresponding path program 2 times [2019-11-15 22:08:50,339 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:08:50,339 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [226151360] [2019-11-15 22:08:50,339 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:08:50,339 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:08:50,339 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:08:50,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:08:50,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:08:50,349 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 22:08:50,521 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:08:50,522 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-15 22:08:50,522 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-11-15 22:08:50,522 INFO L87 Difference]: Start difference. First operand 24 states and 33 transitions. cyclomatic complexity: 12 Second operand 7 states. [2019-11-15 22:08:50,626 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:08:50,626 INFO L93 Difference]: Finished difference Result 30 states and 39 transitions. [2019-11-15 22:08:50,626 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-15 22:08:50,627 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 30 states and 39 transitions. [2019-11-15 22:08:50,628 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2019-11-15 22:08:50,628 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 30 states to 27 states and 35 transitions. [2019-11-15 22:08:50,628 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2019-11-15 22:08:50,628 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2019-11-15 22:08:50,629 INFO L73 IsDeterministic]: Start isDeterministic. Operand 27 states and 35 transitions. [2019-11-15 22:08:50,629 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-15 22:08:50,629 INFO L688 BuchiCegarLoop]: Abstraction has 27 states and 35 transitions. [2019-11-15 22:08:50,629 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states and 35 transitions. [2019-11-15 22:08:50,630 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 25. [2019-11-15 22:08:50,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2019-11-15 22:08:50,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 33 transitions. [2019-11-15 22:08:50,631 INFO L711 BuchiCegarLoop]: Abstraction has 25 states and 33 transitions. [2019-11-15 22:08:50,631 INFO L591 BuchiCegarLoop]: Abstraction has 25 states and 33 transitions. [2019-11-15 22:08:50,631 INFO L424 BuchiCegarLoop]: ======== Iteration 5============ [2019-11-15 22:08:50,631 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 25 states and 33 transitions. [2019-11-15 22:08:50,632 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-11-15 22:08:50,632 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 22:08:50,632 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 22:08:50,633 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:08:50,633 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-11-15 22:08:50,633 INFO L791 eck$LassoCheckResult]: Stem: 432#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 431#L-1 havoc main_#res;havoc main_#t~nondet10, main_#t~nondet11, main_#t~malloc12.base, main_#t~malloc12.offset, main_#t~malloc13.base, main_#t~malloc13.offset, main_#t~ret14, main_~length1~0, main_~length2~0, main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;main_~length1~0 := main_#t~nondet10;havoc main_#t~nondet10;main_~length2~0 := main_#t~nondet11;havoc main_#t~nondet11; 425#L565 assume !(main_~length1~0 < 1); 426#L565-2 assume !(main_~length2~0 < 1); 424#L568-1 call main_#t~malloc12.base, main_#t~malloc12.offset := #Ultimate.allocOnStack(main_~length1~0);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc12.base, main_#t~malloc12.offset;call main_#t~malloc13.base, main_#t~malloc13.offset := #Ultimate.allocOnStack(main_~length2~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc13.base, main_#t~malloc13.offset;call write~int(0, main_~nondetString1~0.base, main_~nondetString1~0.offset + (main_~length1~0 - 1), 1);call write~int(0, main_~nondetString2~0.base, main_~nondetString2~0.offset + (main_~length2~0 - 1), 1);cstrspn_#in~s1.base, cstrspn_#in~s1.offset, cstrspn_#in~s2.base, cstrspn_#in~s2.offset := main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;havoc cstrspn_#res;havoc cstrspn_#t~mem4, cstrspn_#t~post8.base, cstrspn_#t~post8.offset, cstrspn_#t~mem5, cstrspn_#t~mem6, cstrspn_#t~short7, cstrspn_#t~mem9, cstrspn_#t~post2.base, cstrspn_#t~post2.offset, cstrspn_#t~mem3, cstrspn_~s1.base, cstrspn_~s1.offset, cstrspn_~s2.base, cstrspn_~s2.offset, cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset, cstrspn_~s~0.base, cstrspn_~s~0.offset, cstrspn_~c~0;cstrspn_~s1.base, cstrspn_~s1.offset := cstrspn_#in~s1.base, cstrspn_#in~s1.offset;cstrspn_~s2.base, cstrspn_~s2.offset := cstrspn_#in~s2.base, cstrspn_#in~s2.offset;havoc cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset;havoc cstrspn_~s~0.base, cstrspn_~s~0.offset;havoc cstrspn_~c~0;cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset := cstrspn_~s1.base, cstrspn_~s1.offset; 417#L552-4 call cstrspn_#t~mem3 := read~int(cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset, 1); 418#L552-1 assume !!(0 != cstrspn_#t~mem3);havoc cstrspn_#t~mem3;cstrspn_~s~0.base, cstrspn_~s~0.offset := cstrspn_~s2.base, cstrspn_~s2.offset;call cstrspn_#t~mem4 := read~int(cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset, 1);cstrspn_~c~0 := cstrspn_#t~mem4;havoc cstrspn_#t~mem4; 434#L555-5 call cstrspn_#t~mem5 := read~int(cstrspn_~s~0.base, cstrspn_~s~0.offset, 1);cstrspn_#t~short7 := 0 != cstrspn_#t~mem5; 435#L555-1 assume cstrspn_#t~short7;call cstrspn_#t~mem6 := read~int(cstrspn_~s~0.base, cstrspn_~s~0.offset, 1);cstrspn_#t~short7 := cstrspn_#t~mem6 != (if cstrspn_~c~0 % 256 <= 127 then cstrspn_~c~0 % 256 else cstrspn_~c~0 % 256 - 256); 437#L555-3 assume !cstrspn_#t~short7;havoc cstrspn_#t~short7;havoc cstrspn_#t~mem6;havoc cstrspn_#t~mem5; 436#L555-6 call cstrspn_#t~mem9 := read~int(cstrspn_~s~0.base, cstrspn_~s~0.offset, 1); 422#L557 assume !(cstrspn_#t~mem9 != cstrspn_~c~0);havoc cstrspn_#t~mem9; 423#L552-3 cstrspn_#t~post2.base, cstrspn_#t~post2.offset := cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset;cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset := cstrspn_#t~post2.base, 1 + cstrspn_#t~post2.offset;havoc cstrspn_#t~post2.base, cstrspn_#t~post2.offset; 419#L552-4 call cstrspn_#t~mem3 := read~int(cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset, 1); 421#L552-1 assume !!(0 != cstrspn_#t~mem3);havoc cstrspn_#t~mem3;cstrspn_~s~0.base, cstrspn_~s~0.offset := cstrspn_~s2.base, cstrspn_~s2.offset;call cstrspn_#t~mem4 := read~int(cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset, 1);cstrspn_~c~0 := cstrspn_#t~mem4;havoc cstrspn_#t~mem4; 433#L555-5 [2019-11-15 22:08:50,633 INFO L793 eck$LassoCheckResult]: Loop: 433#L555-5 call cstrspn_#t~mem5 := read~int(cstrspn_~s~0.base, cstrspn_~s~0.offset, 1);cstrspn_#t~short7 := 0 != cstrspn_#t~mem5; 427#L555-1 assume cstrspn_#t~short7;call cstrspn_#t~mem6 := read~int(cstrspn_~s~0.base, cstrspn_~s~0.offset, 1);cstrspn_#t~short7 := cstrspn_#t~mem6 != (if cstrspn_~c~0 % 256 <= 127 then cstrspn_~c~0 % 256 else cstrspn_~c~0 % 256 - 256); 428#L555-3 assume !!cstrspn_#t~short7;havoc cstrspn_#t~short7;havoc cstrspn_#t~mem6;havoc cstrspn_#t~mem5;cstrspn_#t~post8.base, cstrspn_#t~post8.offset := cstrspn_~s~0.base, cstrspn_~s~0.offset;cstrspn_~s~0.base, cstrspn_~s~0.offset := cstrspn_#t~post8.base, 1 + cstrspn_#t~post8.offset;havoc cstrspn_#t~post8.base, cstrspn_#t~post8.offset; 433#L555-5 [2019-11-15 22:08:50,633 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:08:50,633 INFO L82 PathProgramCache]: Analyzing trace with hash -187628965, now seen corresponding path program 2 times [2019-11-15 22:08:50,634 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:08:50,634 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1842950624] [2019-11-15 22:08:50,634 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:08:50,634 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:08:50,634 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:08:50,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:08:50,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:08:50,681 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 22:08:50,682 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:08:50,682 INFO L82 PathProgramCache]: Analyzing trace with hash 58692, now seen corresponding path program 3 times [2019-11-15 22:08:50,682 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:08:50,682 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1543150138] [2019-11-15 22:08:50,683 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:08:50,683 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:08:50,683 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:08:50,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:08:50,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:08:50,690 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 22:08:50,691 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:08:50,691 INFO L82 PathProgramCache]: Analyzing trace with hash -1902015318, now seen corresponding path program 1 times [2019-11-15 22:08:50,691 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:08:50,691 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [297745] [2019-11-15 22:08:50,691 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:08:50,692 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:08:50,692 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:08:50,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:08:50,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:08:50,744 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 22:08:50,946 WARN L191 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 36 DAG size of output: 35 [2019-11-15 22:08:51,699 WARN L191 SmtUtils]: Spent 751.00 ms on a formula simplification. DAG size of input: 175 DAG size of output: 138 [2019-11-15 22:08:52,607 WARN L191 SmtUtils]: Spent 891.00 ms on a formula simplification. DAG size of input: 110 DAG size of output: 110 [2019-11-15 22:08:52,614 INFO L210 LassoAnalysis]: Preferences: [2019-11-15 22:08:52,614 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-11-15 22:08:52,614 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-15 22:08:52,614 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-11-15 22:08:52,614 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-11-15 22:08:52,615 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 22:08:52,615 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-15 22:08:52,615 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-11-15 22:08:52,615 INFO L131 ssoRankerPreferences]: Filename of dumped script: cstrspn-alloca-2.i_Iteration5_Lasso [2019-11-15 22:08:52,615 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-15 22:08:52,615 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-15 22:08:52,621 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:08:52,630 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:08:52,637 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:08:52,643 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:08:52,645 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:08:52,647 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:08:52,650 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:08:52,658 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:08:52,660 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:08:52,663 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:08:52,666 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:08:52,670 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:08:52,856 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2019-11-15 22:08:53,627 WARN L191 SmtUtils]: Spent 763.00 ms on a formula simplification. DAG size of input: 111 DAG size of output: 99 [2019-11-15 22:08:53,766 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:08:53,767 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:08:53,769 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:08:53,770 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:08:53,771 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:08:53,773 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:08:53,774 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:08:53,781 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:08:53,783 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:08:53,929 WARN L191 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 43 [2019-11-15 22:08:54,427 WARN L191 SmtUtils]: Spent 256.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 39 [2019-11-15 22:08:54,587 WARN L191 SmtUtils]: Spent 159.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 36 [2019-11-15 22:08:54,915 WARN L191 SmtUtils]: Spent 326.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 43 [2019-11-15 22:08:55,056 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-15 22:08:55,056 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-11-15 22:08:55,057 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 22:08:55,057 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:08:55,057 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 22:08:55,058 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:08:55,058 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:08:55,058 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:08:55,058 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 22:08:55,058 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 22:08:55,059 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:08:55,059 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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:08:55,060 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:08:55,060 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:08:55,060 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:08:55,060 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:08:55,061 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 22:08:55,061 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 22:08:55,062 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:08:55,062 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 22:08:55,063 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:08:55,063 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 22:08:55,063 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:08:55,063 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:08:55,063 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:08:55,064 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 22:08:55,064 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 22:08:55,064 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:08:55,064 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 22:08:55,065 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:08:55,065 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 22:08:55,065 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:08:55,065 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:08:55,065 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:08:55,066 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 22:08:55,066 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 22:08:55,066 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:08:55,067 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 22:08:55,067 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:08:55,067 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 22:08:55,067 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:08:55,067 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:08:55,068 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:08:55,068 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 22:08:55,068 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 22:08:55,068 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:08:55,069 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 22:08:55,069 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:08:55,069 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 22:08:55,069 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:08:55,069 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:08:55,070 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:08:55,070 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 22:08:55,070 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 22:08:55,070 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:08:55,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:08:55,071 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:08:55,071 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:08:55,071 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:08:55,071 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:08:55,072 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 22:08:55,072 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 22:08:55,073 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:08:55,074 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 22:08:55,074 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:08:55,074 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 22:08:55,074 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:08:55,075 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:08:55,075 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:08:55,075 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 22:08:55,075 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 22:08:55,075 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:08:55,076 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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:08:55,076 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:08:55,076 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:08:55,076 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:08:55,076 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:08:55,077 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 22:08:55,077 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 22:08:55,078 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:08:55,078 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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:08:55,079 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:08:55,079 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 22:08:55,079 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:08:55,079 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:08:55,079 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:08:55,080 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 22:08:55,080 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 22:08:55,080 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:08:55,080 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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:08:55,081 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:08:55,081 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 22:08:55,081 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:08:55,081 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:08:55,081 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:08:55,082 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 22:08:55,082 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 22:08:55,082 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:08:55,082 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 22:08:55,083 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:08:55,083 INFO L202 nArgumentSynthesizer]: 4 stem disjuncts [2019-11-15 22:08:55,083 INFO L203 nArgumentSynthesizer]: 6 loop disjuncts [2019-11-15 22:08:55,083 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:08:55,104 INFO L400 nArgumentSynthesizer]: We have 132 Motzkin's Theorem applications. [2019-11-15 22:08:55,105 INFO L401 nArgumentSynthesizer]: A total of 12 supporting invariants were added. [2019-11-15 22:08:55,288 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:08:55,289 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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:08:55,289 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:08:55,289 INFO L202 nArgumentSynthesizer]: 4 stem disjuncts [2019-11-15 22:08:55,290 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:08:55,290 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:08:55,292 INFO L400 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2019-11-15 22:08:55,293 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 22:08:55,306 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:08:55,307 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 22:08:55,307 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:08:55,308 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:08:55,308 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:08:55,308 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:08:55,310 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 22:08:55,311 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 22:08:55,351 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-15 22:08:55,368 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2019-11-15 22:08:55,369 INFO L444 ModelExtractionUtils]: 48 out of 52 variables were initially zero. Simplification set additionally 1 variables to zero. [2019-11-15 22:08:55,369 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-15 22:08:55,370 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-11-15 22:08:55,370 INFO L510 LassoAnalysis]: Proved termination. [2019-11-15 22:08:55,370 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_cstrspn_~s~0.base)_3, ULTIMATE.start_cstrspn_~s~0.offset) = 1*v_rep(select #length ULTIMATE.start_cstrspn_~s~0.base)_3 - 1*ULTIMATE.start_cstrspn_~s~0.offset Supporting invariants [] [2019-11-15 22:08:55,511 INFO L297 tatePredicateManager]: 28 out of 28 supporting invariants were superfluous and have been removed [2019-11-15 22:08:55,512 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2019-11-15 22:08:55,526 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:08:55,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:08:55,548 INFO L256 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-15 22:08:55,549 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:08:55,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:08:55,555 INFO L256 TraceCheckSpWp]: Trace formula consists of 22 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-15 22:08:55,556 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:08:55,564 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:08:55,565 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:08:55,565 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 25 states and 33 transitions. cyclomatic complexity: 11 Second operand 3 states. [2019-11-15 22:08:55,587 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 25 states and 33 transitions. cyclomatic complexity: 11. Second operand 3 states. Result 41 states and 51 transitions. Complement of second has 5 states. [2019-11-15 22:08:55,588 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:08:55,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-11-15 22:08:55,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 18 transitions. [2019-11-15 22:08:55,589 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 18 transitions. Stem has 15 letters. Loop has 3 letters. [2019-11-15 22:08:55,589 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 22:08:55,589 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-11-15 22:08:55,598 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:08:55,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:08:55,634 INFO L256 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-15 22:08:55,635 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:08:55,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:08:55,643 INFO L256 TraceCheckSpWp]: Trace formula consists of 22 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-15 22:08:55,643 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:08:55,651 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:08:55,652 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:08:55,652 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 25 states and 33 transitions. cyclomatic complexity: 11 Second operand 3 states. [2019-11-15 22:08:55,669 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 25 states and 33 transitions. cyclomatic complexity: 11. Second operand 3 states. Result 41 states and 51 transitions. Complement of second has 5 states. [2019-11-15 22:08:55,669 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:08:55,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-11-15 22:08:55,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 18 transitions. [2019-11-15 22:08:55,670 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 18 transitions. Stem has 15 letters. Loop has 3 letters. [2019-11-15 22:08:55,670 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 22:08:55,670 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-11-15 22:08:55,681 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:08:55,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:08:55,701 INFO L256 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-15 22:08:55,701 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:08:55,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:08:55,707 INFO L256 TraceCheckSpWp]: Trace formula consists of 22 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-15 22:08:55,708 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:08:55,716 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:08:55,717 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:08:55,717 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 25 states and 33 transitions. cyclomatic complexity: 11 Second operand 3 states. [2019-11-15 22:08:55,735 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 25 states and 33 transitions. cyclomatic complexity: 11. Second operand 3 states. Result 41 states and 53 transitions. Complement of second has 4 states. [2019-11-15 22:08:55,735 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:08:55,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-11-15 22:08:55,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 27 transitions. [2019-11-15 22:08:55,736 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 27 transitions. Stem has 15 letters. Loop has 3 letters. [2019-11-15 22:08:55,736 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 22:08:55,736 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 27 transitions. Stem has 18 letters. Loop has 3 letters. [2019-11-15 22:08:55,736 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 22:08:55,737 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 27 transitions. Stem has 15 letters. Loop has 6 letters. [2019-11-15 22:08:55,737 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 22:08:55,737 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 41 states and 53 transitions. [2019-11-15 22:08:55,739 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-11-15 22:08:55,739 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 41 states to 0 states and 0 transitions. [2019-11-15 22:08:55,739 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2019-11-15 22:08:55,739 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2019-11-15 22:08:55,739 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2019-11-15 22:08:55,740 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-15 22:08:55,740 INFO L688 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-15 22:08:55,740 INFO L711 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-15 22:08:55,740 INFO L591 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-15 22:08:55,740 INFO L424 BuchiCegarLoop]: ======== Iteration 6============ [2019-11-15 22:08:55,740 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2019-11-15 22:08:55,740 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-11-15 22:08:55,740 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2019-11-15 22:08:55,744 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 15.11 10:08:55 BoogieIcfgContainer [2019-11-15 22:08:55,744 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2019-11-15 22:08:55,745 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-15 22:08:55,745 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-15 22:08:55,745 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-15 22:08:55,745 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 10:08:43" (3/4) ... [2019-11-15 22:08:55,747 INFO L140 WitnessPrinter]: No result that supports witness generation found [2019-11-15 22:08:55,747 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-15 22:08:55,748 INFO L168 Benchmark]: Toolchain (without parser) took 12995.77 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 336.1 MB). Free memory was 939.8 MB in the beginning and 1.2 GB in the end (delta: -251.2 MB). Peak memory consumption was 84.9 MB. Max. memory is 11.5 GB. [2019-11-15 22:08:55,749 INFO L168 Benchmark]: CDTParser took 0.26 ms. Allocated memory is still 1.0 GB. Free memory is still 963.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-15 22:08:55,749 INFO L168 Benchmark]: CACSL2BoogieTranslator took 528.52 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 138.9 MB). Free memory was 939.8 MB in the beginning and 1.1 GB in the end (delta: -183.2 MB). Peak memory consumption was 18.0 MB. Max. memory is 11.5 GB. [2019-11-15 22:08:55,750 INFO L168 Benchmark]: Boogie Procedure Inliner took 43.26 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:08:55,750 INFO L168 Benchmark]: Boogie Preprocessor took 27.86 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: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2019-11-15 22:08:55,751 INFO L168 Benchmark]: RCFGBuilder took 390.73 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:08:55,752 INFO L168 Benchmark]: BuchiAutomizer took 11999.60 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 197.1 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -106.7 MB). Peak memory consumption was 90.4 MB. Max. memory is 11.5 GB. [2019-11-15 22:08:55,752 INFO L168 Benchmark]: Witness Printer took 2.70 ms. Allocated memory is still 1.4 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 9.6 MB). Peak memory consumption was 9.6 MB. Max. memory is 11.5 GB. [2019-11-15 22:08:55,755 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.26 ms. Allocated memory is still 1.0 GB. Free memory is still 963.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 528.52 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 138.9 MB). Free memory was 939.8 MB in the beginning and 1.1 GB in the end (delta: -183.2 MB). Peak memory consumption was 18.0 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 43.26 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. * Boogie Preprocessor took 27.86 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: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 390.73 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 11999.60 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 197.1 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -106.7 MB). Peak memory consumption was 90.4 MB. Max. memory is 11.5 GB. * Witness Printer took 2.70 ms. Allocated memory is still 1.4 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 9.6 MB). Peak memory consumption was 9.6 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 5 terminating modules (2 trivial, 2 deterministic, 1 nondeterministic). One deterministic module has affine ranking function unknown-#length-unknown[sc1] + -1 * sc1 and consists of 3 locations. One deterministic module has affine ranking function unknown-#length-unknown[s] + -1 * s and consists of 3 locations. One nondeterministic module has affine ranking function unknown-#length-unknown[s] + -1 * s and consists of 3 locations. 2 modules have a trivial ranking function, the largest among these consists of 7 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 11.9s and 6 iterations. TraceHistogramMax:2. Analysis of lassos took 11.2s. Construction of modules took 0.1s. Büchi inclusion checks took 0.4s. Highest rank in rank-based complementation 3. Minimization of det autom 2. Minimization of nondet autom 3. Automata minimization 0.0s AutomataMinimizationTime, 4 MinimizatonAttempts, 8 StatesRemovedByMinimization, 2 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 25 states and ocurred in iteration 4. Nontrivial modules had stage [2, 0, 1, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 109 SDtfs, 120 SDslu, 52 SDs, 0 SdLazy, 95 SolverSat, 11 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.1s Time LassoAnalysisResults: nont0 unkn0 SFLI1 SFLT0 conc0 concLT0 SILN0 SILU1 SILI0 SILT0 lasso3 LassoPreprocessingBenchmarks: Lassos: inital375 mio100 ax105 hnf99 lsp87 ukn72 mio100 lsp31 div127 bol100 ite100 ukn100 eq168 hnf81 smp92 dnf666 smp43 tf100 neg96 sie110 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 205ms VariablesStem: 7 VariablesLoop: 4 DisjunctsStem: 4 DisjunctsLoop: 6 SupportingInvariants: 12 MotzkinApplications: 132 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! Received shutdown request...