./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/termination-15/cstrspn_malloc.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_fd5062e3-c6f4-4c9b-86d2-6011e1a32b64/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_fd5062e3-c6f4-4c9b-86d2-6011e1a32b64/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_fd5062e3-c6f4-4c9b-86d2-6011e1a32b64/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_fd5062e3-c6f4-4c9b-86d2-6011e1a32b64/bin/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/termination-15/cstrspn_malloc.i -s /tmp/vcloud-vcloud-master/worker/run_dir_fd5062e3-c6f4-4c9b-86d2-6011e1a32b64/bin/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_fd5062e3-c6f4-4c9b-86d2-6011e1a32b64/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 9c357a0f089ccce134e4135f49c3923f49db9d7a ..................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-cad4683 [2019-11-16 00:25:06,504 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-16 00:25:06,506 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-16 00:25:06,521 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-16 00:25:06,522 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-16 00:25:06,523 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-16 00:25:06,524 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-16 00:25:06,526 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-16 00:25:06,534 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-16 00:25:06,535 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-16 00:25:06,536 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-16 00:25:06,537 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-16 00:25:06,537 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-16 00:25:06,538 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-16 00:25:06,539 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-16 00:25:06,540 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-16 00:25:06,541 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-16 00:25:06,542 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-16 00:25:06,544 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-16 00:25:06,546 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-16 00:25:06,547 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-16 00:25:06,548 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-16 00:25:06,550 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-16 00:25:06,550 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-16 00:25:06,553 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-16 00:25:06,554 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-16 00:25:06,554 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-16 00:25:06,555 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-16 00:25:06,555 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-16 00:25:06,556 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-16 00:25:06,557 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-16 00:25:06,557 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-16 00:25:06,558 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-16 00:25:06,559 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-16 00:25:06,560 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-16 00:25:06,560 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-16 00:25:06,561 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-16 00:25:06,561 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-16 00:25:06,561 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-16 00:25:06,564 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-16 00:25:06,565 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-16 00:25:06,566 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_fd5062e3-c6f4-4c9b-86d2-6011e1a32b64/bin/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf [2019-11-16 00:25:06,584 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-16 00:25:06,585 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-16 00:25:06,586 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-16 00:25:06,586 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-16 00:25:06,586 INFO L138 SettingsManager]: * Use SBE=true [2019-11-16 00:25:06,587 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-11-16 00:25:06,587 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-11-16 00:25:06,587 INFO L138 SettingsManager]: * Use old map elimination=false [2019-11-16 00:25:06,587 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2019-11-16 00:25:06,588 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2019-11-16 00:25:06,588 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-11-16 00:25:06,588 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-16 00:25:06,588 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-11-16 00:25:06,589 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-16 00:25:06,589 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-16 00:25:06,589 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-11-16 00:25:06,589 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-11-16 00:25:06,589 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-11-16 00:25:06,590 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-16 00:25:06,590 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-11-16 00:25:06,590 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-16 00:25:06,590 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-11-16 00:25:06,591 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-16 00:25:06,591 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-16 00:25:06,591 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-11-16 00:25:06,591 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-16 00:25:06,592 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-16 00:25:06,592 INFO L138 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-11-16 00:25:06,593 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-11-16 00:25:06,593 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_fd5062e3-c6f4-4c9b-86d2-6011e1a32b64/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 -> 9c357a0f089ccce134e4135f49c3923f49db9d7a [2019-11-16 00:25:06,623 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-16 00:25:06,637 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-16 00:25:06,643 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-16 00:25:06,644 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-16 00:25:06,645 INFO L275 PluginConnector]: CDTParser initialized [2019-11-16 00:25:06,647 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_fd5062e3-c6f4-4c9b-86d2-6011e1a32b64/bin/uautomizer/../../sv-benchmarks/c/termination-15/cstrspn_malloc.i [2019-11-16 00:25:06,725 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_fd5062e3-c6f4-4c9b-86d2-6011e1a32b64/bin/uautomizer/data/8a8bb2c3c/7681b51b7d2d4f1f93d75e5b3cfe8cde/FLAG64012a1c1 [2019-11-16 00:25:07,184 INFO L306 CDTParser]: Found 1 translation units. [2019-11-16 00:25:07,185 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_fd5062e3-c6f4-4c9b-86d2-6011e1a32b64/sv-benchmarks/c/termination-15/cstrspn_malloc.i [2019-11-16 00:25:07,197 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_fd5062e3-c6f4-4c9b-86d2-6011e1a32b64/bin/uautomizer/data/8a8bb2c3c/7681b51b7d2d4f1f93d75e5b3cfe8cde/FLAG64012a1c1 [2019-11-16 00:25:07,444 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_fd5062e3-c6f4-4c9b-86d2-6011e1a32b64/bin/uautomizer/data/8a8bb2c3c/7681b51b7d2d4f1f93d75e5b3cfe8cde [2019-11-16 00:25:07,446 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-16 00:25:07,447 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-16 00:25:07,448 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-16 00:25:07,448 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-16 00:25:07,455 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-16 00:25:07,456 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 12:25:07" (1/1) ... [2019-11-16 00:25:07,459 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4ef2cb02 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:25:07, skipping insertion in model container [2019-11-16 00:25:07,459 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 12:25:07" (1/1) ... [2019-11-16 00:25:07,467 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-16 00:25:07,521 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-16 00:25:07,967 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-16 00:25:07,979 INFO L188 MainTranslator]: Completed pre-run [2019-11-16 00:25:08,043 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-16 00:25:08,100 INFO L192 MainTranslator]: Completed translation [2019-11-16 00:25:08,101 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:25:08 WrapperNode [2019-11-16 00:25:08,101 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-16 00:25:08,102 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-16 00:25:08,102 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-16 00:25:08,102 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-16 00:25:08,111 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:25:08" (1/1) ... [2019-11-16 00:25:08,138 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:25:08" (1/1) ... [2019-11-16 00:25:08,162 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-16 00:25:08,162 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-16 00:25:08,162 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-16 00:25:08,163 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-16 00:25:08,172 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:25:08" (1/1) ... [2019-11-16 00:25:08,172 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:25:08" (1/1) ... [2019-11-16 00:25:08,175 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:25:08" (1/1) ... [2019-11-16 00:25:08,176 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:25:08" (1/1) ... [2019-11-16 00:25:08,183 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:25:08" (1/1) ... [2019-11-16 00:25:08,187 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:25:08" (1/1) ... [2019-11-16 00:25:08,189 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:25:08" (1/1) ... [2019-11-16 00:25:08,192 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-16 00:25:08,192 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-16 00:25:08,192 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-16 00:25:08,193 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-16 00:25:08,193 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:25:08" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_fd5062e3-c6f4-4c9b-86d2-6011e1a32b64/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-16 00:25:08,251 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-11-16 00:25:08,252 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-11-16 00:25:08,252 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-11-16 00:25:08,252 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-16 00:25:08,253 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-16 00:25:08,253 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-16 00:25:08,498 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-16 00:25:08,498 INFO L284 CfgBuilder]: Removed 8 assume(true) statements. [2019-11-16 00:25:08,499 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 12:25:08 BoogieIcfgContainer [2019-11-16 00:25:08,499 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-16 00:25:08,500 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-11-16 00:25:08,500 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-11-16 00:25:08,503 INFO L275 PluginConnector]: BuchiAutomizer initialized [2019-11-16 00:25:08,504 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-16 00:25:08,504 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 16.11 12:25:07" (1/3) ... [2019-11-16 00:25:08,505 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@6e733669 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 16.11 12:25:08, skipping insertion in model container [2019-11-16 00:25:08,506 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-16 00:25:08,506 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:25:08" (2/3) ... [2019-11-16 00:25:08,506 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@6e733669 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 16.11 12:25:08, skipping insertion in model container [2019-11-16 00:25:08,506 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-16 00:25:08,506 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 12:25:08" (3/3) ... [2019-11-16 00:25:08,508 INFO L371 chiAutomizerObserver]: Analyzing ICFG cstrspn_malloc.i [2019-11-16 00:25:08,549 INFO L356 BuchiCegarLoop]: Interprodecural is true [2019-11-16 00:25:08,549 INFO L357 BuchiCegarLoop]: Hoare is false [2019-11-16 00:25:08,549 INFO L358 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-11-16 00:25:08,549 INFO L359 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-16 00:25:08,549 INFO L360 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-16 00:25:08,549 INFO L361 BuchiCegarLoop]: Difference is false [2019-11-16 00:25:08,550 INFO L362 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-16 00:25:08,550 INFO L365 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-11-16 00:25:08,563 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states. [2019-11-16 00:25:08,583 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2019-11-16 00:25:08,583 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-16 00:25:08,583 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-16 00:25:08,589 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2019-11-16 00:25:08,589 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2019-11-16 00:25:08,589 INFO L424 BuchiCegarLoop]: ======== Iteration 1============ [2019-11-16 00:25:08,590 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states. [2019-11-16 00:25:08,591 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2019-11-16 00:25:08,591 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-16 00:25:08,592 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-16 00:25:08,592 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2019-11-16 00:25:08,592 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2019-11-16 00:25:08,599 INFO L791 eck$LassoCheckResult]: Stem: 13#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 11#L-1true havoc main_#res;havoc main_#t~nondet213, main_#t~nondet214, main_#t~malloc215.base, main_#t~malloc215.offset, main_#t~malloc216.base, main_#t~malloc216.offset, main_#t~ret217, main_~length1~0, main_~length2~0, main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset, main_~res~0;main_~length1~0 := main_#t~nondet213;havoc main_#t~nondet213;main_~length2~0 := main_#t~nondet214;havoc main_#t~nondet214; 12#L382true assume !(main_~length1~0 < 1); 15#L382-2true assume !(main_~length2~0 < 1); 10#L385-1true call main_#t~malloc215.base, main_#t~malloc215.offset := #Ultimate.allocOnHeap(main_~length1~0);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc215.base, main_#t~malloc215.offset;call main_#t~malloc216.base, main_#t~malloc216.offset := #Ultimate.allocOnHeap(main_~length2~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc216.base, main_#t~malloc216.offset;call write~int(0, main_~nondetString1~0.base, main_~nondetString1~0.offset + (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~mem207, cstrspn_#t~post211.base, cstrspn_#t~post211.offset, cstrspn_#t~mem208, cstrspn_#t~mem209, cstrspn_#t~short210, cstrspn_#t~mem212, cstrspn_#t~post205.base, cstrspn_#t~post205.offset, cstrspn_#t~mem206, 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; 6#L369-4true [2019-11-16 00:25:08,599 INFO L793 eck$LassoCheckResult]: Loop: 6#L369-4true call cstrspn_#t~mem206 := read~int(cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset, 1); 18#L369-1true assume !!(0 != cstrspn_#t~mem206);havoc cstrspn_#t~mem206;cstrspn_~s~0.base, cstrspn_~s~0.offset := cstrspn_~s2.base, cstrspn_~s2.offset;call cstrspn_#t~mem207 := read~int(cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset, 1);cstrspn_~c~0 := cstrspn_#t~mem207;havoc cstrspn_#t~mem207; 20#L372-5true assume !true; 4#L372-6true call cstrspn_#t~mem212 := read~int(cstrspn_~s~0.base, cstrspn_~s~0.offset, 1); 8#L374true assume !(cstrspn_#t~mem212 != cstrspn_~c~0);havoc cstrspn_#t~mem212; 5#L369-3true cstrspn_#t~post205.base, cstrspn_#t~post205.offset := cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset;cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset := cstrspn_#t~post205.base, 1 + cstrspn_#t~post205.offset;havoc cstrspn_#t~post205.base, cstrspn_#t~post205.offset; 6#L369-4true [2019-11-16 00:25:08,604 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:25:08,605 INFO L82 PathProgramCache]: Analyzing trace with hash 28695878, now seen corresponding path program 1 times [2019-11-16 00:25:08,612 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:25:08,613 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [416881893] [2019-11-16 00:25:08,613 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:25:08,613 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:25:08,613 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:25:08,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:25:08,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:25:08,765 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-16 00:25:08,766 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:25:08,766 INFO L82 PathProgramCache]: Analyzing trace with hash 1454917130, now seen corresponding path program 1 times [2019-11-16 00:25:08,766 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:25:08,767 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1678079553] [2019-11-16 00:25:08,767 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:25:08,767 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:25:08,767 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:25:08,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:25:08,798 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-16 00:25:08,799 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1678079553] [2019-11-16 00:25:08,799 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:25:08,800 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-16 00:25:08,800 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [624947806] [2019-11-16 00:25:08,805 INFO L808 eck$LassoCheckResult]: loop already infeasible [2019-11-16 00:25:08,806 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:25:08,820 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-11-16 00:25:08,821 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-11-16 00:25:08,822 INFO L87 Difference]: Start difference. First operand 18 states. Second operand 2 states. [2019-11-16 00:25:08,827 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:25:08,828 INFO L93 Difference]: Finished difference Result 18 states and 23 transitions. [2019-11-16 00:25:08,828 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-11-16 00:25:08,829 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 18 states and 23 transitions. [2019-11-16 00:25:08,831 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2019-11-16 00:25:08,835 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 18 states to 13 states and 17 transitions. [2019-11-16 00:25:08,836 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 13 [2019-11-16 00:25:08,836 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 13 [2019-11-16 00:25:08,837 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 17 transitions. [2019-11-16 00:25:08,837 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-16 00:25:08,837 INFO L688 BuchiCegarLoop]: Abstraction has 13 states and 17 transitions. [2019-11-16 00:25:08,850 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states and 17 transitions. [2019-11-16 00:25:08,857 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2019-11-16 00:25:08,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2019-11-16 00:25:08,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 17 transitions. [2019-11-16 00:25:08,859 INFO L711 BuchiCegarLoop]: Abstraction has 13 states and 17 transitions. [2019-11-16 00:25:08,859 INFO L591 BuchiCegarLoop]: Abstraction has 13 states and 17 transitions. [2019-11-16 00:25:08,859 INFO L424 BuchiCegarLoop]: ======== Iteration 2============ [2019-11-16 00:25:08,859 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 13 states and 17 transitions. [2019-11-16 00:25:08,860 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2019-11-16 00:25:08,860 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-16 00:25:08,860 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-16 00:25:08,861 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2019-11-16 00:25:08,861 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:25:08,861 INFO L791 eck$LassoCheckResult]: Stem: 55#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 50#L-1 havoc main_#res;havoc main_#t~nondet213, main_#t~nondet214, main_#t~malloc215.base, main_#t~malloc215.offset, main_#t~malloc216.base, main_#t~malloc216.offset, main_#t~ret217, main_~length1~0, main_~length2~0, main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset, main_~res~0;main_~length1~0 := main_#t~nondet213;havoc main_#t~nondet213;main_~length2~0 := main_#t~nondet214;havoc main_#t~nondet214; 51#L382 assume !(main_~length1~0 < 1); 52#L382-2 assume !(main_~length2~0 < 1); 49#L385-1 call main_#t~malloc215.base, main_#t~malloc215.offset := #Ultimate.allocOnHeap(main_~length1~0);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc215.base, main_#t~malloc215.offset;call main_#t~malloc216.base, main_#t~malloc216.offset := #Ultimate.allocOnHeap(main_~length2~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc216.base, main_#t~malloc216.offset;call write~int(0, main_~nondetString1~0.base, main_~nondetString1~0.offset + (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~mem207, cstrspn_#t~post211.base, cstrspn_#t~post211.offset, cstrspn_#t~mem208, cstrspn_#t~mem209, cstrspn_#t~short210, cstrspn_#t~mem212, cstrspn_#t~post205.base, cstrspn_#t~post205.offset, cstrspn_#t~mem206, 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; 47#L369-4 [2019-11-16 00:25:08,861 INFO L793 eck$LassoCheckResult]: Loop: 47#L369-4 call cstrspn_#t~mem206 := read~int(cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset, 1); 48#L369-1 assume !!(0 != cstrspn_#t~mem206);havoc cstrspn_#t~mem206;cstrspn_~s~0.base, cstrspn_~s~0.offset := cstrspn_~s2.base, cstrspn_~s2.offset;call cstrspn_#t~mem207 := read~int(cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset, 1);cstrspn_~c~0 := cstrspn_#t~mem207;havoc cstrspn_#t~mem207; 56#L372-5 call cstrspn_#t~mem208 := read~int(cstrspn_~s~0.base, cstrspn_~s~0.offset, 1);cstrspn_#t~short210 := 0 != cstrspn_#t~mem208; 53#L372-1 assume cstrspn_#t~short210;call cstrspn_#t~mem209 := read~int(cstrspn_~s~0.base, cstrspn_~s~0.offset, 1);cstrspn_#t~short210 := cstrspn_#t~mem209 != (if cstrspn_~c~0 % 256 <= 127 then cstrspn_~c~0 % 256 else cstrspn_~c~0 % 256 - 256); 54#L372-3 assume !cstrspn_#t~short210;havoc cstrspn_#t~mem208;havoc cstrspn_#t~short210;havoc cstrspn_#t~mem209; 44#L372-6 call cstrspn_#t~mem212 := read~int(cstrspn_~s~0.base, cstrspn_~s~0.offset, 1); 45#L374 assume !(cstrspn_#t~mem212 != cstrspn_~c~0);havoc cstrspn_#t~mem212; 46#L369-3 cstrspn_#t~post205.base, cstrspn_#t~post205.offset := cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset;cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset := cstrspn_#t~post205.base, 1 + cstrspn_#t~post205.offset;havoc cstrspn_#t~post205.base, cstrspn_#t~post205.offset; 47#L369-4 [2019-11-16 00:25:08,862 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:25:08,862 INFO L82 PathProgramCache]: Analyzing trace with hash 28695878, now seen corresponding path program 2 times [2019-11-16 00:25:08,862 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:25:08,862 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [522808538] [2019-11-16 00:25:08,862 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:25:08,863 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:25:08,863 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:25:08,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:25:08,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:25:08,908 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-16 00:25:08,909 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:25:08,909 INFO L82 PathProgramCache]: Analyzing trace with hash 1927396657, now seen corresponding path program 1 times [2019-11-16 00:25:08,909 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:25:08,909 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1149059900] [2019-11-16 00:25:08,910 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:25:08,910 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:25:08,910 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:25:08,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:25:08,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:25:08,940 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-16 00:25:08,940 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:25:08,940 INFO L82 PathProgramCache]: Analyzing trace with hash -102988426, now seen corresponding path program 1 times [2019-11-16 00:25:08,940 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:25:08,941 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [13727782] [2019-11-16 00:25:08,941 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:25:08,941 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:25:08,941 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:25:08,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:25:09,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:25:09,010 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-16 00:25:09,268 WARN L191 SmtUtils]: Spent 246.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 58 [2019-11-16 00:25:09,597 WARN L191 SmtUtils]: Spent 307.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 49 [2019-11-16 00:25:09,977 WARN L191 SmtUtils]: Spent 377.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 87 [2019-11-16 00:25:10,118 WARN L191 SmtUtils]: Spent 139.00 ms on a formula simplification that was a NOOP. DAG size: 81 [2019-11-16 00:25:10,133 INFO L210 LassoAnalysis]: Preferences: [2019-11-16 00:25:10,134 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-11-16 00:25:10,135 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-16 00:25:10,135 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-11-16 00:25:10,140 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-11-16 00:25:10,141 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-16 00:25:10,141 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-16 00:25:10,141 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-11-16 00:25:10,142 INFO L131 ssoRankerPreferences]: Filename of dumped script: cstrspn_malloc.i_Iteration2_Lasso [2019-11-16 00:25:10,142 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-16 00:25:10,142 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-16 00:25:10,180 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-16 00:25:10,187 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-16 00:25:10,189 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:25:10,194 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:25:10,204 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-16 00:25:10,207 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-16 00:25:10,210 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:25:10,215 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:25:10,219 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-16 00:25:10,222 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:25:10,225 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-16 00:25:10,227 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-16 00:25:10,233 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-16 00:25:10,236 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:25:10,244 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-16 00:25:10,247 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-16 00:25:10,250 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-16 00:25:10,635 WARN L191 SmtUtils]: Spent 241.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 66 [2019-11-16 00:25:10,862 WARN L191 SmtUtils]: Spent 204.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 56 [2019-11-16 00:25:10,862 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-16 00:25:10,867 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-16 00:25:11,629 WARN L191 SmtUtils]: Spent 433.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 40 [2019-11-16 00:25:11,863 WARN L191 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 29 [2019-11-16 00:25:11,885 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-16 00:25:11,890 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-11-16 00:25:11,892 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:25:11,893 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:25:11,894 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:25:11,894 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:25:11,895 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:25:11,895 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:25:11,896 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:25:11,896 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:25:11,899 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:25:11,899 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-16 00:25:11,900 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:25:11,900 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:25:11,900 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:25:11,900 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:25:11,900 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:25:11,901 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:25:11,901 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:25:11,902 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:25:11,902 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-16 00:25:11,903 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:25:11,903 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:25:11,903 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:25:11,903 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:25:11,905 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-16 00:25:11,905 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-16 00:25:11,913 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:25:11,922 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-16 00:25:11,923 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:25:11,923 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:25:11,923 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:25:11,923 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:25:11,923 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:25:11,924 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:25:11,924 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:25:11,925 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:25:11,925 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:25:11,926 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:25:11,926 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:25:11,926 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:25:11,926 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:25:11,926 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:25:11,927 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:25:11,927 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:25:11,928 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:25:11,928 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:25:11,929 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:25:11,929 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:25:11,929 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:25:11,929 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:25:11,931 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-16 00:25:11,931 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-16 00:25:11,934 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:25:11,934 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-16 00:25:11,935 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:25:11,935 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:25:11,935 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:25:11,935 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:25:11,935 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:25:11,936 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:25:11,936 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:25:11,936 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:25:11,937 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-16 00:25:11,937 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:25:11,938 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:25:11,938 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:25:11,938 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:25:11,938 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:25:11,938 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:25:11,938 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:25:11,939 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:25:11,940 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:25:11,940 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:25:11,940 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:25:11,941 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:25:11,941 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:25:11,941 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:25:11,941 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:25:11,941 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:25:11,942 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:25:11,943 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-16 00:25:11,943 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:25:11,943 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:25:11,944 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:25:11,944 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:25:11,944 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:25:11,944 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:25:11,944 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:25:11,945 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:25:11,946 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-16 00:25:11,946 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:25:11,946 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:25:11,947 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:25:11,947 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:25:11,947 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:25:11,947 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:25:11,947 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:25:11,948 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:25:11,949 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-16 00:25:11,949 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:25:11,949 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:25:11,949 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:25:11,950 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:25:11,950 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:25:11,950 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:25:11,950 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:25:11,951 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:25:11,951 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-16 00:25:11,952 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:25:11,952 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:25:11,952 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:25:11,952 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:25:11,952 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:25:11,953 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:25:11,953 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:25:11,954 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:25:11,954 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-16 00:25:11,955 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:25:11,955 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:25:11,955 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:25:11,955 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:25:11,955 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:25:11,956 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:25:11,956 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:25:11,957 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:25:11,957 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:25:11,958 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:25:11,958 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:25:11,958 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:25:11,958 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:25:11,958 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:25:11,959 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:25:11,959 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:25:11,960 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:25:11,960 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-16 00:25:11,961 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:25:11,961 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:25:11,961 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:25:11,961 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:25:11,961 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:25:11,962 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:25:11,962 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:25:11,963 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:25:11,966 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-16 00:25:11,967 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:25:11,967 INFO L202 nArgumentSynthesizer]: 4 stem disjuncts [2019-11-16 00:25:11,967 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:25:11,968 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:25:11,980 INFO L400 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2019-11-16 00:25:11,981 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-16 00:25:12,050 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:25:12,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-16 00:25:12,051 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:25:12,051 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:25:12,052 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:25:12,052 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:25:12,053 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-16 00:25:12,053 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-16 00:25:12,055 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:25:12,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-16 00:25:12,056 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:25:12,056 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:25:12,057 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:25:12,057 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:25:12,059 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-16 00:25:12,059 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-16 00:25:12,079 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:25:12,079 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:25:12,080 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:25:12,080 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:25:12,080 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:25:12,080 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:25:12,081 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:25:12,081 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:25:12,081 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:25:12,083 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:25:12,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-16 00:25:12,084 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:25:12,084 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:25:12,084 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:25:12,084 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:25:12,086 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-16 00:25:12,086 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-16 00:25:12,105 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:25:12,106 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:25:12,106 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:25:12,107 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:25:12,107 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:25:12,107 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:25:12,108 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-16 00:25:12,108 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-16 00:25:12,111 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:25:12,112 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-16 00:25:12,112 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:25:12,112 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:25:12,112 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:25:12,113 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:25:12,114 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-16 00:25:12,114 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-16 00:25:12,118 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:25:12,124 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:25:12,125 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:25:12,126 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:25:12,127 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:25:12,127 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:25:12,135 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-16 00:25:12,135 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-16 00:25:12,203 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-16 00:25:12,246 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2019-11-16 00:25:12,246 INFO L444 ModelExtractionUtils]: 23 out of 28 variables were initially zero. Simplification set additionally 2 variables to zero. [2019-11-16 00:25:12,249 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-16 00:25:12,250 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-11-16 00:25:12,251 INFO L510 LassoAnalysis]: Proved termination. [2019-11-16 00:25:12,255 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_cstrspn_~sc1~0.offset, v_rep(select #length ULTIMATE.start_cstrspn_~sc1~0.base)_1) = -1*ULTIMATE.start_cstrspn_~sc1~0.offset + 1*v_rep(select #length ULTIMATE.start_cstrspn_~sc1~0.base)_1 Supporting invariants [] [2019-11-16 00:25:12,305 INFO L297 tatePredicateManager]: 9 out of 9 supporting invariants were superfluous and have been removed [2019-11-16 00:25:12,313 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2019-11-16 00:25:12,340 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:25:12,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:25:12,364 INFO L256 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-16 00:25:12,365 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:25:12,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:25:12,384 INFO L256 TraceCheckSpWp]: Trace formula consists of 47 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-16 00:25:12,385 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:25:12,399 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-16 00:25:12,402 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-16 00:25:12,403 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 13 states and 17 transitions. cyclomatic complexity: 5 Second operand 3 states. [2019-11-16 00:25:12,448 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-16 00:25:12,449 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-16 00:25:12,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-11-16 00:25:12,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 17 transitions. [2019-11-16 00:25:12,451 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 17 transitions. Stem has 5 letters. Loop has 8 letters. [2019-11-16 00:25:12,452 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-16 00:25:12,452 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 17 transitions. Stem has 13 letters. Loop has 8 letters. [2019-11-16 00:25:12,453 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-16 00:25:12,453 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 17 transitions. Stem has 5 letters. Loop has 16 letters. [2019-11-16 00:25:12,453 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-16 00:25:12,453 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 21 states and 28 transitions. [2019-11-16 00:25:12,454 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-11-16 00:25:12,455 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 21 states to 18 states and 25 transitions. [2019-11-16 00:25:12,455 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9 [2019-11-16 00:25:12,456 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2019-11-16 00:25:12,456 INFO L73 IsDeterministic]: Start isDeterministic. Operand 18 states and 25 transitions. [2019-11-16 00:25:12,456 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-16 00:25:12,456 INFO L688 BuchiCegarLoop]: Abstraction has 18 states and 25 transitions. [2019-11-16 00:25:12,456 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states and 25 transitions. [2019-11-16 00:25:12,457 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2019-11-16 00:25:12,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2019-11-16 00:25:12,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 25 transitions. [2019-11-16 00:25:12,458 INFO L711 BuchiCegarLoop]: Abstraction has 18 states and 25 transitions. [2019-11-16 00:25:12,459 INFO L591 BuchiCegarLoop]: Abstraction has 18 states and 25 transitions. [2019-11-16 00:25:12,459 INFO L424 BuchiCegarLoop]: ======== Iteration 3============ [2019-11-16 00:25:12,459 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states and 25 transitions. [2019-11-16 00:25:12,460 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-11-16 00:25:12,460 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-16 00:25:12,460 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-16 00:25:12,460 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:25:12,460 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-11-16 00:25:12,461 INFO L791 eck$LassoCheckResult]: Stem: 188#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 181#L-1 havoc main_#res;havoc main_#t~nondet213, main_#t~nondet214, main_#t~malloc215.base, main_#t~malloc215.offset, main_#t~malloc216.base, main_#t~malloc216.offset, main_#t~ret217, main_~length1~0, main_~length2~0, main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset, main_~res~0;main_~length1~0 := main_#t~nondet213;havoc main_#t~nondet213;main_~length2~0 := main_#t~nondet214;havoc main_#t~nondet214; 182#L382 assume !(main_~length1~0 < 1); 183#L382-2 assume !(main_~length2~0 < 1); 180#L385-1 call main_#t~malloc215.base, main_#t~malloc215.offset := #Ultimate.allocOnHeap(main_~length1~0);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc215.base, main_#t~malloc215.offset;call main_#t~malloc216.base, main_#t~malloc216.offset := #Ultimate.allocOnHeap(main_~length2~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc216.base, main_#t~malloc216.offset;call write~int(0, main_~nondetString1~0.base, main_~nondetString1~0.offset + (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~mem207, cstrspn_#t~post211.base, cstrspn_#t~post211.offset, cstrspn_#t~mem208, cstrspn_#t~mem209, cstrspn_#t~short210, cstrspn_#t~mem212, cstrspn_#t~post205.base, cstrspn_#t~post205.offset, cstrspn_#t~mem206, 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; 177#L369-4 call cstrspn_#t~mem206 := read~int(cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset, 1); 179#L369-1 assume !!(0 != cstrspn_#t~mem206);havoc cstrspn_#t~mem206;cstrspn_~s~0.base, cstrspn_~s~0.offset := cstrspn_~s2.base, cstrspn_~s2.offset;call cstrspn_#t~mem207 := read~int(cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset, 1);cstrspn_~c~0 := cstrspn_#t~mem207;havoc cstrspn_#t~mem207; 189#L372-5 [2019-11-16 00:25:12,461 INFO L793 eck$LassoCheckResult]: Loop: 189#L372-5 call cstrspn_#t~mem208 := read~int(cstrspn_~s~0.base, cstrspn_~s~0.offset, 1);cstrspn_#t~short210 := 0 != cstrspn_#t~mem208; 184#L372-1 assume cstrspn_#t~short210;call cstrspn_#t~mem209 := read~int(cstrspn_~s~0.base, cstrspn_~s~0.offset, 1);cstrspn_#t~short210 := cstrspn_#t~mem209 != (if cstrspn_~c~0 % 256 <= 127 then cstrspn_~c~0 % 256 else cstrspn_~c~0 % 256 - 256); 185#L372-3 assume !!cstrspn_#t~short210;havoc cstrspn_#t~mem208;havoc cstrspn_#t~short210;havoc cstrspn_#t~mem209;cstrspn_#t~post211.base, cstrspn_#t~post211.offset := cstrspn_~s~0.base, cstrspn_~s~0.offset;cstrspn_~s~0.base, cstrspn_~s~0.offset := cstrspn_#t~post211.base, 1 + cstrspn_#t~post211.offset;havoc cstrspn_#t~post211.base, cstrspn_#t~post211.offset; 189#L372-5 [2019-11-16 00:25:12,461 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:25:12,461 INFO L82 PathProgramCache]: Analyzing trace with hash 1806935595, now seen corresponding path program 1 times [2019-11-16 00:25:12,461 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:25:12,461 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2051946335] [2019-11-16 00:25:12,462 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:25:12,462 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:25:12,462 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:25:12,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:25:12,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:25:12,493 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-16 00:25:12,493 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:25:12,493 INFO L82 PathProgramCache]: Analyzing trace with hash 58692, now seen corresponding path program 1 times [2019-11-16 00:25:12,493 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:25:12,494 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1241106132] [2019-11-16 00:25:12,494 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:25:12,494 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:25:12,494 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:25:12,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:25:12,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:25:12,504 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-16 00:25:12,504 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:25:12,504 INFO L82 PathProgramCache]: Analyzing trace with hash 1593218778, now seen corresponding path program 1 times [2019-11-16 00:25:12,505 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:25:12,505 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [80037197] [2019-11-16 00:25:12,505 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:25:12,505 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:25:12,505 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:25:12,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:25:12,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:25:12,564 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-16 00:25:12,698 WARN L191 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 38 [2019-11-16 00:25:12,821 WARN L191 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 36 DAG size of output: 35 [2019-11-16 00:25:13,203 WARN L191 SmtUtils]: Spent 380.00 ms on a formula simplification. DAG size of input: 117 DAG size of output: 103 [2019-11-16 00:25:13,334 WARN L191 SmtUtils]: Spent 127.00 ms on a formula simplification that was a NOOP. DAG size: 95 [2019-11-16 00:25:13,337 INFO L210 LassoAnalysis]: Preferences: [2019-11-16 00:25:13,337 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-11-16 00:25:13,337 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-16 00:25:13,338 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-11-16 00:25:13,338 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-11-16 00:25:13,338 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-16 00:25:13,338 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-16 00:25:13,338 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-11-16 00:25:13,338 INFO L131 ssoRankerPreferences]: Filename of dumped script: cstrspn_malloc.i_Iteration3_Lasso [2019-11-16 00:25:13,338 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-16 00:25:13,338 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-16 00:25:13,345 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-16 00:25:13,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-16 00:25:13,352 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:25:13,353 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:25:13,355 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-16 00:25:13,357 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-16 00:25:13,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-16 00:25:13,360 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:25:13,362 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-16 00:25:13,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-16 00:25:13,365 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:25:13,370 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:25:13,372 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:25:13,373 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:25:13,375 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-16 00:25:13,377 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-16 00:25:13,733 WARN L191 SmtUtils]: Spent 257.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 80 [2019-11-16 00:25:13,835 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-16 00:25:13,837 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-16 00:25:13,839 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-16 00:25:14,636 WARN L191 SmtUtils]: Spent 391.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 43 [2019-11-16 00:25:14,843 WARN L191 SmtUtils]: Spent 171.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 36 [2019-11-16 00:25:14,868 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-16 00:25:14,868 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-11-16 00:25:14,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-16 00:25:14,869 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:25:14,870 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:25:14,870 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:25:14,870 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:25:14,870 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:25:14,871 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:25:14,871 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:25:14,872 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:25:14,872 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-16 00:25:14,873 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:25:14,873 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:25:14,873 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:25:14,873 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:25:14,873 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:25:14,874 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:25:14,874 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:25:14,874 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:25:14,875 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-16 00:25:14,875 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:25:14,875 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:25:14,876 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:25:14,876 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:25:14,876 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:25:14,876 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:25:14,876 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:25:14,877 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:25:14,877 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-16 00:25:14,878 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:25:14,878 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:25:14,878 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:25:14,878 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:25:14,879 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:25:14,879 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:25:14,879 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:25:14,880 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:25:14,880 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-16 00:25:14,880 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:25:14,881 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:25:14,881 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:25:14,881 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:25:14,882 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-16 00:25:14,882 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-16 00:25:14,883 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:25:14,884 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-16 00:25:14,884 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:25:14,885 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:25:14,885 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:25:14,885 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:25:14,885 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:25:14,886 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:25:14,886 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:25:14,886 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:25:14,887 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-16 00:25:14,887 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:25:14,887 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:25:14,888 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:25:14,888 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:25:14,888 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:25:14,888 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:25:14,888 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:25:14,889 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:25:14,889 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-16 00:25:14,890 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:25:14,890 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:25:14,890 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:25:14,890 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:25:14,891 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-16 00:25:14,891 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-16 00:25:14,893 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:25:14,893 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-16 00:25:14,894 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:25:14,894 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:25:14,894 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:25:14,894 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:25:14,894 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:25:14,894 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:25:14,895 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:25:14,895 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:25:14,896 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:25:14,896 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:25:14,896 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:25:14,897 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:25:14,897 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:25:14,897 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:25:14,897 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:25:14,897 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:25:14,898 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:25:14,898 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:25:14,899 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:25:14,899 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:25:14,899 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:25:14,899 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:25:14,899 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:25:14,900 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:25:14,900 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:25:14,900 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:25:14,901 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-16 00:25:14,902 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:25:14,902 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:25:14,902 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:25:14,902 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:25:14,902 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:25:14,903 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:25:14,903 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:25:14,903 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:25:14,904 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-16 00:25:14,904 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:25:14,904 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:25:14,904 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:25:14,905 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:25:14,905 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:25:14,905 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:25:14,905 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:25:14,906 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:25:14,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-16 00:25:14,907 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:25:14,907 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:25:14,907 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:25:14,907 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:25:14,907 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:25:14,908 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:25:14,908 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:25:14,908 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:25:14,909 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-16 00:25:14,909 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:25:14,909 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:25:14,910 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:25:14,910 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:25:14,910 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:25:14,910 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:25:14,910 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:25:14,911 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:25:14,911 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-16 00:25:14,912 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:25:14,912 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:25:14,912 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:25:14,913 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:25:14,916 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-16 00:25:14,916 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-16 00:25:14,949 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-16 00:25:14,981 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2019-11-16 00:25:14,981 INFO L444 ModelExtractionUtils]: 48 out of 55 variables were initially zero. Simplification set additionally 4 variables to zero. [2019-11-16 00:25:14,982 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-16 00:25:14,983 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-11-16 00:25:14,983 INFO L510 LassoAnalysis]: Proved termination. [2019-11-16 00:25:14,983 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_cstrspn_~s~0.offset, v_rep(select #length ULTIMATE.start_cstrspn_~s~0.base)_2) = -1*ULTIMATE.start_cstrspn_~s~0.offset + 1*v_rep(select #length ULTIMATE.start_cstrspn_~s~0.base)_2 Supporting invariants [] [2019-11-16 00:25:15,038 INFO L297 tatePredicateManager]: 17 out of 17 supporting invariants were superfluous and have been removed [2019-11-16 00:25:15,039 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2019-11-16 00:25:15,054 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:25:15,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:25:15,073 INFO L256 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-16 00:25:15,073 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:25:15,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:25:15,080 INFO L256 TraceCheckSpWp]: Trace formula consists of 22 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-16 00:25:15,081 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:25:15,093 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-16 00:25:15,093 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-16 00:25:15,093 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 18 states and 25 transitions. cyclomatic complexity: 9 Second operand 3 states. [2019-11-16 00:25:15,121 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-16 00:25:15,122 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-16 00:25:15,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-11-16 00:25:15,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 18 transitions. [2019-11-16 00:25:15,123 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 18 transitions. Stem has 7 letters. Loop has 3 letters. [2019-11-16 00:25:15,123 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-16 00:25:15,123 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 18 transitions. Stem has 10 letters. Loop has 3 letters. [2019-11-16 00:25:15,123 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-16 00:25:15,123 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 18 transitions. Stem has 7 letters. Loop has 6 letters. [2019-11-16 00:25:15,124 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-16 00:25:15,124 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 43 states and 57 transitions. [2019-11-16 00:25:15,126 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-11-16 00:25:15,127 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 43 states to 30 states and 40 transitions. [2019-11-16 00:25:15,127 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2019-11-16 00:25:15,127 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2019-11-16 00:25:15,128 INFO L73 IsDeterministic]: Start isDeterministic. Operand 30 states and 40 transitions. [2019-11-16 00:25:15,128 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-16 00:25:15,128 INFO L688 BuchiCegarLoop]: Abstraction has 30 states and 40 transitions. [2019-11-16 00:25:15,128 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states and 40 transitions. [2019-11-16 00:25:15,130 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 24. [2019-11-16 00:25:15,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2019-11-16 00:25:15,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 33 transitions. [2019-11-16 00:25:15,131 INFO L711 BuchiCegarLoop]: Abstraction has 24 states and 33 transitions. [2019-11-16 00:25:15,131 INFO L591 BuchiCegarLoop]: Abstraction has 24 states and 33 transitions. [2019-11-16 00:25:15,131 INFO L424 BuchiCegarLoop]: ======== Iteration 4============ [2019-11-16 00:25:15,132 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 24 states and 33 transitions. [2019-11-16 00:25:15,132 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-11-16 00:25:15,133 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-16 00:25:15,133 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-16 00:25:15,133 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:25:15,133 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-11-16 00:25:15,134 INFO L791 eck$LassoCheckResult]: Stem: 369#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 362#L-1 havoc main_#res;havoc main_#t~nondet213, main_#t~nondet214, main_#t~malloc215.base, main_#t~malloc215.offset, main_#t~malloc216.base, main_#t~malloc216.offset, main_#t~ret217, main_~length1~0, main_~length2~0, main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset, main_~res~0;main_~length1~0 := main_#t~nondet213;havoc main_#t~nondet213;main_~length2~0 := main_#t~nondet214;havoc main_#t~nondet214; 363#L382 assume !(main_~length1~0 < 1); 364#L382-2 assume !(main_~length2~0 < 1); 361#L385-1 call main_#t~malloc215.base, main_#t~malloc215.offset := #Ultimate.allocOnHeap(main_~length1~0);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc215.base, main_#t~malloc215.offset;call main_#t~malloc216.base, main_#t~malloc216.offset := #Ultimate.allocOnHeap(main_~length2~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc216.base, main_#t~malloc216.offset;call write~int(0, main_~nondetString1~0.base, main_~nondetString1~0.offset + (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~mem207, cstrspn_#t~post211.base, cstrspn_#t~post211.offset, cstrspn_#t~mem208, cstrspn_#t~mem209, cstrspn_#t~short210, cstrspn_#t~mem212, cstrspn_#t~post205.base, cstrspn_#t~post205.offset, cstrspn_#t~mem206, 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; 357#L369-4 call cstrspn_#t~mem206 := read~int(cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset, 1); 358#L369-1 assume !!(0 != cstrspn_#t~mem206);havoc cstrspn_#t~mem206;cstrspn_~s~0.base, cstrspn_~s~0.offset := cstrspn_~s2.base, cstrspn_~s2.offset;call cstrspn_#t~mem207 := read~int(cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset, 1);cstrspn_~c~0 := cstrspn_#t~mem207;havoc cstrspn_#t~mem207; 371#L372-5 call cstrspn_#t~mem208 := read~int(cstrspn_~s~0.base, cstrspn_~s~0.offset, 1);cstrspn_#t~short210 := 0 != cstrspn_#t~mem208; 367#L372-1 assume !cstrspn_#t~short210; 368#L372-3 assume !cstrspn_#t~short210;havoc cstrspn_#t~mem208;havoc cstrspn_#t~short210;havoc cstrspn_#t~mem209; 353#L372-6 call cstrspn_#t~mem212 := read~int(cstrspn_~s~0.base, cstrspn_~s~0.offset, 1); 354#L374 assume !(cstrspn_#t~mem212 != cstrspn_~c~0);havoc cstrspn_#t~mem212; 355#L369-3 cstrspn_#t~post205.base, cstrspn_#t~post205.offset := cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset;cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset := cstrspn_#t~post205.base, 1 + cstrspn_#t~post205.offset;havoc cstrspn_#t~post205.base, cstrspn_#t~post205.offset; 356#L369-4 call cstrspn_#t~mem206 := read~int(cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset, 1); 360#L369-1 assume !!(0 != cstrspn_#t~mem206);havoc cstrspn_#t~mem206;cstrspn_~s~0.base, cstrspn_~s~0.offset := cstrspn_~s2.base, cstrspn_~s2.offset;call cstrspn_#t~mem207 := read~int(cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset, 1);cstrspn_~c~0 := cstrspn_#t~mem207;havoc cstrspn_#t~mem207; 370#L372-5 [2019-11-16 00:25:15,134 INFO L793 eck$LassoCheckResult]: Loop: 370#L372-5 call cstrspn_#t~mem208 := read~int(cstrspn_~s~0.base, cstrspn_~s~0.offset, 1);cstrspn_#t~short210 := 0 != cstrspn_#t~mem208; 365#L372-1 assume cstrspn_#t~short210;call cstrspn_#t~mem209 := read~int(cstrspn_~s~0.base, cstrspn_~s~0.offset, 1);cstrspn_#t~short210 := cstrspn_#t~mem209 != (if cstrspn_~c~0 % 256 <= 127 then cstrspn_~c~0 % 256 else cstrspn_~c~0 % 256 - 256); 366#L372-3 assume !!cstrspn_#t~short210;havoc cstrspn_#t~mem208;havoc cstrspn_#t~short210;havoc cstrspn_#t~mem209;cstrspn_#t~post211.base, cstrspn_#t~post211.offset := cstrspn_~s~0.base, cstrspn_~s~0.offset;cstrspn_~s~0.base, cstrspn_~s~0.offset := cstrspn_#t~post211.base, 1 + cstrspn_#t~post211.offset;havoc cstrspn_#t~post211.base, cstrspn_#t~post211.offset; 370#L372-5 [2019-11-16 00:25:15,134 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:25:15,134 INFO L82 PathProgramCache]: Analyzing trace with hash 1587378397, now seen corresponding path program 1 times [2019-11-16 00:25:15,134 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:25:15,135 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1894619557] [2019-11-16 00:25:15,135 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:25:15,135 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:25:15,135 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:25:15,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:25:15,208 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-16 00:25:15,209 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1894619557] [2019-11-16 00:25:15,209 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:25:15,209 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-16 00:25:15,209 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1716973754] [2019-11-16 00:25:15,210 INFO L796 eck$LassoCheckResult]: stem already infeasible [2019-11-16 00:25:15,210 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:25:15,210 INFO L82 PathProgramCache]: Analyzing trace with hash 58692, now seen corresponding path program 2 times [2019-11-16 00:25:15,210 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:25:15,210 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2109909758] [2019-11-16 00:25:15,210 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:25:15,210 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:25:15,210 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:25:15,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:25:15,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:25:15,218 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-16 00:25:15,395 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:25:15,395 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-16 00:25:15,396 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-11-16 00:25:15,396 INFO L87 Difference]: Start difference. First operand 24 states and 33 transitions. cyclomatic complexity: 12 Second operand 7 states. [2019-11-16 00:25:15,466 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:25:15,466 INFO L93 Difference]: Finished difference Result 30 states and 39 transitions. [2019-11-16 00:25:15,466 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-16 00:25:15,466 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 30 states and 39 transitions. [2019-11-16 00:25:15,467 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2019-11-16 00:25:15,469 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 30 states to 27 states and 35 transitions. [2019-11-16 00:25:15,469 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2019-11-16 00:25:15,469 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2019-11-16 00:25:15,469 INFO L73 IsDeterministic]: Start isDeterministic. Operand 27 states and 35 transitions. [2019-11-16 00:25:15,469 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-16 00:25:15,470 INFO L688 BuchiCegarLoop]: Abstraction has 27 states and 35 transitions. [2019-11-16 00:25:15,470 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states and 35 transitions. [2019-11-16 00:25:15,471 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 25. [2019-11-16 00:25:15,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2019-11-16 00:25:15,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 33 transitions. [2019-11-16 00:25:15,472 INFO L711 BuchiCegarLoop]: Abstraction has 25 states and 33 transitions. [2019-11-16 00:25:15,472 INFO L591 BuchiCegarLoop]: Abstraction has 25 states and 33 transitions. [2019-11-16 00:25:15,472 INFO L424 BuchiCegarLoop]: ======== Iteration 5============ [2019-11-16 00:25:15,472 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 25 states and 33 transitions. [2019-11-16 00:25:15,473 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-11-16 00:25:15,473 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-16 00:25:15,473 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-16 00:25:15,474 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:25:15,474 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-11-16 00:25:15,474 INFO L791 eck$LassoCheckResult]: Stem: 437#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 434#L-1 havoc main_#res;havoc main_#t~nondet213, main_#t~nondet214, main_#t~malloc215.base, main_#t~malloc215.offset, main_#t~malloc216.base, main_#t~malloc216.offset, main_#t~ret217, main_~length1~0, main_~length2~0, main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset, main_~res~0;main_~length1~0 := main_#t~nondet213;havoc main_#t~nondet213;main_~length2~0 := main_#t~nondet214;havoc main_#t~nondet214; 435#L382 assume !(main_~length1~0 < 1); 436#L382-2 assume !(main_~length2~0 < 1); 433#L385-1 call main_#t~malloc215.base, main_#t~malloc215.offset := #Ultimate.allocOnHeap(main_~length1~0);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc215.base, main_#t~malloc215.offset;call main_#t~malloc216.base, main_#t~malloc216.offset := #Ultimate.allocOnHeap(main_~length2~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc216.base, main_#t~malloc216.offset;call write~int(0, main_~nondetString1~0.base, main_~nondetString1~0.offset + (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~mem207, cstrspn_#t~post211.base, cstrspn_#t~post211.offset, cstrspn_#t~mem208, cstrspn_#t~mem209, cstrspn_#t~short210, cstrspn_#t~mem212, cstrspn_#t~post205.base, cstrspn_#t~post205.offset, cstrspn_#t~mem206, 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; 429#L369-4 call cstrspn_#t~mem206 := read~int(cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset, 1); 430#L369-1 assume !!(0 != cstrspn_#t~mem206);havoc cstrspn_#t~mem206;cstrspn_~s~0.base, cstrspn_~s~0.offset := cstrspn_~s2.base, cstrspn_~s2.offset;call cstrspn_#t~mem207 := read~int(cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset, 1);cstrspn_~c~0 := cstrspn_#t~mem207;havoc cstrspn_#t~mem207; 443#L372-5 call cstrspn_#t~mem208 := read~int(cstrspn_~s~0.base, cstrspn_~s~0.offset, 1);cstrspn_#t~short210 := 0 != cstrspn_#t~mem208; 447#L372-1 assume cstrspn_#t~short210;call cstrspn_#t~mem209 := read~int(cstrspn_~s~0.base, cstrspn_~s~0.offset, 1);cstrspn_#t~short210 := cstrspn_#t~mem209 != (if cstrspn_~c~0 % 256 <= 127 then cstrspn_~c~0 % 256 else cstrspn_~c~0 % 256 - 256); 446#L372-3 assume !cstrspn_#t~short210;havoc cstrspn_#t~mem208;havoc cstrspn_#t~short210;havoc cstrspn_#t~mem209; 425#L372-6 call cstrspn_#t~mem212 := read~int(cstrspn_~s~0.base, cstrspn_~s~0.offset, 1); 426#L374 assume !(cstrspn_#t~mem212 != cstrspn_~c~0);havoc cstrspn_#t~mem212; 427#L369-3 cstrspn_#t~post205.base, cstrspn_#t~post205.offset := cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset;cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset := cstrspn_#t~post205.base, 1 + cstrspn_#t~post205.offset;havoc cstrspn_#t~post205.base, cstrspn_#t~post205.offset; 428#L369-4 call cstrspn_#t~mem206 := read~int(cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset, 1); 432#L369-1 assume !!(0 != cstrspn_#t~mem206);havoc cstrspn_#t~mem206;cstrspn_~s~0.base, cstrspn_~s~0.offset := cstrspn_~s2.base, cstrspn_~s2.offset;call cstrspn_#t~mem207 := read~int(cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset, 1);cstrspn_~c~0 := cstrspn_#t~mem207;havoc cstrspn_#t~mem207; 442#L372-5 [2019-11-16 00:25:15,474 INFO L793 eck$LassoCheckResult]: Loop: 442#L372-5 call cstrspn_#t~mem208 := read~int(cstrspn_~s~0.base, cstrspn_~s~0.offset, 1);cstrspn_#t~short210 := 0 != cstrspn_#t~mem208; 438#L372-1 assume cstrspn_#t~short210;call cstrspn_#t~mem209 := read~int(cstrspn_~s~0.base, cstrspn_~s~0.offset, 1);cstrspn_#t~short210 := cstrspn_#t~mem209 != (if cstrspn_~c~0 % 256 <= 127 then cstrspn_~c~0 % 256 else cstrspn_~c~0 % 256 - 256); 439#L372-3 assume !!cstrspn_#t~short210;havoc cstrspn_#t~mem208;havoc cstrspn_#t~short210;havoc cstrspn_#t~mem209;cstrspn_#t~post211.base, cstrspn_#t~post211.offset := cstrspn_~s~0.base, cstrspn_~s~0.offset;cstrspn_~s~0.base, cstrspn_~s~0.offset := cstrspn_#t~post211.base, 1 + cstrspn_#t~post211.offset;havoc cstrspn_#t~post211.base, cstrspn_#t~post211.offset; 442#L372-5 [2019-11-16 00:25:15,474 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:25:15,474 INFO L82 PathProgramCache]: Analyzing trace with hash -187628965, now seen corresponding path program 2 times [2019-11-16 00:25:15,475 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:25:15,475 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1561744303] [2019-11-16 00:25:15,475 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:25:15,475 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:25:15,475 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:25:15,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:25:15,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:25:15,501 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-16 00:25:15,501 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:25:15,502 INFO L82 PathProgramCache]: Analyzing trace with hash 58692, now seen corresponding path program 3 times [2019-11-16 00:25:15,502 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:25:15,502 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1910618123] [2019-11-16 00:25:15,502 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:25:15,502 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:25:15,503 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:25:15,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:25:15,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:25:15,510 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-16 00:25:15,510 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:25:15,510 INFO L82 PathProgramCache]: Analyzing trace with hash -1902015318, now seen corresponding path program 1 times [2019-11-16 00:25:15,511 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:25:15,511 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1823687914] [2019-11-16 00:25:15,511 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:25:15,511 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:25:15,511 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:25:15,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:25:15,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:25:15,539 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-16 00:25:16,315 WARN L191 SmtUtils]: Spent 599.00 ms on a formula simplification. DAG size of input: 175 DAG size of output: 140 [2019-11-16 00:25:17,330 WARN L191 SmtUtils]: Spent 993.00 ms on a formula simplification. DAG size of input: 112 DAG size of output: 112 [2019-11-16 00:25:17,332 INFO L210 LassoAnalysis]: Preferences: [2019-11-16 00:25:17,333 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-11-16 00:25:17,333 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-16 00:25:17,333 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-11-16 00:25:17,333 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-11-16 00:25:17,333 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-16 00:25:17,333 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-16 00:25:17,333 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-11-16 00:25:17,333 INFO L131 ssoRankerPreferences]: Filename of dumped script: cstrspn_malloc.i_Iteration5_Lasso [2019-11-16 00:25:17,333 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-16 00:25:17,333 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-16 00:25:17,340 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:25:17,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-16 00:25:17,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-16 00:25:17,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-16 00:25:17,350 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-16 00:25:17,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-16 00:25:17,353 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:25:17,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-16 00:25:17,368 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:25:17,371 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-16 00:25:17,374 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:25:17,376 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:25:17,378 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:25:17,380 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:25:17,383 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-16 00:25:17,385 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-16 00:25:17,387 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-16 00:25:17,592 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2019-11-16 00:25:18,475 WARN L191 SmtUtils]: Spent 877.00 ms on a formula simplification. DAG size of input: 115 DAG size of output: 100 [2019-11-16 00:25:18,609 WARN L191 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 60 [2019-11-16 00:25:18,609 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:25:18,611 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:25:19,290 WARN L191 SmtUtils]: Spent 264.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 39 [2019-11-16 00:25:19,449 WARN L191 SmtUtils]: Spent 159.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 36 [2019-11-16 00:25:19,909 WARN L191 SmtUtils]: Spent 339.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 43 [2019-11-16 00:25:19,937 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-16 00:25:19,937 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-11-16 00:25:19,937 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-16 00:25:19,941 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:25:19,941 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:25:19,941 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:25:19,941 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:25:19,942 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:25:19,942 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:25:19,942 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:25:19,942 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:25:19,943 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-16 00:25:19,943 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:25:19,943 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:25:19,944 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:25:19,944 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:25:19,944 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:25:19,944 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:25:19,944 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:25:19,945 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:25:19,945 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:25:19,946 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:25:19,946 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:25:19,946 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:25:19,946 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:25:19,947 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-16 00:25:19,947 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-16 00:25:19,949 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:25:19,952 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-16 00:25:19,955 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:25:19,955 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:25:19,955 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:25:19,956 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:25:19,956 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:25:19,956 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:25:19,956 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:25:19,956 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:25:19,957 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:25:19,958 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:25:19,958 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:25:19,958 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:25:19,959 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:25:19,959 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:25:19,959 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:25:19,959 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:25:19,960 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:25:19,960 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-16 00:25:19,962 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:25:19,962 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:25:19,963 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:25:19,963 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:25:19,963 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:25:19,963 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:25:19,964 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:25:19,966 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:25:19,966 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-16 00:25:19,967 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:25:19,967 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:25:19,967 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:25:19,968 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:25:19,968 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:25:19,970 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:25:19,971 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:25:19,971 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:25:19,975 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-16 00:25:19,975 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:25:19,975 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:25:19,975 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:25:19,976 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:25:19,976 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:25:19,976 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:25:19,976 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:25:19,977 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:25:19,977 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-16 00:25:19,977 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:25:19,978 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:25:19,978 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:25:19,978 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:25:19,978 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:25:19,978 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:25:19,978 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:25:19,979 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:25:19,979 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-16 00:25:19,979 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:25:19,980 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:25:19,980 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:25:19,980 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:25:19,980 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-16 00:25:19,981 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-16 00:25:19,981 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:25:19,982 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-16 00:25:19,982 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:25:19,982 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:25:19,982 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:25:19,983 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:25:19,983 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:25:19,983 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:25:19,983 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:25:19,983 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:25:19,984 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-16 00:25:19,984 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:25:19,984 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:25:19,984 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:25:19,984 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:25:19,985 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:25:19,985 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:25:19,985 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:25:19,985 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:25:19,986 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-16 00:25:19,986 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:25:19,986 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:25:19,986 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:25:19,986 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:25:19,986 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:25:19,987 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:25:19,987 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:25:19,987 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:25:19,987 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-16 00:25:19,988 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:25:19,988 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:25:19,988 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:25:19,988 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:25:19,988 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:25:19,989 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:25:19,989 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:25:19,989 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:25:19,989 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-16 00:25:19,990 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:25:19,990 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:25:19,990 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:25:19,991 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:25:19,991 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:25:19,991 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:25:19,992 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:25:19,995 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:25:19,995 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-16 00:25:20,000 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:25:20,001 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:25:20,001 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:25:20,001 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:25:20,001 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:25:20,002 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:25:20,002 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:25:20,002 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:25:20,003 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-16 00:25:20,003 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:25:20,003 INFO L202 nArgumentSynthesizer]: 4 stem disjuncts [2019-11-16 00:25:20,004 INFO L203 nArgumentSynthesizer]: 6 loop disjuncts [2019-11-16 00:25:20,004 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:25:20,043 INFO L400 nArgumentSynthesizer]: We have 132 Motzkin's Theorem applications. [2019-11-16 00:25:20,044 INFO L401 nArgumentSynthesizer]: A total of 12 supporting invariants were added. [2019-11-16 00:25:20,344 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:25:20,344 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-16 00:25:20,345 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:25:20,345 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:25:20,345 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:25:20,346 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:25:20,347 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-16 00:25:20,347 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-16 00:25:20,349 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:25:20,351 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-16 00:25:20,352 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:25:20,352 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:25:20,352 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:25:20,352 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:25:20,354 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-16 00:25:20,354 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-16 00:25:20,361 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:25:20,361 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-16 00:25:20,362 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:25:20,362 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:25:20,362 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:25:20,362 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:25:20,365 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-16 00:25:20,365 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-16 00:25:20,418 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-16 00:25:20,472 INFO L443 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. [2019-11-16 00:25:20,483 INFO L444 ModelExtractionUtils]: 53 out of 58 variables were initially zero. Simplification set additionally 2 variables to zero. [2019-11-16 00:25:20,483 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-16 00:25:20,484 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-11-16 00:25:20,485 INFO L510 LassoAnalysis]: Proved termination. [2019-11-16 00:25:20,485 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-16 00:25:20,642 INFO L297 tatePredicateManager]: 30 out of 30 supporting invariants were superfluous and have been removed [2019-11-16 00:25:20,643 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2019-11-16 00:25:20,653 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:25:20,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:25:20,672 INFO L256 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-16 00:25:20,672 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:25:20,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:25:20,679 INFO L256 TraceCheckSpWp]: Trace formula consists of 22 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-16 00:25:20,679 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:25:20,688 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-16 00:25:20,688 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-16 00:25:20,688 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 25 states and 33 transitions. cyclomatic complexity: 11 Second operand 3 states. [2019-11-16 00:25:20,710 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-16 00:25:20,713 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-16 00:25:20,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-11-16 00:25:20,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 18 transitions. [2019-11-16 00:25:20,714 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 18 transitions. Stem has 15 letters. Loop has 3 letters. [2019-11-16 00:25:20,714 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-16 00:25:20,714 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-11-16 00:25:20,726 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:25:20,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:25:20,746 INFO L256 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-16 00:25:20,747 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:25:20,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:25:20,754 INFO L256 TraceCheckSpWp]: Trace formula consists of 22 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-16 00:25:20,755 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:25:20,763 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-16 00:25:20,763 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-16 00:25:20,764 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 25 states and 33 transitions. cyclomatic complexity: 11 Second operand 3 states. [2019-11-16 00:25:20,780 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-16 00:25:20,783 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-16 00:25:20,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-11-16 00:25:20,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 18 transitions. [2019-11-16 00:25:20,783 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 18 transitions. Stem has 15 letters. Loop has 3 letters. [2019-11-16 00:25:20,784 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-16 00:25:20,784 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-11-16 00:25:20,795 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:25:20,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:25:20,815 INFO L256 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-16 00:25:20,816 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:25:20,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:25:20,827 INFO L256 TraceCheckSpWp]: Trace formula consists of 22 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-16 00:25:20,827 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:25:20,843 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-16 00:25:20,844 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-16 00:25:20,844 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 25 states and 33 transitions. cyclomatic complexity: 11 Second operand 3 states. [2019-11-16 00:25:20,869 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-16 00:25:20,869 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-16 00:25:20,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-11-16 00:25:20,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 27 transitions. [2019-11-16 00:25:20,870 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 27 transitions. Stem has 15 letters. Loop has 3 letters. [2019-11-16 00:25:20,870 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-16 00:25:20,870 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 27 transitions. Stem has 18 letters. Loop has 3 letters. [2019-11-16 00:25:20,871 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-16 00:25:20,871 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 27 transitions. Stem has 15 letters. Loop has 6 letters. [2019-11-16 00:25:20,871 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-16 00:25:20,872 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 41 states and 53 transitions. [2019-11-16 00:25:20,874 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-11-16 00:25:20,874 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 41 states to 0 states and 0 transitions. [2019-11-16 00:25:20,874 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2019-11-16 00:25:20,874 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2019-11-16 00:25:20,874 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2019-11-16 00:25:20,874 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-16 00:25:20,874 INFO L688 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-16 00:25:20,874 INFO L711 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-16 00:25:20,875 INFO L591 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-16 00:25:20,875 INFO L424 BuchiCegarLoop]: ======== Iteration 6============ [2019-11-16 00:25:20,875 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2019-11-16 00:25:20,875 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-11-16 00:25:20,875 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2019-11-16 00:25:20,880 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 16.11 12:25:20 BoogieIcfgContainer [2019-11-16 00:25:20,880 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2019-11-16 00:25:20,881 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-16 00:25:20,881 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-16 00:25:20,881 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-16 00:25:20,881 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 12:25:08" (3/4) ... [2019-11-16 00:25:20,884 INFO L140 WitnessPrinter]: No result that supports witness generation found [2019-11-16 00:25:20,884 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-16 00:25:20,885 INFO L168 Benchmark]: Toolchain (without parser) took 13438.41 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 320.9 MB). Free memory was 939.4 MB in the beginning and 1.2 GB in the end (delta: -267.0 MB). Peak memory consumption was 53.8 MB. Max. memory is 11.5 GB. [2019-11-16 00:25:20,886 INFO L168 Benchmark]: CDTParser took 0.24 ms. Allocated memory is still 1.0 GB. Free memory is still 962.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-16 00:25:20,886 INFO L168 Benchmark]: CACSL2BoogieTranslator took 653.38 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 147.8 MB). Free memory was 939.4 MB in the beginning and 1.1 GB in the end (delta: -185.8 MB). Peak memory consumption was 17.7 MB. Max. memory is 11.5 GB. [2019-11-16 00:25:20,887 INFO L168 Benchmark]: Boogie Procedure Inliner took 60.09 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. [2019-11-16 00:25:20,887 INFO L168 Benchmark]: Boogie Preprocessor took 29.76 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-16 00:25:20,888 INFO L168 Benchmark]: RCFGBuilder took 307.20 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-16 00:25:20,888 INFO L168 Benchmark]: BuchiAutomizer took 12380.33 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 173.0 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -110.3 MB). Peak memory consumption was 62.7 MB. Max. memory is 11.5 GB. [2019-11-16 00:25:20,889 INFO L168 Benchmark]: Witness Printer took 3.57 ms. Allocated memory is still 1.4 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-16 00:25:20,891 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.24 ms. Allocated memory is still 1.0 GB. Free memory is still 962.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 653.38 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 147.8 MB). Free memory was 939.4 MB in the beginning and 1.1 GB in the end (delta: -185.8 MB). Peak memory consumption was 17.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 60.09 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 29.76 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 307.20 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 12380.33 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 173.0 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -110.3 MB). Peak memory consumption was 62.7 MB. Max. memory is 11.5 GB. * Witness Printer took 3.57 ms. Allocated memory is still 1.4 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 5 terminating modules (2 trivial, 2 deterministic, 1 nondeterministic). One deterministic module has affine ranking function -1 * sc1 + unknown-#length-unknown[sc1] and consists of 3 locations. One deterministic module has affine ranking function -1 * s + unknown-#length-unknown[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 12.3s and 6 iterations. TraceHistogramMax:2. Analysis of lassos took 11.6s. Construction of modules took 0.0s. Büchi inclusion checks took 0.4s. Highest rank in rank-based complementation 3. Minimization of det autom 2. Minimization of nondet autom 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, 104 SDslu, 52 SDs, 0 SdLazy, 97 SolverSat, 11 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time LassoAnalysisResults: nont0 unkn0 SFLI1 SFLT0 conc0 concLT0 SILN0 SILU1 SILI0 SILT0 lasso3 LassoPreprocessingBenchmarks: Lassos: inital382 mio100 ax100 hnf99 lsp91 ukn73 mio100 lsp32 div126 bol100 ite100 ukn100 eq172 hnf81 smp96 dnf599 smp43 tf100 neg96 sie110 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 341ms 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...