./Ultimate.py --spec /storage/repos/svcomp/c/properties/termination.prp --file /storage/repos/svcomp/c/termination-15/cstrcpy_mixed_alloca_true-termination.c.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 2e94e6aa Calling Ultimate with: java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i /storage/repos/svcomp/c/termination-15/cstrcpy_mixed_alloca_true-termination.c.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --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 4401d2928f3fda81d6bafd7bed67698eedceeb36 .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-2e94e6a [2019-01-01 22:02:57,915 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-01 22:02:57,917 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-01 22:02:57,936 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-01 22:02:57,937 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-01 22:02:57,939 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-01 22:02:57,941 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-01 22:02:57,943 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-01 22:02:57,946 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-01 22:02:57,949 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-01 22:02:57,952 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-01 22:02:57,953 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-01 22:02:57,956 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-01 22:02:57,960 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-01 22:02:57,967 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-01 22:02:57,968 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-01 22:02:57,968 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-01 22:02:57,974 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-01 22:02:57,977 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-01 22:02:57,981 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-01 22:02:57,983 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-01 22:02:57,986 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-01 22:02:57,990 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-01 22:02:57,991 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-01 22:02:57,992 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-01 22:02:57,993 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-01 22:02:57,993 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-01 22:02:57,997 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-01 22:02:57,998 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-01 22:02:58,000 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-01 22:02:58,002 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-01 22:02:58,003 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-01 22:02:58,004 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-01 22:02:58,005 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-01 22:02:58,006 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-01 22:02:58,008 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-01 22:02:58,009 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf [2019-01-01 22:02:58,039 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-01 22:02:58,040 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-01 22:02:58,042 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-01 22:02:58,042 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-01 22:02:58,043 INFO L133 SettingsManager]: * Use SBE=true [2019-01-01 22:02:58,043 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-01-01 22:02:58,044 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-01-01 22:02:58,045 INFO L133 SettingsManager]: * Use old map elimination=false [2019-01-01 22:02:58,045 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2019-01-01 22:02:58,045 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2019-01-01 22:02:58,045 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-01-01 22:02:58,045 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-01 22:02:58,046 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-01-01 22:02:58,046 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-01 22:02:58,046 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-01 22:02:58,047 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-01-01 22:02:58,047 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-01-01 22:02:58,047 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-01-01 22:02:58,047 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-01 22:02:58,048 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-01-01 22:02:58,048 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-01 22:02:58,048 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-01-01 22:02:58,048 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-01 22:02:58,048 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-01 22:02:58,048 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-01-01 22:02:58,051 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-01 22:02:58,051 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-01 22:02:58,051 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-01-01 22:02:58,052 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-01-01 22:02:58,053 INFO L133 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 -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux 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 -> 4401d2928f3fda81d6bafd7bed67698eedceeb36 [2019-01-01 22:02:58,109 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-01 22:02:58,129 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-01 22:02:58,137 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-01 22:02:58,139 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-01 22:02:58,139 INFO L276 PluginConnector]: CDTParser initialized [2019-01-01 22:02:58,140 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/termination-15/cstrcpy_mixed_alloca_true-termination.c.i [2019-01-01 22:02:58,211 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/36095c215/8f770ffcc9234f50a693d02935de97f1/FLAG12a7c0fd5 [2019-01-01 22:02:58,759 INFO L307 CDTParser]: Found 1 translation units. [2019-01-01 22:02:58,760 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/termination-15/cstrcpy_mixed_alloca_true-termination.c.i [2019-01-01 22:02:58,770 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/36095c215/8f770ffcc9234f50a693d02935de97f1/FLAG12a7c0fd5 [2019-01-01 22:02:59,039 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/36095c215/8f770ffcc9234f50a693d02935de97f1 [2019-01-01 22:02:59,042 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-01 22:02:59,044 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-01-01 22:02:59,045 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-01 22:02:59,045 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-01 22:02:59,049 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-01 22:02:59,050 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.01 10:02:59" (1/1) ... [2019-01-01 22:02:59,053 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3277d28 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 10:02:59, skipping insertion in model container [2019-01-01 22:02:59,053 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.01 10:02:59" (1/1) ... [2019-01-01 22:02:59,061 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-01 22:02:59,099 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-01 22:02:59,561 INFO L204 PostProcessor]: Analyzing one entry point: main [2019-01-01 22:02:59,577 INFO L191 MainTranslator]: Completed pre-run [2019-01-01 22:02:59,724 INFO L204 PostProcessor]: Analyzing one entry point: main [2019-01-01 22:02:59,833 INFO L195 MainTranslator]: Completed translation [2019-01-01 22:02:59,833 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 10:02:59 WrapperNode [2019-01-01 22:02:59,834 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-01 22:02:59,835 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-01 22:02:59,835 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-01 22:02:59,835 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-01 22:02:59,846 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 10:02:59" (1/1) ... [2019-01-01 22:02:59,868 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 10:02:59" (1/1) ... [2019-01-01 22:02:59,904 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-01 22:02:59,905 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-01 22:02:59,905 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-01 22:02:59,905 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-01 22:02:59,916 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 10:02:59" (1/1) ... [2019-01-01 22:02:59,916 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 10:02:59" (1/1) ... [2019-01-01 22:02:59,921 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 10:02:59" (1/1) ... [2019-01-01 22:02:59,923 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 10:02:59" (1/1) ... [2019-01-01 22:02:59,936 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 10:02:59" (1/1) ... [2019-01-01 22:02:59,952 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 10:02:59" (1/1) ... [2019-01-01 22:02:59,955 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 10:02:59" (1/1) ... [2019-01-01 22:02:59,962 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-01 22:02:59,962 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-01 22:02:59,965 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-01 22:02:59,965 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-01 22:02:59,966 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 10:02:59" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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-01-01 22:03:00,049 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-01-01 22:03:00,049 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-01-01 22:03:00,049 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-01-01 22:03:00,049 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-01-01 22:03:00,050 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-01 22:03:00,050 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-01 22:03:00,516 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-01 22:03:00,517 INFO L280 CfgBuilder]: Removed 7 assue(true) statements. [2019-01-01 22:03:00,517 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.01 10:03:00 BoogieIcfgContainer [2019-01-01 22:03:00,517 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-01 22:03:00,518 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-01-01 22:03:00,518 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-01-01 22:03:00,522 INFO L276 PluginConnector]: BuchiAutomizer initialized [2019-01-01 22:03:00,523 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-01 22:03:00,523 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 01.01 10:02:59" (1/3) ... [2019-01-01 22:03:00,524 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@15b3be76 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 01.01 10:03:00, skipping insertion in model container [2019-01-01 22:03:00,524 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-01 22:03:00,525 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 10:02:59" (2/3) ... [2019-01-01 22:03:00,525 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@15b3be76 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 01.01 10:03:00, skipping insertion in model container [2019-01-01 22:03:00,525 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-01 22:03:00,525 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.01 10:03:00" (3/3) ... [2019-01-01 22:03:00,527 INFO L375 chiAutomizerObserver]: Analyzing ICFG cstrcpy_mixed_alloca_true-termination.c.i [2019-01-01 22:03:00,584 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-01 22:03:00,585 INFO L374 BuchiCegarLoop]: Interprodecural is true [2019-01-01 22:03:00,585 INFO L375 BuchiCegarLoop]: Hoare is false [2019-01-01 22:03:00,585 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-01-01 22:03:00,585 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-01 22:03:00,586 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-01 22:03:00,586 INFO L379 BuchiCegarLoop]: Difference is false [2019-01-01 22:03:00,586 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-01 22:03:00,586 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-01-01 22:03:00,600 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 12 states. [2019-01-01 22:03:00,621 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-01-01 22:03:00,622 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 22:03:00,622 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 22:03:00,630 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2019-01-01 22:03:00,630 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-01-01 22:03:00,631 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2019-01-01 22:03:00,631 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 12 states. [2019-01-01 22:03:00,632 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-01-01 22:03:00,632 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 22:03:00,632 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 22:03:00,633 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2019-01-01 22:03:00,633 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-01-01 22:03:00,641 INFO L794 eck$LassoCheckResult]: Stem: 5#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 3#L-1true havoc main_#res;havoc main_#t~nondet208, main_#t~nondet209, main_#t~malloc210.base, main_#t~malloc210.offset, main_#t~malloc211.base, main_#t~malloc211.offset, main_#t~ret212.base, main_#t~ret212.offset, main_~length1~0, main_~length2~0, main_~nondetArea~0.base, main_~nondetArea~0.offset, main_~nondetString~0.base, main_~nondetString~0.offset;main_~length1~0 := main_#t~nondet208;havoc main_#t~nondet208;main_~length2~0 := main_#t~nondet209;havoc main_#t~nondet209; 9#L375true assume !(main_~length1~0 < 1); 13#L375-2true assume !(main_~length2~0 < 1); 4#L378-1true assume !(main_~length1~0 < main_~length2~0);call main_#t~malloc210.base, main_#t~malloc210.offset := #Ultimate.allocOnStack(main_~length1~0);main_~nondetArea~0.base, main_~nondetArea~0.offset := main_#t~malloc210.base, main_#t~malloc210.offset;call main_#t~malloc211.base, main_#t~malloc211.offset := #Ultimate.allocOnStack(main_~length2~0);main_~nondetString~0.base, main_~nondetString~0.offset := main_#t~malloc211.base, main_#t~malloc211.offset;call write~int(0, main_~nondetString~0.base, main_~nondetString~0.offset + (main_~length2~0 - 1), 1);main_~nondetArea~0.base, main_~nondetArea~0.offset := main_~nondetArea~0.base, main_~nondetArea~0.offset + (main_~length1~0 - 1);cstrcpy_#in~s1.base, cstrcpy_#in~s1.offset, cstrcpy_#in~s2.base, cstrcpy_#in~s2.offset := main_~nondetArea~0.base, main_~nondetArea~0.offset, main_~nondetString~0.base, main_~nondetString~0.offset;havoc cstrcpy_#res.base, cstrcpy_#res.offset;havoc cstrcpy_#t~post205.base, cstrcpy_#t~post205.offset, cstrcpy_#t~post206.base, cstrcpy_#t~post206.offset, cstrcpy_#t~mem207, cstrcpy_~s1.base, cstrcpy_~s1.offset, cstrcpy_~s2.base, cstrcpy_~s2.offset, cstrcpy_~dst~0.base, cstrcpy_~dst~0.offset, cstrcpy_~src~0.base, cstrcpy_~src~0.offset;cstrcpy_~s1.base, cstrcpy_~s1.offset := cstrcpy_#in~s1.base, cstrcpy_#in~s1.offset;cstrcpy_~s2.base, cstrcpy_~s2.offset := cstrcpy_#in~s2.base, cstrcpy_#in~s2.offset;cstrcpy_~dst~0.base, cstrcpy_~dst~0.offset := cstrcpy_~s1.base, cstrcpy_~s1.offset;cstrcpy_~src~0.base, cstrcpy_~src~0.offset := cstrcpy_~s2.base, cstrcpy_~s2.offset; 7#L368-3true [2019-01-01 22:03:00,641 INFO L796 eck$LassoCheckResult]: Loop: 7#L368-3true cstrcpy_#t~post205.base, cstrcpy_#t~post205.offset := cstrcpy_~dst~0.base, cstrcpy_~dst~0.offset;cstrcpy_~dst~0.base, cstrcpy_~dst~0.offset := cstrcpy_#t~post205.base, cstrcpy_#t~post205.offset - 1;cstrcpy_#t~post206.base, cstrcpy_#t~post206.offset := cstrcpy_~src~0.base, cstrcpy_~src~0.offset;cstrcpy_~src~0.base, cstrcpy_~src~0.offset := cstrcpy_#t~post206.base, 1 + cstrcpy_#t~post206.offset;call cstrcpy_#t~mem207 := read~int(cstrcpy_#t~post206.base, cstrcpy_#t~post206.offset, 1);call write~int(cstrcpy_#t~mem207, cstrcpy_#t~post205.base, cstrcpy_#t~post205.offset, 1); 14#L368-1true assume !!(0 != cstrcpy_#t~mem207);havoc cstrcpy_#t~post205.base, cstrcpy_#t~post205.offset;havoc cstrcpy_#t~post206.base, cstrcpy_#t~post206.offset;havoc cstrcpy_#t~mem207; 7#L368-3true [2019-01-01 22:03:00,647 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 22:03:00,648 INFO L82 PathProgramCache]: Analyzing trace with hash 28695882, now seen corresponding path program 1 times [2019-01-01 22:03:00,650 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 22:03:00,651 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 22:03:00,697 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:03:00,697 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 22:03:00,697 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:03:00,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:03:00,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:03:00,839 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 22:03:00,840 INFO L82 PathProgramCache]: Analyzing trace with hash 1734, now seen corresponding path program 1 times [2019-01-01 22:03:00,840 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 22:03:00,840 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 22:03:00,841 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:03:00,842 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 22:03:00,842 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:03:00,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:03:00,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:03:00,882 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 22:03:00,884 INFO L82 PathProgramCache]: Analyzing trace with hash 1806939599, now seen corresponding path program 1 times [2019-01-01 22:03:00,885 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 22:03:00,885 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 22:03:00,886 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:03:00,886 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 22:03:00,887 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:03:00,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:03:00,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:03:01,259 WARN L181 SmtUtils]: Spent 279.00 ms on a formula simplification that was a NOOP. DAG size: 51 [2019-01-01 22:03:02,336 WARN L181 SmtUtils]: Spent 987.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 89 [2019-01-01 22:03:02,582 WARN L181 SmtUtils]: Spent 243.00 ms on a formula simplification that was a NOOP. DAG size: 83 [2019-01-01 22:03:02,596 INFO L216 LassoAnalysis]: Preferences: [2019-01-01 22:03:02,598 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-01 22:03:02,598 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-01 22:03:02,598 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-01 22:03:02,598 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-01 22:03:02,599 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 22:03:02,599 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-01 22:03:02,599 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-01 22:03:02,599 INFO L131 ssoRankerPreferences]: Filename of dumped script: cstrcpy_mixed_alloca_true-termination.c.i_Iteration1_Lasso [2019-01-01 22:03:02,599 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-01 22:03:02,600 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-01 22:03:02,631 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:03:02,665 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:03:02,672 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:03:02,689 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:03:02,694 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:03:02,696 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:03:02,701 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:03:02,709 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:03:02,715 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:03:02,728 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:03:02,758 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:03:03,278 WARN L181 SmtUtils]: Spent 398.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 75 [2019-01-01 22:03:03,460 WARN L181 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 56 [2019-01-01 22:03:03,461 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:03:03,464 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:03:03,469 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:03:03,472 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:03:03,810 WARN L181 SmtUtils]: Spent 198.00 ms on a formula simplification that was a NOOP. DAG size: 52 [2019-01-01 22:03:04,712 WARN L181 SmtUtils]: Spent 519.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 43 [2019-01-01 22:03:04,766 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-01 22:03:04,772 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-01 22:03:04,775 INFO L122 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-01-01 22:03:04,777 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:03:04,777 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:03:04,778 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:03:04,778 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:03:04,779 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:03:04,781 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 22:03:04,781 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:03:04,784 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:03:04,785 INFO L122 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-01-01 22:03:04,785 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:03:04,786 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:03:04,786 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:03:04,786 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:03:04,786 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:03:04,787 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 22:03:04,787 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:03:04,788 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:03:04,788 INFO L122 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-01-01 22:03:04,789 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:03:04,789 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:03:04,789 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:03:04,789 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:03:04,792 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 22:03:04,792 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 22:03:04,796 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:03:04,797 INFO L122 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-01-01 22:03:04,797 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:03:04,797 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:03:04,798 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:03:04,798 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:03:04,798 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:03:04,799 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 22:03:04,799 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:03:04,800 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:03:04,800 INFO L122 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-01-01 22:03:04,801 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:03:04,801 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:03:04,801 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:03:04,801 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:03:04,801 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:03:04,802 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 22:03:04,802 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:03:04,803 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:03:04,808 INFO L122 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-01-01 22:03:04,809 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:03:04,810 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:03:04,810 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:03:04,810 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:03:04,813 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 22:03:04,816 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 22:03:04,822 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:03:04,823 INFO L122 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-01-01 22:03:04,825 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:03:04,825 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:03:04,825 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:03:04,826 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:03:04,826 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:03:04,826 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 22:03:04,826 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:03:04,830 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:03:04,832 INFO L122 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-01-01 22:03:04,835 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:03:04,835 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:03:04,836 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:03:04,836 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:03:04,836 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:03:04,836 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 22:03:04,836 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:03:04,838 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:03:04,838 INFO L122 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-01-01 22:03:04,839 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:03:04,839 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:03:04,839 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:03:04,839 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:03:04,839 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:03:04,840 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 22:03:04,841 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:03:04,841 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:03:04,842 INFO L122 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-01-01 22:03:04,843 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:03:04,843 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:03:04,843 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:03:04,843 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:03:04,843 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:03:04,844 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 22:03:04,844 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:03:04,846 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:03:04,846 INFO L122 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-01-01 22:03:04,847 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:03:04,847 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:03:04,847 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:03:04,847 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:03:04,850 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 22:03:04,850 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 22:03:04,868 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:03:04,868 INFO L122 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-01-01 22:03:04,869 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:03:04,869 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:03:04,869 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:03:04,869 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:03:04,872 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 22:03:04,872 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 22:03:04,886 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:03:04,887 INFO L122 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-01-01 22:03:04,887 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:03:04,888 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:03:04,888 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:03:04,888 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:03:04,891 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 22:03:04,891 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 22:03:04,903 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:03:04,904 INFO L122 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-01-01 22:03:04,904 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:03:04,906 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:03:04,906 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:03:04,906 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:03:04,908 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 22:03:04,909 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 22:03:04,912 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:03:04,912 INFO L122 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-01-01 22:03:04,913 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:03:04,913 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:03:04,913 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:03:04,913 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:03:04,923 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 22:03:04,923 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 22:03:05,009 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-01 22:03:05,106 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2019-01-01 22:03:05,107 INFO L444 ModelExtractionUtils]: 43 out of 52 variables were initially zero. Simplification set additionally 6 variables to zero. [2019-01-01 22:03:05,110 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-01 22:03:05,112 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-01-01 22:03:05,116 INFO L518 LassoAnalysis]: Proved termination. [2019-01-01 22:03:05,117 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_cstrcpy_~dst~0.offset) = 2*ULTIMATE.start_cstrcpy_~dst~0.offset + 1 Supporting invariants [] [2019-01-01 22:03:05,313 INFO L297 tatePredicateManager]: 12 out of 12 supporting invariants were superfluous and have been removed [2019-01-01 22:03:05,362 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 22:03:05,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 22:03:05,396 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 22:03:05,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 22:03:05,424 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 22:03:05,498 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 22:03:05,513 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-01-01 22:03:05,515 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 12 states. Second operand 3 states. [2019-01-01 22:03:05,549 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 12 states.. Second operand 3 states. Result 27 states and 30 transitions. Complement of second has 5 states. [2019-01-01 22:03:05,551 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2019-01-01 22:03:05,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-01-01 22:03:05,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 24 transitions. [2019-01-01 22:03:05,554 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 24 transitions. Stem has 5 letters. Loop has 2 letters. [2019-01-01 22:03:05,556 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 22:03:05,556 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 24 transitions. Stem has 7 letters. Loop has 2 letters. [2019-01-01 22:03:05,559 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 22:03:05,559 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 24 transitions. Stem has 5 letters. Loop has 4 letters. [2019-01-01 22:03:05,559 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 22:03:05,560 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 27 states and 30 transitions. [2019-01-01 22:03:05,565 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-01-01 22:03:05,568 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 27 states to 0 states and 0 transitions. [2019-01-01 22:03:05,569 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2019-01-01 22:03:05,570 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2019-01-01 22:03:05,570 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2019-01-01 22:03:05,570 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-01 22:03:05,570 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-01 22:03:05,570 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-01 22:03:05,570 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-01 22:03:05,572 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2019-01-01 22:03:05,572 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2019-01-01 22:03:05,572 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-01-01 22:03:05,572 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2019-01-01 22:03:05,580 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 01.01 10:03:05 BoogieIcfgContainer [2019-01-01 22:03:05,581 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2019-01-01 22:03:05,581 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-01 22:03:05,581 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-01 22:03:05,582 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-01 22:03:05,582 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.01 10:03:00" (3/4) ... [2019-01-01 22:03:05,585 INFO L147 WitnessPrinter]: No result that supports witness generation found [2019-01-01 22:03:05,585 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-01 22:03:05,586 INFO L168 Benchmark]: Toolchain (without parser) took 6543.31 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 205.5 MB). Free memory was 951.4 MB in the beginning and 1.1 GB in the end (delta: -129.5 MB). Peak memory consumption was 76.0 MB. Max. memory is 11.5 GB. [2019-01-01 22:03:05,587 INFO L168 Benchmark]: CDTParser took 0.51 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-01 22:03:05,588 INFO L168 Benchmark]: CACSL2BoogieTranslator took 789.29 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 137.9 MB). Free memory was 951.4 MB in the beginning and 1.1 GB in the end (delta: -161.3 MB). Peak memory consumption was 30.4 MB. Max. memory is 11.5 GB. [2019-01-01 22:03:05,590 INFO L168 Benchmark]: Boogie Procedure Inliner took 69.91 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-01-01 22:03:05,590 INFO L168 Benchmark]: Boogie Preprocessor took 57.49 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-01-01 22:03:05,591 INFO L168 Benchmark]: RCFGBuilder took 554.97 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: 18.7 MB). Peak memory consumption was 18.7 MB. Max. memory is 11.5 GB. [2019-01-01 22:03:05,591 INFO L168 Benchmark]: BuchiAutomizer took 5063.02 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 67.6 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 13.1 MB). Peak memory consumption was 80.7 MB. Max. memory is 11.5 GB. [2019-01-01 22:03:05,594 INFO L168 Benchmark]: Witness Printer took 4.07 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-01-01 22:03:05,599 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.51 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 789.29 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 137.9 MB). Free memory was 951.4 MB in the beginning and 1.1 GB in the end (delta: -161.3 MB). Peak memory consumption was 30.4 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 69.91 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. * Boogie Preprocessor took 57.49 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 554.97 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: 18.7 MB). Peak memory consumption was 18.7 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 5063.02 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 67.6 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 13.1 MB). Peak memory consumption was 80.7 MB. Max. memory is 11.5 GB. * Witness Printer took 4.07 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. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 1 terminating modules (0 trivial, 1 deterministic, 0 nondeterministic). One deterministic module has affine ranking function 2 * dst + 1 and consists of 4 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 5.0s and 2 iterations. TraceHistogramMax:1. Analysis of lassos took 4.6s. Construction of modules took 0.0s. Büchi inclusion checks took 0.2s. Highest rank in rank-based complementation 3. Minimization of det autom 1. Minimization of nondet autom 0. Automata minimization No data available. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 0 states and ocurred in iteration 1. Nontrivial modules had stage [1, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 16 SDtfs, 15 SDslu, 6 SDs, 0 SdLazy, 1 SolverSat, 1 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc0 concLT0 SILN0 SILU0 SILI0 SILT0 lasso1 LassoPreprocessingBenchmarks: Lassos: inital212 mio100 ax100 hnf99 lsp97 ukn92 mio100 lsp49 div100 bol100 ite100 ukn100 eq193 hnf89 smp100 dnf175 smp97 tf100 neg97 sie110 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 8ms VariablesStem: 1 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 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...