./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/array-memsafety/cstrncpy-alloca-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version cad46833 Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_1b43bee9-eeac-4544-9dd4-ed1a67cfb752/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_1b43bee9-eeac-4544-9dd4-ed1a67cfb752/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_1b43bee9-eeac-4544-9dd4-ed1a67cfb752/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_1b43bee9-eeac-4544-9dd4-ed1a67cfb752/bin/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/array-memsafety/cstrncpy-alloca-2.i -s /tmp/vcloud-vcloud-master/worker/run_dir_1b43bee9-eeac-4544-9dd4-ed1a67cfb752/bin/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_1b43bee9-eeac-4544-9dd4-ed1a67cfb752/bin/uautomizer --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 836fc197f01e8142cd1fe75cc7c363600c112d62 ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-cad4683 [2019-11-15 23:47:27,553 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-15 23:47:27,554 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-15 23:47:27,565 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-15 23:47:27,565 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-15 23:47:27,566 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-15 23:47:27,567 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-15 23:47:27,569 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-15 23:47:27,571 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-15 23:47:27,572 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-15 23:47:27,573 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-15 23:47:27,574 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-15 23:47:27,574 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-15 23:47:27,575 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-15 23:47:27,576 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-15 23:47:27,577 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-15 23:47:27,578 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-15 23:47:27,578 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-15 23:47:27,580 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-15 23:47:27,582 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-15 23:47:27,583 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-15 23:47:27,584 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-15 23:47:27,585 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-15 23:47:27,586 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-15 23:47:27,588 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-15 23:47:27,589 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-15 23:47:27,589 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-15 23:47:27,590 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-15 23:47:27,590 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-15 23:47:27,591 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-15 23:47:27,591 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-15 23:47:27,592 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-15 23:47:27,593 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-15 23:47:27,593 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-15 23:47:27,598 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-15 23:47:27,598 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-15 23:47:27,599 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-15 23:47:27,599 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-15 23:47:27,599 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-15 23:47:27,602 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-15 23:47:27,602 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-15 23:47:27,607 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_1b43bee9-eeac-4544-9dd4-ed1a67cfb752/bin/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf [2019-11-15 23:47:27,623 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-15 23:47:27,624 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-15 23:47:27,625 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-15 23:47:27,626 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-15 23:47:27,626 INFO L138 SettingsManager]: * Use SBE=true [2019-11-15 23:47:27,626 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-11-15 23:47:27,626 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-11-15 23:47:27,627 INFO L138 SettingsManager]: * Use old map elimination=false [2019-11-15 23:47:27,627 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2019-11-15 23:47:27,627 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2019-11-15 23:47:27,628 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-11-15 23:47:27,629 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-15 23:47:27,629 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-15 23:47:27,629 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-11-15 23:47:27,629 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-15 23:47:27,629 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-15 23:47:27,630 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-15 23:47:27,630 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-11-15 23:47:27,630 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-11-15 23:47:27,630 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-11-15 23:47:27,631 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-15 23:47:27,631 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-15 23:47:27,631 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-11-15 23:47:27,631 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-15 23:47:27,632 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-11-15 23:47:27,632 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-15 23:47:27,632 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-15 23:47:27,632 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-11-15 23:47:27,633 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-15 23:47:27,633 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-15 23:47:27,633 INFO L138 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-11-15 23:47:27,634 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-11-15 23:47:27,635 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_1b43bee9-eeac-4544-9dd4-ed1a67cfb752/bin/uautomizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(F end) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 836fc197f01e8142cd1fe75cc7c363600c112d62 [2019-11-15 23:47:27,681 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-15 23:47:27,691 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-15 23:47:27,708 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-15 23:47:27,709 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-15 23:47:27,709 INFO L275 PluginConnector]: CDTParser initialized [2019-11-15 23:47:27,710 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_1b43bee9-eeac-4544-9dd4-ed1a67cfb752/bin/uautomizer/../../sv-benchmarks/c/array-memsafety/cstrncpy-alloca-2.i [2019-11-15 23:47:27,766 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_1b43bee9-eeac-4544-9dd4-ed1a67cfb752/bin/uautomizer/data/e5ad4f167/cfaa8888d906452b89064641fc00a116/FLAG0732b87a2 [2019-11-15 23:47:28,281 INFO L306 CDTParser]: Found 1 translation units. [2019-11-15 23:47:28,281 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_1b43bee9-eeac-4544-9dd4-ed1a67cfb752/sv-benchmarks/c/array-memsafety/cstrncpy-alloca-2.i [2019-11-15 23:47:28,304 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_1b43bee9-eeac-4544-9dd4-ed1a67cfb752/bin/uautomizer/data/e5ad4f167/cfaa8888d906452b89064641fc00a116/FLAG0732b87a2 [2019-11-15 23:47:28,778 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_1b43bee9-eeac-4544-9dd4-ed1a67cfb752/bin/uautomizer/data/e5ad4f167/cfaa8888d906452b89064641fc00a116 [2019-11-15 23:47:28,780 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-15 23:47:28,781 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-15 23:47:28,782 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-15 23:47:28,782 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-15 23:47:28,785 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-15 23:47:28,786 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 11:47:28" (1/1) ... [2019-11-15 23:47:28,788 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@44354b5a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:47:28, skipping insertion in model container [2019-11-15 23:47:28,788 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 11:47:28" (1/1) ... [2019-11-15 23:47:28,795 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-15 23:47:28,829 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-15 23:47:29,180 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-15 23:47:29,190 INFO L188 MainTranslator]: Completed pre-run [2019-11-15 23:47:29,227 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-15 23:47:29,272 INFO L192 MainTranslator]: Completed translation [2019-11-15 23:47:29,272 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:47:29 WrapperNode [2019-11-15 23:47:29,273 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-15 23:47:29,273 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-15 23:47:29,274 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-15 23:47:29,274 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-15 23:47:29,281 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:47:29" (1/1) ... [2019-11-15 23:47:29,301 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:47:29" (1/1) ... [2019-11-15 23:47:29,320 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-15 23:47:29,321 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-15 23:47:29,321 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-15 23:47:29,321 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-15 23:47:29,328 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:47:29" (1/1) ... [2019-11-15 23:47:29,329 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:47:29" (1/1) ... [2019-11-15 23:47:29,332 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:47:29" (1/1) ... [2019-11-15 23:47:29,332 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:47:29" (1/1) ... [2019-11-15 23:47:29,339 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:47:29" (1/1) ... [2019-11-15 23:47:29,346 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:47:29" (1/1) ... [2019-11-15 23:47:29,347 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:47:29" (1/1) ... [2019-11-15 23:47:29,352 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-15 23:47:29,353 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-15 23:47:29,353 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-15 23:47:29,354 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-15 23:47:29,355 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:47:29" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_1b43bee9-eeac-4544-9dd4-ed1a67cfb752/bin/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 23:47:29,430 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-11-15 23:47:29,430 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-11-15 23:47:29,430 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-15 23:47:29,431 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-15 23:47:29,431 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-15 23:47:29,431 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-15 23:47:29,682 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-15 23:47:29,682 INFO L284 CfgBuilder]: Removed 9 assume(true) statements. [2019-11-15 23:47:29,683 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 11:47:29 BoogieIcfgContainer [2019-11-15 23:47:29,683 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-15 23:47:29,684 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-11-15 23:47:29,684 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-11-15 23:47:29,687 INFO L275 PluginConnector]: BuchiAutomizer initialized [2019-11-15 23:47:29,688 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-15 23:47:29,688 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 15.11 11:47:28" (1/3) ... [2019-11-15 23:47:29,689 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@3e4439f2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 15.11 11:47:29, skipping insertion in model container [2019-11-15 23:47:29,689 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-15 23:47:29,689 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:47:29" (2/3) ... [2019-11-15 23:47:29,690 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@3e4439f2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 15.11 11:47:29, skipping insertion in model container [2019-11-15 23:47:29,690 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-15 23:47:29,690 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 11:47:29" (3/3) ... [2019-11-15 23:47:29,692 INFO L371 chiAutomizerObserver]: Analyzing ICFG cstrncpy-alloca-2.i [2019-11-15 23:47:29,737 INFO L356 BuchiCegarLoop]: Interprodecural is true [2019-11-15 23:47:29,738 INFO L357 BuchiCegarLoop]: Hoare is false [2019-11-15 23:47:29,738 INFO L358 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-11-15 23:47:29,738 INFO L359 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-15 23:47:29,738 INFO L360 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-15 23:47:29,738 INFO L361 BuchiCegarLoop]: Difference is false [2019-11-15 23:47:29,738 INFO L362 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-15 23:47:29,739 INFO L365 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-11-15 23:47:29,751 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states. [2019-11-15 23:47:29,786 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 6 [2019-11-15 23:47:29,791 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 23:47:29,791 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 23:47:29,797 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2019-11-15 23:47:29,797 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-11-15 23:47:29,797 INFO L424 BuchiCegarLoop]: ======== Iteration 1============ [2019-11-15 23:47:29,797 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states. [2019-11-15 23:47:29,798 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 6 [2019-11-15 23:47:29,798 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 23:47:29,799 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 23:47:29,799 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2019-11-15 23:47:29,799 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-11-15 23:47:29,804 INFO L791 eck$LassoCheckResult]: Stem: 11#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 9#L-1true havoc main_#res;havoc main_#t~nondet8, main_#t~nondet9, main_#t~malloc10.base, main_#t~malloc10.offset, main_#t~malloc11.base, main_#t~malloc11.offset, main_#t~nondet13, main_#t~post12, main_~i~0, main_#t~ret14.base, main_#t~ret14.offset, main_~length~0, main_~n~0, main_~nondetArea~0.base, main_~nondetArea~0.offset, main_~nondetString~0.base, main_~nondetString~0.offset;main_~length~0 := main_#t~nondet8;havoc main_#t~nondet8;main_~n~0 := main_#t~nondet9;havoc main_#t~nondet9; 4#L535true assume !(main_~length~0 < 1); 6#L535-2true assume !(main_~n~0 < 1); 3#L538-1true call main_#t~malloc10.base, main_#t~malloc10.offset := #Ultimate.allocOnStack(main_~n~0);main_~nondetArea~0.base, main_~nondetArea~0.offset := main_#t~malloc10.base, main_#t~malloc10.offset;call main_#t~malloc11.base, main_#t~malloc11.offset := #Ultimate.allocOnStack(main_~length~0);main_~nondetString~0.base, main_~nondetString~0.offset := main_#t~malloc11.base, main_#t~malloc11.offset;main_~i~0 := 0; 12#L544-3true [2019-11-15 23:47:29,804 INFO L793 eck$LassoCheckResult]: Loop: 12#L544-3true assume !!(main_~i~0 < main_~length~0 - 1);call write~int(main_#t~nondet13, main_~nondetString~0.base, main_~nondetString~0.offset + main_~i~0, 1);havoc main_#t~nondet13; 10#L544-2true main_#t~post12 := main_~i~0;main_~i~0 := 1 + main_#t~post12;havoc main_#t~post12; 12#L544-3true [2019-11-15 23:47:29,808 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:47:29,809 INFO L82 PathProgramCache]: Analyzing trace with hash 28695878, now seen corresponding path program 1 times [2019-11-15 23:47:29,816 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:47:29,816 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1467025294] [2019-11-15 23:47:29,816 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:47:29,817 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:47:29,817 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:47:29,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:47:29,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:47:29,935 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 23:47:29,936 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:47:29,937 INFO L82 PathProgramCache]: Analyzing trace with hash 1699, now seen corresponding path program 1 times [2019-11-15 23:47:29,937 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:47:29,937 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [317255849] [2019-11-15 23:47:29,937 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:47:29,937 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:47:29,938 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:47:29,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:47:29,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:47:29,957 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 23:47:29,959 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:47:29,959 INFO L82 PathProgramCache]: Analyzing trace with hash 1806935720, now seen corresponding path program 1 times [2019-11-15 23:47:29,959 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:47:29,960 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [777090423] [2019-11-15 23:47:29,960 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:47:29,960 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:47:29,960 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:47:29,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:47:30,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:47:30,006 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 23:47:30,242 INFO L210 LassoAnalysis]: Preferences: [2019-11-15 23:47:30,243 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-11-15 23:47:30,243 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-15 23:47:30,244 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-11-15 23:47:30,244 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-11-15 23:47:30,244 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 23:47:30,244 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-15 23:47:30,244 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-11-15 23:47:30,244 INFO L131 ssoRankerPreferences]: Filename of dumped script: cstrncpy-alloca-2.i_Iteration1_Lasso [2019-11-15 23:47:30,245 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-15 23:47:30,245 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-15 23:47:30,288 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:47:30,294 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:47:30,297 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:47:30,301 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:47:30,460 WARN L191 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 40 [2019-11-15 23:47:30,490 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:47:30,493 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:47:30,496 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:47:30,500 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:47:30,507 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:47:30,509 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:47:30,513 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:47:30,515 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:47:30,518 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:47:30,963 WARN L191 SmtUtils]: Spent 187.00 ms on a formula simplification. DAG size of input: 25 DAG size of output: 25 [2019-11-15 23:47:31,048 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-15 23:47:31,055 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-11-15 23:47:31,057 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 23:47:31,060 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:47:31,060 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:47:31,061 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:47:31,061 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:47:31,062 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:47:31,064 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 23:47:31,064 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:47:31,072 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:47:31,075 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 23:47:31,078 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:47:31,078 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:47:31,078 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:47:31,079 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:47:31,079 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:47:31,079 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 23:47:31,080 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:47:31,082 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:47:31,083 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 23:47:31,094 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:47:31,094 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:47:31,094 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:47:31,095 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:47:31,095 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:47:31,096 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 23:47:31,097 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:47:31,098 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:47:31,100 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 23:47:31,101 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:47:31,102 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:47:31,103 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:47:31,104 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:47:31,111 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 23:47:31,113 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 23:47:31,214 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-15 23:47:31,303 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2019-11-15 23:47:31,303 INFO L444 ModelExtractionUtils]: 16 out of 22 variables were initially zero. Simplification set additionally 2 variables to zero. [2019-11-15 23:47:31,306 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-15 23:47:31,310 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-11-15 23:47:31,310 INFO L510 LassoAnalysis]: Proved termination. [2019-11-15 23:47:31,312 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_main_~nondetString~0.base)_1, ULTIMATE.start_main_~i~0, ULTIMATE.start_main_~nondetString~0.offset) = 1*v_rep(select #length ULTIMATE.start_main_~nondetString~0.base)_1 - 1*ULTIMATE.start_main_~i~0 - 1*ULTIMATE.start_main_~nondetString~0.offset Supporting invariants [] [2019-11-15 23:47:31,330 INFO L297 tatePredicateManager]: 6 out of 6 supporting invariants were superfluous and have been removed [2019-11-15 23:47:31,340 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2019-11-15 23:47:31,360 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:47:31,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:47:31,387 INFO L256 TraceCheckSpWp]: Trace formula consists of 37 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-15 23:47:31,388 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:47:31,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:47:31,400 INFO L256 TraceCheckSpWp]: Trace formula consists of 10 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-15 23:47:31,401 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:47:31,415 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:47:31,431 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2019-11-15 23:47:31,432 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 17 states. Second operand 3 states. [2019-11-15 23:47:31,514 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 17 states.. Second operand 3 states. Result 39 states and 58 transitions. Complement of second has 7 states. [2019-11-15 23:47:31,517 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2019-11-15 23:47:31,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-11-15 23:47:31,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 39 transitions. [2019-11-15 23:47:31,520 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 39 transitions. Stem has 5 letters. Loop has 2 letters. [2019-11-15 23:47:31,522 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 23:47:31,522 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 39 transitions. Stem has 7 letters. Loop has 2 letters. [2019-11-15 23:47:31,522 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 23:47:31,522 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 39 transitions. Stem has 5 letters. Loop has 4 letters. [2019-11-15 23:47:31,523 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 23:47:31,523 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 39 states and 58 transitions. [2019-11-15 23:47:31,533 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2019-11-15 23:47:31,540 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 39 states to 13 states and 18 transitions. [2019-11-15 23:47:31,542 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2019-11-15 23:47:31,542 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2019-11-15 23:47:31,543 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 18 transitions. [2019-11-15 23:47:31,543 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-15 23:47:31,543 INFO L688 BuchiCegarLoop]: Abstraction has 13 states and 18 transitions. [2019-11-15 23:47:31,560 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states and 18 transitions. [2019-11-15 23:47:31,568 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2019-11-15 23:47:31,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2019-11-15 23:47:31,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 18 transitions. [2019-11-15 23:47:31,570 INFO L711 BuchiCegarLoop]: Abstraction has 13 states and 18 transitions. [2019-11-15 23:47:31,570 INFO L591 BuchiCegarLoop]: Abstraction has 13 states and 18 transitions. [2019-11-15 23:47:31,571 INFO L424 BuchiCegarLoop]: ======== Iteration 2============ [2019-11-15 23:47:31,571 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 13 states and 18 transitions. [2019-11-15 23:47:31,572 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2019-11-15 23:47:31,572 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 23:47:31,573 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 23:47:31,573 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:47:31,574 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-11-15 23:47:31,574 INFO L791 eck$LassoCheckResult]: Stem: 134#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 128#L-1 havoc main_#res;havoc main_#t~nondet8, main_#t~nondet9, main_#t~malloc10.base, main_#t~malloc10.offset, main_#t~malloc11.base, main_#t~malloc11.offset, main_#t~nondet13, main_#t~post12, main_~i~0, main_#t~ret14.base, main_#t~ret14.offset, main_~length~0, main_~n~0, main_~nondetArea~0.base, main_~nondetArea~0.offset, main_~nondetString~0.base, main_~nondetString~0.offset;main_~length~0 := main_#t~nondet8;havoc main_#t~nondet8;main_~n~0 := main_#t~nondet9;havoc main_#t~nondet9; 129#L535 assume !(main_~length~0 < 1); 136#L535-2 assume !(main_~n~0 < 1); 130#L538-1 call main_#t~malloc10.base, main_#t~malloc10.offset := #Ultimate.allocOnStack(main_~n~0);main_~nondetArea~0.base, main_~nondetArea~0.offset := main_#t~malloc10.base, main_#t~malloc10.offset;call main_#t~malloc11.base, main_#t~malloc11.offset := #Ultimate.allocOnStack(main_~length~0);main_~nondetString~0.base, main_~nondetString~0.offset := main_#t~malloc11.base, main_#t~malloc11.offset;main_~i~0 := 0; 131#L544-3 assume !(main_~i~0 < main_~length~0 - 1); 135#L544-4 call write~int(0, main_~nondetString~0.base, main_~nondetString~0.offset + (main_~length~0 - 1), 1);cstrncpy_#in~s1.base, cstrncpy_#in~s1.offset, cstrncpy_#in~s2.base, cstrncpy_#in~s2.offset, cstrncpy_#in~n := main_~nondetArea~0.base, main_~nondetArea~0.offset, main_~nondetString~0.base, main_~nondetString~0.offset, main_~n~0;havoc cstrncpy_#res.base, cstrncpy_#res.offset;havoc cstrncpy_#t~post2, cstrncpy_#t~post3.base, cstrncpy_#t~post3.offset, cstrncpy_#t~post4.base, cstrncpy_#t~post4.offset, cstrncpy_#t~mem5, cstrncpy_#t~post7.base, cstrncpy_#t~post7.offset, cstrncpy_#t~post6, cstrncpy_~s1.base, cstrncpy_~s1.offset, cstrncpy_~s2.base, cstrncpy_~s2.offset, cstrncpy_~n, cstrncpy_~dst~0.base, cstrncpy_~dst~0.offset, cstrncpy_~src~0.base, cstrncpy_~src~0.offset, cstrncpy_~us~0.base, cstrncpy_~us~0.offset, cstrncpy_~n2~0;cstrncpy_~s1.base, cstrncpy_~s1.offset := cstrncpy_#in~s1.base, cstrncpy_#in~s1.offset;cstrncpy_~s2.base, cstrncpy_~s2.offset := cstrncpy_#in~s2.base, cstrncpy_#in~s2.offset;cstrncpy_~n := cstrncpy_#in~n;cstrncpy_~dst~0.base, cstrncpy_~dst~0.offset := cstrncpy_~s1.base, cstrncpy_~s1.offset;cstrncpy_~src~0.base, cstrncpy_~src~0.offset := cstrncpy_~s2.base, cstrncpy_~s2.offset;havoc cstrncpy_~us~0.base, cstrncpy_~us~0.offset;havoc cstrncpy_~n2~0; 139#L520-2 [2019-11-15 23:47:31,575 INFO L793 eck$LassoCheckResult]: Loop: 139#L520-2 assume !!(cstrncpy_~n > 0);cstrncpy_#t~post2 := cstrncpy_~n;cstrncpy_~n := cstrncpy_#t~post2 - 1;havoc cstrncpy_#t~post2;cstrncpy_#t~post3.base, cstrncpy_#t~post3.offset := cstrncpy_~dst~0.base, cstrncpy_~dst~0.offset;cstrncpy_~dst~0.base, cstrncpy_~dst~0.offset := cstrncpy_#t~post3.base, 1 + cstrncpy_#t~post3.offset;cstrncpy_#t~post4.base, cstrncpy_#t~post4.offset := cstrncpy_~src~0.base, cstrncpy_~src~0.offset;cstrncpy_~src~0.base, cstrncpy_~src~0.offset := cstrncpy_#t~post4.base, 1 + cstrncpy_#t~post4.offset;call cstrncpy_#t~mem5 := read~int(cstrncpy_#t~post4.base, cstrncpy_#t~post4.offset, 1);call write~int(cstrncpy_#t~mem5, cstrncpy_#t~post3.base, cstrncpy_#t~post3.offset, 1); 140#L522 assume !(0 == cstrncpy_#t~mem5);havoc cstrncpy_#t~post3.base, cstrncpy_#t~post3.offset;havoc cstrncpy_#t~post4.base, cstrncpy_#t~post4.offset;havoc cstrncpy_#t~mem5; 139#L520-2 [2019-11-15 23:47:31,575 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:47:31,575 INFO L82 PathProgramCache]: Analyzing trace with hash 1806935662, now seen corresponding path program 1 times [2019-11-15 23:47:31,576 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:47:31,576 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1940025452] [2019-11-15 23:47:31,576 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:47:31,576 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:47:31,576 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:47:31,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:47:31,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:47:31,651 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 23:47:31,651 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:47:31,652 INFO L82 PathProgramCache]: Analyzing trace with hash 2195, now seen corresponding path program 1 times [2019-11-15 23:47:31,652 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:47:31,652 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [921702163] [2019-11-15 23:47:31,652 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:47:31,652 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:47:31,653 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:47:31,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:47:31,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:47:31,666 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 23:47:31,666 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:47:31,666 INFO L82 PathProgramCache]: Analyzing trace with hash 1298384832, now seen corresponding path program 1 times [2019-11-15 23:47:31,666 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:47:31,667 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [246273819] [2019-11-15 23:47:31,667 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:47:31,667 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:47:31,667 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:47:31,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:47:31,805 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:47:31,805 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [246273819] [2019-11-15 23:47:31,806 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:47:31,806 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-15 23:47:31,806 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1184229502] [2019-11-15 23:47:31,906 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:47:31,908 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-15 23:47:31,909 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-11-15 23:47:31,910 INFO L87 Difference]: Start difference. First operand 13 states and 18 transitions. cyclomatic complexity: 8 Second operand 7 states. [2019-11-15 23:47:32,065 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:47:32,066 INFO L93 Difference]: Finished difference Result 19 states and 24 transitions. [2019-11-15 23:47:32,066 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-15 23:47:32,067 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 19 states and 24 transitions. [2019-11-15 23:47:32,068 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 6 [2019-11-15 23:47:32,068 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 19 states to 19 states and 24 transitions. [2019-11-15 23:47:32,069 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 16 [2019-11-15 23:47:32,069 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 16 [2019-11-15 23:47:32,069 INFO L73 IsDeterministic]: Start isDeterministic. Operand 19 states and 24 transitions. [2019-11-15 23:47:32,069 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-15 23:47:32,069 INFO L688 BuchiCegarLoop]: Abstraction has 19 states and 24 transitions. [2019-11-15 23:47:32,070 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states and 24 transitions. [2019-11-15 23:47:32,071 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 16. [2019-11-15 23:47:32,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2019-11-15 23:47:32,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 21 transitions. [2019-11-15 23:47:32,072 INFO L711 BuchiCegarLoop]: Abstraction has 16 states and 21 transitions. [2019-11-15 23:47:32,072 INFO L591 BuchiCegarLoop]: Abstraction has 16 states and 21 transitions. [2019-11-15 23:47:32,072 INFO L424 BuchiCegarLoop]: ======== Iteration 3============ [2019-11-15 23:47:32,072 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 16 states and 21 transitions. [2019-11-15 23:47:32,073 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2019-11-15 23:47:32,073 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 23:47:32,073 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 23:47:32,073 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:47:32,073 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-11-15 23:47:32,074 INFO L791 eck$LassoCheckResult]: Stem: 184#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 178#L-1 havoc main_#res;havoc main_#t~nondet8, main_#t~nondet9, main_#t~malloc10.base, main_#t~malloc10.offset, main_#t~malloc11.base, main_#t~malloc11.offset, main_#t~nondet13, main_#t~post12, main_~i~0, main_#t~ret14.base, main_#t~ret14.offset, main_~length~0, main_~n~0, main_~nondetArea~0.base, main_~nondetArea~0.offset, main_~nondetString~0.base, main_~nondetString~0.offset;main_~length~0 := main_#t~nondet8;havoc main_#t~nondet8;main_~n~0 := main_#t~nondet9;havoc main_#t~nondet9; 179#L535 assume !(main_~length~0 < 1); 187#L535-2 assume !(main_~n~0 < 1); 180#L538-1 call main_#t~malloc10.base, main_#t~malloc10.offset := #Ultimate.allocOnStack(main_~n~0);main_~nondetArea~0.base, main_~nondetArea~0.offset := main_#t~malloc10.base, main_#t~malloc10.offset;call main_#t~malloc11.base, main_#t~malloc11.offset := #Ultimate.allocOnStack(main_~length~0);main_~nondetString~0.base, main_~nondetString~0.offset := main_#t~malloc11.base, main_#t~malloc11.offset;main_~i~0 := 0; 181#L544-3 assume !(main_~i~0 < main_~length~0 - 1); 185#L544-4 call write~int(0, main_~nondetString~0.base, main_~nondetString~0.offset + (main_~length~0 - 1), 1);cstrncpy_#in~s1.base, cstrncpy_#in~s1.offset, cstrncpy_#in~s2.base, cstrncpy_#in~s2.offset, cstrncpy_#in~n := main_~nondetArea~0.base, main_~nondetArea~0.offset, main_~nondetString~0.base, main_~nondetString~0.offset, main_~n~0;havoc cstrncpy_#res.base, cstrncpy_#res.offset;havoc cstrncpy_#t~post2, cstrncpy_#t~post3.base, cstrncpy_#t~post3.offset, cstrncpy_#t~post4.base, cstrncpy_#t~post4.offset, cstrncpy_#t~mem5, cstrncpy_#t~post7.base, cstrncpy_#t~post7.offset, cstrncpy_#t~post6, cstrncpy_~s1.base, cstrncpy_~s1.offset, cstrncpy_~s2.base, cstrncpy_~s2.offset, cstrncpy_~n, cstrncpy_~dst~0.base, cstrncpy_~dst~0.offset, cstrncpy_~src~0.base, cstrncpy_~src~0.offset, cstrncpy_~us~0.base, cstrncpy_~us~0.offset, cstrncpy_~n2~0;cstrncpy_~s1.base, cstrncpy_~s1.offset := cstrncpy_#in~s1.base, cstrncpy_#in~s1.offset;cstrncpy_~s2.base, cstrncpy_~s2.offset := cstrncpy_#in~s2.base, cstrncpy_#in~s2.offset;cstrncpy_~n := cstrncpy_#in~n;cstrncpy_~dst~0.base, cstrncpy_~dst~0.offset := cstrncpy_~s1.base, cstrncpy_~s1.offset;cstrncpy_~src~0.base, cstrncpy_~src~0.offset := cstrncpy_~s2.base, cstrncpy_~s2.offset;havoc cstrncpy_~us~0.base, cstrncpy_~us~0.offset;havoc cstrncpy_~n2~0; 193#L520-2 assume !!(cstrncpy_~n > 0);cstrncpy_#t~post2 := cstrncpy_~n;cstrncpy_~n := cstrncpy_#t~post2 - 1;havoc cstrncpy_#t~post2;cstrncpy_#t~post3.base, cstrncpy_#t~post3.offset := cstrncpy_~dst~0.base, cstrncpy_~dst~0.offset;cstrncpy_~dst~0.base, cstrncpy_~dst~0.offset := cstrncpy_#t~post3.base, 1 + cstrncpy_#t~post3.offset;cstrncpy_#t~post4.base, cstrncpy_#t~post4.offset := cstrncpy_~src~0.base, cstrncpy_~src~0.offset;cstrncpy_~src~0.base, cstrncpy_~src~0.offset := cstrncpy_#t~post4.base, 1 + cstrncpy_#t~post4.offset;call cstrncpy_#t~mem5 := read~int(cstrncpy_#t~post4.base, cstrncpy_#t~post4.offset, 1);call write~int(cstrncpy_#t~mem5, cstrncpy_#t~post3.base, cstrncpy_#t~post3.offset, 1); 192#L522 assume 0 == cstrncpy_#t~mem5;havoc cstrncpy_#t~post3.base, cstrncpy_#t~post3.offset;havoc cstrncpy_#t~post4.base, cstrncpy_#t~post4.offset;havoc cstrncpy_#t~mem5;cstrncpy_~us~0.base, cstrncpy_~us~0.offset := cstrncpy_~dst~0.base, cstrncpy_~dst~0.offset;cstrncpy_~n2~0 := cstrncpy_~n; 190#L525-3 [2019-11-15 23:47:32,074 INFO L793 eck$LassoCheckResult]: Loop: 190#L525-3 cstrncpy_#t~post6 := cstrncpy_~n2~0;cstrncpy_~n2~0 := cstrncpy_#t~post6 - 1; 189#L525-1 assume !!(0 != cstrncpy_#t~post6);havoc cstrncpy_#t~post6;cstrncpy_#t~post7.base, cstrncpy_#t~post7.offset := cstrncpy_~us~0.base, cstrncpy_~us~0.offset;cstrncpy_~us~0.base, cstrncpy_~us~0.offset := cstrncpy_#t~post7.base, 1 + cstrncpy_#t~post7.offset;call write~int(0, cstrncpy_#t~post7.base, cstrncpy_#t~post7.offset, 1);havoc cstrncpy_#t~post7.base, cstrncpy_#t~post7.offset; 190#L525-3 [2019-11-15 23:47:32,074 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:47:32,074 INFO L82 PathProgramCache]: Analyzing trace with hash 1298384817, now seen corresponding path program 1 times [2019-11-15 23:47:32,074 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:47:32,075 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1153918329] [2019-11-15 23:47:32,075 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:47:32,075 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:47:32,075 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:47:32,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:47:32,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:47:32,107 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 23:47:32,107 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:47:32,107 INFO L82 PathProgramCache]: Analyzing trace with hash 2438, now seen corresponding path program 1 times [2019-11-15 23:47:32,107 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:47:32,108 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [220374228] [2019-11-15 23:47:32,108 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:47:32,108 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:47:32,108 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:47:32,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:47:32,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:47:32,116 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 23:47:32,116 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:47:32,116 INFO L82 PathProgramCache]: Analyzing trace with hash -2087672522, now seen corresponding path program 1 times [2019-11-15 23:47:32,116 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:47:32,117 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [821672114] [2019-11-15 23:47:32,117 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:47:32,117 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:47:32,117 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:47:32,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:47:32,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:47:32,148 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 23:47:32,855 WARN L191 SmtUtils]: Spent 661.00 ms on a formula simplification. DAG size of input: 150 DAG size of output: 132 [2019-11-15 23:47:33,014 WARN L191 SmtUtils]: Spent 153.00 ms on a formula simplification that was a NOOP. DAG size: 104 [2019-11-15 23:47:33,018 INFO L210 LassoAnalysis]: Preferences: [2019-11-15 23:47:33,018 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-11-15 23:47:33,018 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-15 23:47:33,018 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-11-15 23:47:33,018 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-11-15 23:47:33,018 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 23:47:33,018 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-15 23:47:33,018 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-11-15 23:47:33,019 INFO L131 ssoRankerPreferences]: Filename of dumped script: cstrncpy-alloca-2.i_Iteration3_Lasso [2019-11-15 23:47:33,019 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-15 23:47:33,019 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-15 23:47:33,024 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:47:33,369 WARN L191 SmtUtils]: Spent 251.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 90 [2019-11-15 23:47:33,490 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:47:33,498 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:47:33,500 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:47:33,503 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:47:33,505 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:47:33,507 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:47:33,510 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:47:33,515 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:47:33,517 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:47:33,519 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:47:33,521 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:47:33,524 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:47:33,526 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:47:33,527 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:47:33,531 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:47:33,533 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:47:33,535 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:47:33,536 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:47:33,538 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:47:33,541 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:47:33,542 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:47:33,544 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:47:33,545 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:47:33,547 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:47:33,789 WARN L191 SmtUtils]: Spent 199.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 65 [2019-11-15 23:47:34,569 WARN L191 SmtUtils]: Spent 428.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 46 [2019-11-15 23:47:34,647 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-15 23:47:34,647 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-11-15 23:47:34,647 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 23:47:34,648 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:47:34,648 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:47:34,648 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:47:34,648 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:47:34,651 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 23:47:34,651 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 23:47:34,670 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:47:34,671 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 23:47:34,671 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:47:34,672 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:47:34,672 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:47:34,672 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:47:34,673 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 23:47:34,673 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 23:47:34,676 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:47:34,676 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 23:47:34,676 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:47:34,677 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:47:34,677 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:47:34,677 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:47:34,687 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 23:47:34,687 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 23:47:34,692 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:47:34,693 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 23:47:34,694 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:47:34,694 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:47:34,694 INFO L203 nArgumentSynthesizer]: 2 loop disjuncts [2019-11-15 23:47:34,694 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:47:34,722 INFO L400 nArgumentSynthesizer]: We have 16 Motzkin's Theorem applications. [2019-11-15 23:47:34,723 INFO L401 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2019-11-15 23:47:35,172 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-15 23:47:35,549 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2019-11-15 23:47:35,549 INFO L444 ModelExtractionUtils]: 103 out of 111 variables were initially zero. Simplification set additionally 5 variables to zero. [2019-11-15 23:47:35,550 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-15 23:47:35,552 INFO L438 nArgumentSynthesizer]: Removed 4 redundant supporting invariants from a total of 4. [2019-11-15 23:47:35,553 INFO L510 LassoAnalysis]: Proved termination. [2019-11-15 23:47:35,553 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_main_#t~malloc10.base)_2, ULTIMATE.start_cstrncpy_~us~0.offset) = 1*v_rep(select #length ULTIMATE.start_main_#t~malloc10.base)_2 - 1*ULTIMATE.start_cstrncpy_~us~0.offset Supporting invariants [] [2019-11-15 23:47:35,613 INFO L297 tatePredicateManager]: 15 out of 16 supporting invariants were superfluous and have been removed [2019-11-15 23:47:35,615 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2019-11-15 23:47:35,648 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:47:35,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:47:35,679 INFO L256 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 16 conjunts are in the unsatisfiable core [2019-11-15 23:47:35,681 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:47:35,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:47:35,724 INFO L256 TraceCheckSpWp]: Trace formula consists of 18 conjuncts, 8 conjunts are in the unsatisfiable core [2019-11-15 23:47:35,724 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:47:35,725 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:47:35,725 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.3 stem predicates 1 loop predicates [2019-11-15 23:47:35,725 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 16 states and 21 transitions. cyclomatic complexity: 8 Second operand 5 states. [2019-11-15 23:47:35,802 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 16 states and 21 transitions. cyclomatic complexity: 8. Second operand 5 states. Result 18 states and 24 transitions. Complement of second has 6 states. [2019-11-15 23:47:35,804 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 3 stem states 1 non-accepting loop states 1 accepting loop states [2019-11-15 23:47:35,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2019-11-15 23:47:35,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 16 transitions. [2019-11-15 23:47:35,804 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 16 transitions. Stem has 9 letters. Loop has 2 letters. [2019-11-15 23:47:35,805 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 23:47:35,805 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 16 transitions. Stem has 11 letters. Loop has 2 letters. [2019-11-15 23:47:35,805 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 23:47:35,805 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 16 transitions. Stem has 9 letters. Loop has 4 letters. [2019-11-15 23:47:35,805 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 23:47:35,806 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 18 states and 24 transitions. [2019-11-15 23:47:35,806 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-11-15 23:47:35,807 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 18 states to 11 states and 14 transitions. [2019-11-15 23:47:35,807 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9 [2019-11-15 23:47:35,807 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 9 [2019-11-15 23:47:35,807 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 14 transitions. [2019-11-15 23:47:35,807 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-15 23:47:35,807 INFO L688 BuchiCegarLoop]: Abstraction has 11 states and 14 transitions. [2019-11-15 23:47:35,808 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states and 14 transitions. [2019-11-15 23:47:35,808 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2019-11-15 23:47:35,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2019-11-15 23:47:35,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 14 transitions. [2019-11-15 23:47:35,809 INFO L711 BuchiCegarLoop]: Abstraction has 11 states and 14 transitions. [2019-11-15 23:47:35,809 INFO L591 BuchiCegarLoop]: Abstraction has 11 states and 14 transitions. [2019-11-15 23:47:35,809 INFO L424 BuchiCegarLoop]: ======== Iteration 4============ [2019-11-15 23:47:35,809 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 11 states and 14 transitions. [2019-11-15 23:47:35,810 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-11-15 23:47:35,810 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 23:47:35,810 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 23:47:35,810 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:47:35,810 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-11-15 23:47:35,811 INFO L791 eck$LassoCheckResult]: Stem: 346#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 340#L-1 havoc main_#res;havoc main_#t~nondet8, main_#t~nondet9, main_#t~malloc10.base, main_#t~malloc10.offset, main_#t~malloc11.base, main_#t~malloc11.offset, main_#t~nondet13, main_#t~post12, main_~i~0, main_#t~ret14.base, main_#t~ret14.offset, main_~length~0, main_~n~0, main_~nondetArea~0.base, main_~nondetArea~0.offset, main_~nondetString~0.base, main_~nondetString~0.offset;main_~length~0 := main_#t~nondet8;havoc main_#t~nondet8;main_~n~0 := main_#t~nondet9;havoc main_#t~nondet9; 341#L535 assume !(main_~length~0 < 1); 348#L535-2 assume !(main_~n~0 < 1); 342#L538-1 call main_#t~malloc10.base, main_#t~malloc10.offset := #Ultimate.allocOnStack(main_~n~0);main_~nondetArea~0.base, main_~nondetArea~0.offset := main_#t~malloc10.base, main_#t~malloc10.offset;call main_#t~malloc11.base, main_#t~malloc11.offset := #Ultimate.allocOnStack(main_~length~0);main_~nondetString~0.base, main_~nondetString~0.offset := main_#t~malloc11.base, main_#t~malloc11.offset;main_~i~0 := 0; 343#L544-3 assume !!(main_~i~0 < main_~length~0 - 1);call write~int(main_#t~nondet13, main_~nondetString~0.base, main_~nondetString~0.offset + main_~i~0, 1);havoc main_#t~nondet13; 344#L544-2 main_#t~post12 := main_~i~0;main_~i~0 := 1 + main_#t~post12;havoc main_#t~post12; 345#L544-3 assume !(main_~i~0 < main_~length~0 - 1); 347#L544-4 call write~int(0, main_~nondetString~0.base, main_~nondetString~0.offset + (main_~length~0 - 1), 1);cstrncpy_#in~s1.base, cstrncpy_#in~s1.offset, cstrncpy_#in~s2.base, cstrncpy_#in~s2.offset, cstrncpy_#in~n := main_~nondetArea~0.base, main_~nondetArea~0.offset, main_~nondetString~0.base, main_~nondetString~0.offset, main_~n~0;havoc cstrncpy_#res.base, cstrncpy_#res.offset;havoc cstrncpy_#t~post2, cstrncpy_#t~post3.base, cstrncpy_#t~post3.offset, cstrncpy_#t~post4.base, cstrncpy_#t~post4.offset, cstrncpy_#t~mem5, cstrncpy_#t~post7.base, cstrncpy_#t~post7.offset, cstrncpy_#t~post6, cstrncpy_~s1.base, cstrncpy_~s1.offset, cstrncpy_~s2.base, cstrncpy_~s2.offset, cstrncpy_~n, cstrncpy_~dst~0.base, cstrncpy_~dst~0.offset, cstrncpy_~src~0.base, cstrncpy_~src~0.offset, cstrncpy_~us~0.base, cstrncpy_~us~0.offset, cstrncpy_~n2~0;cstrncpy_~s1.base, cstrncpy_~s1.offset := cstrncpy_#in~s1.base, cstrncpy_#in~s1.offset;cstrncpy_~s2.base, cstrncpy_~s2.offset := cstrncpy_#in~s2.base, cstrncpy_#in~s2.offset;cstrncpy_~n := cstrncpy_#in~n;cstrncpy_~dst~0.base, cstrncpy_~dst~0.offset := cstrncpy_~s1.base, cstrncpy_~s1.offset;cstrncpy_~src~0.base, cstrncpy_~src~0.offset := cstrncpy_~s2.base, cstrncpy_~s2.offset;havoc cstrncpy_~us~0.base, cstrncpy_~us~0.offset;havoc cstrncpy_~n2~0; 349#L520-2 [2019-11-15 23:47:35,811 INFO L793 eck$LassoCheckResult]: Loop: 349#L520-2 assume !!(cstrncpy_~n > 0);cstrncpy_#t~post2 := cstrncpy_~n;cstrncpy_~n := cstrncpy_#t~post2 - 1;havoc cstrncpy_#t~post2;cstrncpy_#t~post3.base, cstrncpy_#t~post3.offset := cstrncpy_~dst~0.base, cstrncpy_~dst~0.offset;cstrncpy_~dst~0.base, cstrncpy_~dst~0.offset := cstrncpy_#t~post3.base, 1 + cstrncpy_#t~post3.offset;cstrncpy_#t~post4.base, cstrncpy_#t~post4.offset := cstrncpy_~src~0.base, cstrncpy_~src~0.offset;cstrncpy_~src~0.base, cstrncpy_~src~0.offset := cstrncpy_#t~post4.base, 1 + cstrncpy_#t~post4.offset;call cstrncpy_#t~mem5 := read~int(cstrncpy_#t~post4.base, cstrncpy_#t~post4.offset, 1);call write~int(cstrncpy_#t~mem5, cstrncpy_#t~post3.base, cstrncpy_#t~post3.offset, 1); 350#L522 assume !(0 == cstrncpy_#t~mem5);havoc cstrncpy_#t~post3.base, cstrncpy_#t~post3.offset;havoc cstrncpy_#t~post4.base, cstrncpy_#t~post4.offset;havoc cstrncpy_#t~mem5; 349#L520-2 [2019-11-15 23:47:35,811 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:47:35,811 INFO L82 PathProgramCache]: Analyzing trace with hash 1298440016, now seen corresponding path program 1 times [2019-11-15 23:47:35,811 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:47:35,811 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [222819452] [2019-11-15 23:47:35,812 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:47:35,812 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:47:35,812 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:47:35,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:47:35,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:47:35,851 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 23:47:35,851 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:47:35,851 INFO L82 PathProgramCache]: Analyzing trace with hash 2195, now seen corresponding path program 2 times [2019-11-15 23:47:35,852 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:47:35,852 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1562315873] [2019-11-15 23:47:35,852 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:47:35,852 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:47:35,852 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:47:35,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:47:35,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:47:35,861 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 23:47:35,862 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:47:35,862 INFO L82 PathProgramCache]: Analyzing trace with hash -2034626526, now seen corresponding path program 1 times [2019-11-15 23:47:35,862 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:47:35,863 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1987206403] [2019-11-15 23:47:35,863 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:47:35,863 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:47:35,863 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:47:35,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:47:35,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:47:35,892 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 23:47:36,387 WARN L191 SmtUtils]: Spent 377.00 ms on a formula simplification. DAG size of input: 116 DAG size of output: 105 [2019-11-15 23:47:36,528 WARN L191 SmtUtils]: Spent 131.00 ms on a formula simplification that was a NOOP. DAG size: 91 [2019-11-15 23:47:36,531 INFO L210 LassoAnalysis]: Preferences: [2019-11-15 23:47:36,531 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-11-15 23:47:36,531 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-15 23:47:36,531 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-11-15 23:47:36,531 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-11-15 23:47:36,531 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 23:47:36,532 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-15 23:47:36,532 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-11-15 23:47:36,532 INFO L131 ssoRankerPreferences]: Filename of dumped script: cstrncpy-alloca-2.i_Iteration4_Lasso [2019-11-15 23:47:36,532 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-15 23:47:36,532 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-15 23:47:36,536 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:47:36,543 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:47:36,545 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:47:36,546 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:47:36,550 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:47:36,554 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:47:36,556 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:47:36,562 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:47:36,567 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:47:36,569 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:47:36,571 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:47:36,573 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:47:36,576 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:47:36,578 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:47:36,581 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:47:36,584 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:47:36,587 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:47:36,589 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:47:36,591 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:47:36,593 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:47:36,595 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:47:36,598 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:47:36,600 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:47:36,602 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:47:36,862 WARN L191 SmtUtils]: Spent 203.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 78 [2019-11-15 23:47:37,013 WARN L191 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 52 [2019-11-15 23:47:37,013 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:47:37,014 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:47:37,019 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:47:37,800 WARN L191 SmtUtils]: Spent 340.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 43 [2019-11-15 23:47:37,818 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-15 23:47:37,819 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-11-15 23:47:37,819 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 23:47:37,819 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:47:37,819 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:47:37,820 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:47:37,820 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:47:37,820 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:47:37,820 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 23:47:37,820 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:47:37,821 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:47:37,821 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 23:47:37,821 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:47:37,822 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:47:37,822 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:47:37,822 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:47:37,822 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:47:37,822 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 23:47:37,822 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:47:37,823 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:47:37,823 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 23:47:37,823 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:47:37,823 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:47:37,823 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:47:37,824 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:47:37,824 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:47:37,824 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 23:47:37,824 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:47:37,824 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:47:37,825 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 23:47:37,825 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:47:37,825 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:47:37,825 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:47:37,825 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:47:37,826 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 23:47:37,826 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 23:47:37,828 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:47:37,828 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 23:47:37,828 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:47:37,828 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:47:37,828 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:47:37,829 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:47:37,829 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:47:37,829 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 23:47:37,829 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:47:37,829 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:47:37,831 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 23:47:37,831 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:47:37,832 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:47:37,832 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:47:37,832 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:47:37,832 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:47:37,832 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 23:47:37,833 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:47:37,833 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:47:37,833 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 23:47:37,834 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:47:37,834 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:47:37,834 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:47:37,834 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:47:37,834 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:47:37,835 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 23:47:37,835 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:47:37,835 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:47:37,836 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 23:47:37,836 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:47:37,836 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:47:37,836 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:47:37,837 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:47:37,837 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:47:37,837 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 23:47:37,837 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:47:37,838 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:47:37,838 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 23:47:37,838 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:47:37,839 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:47:37,839 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:47:37,839 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:47:37,839 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:47:37,839 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 23:47:37,840 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:47:37,840 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:47:37,840 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 23:47:37,841 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:47:37,841 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:47:37,841 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:47:37,841 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:47:37,841 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:47:37,842 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 23:47:37,842 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:47:37,842 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:47:37,843 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 23:47:37,843 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:47:37,843 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:47:37,844 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:47:37,844 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:47:37,844 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:47:37,844 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 23:47:37,844 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:47:37,845 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:47:37,845 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 23:47:37,846 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:47:37,846 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:47:37,846 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:47:37,846 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:47:37,847 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 23:47:37,847 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 23:47:37,849 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:47:37,850 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 23:47:37,850 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:47:37,850 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:47:37,850 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:47:37,851 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:47:37,851 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:47:37,851 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 23:47:37,851 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:47:37,852 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:47:37,852 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 23:47:37,852 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:47:37,853 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:47:37,853 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:47:37,853 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:47:37,853 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:47:37,853 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 23:47:37,854 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:47:37,854 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:47:37,854 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 23:47:37,855 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:47:37,855 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:47:37,855 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:47:37,855 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:47:37,856 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 23:47:37,856 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 23:47:37,857 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:47:37,858 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 23:47:37,858 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:47:37,858 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:47:37,858 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:47:37,859 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:47:37,859 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:47:37,859 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 23:47:37,859 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:47:37,860 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:47:37,860 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 23:47:37,860 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:47:37,861 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:47:37,861 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:47:37,861 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:47:37,861 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:47:37,861 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 23:47:37,862 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:47:37,862 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:47:37,862 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 23:47:37,863 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:47:37,863 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:47:37,863 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:47:37,863 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:47:37,863 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:47:37,864 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 23:47:37,864 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:47:37,864 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:47:37,865 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 23:47:37,865 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:47:37,865 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:47:37,866 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:47:37,866 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:47:37,866 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:47:37,866 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 23:47:37,866 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:47:37,867 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:47:37,867 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 23:47:37,868 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:47:37,868 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:47:37,868 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:47:37,868 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:47:37,868 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:47:37,869 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 23:47:37,869 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:47:37,869 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:47:37,870 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 23:47:37,870 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:47:37,870 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:47:37,870 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:47:37,871 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:47:37,871 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 23:47:37,871 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 23:47:37,872 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:47:37,873 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 23:47:37,873 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:47:37,873 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:47:37,874 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:47:37,874 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:47:37,874 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:47:37,874 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 23:47:37,874 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:47:37,875 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:47:37,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-15 23:47:37,876 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:47:37,876 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:47:37,876 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:47:37,876 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:47:37,876 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:47:37,876 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 23:47:37,877 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:47:37,877 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:47:37,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-15 23:47:37,878 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:47:37,878 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:47:37,878 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:47:37,878 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:47:37,879 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:47:37,879 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 23:47:37,879 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:47:37,879 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:47:37,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-15 23:47:37,880 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:47:37,880 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:47:37,881 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:47:37,881 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:47:37,881 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:47:37,881 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 23:47:37,881 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:47:37,882 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:47:37,882 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 23:47:37,883 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:47:37,883 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:47:37,883 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:47:37,883 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:47:37,884 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 23:47:37,885 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 23:47:37,888 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:47:37,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-15 23:47:37,889 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:47:37,890 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:47:37,890 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:47:37,890 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:47:37,891 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 23:47:37,891 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 23:47:37,892 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:47:37,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-15 23:47:37,893 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:47:37,893 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:47:37,893 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:47:37,894 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:47:37,895 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 23:47:37,895 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 23:47:37,899 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:47:37,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-15 23:47:37,900 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:47:37,900 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:47:37,900 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:47:37,900 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:47:37,903 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 23:47:37,903 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 23:47:37,923 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-15 23:47:37,942 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2019-11-15 23:47:37,942 INFO L444 ModelExtractionUtils]: 28 out of 34 variables were initially zero. Simplification set additionally 4 variables to zero. [2019-11-15 23:47:37,943 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-15 23:47:37,943 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-11-15 23:47:37,944 INFO L510 LassoAnalysis]: Proved termination. [2019-11-15 23:47:37,944 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_cstrncpy_~n) = 1*ULTIMATE.start_cstrncpy_~n Supporting invariants [] [2019-11-15 23:47:37,975 INFO L297 tatePredicateManager]: 11 out of 11 supporting invariants were superfluous and have been removed [2019-11-15 23:47:37,989 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:47:38,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:47:38,010 INFO L256 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-15 23:47:38,011 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:47:38,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:47:38,026 INFO L256 TraceCheckSpWp]: Trace formula consists of 33 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-15 23:47:38,026 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:47:38,054 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:47:38,055 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2019-11-15 23:47:38,055 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 11 states and 14 transitions. cyclomatic complexity: 5 Second operand 3 states. [2019-11-15 23:47:38,062 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 11 states and 14 transitions. cyclomatic complexity: 5. Second operand 3 states. Result 13 states and 16 transitions. Complement of second has 4 states. [2019-11-15 23:47:38,062 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2019-11-15 23:47:38,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-11-15 23:47:38,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 14 transitions. [2019-11-15 23:47:38,063 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 14 transitions. Stem has 9 letters. Loop has 2 letters. [2019-11-15 23:47:38,063 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 23:47:38,063 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 14 transitions. Stem has 11 letters. Loop has 2 letters. [2019-11-15 23:47:38,064 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 23:47:38,064 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 14 transitions. Stem has 9 letters. Loop has 4 letters. [2019-11-15 23:47:38,064 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 23:47:38,064 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 13 states and 16 transitions. [2019-11-15 23:47:38,065 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-11-15 23:47:38,065 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 13 states to 0 states and 0 transitions. [2019-11-15 23:47:38,065 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2019-11-15 23:47:38,065 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2019-11-15 23:47:38,065 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2019-11-15 23:47:38,065 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-15 23:47:38,065 INFO L688 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-15 23:47:38,065 INFO L711 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-15 23:47:38,066 INFO L591 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-15 23:47:38,066 INFO L424 BuchiCegarLoop]: ======== Iteration 5============ [2019-11-15 23:47:38,067 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2019-11-15 23:47:38,067 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-11-15 23:47:38,067 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2019-11-15 23:47:38,075 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 15.11 11:47:38 BoogieIcfgContainer [2019-11-15 23:47:38,075 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2019-11-15 23:47:38,076 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-15 23:47:38,076 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-15 23:47:38,076 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-15 23:47:38,077 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 11:47:29" (3/4) ... [2019-11-15 23:47:38,080 INFO L140 WitnessPrinter]: No result that supports witness generation found [2019-11-15 23:47:38,081 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-15 23:47:38,082 INFO L168 Benchmark]: Toolchain (without parser) took 9300.40 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 242.7 MB). Free memory was 942.0 MB in the beginning and 996.0 MB in the end (delta: -53.9 MB). Peak memory consumption was 188.8 MB. Max. memory is 11.5 GB. [2019-11-15 23:47:38,083 INFO L168 Benchmark]: CDTParser took 0.19 ms. Allocated memory is still 1.0 GB. Free memory is still 967.5 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-15 23:47:38,084 INFO L168 Benchmark]: CACSL2BoogieTranslator took 490.74 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 124.8 MB). Free memory was 942.0 MB in the beginning and 1.1 GB in the end (delta: -165.4 MB). Peak memory consumption was 17.8 MB. Max. memory is 11.5 GB. [2019-11-15 23:47:38,084 INFO L168 Benchmark]: Boogie Procedure Inliner took 47.07 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2019-11-15 23:47:38,085 INFO L168 Benchmark]: Boogie Preprocessor took 32.09 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-15 23:47:38,086 INFO L168 Benchmark]: RCFGBuilder took 330.28 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 22.4 MB). Peak memory consumption was 22.4 MB. Max. memory is 11.5 GB. [2019-11-15 23:47:38,091 INFO L168 Benchmark]: BuchiAutomizer took 8391.88 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 118.0 MB). Free memory was 1.1 GB in the beginning and 996.0 MB in the end (delta: 83.7 MB). Peak memory consumption was 201.7 MB. Max. memory is 11.5 GB. [2019-11-15 23:47:38,091 INFO L168 Benchmark]: Witness Printer took 4.86 ms. Allocated memory is still 1.3 GB. Free memory is still 996.0 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-15 23:47:38,096 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.19 ms. Allocated memory is still 1.0 GB. Free memory is still 967.5 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 490.74 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 124.8 MB). Free memory was 942.0 MB in the beginning and 1.1 GB in the end (delta: -165.4 MB). Peak memory consumption was 17.8 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 47.07 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 32.09 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 330.28 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 8391.88 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 118.0 MB). Free memory was 1.1 GB in the beginning and 996.0 MB in the end (delta: 83.7 MB). Peak memory consumption was 201.7 MB. Max. memory is 11.5 GB. * Witness Printer took 4.86 ms. Allocated memory is still 1.3 GB. Free memory is still 996.0 MB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 4 terminating modules (1 trivial, 3 deterministic, 0 nondeterministic). One deterministic module has affine ranking function unknown-#length-unknown[nondetString] + -1 * i + -1 * nondetString and consists of 5 locations. One deterministic module has affine ranking function unknown-#length-unknown[__builtin_alloca (n * sizeof(char))] + -1 * us and consists of 5 locations. One deterministic module has affine ranking function n and consists of 3 locations. 1 modules have a trivial ranking function, the largest among these consists of 7 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 8.3s and 5 iterations. TraceHistogramMax:1. Analysis of lassos took 7.5s. Construction of modules took 0.1s. Büchi inclusion checks took 0.4s. Highest rank in rank-based complementation 3. Minimization of det autom 4. Minimization of nondet autom 0. Automata minimization 0.0s AutomataMinimizationTime, 3 MinimizatonAttempts, 3 StatesRemovedByMinimization, 1 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 16 states and ocurred in iteration 2. Nontrivial modules had stage [3, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 49 SDtfs, 67 SDslu, 64 SDs, 0 SdLazy, 60 SolverSat, 18 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.1s Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc1 concLT0 SILN0 SILU0 SILI0 SILT0 lasso3 LassoPreprocessingBenchmarks: Lassos: inital203 mio100 ax109 hnf99 lsp86 ukn84 mio100 lsp46 div100 bol100 ite100 ukn100 eq184 hnf88 smp98 dnf199 smp96 tf100 neg95 sie115 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: sat Degree: 0 Time: 860ms VariablesStem: 21 VariablesLoop: 13 DisjunctsStem: 1 DisjunctsLoop: 2 SupportingInvariants: 4 MotzkinApplications: 16 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...