./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/termination-15/cstrncat_reverse_alloca.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version cad46833 Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_58e443e8-2750-4c77-948e-cbddb77ec737/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_58e443e8-2750-4c77-948e-cbddb77ec737/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_58e443e8-2750-4c77-948e-cbddb77ec737/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_58e443e8-2750-4c77-948e-cbddb77ec737/bin/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/termination-15/cstrncat_reverse_alloca.i -s /tmp/vcloud-vcloud-master/worker/working_dir_58e443e8-2750-4c77-948e-cbddb77ec737/bin/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_58e443e8-2750-4c77-948e-cbddb77ec737/bin/uautomizer --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash 217963df20137e939d67fe2243ee5b5bf7e9133e ..................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-cad4683 [2019-10-22 08:58:30,327 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-22 08:58:30,329 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-22 08:58:30,340 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-22 08:58:30,341 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-22 08:58:30,342 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-22 08:58:30,343 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-22 08:58:30,345 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-22 08:58:30,347 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-22 08:58:30,349 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-22 08:58:30,351 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-22 08:58:30,352 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-22 08:58:30,357 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-22 08:58:30,359 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-22 08:58:30,360 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-22 08:58:30,361 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-22 08:58:30,361 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-22 08:58:30,362 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-22 08:58:30,363 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-22 08:58:30,364 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-22 08:58:30,367 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-22 08:58:30,371 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-22 08:58:30,372 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-22 08:58:30,373 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-22 08:58:30,374 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-22 08:58:30,375 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-22 08:58:30,375 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-22 08:58:30,375 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-22 08:58:30,376 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-22 08:58:30,376 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-22 08:58:30,377 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-22 08:58:30,377 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-22 08:58:30,378 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-22 08:58:30,378 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-22 08:58:30,379 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-22 08:58:30,379 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-22 08:58:30,379 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-22 08:58:30,380 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-22 08:58:30,380 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-22 08:58:30,380 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-22 08:58:30,381 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-22 08:58:30,381 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_58e443e8-2750-4c77-948e-cbddb77ec737/bin/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf [2019-10-22 08:58:30,393 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-22 08:58:30,393 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-22 08:58:30,394 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-22 08:58:30,394 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-22 08:58:30,395 INFO L138 SettingsManager]: * Use SBE=true [2019-10-22 08:58:30,395 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-10-22 08:58:30,395 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-10-22 08:58:30,395 INFO L138 SettingsManager]: * Use old map elimination=false [2019-10-22 08:58:30,395 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2019-10-22 08:58:30,396 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2019-10-22 08:58:30,396 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-10-22 08:58:30,396 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-22 08:58:30,396 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-10-22 08:58:30,396 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-22 08:58:30,397 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-22 08:58:30,397 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-10-22 08:58:30,397 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-10-22 08:58:30,397 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-10-22 08:58:30,397 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-22 08:58:30,397 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-10-22 08:58:30,398 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-22 08:58:30,398 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-10-22 08:58:30,398 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-22 08:58:30,398 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-22 08:58:30,398 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-10-22 08:58:30,399 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-22 08:58:30,399 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-22 08:58:30,399 INFO L138 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-10-22 08:58:30,400 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-10-22 08:58:30,400 INFO L138 SettingsManager]: * TransformationType=MODULO_NEIGHBOR Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud-vcloud-master/worker/working_dir_58e443e8-2750-4c77-948e-cbddb77ec737/bin/uautomizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(F end) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 217963df20137e939d67fe2243ee5b5bf7e9133e [2019-10-22 08:58:30,424 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-22 08:58:30,433 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-22 08:58:30,436 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-22 08:58:30,437 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-22 08:58:30,438 INFO L275 PluginConnector]: CDTParser initialized [2019-10-22 08:58:30,438 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_58e443e8-2750-4c77-948e-cbddb77ec737/bin/uautomizer/../../sv-benchmarks/c/termination-15/cstrncat_reverse_alloca.i [2019-10-22 08:58:30,483 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_58e443e8-2750-4c77-948e-cbddb77ec737/bin/uautomizer/data/45238fe6a/981096536cb24b43b1816727e1fb1f48/FLAG87aa934c9 [2019-10-22 08:58:30,933 INFO L306 CDTParser]: Found 1 translation units. [2019-10-22 08:58:30,934 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_58e443e8-2750-4c77-948e-cbddb77ec737/sv-benchmarks/c/termination-15/cstrncat_reverse_alloca.i [2019-10-22 08:58:30,951 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_58e443e8-2750-4c77-948e-cbddb77ec737/bin/uautomizer/data/45238fe6a/981096536cb24b43b1816727e1fb1f48/FLAG87aa934c9 [2019-10-22 08:58:31,464 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_58e443e8-2750-4c77-948e-cbddb77ec737/bin/uautomizer/data/45238fe6a/981096536cb24b43b1816727e1fb1f48 [2019-10-22 08:58:31,468 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-22 08:58:31,469 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-10-22 08:58:31,470 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-22 08:58:31,470 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-22 08:58:31,475 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-22 08:58:31,476 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.10 08:58:31" (1/1) ... [2019-10-22 08:58:31,479 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2b053f22 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:58:31, skipping insertion in model container [2019-10-22 08:58:31,479 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.10 08:58:31" (1/1) ... [2019-10-22 08:58:31,490 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-22 08:58:31,531 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-22 08:58:31,934 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-22 08:58:31,946 INFO L188 MainTranslator]: Completed pre-run [2019-10-22 08:58:32,011 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-22 08:58:32,075 INFO L192 MainTranslator]: Completed translation [2019-10-22 08:58:32,075 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:58:32 WrapperNode [2019-10-22 08:58:32,076 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-22 08:58:32,076 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-10-22 08:58:32,077 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-10-22 08:58:32,077 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-10-22 08:58:32,085 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:58:32" (1/1) ... [2019-10-22 08:58:32,098 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:58:32" (1/1) ... [2019-10-22 08:58:32,124 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-10-22 08:58:32,125 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-22 08:58:32,126 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-22 08:58:32,126 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-22 08:58:32,132 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:58:32" (1/1) ... [2019-10-22 08:58:32,132 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:58:32" (1/1) ... [2019-10-22 08:58:32,135 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:58:32" (1/1) ... [2019-10-22 08:58:32,135 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:58:32" (1/1) ... [2019-10-22 08:58:32,142 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:58:32" (1/1) ... [2019-10-22 08:58:32,147 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:58:32" (1/1) ... [2019-10-22 08:58:32,148 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:58:32" (1/1) ... [2019-10-22 08:58:32,151 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-22 08:58:32,151 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-22 08:58:32,151 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-22 08:58:32,152 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-22 08:58:32,153 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:58:32" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_58e443e8-2750-4c77-948e-cbddb77ec737/bin/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 08:58:32,217 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-10-22 08:58:32,217 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-10-22 08:58:32,217 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-10-22 08:58:32,218 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-10-22 08:58:32,219 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-22 08:58:32,219 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-22 08:58:32,511 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-22 08:58:32,511 INFO L284 CfgBuilder]: Removed 8 assume(true) statements. [2019-10-22 08:58:32,512 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 08:58:32 BoogieIcfgContainer [2019-10-22 08:58:32,513 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-22 08:58:32,513 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-10-22 08:58:32,513 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-10-22 08:58:32,517 INFO L275 PluginConnector]: BuchiAutomizer initialized [2019-10-22 08:58:32,518 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-10-22 08:58:32,518 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 22.10 08:58:31" (1/3) ... [2019-10-22 08:58:32,520 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@75ff372b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 22.10 08:58:32, skipping insertion in model container [2019-10-22 08:58:32,520 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-10-22 08:58:32,524 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:58:32" (2/3) ... [2019-10-22 08:58:32,525 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@75ff372b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 22.10 08:58:32, skipping insertion in model container [2019-10-22 08:58:32,525 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-10-22 08:58:32,525 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 08:58:32" (3/3) ... [2019-10-22 08:58:32,527 INFO L371 chiAutomizerObserver]: Analyzing ICFG cstrncat_reverse_alloca.i [2019-10-22 08:58:32,567 INFO L356 BuchiCegarLoop]: Interprodecural is true [2019-10-22 08:58:32,568 INFO L357 BuchiCegarLoop]: Hoare is false [2019-10-22 08:58:32,568 INFO L358 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-10-22 08:58:32,568 INFO L359 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-22 08:58:32,568 INFO L360 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-22 08:58:32,568 INFO L361 BuchiCegarLoop]: Difference is false [2019-10-22 08:58:32,568 INFO L362 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-22 08:58:32,568 INFO L365 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-10-22 08:58:32,585 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states. [2019-10-22 08:58:32,606 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 5 [2019-10-22 08:58:32,606 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 08:58:32,607 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 08:58:32,612 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2019-10-22 08:58:32,612 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-10-22 08:58:32,613 INFO L424 BuchiCegarLoop]: ======== Iteration 1============ [2019-10-22 08:58:32,613 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states. [2019-10-22 08:58:32,614 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 5 [2019-10-22 08:58:32,614 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 08:58:32,614 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 08:58:32,614 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2019-10-22 08:58:32,614 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-10-22 08:58:32,621 INFO L791 eck$LassoCheckResult]: Stem: 13#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 12#L-1true havoc main_#res;havoc main_#t~nondet213, main_#t~nondet214, main_#t~nondet215, main_#t~malloc216.base, main_#t~malloc216.offset, main_#t~malloc217.base, main_#t~malloc217.offset, main_#t~ret218.base, main_#t~ret218.offset, main_~length1~0, main_~length2~0, main_~n~0, main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;main_~length1~0 := main_#t~nondet213;havoc main_#t~nondet213;main_~length2~0 := main_#t~nondet214;havoc main_#t~nondet214;main_~n~0 := main_#t~nondet215;havoc main_#t~nondet215; 15#L381true assume !(main_~length1~0 < 1); 18#L381-2true assume !(main_~length2~0 < 1); 11#L384-1true assume !(main_~n~0 < 1); 6#L387-1true assume !(main_~length1~0 < main_~n~0 || main_~length1~0 - main_~n~0 < main_~length2~0);call main_#t~malloc216.base, main_#t~malloc216.offset := #Ultimate.allocOnStack(main_~length1~0);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc216.base, main_#t~malloc216.offset;call main_#t~malloc217.base, main_#t~malloc217.offset := #Ultimate.allocOnStack(main_~length2~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc217.base, main_#t~malloc217.offset;call write~int(0, main_~nondetString1~0.base, main_~nondetString1~0.offset, 1);call write~int(0, main_~nondetString2~0.base, main_~nondetString2~0.offset, 1);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_~nondetString1~0.base, main_~nondetString1~0.offset + (main_~length1~0 - main_~n~0 - 1);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_~nondetString2~0.base, main_~nondetString2~0.offset + (main_~length2~0 - 1);cstrncat_#in~s1.base, cstrncat_#in~s1.offset, cstrncat_#in~s2.base, cstrncat_#in~s2.offset, cstrncat_#in~n := main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset, main_~n~0;havoc cstrncat_#res.base, cstrncat_#res.offset;havoc cstrncat_#t~post206.base, cstrncat_#t~post206.offset, cstrncat_#t~mem205, cstrncat_#t~post210, cstrncat_#t~post211.base, cstrncat_#t~post211.offset, cstrncat_#t~post207.base, cstrncat_#t~post207.offset, cstrncat_#t~mem208, cstrncat_#t~short209, cstrncat_#t~mem212, cstrncat_~s1.base, cstrncat_~s1.offset, cstrncat_~s2.base, cstrncat_~s2.offset, cstrncat_~n, cstrncat_~s~0.base, cstrncat_~s~0.offset;cstrncat_~s1.base, cstrncat_~s1.offset := cstrncat_#in~s1.base, cstrncat_#in~s1.offset;cstrncat_~s2.base, cstrncat_~s2.offset := cstrncat_#in~s2.base, cstrncat_#in~s2.offset;cstrncat_~n := cstrncat_#in~n;cstrncat_~s~0.base, cstrncat_~s~0.offset := cstrncat_~s1.base, cstrncat_~s1.offset; 8#L367-3true [2019-10-22 08:58:32,621 INFO L793 eck$LassoCheckResult]: Loop: 8#L367-3true call cstrncat_#t~mem205 := read~int(cstrncat_~s~0.base, cstrncat_~s~0.offset, 1); 4#L367-1true assume !!(0 != cstrncat_#t~mem205);havoc cstrncat_#t~mem205;cstrncat_#t~post206.base, cstrncat_#t~post206.offset := cstrncat_~s~0.base, cstrncat_~s~0.offset;cstrncat_~s~0.base, cstrncat_~s~0.offset := cstrncat_#t~post206.base, cstrncat_#t~post206.offset - 1;havoc cstrncat_#t~post206.base, cstrncat_#t~post206.offset; 8#L367-3true [2019-10-22 08:58:32,625 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:58:32,625 INFO L82 PathProgramCache]: Analyzing trace with hash 889572367, now seen corresponding path program 1 times [2019-10-22 08:58:32,630 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:58:32,630 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1574913870] [2019-10-22 08:58:32,631 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:58:32,631 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:58:32,631 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:58:32,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:58:32,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:58:32,792 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:58:32,794 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:58:32,794 INFO L82 PathProgramCache]: Analyzing trace with hash 1926, now seen corresponding path program 1 times [2019-10-22 08:58:32,794 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:58:32,794 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [801948924] [2019-10-22 08:58:32,794 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:58:32,795 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:58:32,795 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:58:32,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:58:32,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:58:32,805 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:58:32,807 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:58:32,807 INFO L82 PathProgramCache]: Analyzing trace with hash 180553748, now seen corresponding path program 1 times [2019-10-22 08:58:32,807 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:58:32,807 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1842750050] [2019-10-22 08:58:32,808 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:58:32,808 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:58:32,808 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:58:32,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:58:32,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:58:32,867 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:58:33,333 WARN L191 SmtUtils]: Spent 395.00 ms on a formula simplification. DAG size of input: 119 DAG size of output: 102 [2019-10-22 08:58:33,495 WARN L191 SmtUtils]: Spent 159.00 ms on a formula simplification that was a NOOP. DAG size: 94 [2019-10-22 08:58:33,508 INFO L210 LassoAnalysis]: Preferences: [2019-10-22 08:58:33,509 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-10-22 08:58:33,510 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-10-22 08:58:33,510 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-10-22 08:58:33,510 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-10-22 08:58:33,510 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 08:58:33,510 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-10-22 08:58:33,510 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-10-22 08:58:33,511 INFO L131 ssoRankerPreferences]: Filename of dumped script: cstrncat_reverse_alloca.i_Iteration1_Lasso [2019-10-22 08:58:33,511 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-10-22 08:58:33,511 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-10-22 08:58: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-10-22 08:58:33,551 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:58:33,561 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:58:33,570 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:58:33,573 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:58:33,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-10-22 08:58:33,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-10-22 08:58:33,582 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:58:33,586 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:58:33,590 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:58:33,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-10-22 08:58:33,596 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:58:33,599 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:58:33,603 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:58:33,923 WARN L191 SmtUtils]: Spent 247.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 81 [2019-10-22 08:58:34,002 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:58:34,005 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:58:34,009 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:58:34,011 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:58:34,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-10-22 08:58:34,016 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:58:34,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-10-22 08:58:34,021 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:58:34,655 WARN L191 SmtUtils]: Spent 362.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 40 [2019-10-22 08:58:34,779 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-10-22 08:58:34,783 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-10-22 08:58:34,785 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:58:34,786 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:58:34,787 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:58:34,787 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:58:34,788 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:58:34,788 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:58:34,790 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:58:34,790 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:58:34,793 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:58:34,793 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:58:34,794 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:58:34,794 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:58:34,794 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:58:34,794 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:58:34,796 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:58:34,796 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:58:34,800 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:58:34,800 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:58:34,801 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:58:34,801 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:58:34,801 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:58:34,801 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:58:34,801 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:58:34,802 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:58:34,802 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:58:34,803 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:58:34,803 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:58:34,804 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:58:34,804 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:58:34,805 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:58:34,805 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:58:34,805 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:58:34,805 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:58:34,805 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:58:34,806 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:58:34,806 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:58:34,807 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:58:34,807 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:58:34,807 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:58:34,807 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:58:34,808 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:58:34,808 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:58:34,808 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:58:34,809 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:58:34,809 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:58:34,810 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:58:34,810 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:58:34,810 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:58:34,810 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:58:34,810 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:58:34,811 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:58:34,811 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:58:34,811 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:58:34,812 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:58:34,813 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:58:34,813 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:58:34,813 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:58:34,813 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:58:34,813 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:58:34,814 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:58:34,814 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:58:34,815 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:58:34,815 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:58:34,815 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:58:34,816 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:58:34,816 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:58:34,816 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:58:34,816 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:58:34,817 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:58:34,817 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:58:34,818 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:58:34,818 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:58:34,819 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:58:34,819 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:58:34,819 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:58:34,819 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:58:34,821 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:58:34,821 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:58:34,829 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:58:34,829 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:58:34,830 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:58:34,830 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:58:34,830 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:58:34,830 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:58:34,830 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:58:34,831 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:58:34,831 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:58:34,831 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:58:34,832 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:58:34,832 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:58:34,833 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:58:34,833 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:58:34,833 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:58:34,833 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:58:34,833 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:58:34,834 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:58:34,834 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:58:34,835 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:58:34,835 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:58:34,835 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:58:34,835 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:58:34,836 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:58:34,836 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:58:34,836 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:58:34,844 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:58:34,845 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:58:34,846 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:58:34,846 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:58:34,846 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:58:34,847 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:58:34,847 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:58:34,847 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:58:34,847 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:58:34,847 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:58:34,848 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:58:34,849 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:58:34,849 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:58:34,849 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:58:34,849 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:58:34,850 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:58:34,851 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:58:34,851 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:58:34,854 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:58:34,855 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:58:34,855 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:58:34,855 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:58:34,856 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:58:34,856 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:58:34,857 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:58:34,857 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:58:34,859 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:58:34,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-10-22 08:58:34,861 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:58:34,861 INFO L202 nArgumentSynthesizer]: 4 stem disjuncts [2019-10-22 08:58:34,861 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:58:34,861 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:58:34,868 INFO L400 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2019-10-22 08:58:34,868 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:58:34,920 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:58:34,921 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:58:34,921 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:58:34,922 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:58:34,922 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:58:34,922 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:58:34,923 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:58:34,923 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:58:34,930 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:58:34,932 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:58:34,933 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:58:34,934 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:58:34,934 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:58:34,934 INFO L203 nArgumentSynthesizer]: 2 loop disjuncts [2019-10-22 08:58:34,934 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:58:34,934 INFO L400 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-10-22 08:58:34,935 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:58:34,943 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:58:34,944 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:58:34,944 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:58:34,944 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:58:34,944 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:58:34,945 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:58:34,946 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:58:34,946 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:58:34,955 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:58:34,955 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:58:34,956 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:58:34,956 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:58:34,957 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:58:34,957 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:58:34,966 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:58:34,969 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:58:35,076 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-10-22 08:58:35,119 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2019-10-22 08:58:35,120 INFO L444 ModelExtractionUtils]: 48 out of 55 variables were initially zero. Simplification set additionally 4 variables to zero. [2019-10-22 08:58:35,122 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-10-22 08:58:35,123 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-10-22 08:58:35,124 INFO L510 LassoAnalysis]: Proved termination. [2019-10-22 08:58:35,125 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_cstrncat_~s~0.offset) = 2*ULTIMATE.start_cstrncat_~s~0.offset + 1 Supporting invariants [] [2019-10-22 08:58:35,145 INFO L297 tatePredicateManager]: 7 out of 7 supporting invariants were superfluous and have been removed [2019-10-22 08:58:35,176 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:58:35,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:58:35,211 INFO L256 TraceCheckSpWp]: Trace formula consists of 73 conjuncts, 2 conjunts are in the unsatisfiable core [2019-10-22 08:58:35,212 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:58:35,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:58:35,229 INFO L256 TraceCheckSpWp]: Trace formula consists of 13 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-22 08:58:35,229 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:58:35,240 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:58:35,257 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2019-10-22 08:58:35,258 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 18 states. Second operand 3 states. [2019-10-22 08:58:35,319 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 18 states.. Second operand 3 states. Result 53 states and 76 transitions. Complement of second has 7 states. [2019-10-22 08:58:35,320 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-10-22 08:58:35,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-10-22 08:58:35,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 51 transitions. [2019-10-22 08:58:35,323 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 51 transitions. Stem has 6 letters. Loop has 2 letters. [2019-10-22 08:58:35,323 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 08:58:35,324 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 51 transitions. Stem has 8 letters. Loop has 2 letters. [2019-10-22 08:58:35,324 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 08:58:35,324 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 51 transitions. Stem has 6 letters. Loop has 4 letters. [2019-10-22 08:58:35,324 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 08:58:35,325 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 53 states and 76 transitions. [2019-10-22 08:58:35,327 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-10-22 08:58:35,331 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 53 states to 20 states and 27 transitions. [2019-10-22 08:58:35,332 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2019-10-22 08:58:35,332 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2019-10-22 08:58:35,333 INFO L73 IsDeterministic]: Start isDeterministic. Operand 20 states and 27 transitions. [2019-10-22 08:58:35,333 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-10-22 08:58:35,333 INFO L688 BuchiCegarLoop]: Abstraction has 20 states and 27 transitions. [2019-10-22 08:58:35,349 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states and 27 transitions. [2019-10-22 08:58:35,356 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 19. [2019-10-22 08:58:35,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2019-10-22 08:58:35,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 26 transitions. [2019-10-22 08:58:35,358 INFO L711 BuchiCegarLoop]: Abstraction has 19 states and 26 transitions. [2019-10-22 08:58:35,358 INFO L591 BuchiCegarLoop]: Abstraction has 19 states and 26 transitions. [2019-10-22 08:58:35,358 INFO L424 BuchiCegarLoop]: ======== Iteration 2============ [2019-10-22 08:58:35,359 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 19 states and 26 transitions. [2019-10-22 08:58:35,359 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-10-22 08:58:35,359 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 08:58:35,359 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 08:58:35,360 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 08:58:35,360 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-10-22 08:58:35,360 INFO L791 eck$LassoCheckResult]: Stem: 155#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 150#L-1 havoc main_#res;havoc main_#t~nondet213, main_#t~nondet214, main_#t~nondet215, main_#t~malloc216.base, main_#t~malloc216.offset, main_#t~malloc217.base, main_#t~malloc217.offset, main_#t~ret218.base, main_#t~ret218.offset, main_~length1~0, main_~length2~0, main_~n~0, main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;main_~length1~0 := main_#t~nondet213;havoc main_#t~nondet213;main_~length2~0 := main_#t~nondet214;havoc main_#t~nondet214;main_~n~0 := main_#t~nondet215;havoc main_#t~nondet215; 151#L381 assume !(main_~length1~0 < 1); 160#L381-2 assume !(main_~length2~0 < 1); 166#L384-1 assume !(main_~n~0 < 1); 161#L387-1 assume !(main_~length1~0 < main_~n~0 || main_~length1~0 - main_~n~0 < main_~length2~0);call main_#t~malloc216.base, main_#t~malloc216.offset := #Ultimate.allocOnStack(main_~length1~0);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc216.base, main_#t~malloc216.offset;call main_#t~malloc217.base, main_#t~malloc217.offset := #Ultimate.allocOnStack(main_~length2~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc217.base, main_#t~malloc217.offset;call write~int(0, main_~nondetString1~0.base, main_~nondetString1~0.offset, 1);call write~int(0, main_~nondetString2~0.base, main_~nondetString2~0.offset, 1);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_~nondetString1~0.base, main_~nondetString1~0.offset + (main_~length1~0 - main_~n~0 - 1);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_~nondetString2~0.base, main_~nondetString2~0.offset + (main_~length2~0 - 1);cstrncat_#in~s1.base, cstrncat_#in~s1.offset, cstrncat_#in~s2.base, cstrncat_#in~s2.offset, cstrncat_#in~n := main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset, main_~n~0;havoc cstrncat_#res.base, cstrncat_#res.offset;havoc cstrncat_#t~post206.base, cstrncat_#t~post206.offset, cstrncat_#t~mem205, cstrncat_#t~post210, cstrncat_#t~post211.base, cstrncat_#t~post211.offset, cstrncat_#t~post207.base, cstrncat_#t~post207.offset, cstrncat_#t~mem208, cstrncat_#t~short209, cstrncat_#t~mem212, cstrncat_~s1.base, cstrncat_~s1.offset, cstrncat_~s2.base, cstrncat_~s2.offset, cstrncat_~n, cstrncat_~s~0.base, cstrncat_~s~0.offset;cstrncat_~s1.base, cstrncat_~s1.offset := cstrncat_#in~s1.base, cstrncat_#in~s1.offset;cstrncat_~s2.base, cstrncat_~s2.offset := cstrncat_#in~s2.base, cstrncat_#in~s2.offset;cstrncat_~n := cstrncat_#in~n;cstrncat_~s~0.base, cstrncat_~s~0.offset := cstrncat_~s1.base, cstrncat_~s1.offset; 162#L367-3 call cstrncat_#t~mem205 := read~int(cstrncat_~s~0.base, cstrncat_~s~0.offset, 1); 152#L367-1 assume !(0 != cstrncat_#t~mem205);havoc cstrncat_#t~mem205; 153#L369-4 cstrncat_#t~short209 := 0 != cstrncat_~n; 168#L369 assume !cstrncat_#t~short209; 164#L369-2 assume !!cstrncat_#t~short209;havoc cstrncat_#t~mem208;havoc cstrncat_#t~post207.base, cstrncat_#t~post207.offset;havoc cstrncat_#t~short209;cstrncat_#t~post210 := cstrncat_~n;cstrncat_~n := cstrncat_#t~post210 - 1;havoc cstrncat_#t~post210;cstrncat_#t~post211.base, cstrncat_#t~post211.offset := cstrncat_~s~0.base, cstrncat_~s~0.offset;cstrncat_~s~0.base, cstrncat_~s~0.offset := cstrncat_#t~post211.base, cstrncat_#t~post211.offset - 1;havoc cstrncat_#t~post211.base, cstrncat_#t~post211.offset; 167#L369-4 cstrncat_#t~short209 := 0 != cstrncat_~n; 157#L369 [2019-10-22 08:58:35,361 INFO L793 eck$LassoCheckResult]: Loop: 157#L369 assume !cstrncat_#t~short209; 163#L369-2 assume !!cstrncat_#t~short209;havoc cstrncat_#t~mem208;havoc cstrncat_#t~post207.base, cstrncat_#t~post207.offset;havoc cstrncat_#t~short209;cstrncat_#t~post210 := cstrncat_~n;cstrncat_~n := cstrncat_#t~post210 - 1;havoc cstrncat_#t~post210;cstrncat_#t~post211.base, cstrncat_#t~post211.offset := cstrncat_~s~0.base, cstrncat_~s~0.offset;cstrncat_~s~0.base, cstrncat_~s~0.offset := cstrncat_#t~post211.base, cstrncat_#t~post211.offset - 1;havoc cstrncat_#t~post211.base, cstrncat_#t~post211.offset; 156#L369-4 cstrncat_#t~short209 := 0 != cstrncat_~n; 157#L369 [2019-10-22 08:58:35,361 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:58:35,361 INFO L82 PathProgramCache]: Analyzing trace with hash 1662025132, now seen corresponding path program 1 times [2019-10-22 08:58:35,361 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:58:35,361 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1546789979] [2019-10-22 08:58:35,361 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:58:35,362 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:58:35,362 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:58:35,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:58:35,415 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:58:35,415 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1546789979] [2019-10-22 08:58:35,416 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:58:35,416 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 08:58:35,416 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [245060222] [2019-10-22 08:58:35,418 INFO L796 eck$LassoCheckResult]: stem already infeasible [2019-10-22 08:58:35,418 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:58:35,418 INFO L82 PathProgramCache]: Analyzing trace with hash 76643, now seen corresponding path program 1 times [2019-10-22 08:58:35,418 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:58:35,419 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1316475442] [2019-10-22 08:58:35,419 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:58:35,419 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:58:35,419 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:58:35,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:58:35,426 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:58:35,426 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1316475442] [2019-10-22 08:58:35,426 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:58:35,426 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-10-22 08:58:35,426 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [314818725] [2019-10-22 08:58:35,427 INFO L808 eck$LassoCheckResult]: loop already infeasible [2019-10-22 08:58:35,427 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:58:35,429 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 08:58:35,430 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 08:58:35,431 INFO L87 Difference]: Start difference. First operand 19 states and 26 transitions. cyclomatic complexity: 10 Second operand 3 states. [2019-10-22 08:58:35,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:58:35,443 INFO L93 Difference]: Finished difference Result 18 states and 22 transitions. [2019-10-22 08:58:35,444 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 08:58:35,444 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 18 states and 22 transitions. [2019-10-22 08:58:35,445 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-10-22 08:58:35,445 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 18 states to 0 states and 0 transitions. [2019-10-22 08:58:35,445 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2019-10-22 08:58:35,445 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2019-10-22 08:58:35,446 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2019-10-22 08:58:35,446 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-10-22 08:58:35,446 INFO L688 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-10-22 08:58:35,446 INFO L711 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-10-22 08:58:35,446 INFO L591 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-10-22 08:58:35,446 INFO L424 BuchiCegarLoop]: ======== Iteration 3============ [2019-10-22 08:58:35,446 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2019-10-22 08:58:35,446 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-10-22 08:58:35,446 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2019-10-22 08:58:35,452 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 22.10 08:58:35 BoogieIcfgContainer [2019-10-22 08:58:35,452 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2019-10-22 08:58:35,453 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-10-22 08:58:35,453 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-10-22 08:58:35,453 INFO L275 PluginConnector]: Witness Printer initialized [2019-10-22 08:58:35,453 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 08:58:32" (3/4) ... [2019-10-22 08:58:35,457 INFO L140 WitnessPrinter]: No result that supports witness generation found [2019-10-22 08:58:35,457 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-10-22 08:58:35,459 INFO L168 Benchmark]: Toolchain (without parser) took 3989.47 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 235.9 MB). Free memory was 944.5 MB in the beginning and 1.1 GB in the end (delta: -146.3 MB). Peak memory consumption was 89.7 MB. Max. memory is 11.5 GB. [2019-10-22 08:58:35,459 INFO L168 Benchmark]: CDTParser took 0.19 ms. Allocated memory is still 1.0 GB. Free memory is still 967.3 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-10-22 08:58:35,460 INFO L168 Benchmark]: CACSL2BoogieTranslator took 605.73 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 165.7 MB). Free memory was 944.5 MB in the beginning and 1.1 GB in the end (delta: -198.1 MB). Peak memory consumption was 17.8 MB. Max. memory is 11.5 GB. [2019-10-22 08:58:35,460 INFO L168 Benchmark]: Boogie Procedure Inliner took 48.74 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.6 MB). Peak memory consumption was 6.6 MB. Max. memory is 11.5 GB. [2019-10-22 08:58:35,460 INFO L168 Benchmark]: Boogie Preprocessor took 25.63 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-10-22 08:58:35,461 INFO L168 Benchmark]: RCFGBuilder took 361.39 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: 27.4 MB). Peak memory consumption was 27.4 MB. Max. memory is 11.5 GB. [2019-10-22 08:58:35,461 INFO L168 Benchmark]: BuchiAutomizer took 2939.40 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 70.3 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 17.9 MB). Peak memory consumption was 88.2 MB. Max. memory is 11.5 GB. [2019-10-22 08:58:35,462 INFO L168 Benchmark]: Witness Printer took 4.35 ms. Allocated memory is still 1.3 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-10-22 08:58:35,465 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.3 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 605.73 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 165.7 MB). Free memory was 944.5 MB in the beginning and 1.1 GB in the end (delta: -198.1 MB). Peak memory consumption was 17.8 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 48.74 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.6 MB). Peak memory consumption was 6.6 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 25.63 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 361.39 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: 27.4 MB). Peak memory consumption was 27.4 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 2939.40 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 70.3 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 17.9 MB). Peak memory consumption was 88.2 MB. Max. memory is 11.5 GB. * Witness Printer took 4.35 ms. Allocated memory is still 1.3 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 2 terminating modules (1 trivial, 1 deterministic, 0 nondeterministic). One deterministic module has affine ranking function 2 * s + 1 and consists of 5 locations. 1 modules have a trivial ranking function, the largest among these consists of 3 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 2.8s and 3 iterations. TraceHistogramMax:2. Analysis of lassos took 2.5s. Construction of modules took 0.0s. Büchi inclusion checks took 0.1s. Highest rank in rank-based complementation 3. Minimization of det autom 1. Minimization of nondet autom 1. Automata minimization 0.0s AutomataMinimizationTime, 1 MinimizatonAttempts, 1 StatesRemovedByMinimization, 1 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 19 states and ocurred in iteration 1. Nontrivial modules had stage [1, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 37 SDtfs, 26 SDslu, 23 SDs, 0 SdLazy, 16 SolverSat, 6 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc0 concLT0 SILN0 SILU0 SILI1 SILT0 lasso1 LassoPreprocessingBenchmarks: Lassos: inital212 mio100 ax100 hnf99 lsp97 ukn84 mio100 lsp58 div100 bol100 ite100 ukn100 eq195 hnf88 smp100 dnf139 smp97 tf100 neg96 sie112 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 60ms VariablesStem: 10 VariablesLoop: 3 DisjunctsStem: 4 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 12 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! Received shutdown request...