./Ultimate.py --spec /storage/repos/svcomp/c/properties/termination.prp --file /storage/repos/svcomp/c/termination-15/cstrncpy_diffterm_alloca_true-termination.c.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 91b1670e Calling Ultimate with: java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i /storage/repos/svcomp/c/termination-15/cstrncpy_diffterm_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 42c24f3b8e86bd7db4a5522885bfbc1daa3bcc95 .............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-91b1670 [2018-11-28 23:23:35,464 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-28 23:23:35,466 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-28 23:23:35,481 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-28 23:23:35,482 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-28 23:23:35,483 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-28 23:23:35,484 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-28 23:23:35,487 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-28 23:23:35,488 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-28 23:23:35,489 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-28 23:23:35,490 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-28 23:23:35,491 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-28 23:23:35,492 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-28 23:23:35,492 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-28 23:23:35,494 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-28 23:23:35,495 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-28 23:23:35,496 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-28 23:23:35,498 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-28 23:23:35,500 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-28 23:23:35,502 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-28 23:23:35,503 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-28 23:23:35,504 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-28 23:23:35,507 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-28 23:23:35,507 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-28 23:23:35,507 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-28 23:23:35,508 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-28 23:23:35,512 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-28 23:23:35,513 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-28 23:23:35,514 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-28 23:23:35,515 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-28 23:23:35,515 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-28 23:23:35,516 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-28 23:23:35,516 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-28 23:23:35,516 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-28 23:23:35,518 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-28 23:23:35,518 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-28 23:23:35,519 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf [2018-11-28 23:23:35,535 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-28 23:23:35,536 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-28 23:23:35,537 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-28 23:23:35,537 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-28 23:23:35,537 INFO L133 SettingsManager]: * Use SBE=true [2018-11-28 23:23:35,538 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-11-28 23:23:35,538 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-11-28 23:23:35,538 INFO L133 SettingsManager]: * Use old map elimination=false [2018-11-28 23:23:35,538 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-11-28 23:23:35,538 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-11-28 23:23:35,538 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-11-28 23:23:35,539 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-28 23:23:35,539 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-28 23:23:35,539 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-28 23:23:35,539 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-28 23:23:35,539 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-11-28 23:23:35,540 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-11-28 23:23:35,541 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-11-28 23:23:35,541 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-28 23:23:35,541 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-11-28 23:23:35,542 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-28 23:23:35,542 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-11-28 23:23:35,542 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-28 23:23:35,542 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-28 23:23:35,542 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-11-28 23:23:35,543 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-28 23:23:35,544 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-28 23:23:35,544 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-11-28 23:23:35,545 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-11-28 23:23:35,545 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 -> 42c24f3b8e86bd7db4a5522885bfbc1daa3bcc95 [2018-11-28 23:23:35,590 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-28 23:23:35,608 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-28 23:23:35,615 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-28 23:23:35,616 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-28 23:23:35,618 INFO L276 PluginConnector]: CDTParser initialized [2018-11-28 23:23:35,618 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/termination-15/cstrncpy_diffterm_alloca_true-termination.c.i [2018-11-28 23:23:35,679 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d1a53cdf4/3f705f456b684ffe90b818cb08bf18bc/FLAG1be592df9 [2018-11-28 23:23:36,156 INFO L307 CDTParser]: Found 1 translation units. [2018-11-28 23:23:36,157 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/termination-15/cstrncpy_diffterm_alloca_true-termination.c.i [2018-11-28 23:23:36,169 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d1a53cdf4/3f705f456b684ffe90b818cb08bf18bc/FLAG1be592df9 [2018-11-28 23:23:36,454 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d1a53cdf4/3f705f456b684ffe90b818cb08bf18bc [2018-11-28 23:23:36,458 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-28 23:23:36,459 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-28 23:23:36,460 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-28 23:23:36,460 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-28 23:23:36,464 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-28 23:23:36,465 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 11:23:36" (1/1) ... [2018-11-28 23:23:36,470 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@629a53d8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:23:36, skipping insertion in model container [2018-11-28 23:23:36,470 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 11:23:36" (1/1) ... [2018-11-28 23:23:36,479 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-28 23:23:36,526 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-28 23:23:36,979 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-11-28 23:23:36,995 INFO L191 MainTranslator]: Completed pre-run [2018-11-28 23:23:37,055 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-11-28 23:23:37,210 INFO L195 MainTranslator]: Completed translation [2018-11-28 23:23:37,210 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:23:37 WrapperNode [2018-11-28 23:23:37,210 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-28 23:23:37,211 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-28 23:23:37,211 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-28 23:23:37,211 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-28 23:23:37,221 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:23:37" (1/1) ... [2018-11-28 23:23:37,238 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:23:37" (1/1) ... [2018-11-28 23:23:37,260 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-28 23:23:37,260 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-28 23:23:37,260 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-28 23:23:37,260 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-28 23:23:37,270 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:23:37" (1/1) ... [2018-11-28 23:23:37,270 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:23:37" (1/1) ... [2018-11-28 23:23:37,273 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:23:37" (1/1) ... [2018-11-28 23:23:37,273 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:23:37" (1/1) ... [2018-11-28 23:23:37,280 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:23:37" (1/1) ... [2018-11-28 23:23:37,284 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:23:37" (1/1) ... [2018-11-28 23:23:37,286 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:23:37" (1/1) ... [2018-11-28 23:23:37,288 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-28 23:23:37,289 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-28 23:23:37,289 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-28 23:23:37,289 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-28 23:23:37,290 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:23:37" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 23:23:37,352 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-28 23:23:37,353 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-28 23:23:37,353 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-28 23:23:37,353 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-28 23:23:37,353 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-28 23:23:37,353 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-28 23:23:37,756 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-28 23:23:37,757 INFO L280 CfgBuilder]: Removed 8 assue(true) statements. [2018-11-28 23:23:37,757 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 11:23:37 BoogieIcfgContainer [2018-11-28 23:23:37,757 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-28 23:23:37,758 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-11-28 23:23:37,758 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-11-28 23:23:37,763 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-11-28 23:23:37,764 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-28 23:23:37,764 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 28.11 11:23:36" (1/3) ... [2018-11-28 23:23:37,765 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@3937be29 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 28.11 11:23:37, skipping insertion in model container [2018-11-28 23:23:37,766 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-28 23:23:37,766 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:23:37" (2/3) ... [2018-11-28 23:23:37,766 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@3937be29 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 28.11 11:23:37, skipping insertion in model container [2018-11-28 23:23:37,766 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-28 23:23:37,766 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 11:23:37" (3/3) ... [2018-11-28 23:23:37,769 INFO L375 chiAutomizerObserver]: Analyzing ICFG cstrncpy_diffterm_alloca_true-termination.c.i [2018-11-28 23:23:37,826 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-28 23:23:37,826 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-11-28 23:23:37,826 INFO L375 BuchiCegarLoop]: Hoare is false [2018-11-28 23:23:37,827 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-11-28 23:23:37,827 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-28 23:23:37,827 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-28 23:23:37,827 INFO L379 BuchiCegarLoop]: Difference is false [2018-11-28 23:23:37,827 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-28 23:23:37,827 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-11-28 23:23:37,842 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 14 states. [2018-11-28 23:23:37,864 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2018-11-28 23:23:37,865 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 23:23:37,865 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 23:23:37,873 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2018-11-28 23:23:37,873 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-11-28 23:23:37,873 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-11-28 23:23:37,873 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 14 states. [2018-11-28 23:23:37,875 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2018-11-28 23:23:37,875 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 23:23:37,875 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 23:23:37,876 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2018-11-28 23:23:37,876 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-11-28 23:23:37,885 INFO L794 eck$LassoCheckResult]: Stem: 11#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 8#L-1true havoc main_#res;havoc main_#t~nondet211, main_#t~nondet212, main_#t~malloc213.base, main_#t~malloc213.offset, main_#t~malloc214.base, main_#t~malloc214.offset, main_#t~ret215.base, main_#t~ret215.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~nondet211;havoc main_#t~nondet211;main_~n~0 := main_#t~nondet212;havoc main_#t~nondet212; 4#L385true assume !(main_~length~0 < 1); 7#L385-2true assume !(main_~n~0 < 1); 3#L388-1true call main_#t~malloc213.base, main_#t~malloc213.offset := #Ultimate.alloc(main_~n~0);main_~nondetArea~0.base, main_~nondetArea~0.offset := main_#t~malloc213.base, main_#t~malloc213.offset;call main_#t~malloc214.base, main_#t~malloc214.offset := #Ultimate.alloc(main_~length~0);main_~nondetString~0.base, main_~nondetString~0.offset := main_#t~malloc214.base, main_#t~malloc214.offset;call write~int(49, main_~nondetString~0.base, main_~nondetString~0.offset + (main_~length~0 - 1), 1);cstrncpy_#in~s1.base, cstrncpy_#in~s1.offset, cstrncpy_#in~s2.base, cstrncpy_#in~s2.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~post205, cstrncpy_#t~post206.base, cstrncpy_#t~post206.offset, cstrncpy_#t~post207.base, cstrncpy_#t~post207.offset, cstrncpy_#t~mem208, cstrncpy_#t~post210.base, cstrncpy_#t~post210.offset, cstrncpy_#t~post209, cstrncpy_~s1.base, cstrncpy_~s1.offset, cstrncpy_~s2.base, cstrncpy_~s2.offset, cstrncpy_~n, cstrncpy_~dst~0.base, cstrncpy_~dst~0.offset, cstrncpy_~src~0.base, cstrncpy_~src~0.offset, cstrncpy_~us~0.base, cstrncpy_~us~0.offset, cstrncpy_~n2~0;cstrncpy_~s1.base, cstrncpy_~s1.offset := cstrncpy_#in~s1.base, cstrncpy_#in~s1.offset;cstrncpy_~s2.base, cstrncpy_~s2.offset := cstrncpy_#in~s2.base, cstrncpy_#in~s2.offset;cstrncpy_~n := cstrncpy_#in~n;cstrncpy_~dst~0.base, cstrncpy_~dst~0.offset := cstrncpy_~s1.base, cstrncpy_~s1.offset;cstrncpy_~src~0.base, cstrncpy_~src~0.offset := cstrncpy_~s2.base, cstrncpy_~s2.offset;havoc cstrncpy_~us~0.base, cstrncpy_~us~0.offset;havoc cstrncpy_~n2~0; 14#L370-2true [2018-11-28 23:23:37,885 INFO L796 eck$LassoCheckResult]: Loop: 14#L370-2true assume !!(cstrncpy_~n > 0);cstrncpy_#t~post205 := cstrncpy_~n;cstrncpy_~n := cstrncpy_#t~post205 - 1;havoc cstrncpy_#t~post205;cstrncpy_#t~post206.base, cstrncpy_#t~post206.offset := cstrncpy_~dst~0.base, cstrncpy_~dst~0.offset;cstrncpy_~dst~0.base, cstrncpy_~dst~0.offset := cstrncpy_#t~post206.base, 1 + cstrncpy_#t~post206.offset;cstrncpy_#t~post207.base, cstrncpy_#t~post207.offset := cstrncpy_~src~0.base, cstrncpy_~src~0.offset;cstrncpy_~src~0.base, cstrncpy_~src~0.offset := cstrncpy_#t~post207.base, 1 + cstrncpy_#t~post207.offset;call cstrncpy_#t~mem208 := read~int(cstrncpy_#t~post207.base, cstrncpy_#t~post207.offset, 1);call write~int(cstrncpy_#t~mem208, cstrncpy_#t~post206.base, cstrncpy_#t~post206.offset, 1); 9#L372true assume !(49 == cstrncpy_#t~mem208);havoc cstrncpy_#t~post207.base, cstrncpy_#t~post207.offset;havoc cstrncpy_#t~post206.base, cstrncpy_#t~post206.offset;havoc cstrncpy_#t~mem208; 14#L370-2true [2018-11-28 23:23:37,891 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:23:37,892 INFO L82 PathProgramCache]: Analyzing trace with hash 28695878, now seen corresponding path program 1 times [2018-11-28 23:23:37,894 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:23:37,895 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:23:37,942 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:23:37,942 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:23:37,942 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:23:37,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:23:38,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:23:38,041 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:23:38,041 INFO L82 PathProgramCache]: Analyzing trace with hash 1747, now seen corresponding path program 1 times [2018-11-28 23:23:38,041 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:23:38,041 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:23:38,042 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:23:38,043 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:23:38,043 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:23:38,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:23:38,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:23:38,066 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:23:38,066 INFO L82 PathProgramCache]: Analyzing trace with hash 1806935768, now seen corresponding path program 1 times [2018-11-28 23:23:38,066 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:23:38,066 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:23:38,067 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:23:38,067 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:23:38,068 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:23:38,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:23:38,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:23:38,406 WARN L180 SmtUtils]: Spent 230.00 ms on a formula simplification that was a NOOP. DAG size: 55 [2018-11-28 23:23:38,704 WARN L180 SmtUtils]: Spent 284.00 ms on a formula simplification that was a NOOP. DAG size: 45 [2018-11-28 23:23:39,552 WARN L180 SmtUtils]: Spent 842.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 89 [2018-11-28 23:23:39,744 WARN L180 SmtUtils]: Spent 189.00 ms on a formula simplification that was a NOOP. DAG size: 83 [2018-11-28 23:23:39,761 INFO L216 LassoAnalysis]: Preferences: [2018-11-28 23:23:39,762 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-28 23:23:39,762 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-28 23:23:39,762 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-28 23:23:39,763 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-28 23:23:39,763 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 23:23:39,763 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-28 23:23:39,764 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-28 23:23:39,764 INFO L131 ssoRankerPreferences]: Filename of dumped script: cstrncpy_diffterm_alloca_true-termination.c.i_Iteration1_Lasso [2018-11-28 23:23:39,764 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-28 23:23:39,764 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-28 23:23:39,797 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:23:39,834 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:23:39,860 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:23:39,864 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:23:39,871 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:23:39,879 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:23:39,883 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:23:39,887 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:23:39,892 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:23:39,895 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:23:39,898 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:23:39,900 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:23:39,905 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:23:39,907 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:23:39,910 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:23:40,409 WARN L180 SmtUtils]: Spent 401.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 74 [2018-11-28 23:23:40,599 WARN L180 SmtUtils]: Spent 174.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 61 [2018-11-28 23:23:40,600 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:23:40,603 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:23:40,606 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:23:40,609 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:23:40,612 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:23:40,615 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:23:40,619 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:23:41,033 WARN L180 SmtUtils]: Spent 158.00 ms on a formula simplification that was a NOOP. DAG size: 52 [2018-11-28 23:23:41,434 WARN L180 SmtUtils]: Spent 102.00 ms on a formula simplification that was a NOOP. DAG size: 52 [2018-11-28 23:23:41,598 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-28 23:23:41,604 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-28 23:23:41,606 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:23:41,608 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:23:41,608 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:23:41,609 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:23:41,609 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:23:41,609 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:23:41,611 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:23:41,612 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:23:41,614 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:23:41,614 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:23:41,615 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:23:41,615 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:23:41,615 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:23:41,615 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:23:41,616 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:23:41,616 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:23:41,616 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:23:41,617 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:23:41,617 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:23:41,618 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:23:41,618 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:23:41,618 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:23:41,618 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:23:41,619 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:23:41,619 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:23:41,619 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:23:41,620 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:23:41,621 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:23:41,621 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:23:41,622 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:23:41,622 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:23:41,622 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:23:41,625 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:23:41,625 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:23:41,629 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:23:41,629 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:23:41,630 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:23:41,630 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:23:41,630 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:23:41,630 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:23:41,632 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:23:41,632 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:23:41,636 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:23:41,636 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:23:41,637 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:23:41,637 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:23:41,637 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:23:41,637 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:23:41,637 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:23:41,638 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:23:41,638 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:23:41,639 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:23:41,639 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:23:41,640 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:23:41,640 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:23:41,640 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:23:41,640 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:23:41,640 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:23:41,641 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:23:41,641 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:23:41,642 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:23:41,642 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:23:41,642 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:23:41,643 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:23:41,643 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:23:41,643 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:23:41,643 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:23:41,643 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:23:41,644 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:23:41,644 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:23:41,645 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:23:41,645 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:23:41,645 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:23:41,646 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:23:41,646 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:23:41,646 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:23:41,646 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:23:41,646 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:23:41,647 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:23:41,648 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:23:41,648 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:23:41,648 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:23:41,648 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:23:41,649 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:23:41,649 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:23:41,649 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:23:41,649 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:23:41,650 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:23:41,650 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:23:41,651 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:23:41,651 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:23:41,651 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:23:41,651 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:23:41,652 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:23:41,652 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:23:41,652 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:23:41,653 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:23:41,653 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:23:41,654 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:23:41,654 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:23:41,654 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:23:41,654 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:23:41,654 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:23:41,655 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:23:41,655 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:23:41,656 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:23:41,657 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:23:41,657 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:23:41,657 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:23:41,657 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:23:41,658 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:23:41,658 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:23:41,658 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:23:41,658 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:23:41,659 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:23:41,660 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:23:41,660 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:23:41,660 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:23:41,660 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:23:41,661 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:23:41,661 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:23:41,661 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:23:41,661 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:23:41,662 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:23:41,663 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:23:41,663 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:23:41,664 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:23:41,664 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:23:41,664 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:23:41,666 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:23:41,667 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:23:41,678 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:23:41,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 [2018-11-28 23:23:41,679 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:23:41,680 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:23:41,680 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:23:41,680 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:23:41,680 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:23:41,681 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:23:41,681 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:23:41,682 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:23:41,683 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:23:41,683 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:23:41,683 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:23:41,684 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:23:41,684 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:23:41,686 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:23:41,686 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:23:41,690 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:23:41,690 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:23:41,691 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:23:41,691 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:23:41,691 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:23:41,691 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:23:41,693 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:23:41,694 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:23:41,697 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:23:41,698 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:23:41,698 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:23:41,698 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:23:41,698 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:23:41,699 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:23:41,702 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:23:41,702 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:23:41,725 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:23:41,725 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:23:41,726 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:23:41,726 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-28 23:23:41,727 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:23:41,727 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:23:41,740 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-28 23:23:41,741 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:23:41,788 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:23:41,791 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:23:41,791 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:23:41,792 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:23:41,792 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:23:41,792 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:23:41,798 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:23:41,800 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:23:41,828 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:23:41,828 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:23:41,829 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:23:41,829 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:23:41,829 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:23:41,829 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:23:41,848 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:23:41,848 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:23:41,971 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-28 23:23:42,033 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2018-11-28 23:23:42,033 INFO L444 ModelExtractionUtils]: 49 out of 55 variables were initially zero. Simplification set additionally 3 variables to zero. [2018-11-28 23:23:42,037 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-28 23:23:42,039 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-28 23:23:42,040 INFO L518 LassoAnalysis]: Proved termination. [2018-11-28 23:23:42,040 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_cstrncpy_~dst~0.offset, v_rep(select #length ULTIMATE.start_main_#t~malloc213.base)_1) = -1*ULTIMATE.start_cstrncpy_~dst~0.offset + 1*v_rep(select #length ULTIMATE.start_main_#t~malloc213.base)_1 Supporting invariants [] [2018-11-28 23:23:42,221 INFO L297 tatePredicateManager]: 12 out of 13 supporting invariants were superfluous and have been removed [2018-11-28 23:23:42,234 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2018-11-28 23:23:42,261 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:23:42,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:23:42,302 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:23:42,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:23:42,331 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:23:42,513 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 23:23:42,527 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2018-11-28 23:23:42,529 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 14 states. Second operand 3 states. [2018-11-28 23:23:42,606 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 14 states.. Second operand 3 states. Result 27 states and 37 transitions. Complement of second has 6 states. [2018-11-28 23:23:42,607 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 [2018-11-28 23:23:42,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-28 23:23:42,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 24 transitions. [2018-11-28 23:23:42,611 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 24 transitions. Stem has 5 letters. Loop has 2 letters. [2018-11-28 23:23:42,612 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:23:42,612 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 24 transitions. Stem has 7 letters. Loop has 2 letters. [2018-11-28 23:23:42,613 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:23:42,613 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 24 transitions. Stem has 5 letters. Loop has 4 letters. [2018-11-28 23:23:42,613 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:23:42,614 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 27 states and 37 transitions. [2018-11-28 23:23:42,618 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2018-11-28 23:23:42,622 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 27 states to 11 states and 14 transitions. [2018-11-28 23:23:42,623 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 8 [2018-11-28 23:23:42,623 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 9 [2018-11-28 23:23:42,624 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 14 transitions. [2018-11-28 23:23:42,624 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-28 23:23:42,624 INFO L705 BuchiCegarLoop]: Abstraction has 11 states and 14 transitions. [2018-11-28 23:23:42,639 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states and 14 transitions. [2018-11-28 23:23:42,647 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 10. [2018-11-28 23:23:42,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-11-28 23:23:42,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 13 transitions. [2018-11-28 23:23:42,649 INFO L728 BuchiCegarLoop]: Abstraction has 10 states and 13 transitions. [2018-11-28 23:23:42,649 INFO L608 BuchiCegarLoop]: Abstraction has 10 states and 13 transitions. [2018-11-28 23:23:42,649 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-11-28 23:23:42,649 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 10 states and 13 transitions. [2018-11-28 23:23:42,649 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2018-11-28 23:23:42,650 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 23:23:42,650 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 23:23:42,650 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2018-11-28 23:23:42,650 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-11-28 23:23:42,651 INFO L794 eck$LassoCheckResult]: Stem: 150#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 148#L-1 havoc main_#res;havoc main_#t~nondet211, main_#t~nondet212, main_#t~malloc213.base, main_#t~malloc213.offset, main_#t~malloc214.base, main_#t~malloc214.offset, main_#t~ret215.base, main_#t~ret215.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~nondet211;havoc main_#t~nondet211;main_~n~0 := main_#t~nondet212;havoc main_#t~nondet212; 149#L385 assume !(main_~length~0 < 1); 153#L385-2 assume !(main_~n~0 < 1); 151#L388-1 call main_#t~malloc213.base, main_#t~malloc213.offset := #Ultimate.alloc(main_~n~0);main_~nondetArea~0.base, main_~nondetArea~0.offset := main_#t~malloc213.base, main_#t~malloc213.offset;call main_#t~malloc214.base, main_#t~malloc214.offset := #Ultimate.alloc(main_~length~0);main_~nondetString~0.base, main_~nondetString~0.offset := main_#t~malloc214.base, main_#t~malloc214.offset;call write~int(49, main_~nondetString~0.base, main_~nondetString~0.offset + (main_~length~0 - 1), 1);cstrncpy_#in~s1.base, cstrncpy_#in~s1.offset, cstrncpy_#in~s2.base, cstrncpy_#in~s2.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~post205, cstrncpy_#t~post206.base, cstrncpy_#t~post206.offset, cstrncpy_#t~post207.base, cstrncpy_#t~post207.offset, cstrncpy_#t~mem208, cstrncpy_#t~post210.base, cstrncpy_#t~post210.offset, cstrncpy_#t~post209, cstrncpy_~s1.base, cstrncpy_~s1.offset, cstrncpy_~s2.base, cstrncpy_~s2.offset, cstrncpy_~n, cstrncpy_~dst~0.base, cstrncpy_~dst~0.offset, cstrncpy_~src~0.base, cstrncpy_~src~0.offset, cstrncpy_~us~0.base, cstrncpy_~us~0.offset, cstrncpy_~n2~0;cstrncpy_~s1.base, cstrncpy_~s1.offset := cstrncpy_#in~s1.base, cstrncpy_#in~s1.offset;cstrncpy_~s2.base, cstrncpy_~s2.offset := cstrncpy_#in~s2.base, cstrncpy_#in~s2.offset;cstrncpy_~n := cstrncpy_#in~n;cstrncpy_~dst~0.base, cstrncpy_~dst~0.offset := cstrncpy_~s1.base, cstrncpy_~s1.offset;cstrncpy_~src~0.base, cstrncpy_~src~0.offset := cstrncpy_~s2.base, cstrncpy_~s2.offset;havoc cstrncpy_~us~0.base, cstrncpy_~us~0.offset;havoc cstrncpy_~n2~0; 152#L370-2 assume !!(cstrncpy_~n > 0);cstrncpy_#t~post205 := cstrncpy_~n;cstrncpy_~n := cstrncpy_#t~post205 - 1;havoc cstrncpy_#t~post205;cstrncpy_#t~post206.base, cstrncpy_#t~post206.offset := cstrncpy_~dst~0.base, cstrncpy_~dst~0.offset;cstrncpy_~dst~0.base, cstrncpy_~dst~0.offset := cstrncpy_#t~post206.base, 1 + cstrncpy_#t~post206.offset;cstrncpy_#t~post207.base, cstrncpy_#t~post207.offset := cstrncpy_~src~0.base, cstrncpy_~src~0.offset;cstrncpy_~src~0.base, cstrncpy_~src~0.offset := cstrncpy_#t~post207.base, 1 + cstrncpy_#t~post207.offset;call cstrncpy_#t~mem208 := read~int(cstrncpy_#t~post207.base, cstrncpy_#t~post207.offset, 1);call write~int(cstrncpy_#t~mem208, cstrncpy_#t~post206.base, cstrncpy_#t~post206.offset, 1); 146#L372 assume 49 == cstrncpy_#t~mem208;havoc cstrncpy_#t~post207.base, cstrncpy_#t~post207.offset;havoc cstrncpy_#t~post206.base, cstrncpy_#t~post206.offset;havoc cstrncpy_#t~mem208;cstrncpy_~us~0.base, cstrncpy_~us~0.offset := cstrncpy_~dst~0.base, cstrncpy_~dst~0.offset;cstrncpy_~n2~0 := cstrncpy_~n; 144#L375-3 [2018-11-28 23:23:42,651 INFO L796 eck$LassoCheckResult]: Loop: 144#L375-3 cstrncpy_#t~post209 := cstrncpy_~n2~0;cstrncpy_~n2~0 := cstrncpy_#t~post209 - 1; 145#L375-1 assume !!(0 != cstrncpy_#t~post209);havoc cstrncpy_#t~post209;cstrncpy_#t~post210.base, cstrncpy_#t~post210.offset := cstrncpy_~us~0.base, cstrncpy_~us~0.offset;cstrncpy_~us~0.base, cstrncpy_~us~0.offset := cstrncpy_#t~post210.base, 1 + cstrncpy_#t~post210.offset;call write~int(49, cstrncpy_#t~post210.base, cstrncpy_#t~post210.offset, 1);havoc cstrncpy_#t~post210.base, cstrncpy_#t~post210.offset; 144#L375-3 [2018-11-28 23:23:42,651 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:23:42,651 INFO L82 PathProgramCache]: Analyzing trace with hash 1806935753, now seen corresponding path program 1 times [2018-11-28 23:23:42,651 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:23:42,651 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:23:42,652 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:23:42,652 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:23:42,652 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:23:42,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:23:42,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:23:42,697 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:23:42,697 INFO L82 PathProgramCache]: Analyzing trace with hash 1990, now seen corresponding path program 1 times [2018-11-28 23:23:42,698 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:23:42,701 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:23:42,702 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:23:42,702 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:23:42,702 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:23:42,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:23:42,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:23:42,717 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:23:42,720 INFO L82 PathProgramCache]: Analyzing trace with hash 1298472078, now seen corresponding path program 1 times [2018-11-28 23:23:42,720 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:23:42,720 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:23:42,721 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:23:42,721 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:23:42,721 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:23:42,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:23:42,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:23:42,914 WARN L180 SmtUtils]: Spent 144.00 ms on a formula simplification that was a NOOP. DAG size: 33 [2018-11-28 23:23:43,572 WARN L180 SmtUtils]: Spent 587.00 ms on a formula simplification. DAG size of input: 143 DAG size of output: 128 [2018-11-28 23:23:43,812 WARN L180 SmtUtils]: Spent 232.00 ms on a formula simplification that was a NOOP. DAG size: 100 [2018-11-28 23:23:43,817 INFO L216 LassoAnalysis]: Preferences: [2018-11-28 23:23:43,817 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-28 23:23:43,817 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-28 23:23:43,817 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-28 23:23:43,817 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-28 23:23:43,817 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 23:23:43,817 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-28 23:23:43,818 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-28 23:23:43,818 INFO L131 ssoRankerPreferences]: Filename of dumped script: cstrncpy_diffterm_alloca_true-termination.c.i_Iteration2_Lasso [2018-11-28 23:23:43,818 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-28 23:23:43,818 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-28 23:23:43,823 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:23:43,835 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:23:43,837 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:23:43,846 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:23:43,848 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:23:43,850 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:23:43,852 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:23:44,255 WARN L180 SmtUtils]: Spent 266.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 83 [2018-11-28 23:23:44,403 WARN L180 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 52 [2018-11-28 23:23:44,403 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:23:44,405 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:23:44,408 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:23:44,410 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:23:44,413 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:23:44,416 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:23:44,418 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:23:44,420 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:23:44,422 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:23:44,425 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:23:44,427 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:23:44,428 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:23:44,430 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:23:44,718 WARN L180 SmtUtils]: Spent 165.00 ms on a formula simplification that was a NOOP. DAG size: 64 [2018-11-28 23:23:45,320 WARN L180 SmtUtils]: Spent 248.00 ms on a formula simplification that was a NOOP. DAG size: 64 [2018-11-28 23:23:45,429 WARN L180 SmtUtils]: Spent 108.00 ms on a formula simplification that was a NOOP. DAG size: 39 [2018-11-28 23:23:45,567 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-28 23:23:45,567 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-28 23:23:45,567 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:23:45,568 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:23:45,568 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:23:45,568 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:23:45,569 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:23:45,569 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:23:45,569 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:23:45,569 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:23:45,570 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:23:45,570 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:23:45,574 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:23:45,574 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:23:45,574 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:23:45,574 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:23:45,575 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:23:45,575 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:23:45,575 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:23:45,575 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:23:45,576 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:23:45,576 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:23:45,576 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:23:45,577 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:23:45,577 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:23:45,577 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:23:45,577 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:23:45,577 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:23:45,578 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:23:45,578 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:23:45,578 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:23:45,579 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:23:45,579 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:23:45,579 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:23:45,579 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:23:45,579 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:23:45,579 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:23:45,580 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:23:45,580 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:23:45,581 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:23:45,581 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:23:45,581 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:23:45,581 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:23:45,582 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:23:45,582 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:23:45,583 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:23:45,590 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:23:45,591 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:23:45,591 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:23:45,591 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:23:45,591 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:23:45,591 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:23:45,592 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:23:45,593 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:23:45,594 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:23:45,594 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:23:45,595 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:23:45,595 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-28 23:23:45,595 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:23:45,595 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:23:45,599 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-28 23:23:45,599 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:23:45,620 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:23:45,620 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:23:45,621 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:23:45,621 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:23:45,621 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:23:45,621 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:23:45,621 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:23:45,622 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:23:45,622 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:23:45,623 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:23:45,624 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:23:45,624 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:23:45,624 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:23:45,624 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:23:45,625 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:23:45,628 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:23:45,628 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:23:45,629 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:23:45,630 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:23:45,630 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:23:45,630 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:23:45,630 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:23:45,630 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:23:45,634 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:23:45,635 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:23:45,638 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:23:45,639 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:23:45,641 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:23:45,642 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:23:45,642 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:23:45,642 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:23:45,642 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:23:45,642 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:23:45,643 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:23:45,643 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:23:45,648 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:23:45,648 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:23:45,648 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:23:45,650 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:23:45,650 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:23:45,657 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:23:45,657 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:23:45,666 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:23:45,666 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:23:45,667 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:23:45,667 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:23:45,667 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-28 23:23:45,667 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:23:45,687 INFO L402 nArgumentSynthesizer]: We have 16 Motzkin's Theorem applications. [2018-11-28 23:23:45,687 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2018-11-28 23:23:45,801 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-28 23:23:45,917 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2018-11-28 23:23:45,917 INFO L444 ModelExtractionUtils]: 95 out of 106 variables were initially zero. Simplification set additionally 8 variables to zero. [2018-11-28 23:23:45,917 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-28 23:23:45,919 INFO L440 nArgumentSynthesizer]: Removed 4 redundant supporting invariants from a total of 4. [2018-11-28 23:23:45,919 INFO L518 LassoAnalysis]: Proved termination. [2018-11-28 23:23:45,919 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_main_#t~malloc213.base)_2, ULTIMATE.start_cstrncpy_~us~0.offset) = 1*v_rep(select #length ULTIMATE.start_main_#t~malloc213.base)_2 - 1*ULTIMATE.start_cstrncpy_~us~0.offset Supporting invariants [] [2018-11-28 23:23:46,343 INFO L297 tatePredicateManager]: 16 out of 17 supporting invariants were superfluous and have been removed [2018-11-28 23:23:46,364 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2018-11-28 23:23:46,399 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:23:46,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:23:46,418 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:23:46,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:23:46,443 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:23:46,444 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 23:23:46,445 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 1 loop predicates [2018-11-28 23:23:46,445 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 10 states and 13 transitions. cyclomatic complexity: 5 Second operand 4 states. [2018-11-28 23:23:46,576 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 10 states and 13 transitions. cyclomatic complexity: 5. Second operand 4 states. Result 12 states and 16 transitions. Complement of second has 5 states. [2018-11-28 23:23:46,577 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 2 stem states 1 non-accepting loop states 1 accepting loop states [2018-11-28 23:23:46,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-28 23:23:46,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 12 transitions. [2018-11-28 23:23:46,578 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 12 transitions. Stem has 7 letters. Loop has 2 letters. [2018-11-28 23:23:46,578 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:23:46,578 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 12 transitions. Stem has 9 letters. Loop has 2 letters. [2018-11-28 23:23:46,579 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:23:46,579 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 12 transitions. Stem has 7 letters. Loop has 4 letters. [2018-11-28 23:23:46,579 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:23:46,579 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 12 states and 16 transitions. [2018-11-28 23:23:46,580 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-28 23:23:46,580 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 12 states to 0 states and 0 transitions. [2018-11-28 23:23:46,580 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2018-11-28 23:23:46,580 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2018-11-28 23:23:46,580 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2018-11-28 23:23:46,580 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-28 23:23:46,581 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-28 23:23:46,581 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-28 23:23:46,581 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-28 23:23:46,581 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-11-28 23:23:46,581 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2018-11-28 23:23:46,581 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-28 23:23:46,581 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2018-11-28 23:23:46,587 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 28.11 11:23:46 BoogieIcfgContainer [2018-11-28 23:23:46,588 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-11-28 23:23:46,588 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-28 23:23:46,588 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-28 23:23:46,588 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-28 23:23:46,589 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 11:23:37" (3/4) ... [2018-11-28 23:23:46,592 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-11-28 23:23:46,593 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-28 23:23:46,593 INFO L168 Benchmark]: Toolchain (without parser) took 10135.27 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 305.1 MB). Free memory was 951.4 MB in the beginning and 1.1 GB in the end (delta: -192.1 MB). Peak memory consumption was 113.1 MB. Max. memory is 11.5 GB. [2018-11-28 23:23:46,595 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. [2018-11-28 23:23:46,595 INFO L168 Benchmark]: CACSL2BoogieTranslator took 750.62 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 145.8 MB). Free memory was 951.4 MB in the beginning and 1.1 GB in the end (delta: -180.2 MB). Peak memory consumption was 31.8 MB. Max. memory is 11.5 GB. [2018-11-28 23:23:46,596 INFO L168 Benchmark]: Boogie Procedure Inliner took 48.72 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: 13.4 MB). Peak memory consumption was 13.4 MB. Max. memory is 11.5 GB. [2018-11-28 23:23:46,597 INFO L168 Benchmark]: Boogie Preprocessor took 28.19 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-28 23:23:46,597 INFO L168 Benchmark]: RCFGBuilder took 468.88 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 18.7 MB). Peak memory consumption was 18.7 MB. Max. memory is 11.5 GB. [2018-11-28 23:23:46,598 INFO L168 Benchmark]: BuchiAutomizer took 8829.62 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 159.4 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -44.0 MB). Peak memory consumption was 115.4 MB. Max. memory is 11.5 GB. [2018-11-28 23:23:46,599 INFO L168 Benchmark]: Witness Printer took 4.63 ms. Allocated memory is still 1.3 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-28 23:23:46,604 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 750.62 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 145.8 MB). Free memory was 951.4 MB in the beginning and 1.1 GB in the end (delta: -180.2 MB). Peak memory consumption was 31.8 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 48.72 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: 13.4 MB). Peak memory consumption was 13.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 28.19 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 468.88 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 18.7 MB). Peak memory consumption was 18.7 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 8829.62 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 159.4 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -44.0 MB). Peak memory consumption was 115.4 MB. Max. memory is 11.5 GB. * Witness Printer took 4.63 ms. Allocated memory is still 1.3 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 - GenericResult: Unfinished Backtranslation unknown boogie variable #length * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 2 terminating modules (0 trivial, 2 deterministic, 0 nondeterministic). One deterministic module has affine ranking function -1 * dst + unknown-#length-unknown[__builtin_alloca(n * sizeof(char))] and consists of 4 locations. One deterministic module has affine ranking function unknown-#length-unknown[__builtin_alloca(n * sizeof(char))] + -1 * us and consists of 4 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 8.7s and 3 iterations. TraceHistogramMax:1. Analysis of lassos took 8.0s. Construction of modules took 0.0s. Büchi inclusion checks took 0.5s. Highest rank in rank-based complementation 3. Minimization of det autom 2. Minimization of nondet autom 0. Automata minimization 0.0s AutomataMinimizationTime, 1 MinimizatonAttempts, 1 StatesRemovedByMinimization, 1 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 10 states and ocurred in iteration 1. Nontrivial modules had stage [2, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 21 SDtfs, 23 SDslu, 11 SDs, 0 SdLazy, 12 SolverSat, 9 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc0 concLT0 SILN0 SILU0 SILI0 SILT0 lasso2 LassoPreprocessingBenchmarks: Lassos: inital229 mio100 ax100 hnf99 lsp96 ukn87 mio100 lsp54 div100 bol100 ite100 ukn100 eq201 hnf88 smp100 dnf115 smp100 tf100 neg99 sie101 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: sat Degree: 0 Time: 252ms VariablesStem: 20 VariablesLoop: 12 DisjunctsStem: 1 DisjunctsLoop: 2 SupportingInvariants: 4 MotzkinApplications: 16 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...