./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/termination-memory-alloca/openbsd_cstrnlen-alloca-2.i --full-output -ea --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 8bd4bc60 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -ea -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 ../sv-benchmarks/c/termination-memory-alloca/openbsd_cstrnlen-alloca-2.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 20d74f4d70a20b55179c45eafbef37cbb7fed804 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.25-8bd4bc6 [2020-07-29 01:36:48,492 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-29 01:36:48,494 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-29 01:36:48,506 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-29 01:36:48,507 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-29 01:36:48,508 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-29 01:36:48,509 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-29 01:36:48,512 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-29 01:36:48,514 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-29 01:36:48,515 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-29 01:36:48,516 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-29 01:36:48,517 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-29 01:36:48,518 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-29 01:36:48,519 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-29 01:36:48,520 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-29 01:36:48,521 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-29 01:36:48,522 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-29 01:36:48,523 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-29 01:36:48,525 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-29 01:36:48,528 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-29 01:36:48,530 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-29 01:36:48,531 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-29 01:36:48,532 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-29 01:36:48,533 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-29 01:36:48,536 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-29 01:36:48,537 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-29 01:36:48,537 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-29 01:36:48,538 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-29 01:36:48,539 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-29 01:36:48,540 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-29 01:36:48,540 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-29 01:36:48,541 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-29 01:36:48,542 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-29 01:36:48,543 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-29 01:36:48,544 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-29 01:36:48,545 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-29 01:36:48,545 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-29 01:36:48,546 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-29 01:36:48,546 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-29 01:36:48,547 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-29 01:36:48,548 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-29 01:36:48,549 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf [2020-07-29 01:36:48,566 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-29 01:36:48,567 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-29 01:36:48,568 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-07-29 01:36:48,568 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-07-29 01:36:48,568 INFO L138 SettingsManager]: * Use SBE=true [2020-07-29 01:36:48,569 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2020-07-29 01:36:48,569 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2020-07-29 01:36:48,569 INFO L138 SettingsManager]: * Use old map elimination=false [2020-07-29 01:36:48,570 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2020-07-29 01:36:48,570 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2020-07-29 01:36:48,570 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2020-07-29 01:36:48,570 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-29 01:36:48,571 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2020-07-29 01:36:48,571 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-29 01:36:48,571 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-29 01:36:48,572 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2020-07-29 01:36:48,572 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2020-07-29 01:36:48,572 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2020-07-29 01:36:48,572 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-29 01:36:48,573 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2020-07-29 01:36:48,573 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-29 01:36:48,573 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2020-07-29 01:36:48,574 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-29 01:36:48,574 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-07-29 01:36:48,574 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2020-07-29 01:36:48,574 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-29 01:36:48,575 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-07-29 01:36:48,575 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-07-29 01:36:48,575 INFO L138 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2020-07-29 01:36:48,576 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2020-07-29 01:36:48,577 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 -> /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 -> 20d74f4d70a20b55179c45eafbef37cbb7fed804 [2020-07-29 01:36:48,876 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-29 01:36:48,890 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-29 01:36:48,893 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-29 01:36:48,895 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-29 01:36:48,895 INFO L275 PluginConnector]: CDTParser initialized [2020-07-29 01:36:48,896 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/termination-memory-alloca/openbsd_cstrnlen-alloca-2.i [2020-07-29 01:36:48,976 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4fef7a970/c80a970b7e084b06a8aee562e1e9c65f/FLAG802103d6f [2020-07-29 01:36:49,539 INFO L306 CDTParser]: Found 1 translation units. [2020-07-29 01:36:49,540 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-memory-alloca/openbsd_cstrnlen-alloca-2.i [2020-07-29 01:36:49,557 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4fef7a970/c80a970b7e084b06a8aee562e1e9c65f/FLAG802103d6f [2020-07-29 01:36:49,896 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4fef7a970/c80a970b7e084b06a8aee562e1e9c65f [2020-07-29 01:36:49,900 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-29 01:36:49,902 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-07-29 01:36:49,903 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-29 01:36:49,903 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-29 01:36:49,907 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-29 01:36:49,909 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.07 01:36:49" (1/1) ... [2020-07-29 01:36:49,912 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@26e670 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:36:49, skipping insertion in model container [2020-07-29 01:36:49,912 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.07 01:36:49" (1/1) ... [2020-07-29 01:36:49,921 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-29 01:36:49,967 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-29 01:36:50,357 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-29 01:36:50,369 INFO L203 MainTranslator]: Completed pre-run [2020-07-29 01:36:50,416 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-29 01:36:50,478 INFO L208 MainTranslator]: Completed translation [2020-07-29 01:36:50,479 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:36:50 WrapperNode [2020-07-29 01:36:50,479 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-29 01:36:50,481 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-07-29 01:36:50,481 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-07-29 01:36:50,481 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-07-29 01:36:50,492 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:36:50" (1/1) ... [2020-07-29 01:36:50,523 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:36:50" (1/1) ... [2020-07-29 01:36:50,551 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-07-29 01:36:50,552 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-29 01:36:50,552 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-29 01:36:50,552 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-29 01:36:50,562 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:36:50" (1/1) ... [2020-07-29 01:36:50,563 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:36:50" (1/1) ... [2020-07-29 01:36:50,566 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:36:50" (1/1) ... [2020-07-29 01:36:50,566 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:36:50" (1/1) ... [2020-07-29 01:36:50,574 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:36:50" (1/1) ... [2020-07-29 01:36:50,580 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:36:50" (1/1) ... [2020-07-29 01:36:50,581 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:36:50" (1/1) ... [2020-07-29 01:36:50,584 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-29 01:36:50,585 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-29 01:36:50,585 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-29 01:36:50,585 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-29 01:36:50,586 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:36:50" (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 [2020-07-29 01:36:50,649 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-07-29 01:36:50,649 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-07-29 01:36:50,649 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-07-29 01:36:50,649 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-07-29 01:36:50,649 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-29 01:36:50,650 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-29 01:36:50,985 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-29 01:36:50,986 INFO L295 CfgBuilder]: Removed 7 assume(true) statements. [2020-07-29 01:36:50,989 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.07 01:36:50 BoogieIcfgContainer [2020-07-29 01:36:50,989 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-29 01:36:50,990 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2020-07-29 01:36:50,990 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2020-07-29 01:36:50,994 INFO L275 PluginConnector]: BuchiAutomizer initialized [2020-07-29 01:36:50,995 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-29 01:36:50,995 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 29.07 01:36:49" (1/3) ... [2020-07-29 01:36:51,001 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@61f4835e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 29.07 01:36:51, skipping insertion in model container [2020-07-29 01:36:51,001 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-29 01:36:51,002 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:36:50" (2/3) ... [2020-07-29 01:36:51,002 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@61f4835e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 29.07 01:36:51, skipping insertion in model container [2020-07-29 01:36:51,003 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-29 01:36:51,003 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.07 01:36:50" (3/3) ... [2020-07-29 01:36:51,006 INFO L371 chiAutomizerObserver]: Analyzing ICFG openbsd_cstrnlen-alloca-2.i [2020-07-29 01:36:51,060 INFO L356 BuchiCegarLoop]: Interprodecural is true [2020-07-29 01:36:51,061 INFO L357 BuchiCegarLoop]: Hoare is false [2020-07-29 01:36:51,061 INFO L358 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2020-07-29 01:36:51,061 INFO L359 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-29 01:36:51,062 INFO L360 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-29 01:36:51,062 INFO L361 BuchiCegarLoop]: Difference is false [2020-07-29 01:36:51,062 INFO L362 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-29 01:36:51,062 INFO L365 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2020-07-29 01:36:51,077 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 14 states. [2020-07-29 01:36:51,104 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2020-07-29 01:36:51,104 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:36:51,105 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:36:51,110 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2020-07-29 01:36:51,111 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2020-07-29 01:36:51,111 INFO L424 BuchiCegarLoop]: ======== Iteration 1============ [2020-07-29 01:36:51,111 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 14 states. [2020-07-29 01:36:51,115 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2020-07-29 01:36:51,115 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:36:51,115 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:36:51,116 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2020-07-29 01:36:51,116 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2020-07-29 01:36:51,124 INFO L794 eck$LassoCheckResult]: Stem: 12#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 10#L-1true havoc main_#res;havoc main_#t~nondet6, main_#t~nondet7, main_#t~malloc8.base, main_#t~malloc8.offset, main_#t~ret9, main_~length1~0, main_~n~0, main_~nondetString1~0.base, main_~nondetString1~0.offset;main_~length1~0 := main_#t~nondet6;havoc main_#t~nondet6;main_~n~0 := main_#t~nondet7;havoc main_#t~nondet7; 4#L558true assume !(main_~length1~0 < 1); 6#L558-2true assume !(main_~n~0 < 1); 15#L561-1true call main_#t~malloc8.base, main_#t~malloc8.offset := #Ultimate.allocOnStack(main_~length1~0);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc8.base, main_#t~malloc8.offset;call write~int(0, main_~nondetString1~0.base, main_~nondetString1~0.offset + (main_~length1~0 - 1), 1);cstrnlen_#in~str.base, cstrnlen_#in~str.offset, cstrnlen_#in~maxlen := main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~n~0;havoc cstrnlen_#res;havoc cstrnlen_#t~post2.base, cstrnlen_#t~post2.offset, cstrnlen_#t~post3, cstrnlen_#t~mem4, cstrnlen_#t~short5, cstrnlen_~str.base, cstrnlen_~str.offset, cstrnlen_~maxlen, cstrnlen_~cp~0.base, cstrnlen_~cp~0.offset;cstrnlen_~str.base, cstrnlen_~str.offset := cstrnlen_#in~str.base, cstrnlen_#in~str.offset;cstrnlen_~maxlen := cstrnlen_#in~maxlen;havoc cstrnlen_~cp~0.base, cstrnlen_~cp~0.offset;cstrnlen_~cp~0.base, cstrnlen_~cp~0.offset := cstrnlen_~str.base, cstrnlen_~str.offset; 7#L551-6true [2020-07-29 01:36:51,125 INFO L796 eck$LassoCheckResult]: Loop: 7#L551-6true cstrnlen_#t~short5 := 0 != cstrnlen_~maxlen % 4294967296; 14#L551-1true assume cstrnlen_#t~short5;call cstrnlen_#t~mem4 := read~int(cstrnlen_~cp~0.base, cstrnlen_~cp~0.offset, 1);cstrnlen_#t~short5 := 0 != cstrnlen_#t~mem4; 3#L551-3true assume !!cstrnlen_#t~short5;havoc cstrnlen_#t~short5;havoc cstrnlen_#t~mem4; 5#L551-5true cstrnlen_#t~post2.base, cstrnlen_#t~post2.offset := cstrnlen_~cp~0.base, cstrnlen_~cp~0.offset;cstrnlen_~cp~0.base, cstrnlen_~cp~0.offset := cstrnlen_#t~post2.base, 1 + cstrnlen_#t~post2.offset;havoc cstrnlen_#t~post2.base, cstrnlen_#t~post2.offset;cstrnlen_#t~post3 := cstrnlen_~maxlen;cstrnlen_~maxlen := cstrnlen_#t~post3 - 1;havoc cstrnlen_#t~post3; 7#L551-6true [2020-07-29 01:36:51,131 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:36:51,132 INFO L82 PathProgramCache]: Analyzing trace with hash 28695878, now seen corresponding path program 1 times [2020-07-29 01:36:51,143 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:36:51,143 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [64451240] [2020-07-29 01:36:51,144 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:36:51,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:36:51,252 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:36:51,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:36:51,274 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:36:51,296 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:36:51,298 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:36:51,298 INFO L82 PathProgramCache]: Analyzing trace with hash 1511654, now seen corresponding path program 1 times [2020-07-29 01:36:51,298 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:36:51,299 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1919667995] [2020-07-29 01:36:51,299 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:36:51,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:36:51,315 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:36:51,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:36:51,327 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:36:51,336 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:36:51,340 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:36:51,341 INFO L82 PathProgramCache]: Analyzing trace with hash 1298318251, now seen corresponding path program 1 times [2020-07-29 01:36:51,342 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:36:51,342 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1455898945] [2020-07-29 01:36:51,343 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:36:51,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:36:51,412 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:36:51,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:36:51,443 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:36:51,456 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:36:51,607 WARN L193 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 34 [2020-07-29 01:36:51,874 WARN L193 SmtUtils]: Spent 194.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 64 [2020-07-29 01:36:51,989 INFO L210 LassoAnalysis]: Preferences: [2020-07-29 01:36:51,990 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-07-29 01:36:51,990 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-07-29 01:36:51,990 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-07-29 01:36:51,991 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-07-29 01:36:51,991 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:36:51,991 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-07-29 01:36:51,991 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-07-29 01:36:51,992 INFO L133 ssoRankerPreferences]: Filename of dumped script: openbsd_cstrnlen-alloca-2.i_Iteration1_Lasso [2020-07-29 01:36:51,992 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-07-29 01:36:51,992 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-07-29 01:36:52,049 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:36:52,232 WARN L193 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 39 [2020-07-29 01:36:52,324 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:36:52,329 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:36:52,334 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:36:52,339 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:36:52,344 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:36:52,349 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:36:52,367 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:36:52,373 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:36:52,379 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:36:52,383 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:36:52,393 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:36:52,397 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:36:52,404 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:36:52,409 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:36:52,415 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:36:52,423 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:36:53,260 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-07-29 01:36:53,266 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 01:36:53,281 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 [2020-07-29 01:36:53,289 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:36:53,290 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:36:53,290 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:36:53,290 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:36:53,335 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:36:53,337 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 01:36:53,361 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-07-29 01:36:53,548 INFO L443 ModelExtractionUtils]: Simplification made 16 calls to the SMT solver. [2020-07-29 01:36:53,548 INFO L444 ModelExtractionUtils]: 7 out of 28 variables were initially zero. Simplification set additionally 18 variables to zero. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 01:36:53,555 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... Waiting until toolchain timeout for monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:36:53,561 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2020-07-29 01:36:53,562 INFO L510 LassoAnalysis]: Proved termination. [2020-07-29 01:36:53,563 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_main_#t~malloc8.base)_1, ULTIMATE.start_cstrnlen_~cp~0.offset) = 1*v_rep(select #length ULTIMATE.start_main_#t~malloc8.base)_1 - 1*ULTIMATE.start_cstrnlen_~cp~0.offset Supporting invariants [] [2020-07-29 01:36:53,622 INFO L297 tatePredicateManager]: 3 out of 4 supporting invariants were superfluous and have been removed [2020-07-29 01:36:53,629 INFO L393 LassoCheck]: Loop: "cstrnlen_#t~short5 := 0 != cstrnlen_~maxlen % 4294967296;" "assume cstrnlen_#t~short5;call cstrnlen_#t~mem4 := read~int(cstrnlen_~cp~0.base, cstrnlen_~cp~0.offset, 1);cstrnlen_#t~short5 := 0 != cstrnlen_#t~mem4;" "assume !!cstrnlen_#t~short5;havoc cstrnlen_#t~short5;havoc cstrnlen_#t~mem4;" "cstrnlen_#t~post2.base, cstrnlen_#t~post2.offset := cstrnlen_~cp~0.base, cstrnlen_~cp~0.offset;cstrnlen_~cp~0.base, cstrnlen_~cp~0.offset := cstrnlen_#t~post2.base, 1 + cstrnlen_#t~post2.offset;havoc cstrnlen_#t~post2.base, cstrnlen_#t~post2.offset;cstrnlen_#t~post3 := cstrnlen_~maxlen;cstrnlen_~maxlen := cstrnlen_#t~post3 - 1;havoc cstrnlen_#t~post3;" [2020-07-29 01:36:53,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:36:53,658 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-29 01:36:53,689 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:36:53,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:36:53,712 INFO L263 TraceCheckSpWp]: Trace formula consists of 47 conjuncts, 10 conjunts are in the unsatisfiable core [2020-07-29 01:36:53,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:36:53,723 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:36:53,734 INFO L280 TraceCheckUtils]: 0: Hoare triple {24#unseeded} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {24#unseeded} is VALID [2020-07-29 01:36:53,736 INFO L280 TraceCheckUtils]: 1: Hoare triple {24#unseeded} havoc main_#res;havoc main_#t~nondet6, main_#t~nondet7, main_#t~malloc8.base, main_#t~malloc8.offset, main_#t~ret9, main_~length1~0, main_~n~0, main_~nondetString1~0.base, main_~nondetString1~0.offset;main_~length1~0 := main_#t~nondet6;havoc main_#t~nondet6;main_~n~0 := main_#t~nondet7;havoc main_#t~nondet7; {24#unseeded} is VALID [2020-07-29 01:36:53,738 INFO L280 TraceCheckUtils]: 2: Hoare triple {24#unseeded} assume !(main_~length1~0 < 1); {24#unseeded} is VALID [2020-07-29 01:36:53,740 INFO L280 TraceCheckUtils]: 3: Hoare triple {24#unseeded} assume !(main_~n~0 < 1); {24#unseeded} is VALID [2020-07-29 01:36:53,741 INFO L280 TraceCheckUtils]: 4: Hoare triple {24#unseeded} call main_#t~malloc8.base, main_#t~malloc8.offset := #Ultimate.allocOnStack(main_~length1~0);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc8.base, main_#t~malloc8.offset;call write~int(0, main_~nondetString1~0.base, main_~nondetString1~0.offset + (main_~length1~0 - 1), 1);cstrnlen_#in~str.base, cstrnlen_#in~str.offset, cstrnlen_#in~maxlen := main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~n~0;havoc cstrnlen_#res;havoc cstrnlen_#t~post2.base, cstrnlen_#t~post2.offset, cstrnlen_#t~post3, cstrnlen_#t~mem4, cstrnlen_#t~short5, cstrnlen_~str.base, cstrnlen_~str.offset, cstrnlen_~maxlen, cstrnlen_~cp~0.base, cstrnlen_~cp~0.offset;cstrnlen_~str.base, cstrnlen_~str.offset := cstrnlen_#in~str.base, cstrnlen_#in~str.offset;cstrnlen_~maxlen := cstrnlen_#in~maxlen;havoc cstrnlen_~cp~0.base, cstrnlen_~cp~0.offset;cstrnlen_~cp~0.base, cstrnlen_~cp~0.offset := cstrnlen_~str.base, cstrnlen_~str.offset; {58#(and (= ULTIMATE.start_cstrnlen_~cp~0.base |ULTIMATE.start_main_#t~malloc8.base|) unseeded)} is VALID [2020-07-29 01:36:53,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:36:53,751 INFO L263 TraceCheckSpWp]: Trace formula consists of 20 conjuncts, 8 conjunts are in the unsatisfiable core [2020-07-29 01:36:53,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:36:53,757 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:36:53,792 INFO L280 TraceCheckUtils]: 0: Hoare triple {59#(and (= ULTIMATE.start_cstrnlen_~cp~0.base |ULTIMATE.start_main_#t~malloc8.base|) (>= oldRank0 (+ (select |#length| |ULTIMATE.start_main_#t~malloc8.base|) (* (- 1) ULTIMATE.start_cstrnlen_~cp~0.offset))))} cstrnlen_#t~short5 := 0 != cstrnlen_~maxlen % 4294967296; {59#(and (= ULTIMATE.start_cstrnlen_~cp~0.base |ULTIMATE.start_main_#t~malloc8.base|) (>= oldRank0 (+ (select |#length| |ULTIMATE.start_main_#t~malloc8.base|) (* (- 1) ULTIMATE.start_cstrnlen_~cp~0.offset))))} is VALID [2020-07-29 01:36:53,793 INFO L280 TraceCheckUtils]: 1: Hoare triple {59#(and (= ULTIMATE.start_cstrnlen_~cp~0.base |ULTIMATE.start_main_#t~malloc8.base|) (>= oldRank0 (+ (select |#length| |ULTIMATE.start_main_#t~malloc8.base|) (* (- 1) ULTIMATE.start_cstrnlen_~cp~0.offset))))} assume cstrnlen_#t~short5;call cstrnlen_#t~mem4 := read~int(cstrnlen_~cp~0.base, cstrnlen_~cp~0.offset, 1);cstrnlen_#t~short5 := 0 != cstrnlen_#t~mem4; {82#(and (= ULTIMATE.start_cstrnlen_~cp~0.base |ULTIMATE.start_main_#t~malloc8.base|) (<= (select |#length| |ULTIMATE.start_main_#t~malloc8.base|) (+ ULTIMATE.start_cstrnlen_~cp~0.offset oldRank0)) (<= (+ ULTIMATE.start_cstrnlen_~cp~0.offset 1) (select |#length| ULTIMATE.start_cstrnlen_~cp~0.base)))} is VALID [2020-07-29 01:36:53,794 INFO L280 TraceCheckUtils]: 2: Hoare triple {82#(and (= ULTIMATE.start_cstrnlen_~cp~0.base |ULTIMATE.start_main_#t~malloc8.base|) (<= (select |#length| |ULTIMATE.start_main_#t~malloc8.base|) (+ ULTIMATE.start_cstrnlen_~cp~0.offset oldRank0)) (<= (+ ULTIMATE.start_cstrnlen_~cp~0.offset 1) (select |#length| ULTIMATE.start_cstrnlen_~cp~0.base)))} assume !!cstrnlen_#t~short5;havoc cstrnlen_#t~short5;havoc cstrnlen_#t~mem4; {82#(and (= ULTIMATE.start_cstrnlen_~cp~0.base |ULTIMATE.start_main_#t~malloc8.base|) (<= (select |#length| |ULTIMATE.start_main_#t~malloc8.base|) (+ ULTIMATE.start_cstrnlen_~cp~0.offset oldRank0)) (<= (+ ULTIMATE.start_cstrnlen_~cp~0.offset 1) (select |#length| ULTIMATE.start_cstrnlen_~cp~0.base)))} is VALID [2020-07-29 01:36:53,796 INFO L280 TraceCheckUtils]: 3: Hoare triple {82#(and (= ULTIMATE.start_cstrnlen_~cp~0.base |ULTIMATE.start_main_#t~malloc8.base|) (<= (select |#length| |ULTIMATE.start_main_#t~malloc8.base|) (+ ULTIMATE.start_cstrnlen_~cp~0.offset oldRank0)) (<= (+ ULTIMATE.start_cstrnlen_~cp~0.offset 1) (select |#length| ULTIMATE.start_cstrnlen_~cp~0.base)))} cstrnlen_#t~post2.base, cstrnlen_#t~post2.offset := cstrnlen_~cp~0.base, cstrnlen_~cp~0.offset;cstrnlen_~cp~0.base, cstrnlen_~cp~0.offset := cstrnlen_#t~post2.base, 1 + cstrnlen_#t~post2.offset;havoc cstrnlen_#t~post2.base, cstrnlen_#t~post2.offset;cstrnlen_#t~post3 := cstrnlen_~maxlen;cstrnlen_~maxlen := cstrnlen_#t~post3 - 1;havoc cstrnlen_#t~post3; {61#(and (or (and (> oldRank0 (+ (select |#length| |ULTIMATE.start_main_#t~malloc8.base|) (* (- 1) ULTIMATE.start_cstrnlen_~cp~0.offset))) (>= oldRank0 0)) unseeded) (= ULTIMATE.start_cstrnlen_~cp~0.base |ULTIMATE.start_main_#t~malloc8.base|))} is VALID [2020-07-29 01:36:53,796 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 01:36:53,808 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2020-07-29 01:36:53,825 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 9 edges. 9 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:36:53,827 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 5 letters. Loop has 4 letters. [2020-07-29 01:36:53,831 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:36:53,837 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 [2020-07-29 01:36:53,839 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 14 states. Second operand 4 states. [2020-07-29 01:36:53,973 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 14 states.. Second operand 4 states. Result 36 states and 45 transitions. Complement of second has 8 states. [2020-07-29 01:36:53,974 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2020-07-29 01:36:53,974 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 01:36:53,974 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 14 states. [2020-07-29 01:36:53,977 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2020-07-29 01:36:53,977 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:36:53,977 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:36:53,978 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 4 states. [2020-07-29 01:36:53,984 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2020-07-29 01:36:53,984 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:36:53,985 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:36:53,985 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 36 states and 45 transitions. [2020-07-29 01:36:53,987 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2020-07-29 01:36:53,987 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:36:53,987 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:36:53,990 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 14 states. [2020-07-29 01:36:53,992 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2020-07-29 01:36:53,993 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 4 examples of accepted words. [2020-07-29 01:36:53,993 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 4 states. [2020-07-29 01:36:53,996 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2020-07-29 01:36:53,996 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 2 examples of accepted words. [2020-07-29 01:36:53,997 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 36 states and 45 transitions. cyclomatic complexity: 11 [2020-07-29 01:36:53,998 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 4 examples of accepted words. [2020-07-29 01:36:53,998 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states. Stem has 5 letters. Loop has 4 letters. [2020-07-29 01:36:53,999 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:36:53,999 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 5 letters. Loop has 4 letters. [2020-07-29 01:36:53,999 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:36:54,000 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 36 states and 45 transitions. cyclomatic complexity: 11 Stem has 5 letters. Loop has 4 letters. [2020-07-29 01:36:54,000 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:36:54,001 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states. Stem has 1 letters. Loop has 3 letters. [2020-07-29 01:36:54,001 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:36:54,001 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 1 letters. Loop has 3 letters. [2020-07-29 01:36:54,001 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:36:54,002 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 36 states and 45 transitions. cyclomatic complexity: 11 Stem has 1 letters. Loop has 3 letters. [2020-07-29 01:36:54,002 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:36:54,002 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states. Stem has 7 letters. Loop has 4 letters. [2020-07-29 01:36:54,002 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:36:54,003 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 7 letters. Loop has 4 letters. [2020-07-29 01:36:54,003 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:36:54,003 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 36 states and 45 transitions. cyclomatic complexity: 11 Stem has 7 letters. Loop has 4 letters. [2020-07-29 01:36:54,004 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:36:54,004 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states. Stem has 36 letters. Loop has 36 letters. [2020-07-29 01:36:54,004 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:36:54,005 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 36 letters. Loop has 36 letters. [2020-07-29 01:36:54,005 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:36:54,005 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 36 states and 45 transitions. cyclomatic complexity: 11 Stem has 36 letters. Loop has 36 letters. [2020-07-29 01:36:54,005 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:36:54,006 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states. Stem has 14 letters. Loop has 14 letters. [2020-07-29 01:36:54,006 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:36:54,006 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 14 letters. Loop has 14 letters. [2020-07-29 01:36:54,006 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:36:54,007 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 36 states and 45 transitions. cyclomatic complexity: 11 Stem has 14 letters. Loop has 14 letters. [2020-07-29 01:36:54,007 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:36:54,007 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states. Stem has 5 letters. Loop has 5 letters. [2020-07-29 01:36:54,007 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:36:54,007 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 5 letters. Loop has 5 letters. [2020-07-29 01:36:54,008 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:36:54,008 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 36 states and 45 transitions. cyclomatic complexity: 11 Stem has 5 letters. Loop has 5 letters. [2020-07-29 01:36:54,008 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:36:54,008 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states. Stem has 7 letters. Loop has 4 letters. [2020-07-29 01:36:54,009 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:36:54,009 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 7 letters. Loop has 4 letters. [2020-07-29 01:36:54,009 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:36:54,010 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 36 states and 45 transitions. cyclomatic complexity: 11 Stem has 7 letters. Loop has 4 letters. [2020-07-29 01:36:54,010 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:36:54,010 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states. Stem has 8 letters. Loop has 4 letters. [2020-07-29 01:36:54,011 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:36:54,011 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 8 letters. Loop has 4 letters. [2020-07-29 01:36:54,011 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:36:54,012 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 36 states and 45 transitions. cyclomatic complexity: 11 Stem has 8 letters. Loop has 4 letters. [2020-07-29 01:36:54,012 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:36:54,012 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states. Stem has 5 letters. Loop has 4 letters. [2020-07-29 01:36:54,013 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:36:54,013 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 5 letters. Loop has 4 letters. [2020-07-29 01:36:54,013 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:36:54,014 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 36 states and 45 transitions. cyclomatic complexity: 11 Stem has 5 letters. Loop has 4 letters. [2020-07-29 01:36:54,014 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:36:54,014 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states. Stem has 6 letters. Loop has 4 letters. [2020-07-29 01:36:54,015 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:36:54,015 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 6 letters. Loop has 4 letters. [2020-07-29 01:36:54,015 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:36:54,015 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 36 states and 45 transitions. cyclomatic complexity: 11 Stem has 6 letters. Loop has 4 letters. [2020-07-29 01:36:54,016 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:36:54,016 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states. Stem has 2 letters. Loop has 1 letters. [2020-07-29 01:36:54,016 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:36:54,016 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 2 letters. Loop has 1 letters. [2020-07-29 01:36:54,017 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:36:54,017 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 36 states and 45 transitions. cyclomatic complexity: 11 Stem has 2 letters. Loop has 1 letters. [2020-07-29 01:36:54,017 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:36:54,017 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states. Stem has 1 letters. Loop has 3 letters. [2020-07-29 01:36:54,018 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:36:54,018 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 1 letters. Loop has 3 letters. [2020-07-29 01:36:54,018 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:36:54,018 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 36 states and 45 transitions. cyclomatic complexity: 11 Stem has 1 letters. Loop has 3 letters. [2020-07-29 01:36:54,019 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:36:54,019 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states. Stem has 7 letters. Loop has 4 letters. [2020-07-29 01:36:54,019 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:36:54,019 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 7 letters. Loop has 4 letters. [2020-07-29 01:36:54,020 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:36:54,020 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 36 states and 45 transitions. cyclomatic complexity: 11 Stem has 7 letters. Loop has 4 letters. [2020-07-29 01:36:54,020 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:36:54,020 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states. Stem has 9 letters. Loop has 4 letters. [2020-07-29 01:36:54,021 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:36:54,021 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 9 letters. Loop has 4 letters. [2020-07-29 01:36:54,021 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:36:54,021 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 36 states and 45 transitions. cyclomatic complexity: 11 Stem has 9 letters. Loop has 4 letters. [2020-07-29 01:36:54,022 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:36:54,022 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states. Stem has 10 letters. Loop has 4 letters. [2020-07-29 01:36:54,022 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:36:54,022 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 10 letters. Loop has 4 letters. [2020-07-29 01:36:54,023 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:36:54,023 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 36 states and 45 transitions. cyclomatic complexity: 11 Stem has 10 letters. Loop has 4 letters. [2020-07-29 01:36:54,023 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:36:54,023 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states. Stem has 8 letters. Loop has 4 letters. [2020-07-29 01:36:54,024 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:36:54,024 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 8 letters. Loop has 4 letters. [2020-07-29 01:36:54,024 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:36:54,024 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 36 states and 45 transitions. cyclomatic complexity: 11 Stem has 8 letters. Loop has 4 letters. [2020-07-29 01:36:54,025 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:36:54,025 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 01:36:54,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-29 01:36:54,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 25 transitions. [2020-07-29 01:36:54,029 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 25 transitions. Stem has 5 letters. Loop has 4 letters. [2020-07-29 01:36:54,029 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:36:54,030 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 25 transitions. Stem has 9 letters. Loop has 4 letters. [2020-07-29 01:36:54,030 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:36:54,030 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 25 transitions. Stem has 5 letters. Loop has 8 letters. [2020-07-29 01:36:54,030 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:36:54,032 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 36 states and 45 transitions. cyclomatic complexity: 11 [2020-07-29 01:36:54,035 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2020-07-29 01:36:54,040 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 36 states to 18 states and 23 transitions. [2020-07-29 01:36:54,042 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2020-07-29 01:36:54,042 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2020-07-29 01:36:54,043 INFO L73 IsDeterministic]: Start isDeterministic. Operand 18 states and 23 transitions. [2020-07-29 01:36:54,043 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-07-29 01:36:54,043 INFO L688 BuchiCegarLoop]: Abstraction has 18 states and 23 transitions. [2020-07-29 01:36:54,063 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states and 23 transitions. [2020-07-29 01:36:54,073 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 17. [2020-07-29 01:36:54,073 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 01:36:54,074 INFO L82 GeneralOperation]: Start isEquivalent. First operand 18 states and 23 transitions. Second operand 17 states. [2020-07-29 01:36:54,074 INFO L74 IsIncluded]: Start isIncluded. First operand 18 states and 23 transitions. Second operand 17 states. [2020-07-29 01:36:54,077 INFO L87 Difference]: Start difference. First operand 18 states and 23 transitions. Second operand 17 states. [2020-07-29 01:36:54,081 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2020-07-29 01:36:54,085 INFO L93 Difference]: Finished difference Result 18 states and 23 transitions. [2020-07-29 01:36:54,086 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 23 transitions. [2020-07-29 01:36:54,087 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:36:54,087 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:36:54,087 INFO L74 IsIncluded]: Start isIncluded. First operand 17 states. Second operand 18 states and 23 transitions. [2020-07-29 01:36:54,088 INFO L87 Difference]: Start difference. First operand 17 states. Second operand 18 states and 23 transitions. [2020-07-29 01:36:54,089 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2020-07-29 01:36:54,093 INFO L93 Difference]: Finished difference Result 19 states and 25 transitions. [2020-07-29 01:36:54,093 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 25 transitions. [2020-07-29 01:36:54,094 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:36:54,094 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:36:54,095 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 01:36:54,095 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 01:36:54,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2020-07-29 01:36:54,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 22 transitions. [2020-07-29 01:36:54,098 INFO L711 BuchiCegarLoop]: Abstraction has 17 states and 22 transitions. [2020-07-29 01:36:54,099 INFO L591 BuchiCegarLoop]: Abstraction has 17 states and 22 transitions. [2020-07-29 01:36:54,099 INFO L424 BuchiCegarLoop]: ======== Iteration 2============ [2020-07-29 01:36:54,099 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states and 22 transitions. [2020-07-29 01:36:54,103 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2020-07-29 01:36:54,103 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:36:54,103 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:36:54,104 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2020-07-29 01:36:54,104 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2020-07-29 01:36:54,104 INFO L794 eck$LassoCheckResult]: Stem: 144#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 141#L-1 havoc main_#res;havoc main_#t~nondet6, main_#t~nondet7, main_#t~malloc8.base, main_#t~malloc8.offset, main_#t~ret9, main_~length1~0, main_~n~0, main_~nondetString1~0.base, main_~nondetString1~0.offset;main_~length1~0 := main_#t~nondet6;havoc main_#t~nondet6;main_~n~0 := main_#t~nondet7;havoc main_#t~nondet7; 142#L558 assume !(main_~length1~0 < 1); 143#L558-2 assume !(main_~n~0 < 1); 147#L561-1 call main_#t~malloc8.base, main_#t~malloc8.offset := #Ultimate.allocOnStack(main_~length1~0);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc8.base, main_#t~malloc8.offset;call write~int(0, main_~nondetString1~0.base, main_~nondetString1~0.offset + (main_~length1~0 - 1), 1);cstrnlen_#in~str.base, cstrnlen_#in~str.offset, cstrnlen_#in~maxlen := main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~n~0;havoc cstrnlen_#res;havoc cstrnlen_#t~post2.base, cstrnlen_#t~post2.offset, cstrnlen_#t~post3, cstrnlen_#t~mem4, cstrnlen_#t~short5, cstrnlen_~str.base, cstrnlen_~str.offset, cstrnlen_~maxlen, cstrnlen_~cp~0.base, cstrnlen_~cp~0.offset;cstrnlen_~str.base, cstrnlen_~str.offset := cstrnlen_#in~str.base, cstrnlen_#in~str.offset;cstrnlen_~maxlen := cstrnlen_#in~maxlen;havoc cstrnlen_~cp~0.base, cstrnlen_~cp~0.offset;cstrnlen_~cp~0.base, cstrnlen_~cp~0.offset := cstrnlen_~str.base, cstrnlen_~str.offset; 152#L551-6 cstrnlen_#t~short5 := 0 != cstrnlen_~maxlen % 4294967296; 148#L551-1 [2020-07-29 01:36:54,105 INFO L796 eck$LassoCheckResult]: Loop: 148#L551-1 assume !cstrnlen_#t~short5; 137#L551-3 assume !!cstrnlen_#t~short5;havoc cstrnlen_#t~short5;havoc cstrnlen_#t~mem4; 138#L551-5 cstrnlen_#t~post2.base, cstrnlen_#t~post2.offset := cstrnlen_~cp~0.base, cstrnlen_~cp~0.offset;cstrnlen_~cp~0.base, cstrnlen_~cp~0.offset := cstrnlen_#t~post2.base, 1 + cstrnlen_#t~post2.offset;havoc cstrnlen_#t~post2.base, cstrnlen_#t~post2.offset;cstrnlen_#t~post3 := cstrnlen_~maxlen;cstrnlen_~maxlen := cstrnlen_#t~post3 - 1;havoc cstrnlen_#t~post3; 145#L551-6 cstrnlen_#t~short5 := 0 != cstrnlen_~maxlen % 4294967296; 148#L551-1 [2020-07-29 01:36:54,105 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:36:54,105 INFO L82 PathProgramCache]: Analyzing trace with hash 889572237, now seen corresponding path program 1 times [2020-07-29 01:36:54,106 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:36:54,106 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1169357914] [2020-07-29 01:36:54,106 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:36:54,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:36:54,157 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:36:54,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:36:54,180 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:36:54,185 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:36:54,185 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:36:54,186 INFO L82 PathProgramCache]: Analyzing trace with hash 1668346, now seen corresponding path program 1 times [2020-07-29 01:36:54,186 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:36:54,186 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1996363095] [2020-07-29 01:36:54,186 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:36:54,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:36:54,222 INFO L280 TraceCheckUtils]: 0: Hoare triple {239#true} assume !cstrnlen_#t~short5; {241#(not |ULTIMATE.start_cstrnlen_#t~short5|)} is VALID [2020-07-29 01:36:54,223 INFO L280 TraceCheckUtils]: 1: Hoare triple {241#(not |ULTIMATE.start_cstrnlen_#t~short5|)} assume !!cstrnlen_#t~short5;havoc cstrnlen_#t~short5;havoc cstrnlen_#t~mem4; {240#false} is VALID [2020-07-29 01:36:54,223 INFO L280 TraceCheckUtils]: 2: Hoare triple {240#false} cstrnlen_#t~post2.base, cstrnlen_#t~post2.offset := cstrnlen_~cp~0.base, cstrnlen_~cp~0.offset;cstrnlen_~cp~0.base, cstrnlen_~cp~0.offset := cstrnlen_#t~post2.base, 1 + cstrnlen_#t~post2.offset;havoc cstrnlen_#t~post2.base, cstrnlen_#t~post2.offset;cstrnlen_#t~post3 := cstrnlen_~maxlen;cstrnlen_~maxlen := cstrnlen_#t~post3 - 1;havoc cstrnlen_#t~post3; {240#false} is VALID [2020-07-29 01:36:54,223 INFO L280 TraceCheckUtils]: 3: Hoare triple {240#false} cstrnlen_#t~short5 := 0 != cstrnlen_~maxlen % 4294967296; {240#false} is VALID [2020-07-29 01:36:54,224 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 01:36:54,224 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1996363095] [2020-07-29 01:36:54,225 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-29 01:36:54,225 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-07-29 01:36:54,226 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2000845715] [2020-07-29 01:36:54,229 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-07-29 01:36:54,229 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-29 01:36:54,232 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-29 01:36:54,232 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-29 01:36:54,233 INFO L87 Difference]: Start difference. First operand 17 states and 22 transitions. cyclomatic complexity: 7 Second operand 3 states. [2020-07-29 01:36:54,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:36:54,266 INFO L93 Difference]: Finished difference Result 13 states and 16 transitions. [2020-07-29 01:36:54,266 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-29 01:36:54,267 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-29 01:36:54,274 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 4 edges. 4 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:36:54,275 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 13 states and 16 transitions. [2020-07-29 01:36:54,276 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2020-07-29 01:36:54,277 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 13 states to 0 states and 0 transitions. [2020-07-29 01:36:54,277 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2020-07-29 01:36:54,277 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2020-07-29 01:36:54,277 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2020-07-29 01:36:54,277 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-07-29 01:36:54,277 INFO L688 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-29 01:36:54,277 INFO L711 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-29 01:36:54,277 INFO L591 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-29 01:36:54,277 INFO L424 BuchiCegarLoop]: ======== Iteration 3============ [2020-07-29 01:36:54,278 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2020-07-29 01:36:54,278 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2020-07-29 01:36:54,278 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2020-07-29 01:36:54,285 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 29.07 01:36:54 BoogieIcfgContainer [2020-07-29 01:36:54,285 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2020-07-29 01:36:54,285 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2020-07-29 01:36:54,285 INFO L271 PluginConnector]: Initializing Witness Printer... [2020-07-29 01:36:54,286 INFO L275 PluginConnector]: Witness Printer initialized [2020-07-29 01:36:54,286 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.07 01:36:50" (3/4) ... [2020-07-29 01:36:54,290 INFO L140 WitnessPrinter]: No result that supports witness generation found [2020-07-29 01:36:54,290 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2020-07-29 01:36:54,292 INFO L168 Benchmark]: Toolchain (without parser) took 4391.11 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 214.4 MB). Free memory was 956.2 MB in the beginning and 1.1 GB in the end (delta: -157.8 MB). Peak memory consumption was 56.7 MB. Max. memory is 11.5 GB. [2020-07-29 01:36:54,293 INFO L168 Benchmark]: CDTParser took 0.29 ms. Allocated memory is still 1.0 GB. Free memory is still 981.7 MB. There was no memory consumed. Max. memory is 11.5 GB. [2020-07-29 01:36:54,294 INFO L168 Benchmark]: CACSL2BoogieTranslator took 576.21 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 139.5 MB). Free memory was 956.2 MB in the beginning and 1.1 GB in the end (delta: -164.7 MB). Peak memory consumption was 20.6 MB. Max. memory is 11.5 GB. [2020-07-29 01:36:54,295 INFO L168 Benchmark]: Boogie Procedure Inliner took 70.78 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. [2020-07-29 01:36:54,296 INFO L168 Benchmark]: Boogie Preprocessor took 32.40 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. [2020-07-29 01:36:54,296 INFO L168 Benchmark]: RCFGBuilder took 405.00 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: 24.3 MB). Peak memory consumption was 24.3 MB. Max. memory is 11.5 GB. [2020-07-29 01:36:54,297 INFO L168 Benchmark]: BuchiAutomizer took 3294.92 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 75.0 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -24.1 MB). Peak memory consumption was 50.9 MB. Max. memory is 11.5 GB. [2020-07-29 01:36:54,298 INFO L168 Benchmark]: Witness Printer took 4.94 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. [2020-07-29 01:36:54,302 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - AssertionsEnabledResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.29 ms. Allocated memory is still 1.0 GB. Free memory is still 981.7 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 576.21 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 139.5 MB). Free memory was 956.2 MB in the beginning and 1.1 GB in the end (delta: -164.7 MB). Peak memory consumption was 20.6 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 70.78 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 32.40 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 405.00 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: 24.3 MB). Peak memory consumption was 24.3 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 3294.92 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 75.0 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -24.1 MB). Peak memory consumption was 50.9 MB. Max. memory is 11.5 GB. * Witness Printer took 4.94 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.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #length * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 2 terminating modules (1 trivial, 1 deterministic, 0 nondeterministic). One deterministic module has affine ranking function unknown-#length-unknown[__builtin_alloca (length1 * sizeof(char))] + -1 * cp 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 3.2s and 3 iterations. TraceHistogramMax:1. Analysis of lassos took 2.6s. Construction of modules took 0.0s. Büchi inclusion checks took 0.3s. 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 17 states and ocurred in iteration 1. Nontrivial modules had stage [1, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 23 SDtfs, 14 SDslu, 15 SDs, 0 SdLazy, 16 SolverSat, 5 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time LassoAnalysisResults: nont0 unkn0 SFLI1 SFLT0 conc0 concLT0 SILN0 SILU0 SILI0 SILT0 lasso1 LassoPreprocessingBenchmarks: Lassos: inital134 mio100 ax113 hnf98 lsp70 ukn91 mio100 lsp46 div131 bol100 ite100 ukn100 eq157 hnf82 smp100 dnf100 smp100 tf100 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: sat Degree: 0 Time: 294ms VariablesStem: 8 VariablesLoop: 5 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...