./Ultimate.py --spec /storage/repos/svcomp/c/properties/termination.prp --file /storage/repos/svcomp/c/termination-memory-alloca/openbsd_cstrncpy-alloca_true-termination.c.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 0ed9222f 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_cstrncpy-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 51c86dc5019658537c4cb35ed62637baeb91c588 .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-0ed9222-m [2019-01-14 02:35:48,008 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-14 02:35:48,010 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-14 02:35:48,022 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-14 02:35:48,022 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-14 02:35:48,023 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-14 02:35:48,024 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-14 02:35:48,026 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-14 02:35:48,028 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-14 02:35:48,029 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-14 02:35:48,030 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-14 02:35:48,030 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-14 02:35:48,031 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-14 02:35:48,032 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-14 02:35:48,034 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-14 02:35:48,034 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-14 02:35:48,035 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-14 02:35:48,037 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-14 02:35:48,039 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-14 02:35:48,041 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-14 02:35:48,042 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-14 02:35:48,043 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-14 02:35:48,046 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-14 02:35:48,046 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-14 02:35:48,046 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-14 02:35:48,047 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-14 02:35:48,049 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-14 02:35:48,049 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-14 02:35:48,050 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-14 02:35:48,051 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-14 02:35:48,052 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-14 02:35:48,052 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-14 02:35:48,053 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-14 02:35:48,053 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-14 02:35:48,054 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-14 02:35:48,055 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-14 02:35:48,055 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf [2019-01-14 02:35:48,072 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-14 02:35:48,072 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-14 02:35:48,074 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-14 02:35:48,074 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-14 02:35:48,074 INFO L133 SettingsManager]: * Use SBE=true [2019-01-14 02:35:48,074 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-01-14 02:35:48,074 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-01-14 02:35:48,075 INFO L133 SettingsManager]: * Use old map elimination=false [2019-01-14 02:35:48,076 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2019-01-14 02:35:48,076 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2019-01-14 02:35:48,076 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-01-14 02:35:48,076 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-14 02:35:48,076 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-01-14 02:35:48,076 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-14 02:35:48,077 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-14 02:35:48,077 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-01-14 02:35:48,077 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-01-14 02:35:48,077 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-01-14 02:35:48,077 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-14 02:35:48,077 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-01-14 02:35:48,078 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-14 02:35:48,079 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-01-14 02:35:48,079 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-14 02:35:48,079 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-14 02:35:48,080 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-01-14 02:35:48,080 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-14 02:35:48,080 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-14 02:35:48,080 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-01-14 02:35:48,082 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-01-14 02:35:48,082 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 -> 51c86dc5019658537c4cb35ed62637baeb91c588 [2019-01-14 02:35:48,116 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-14 02:35:48,129 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-14 02:35:48,134 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-14 02:35:48,135 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-14 02:35:48,136 INFO L276 PluginConnector]: CDTParser initialized [2019-01-14 02:35:48,136 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/termination-memory-alloca/openbsd_cstrncpy-alloca_true-termination.c.i [2019-01-14 02:35:48,199 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4b818e961/202a3874fba6419197cd44e1d9be4c68/FLAG10f118530 [2019-01-14 02:35:48,679 INFO L307 CDTParser]: Found 1 translation units. [2019-01-14 02:35:48,680 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/termination-memory-alloca/openbsd_cstrncpy-alloca_true-termination.c.i [2019-01-14 02:35:48,701 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4b818e961/202a3874fba6419197cd44e1d9be4c68/FLAG10f118530 [2019-01-14 02:35:48,995 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4b818e961/202a3874fba6419197cd44e1d9be4c68 [2019-01-14 02:35:49,000 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-14 02:35:49,001 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-01-14 02:35:49,002 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-14 02:35:49,002 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-14 02:35:49,008 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-14 02:35:49,009 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.01 02:35:48" (1/1) ... [2019-01-14 02:35:49,012 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1d2cb0c9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:35:49, skipping insertion in model container [2019-01-14 02:35:49,012 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.01 02:35:48" (1/1) ... [2019-01-14 02:35:49,019 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-14 02:35:49,068 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-14 02:35:49,448 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-14 02:35:49,459 INFO L191 MainTranslator]: Completed pre-run [2019-01-14 02:35:49,593 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-14 02:35:49,648 INFO L195 MainTranslator]: Completed translation [2019-01-14 02:35:49,648 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:35:49 WrapperNode [2019-01-14 02:35:49,648 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-14 02:35:49,649 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-14 02:35:49,649 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-14 02:35:49,649 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-14 02:35:49,657 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:35:49" (1/1) ... [2019-01-14 02:35:49,671 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:35:49" (1/1) ... [2019-01-14 02:35:49,699 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-14 02:35:49,700 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-14 02:35:49,701 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-14 02:35:49,702 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-14 02:35:49,709 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:35:49" (1/1) ... [2019-01-14 02:35:49,709 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:35:49" (1/1) ... [2019-01-14 02:35:49,713 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:35:49" (1/1) ... [2019-01-14 02:35:49,713 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:35:49" (1/1) ... [2019-01-14 02:35:49,722 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:35:49" (1/1) ... [2019-01-14 02:35:49,727 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:35:49" (1/1) ... [2019-01-14 02:35:49,729 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:35:49" (1/1) ... [2019-01-14 02:35:49,732 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-14 02:35:49,732 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-14 02:35:49,732 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-14 02:35:49,732 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-14 02:35:49,733 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:35:49" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 02:35:49,788 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-01-14 02:35:49,788 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-01-14 02:35:49,788 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-01-14 02:35:49,789 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-01-14 02:35:49,789 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-14 02:35:49,789 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-14 02:35:50,202 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-14 02:35:50,202 INFO L286 CfgBuilder]: Removed 8 assue(true) statements. [2019-01-14 02:35:50,204 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 02:35:50 BoogieIcfgContainer [2019-01-14 02:35:50,204 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-14 02:35:50,205 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-01-14 02:35:50,205 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-01-14 02:35:50,208 INFO L276 PluginConnector]: BuchiAutomizer initialized [2019-01-14 02:35:50,209 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-14 02:35:50,209 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 14.01 02:35:48" (1/3) ... [2019-01-14 02:35:50,212 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@3de02cf3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 14.01 02:35:50, skipping insertion in model container [2019-01-14 02:35:50,212 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-14 02:35:50,212 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:35:49" (2/3) ... [2019-01-14 02:35:50,213 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@3de02cf3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 14.01 02:35:50, skipping insertion in model container [2019-01-14 02:35:50,213 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-14 02:35:50,213 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 02:35:50" (3/3) ... [2019-01-14 02:35:50,216 INFO L375 chiAutomizerObserver]: Analyzing ICFG openbsd_cstrncpy-alloca_true-termination.c.i [2019-01-14 02:35:50,281 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-14 02:35:50,282 INFO L374 BuchiCegarLoop]: Interprodecural is true [2019-01-14 02:35:50,282 INFO L375 BuchiCegarLoop]: Hoare is false [2019-01-14 02:35:50,282 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-01-14 02:35:50,283 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-14 02:35:50,283 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-14 02:35:50,283 INFO L379 BuchiCegarLoop]: Difference is false [2019-01-14 02:35:50,283 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-14 02:35:50,283 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-01-14 02:35:50,297 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states. [2019-01-14 02:35:50,317 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2019-01-14 02:35:50,318 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 02:35:50,318 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 02:35:50,325 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2019-01-14 02:35:50,325 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2019-01-14 02:35:50,325 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2019-01-14 02:35:50,326 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states. [2019-01-14 02:35:50,327 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2019-01-14 02:35:50,328 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 02:35:50,328 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 02:35:50,328 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2019-01-14 02:35:50,328 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2019-01-14 02:35:50,335 INFO L794 eck$LassoCheckResult]: Stem: 10#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 8#L-1true havoc main_#res;havoc main_#t~nondet8, main_#t~nondet9, main_#t~malloc10.base, main_#t~malloc10.offset, main_#t~malloc11.base, main_#t~malloc11.offset, main_#t~ret12.base, main_#t~ret12.offset, main_~length~0, main_~n~0, main_~nondetArea~0.base, main_~nondetArea~0.offset, main_~nondetString~0.base, main_~nondetString~0.offset;main_~length~0 := main_#t~nondet8;havoc main_#t~nondet8;main_~n~0 := main_#t~nondet9;havoc main_#t~nondet9; 4#L566true assume !(main_~length~0 < 1); 9#L566-2true assume !(main_~n~0 < 1); 3#L569-1true call main_#t~malloc10.base, main_#t~malloc10.offset := #Ultimate.allocOnStack(main_~n~0);main_~nondetArea~0.base, main_~nondetArea~0.offset := main_#t~malloc10.base, main_#t~malloc10.offset;call main_#t~malloc11.base, main_#t~malloc11.offset := #Ultimate.allocOnStack(main_~length~0);main_~nondetString~0.base, main_~nondetString~0.offset := main_#t~malloc11.base, main_#t~malloc11.offset;call write~int(0, main_~nondetString~0.base, main_~nondetString~0.offset + (main_~length~0 - 1), 1);cstrncpy_#in~dst.base, cstrncpy_#in~dst.offset, cstrncpy_#in~src.base, cstrncpy_#in~src.offset, cstrncpy_#in~n := main_~nondetArea~0.base, main_~nondetArea~0.offset, main_~nondetString~0.base, main_~nondetString~0.offset, main_~n~0;havoc cstrncpy_#res.base, cstrncpy_#res.offset;havoc cstrncpy_#t~post3.base, cstrncpy_#t~post3.offset, cstrncpy_#t~post4.base, cstrncpy_#t~post4.offset, cstrncpy_#t~mem5, cstrncpy_#t~post7.base, cstrncpy_#t~post7.offset, cstrncpy_#t~pre6, cstrncpy_#t~pre2, cstrncpy_~d~0.base, cstrncpy_~d~0.offset, cstrncpy_~s~0.base, cstrncpy_~s~0.offset, cstrncpy_~dst.base, cstrncpy_~dst.offset, cstrncpy_~src.base, cstrncpy_~src.offset, cstrncpy_~n;cstrncpy_~dst.base, cstrncpy_~dst.offset := cstrncpy_#in~dst.base, cstrncpy_#in~dst.offset;cstrncpy_~src.base, cstrncpy_~src.offset := cstrncpy_#in~src.base, cstrncpy_#in~src.offset;cstrncpy_~n := cstrncpy_#in~n; 16#L550true assume 0 != cstrncpy_~n % 4294967296;cstrncpy_~d~0.base, cstrncpy_~d~0.offset := cstrncpy_~dst.base, cstrncpy_~dst.offset;cstrncpy_~s~0.base, cstrncpy_~s~0.offset := cstrncpy_~src.base, cstrncpy_~src.offset; 18#L553-4true [2019-01-14 02:35:50,336 INFO L796 eck$LassoCheckResult]: Loop: 18#L553-4true cstrncpy_#t~post3.base, cstrncpy_#t~post3.offset := cstrncpy_~d~0.base, cstrncpy_~d~0.offset;cstrncpy_~d~0.base, cstrncpy_~d~0.offset := cstrncpy_#t~post3.base, 1 + cstrncpy_#t~post3.offset;cstrncpy_#t~post4.base, cstrncpy_#t~post4.offset := cstrncpy_~s~0.base, cstrncpy_~s~0.offset;cstrncpy_~s~0.base, cstrncpy_~s~0.offset := cstrncpy_#t~post4.base, 1 + cstrncpy_#t~post4.offset;call cstrncpy_#t~mem5 := read~int(cstrncpy_#t~post4.base, cstrncpy_#t~post4.offset, 1);call write~int(cstrncpy_#t~mem5, cstrncpy_#t~post3.base, cstrncpy_#t~post3.offset, 1); 6#L554true assume !(0 == cstrncpy_#t~mem5);havoc cstrncpy_#t~post4.base, cstrncpy_#t~post4.offset;havoc cstrncpy_#t~mem5;havoc cstrncpy_#t~post3.base, cstrncpy_#t~post3.offset; 12#L553-1true cstrncpy_#t~pre2 := cstrncpy_~n - 1;cstrncpy_~n := cstrncpy_~n - 1; 13#L553-2true assume !!(0 != cstrncpy_#t~pre2 % 4294967296);havoc cstrncpy_#t~pre2; 18#L553-4true [2019-01-14 02:35:50,341 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:35:50,342 INFO L82 PathProgramCache]: Analyzing trace with hash 889572236, now seen corresponding path program 1 times [2019-01-14 02:35:50,344 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:35:50,344 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:35:50,391 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:35:50,391 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:35:50,391 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:35:50,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:35:50,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:35:50,496 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:35:50,496 INFO L82 PathProgramCache]: Analyzing trace with hash 1618712, now seen corresponding path program 1 times [2019-01-14 02:35:50,497 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:35:50,497 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:35:50,498 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:35:50,499 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:35:50,499 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:35:50,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:35:50,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:35:50,526 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:35:50,526 INFO L82 PathProgramCache]: Analyzing trace with hash 1592246563, now seen corresponding path program 1 times [2019-01-14 02:35:50,526 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:35:50,527 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:35:50,528 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:35:50,528 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:35:50,528 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:35:50,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:35:50,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:35:50,907 WARN L181 SmtUtils]: Spent 279.00 ms on a formula simplification that was a NOOP. DAG size: 60 [2019-01-14 02:35:51,049 WARN L181 SmtUtils]: Spent 128.00 ms on a formula simplification that was a NOOP. DAG size: 50 [2019-01-14 02:35:51,923 WARN L181 SmtUtils]: Spent 868.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 95 [2019-01-14 02:35:52,112 WARN L181 SmtUtils]: Spent 186.00 ms on a formula simplification that was a NOOP. DAG size: 89 [2019-01-14 02:35:52,140 INFO L216 LassoAnalysis]: Preferences: [2019-01-14 02:35:52,141 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-14 02:35:52,142 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-14 02:35:52,142 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-14 02:35:52,142 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-14 02:35:52,142 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 02:35:52,142 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-14 02:35:52,142 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-14 02:35:52,143 INFO L131 ssoRankerPreferences]: Filename of dumped script: openbsd_cstrncpy-alloca_true-termination.c.i_Iteration1_Lasso [2019-01-14 02:35:52,143 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-14 02:35:52,143 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-14 02:35:52,174 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:35:52,194 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:35:52,200 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:35:52,203 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:35:52,217 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:35:52,222 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:35:52,231 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:35:52,237 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:35:52,241 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:35:52,245 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:35:52,264 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:35:52,285 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:35:52,288 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:35:52,295 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:35:52,298 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:35:52,310 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:35:52,312 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:35:52,319 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:35:52,834 WARN L181 SmtUtils]: Spent 402.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 80 [2019-01-14 02:35:53,140 WARN L181 SmtUtils]: Spent 257.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 65 [2019-01-14 02:35:53,141 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:35:53,143 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:35:53,149 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:35:53,152 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:35:53,541 WARN L181 SmtUtils]: Spent 273.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 63 [2019-01-14 02:35:53,714 WARN L181 SmtUtils]: Spent 172.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 49 [2019-01-14 02:35:54,042 WARN L181 SmtUtils]: Spent 123.00 ms on a formula simplification that was a NOOP. DAG size: 63 [2019-01-14 02:35:54,694 WARN L181 SmtUtils]: Spent 559.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 43 [2019-01-14 02:35:54,789 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-14 02:35:54,795 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-14 02:35:54,797 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:35:54,798 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:35:54,798 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:35:54,799 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:35:54,799 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:35:54,799 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:35:54,801 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:35:54,801 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:35:54,803 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:35:54,804 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:35:54,804 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:35:54,805 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:35:54,805 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:35:54,805 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:35:54,805 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:35:54,806 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:35:54,806 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:35:54,806 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:35:54,807 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:35:54,807 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:35:54,807 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:35:54,808 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:35:54,808 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:35:54,808 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:35:54,808 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:35:54,809 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:35:54,809 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:35:54,810 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:35:54,810 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:35:54,810 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:35:54,810 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:35:54,811 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:35:54,811 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:35:54,811 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:35:54,811 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:35:54,812 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:35:54,813 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:35:54,813 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:35:54,813 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:35:54,813 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:35:54,814 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:35:54,814 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:35:54,814 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:35:54,814 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:35:54,815 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:35:54,815 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:35:54,816 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:35:54,816 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:35:54,816 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:35:54,816 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:35:54,819 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:35:54,819 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:35:54,822 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:35:54,823 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:35:54,823 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:35:54,823 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:35:54,823 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:35:54,824 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:35:54,824 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:35:54,824 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:35:54,824 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:35:54,825 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:35:54,826 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:35:54,826 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:35:54,826 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:35:54,826 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:35:54,827 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:35:54,827 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:35:54,827 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:35:54,827 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:35:54,828 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:35:54,828 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:35:54,829 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:35:54,829 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:35:54,829 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:35:54,829 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:35:54,831 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:35:54,831 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:35:54,836 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:35:54,837 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:35:54,837 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:35:54,837 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:35:54,837 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:35:54,838 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:35:54,840 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:35:54,840 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:35:54,843 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:35:54,843 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:35:54,844 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:35:54,844 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:35:54,844 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:35:54,844 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:35:54,844 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:35:54,845 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:35:54,845 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:35:54,846 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:35:54,846 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:35:54,847 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:35:54,847 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:35:54,847 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:35:54,847 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:35:54,847 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:35:54,848 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:35:54,848 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:35:54,848 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:35:54,849 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:35:54,849 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:35:54,849 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:35:54,849 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:35:54,850 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:35:54,850 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:35:54,850 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:35:54,850 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:35:54,851 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:35:54,852 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:35:54,852 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:35:54,852 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:35:54,853 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:35:54,853 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:35:54,853 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:35:54,853 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:35:54,853 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:35:54,854 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:35:54,855 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:35:54,855 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:35:54,855 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:35:54,855 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:35:54,856 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:35:54,856 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:35:54,856 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:35:54,856 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:35:54,857 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:35:54,858 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:35:54,858 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:35:54,858 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:35:54,858 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:35:54,858 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:35:54,859 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:35:54,859 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:35:54,859 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:35:54,860 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:35:54,860 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:35:54,861 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:35:54,861 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:35:54,861 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:35:54,861 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:35:54,863 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:35:54,863 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:35:54,867 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:35:54,867 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:35:54,868 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:35:54,868 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:35:54,868 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:35:54,868 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:35:54,887 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:35:54,889 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:35:55,083 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-14 02:35:55,198 INFO L443 ModelExtractionUtils]: Simplification made 9 calls to the SMT solver. [2019-01-14 02:35:55,201 INFO L444 ModelExtractionUtils]: 44 out of 55 variables were initially zero. Simplification set additionally 8 variables to zero. [2019-01-14 02:35:55,203 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-14 02:35:55,207 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-01-14 02:35:55,208 INFO L518 LassoAnalysis]: Proved termination. [2019-01-14 02:35:55,208 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_cstrncpy_~d~0.offset, v_rep(select #length ULTIMATE.start_main_#t~malloc10.base)_1) = -1*ULTIMATE.start_cstrncpy_~d~0.offset + 1*v_rep(select #length ULTIMATE.start_main_#t~malloc10.base)_1 Supporting invariants [] [2019-01-14 02:35:55,570 INFO L297 tatePredicateManager]: 12 out of 13 supporting invariants were superfluous and have been removed [2019-01-14 02:35:55,603 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2019-01-14 02:35:56,083 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:35:56,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:35:56,130 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:35:56,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:35:56,295 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:35:56,553 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 02:35:56,570 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 2 loop predicates [2019-01-14 02:35:56,572 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 17 states. Second operand 4 states. [2019-01-14 02:35:56,779 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 17 states.. Second operand 4 states. Result 37 states and 46 transitions. Complement of second has 7 states. [2019-01-14 02:35:56,782 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 2 stem states 1 non-accepting loop states 1 accepting loop states [2019-01-14 02:35:56,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-01-14 02:35:56,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 33 transitions. [2019-01-14 02:35:56,786 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 33 transitions. Stem has 6 letters. Loop has 4 letters. [2019-01-14 02:35:56,788 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:35:56,788 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 33 transitions. Stem has 10 letters. Loop has 4 letters. [2019-01-14 02:35:56,788 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:35:56,788 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 33 transitions. Stem has 6 letters. Loop has 8 letters. [2019-01-14 02:35:56,789 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:35:56,790 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 37 states and 46 transitions. [2019-01-14 02:35:56,793 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-01-14 02:35:56,796 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 37 states to 0 states and 0 transitions. [2019-01-14 02:35:56,797 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2019-01-14 02:35:56,797 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2019-01-14 02:35:56,797 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2019-01-14 02:35:56,797 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-14 02:35:56,798 INFO L706 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-14 02:35:56,798 INFO L729 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-14 02:35:56,798 INFO L609 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-14 02:35:56,798 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2019-01-14 02:35:56,798 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2019-01-14 02:35:56,798 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-01-14 02:35:56,798 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2019-01-14 02:35:56,803 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 14.01 02:35:56 BoogieIcfgContainer [2019-01-14 02:35:56,803 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2019-01-14 02:35:56,804 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-14 02:35:56,804 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-14 02:35:56,804 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-14 02:35:56,805 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 02:35:50" (3/4) ... [2019-01-14 02:35:56,808 INFO L147 WitnessPrinter]: No result that supports witness generation found [2019-01-14 02:35:56,808 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-14 02:35:56,809 INFO L168 Benchmark]: Toolchain (without parser) took 7808.38 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 190.8 MB). Free memory was 952.7 MB in the beginning and 953.9 MB in the end (delta: -1.2 MB). Peak memory consumption was 189.7 MB. Max. memory is 11.5 GB. [2019-01-14 02:35:56,810 INFO L168 Benchmark]: CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-14 02:35:56,810 INFO L168 Benchmark]: CACSL2BoogieTranslator took 646.59 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 121.1 MB). Free memory was 947.3 MB in the beginning and 1.1 GB in the end (delta: -155.1 MB). Peak memory consumption was 25.1 MB. Max. memory is 11.5 GB. [2019-01-14 02:35:56,811 INFO L168 Benchmark]: Boogie Procedure Inliner took 50.73 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-14 02:35:56,812 INFO L168 Benchmark]: Boogie Preprocessor took 31.57 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-14 02:35:56,812 INFO L168 Benchmark]: RCFGBuilder took 471.86 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: 25.6 MB). Peak memory consumption was 25.6 MB. Max. memory is 11.5 GB. [2019-01-14 02:35:56,813 INFO L168 Benchmark]: BuchiAutomizer took 6598.98 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 69.7 MB). Free memory was 1.1 GB in the beginning and 953.9 MB in the end (delta: 123.0 MB). Peak memory consumption was 192.7 MB. Max. memory is 11.5 GB. [2019-01-14 02:35:56,814 INFO L168 Benchmark]: Witness Printer took 3.93 ms. Allocated memory is still 1.2 GB. Free memory is still 953.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-14 02:35:56,819 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.15 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 646.59 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 121.1 MB). Free memory was 947.3 MB in the beginning and 1.1 GB in the end (delta: -155.1 MB). Peak memory consumption was 25.1 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 50.73 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 31.57 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 471.86 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: 25.6 MB). Peak memory consumption was 25.6 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 6598.98 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 69.7 MB). Free memory was 1.1 GB in the beginning and 953.9 MB in the end (delta: 123.0 MB). Peak memory consumption was 192.7 MB. Max. memory is 11.5 GB. * Witness Printer took 3.93 ms. Allocated memory is still 1.2 GB. Free memory is still 953.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 1 terminating modules (0 trivial, 1 deterministic, 0 nondeterministic). One deterministic module has affine ranking function -1 * d + unknown-#length-unknown[__builtin_alloca (n * sizeof(char))] and consists of 5 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 6.5s and 2 iterations. TraceHistogramMax:1. Analysis of lassos took 5.2s. Construction of modules took 0.1s. Büchi inclusion checks took 1.0s. Highest rank in rank-based complementation 3. Minimization of det autom 1. Minimization of nondet autom 0. Automata minimization No data available. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 0 states and ocurred in iteration 1. Nontrivial modules had stage [1, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 18 SDtfs, 21 SDslu, 15 SDs, 0 SdLazy, 10 SolverSat, 7 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.1s Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc0 concLT0 SILN0 SILU0 SILI0 SILT0 lasso1 LassoPreprocessingBenchmarks: Lassos: inital232 mio100 ax107 hnf99 lsp90 ukn93 mio100 lsp52 div172 bol100 ite100 ukn100 eq174 hnf69 smp93 dnf130 smp97 tf100 neg97 sie110 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 6ms 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...