./Ultimate.py --spec /storage/repos/svcomp/c/properties/termination.prp --file /storage/repos/svcomp/c/array-memsafety/openbsd_cstpcpy-alloca_true-valid-memsafety_true-termination.i --full-output --architecture 32bit -------------------------------------------------------------------------------- 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/array-memsafety/openbsd_cstpcpy-alloca_true-valid-memsafety_true-termination.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-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 32bit --witnessprinter.graph.data.programhash 2995aa83f0315dcda376bb0d80edf8fb8acf3951 ......................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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 04:57:56,450 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-14 04:57:56,451 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-14 04:57:56,463 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-14 04:57:56,463 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-14 04:57:56,464 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-14 04:57:56,465 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-14 04:57:56,468 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-14 04:57:56,470 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-14 04:57:56,472 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-14 04:57:56,474 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-14 04:57:56,474 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-14 04:57:56,475 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-14 04:57:56,478 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-14 04:57:56,480 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-14 04:57:56,482 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-14 04:57:56,483 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-14 04:57:56,488 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-14 04:57:56,490 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-14 04:57:56,492 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-14 04:57:56,493 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-14 04:57:56,494 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-14 04:57:56,497 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-14 04:57:56,497 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-14 04:57:56,497 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-14 04:57:56,499 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-14 04:57:56,500 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-14 04:57:56,501 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-14 04:57:56,502 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-14 04:57:56,503 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-14 04:57:56,503 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-14 04:57:56,504 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-14 04:57:56,504 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-14 04:57:56,505 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-14 04:57:56,505 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-14 04:57:56,507 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-14 04:57:56,507 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2019-01-14 04:57:56,536 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-14 04:57:56,536 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-14 04:57:56,538 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-14 04:57:56,538 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-14 04:57:56,538 INFO L133 SettingsManager]: * Use SBE=true [2019-01-14 04:57:56,538 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-01-14 04:57:56,538 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-01-14 04:57:56,539 INFO L133 SettingsManager]: * Use old map elimination=false [2019-01-14 04:57:56,539 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2019-01-14 04:57:56,539 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2019-01-14 04:57:56,539 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-01-14 04:57:56,539 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-14 04:57:56,539 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-14 04:57:56,540 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-01-14 04:57:56,541 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-14 04:57:56,541 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-14 04:57:56,541 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-14 04:57:56,541 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-01-14 04:57:56,541 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-01-14 04:57:56,541 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-01-14 04:57:56,542 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-14 04:57:56,542 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-14 04:57:56,542 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-01-14 04:57:56,542 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-14 04:57:56,542 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-01-14 04:57:56,542 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-14 04:57:56,544 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-14 04:57:56,544 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-01-14 04:57:56,545 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-14 04:57:56,545 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-14 04:57:56,545 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-01-14 04:57:56,546 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-01-14 04:57:56,546 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 -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 2995aa83f0315dcda376bb0d80edf8fb8acf3951 [2019-01-14 04:57:56,610 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-14 04:57:56,627 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-14 04:57:56,629 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-14 04:57:56,630 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-14 04:57:56,631 INFO L276 PluginConnector]: CDTParser initialized [2019-01-14 04:57:56,631 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/array-memsafety/openbsd_cstpcpy-alloca_true-valid-memsafety_true-termination.i [2019-01-14 04:57:56,679 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7ecc98bec/e9378d449a1c48458c7bad4d3a39f1cd/FLAG024a303fd [2019-01-14 04:57:57,185 INFO L307 CDTParser]: Found 1 translation units. [2019-01-14 04:57:57,185 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/array-memsafety/openbsd_cstpcpy-alloca_true-valid-memsafety_true-termination.i [2019-01-14 04:57:57,198 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7ecc98bec/e9378d449a1c48458c7bad4d3a39f1cd/FLAG024a303fd [2019-01-14 04:57:57,479 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7ecc98bec/e9378d449a1c48458c7bad4d3a39f1cd [2019-01-14 04:57:57,482 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-14 04:57:57,484 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-01-14 04:57:57,485 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-14 04:57:57,485 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-14 04:57:57,488 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-14 04:57:57,489 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.01 04:57:57" (1/1) ... [2019-01-14 04:57:57,492 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@70ee0c5b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:57:57, skipping insertion in model container [2019-01-14 04:57:57,492 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.01 04:57:57" (1/1) ... [2019-01-14 04:57:57,500 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-14 04:57:57,546 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-14 04:57:57,922 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-14 04:57:57,941 INFO L191 MainTranslator]: Completed pre-run [2019-01-14 04:57:58,117 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-14 04:57:58,177 INFO L195 MainTranslator]: Completed translation [2019-01-14 04:57:58,178 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:57:58 WrapperNode [2019-01-14 04:57:58,178 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-14 04:57:58,179 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-14 04:57:58,179 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-14 04:57:58,180 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-14 04:57:58,189 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:57:58" (1/1) ... [2019-01-14 04:57:58,209 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:57:58" (1/1) ... [2019-01-14 04:57:58,237 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-14 04:57:58,237 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-14 04:57:58,238 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-14 04:57:58,238 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-14 04:57:58,248 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:57:58" (1/1) ... [2019-01-14 04:57:58,248 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:57:58" (1/1) ... [2019-01-14 04:57:58,252 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:57:58" (1/1) ... [2019-01-14 04:57:58,253 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:57:58" (1/1) ... [2019-01-14 04:57:58,260 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:57:58" (1/1) ... [2019-01-14 04:57:58,268 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:57:58" (1/1) ... [2019-01-14 04:57:58,270 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:57:58" (1/1) ... [2019-01-14 04:57:58,272 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-14 04:57:58,272 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-14 04:57:58,273 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-14 04:57:58,273 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-14 04:57:58,275 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:57:58" (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 04:57:58,341 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-01-14 04:57:58,341 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-01-14 04:57:58,341 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-01-14 04:57:58,341 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-01-14 04:57:58,341 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-14 04:57:58,342 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-14 04:57:58,706 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-14 04:57:58,707 INFO L286 CfgBuilder]: Removed 7 assue(true) statements. [2019-01-14 04:57:58,708 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 04:57:58 BoogieIcfgContainer [2019-01-14 04:57:58,708 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-14 04:57:58,709 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-01-14 04:57:58,709 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-01-14 04:57:58,714 INFO L276 PluginConnector]: BuchiAutomizer initialized [2019-01-14 04:57:58,715 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-14 04:57:58,716 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 14.01 04:57:57" (1/3) ... [2019-01-14 04:57:58,717 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@7feeffe2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 14.01 04:57:58, skipping insertion in model container [2019-01-14 04:57:58,717 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-14 04:57:58,717 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:57:58" (2/3) ... [2019-01-14 04:57:58,717 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@7feeffe2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 14.01 04:57:58, skipping insertion in model container [2019-01-14 04:57:58,717 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-14 04:57:58,718 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 04:57:58" (3/3) ... [2019-01-14 04:57:58,720 INFO L375 chiAutomizerObserver]: Analyzing ICFG openbsd_cstpcpy-alloca_true-valid-memsafety_true-termination.i [2019-01-14 04:57:58,775 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-14 04:57:58,776 INFO L374 BuchiCegarLoop]: Interprodecural is true [2019-01-14 04:57:58,776 INFO L375 BuchiCegarLoop]: Hoare is false [2019-01-14 04:57:58,776 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-01-14 04:57:58,776 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-14 04:57:58,776 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-14 04:57:58,776 INFO L379 BuchiCegarLoop]: Difference is false [2019-01-14 04:57:58,777 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-14 04:57:58,777 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-01-14 04:57:58,789 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 13 states. [2019-01-14 04:57:58,811 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-01-14 04:57:58,811 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 04:57:58,811 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 04:57:58,816 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2019-01-14 04:57:58,817 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-01-14 04:57:58,817 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2019-01-14 04:57:58,817 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 13 states. [2019-01-14 04:57:58,818 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-01-14 04:57:58,819 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 04:57:58,819 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 04:57:58,819 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2019-01-14 04:57:58,819 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-01-14 04:57:58,826 INFO L794 eck$LassoCheckResult]: Stem: 8#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 7#L-1true havoc main_#res;havoc main_#t~nondet5, main_#t~nondet6, main_#t~malloc7.base, main_#t~malloc7.offset, main_#t~malloc8.base, main_#t~malloc8.offset, main_#t~ret9.base, main_#t~ret9.offset, main_~length1~0, main_~length2~0, main_~nondetArea~0.base, main_~nondetArea~0.offset, main_~nondetString~0.base, main_~nondetString~0.offset;main_~length1~0 := main_#t~nondet5;havoc main_#t~nondet5;main_~length2~0 := main_#t~nondet6;havoc main_#t~nondet6; 3#L548true assume !(main_~length1~0 < 1); 5#L548-2true assume !(main_~length2~0 < 1); 11#L551-1true assume !(main_~length1~0 < main_~length2~0);call main_#t~malloc7.base, main_#t~malloc7.offset := #Ultimate.allocOnStack(main_~length1~0);main_~nondetArea~0.base, main_~nondetArea~0.offset := main_#t~malloc7.base, main_#t~malloc7.offset;call main_#t~malloc8.base, main_#t~malloc8.offset := #Ultimate.allocOnStack(main_~length2~0);main_~nondetString~0.base, main_~nondetString~0.offset := main_#t~malloc8.base, main_#t~malloc8.offset;call write~int(0, main_~nondetString~0.base, main_~nondetString~0.offset + (main_~length2~0 - 1), 1);cstpcpy_#in~to.base, cstpcpy_#in~to.offset, cstpcpy_#in~from.base, cstpcpy_#in~from.offset := main_~nondetArea~0.base, main_~nondetArea~0.offset, main_~nondetString~0.base, main_~nondetString~0.offset;havoc cstpcpy_#res.base, cstpcpy_#res.offset;havoc cstpcpy_#t~pre2.base, cstpcpy_#t~pre2.offset, cstpcpy_#t~pre3.base, cstpcpy_#t~pre3.offset, cstpcpy_#t~mem4, cstpcpy_~to.base, cstpcpy_~to.offset, cstpcpy_~from.base, cstpcpy_~from.offset;cstpcpy_~to.base, cstpcpy_~to.offset := cstpcpy_#in~to.base, cstpcpy_#in~to.offset;cstpcpy_~from.base, cstpcpy_~from.offset := cstpcpy_#in~from.base, cstpcpy_#in~from.offset; 14#L542-4true [2019-01-14 04:57:58,827 INFO L796 eck$LassoCheckResult]: Loop: 14#L542-4true call cstpcpy_#t~mem4 := read~int(cstpcpy_~from.base, cstpcpy_~from.offset, 1);call write~int(cstpcpy_#t~mem4, cstpcpy_~to.base, cstpcpy_~to.offset, 1); 9#L542-1true assume !!(0 != cstpcpy_#t~mem4);havoc cstpcpy_#t~mem4; 12#L542-3true cstpcpy_#t~pre2.base, cstpcpy_#t~pre2.offset := cstpcpy_~from.base, 1 + cstpcpy_~from.offset;cstpcpy_~from.base, cstpcpy_~from.offset := cstpcpy_~from.base, 1 + cstpcpy_~from.offset;havoc cstpcpy_#t~pre2.base, cstpcpy_#t~pre2.offset;cstpcpy_#t~pre3.base, cstpcpy_#t~pre3.offset := cstpcpy_~to.base, 1 + cstpcpy_~to.offset;cstpcpy_~to.base, cstpcpy_~to.offset := cstpcpy_~to.base, 1 + cstpcpy_~to.offset;havoc cstpcpy_#t~pre3.base, cstpcpy_#t~pre3.offset; 14#L542-4true [2019-01-14 04:57:58,833 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:57:58,833 INFO L82 PathProgramCache]: Analyzing trace with hash 28695882, now seen corresponding path program 1 times [2019-01-14 04:57:58,836 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:57:58,836 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:57:58,892 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:57:58,892 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 04:57:58,892 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:57:58,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:57:58,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:57:59,005 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:57:59,005 INFO L82 PathProgramCache]: Analyzing trace with hash 52792, now seen corresponding path program 1 times [2019-01-14 04:57:59,006 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:57:59,006 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:57:59,007 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:57:59,007 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 04:57:59,007 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:57:59,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:57:59,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:57:59,035 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:57:59,035 INFO L82 PathProgramCache]: Analyzing trace with hash 180551759, now seen corresponding path program 1 times [2019-01-14 04:57:59,035 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:57:59,035 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:57:59,037 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:57:59,043 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 04:57:59,043 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:57:59,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:57:59,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:57:59,265 WARN L181 SmtUtils]: Spent 133.00 ms on a formula simplification that was a NOOP. DAG size: 41 [2019-01-14 04:57:59,418 WARN L181 SmtUtils]: Spent 143.00 ms on a formula simplification that was a NOOP. DAG size: 39 [2019-01-14 04:58:00,046 WARN L181 SmtUtils]: Spent 624.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 79 [2019-01-14 04:58:00,450 WARN L181 SmtUtils]: Spent 400.00 ms on a formula simplification that was a NOOP. DAG size: 73 [2019-01-14 04:58:00,463 INFO L216 LassoAnalysis]: Preferences: [2019-01-14 04:58:00,464 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-14 04:58:00,465 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-14 04:58:00,465 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-14 04:58:00,465 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-14 04:58:00,465 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 04:58:00,465 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-14 04:58:00,466 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-14 04:58:00,466 INFO L131 ssoRankerPreferences]: Filename of dumped script: openbsd_cstpcpy-alloca_true-valid-memsafety_true-termination.i_Iteration1_Lasso [2019-01-14 04:58:00,467 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-14 04:58:00,467 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-14 04:58:00,496 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 04:58:00,505 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 04:58:00,509 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 04:58:00,512 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 04:58:00,515 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 04:58:00,518 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 04:58:00,530 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 04:58:00,533 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 04:58:01,015 WARN L181 SmtUtils]: Spent 378.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 65 [2019-01-14 04:58:01,192 WARN L181 SmtUtils]: Spent 160.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 55 [2019-01-14 04:58:01,193 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 04:58:01,197 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 04:58:01,199 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 04:58:01,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 04:58:01,205 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 04:58:01,207 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 04:58:01,211 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 04:58:01,767 WARN L181 SmtUtils]: Spent 162.00 ms on a formula simplification that was a NOOP. DAG size: 41 [2019-01-14 04:58:02,193 WARN L181 SmtUtils]: Spent 371.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 37 [2019-01-14 04:58:02,306 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-14 04:58:02,311 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-14 04:58:02,314 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 04:58:02,317 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:58:02,317 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:58:02,318 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:58:02,318 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:58:02,318 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:58:02,321 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:58:02,321 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:58:02,325 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:58:02,326 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 04:58:02,327 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:58:02,327 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:58:02,327 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:58:02,342 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:58:02,342 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:58:02,343 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:58:02,343 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:58:02,344 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:58:02,345 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 04:58:02,345 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:58:02,346 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:58:02,346 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:58:02,346 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:58:02,346 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:58:02,348 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:58:02,348 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:58:02,349 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:58:02,349 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 04:58:02,350 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:58:02,350 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:58:02,350 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:58:02,350 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:58:02,350 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:58:02,351 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:58:02,351 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:58:02,352 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:58:02,353 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 04:58:02,353 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:58:02,353 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:58:02,353 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:58:02,354 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:58:02,354 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:58:02,354 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:58:02,354 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:58:02,355 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:58:02,356 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 04:58:02,356 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:58:02,356 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:58:02,357 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:58:02,357 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:58:02,359 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 04:58:02,360 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 04:58:02,363 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:58:02,364 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 04:58:02,365 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:58:02,365 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:58:02,365 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:58:02,365 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:58:02,365 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:58:02,366 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:58:02,366 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:58:02,367 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:58:02,368 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 04:58:02,368 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:58:02,368 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:58:02,369 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:58:02,369 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:58:02,380 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 04:58:02,382 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 04:58:02,455 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-14 04:58:02,547 INFO L443 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. [2019-01-14 04:58:02,549 INFO L444 ModelExtractionUtils]: 38 out of 43 variables were initially zero. Simplification set additionally 2 variables to zero. [2019-01-14 04:58:02,552 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-14 04:58:02,554 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-01-14 04:58:02,560 INFO L518 LassoAnalysis]: Proved termination. [2019-01-14 04:58:02,560 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_main_#t~malloc8.base)_1, ULTIMATE.start_cstpcpy_~to.offset) = 1*v_rep(select #length ULTIMATE.start_main_#t~malloc8.base)_1 - 1*ULTIMATE.start_cstpcpy_~to.offset Supporting invariants [] [2019-01-14 04:58:02,645 INFO L297 tatePredicateManager]: 11 out of 13 supporting invariants were superfluous and have been removed [2019-01-14 04:58:02,658 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2019-01-14 04:58:02,768 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:58:02,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:58:02,803 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 04:58:02,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:58:02,823 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 04:58:02,865 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 04:58:02,883 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2019-01-14 04:58:02,885 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 13 states. Second operand 3 states. [2019-01-14 04:58:02,973 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 13 states.. Second operand 3 states. Result 26 states and 30 transitions. Complement of second has 6 states. [2019-01-14 04:58:02,974 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2019-01-14 04:58:02,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-01-14 04:58:02,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 20 transitions. [2019-01-14 04:58:02,978 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 20 transitions. Stem has 5 letters. Loop has 3 letters. [2019-01-14 04:58:02,979 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 04:58:02,979 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 20 transitions. Stem has 8 letters. Loop has 3 letters. [2019-01-14 04:58:02,979 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 04:58:02,979 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 20 transitions. Stem has 5 letters. Loop has 6 letters. [2019-01-14 04:58:02,979 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 04:58:02,980 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 26 states and 30 transitions. [2019-01-14 04:58:02,983 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-01-14 04:58:02,986 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 26 states to 0 states and 0 transitions. [2019-01-14 04:58:02,987 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2019-01-14 04:58:02,987 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2019-01-14 04:58:02,987 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2019-01-14 04:58:02,987 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-14 04:58:02,987 INFO L706 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-14 04:58:02,988 INFO L729 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-14 04:58:02,988 INFO L609 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-14 04:58:02,988 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2019-01-14 04:58:02,988 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2019-01-14 04:58:02,988 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-01-14 04:58:02,988 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2019-01-14 04:58:02,994 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 14.01 04:58:02 BoogieIcfgContainer [2019-01-14 04:58:02,995 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2019-01-14 04:58:02,995 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-14 04:58:02,995 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-14 04:58:02,995 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-14 04:58:02,996 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 04:57:58" (3/4) ... [2019-01-14 04:58:02,999 INFO L147 WitnessPrinter]: No result that supports witness generation found [2019-01-14 04:58:02,999 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-14 04:58:03,000 INFO L168 Benchmark]: Toolchain (without parser) took 5516.95 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 208.1 MB). Free memory was 944.6 MB in the beginning and 1.2 GB in the end (delta: -207.7 MB). Peak memory consumption was 442.0 kB. Max. memory is 11.5 GB. [2019-01-14 04:58:03,001 INFO L168 Benchmark]: CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 972.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-14 04:58:03,002 INFO L168 Benchmark]: CACSL2BoogieTranslator took 693.20 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 131.6 MB). Free memory was 944.6 MB in the beginning and 1.1 GB in the end (delta: -160.3 MB). Peak memory consumption was 30.2 MB. Max. memory is 11.5 GB. [2019-01-14 04:58:03,003 INFO L168 Benchmark]: Boogie Procedure Inliner took 58.01 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 04:58:03,003 INFO L168 Benchmark]: Boogie Preprocessor took 34.58 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 04:58:03,004 INFO L168 Benchmark]: RCFGBuilder took 435.80 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 18.7 MB). Peak memory consumption was 18.7 MB. Max. memory is 11.5 GB. [2019-01-14 04:58:03,005 INFO L168 Benchmark]: BuchiAutomizer took 4285.87 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 76.5 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -66.1 MB). Peak memory consumption was 10.4 MB. Max. memory is 11.5 GB. [2019-01-14 04:58:03,006 INFO L168 Benchmark]: Witness Printer took 4.49 ms. Allocated memory is still 1.2 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-14 04:58:03,010 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 972.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 693.20 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 131.6 MB). Free memory was 944.6 MB in the beginning and 1.1 GB in the end (delta: -160.3 MB). Peak memory consumption was 30.2 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 58.01 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 34.58 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 435.80 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 18.7 MB). Peak memory consumption was 18.7 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 4285.87 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 76.5 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -66.1 MB). Peak memory consumption was 10.4 MB. Max. memory is 11.5 GB. * Witness Printer took 4.49 ms. Allocated memory is still 1.2 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #length * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 1 terminating modules (0 trivial, 1 deterministic, 0 nondeterministic). One deterministic module has affine ranking function unknown-#length-unknown[__builtin_alloca (length2 * sizeof(char))] + -1 * to and consists of 4 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 4.2s and 2 iterations. TraceHistogramMax:1. Analysis of lassos took 3.8s. Construction of modules took 0.0s. Büchi inclusion checks took 0.2s. Highest rank in rank-based complementation 3. Minimization of det autom 1. Minimization of nondet autom 0. Automata minimization No data available. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 0 states and ocurred in iteration 1. Nontrivial modules had stage [1, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 12 SDtfs, 16 SDslu, 2 SDs, 0 SdLazy, 8 SolverSat, 4 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc0 concLT0 SILN0 SILU0 SILI0 SILT0 lasso1 LassoPreprocessingBenchmarks: Lassos: inital196 mio100 ax100 hnf99 lsp96 ukn91 mio100 lsp45 div100 bol100 ite100 ukn100 eq193 hnf88 smp100 dnf174 smp97 tf100 neg96 sie112 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 8ms VariablesStem: 1 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! Received shutdown request...