./Ultimate.py --spec /storage/repos/svcomp/c/properties/termination.prp --file /storage/repos/svcomp/c/array-memsafety/cstrcpy-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/cstrcpy-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 109b8bf9931c925f911ad0fbf9e2b946a30b466d ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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:06,496 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-14 04:57:06,504 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-14 04:57:06,518 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-14 04:57:06,519 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-14 04:57:06,520 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-14 04:57:06,521 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-14 04:57:06,523 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-14 04:57:06,525 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-14 04:57:06,526 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-14 04:57:06,528 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-14 04:57:06,529 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-14 04:57:06,532 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-14 04:57:06,533 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-14 04:57:06,536 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-14 04:57:06,537 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-14 04:57:06,538 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-14 04:57:06,547 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-14 04:57:06,553 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-14 04:57:06,555 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-14 04:57:06,556 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-14 04:57:06,557 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-14 04:57:06,559 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-14 04:57:06,559 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-14 04:57:06,560 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-14 04:57:06,560 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-14 04:57:06,561 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-14 04:57:06,562 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-14 04:57:06,563 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-14 04:57:06,564 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-14 04:57:06,564 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-14 04:57:06,565 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-14 04:57:06,565 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-14 04:57:06,565 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-14 04:57:06,566 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-14 04:57:06,567 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-14 04:57:06,567 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:06,593 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-14 04:57:06,594 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-14 04:57:06,595 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-14 04:57:06,595 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-14 04:57:06,595 INFO L133 SettingsManager]: * Use SBE=true [2019-01-14 04:57:06,596 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-01-14 04:57:06,597 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-01-14 04:57:06,597 INFO L133 SettingsManager]: * Use old map elimination=false [2019-01-14 04:57:06,598 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2019-01-14 04:57:06,598 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2019-01-14 04:57:06,598 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-01-14 04:57:06,598 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-14 04:57:06,598 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-14 04:57:06,599 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-01-14 04:57:06,600 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-14 04:57:06,600 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-14 04:57:06,601 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-14 04:57:06,601 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-01-14 04:57:06,601 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-01-14 04:57:06,601 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-01-14 04:57:06,601 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-14 04:57:06,601 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-14 04:57:06,602 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-01-14 04:57:06,605 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-14 04:57:06,605 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-01-14 04:57:06,605 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-14 04:57:06,606 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-14 04:57:06,606 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-01-14 04:57:06,606 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-14 04:57:06,606 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-14 04:57:06,606 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-01-14 04:57:06,609 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-01-14 04:57:06,609 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 -> 109b8bf9931c925f911ad0fbf9e2b946a30b466d [2019-01-14 04:57:06,668 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-14 04:57:06,685 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-14 04:57:06,690 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-14 04:57:06,693 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-14 04:57:06,693 INFO L276 PluginConnector]: CDTParser initialized [2019-01-14 04:57:06,694 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/array-memsafety/cstrcpy-alloca_true-valid-memsafety_true-termination.i [2019-01-14 04:57:06,771 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/483340a0e/75d900a9fe554569859fb9f5784fcb4d/FLAG5338c3cd6 [2019-01-14 04:57:07,236 INFO L307 CDTParser]: Found 1 translation units. [2019-01-14 04:57:07,240 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/array-memsafety/cstrcpy-alloca_true-valid-memsafety_true-termination.i [2019-01-14 04:57:07,261 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/483340a0e/75d900a9fe554569859fb9f5784fcb4d/FLAG5338c3cd6 [2019-01-14 04:57:07,563 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/483340a0e/75d900a9fe554569859fb9f5784fcb4d [2019-01-14 04:57:07,568 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-14 04:57:07,570 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-01-14 04:57:07,575 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-14 04:57:07,577 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-14 04:57:07,583 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-14 04:57:07,584 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.01 04:57:07" (1/1) ... [2019-01-14 04:57:07,588 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@58b887ba and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:57:07, skipping insertion in model container [2019-01-14 04:57:07,588 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.01 04:57:07" (1/1) ... [2019-01-14 04:57:07,595 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-14 04:57:07,651 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-14 04:57:07,978 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-14 04:57:07,990 INFO L191 MainTranslator]: Completed pre-run [2019-01-14 04:57:08,036 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-14 04:57:08,101 INFO L195 MainTranslator]: Completed translation [2019-01-14 04:57:08,102 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:57:08 WrapperNode [2019-01-14 04:57:08,102 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-14 04:57:08,103 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-14 04:57:08,103 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-14 04:57:08,104 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-14 04:57:08,184 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:08" (1/1) ... [2019-01-14 04:57:08,200 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:08" (1/1) ... [2019-01-14 04:57:08,221 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-14 04:57:08,222 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-14 04:57:08,222 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-14 04:57:08,222 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-14 04:57:08,230 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:08" (1/1) ... [2019-01-14 04:57:08,230 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:08" (1/1) ... [2019-01-14 04:57:08,233 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:08" (1/1) ... [2019-01-14 04:57:08,234 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:08" (1/1) ... [2019-01-14 04:57:08,241 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:08" (1/1) ... [2019-01-14 04:57:08,247 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:08" (1/1) ... [2019-01-14 04:57:08,249 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:08" (1/1) ... [2019-01-14 04:57:08,251 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-14 04:57:08,252 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-14 04:57:08,252 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-14 04:57:08,252 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-14 04:57:08,253 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:57:08" (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:08,315 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-01-14 04:57:08,316 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-01-14 04:57:08,316 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-01-14 04:57:08,316 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-01-14 04:57:08,316 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-14 04:57:08,316 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-14 04:57:08,690 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-14 04:57:08,691 INFO L286 CfgBuilder]: Removed 7 assue(true) statements. [2019-01-14 04:57:08,692 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 04:57:08 BoogieIcfgContainer [2019-01-14 04:57:08,692 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-14 04:57:08,693 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-01-14 04:57:08,693 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-01-14 04:57:08,697 INFO L276 PluginConnector]: BuchiAutomizer initialized [2019-01-14 04:57:08,698 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-14 04:57:08,699 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 14.01 04:57:07" (1/3) ... [2019-01-14 04:57:08,700 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@7ba3909a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 14.01 04:57:08, skipping insertion in model container [2019-01-14 04:57:08,700 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-14 04:57:08,700 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:57:08" (2/3) ... [2019-01-14 04:57:08,701 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@7ba3909a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 14.01 04:57:08, skipping insertion in model container [2019-01-14 04:57:08,701 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-14 04:57:08,701 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 04:57:08" (3/3) ... [2019-01-14 04:57:08,703 INFO L375 chiAutomizerObserver]: Analyzing ICFG cstrcpy-alloca_true-valid-memsafety_true-termination.i [2019-01-14 04:57:08,758 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-14 04:57:08,759 INFO L374 BuchiCegarLoop]: Interprodecural is true [2019-01-14 04:57:08,759 INFO L375 BuchiCegarLoop]: Hoare is false [2019-01-14 04:57:08,759 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-01-14 04:57:08,760 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-14 04:57:08,760 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-14 04:57:08,760 INFO L379 BuchiCegarLoop]: Difference is false [2019-01-14 04:57:08,760 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-14 04:57:08,760 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-01-14 04:57:08,774 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 12 states. [2019-01-14 04:57:08,796 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-01-14 04:57:08,796 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 04:57:08,796 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 04:57:08,802 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2019-01-14 04:57:08,802 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-01-14 04:57:08,803 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2019-01-14 04:57:08,803 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 12 states. [2019-01-14 04:57:08,805 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-01-14 04:57:08,805 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 04:57:08,805 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 04:57:08,806 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2019-01-14 04:57:08,806 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-01-14 04:57:08,816 INFO L794 eck$LassoCheckResult]: Stem: 5#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 3#L-1true havoc main_#res;havoc main_#t~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; 9#L551true assume !(main_~length1~0 < 1); 13#L551-2true assume !(main_~length2~0 < 1); 4#L554-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);cstrcpy_#in~s1.base, cstrcpy_#in~s1.offset, cstrcpy_#in~s2.base, cstrcpy_#in~s2.offset := main_~nondetArea~0.base, main_~nondetArea~0.offset, main_~nondetString~0.base, main_~nondetString~0.offset;havoc cstrcpy_#res.base, cstrcpy_#res.offset;havoc cstrcpy_#t~post2.base, cstrcpy_#t~post2.offset, cstrcpy_#t~post3.base, cstrcpy_#t~post3.offset, cstrcpy_#t~mem4, cstrcpy_~s1.base, cstrcpy_~s1.offset, cstrcpy_~s2.base, cstrcpy_~s2.offset, cstrcpy_~dst~0.base, cstrcpy_~dst~0.offset, cstrcpy_~src~0.base, cstrcpy_~src~0.offset;cstrcpy_~s1.base, cstrcpy_~s1.offset := cstrcpy_#in~s1.base, cstrcpy_#in~s1.offset;cstrcpy_~s2.base, cstrcpy_~s2.offset := cstrcpy_#in~s2.base, cstrcpy_#in~s2.offset;cstrcpy_~dst~0.base, cstrcpy_~dst~0.offset := cstrcpy_~s1.base, cstrcpy_~s1.offset;cstrcpy_~src~0.base, cstrcpy_~src~0.offset := cstrcpy_~s2.base, cstrcpy_~s2.offset; 6#L544-3true [2019-01-14 04:57:08,816 INFO L796 eck$LassoCheckResult]: Loop: 6#L544-3true cstrcpy_#t~post2.base, cstrcpy_#t~post2.offset := cstrcpy_~dst~0.base, cstrcpy_~dst~0.offset;cstrcpy_~dst~0.base, cstrcpy_~dst~0.offset := cstrcpy_#t~post2.base, 1 + cstrcpy_#t~post2.offset;cstrcpy_#t~post3.base, cstrcpy_#t~post3.offset := cstrcpy_~src~0.base, cstrcpy_~src~0.offset;cstrcpy_~src~0.base, cstrcpy_~src~0.offset := cstrcpy_#t~post3.base, 1 + cstrcpy_#t~post3.offset;call cstrcpy_#t~mem4 := read~int(cstrcpy_#t~post3.base, cstrcpy_#t~post3.offset, 1);call write~int(cstrcpy_#t~mem4, cstrcpy_#t~post2.base, cstrcpy_#t~post2.offset, 1); 14#L544-1true assume !!(0 != cstrcpy_#t~mem4);havoc cstrcpy_#t~post3.base, cstrcpy_#t~post3.offset;havoc cstrcpy_#t~post2.base, cstrcpy_#t~post2.offset;havoc cstrcpy_#t~mem4; 6#L544-3true [2019-01-14 04:57:08,822 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:57:08,822 INFO L82 PathProgramCache]: Analyzing trace with hash 28695882, now seen corresponding path program 1 times [2019-01-14 04:57:08,824 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:57:08,825 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:57:08,875 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:57:08,876 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 04:57:08,876 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:57:08,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:57:08,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:57:08,998 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:57:08,998 INFO L82 PathProgramCache]: Analyzing trace with hash 1734, now seen corresponding path program 1 times [2019-01-14 04:57:08,999 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:57:08,999 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:57:09,000 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:57:09,000 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 04:57:09,000 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:57:09,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:57:09,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:57:09,022 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:57:09,022 INFO L82 PathProgramCache]: Analyzing trace with hash 1806939599, now seen corresponding path program 1 times [2019-01-14 04:57:09,022 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:57:09,022 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:57:09,024 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:57:09,024 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 04:57:09,024 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:57:09,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:57:09,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:57:09,523 WARN L181 SmtUtils]: Spent 372.00 ms on a formula simplification that was a NOOP. DAG size: 49 [2019-01-14 04:57:09,750 WARN L181 SmtUtils]: Spent 214.00 ms on a formula simplification that was a NOOP. DAG size: 39 [2019-01-14 04:57:10,635 WARN L181 SmtUtils]: Spent 880.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 87 [2019-01-14 04:57:10,826 WARN L181 SmtUtils]: Spent 184.00 ms on a formula simplification that was a NOOP. DAG size: 81 [2019-01-14 04:57:10,855 INFO L216 LassoAnalysis]: Preferences: [2019-01-14 04:57:10,856 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-14 04:57:10,856 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-14 04:57:10,856 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-14 04:57:10,857 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-14 04:57:10,857 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 04:57:10,858 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-14 04:57:10,858 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-14 04:57:10,858 INFO L131 ssoRankerPreferences]: Filename of dumped script: cstrcpy-alloca_true-valid-memsafety_true-termination.i_Iteration1_Lasso [2019-01-14 04:57:10,858 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-14 04:57:10,858 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-14 04:57:10,891 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:57:10,899 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:57:10,903 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:57:10,909 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:57:10,913 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:57:11,457 WARN L181 SmtUtils]: Spent 399.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 73 [2019-01-14 04:57:11,652 WARN L181 SmtUtils]: Spent 156.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 55 [2019-01-14 04:57:11,653 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:57:11,657 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:57:11,659 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:57:11,666 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:57:11,670 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:57:11,671 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:57:11,673 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:57:11,676 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:57:11,684 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:57:11,688 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:57:12,127 WARN L181 SmtUtils]: Spent 142.00 ms on a formula simplification that was a NOOP. DAG size: 47 [2019-01-14 04:57:12,874 WARN L181 SmtUtils]: Spent 645.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 43 [2019-01-14 04:57:13,102 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-14 04:57:13,108 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-14 04:57:13,111 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:57:13,112 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:57:13,112 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:57:13,113 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:57:13,113 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:57:13,113 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:57:13,115 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:57:13,115 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:57:13,117 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:57:13,118 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:57:13,118 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:57:13,118 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:57:13,119 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:57:13,119 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:57:13,119 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:57:13,119 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:57:13,120 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:57:13,121 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:57:13,121 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:57:13,122 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:57:13,122 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:57:13,122 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:57:13,122 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:57:13,122 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:57:13,123 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:57:13,123 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:57:13,124 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:57:13,124 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:57:13,125 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:57:13,125 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:57:13,125 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:57:13,125 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:57:13,125 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:57:13,126 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:57:13,126 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:57:13,127 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:57:13,127 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:57:13,128 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:57:13,128 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:57:13,128 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:57:13,128 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:57:13,132 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 04:57:13,132 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 04:57:13,139 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:57:13,140 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:57:13,141 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:57:13,141 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:57:13,141 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:57:13,141 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:57:13,143 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 04:57:13,144 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 04:57:13,147 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:57:13,148 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:57:13,149 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:57:13,149 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:57:13,149 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:57:13,149 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2019-01-14 04:57:13,149 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:57:13,150 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-01-14 04:57:13,150 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:57:13,154 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:57:13,155 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:57:13,156 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:57:13,156 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:57:13,156 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:57:13,156 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:57:13,158 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 04:57:13,158 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 04:57:13,162 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:57:13,163 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:57:13,163 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:57:13,164 INFO L205 nArgumentSynthesizer]: 4 stem disjuncts [2019-01-14 04:57:13,164 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:57:13,164 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:57:13,180 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2019-01-14 04:57:13,180 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 04:57:13,286 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:57:13,290 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:57:13,291 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:57:13,291 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:57:13,291 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:57:13,291 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:57:13,298 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 04:57:13,300 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 04:57:13,324 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:57:13,325 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:57:13,327 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:57:13,328 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:57:13,328 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:57:13,328 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:57:13,331 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 04:57:13,331 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 04:57:13,356 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:57:13,357 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:57:13,358 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:57:13,360 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:57:13,360 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:57:13,360 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:57:13,373 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 04:57:13,379 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 04:57:13,456 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-14 04:57:13,512 INFO L443 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. [2019-01-14 04:57:13,513 INFO L444 ModelExtractionUtils]: 41 out of 49 variables were initially zero. Simplification set additionally 5 variables to zero. [2019-01-14 04:57:13,516 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-14 04:57:13,518 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-01-14 04:57:13,519 INFO L518 LassoAnalysis]: Proved termination. [2019-01-14 04:57:13,519 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_cstrcpy_~src~0.offset, v_rep(select #length ULTIMATE.start_main_#t~malloc8.base)_1) = -1*ULTIMATE.start_cstrcpy_~src~0.offset + 1*v_rep(select #length ULTIMATE.start_main_#t~malloc8.base)_1 Supporting invariants [] [2019-01-14 04:57:13,738 INFO L297 tatePredicateManager]: 12 out of 13 supporting invariants were superfluous and have been removed [2019-01-14 04:57:13,749 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2019-01-14 04:57:13,779 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:57:13,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:57:13,823 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 04:57:13,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:57:13,843 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 04:57:13,924 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:57:13,938 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:57:13,940 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 12 states. Second operand 3 states. [2019-01-14 04:57:14,033 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 12 states.. Second operand 3 states. Result 24 states and 27 transitions. Complement of second has 6 states. [2019-01-14 04:57:14,033 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:57:14,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-01-14 04:57:14,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 21 transitions. [2019-01-14 04:57:14,038 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 21 transitions. Stem has 5 letters. Loop has 2 letters. [2019-01-14 04:57:14,040 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 04:57:14,040 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 21 transitions. Stem has 7 letters. Loop has 2 letters. [2019-01-14 04:57:14,040 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 04:57:14,040 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 21 transitions. Stem has 5 letters. Loop has 4 letters. [2019-01-14 04:57:14,041 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 04:57:14,042 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 24 states and 27 transitions. [2019-01-14 04:57:14,045 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-01-14 04:57:14,048 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 24 states to 0 states and 0 transitions. [2019-01-14 04:57:14,049 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2019-01-14 04:57:14,049 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2019-01-14 04:57:14,050 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2019-01-14 04:57:14,050 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-14 04:57:14,050 INFO L706 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-14 04:57:14,050 INFO L729 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-14 04:57:14,050 INFO L609 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-14 04:57:14,051 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2019-01-14 04:57:14,051 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2019-01-14 04:57:14,051 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-01-14 04:57:14,051 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2019-01-14 04:57:14,058 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 14.01 04:57:14 BoogieIcfgContainer [2019-01-14 04:57:14,058 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2019-01-14 04:57:14,059 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-14 04:57:14,059 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-14 04:57:14,059 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-14 04:57:14,060 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:08" (3/4) ... [2019-01-14 04:57:14,064 INFO L147 WitnessPrinter]: No result that supports witness generation found [2019-01-14 04:57:14,064 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-14 04:57:14,065 INFO L168 Benchmark]: Toolchain (without parser) took 6496.53 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 196.6 MB). Free memory was 951.3 MB in the beginning and 1.1 GB in the end (delta: -113.2 MB). Peak memory consumption was 83.4 MB. Max. memory is 11.5 GB. [2019-01-14 04:57:14,066 INFO L168 Benchmark]: CDTParser took 0.17 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 04:57:14,066 INFO L168 Benchmark]: CACSL2BoogieTranslator took 527.43 ms. Allocated memory is still 1.0 GB. Free memory was 951.3 MB in the beginning and 929.9 MB in the end (delta: 21.5 MB). Peak memory consumption was 21.5 MB. Max. memory is 11.5 GB. [2019-01-14 04:57:14,067 INFO L168 Benchmark]: Boogie Procedure Inliner took 118.45 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 128.5 MB). Free memory was 929.9 MB in the beginning and 1.1 GB in the end (delta: -185.1 MB). Peak memory consumption was 14.0 MB. Max. memory is 11.5 GB. [2019-01-14 04:57:14,068 INFO L168 Benchmark]: Boogie Preprocessor took 29.33 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:57:14,069 INFO L168 Benchmark]: RCFGBuilder took 440.83 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.8 MB). Peak memory consumption was 18.8 MB. Max. memory is 11.5 GB. [2019-01-14 04:57:14,070 INFO L168 Benchmark]: BuchiAutomizer took 5365.02 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 68.2 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 31.6 MB). Peak memory consumption was 99.8 MB. Max. memory is 11.5 GB. [2019-01-14 04:57:14,071 INFO L168 Benchmark]: Witness Printer took 5.33 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:57:14,076 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.17 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 527.43 ms. Allocated memory is still 1.0 GB. Free memory was 951.3 MB in the beginning and 929.9 MB in the end (delta: 21.5 MB). Peak memory consumption was 21.5 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 118.45 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 128.5 MB). Free memory was 929.9 MB in the beginning and 1.1 GB in the end (delta: -185.1 MB). Peak memory consumption was 14.0 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 29.33 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 440.83 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.8 MB). Peak memory consumption was 18.8 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 5365.02 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 68.2 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 31.6 MB). Peak memory consumption was 99.8 MB. Max. memory is 11.5 GB. * Witness Printer took 5.33 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #length * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 1 terminating modules (0 trivial, 1 deterministic, 0 nondeterministic). One deterministic module has affine ranking function -1 * src + unknown-#length-unknown[__builtin_alloca (length2 * sizeof(char))] and consists of 4 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 5.3s and 2 iterations. TraceHistogramMax:1. Analysis of lassos took 4.9s. 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: 13 SDtfs, 12 SDslu, 3 SDs, 0 SdLazy, 4 SolverSat, 3 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc0 concLT0 SILN0 SILU0 SILI0 SILT0 lasso1 LassoPreprocessingBenchmarks: Lassos: inital208 mio100 ax100 hnf99 lsp97 ukn92 mio100 lsp46 div100 bol100 ite100 ukn100 eq196 hnf88 smp100 dnf188 smp97 tf100 neg97 sie110 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 123ms VariablesStem: 11 VariablesLoop: 7 DisjunctsStem: 4 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 12 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...