./Ultimate.py --spec /storage/repos/svcomp/c/properties/termination.prp --file /storage/repos/svcomp/c/termination-memory-alloca/openbsd_cstrnlen-alloca_true-termination.c.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 91b1670e 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-memory-alloca/openbsd_cstrnlen-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 20d74f4d70a20b55179c45eafbef37cbb7fed804 ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-91b1670 [2018-11-28 23:21:32,578 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-28 23:21:32,580 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-28 23:21:32,595 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-28 23:21:32,596 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-28 23:21:32,598 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-28 23:21:32,601 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-28 23:21:32,605 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-28 23:21:32,607 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-28 23:21:32,610 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-28 23:21:32,613 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-28 23:21:32,614 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-28 23:21:32,614 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-28 23:21:32,616 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-28 23:21:32,617 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-28 23:21:32,619 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-28 23:21:32,620 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-28 23:21:32,624 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-28 23:21:32,626 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-28 23:21:32,628 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-28 23:21:32,629 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-28 23:21:32,630 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-28 23:21:32,633 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-28 23:21:32,633 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-28 23:21:32,633 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-28 23:21:32,634 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-28 23:21:32,635 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-28 23:21:32,636 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-28 23:21:32,637 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-28 23:21:32,638 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-28 23:21:32,639 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-28 23:21:32,639 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-28 23:21:32,639 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-28 23:21:32,640 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-28 23:21:32,641 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-28 23:21:32,642 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-28 23:21:32,642 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf [2018-11-28 23:21:32,658 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-28 23:21:32,659 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-28 23:21:32,660 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-28 23:21:32,660 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-28 23:21:32,660 INFO L133 SettingsManager]: * Use SBE=true [2018-11-28 23:21:32,660 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-11-28 23:21:32,661 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-11-28 23:21:32,661 INFO L133 SettingsManager]: * Use old map elimination=false [2018-11-28 23:21:32,661 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-11-28 23:21:32,661 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-11-28 23:21:32,661 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-11-28 23:21:32,663 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-28 23:21:32,663 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-28 23:21:32,663 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-28 23:21:32,663 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-28 23:21:32,664 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-11-28 23:21:32,664 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-11-28 23:21:32,664 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-11-28 23:21:32,664 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-28 23:21:32,664 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-11-28 23:21:32,664 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-28 23:21:32,665 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-11-28 23:21:32,666 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-28 23:21:32,666 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-28 23:21:32,666 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-11-28 23:21:32,666 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-28 23:21:32,666 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-28 23:21:32,667 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-11-28 23:21:32,667 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-11-28 23:21:32,668 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 -> 20d74f4d70a20b55179c45eafbef37cbb7fed804 [2018-11-28 23:21:32,705 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-28 23:21:32,721 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-28 23:21:32,724 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-28 23:21:32,725 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-28 23:21:32,725 INFO L276 PluginConnector]: CDTParser initialized [2018-11-28 23:21:32,726 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/termination-memory-alloca/openbsd_cstrnlen-alloca_true-termination.c.i [2018-11-28 23:21:32,789 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/89904a651/12f0df97d8b842b8a053fc4e53970eee/FLAG6349fbac2 [2018-11-28 23:21:33,244 INFO L307 CDTParser]: Found 1 translation units. [2018-11-28 23:21:33,245 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/termination-memory-alloca/openbsd_cstrnlen-alloca_true-termination.c.i [2018-11-28 23:21:33,257 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/89904a651/12f0df97d8b842b8a053fc4e53970eee/FLAG6349fbac2 [2018-11-28 23:21:33,573 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/89904a651/12f0df97d8b842b8a053fc4e53970eee [2018-11-28 23:21:33,577 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-28 23:21:33,578 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-28 23:21:33,579 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-28 23:21:33,579 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-28 23:21:33,584 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-28 23:21:33,585 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 11:21:33" (1/1) ... [2018-11-28 23:21:33,588 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@42d5fd9e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:21:33, skipping insertion in model container [2018-11-28 23:21:33,588 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 11:21:33" (1/1) ... [2018-11-28 23:21:33,597 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-28 23:21:33,651 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-28 23:21:34,041 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-11-28 23:21:34,057 INFO L191 MainTranslator]: Completed pre-run [2018-11-28 23:21:34,122 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-11-28 23:21:34,260 INFO L195 MainTranslator]: Completed translation [2018-11-28 23:21:34,261 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:21:34 WrapperNode [2018-11-28 23:21:34,261 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-28 23:21:34,262 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-28 23:21:34,262 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-28 23:21:34,262 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-28 23:21:34,271 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:21:34" (1/1) ... [2018-11-28 23:21:34,289 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:21:34" (1/1) ... [2018-11-28 23:21:34,313 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-28 23:21:34,313 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-28 23:21:34,314 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-28 23:21:34,314 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-28 23:21:34,323 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:21:34" (1/1) ... [2018-11-28 23:21:34,324 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:21:34" (1/1) ... [2018-11-28 23:21:34,327 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:21:34" (1/1) ... [2018-11-28 23:21:34,327 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:21:34" (1/1) ... [2018-11-28 23:21:34,334 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:21:34" (1/1) ... [2018-11-28 23:21:34,340 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:21:34" (1/1) ... [2018-11-28 23:21:34,348 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:21:34" (1/1) ... [2018-11-28 23:21:34,353 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-28 23:21:34,353 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-28 23:21:34,353 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-28 23:21:34,354 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-28 23:21:34,354 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:21:34" (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 [2018-11-28 23:21:34,414 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-28 23:21:34,414 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-28 23:21:34,415 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-28 23:21:34,415 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-28 23:21:34,415 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-28 23:21:34,415 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-28 23:21:34,754 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-28 23:21:34,754 INFO L280 CfgBuilder]: Removed 7 assue(true) statements. [2018-11-28 23:21:34,755 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 11:21:34 BoogieIcfgContainer [2018-11-28 23:21:34,755 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-28 23:21:34,756 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-11-28 23:21:34,757 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-11-28 23:21:34,761 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-11-28 23:21:34,762 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-28 23:21:34,762 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 28.11 11:21:33" (1/3) ... [2018-11-28 23:21:34,763 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@53353a7e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 28.11 11:21:34, skipping insertion in model container [2018-11-28 23:21:34,763 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-28 23:21:34,763 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:21:34" (2/3) ... [2018-11-28 23:21:34,764 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@53353a7e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 28.11 11:21:34, skipping insertion in model container [2018-11-28 23:21:34,764 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-28 23:21:34,764 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 11:21:34" (3/3) ... [2018-11-28 23:21:34,766 INFO L375 chiAutomizerObserver]: Analyzing ICFG openbsd_cstrnlen-alloca_true-termination.c.i [2018-11-28 23:21:34,824 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-28 23:21:34,825 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-11-28 23:21:34,825 INFO L375 BuchiCegarLoop]: Hoare is false [2018-11-28 23:21:34,825 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-11-28 23:21:34,826 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-28 23:21:34,826 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-28 23:21:34,826 INFO L379 BuchiCegarLoop]: Difference is false [2018-11-28 23:21:34,826 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-28 23:21:34,826 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-11-28 23:21:34,839 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 14 states. [2018-11-28 23:21:34,861 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2018-11-28 23:21:34,861 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 23:21:34,861 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 23:21:34,869 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2018-11-28 23:21:34,869 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-11-28 23:21:34,869 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-11-28 23:21:34,869 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 14 states. [2018-11-28 23:21:34,871 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2018-11-28 23:21:34,871 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 23:21:34,871 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 23:21:34,872 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2018-11-28 23:21:34,872 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-11-28 23:21:34,879 INFO L794 eck$LassoCheckResult]: Stem: 12#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 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.alloc(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 [2018-11-28 23:21:34,879 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 [2018-11-28 23:21:34,885 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:21:34,885 INFO L82 PathProgramCache]: Analyzing trace with hash 28695878, now seen corresponding path program 1 times [2018-11-28 23:21:34,887 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:21:34,887 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:21:34,940 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:21:34,940 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:21:34,940 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:21:34,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:21:35,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:21:35,027 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:21:35,027 INFO L82 PathProgramCache]: Analyzing trace with hash 1511654, now seen corresponding path program 1 times [2018-11-28 23:21:35,027 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:21:35,027 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:21:35,029 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:21:35,029 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:21:35,030 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:21:35,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:21:35,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:21:35,052 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:21:35,052 INFO L82 PathProgramCache]: Analyzing trace with hash 1298318251, now seen corresponding path program 1 times [2018-11-28 23:21:35,052 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:21:35,052 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:21:35,054 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:21:35,054 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:21:35,054 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:21:35,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:21:35,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:21:35,454 WARN L180 SmtUtils]: Spent 315.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 34 [2018-11-28 23:21:35,638 WARN L180 SmtUtils]: Spent 153.00 ms on a formula simplification that was a NOOP. DAG size: 30 [2018-11-28 23:21:35,981 WARN L180 SmtUtils]: Spent 340.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 63 [2018-11-28 23:21:36,105 WARN L180 SmtUtils]: Spent 120.00 ms on a formula simplification that was a NOOP. DAG size: 57 [2018-11-28 23:21:36,136 INFO L216 LassoAnalysis]: Preferences: [2018-11-28 23:21:36,137 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-28 23:21:36,141 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-28 23:21:36,141 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-28 23:21:36,141 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-28 23:21:36,142 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 23:21:36,142 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-28 23:21:36,142 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-28 23:21:36,142 INFO L131 ssoRankerPreferences]: Filename of dumped script: openbsd_cstrnlen-alloca_true-termination.c.i_Iteration1_Lasso [2018-11-28 23:21:36,142 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-28 23:21:36,143 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-28 23:21:36,176 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:21:36,209 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:21:36,242 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:21:36,273 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:21:36,300 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:21:36,346 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:21:36,462 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:21:36,466 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:21:36,470 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:21:36,475 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:21:36,481 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:21:36,494 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:21:36,501 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:21:36,503 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:21:36,767 WARN L180 SmtUtils]: Spent 156.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 38 [2018-11-28 23:21:36,865 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:21:36,869 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:21:36,874 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:21:37,628 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-28 23:21:37,633 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-28 23:21:37,635 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 [2018-11-28 23:21:37,636 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:21:37,637 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:21:37,637 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:21:37,638 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:21:37,638 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:21:37,640 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:21:37,640 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:21:37,642 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:21:37,643 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 [2018-11-28 23:21:37,643 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:21:37,644 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:21:37,644 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:21:37,644 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:21:37,644 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:21:37,645 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:21:37,645 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:21:37,646 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:21:37,646 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 [2018-11-28 23:21:37,647 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:21:37,647 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:21:37,647 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:21:37,647 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:21:37,648 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:21:37,648 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:21:37,648 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:21:37,650 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:21:37,650 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 [2018-11-28 23:21:37,651 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:21:37,651 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:21:37,651 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:21:37,651 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:21:37,651 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:21:37,652 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:21:37,652 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:21:37,653 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:21:37,653 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 [2018-11-28 23:21:37,654 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:21:37,654 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:21:37,654 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:21:37,654 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:21:37,657 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:21:37,657 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:21:37,661 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:21:37,662 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 [2018-11-28 23:21:37,662 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:21:37,662 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:21:37,663 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:21:37,663 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:21:37,668 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:21:37,668 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:21:37,711 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:21:37,716 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 [2018-11-28 23:21:37,717 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:21:37,717 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:21:37,717 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:21:37,718 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:21:37,721 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:21:37,722 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:21:37,730 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:21:37,733 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 [2018-11-28 23:21:37,734 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:21:37,734 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:21:37,734 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:21:37,734 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:21:37,734 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:21:37,735 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:21:37,735 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:21:37,737 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:21:37,737 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 [2018-11-28 23:21:37,738 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:21:37,738 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:21:37,739 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:21:37,739 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:21:37,739 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:21:37,740 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:21:37,740 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:21:37,743 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:21:37,744 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 [2018-11-28 23:21:37,745 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:21:37,745 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:21:37,745 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:21:37,745 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:21:37,753 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:21:37,753 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:21:37,757 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:21:37,759 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 [2018-11-28 23:21:37,760 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:21:37,760 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:21:37,760 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:21:37,760 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:21:37,761 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:21:37,762 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:21:37,762 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:21:37,763 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:21:37,767 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 [2018-11-28 23:21:37,767 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:21:37,767 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:21:37,768 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:21:37,768 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:21:37,774 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:21:37,775 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:21:37,781 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:21:37,781 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 [2018-11-28 23:21:37,783 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:21:37,784 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:21:37,784 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:21:37,784 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:21:37,784 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:21:37,785 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:21:37,785 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:21:37,786 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:21:37,786 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 [2018-11-28 23:21:37,787 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:21:37,787 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:21:37,787 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:21:37,787 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:21:37,793 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:21:37,794 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:21:37,848 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-28 23:21:37,917 INFO L443 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. [2018-11-28 23:21:37,917 INFO L444 ModelExtractionUtils]: 22 out of 28 variables were initially zero. Simplification set additionally 3 variables to zero. [2018-11-28 23:21:37,920 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-28 23:21:37,923 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-28 23:21:37,924 INFO L518 LassoAnalysis]: Proved termination. [2018-11-28 23:21:37,924 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_cstrnlen_~cp~0.offset, v_rep(select #length ULTIMATE.start_main_#t~malloc8.base)_1) = -1*ULTIMATE.start_cstrnlen_~cp~0.offset + 1*v_rep(select #length ULTIMATE.start_main_#t~malloc8.base)_1 Supporting invariants [] [2018-11-28 23:21:38,060 INFO L297 tatePredicateManager]: 3 out of 4 supporting invariants were superfluous and have been removed [2018-11-28 23:21:38,090 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2018-11-28 23:21:38,137 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:21:38,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:21:38,168 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:21:38,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:21:38,189 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:21:38,217 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 23:21:38,232 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 [2018-11-28 23:21:38,233 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 14 states. Second operand 4 states. [2018-11-28 23:21:38,355 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 14 states.. Second operand 4 states. Result 36 states and 45 transitions. Complement of second has 8 states. [2018-11-28 23:21:38,356 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2018-11-28 23:21:38,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-28 23:21:38,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 25 transitions. [2018-11-28 23:21:38,361 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 25 transitions. Stem has 5 letters. Loop has 4 letters. [2018-11-28 23:21:38,362 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:21:38,362 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 25 transitions. Stem has 9 letters. Loop has 4 letters. [2018-11-28 23:21:38,363 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:21:38,363 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 25 transitions. Stem has 5 letters. Loop has 8 letters. [2018-11-28 23:21:38,363 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:21:38,364 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 36 states and 45 transitions. [2018-11-28 23:21:38,367 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2018-11-28 23:21:38,371 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 36 states to 18 states and 23 transitions. [2018-11-28 23:21:38,373 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2018-11-28 23:21:38,373 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2018-11-28 23:21:38,374 INFO L73 IsDeterministic]: Start isDeterministic. Operand 18 states and 23 transitions. [2018-11-28 23:21:38,374 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-28 23:21:38,374 INFO L705 BuchiCegarLoop]: Abstraction has 18 states and 23 transitions. [2018-11-28 23:21:38,391 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states and 23 transitions. [2018-11-28 23:21:38,400 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 17. [2018-11-28 23:21:38,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-11-28 23:21:38,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 22 transitions. [2018-11-28 23:21:38,403 INFO L728 BuchiCegarLoop]: Abstraction has 17 states and 22 transitions. [2018-11-28 23:21:38,403 INFO L608 BuchiCegarLoop]: Abstraction has 17 states and 22 transitions. [2018-11-28 23:21:38,403 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-11-28 23:21:38,403 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states and 22 transitions. [2018-11-28 23:21:38,405 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2018-11-28 23:21:38,405 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 23:21:38,405 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 23:21:38,406 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2018-11-28 23:21:38,406 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-11-28 23:21:38,407 INFO L794 eck$LassoCheckResult]: Stem: 133#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 130#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; 131#L558 assume !(main_~length1~0 < 1); 132#L558-2 assume !(main_~n~0 < 1); 136#L561-1 call main_#t~malloc8.base, main_#t~malloc8.offset := #Ultimate.alloc(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; 141#L551-6 cstrnlen_#t~short5 := 0 != cstrnlen_~maxlen % 4294967296; 137#L551-1 [2018-11-28 23:21:38,407 INFO L796 eck$LassoCheckResult]: Loop: 137#L551-1 assume !cstrnlen_#t~short5; 126#L551-3 assume !!cstrnlen_#t~short5;havoc cstrnlen_#t~short5;havoc cstrnlen_#t~mem4; 127#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; 134#L551-6 cstrnlen_#t~short5 := 0 != cstrnlen_~maxlen % 4294967296; 137#L551-1 [2018-11-28 23:21:38,407 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:21:38,407 INFO L82 PathProgramCache]: Analyzing trace with hash 889572237, now seen corresponding path program 1 times [2018-11-28 23:21:38,407 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:21:38,407 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:21:38,409 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:21:38,409 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:21:38,409 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:21:38,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:21:38,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:21:38,429 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:21:38,429 INFO L82 PathProgramCache]: Analyzing trace with hash 1668346, now seen corresponding path program 1 times [2018-11-28 23:21:38,429 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:21:38,429 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:21:38,430 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:21:38,430 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:21:38,431 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:21:38,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:21:38,474 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 23:21:38,476 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 23:21:38,476 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-28 23:21:38,478 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-11-28 23:21:38,480 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 23:21:38,481 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 23:21:38,482 INFO L87 Difference]: Start difference. First operand 17 states and 22 transitions. cyclomatic complexity: 7 Second operand 3 states. [2018-11-28 23:21:38,498 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 23:21:38,498 INFO L93 Difference]: Finished difference Result 13 states and 16 transitions. [2018-11-28 23:21:38,499 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 23:21:38,499 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 13 states and 16 transitions. [2018-11-28 23:21:38,501 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-28 23:21:38,502 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 13 states to 0 states and 0 transitions. [2018-11-28 23:21:38,502 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2018-11-28 23:21:38,502 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2018-11-28 23:21:38,502 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2018-11-28 23:21:38,502 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-28 23:21:38,502 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-28 23:21:38,503 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-28 23:21:38,503 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-28 23:21:38,503 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-11-28 23:21:38,503 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2018-11-28 23:21:38,503 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-28 23:21:38,503 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2018-11-28 23:21:38,509 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 28.11 11:21:38 BoogieIcfgContainer [2018-11-28 23:21:38,510 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-11-28 23:21:38,510 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-28 23:21:38,510 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-28 23:21:38,510 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-28 23:21:38,512 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 11:21:34" (3/4) ... [2018-11-28 23:21:38,515 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-11-28 23:21:38,515 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-28 23:21:38,516 INFO L168 Benchmark]: Toolchain (without parser) took 4938.47 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 152.0 MB). Free memory was 947.3 MB in the beginning and 905.9 MB in the end (delta: 41.4 MB). Peak memory consumption was 193.4 MB. Max. memory is 11.5 GB. [2018-11-28 23:21:38,517 INFO L168 Benchmark]: CDTParser took 0.13 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. [2018-11-28 23:21:38,518 INFO L168 Benchmark]: CACSL2BoogieTranslator took 682.14 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 152.0 MB). Free memory was 947.3 MB in the beginning and 1.1 GB in the end (delta: -198.9 MB). Peak memory consumption was 37.2 MB. Max. memory is 11.5 GB. [2018-11-28 23:21:38,519 INFO L168 Benchmark]: Boogie Procedure Inliner took 51.35 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. [2018-11-28 23:21:38,519 INFO L168 Benchmark]: Boogie Preprocessor took 39.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. [2018-11-28 23:21:38,520 INFO L168 Benchmark]: RCFGBuilder took 402.17 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: 17.8 MB). Peak memory consumption was 17.8 MB. Max. memory is 11.5 GB. [2018-11-28 23:21:38,521 INFO L168 Benchmark]: BuchiAutomizer took 3753.25 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 905.9 MB in the end (delta: 215.8 MB). Peak memory consumption was 215.8 MB. Max. memory is 11.5 GB. [2018-11-28 23:21:38,522 INFO L168 Benchmark]: Witness Printer took 4.97 ms. Allocated memory is still 1.2 GB. Free memory is still 905.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-28 23:21:38,527 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.13 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 682.14 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 152.0 MB). Free memory was 947.3 MB in the beginning and 1.1 GB in the end (delta: -198.9 MB). Peak memory consumption was 37.2 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 51.35 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 39.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 402.17 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: 17.8 MB). Peak memory consumption was 17.8 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 3753.25 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 905.9 MB in the end (delta: 215.8 MB). Peak memory consumption was 215.8 MB. Max. memory is 11.5 GB. * Witness Printer took 4.97 ms. Allocated memory is still 1.2 GB. Free memory is still 905.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #length * 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 -1 * cp + unknown-#length-unknown[__builtin_alloca (length1 * sizeof(char))] 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.7s and 3 iterations. TraceHistogramMax:1. Analysis of lassos took 3.2s. 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 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, 18 SDslu, 15 SDs, 0 SdLazy, 15 SolverSat, 5 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time LassoAnalysisResults: nont0 unkn0 SFLI1 SFLT0 conc0 concLT0 SILN0 SILU0 SILI0 SILT0 lasso1 LassoPreprocessingBenchmarks: Lassos: inital132 mio100 ax113 hnf98 lsp70 ukn91 mio100 lsp47 div135 bol100 ite100 ukn100 eq155 hnf81 smp100 dnf101 smp100 tf100 neg98 sie103 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 7ms 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...