./Ultimate.py --spec /storage/repos/svcomp/c/properties/termination.prp --file /storage/repos/svcomp/c/termination-memory-alloca/openbsd_cstrncpy-alloca_true-termination.c.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 2e94e6aa Calling Ultimate with: java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i /storage/repos/svcomp/c/termination-memory-alloca/openbsd_cstrncpy-alloca_true-termination.c.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash 51c86dc5019658537c4cb35ed62637baeb91c588 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-2e94e6a [2019-01-01 21:52:56,724 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-01 21:52:56,726 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-01 21:52:56,743 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-01 21:52:56,744 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-01 21:52:56,746 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-01 21:52:56,751 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-01 21:52:56,754 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-01 21:52:56,758 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-01 21:52:56,765 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-01 21:52:56,767 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-01 21:52:56,768 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-01 21:52:56,769 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-01 21:52:56,772 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-01 21:52:56,775 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-01 21:52:56,776 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-01 21:52:56,778 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-01 21:52:56,783 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-01 21:52:56,788 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-01 21:52:56,791 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-01 21:52:56,792 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-01 21:52:56,794 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-01 21:52:56,800 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-01 21:52:56,800 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-01 21:52:56,800 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-01 21:52:56,802 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-01 21:52:56,803 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-01 21:52:56,804 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-01 21:52:56,805 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-01 21:52:56,809 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-01 21:52:56,809 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-01 21:52:56,810 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-01 21:52:56,810 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-01 21:52:56,811 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-01 21:52:56,812 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-01 21:52:56,812 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-01 21:52:56,814 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf [2019-01-01 21:52:56,843 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-01 21:52:56,843 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-01 21:52:56,845 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-01 21:52:56,845 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-01 21:52:56,845 INFO L133 SettingsManager]: * Use SBE=true [2019-01-01 21:52:56,845 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-01-01 21:52:56,846 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-01-01 21:52:56,849 INFO L133 SettingsManager]: * Use old map elimination=false [2019-01-01 21:52:56,849 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2019-01-01 21:52:56,849 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2019-01-01 21:52:56,850 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-01-01 21:52:56,850 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-01 21:52:56,850 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-01-01 21:52:56,850 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-01 21:52:56,850 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-01 21:52:56,850 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-01-01 21:52:56,851 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-01-01 21:52:56,851 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-01-01 21:52:56,851 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-01 21:52:56,851 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-01-01 21:52:56,851 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-01 21:52:56,851 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-01-01 21:52:56,853 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-01 21:52:56,853 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-01 21:52:56,853 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-01-01 21:52:56,853 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-01 21:52:56,854 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-01 21:52:56,854 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-01-01 21:52:56,855 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-01-01 21:52:56,856 INFO L133 SettingsManager]: * TransformationType=MODULO_NEIGHBOR Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(F end) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 51c86dc5019658537c4cb35ed62637baeb91c588 [2019-01-01 21:52:56,912 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-01 21:52:56,928 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-01 21:52:56,932 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-01 21:52:56,934 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-01 21:52:56,934 INFO L276 PluginConnector]: CDTParser initialized [2019-01-01 21:52:56,935 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/termination-memory-alloca/openbsd_cstrncpy-alloca_true-termination.c.i [2019-01-01 21:52:56,999 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/97e701a71/42661f5a169640aea0ce1c5fec932e03/FLAG19256667a [2019-01-01 21:52:57,562 INFO L307 CDTParser]: Found 1 translation units. [2019-01-01 21:52:57,563 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/termination-memory-alloca/openbsd_cstrncpy-alloca_true-termination.c.i [2019-01-01 21:52:57,585 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/97e701a71/42661f5a169640aea0ce1c5fec932e03/FLAG19256667a [2019-01-01 21:52:57,844 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/97e701a71/42661f5a169640aea0ce1c5fec932e03 [2019-01-01 21:52:57,848 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-01 21:52:57,849 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-01-01 21:52:57,850 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-01 21:52:57,850 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-01 21:52:57,854 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-01 21:52:57,857 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.01 09:52:57" (1/1) ... [2019-01-01 21:52:57,861 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@880a007 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:52:57, skipping insertion in model container [2019-01-01 21:52:57,862 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.01 09:52:57" (1/1) ... [2019-01-01 21:52:57,871 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-01 21:52:57,915 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-01 21:52:58,373 INFO L204 PostProcessor]: Analyzing one entry point: main [2019-01-01 21:52:58,393 INFO L191 MainTranslator]: Completed pre-run [2019-01-01 21:52:58,558 INFO L204 PostProcessor]: Analyzing one entry point: main [2019-01-01 21:52:58,629 INFO L195 MainTranslator]: Completed translation [2019-01-01 21:52:58,630 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:52:58 WrapperNode [2019-01-01 21:52:58,630 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-01 21:52:58,631 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-01 21:52:58,631 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-01 21:52:58,631 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-01 21:52:58,642 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:52:58" (1/1) ... [2019-01-01 21:52:58,660 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:52:58" (1/1) ... [2019-01-01 21:52:58,691 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-01 21:52:58,691 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-01 21:52:58,691 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-01 21:52:58,691 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-01 21:52:58,703 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:52:58" (1/1) ... [2019-01-01 21:52:58,704 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:52:58" (1/1) ... [2019-01-01 21:52:58,707 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:52:58" (1/1) ... [2019-01-01 21:52:58,708 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:52:58" (1/1) ... [2019-01-01 21:52:58,717 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:52:58" (1/1) ... [2019-01-01 21:52:58,723 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:52:58" (1/1) ... [2019-01-01 21:52:58,724 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:52:58" (1/1) ... [2019-01-01 21:52:58,727 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-01 21:52:58,728 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-01 21:52:58,728 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-01 21:52:58,728 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-01 21:52:58,730 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:52: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-01 21:52:58,805 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-01-01 21:52:58,806 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-01-01 21:52:58,806 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-01-01 21:52:58,806 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-01-01 21:52:58,806 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-01 21:52:58,806 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-01 21:52:59,325 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-01 21:52:59,325 INFO L280 CfgBuilder]: Removed 8 assue(true) statements. [2019-01-01 21:52:59,326 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.01 09:52:59 BoogieIcfgContainer [2019-01-01 21:52:59,326 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-01 21:52:59,327 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-01-01 21:52:59,327 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-01-01 21:52:59,331 INFO L276 PluginConnector]: BuchiAutomizer initialized [2019-01-01 21:52:59,332 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-01 21:52:59,332 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 01.01 09:52:57" (1/3) ... [2019-01-01 21:52:59,334 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@5df6a4cb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 01.01 09:52:59, skipping insertion in model container [2019-01-01 21:52:59,334 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-01 21:52:59,334 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:52:58" (2/3) ... [2019-01-01 21:52:59,334 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@5df6a4cb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 01.01 09:52:59, skipping insertion in model container [2019-01-01 21:52:59,335 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-01 21:52:59,335 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.01 09:52:59" (3/3) ... [2019-01-01 21:52:59,337 INFO L375 chiAutomizerObserver]: Analyzing ICFG openbsd_cstrncpy-alloca_true-termination.c.i [2019-01-01 21:52:59,401 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-01 21:52:59,401 INFO L374 BuchiCegarLoop]: Interprodecural is true [2019-01-01 21:52:59,402 INFO L375 BuchiCegarLoop]: Hoare is false [2019-01-01 21:52:59,402 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-01-01 21:52:59,402 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-01 21:52:59,402 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-01 21:52:59,402 INFO L379 BuchiCegarLoop]: Difference is false [2019-01-01 21:52:59,402 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-01 21:52:59,403 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-01-01 21:52:59,420 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states. [2019-01-01 21:52:59,447 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2019-01-01 21:52:59,447 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 21:52:59,448 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 21:52:59,457 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2019-01-01 21:52:59,457 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2019-01-01 21:52:59,457 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2019-01-01 21:52:59,457 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states. [2019-01-01 21:52:59,459 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2019-01-01 21:52:59,460 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 21:52:59,460 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 21:52:59,460 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2019-01-01 21:52:59,460 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2019-01-01 21:52:59,470 INFO L794 eck$LassoCheckResult]: Stem: 10#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 8#L-1true havoc main_#res;havoc main_#t~nondet8, main_#t~nondet9, main_#t~malloc10.base, main_#t~malloc10.offset, main_#t~malloc11.base, main_#t~malloc11.offset, main_#t~ret12.base, main_#t~ret12.offset, main_~length~0, main_~n~0, main_~nondetArea~0.base, main_~nondetArea~0.offset, main_~nondetString~0.base, main_~nondetString~0.offset;main_~length~0 := main_#t~nondet8;havoc main_#t~nondet8;main_~n~0 := main_#t~nondet9;havoc main_#t~nondet9; 4#L566true assume !(main_~length~0 < 1); 9#L566-2true assume !(main_~n~0 < 1); 3#L569-1true call main_#t~malloc10.base, main_#t~malloc10.offset := #Ultimate.allocOnStack(main_~n~0);main_~nondetArea~0.base, main_~nondetArea~0.offset := main_#t~malloc10.base, main_#t~malloc10.offset;call main_#t~malloc11.base, main_#t~malloc11.offset := #Ultimate.allocOnStack(main_~length~0);main_~nondetString~0.base, main_~nondetString~0.offset := main_#t~malloc11.base, main_#t~malloc11.offset;call write~int(0, main_~nondetString~0.base, main_~nondetString~0.offset + (main_~length~0 - 1), 1);cstrncpy_#in~dst.base, cstrncpy_#in~dst.offset, cstrncpy_#in~src.base, cstrncpy_#in~src.offset, cstrncpy_#in~n := main_~nondetArea~0.base, main_~nondetArea~0.offset, main_~nondetString~0.base, main_~nondetString~0.offset, main_~n~0;havoc cstrncpy_#res.base, cstrncpy_#res.offset;havoc cstrncpy_#t~post3.base, cstrncpy_#t~post3.offset, cstrncpy_#t~post4.base, cstrncpy_#t~post4.offset, cstrncpy_#t~mem5, cstrncpy_#t~post7.base, cstrncpy_#t~post7.offset, cstrncpy_#t~pre6, cstrncpy_#t~pre2, cstrncpy_~d~0.base, cstrncpy_~d~0.offset, cstrncpy_~s~0.base, cstrncpy_~s~0.offset, cstrncpy_~dst.base, cstrncpy_~dst.offset, cstrncpy_~src.base, cstrncpy_~src.offset, cstrncpy_~n;cstrncpy_~dst.base, cstrncpy_~dst.offset := cstrncpy_#in~dst.base, cstrncpy_#in~dst.offset;cstrncpy_~src.base, cstrncpy_~src.offset := cstrncpy_#in~src.base, cstrncpy_#in~src.offset;cstrncpy_~n := cstrncpy_#in~n; 16#L550true assume 0 != cstrncpy_~n % 4294967296;cstrncpy_~d~0.base, cstrncpy_~d~0.offset := cstrncpy_~dst.base, cstrncpy_~dst.offset;cstrncpy_~s~0.base, cstrncpy_~s~0.offset := cstrncpy_~src.base, cstrncpy_~src.offset; 18#L553-4true [2019-01-01 21:52:59,471 INFO L796 eck$LassoCheckResult]: Loop: 18#L553-4true cstrncpy_#t~post3.base, cstrncpy_#t~post3.offset := cstrncpy_~d~0.base, cstrncpy_~d~0.offset;cstrncpy_~d~0.base, cstrncpy_~d~0.offset := cstrncpy_#t~post3.base, 1 + cstrncpy_#t~post3.offset;cstrncpy_#t~post4.base, cstrncpy_#t~post4.offset := cstrncpy_~s~0.base, cstrncpy_~s~0.offset;cstrncpy_~s~0.base, cstrncpy_~s~0.offset := cstrncpy_#t~post4.base, 1 + cstrncpy_#t~post4.offset;call cstrncpy_#t~mem5 := read~int(cstrncpy_#t~post4.base, cstrncpy_#t~post4.offset, 1);call write~int(cstrncpy_#t~mem5, cstrncpy_#t~post3.base, cstrncpy_#t~post3.offset, 1); 6#L554true assume !(0 == cstrncpy_#t~mem5);havoc cstrncpy_#t~post3.base, cstrncpy_#t~post3.offset;havoc cstrncpy_#t~mem5;havoc cstrncpy_#t~post4.base, cstrncpy_#t~post4.offset; 12#L553-1true cstrncpy_#t~pre2 := cstrncpy_~n - 1;cstrncpy_~n := cstrncpy_~n - 1; 13#L553-2true assume !!(0 != cstrncpy_#t~pre2 % 4294967296);havoc cstrncpy_#t~pre2; 18#L553-4true [2019-01-01 21:52:59,478 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:52:59,478 INFO L82 PathProgramCache]: Analyzing trace with hash 889572236, now seen corresponding path program 1 times [2019-01-01 21:52:59,481 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:52:59,482 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:52:59,551 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:52:59,551 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 21:52:59,551 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:52:59,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:52:59,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:52:59,676 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:52:59,676 INFO L82 PathProgramCache]: Analyzing trace with hash 1618712, now seen corresponding path program 1 times [2019-01-01 21:52:59,676 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:52:59,677 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:52:59,679 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:52:59,680 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 21:52:59,680 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:52:59,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:52:59,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:52:59,722 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:52:59,722 INFO L82 PathProgramCache]: Analyzing trace with hash 1592246563, now seen corresponding path program 1 times [2019-01-01 21:52:59,722 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:52:59,722 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:52:59,725 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:52:59,725 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 21:52:59,725 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:52:59,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:52:59,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:53:00,117 WARN L181 SmtUtils]: Spent 275.00 ms on a formula simplification that was a NOOP. DAG size: 60 [2019-01-01 21:53:00,410 WARN L181 SmtUtils]: Spent 279.00 ms on a formula simplification that was a NOOP. DAG size: 50 [2019-01-01 21:53:01,385 WARN L181 SmtUtils]: Spent 965.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 95 [2019-01-01 21:53:01,869 WARN L181 SmtUtils]: Spent 480.00 ms on a formula simplification that was a NOOP. DAG size: 89 [2019-01-01 21:53:01,882 INFO L216 LassoAnalysis]: Preferences: [2019-01-01 21:53:01,884 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-01 21:53:01,884 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-01 21:53:01,884 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-01 21:53:01,884 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-01 21:53:01,885 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 21:53:01,885 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-01 21:53:01,885 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-01 21:53:01,885 INFO L131 ssoRankerPreferences]: Filename of dumped script: openbsd_cstrncpy-alloca_true-termination.c.i_Iteration1_Lasso [2019-01-01 21:53:01,885 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-01 21:53:01,886 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-01 21:53:01,920 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-01 21:53:01,951 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-01 21:53:01,958 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-01 21:53:01,960 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-01 21:53:01,976 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-01 21:53:01,982 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-01 21:53:02,012 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-01 21:53:02,025 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-01 21:53:02,031 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-01 21:53:02,036 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-01 21:53:02,049 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-01 21:53:02,051 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-01 21:53:02,054 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-01 21:53:02,061 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-01 21:53:02,065 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-01 21:53:02,068 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-01 21:53:02,070 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-01 21:53:02,076 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-01 21:53:02,601 WARN L181 SmtUtils]: Spent 403.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 80 [2019-01-01 21:53:02,921 WARN L181 SmtUtils]: Spent 294.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 65 [2019-01-01 21:53:02,922 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-01 21:53:02,924 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-01 21:53:02,926 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-01 21:53:02,929 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-01 21:53:03,262 WARN L181 SmtUtils]: Spent 258.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 63 [2019-01-01 21:53:03,440 WARN L181 SmtUtils]: Spent 176.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 49 [2019-01-01 21:53:03,912 WARN L181 SmtUtils]: Spent 122.00 ms on a formula simplification that was a NOOP. DAG size: 63 [2019-01-01 21:53:04,093 WARN L181 SmtUtils]: Spent 180.00 ms on a formula simplification that was a NOOP. DAG size: 49 [2019-01-01 21:53:04,564 WARN L181 SmtUtils]: Spent 469.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 43 [2019-01-01 21:53:04,657 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-01 21:53:04,663 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-01 21:53:04,665 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-01 21:53:04,668 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:53:04,668 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:53:04,669 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:53:04,669 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:53:04,669 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:53:04,671 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:53:04,672 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:53:04,674 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:53:04,675 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-01 21:53:04,675 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:53:04,675 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:53:04,676 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:53:04,677 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:53:04,677 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:53:04,677 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:53:04,677 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:53:04,678 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:53:04,679 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-01 21:53:04,680 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:53:04,680 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:53:04,680 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:53:04,680 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:53:04,680 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:53:04,681 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:53:04,681 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:53:04,682 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:53:04,682 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-01 21:53:04,683 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:53:04,683 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:53:04,683 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:53:04,683 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:53:04,683 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:53:04,685 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:53:04,685 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:53:04,686 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:53:04,687 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-01 21:53:04,687 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:53:04,688 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:53:04,688 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:53:04,688 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:53:04,688 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:53:04,689 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:53:04,689 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:53:04,689 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:53:04,691 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-01 21:53:04,692 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:53:04,692 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:53:04,692 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:53:04,692 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:53:04,696 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:53:04,696 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:53:04,700 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:53:04,700 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-01 21:53:04,701 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:53:04,701 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:53:04,701 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:53:04,702 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:53:04,702 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:53:04,702 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:53:04,702 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:53:04,705 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:53:04,706 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-01 21:53:04,706 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:53:04,706 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:53:04,706 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:53:04,707 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:53:04,707 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:53:04,707 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:53:04,707 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:53:04,710 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:53:04,710 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-01 21:53:04,711 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:53:04,713 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:53:04,713 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:53:04,713 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:53:04,715 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:53:04,715 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:53:04,722 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:53:04,723 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-01 21:53:04,723 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:53:04,725 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:53:04,725 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:53:04,725 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:53:04,727 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:53:04,727 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:53:04,731 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:53:04,732 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-01 21:53:04,732 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:53:04,732 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:53:04,732 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:53:04,732 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:53:04,734 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:53:04,735 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:53:04,735 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:53:04,736 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:53:04,737 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:53:04,737 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:53:04,738 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:53:04,738 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:53:04,738 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:53:04,738 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:53:04,738 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:53:04,739 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:53:04,742 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:53:04,742 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-01 21:53:04,743 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:53:04,743 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:53:04,743 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:53:04,743 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:53:04,743 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:53:04,744 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:53:04,744 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:53:04,747 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:53:04,748 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-01 21:53:04,748 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:53:04,748 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:53:04,750 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:53:04,750 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:53:04,750 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:53:04,751 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:53:04,751 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:53:04,753 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:53:04,753 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-01 21:53:04,754 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:53:04,754 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:53:04,754 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:53:04,754 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:53:04,754 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:53:04,757 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:53:04,757 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:53:04,758 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:53:04,758 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-01 21:53:04,759 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:53:04,759 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:53:04,761 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:53:04,761 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:53:04,761 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:53:04,761 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:53:04,761 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:53:04,762 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:53:04,764 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-01 21:53:04,764 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:53:04,765 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:53:04,765 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:53:04,765 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:53:04,768 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:53:04,768 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:53:04,772 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:53:04,772 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-01 21:53:04,773 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:53:04,773 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:53:04,773 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:53:04,773 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:53:04,790 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:53:04,790 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:53:04,956 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-01 21:53:05,030 INFO L443 ModelExtractionUtils]: Simplification made 9 calls to the SMT solver. [2019-01-01 21:53:05,030 INFO L444 ModelExtractionUtils]: 44 out of 55 variables were initially zero. Simplification set additionally 8 variables to zero. [2019-01-01 21:53:05,033 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-01 21:53:05,035 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-01-01 21:53:05,036 INFO L518 LassoAnalysis]: Proved termination. [2019-01-01 21:53:05,037 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_cstrncpy_~d~0.offset, v_rep(select #length ULTIMATE.start_main_#t~malloc10.base)_1) = -1*ULTIMATE.start_cstrncpy_~d~0.offset + 1*v_rep(select #length ULTIMATE.start_main_#t~malloc10.base)_1 Supporting invariants [] [2019-01-01 21:53:05,384 INFO L297 tatePredicateManager]: 12 out of 13 supporting invariants were superfluous and have been removed [2019-01-01 21:53:05,417 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2019-01-01 21:53:05,602 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:53:05,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:53:05,642 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:53:05,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:53:05,696 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:53:05,874 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-01 21:53:05,890 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 2 loop predicates [2019-01-01 21:53:05,892 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 17 states. Second operand 4 states. [2019-01-01 21:53:05,991 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 17 states.. Second operand 4 states. Result 37 states and 46 transitions. Complement of second has 7 states. [2019-01-01 21:53:05,992 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 2 stem states 1 non-accepting loop states 1 accepting loop states [2019-01-01 21:53:05,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-01-01 21:53:05,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 33 transitions. [2019-01-01 21:53:05,998 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 33 transitions. Stem has 6 letters. Loop has 4 letters. [2019-01-01 21:53:05,999 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:53:05,999 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 33 transitions. Stem has 10 letters. Loop has 4 letters. [2019-01-01 21:53:06,000 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:53:06,000 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 33 transitions. Stem has 6 letters. Loop has 8 letters. [2019-01-01 21:53:06,001 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:53:06,002 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 37 states and 46 transitions. [2019-01-01 21:53:06,007 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-01-01 21:53:06,010 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 37 states to 0 states and 0 transitions. [2019-01-01 21:53:06,011 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2019-01-01 21:53:06,011 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2019-01-01 21:53:06,011 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2019-01-01 21:53:06,011 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-01 21:53:06,012 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-01 21:53:06,012 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-01 21:53:06,012 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-01 21:53:06,012 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2019-01-01 21:53:06,012 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2019-01-01 21:53:06,012 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-01-01 21:53:06,012 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2019-01-01 21:53:06,018 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 01.01 09:53:06 BoogieIcfgContainer [2019-01-01 21:53:06,018 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2019-01-01 21:53:06,019 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-01 21:53:06,019 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-01 21:53:06,019 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-01 21:53:06,019 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.01 09:52:59" (3/4) ... [2019-01-01 21:53:06,023 INFO L147 WitnessPrinter]: No result that supports witness generation found [2019-01-01 21:53:06,023 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-01 21:53:06,024 INFO L168 Benchmark]: Toolchain (without parser) took 8175.47 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 199.8 MB). Free memory was 952.7 MB in the beginning and 965.0 MB in the end (delta: -12.3 MB). Peak memory consumption was 187.5 MB. Max. memory is 11.5 GB. [2019-01-01 21:53:06,026 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-01 21:53:06,027 INFO L168 Benchmark]: CACSL2BoogieTranslator took 780.14 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 130.0 MB). Free memory was 952.7 MB in the beginning and 1.1 GB in the end (delta: -158.1 MB). Peak memory consumption was 30.6 MB. Max. memory is 11.5 GB. [2019-01-01 21:53:06,028 INFO L168 Benchmark]: Boogie Procedure Inliner took 59.77 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-01 21:53:06,028 INFO L168 Benchmark]: Boogie Preprocessor took 36.40 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-01 21:53:06,030 INFO L168 Benchmark]: RCFGBuilder took 598.18 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: 19.1 MB). Peak memory consumption was 19.1 MB. Max. memory is 11.5 GB. [2019-01-01 21:53:06,030 INFO L168 Benchmark]: BuchiAutomizer took 6691.26 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 69.7 MB). Free memory was 1.1 GB in the beginning and 965.0 MB in the end (delta: 119.9 MB). Peak memory consumption was 189.6 MB. Max. memory is 11.5 GB. [2019-01-01 21:53:06,032 INFO L168 Benchmark]: Witness Printer took 4.29 ms. Allocated memory is still 1.2 GB. Free memory is still 965.0 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-01 21:53:06,038 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 780.14 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 130.0 MB). Free memory was 952.7 MB in the beginning and 1.1 GB in the end (delta: -158.1 MB). Peak memory consumption was 30.6 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 59.77 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 36.40 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 598.18 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: 19.1 MB). Peak memory consumption was 19.1 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 6691.26 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 69.7 MB). Free memory was 1.1 GB in the beginning and 965.0 MB in the end (delta: 119.9 MB). Peak memory consumption was 189.6 MB. Max. memory is 11.5 GB. * Witness Printer took 4.29 ms. Allocated memory is still 1.2 GB. Free memory is still 965.0 MB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #length * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 1 terminating modules (0 trivial, 1 deterministic, 0 nondeterministic). One deterministic module has affine ranking function -1 * d + unknown-#length-unknown[__builtin_alloca (n * sizeof(char))] and consists of 5 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 6.6s and 2 iterations. TraceHistogramMax:1. Analysis of lassos took 5.9s. Construction of modules took 0.0s. Büchi inclusion checks took 0.5s. Highest rank in rank-based complementation 3. Minimization of det autom 1. Minimization of nondet autom 0. Automata minimization No data available. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 0 states and ocurred in iteration 1. Nontrivial modules had stage [1, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 18 SDtfs, 21 SDslu, 15 SDs, 0 SdLazy, 10 SolverSat, 7 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc0 concLT0 SILN0 SILU0 SILI0 SILT0 lasso1 LassoPreprocessingBenchmarks: Lassos: inital232 mio100 ax107 hnf99 lsp90 ukn93 mio100 lsp52 div172 bol100 ite100 ukn100 eq174 hnf69 smp93 dnf130 smp97 tf100 neg97 sie110 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 10ms 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...