./Ultimate.py --spec /storage/repos/svcomp/c/properties/termination.prp --file /storage/repos/svcomp/c/termination-15/cstrcat_diffterm_alloca_true-termination.c.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 0ed9222f Calling Ultimate with: java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i /storage/repos/svcomp/c/termination-15/cstrcat_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 6a26bec8435101bdbb43abb11ad0cdd911d4601c ..................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-0ed9222-m [2019-01-14 02:44:31,465 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-14 02:44:31,467 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-14 02:44:31,484 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-14 02:44:31,485 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-14 02:44:31,487 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-14 02:44:31,490 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-14 02:44:31,492 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-14 02:44:31,495 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-14 02:44:31,497 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-14 02:44:31,499 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-14 02:44:31,500 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-14 02:44:31,501 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-14 02:44:31,502 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-14 02:44:31,503 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-14 02:44:31,504 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-14 02:44:31,505 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-14 02:44:31,507 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-14 02:44:31,514 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-14 02:44:31,517 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-14 02:44:31,518 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-14 02:44:31,519 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-14 02:44:31,521 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-14 02:44:31,521 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-14 02:44:31,521 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-14 02:44:31,522 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-14 02:44:31,523 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-14 02:44:31,523 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-14 02:44:31,524 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-14 02:44:31,525 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-14 02:44:31,525 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-14 02:44:31,526 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-14 02:44:31,526 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-14 02:44:31,526 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-14 02:44:31,527 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-14 02:44:31,528 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-14 02:44:31,528 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf [2019-01-14 02:44:31,544 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-14 02:44:31,544 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-14 02:44:31,545 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-14 02:44:31,545 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-14 02:44:31,546 INFO L133 SettingsManager]: * Use SBE=true [2019-01-14 02:44:31,546 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-01-14 02:44:31,546 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-01-14 02:44:31,546 INFO L133 SettingsManager]: * Use old map elimination=false [2019-01-14 02:44:31,546 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2019-01-14 02:44:31,547 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2019-01-14 02:44:31,547 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-01-14 02:44:31,547 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-14 02:44:31,547 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-01-14 02:44:31,547 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-14 02:44:31,547 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-14 02:44:31,548 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-01-14 02:44:31,548 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-01-14 02:44:31,548 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-01-14 02:44:31,548 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-14 02:44:31,548 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-01-14 02:44:31,548 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-14 02:44:31,549 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-01-14 02:44:31,549 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-14 02:44:31,549 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-14 02:44:31,549 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-01-14 02:44:31,549 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-14 02:44:31,550 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-14 02:44:31,550 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-01-14 02:44:31,551 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-01-14 02:44:31,551 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 -> 6a26bec8435101bdbb43abb11ad0cdd911d4601c [2019-01-14 02:44:31,599 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-14 02:44:31,613 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-14 02:44:31,622 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-14 02:44:31,624 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-14 02:44:31,626 INFO L276 PluginConnector]: CDTParser initialized [2019-01-14 02:44:31,626 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/termination-15/cstrcat_diffterm_alloca_true-termination.c.i [2019-01-14 02:44:31,692 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cceedd669/161871a3c9904d2aa0955189041f16b5/FLAGae53e897a [2019-01-14 02:44:32,161 INFO L307 CDTParser]: Found 1 translation units. [2019-01-14 02:44:32,161 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/termination-15/cstrcat_diffterm_alloca_true-termination.c.i [2019-01-14 02:44:32,171 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cceedd669/161871a3c9904d2aa0955189041f16b5/FLAGae53e897a [2019-01-14 02:44:32,474 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cceedd669/161871a3c9904d2aa0955189041f16b5 [2019-01-14 02:44:32,478 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-14 02:44:32,479 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-01-14 02:44:32,480 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-14 02:44:32,480 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-14 02:44:32,483 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-14 02:44:32,484 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.01 02:44:32" (1/1) ... [2019-01-14 02:44:32,489 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@234729e8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:44:32, skipping insertion in model container [2019-01-14 02:44:32,489 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.01 02:44:32" (1/1) ... [2019-01-14 02:44:32,497 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-14 02:44:32,534 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-14 02:44:32,901 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-14 02:44:32,916 INFO L191 MainTranslator]: Completed pre-run [2019-01-14 02:44:32,992 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-14 02:44:33,160 INFO L195 MainTranslator]: Completed translation [2019-01-14 02:44:33,160 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:44:33 WrapperNode [2019-01-14 02:44:33,160 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-14 02:44:33,161 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-14 02:44:33,161 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-14 02:44:33,161 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-14 02:44:33,172 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:44:33" (1/1) ... [2019-01-14 02:44:33,191 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:44:33" (1/1) ... [2019-01-14 02:44:33,223 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-14 02:44:33,224 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-14 02:44:33,224 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-14 02:44:33,224 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-14 02:44:33,235 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:44:33" (1/1) ... [2019-01-14 02:44:33,236 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:44:33" (1/1) ... [2019-01-14 02:44:33,246 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:44:33" (1/1) ... [2019-01-14 02:44:33,246 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:44:33" (1/1) ... [2019-01-14 02:44:33,257 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:44:33" (1/1) ... [2019-01-14 02:44:33,268 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:44:33" (1/1) ... [2019-01-14 02:44:33,270 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:44:33" (1/1) ... [2019-01-14 02:44:33,279 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-14 02:44:33,280 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-14 02:44:33,280 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-14 02:44:33,280 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-14 02:44:33,282 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:44:33" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 02:44:33,354 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-01-14 02:44:33,355 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-01-14 02:44:33,355 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-01-14 02:44:33,355 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-01-14 02:44:33,355 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-14 02:44:33,356 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-14 02:44:33,820 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-14 02:44:33,821 INFO L286 CfgBuilder]: Removed 8 assue(true) statements. [2019-01-14 02:44:33,822 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 02:44:33 BoogieIcfgContainer [2019-01-14 02:44:33,822 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-14 02:44:33,823 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-01-14 02:44:33,823 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-01-14 02:44:33,827 INFO L276 PluginConnector]: BuchiAutomizer initialized [2019-01-14 02:44:33,828 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-14 02:44:33,828 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 14.01 02:44:32" (1/3) ... [2019-01-14 02:44:33,829 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@dd4dc3c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 14.01 02:44:33, skipping insertion in model container [2019-01-14 02:44:33,829 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-14 02:44:33,830 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:44:33" (2/3) ... [2019-01-14 02:44:33,831 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@dd4dc3c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 14.01 02:44:33, skipping insertion in model container [2019-01-14 02:44:33,831 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-14 02:44:33,831 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 02:44:33" (3/3) ... [2019-01-14 02:44:33,834 INFO L375 chiAutomizerObserver]: Analyzing ICFG cstrcat_diffterm_alloca_true-termination.c.i [2019-01-14 02:44:33,892 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-14 02:44:33,893 INFO L374 BuchiCegarLoop]: Interprodecural is true [2019-01-14 02:44:33,893 INFO L375 BuchiCegarLoop]: Hoare is false [2019-01-14 02:44:33,893 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-01-14 02:44:33,894 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-14 02:44:33,894 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-14 02:44:33,894 INFO L379 BuchiCegarLoop]: Difference is false [2019-01-14 02:44:33,894 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-14 02:44:33,894 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-01-14 02:44:33,910 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states. [2019-01-14 02:44:33,935 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2019-01-14 02:44:33,935 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 02:44:33,935 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 02:44:33,941 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2019-01-14 02:44:33,941 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-01-14 02:44:33,942 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2019-01-14 02:44:33,942 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states. [2019-01-14 02:44:33,944 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2019-01-14 02:44:33,944 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 02:44:33,944 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 02:44:33,944 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2019-01-14 02:44:33,945 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-01-14 02:44:33,952 INFO L794 eck$LassoCheckResult]: Stem: 10#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 8#L-1true havoc main_#res;havoc main_#t~nondet210, 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_~length1~0, main_~length2~0, main_~length3~0, main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;main_~length1~0 := main_#t~nondet210;havoc main_#t~nondet210;main_~length2~0 := main_#t~nondet211;havoc main_#t~nondet211;main_~length3~0 := main_#t~nondet212;havoc main_#t~nondet212; 3#L377true assume !(main_~length1~0 < 1); 6#L377-2true assume !(main_~length2~0 < 2); 15#L380-1true assume !(main_~length3~0 < 1); 9#L383-1true assume !(main_~length2~0 - main_~length3~0 < main_~length1~0 || main_~length3~0 > main_~length2~0);call main_#t~malloc213.base, main_#t~malloc213.offset := #Ultimate.allocOnStack(main_~length1~0);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc213.base, main_#t~malloc213.offset;call main_#t~malloc214.base, main_#t~malloc214.offset := #Ultimate.allocOnStack(main_~length2~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc214.base, main_#t~malloc214.offset;call write~int(49, main_~nondetString1~0.base, main_~nondetString1~0.offset + (main_~length1~0 - 1), 1);call write~int(49, main_~nondetString2~0.base, main_~nondetString2~0.offset + (main_~length3~0 - 1), 1);cstrcat_#in~s1.base, cstrcat_#in~s1.offset, cstrcat_#in~s2.base, cstrcat_#in~s2.offset := main_~nondetString2~0.base, main_~nondetString2~0.offset, main_~nondetString1~0.base, main_~nondetString1~0.offset;havoc cstrcat_#res.base, cstrcat_#res.offset;havoc cstrcat_#t~post206.base, cstrcat_#t~post206.offset, cstrcat_#t~mem205, cstrcat_#t~post207.base, cstrcat_#t~post207.offset, cstrcat_#t~post208.base, cstrcat_#t~post208.offset, cstrcat_#t~mem209, cstrcat_~s1.base, cstrcat_~s1.offset, cstrcat_~s2.base, cstrcat_~s2.offset, cstrcat_~s~0.base, cstrcat_~s~0.offset;cstrcat_~s1.base, cstrcat_~s1.offset := cstrcat_#in~s1.base, cstrcat_#in~s1.offset;cstrcat_~s2.base, cstrcat_~s2.offset := cstrcat_#in~s2.base, cstrcat_#in~s2.offset;cstrcat_~s~0.base, cstrcat_~s~0.offset := cstrcat_~s1.base, cstrcat_~s1.offset; 7#L367-3true [2019-01-14 02:44:33,952 INFO L796 eck$LassoCheckResult]: Loop: 7#L367-3true call cstrcat_#t~mem205 := read~int(cstrcat_~s~0.base, cstrcat_~s~0.offset, 1); 4#L367-1true assume !!(49 != cstrcat_#t~mem205);havoc cstrcat_#t~mem205;cstrcat_#t~post206.base, cstrcat_#t~post206.offset := cstrcat_~s~0.base, cstrcat_~s~0.offset;cstrcat_~s~0.base, cstrcat_~s~0.offset := cstrcat_#t~post206.base, 1 + cstrcat_#t~post206.offset;havoc cstrcat_#t~post206.base, cstrcat_#t~post206.offset; 7#L367-3true [2019-01-14 02:44:33,958 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:44:33,958 INFO L82 PathProgramCache]: Analyzing trace with hash 889572367, now seen corresponding path program 1 times [2019-01-14 02:44:33,959 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:44:33,960 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:44:33,996 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:44:33,997 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:44:33,997 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:44:34,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:44:34,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:44:34,112 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:44:34,112 INFO L82 PathProgramCache]: Analyzing trace with hash 1926, now seen corresponding path program 1 times [2019-01-14 02:44:34,113 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:44:34,113 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:44:34,114 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:44:34,114 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:44:34,115 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:44:34,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:44:34,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:44:34,127 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:44:34,128 INFO L82 PathProgramCache]: Analyzing trace with hash 180553748, now seen corresponding path program 1 times [2019-01-14 02:44:34,128 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:44:34,128 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:44:34,129 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:44:34,129 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:44:34,129 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:44:34,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:44:34,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:44:34,336 WARN L181 SmtUtils]: Spent 109.00 ms on a formula simplification that was a NOOP. DAG size: 25 [2019-01-14 02:44:35,248 WARN L181 SmtUtils]: Spent 848.00 ms on a formula simplification. DAG size of input: 111 DAG size of output: 94 [2019-01-14 02:44:35,704 WARN L181 SmtUtils]: Spent 452.00 ms on a formula simplification that was a NOOP. DAG size: 86 [2019-01-14 02:44:35,733 INFO L216 LassoAnalysis]: Preferences: [2019-01-14 02:44:35,734 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-14 02:44:35,734 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-14 02:44:35,735 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-14 02:44:35,735 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-14 02:44:35,735 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 02:44:35,735 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-14 02:44:35,735 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-14 02:44:35,736 INFO L131 ssoRankerPreferences]: Filename of dumped script: cstrcat_diffterm_alloca_true-termination.c.i_Iteration1_Lasso [2019-01-14 02:44:35,736 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-14 02:44:35,736 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-14 02:44:35,768 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:44:35,776 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:44:35,782 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:44:35,786 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:44:35,790 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:44:36,336 WARN L181 SmtUtils]: Spent 340.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 71 [2019-01-14 02:44:36,406 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:44:36,411 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:44:36,415 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:44:36,418 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:44:36,421 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:44:36,426 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:44:36,447 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:44:36,476 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:44:36,482 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:44:36,485 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:44:36,500 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:44:36,503 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:44:36,506 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:44:36,523 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:44:37,019 WARN L181 SmtUtils]: Spent 124.00 ms on a formula simplification that was a NOOP. DAG size: 47 [2019-01-14 02:44:37,553 WARN L181 SmtUtils]: Spent 456.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 40 [2019-01-14 02:44:37,633 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-14 02:44:37,640 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-14 02:44:37,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 [2019-01-14 02:44:37,645 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:44:37,645 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:44:37,647 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:44:37,647 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:44:37,647 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:44:37,649 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:44:37,649 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:44:37,653 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:44:37,655 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:44:37,656 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:44:37,657 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:44:37,657 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:44:37,657 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:44:37,662 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:44:37,663 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:44:37,675 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:44:37,676 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:44:37,676 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:44:37,676 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:44:37,677 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:44:37,679 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:44:37,679 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:44:37,679 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:44:37,680 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:44:37,681 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:44:37,681 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:44:37,681 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:44:37,683 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:44:37,683 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:44:37,683 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:44:37,684 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:44:37,684 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:44:37,684 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:44:37,690 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:44:37,691 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:44:37,694 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:44:37,694 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:44:37,694 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:44:37,694 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:44:37,697 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:44:37,697 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:44:37,704 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:44:37,704 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:44:37,705 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:44:37,705 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:44:37,705 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:44:37,705 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:44:37,707 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:44:37,708 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:44:37,713 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:44:37,714 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:44:37,714 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:44:37,715 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:44:37,716 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:44:37,716 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:44:37,719 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:44:37,720 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:44:37,739 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:44:37,739 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:44:37,741 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:44:37,741 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:44:37,741 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:44:37,741 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:44:37,749 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:44:37,749 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:44:37,832 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-14 02:44:37,894 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-01-14 02:44:37,894 INFO L444 ModelExtractionUtils]: 45 out of 49 variables were initially zero. Simplification set additionally 1 variables to zero. [2019-01-14 02:44:37,896 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-14 02:44:37,898 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-01-14 02:44:37,898 INFO L518 LassoAnalysis]: Proved termination. [2019-01-14 02:44:37,900 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_main_#t~malloc214.base)_1, ULTIMATE.start_cstrcat_~s~0.offset) = 1*v_rep(select #length ULTIMATE.start_main_#t~malloc214.base)_1 - 1*ULTIMATE.start_cstrcat_~s~0.offset Supporting invariants [] [2019-01-14 02:44:38,036 INFO L297 tatePredicateManager]: 8 out of 9 supporting invariants were superfluous and have been removed [2019-01-14 02:44:38,045 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2019-01-14 02:44:38,085 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:44:38,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:44:38,119 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:44:38,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:44:38,137 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:44:38,163 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 02:44:38,175 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2019-01-14 02:44:38,177 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 15 states. Second operand 3 states. [2019-01-14 02:44:38,291 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 15 states.. Second operand 3 states. Result 32 states and 42 transitions. Complement of second has 8 states. [2019-01-14 02:44:38,292 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2019-01-14 02:44:38,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-01-14 02:44:38,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 31 transitions. [2019-01-14 02:44:38,296 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 31 transitions. Stem has 6 letters. Loop has 2 letters. [2019-01-14 02:44:38,297 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:44:38,298 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 31 transitions. Stem has 8 letters. Loop has 2 letters. [2019-01-14 02:44:38,298 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:44:38,298 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 31 transitions. Stem has 6 letters. Loop has 4 letters. [2019-01-14 02:44:38,298 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:44:38,300 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 32 states and 42 transitions. [2019-01-14 02:44:38,303 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-01-14 02:44:38,306 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 32 states to 0 states and 0 transitions. [2019-01-14 02:44:38,307 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2019-01-14 02:44:38,307 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2019-01-14 02:44:38,307 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2019-01-14 02:44:38,308 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-14 02:44:38,308 INFO L706 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-14 02:44:38,308 INFO L729 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-14 02:44:38,308 INFO L609 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-14 02:44:38,308 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2019-01-14 02:44:38,308 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2019-01-14 02:44:38,308 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-01-14 02:44:38,309 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2019-01-14 02:44:38,314 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 14.01 02:44:38 BoogieIcfgContainer [2019-01-14 02:44:38,314 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2019-01-14 02:44:38,315 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-14 02:44:38,315 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-14 02:44:38,315 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-14 02:44:38,316 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 02:44:33" (3/4) ... [2019-01-14 02:44:38,319 INFO L147 WitnessPrinter]: No result that supports witness generation found [2019-01-14 02:44:38,319 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-14 02:44:38,320 INFO L168 Benchmark]: Toolchain (without parser) took 5842.07 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 211.8 MB). Free memory was 946.0 MB in the beginning and 1.2 GB in the end (delta: -206.2 MB). Peak memory consumption was 5.6 MB. Max. memory is 11.5 GB. [2019-01-14 02:44:38,321 INFO L168 Benchmark]: CDTParser took 0.18 ms. Allocated memory is still 1.0 GB. Free memory is still 972.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-14 02:44:38,322 INFO L168 Benchmark]: CACSL2BoogieTranslator took 680.80 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 148.9 MB). Free memory was 940.6 MB in the beginning and 1.1 GB in the end (delta: -195.8 MB). Peak memory consumption was 37.3 MB. Max. memory is 11.5 GB. [2019-01-14 02:44:38,323 INFO L168 Benchmark]: Boogie Procedure Inliner took 62.68 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.3 MB). Peak memory consumption was 13.3 MB. Max. memory is 11.5 GB. [2019-01-14 02:44:38,324 INFO L168 Benchmark]: Boogie Preprocessor took 55.29 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-14 02:44:38,325 INFO L168 Benchmark]: RCFGBuilder took 542.64 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: 17.7 MB). Peak memory consumption was 17.7 MB. Max. memory is 11.5 GB. [2019-01-14 02:44:38,326 INFO L168 Benchmark]: BuchiAutomizer took 4491.68 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 62.9 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -46.7 MB). Peak memory consumption was 16.2 MB. Max. memory is 11.5 GB. [2019-01-14 02:44:38,328 INFO L168 Benchmark]: Witness Printer took 4.25 ms. Allocated memory is still 1.2 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-14 02:44:38,335 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.18 ms. Allocated memory is still 1.0 GB. Free memory is still 972.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 680.80 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 148.9 MB). Free memory was 940.6 MB in the beginning and 1.1 GB in the end (delta: -195.8 MB). Peak memory consumption was 37.3 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 62.68 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.3 MB). Peak memory consumption was 13.3 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 55.29 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 542.64 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: 17.7 MB). Peak memory consumption was 17.7 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 4491.68 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 62.9 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -46.7 MB). Peak memory consumption was 16.2 MB. Max. memory is 11.5 GB. * Witness Printer took 4.25 ms. Allocated memory is still 1.2 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #length * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 1 terminating modules (0 trivial, 1 deterministic, 0 nondeterministic). One deterministic module has affine ranking function unknown-#length-unknown[__builtin_alloca(length2 * sizeof(char))] + -1 * s and consists of 5 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 4.4s and 2 iterations. TraceHistogramMax:1. Analysis of lassos took 4.0s. Construction of modules took 0.0s. Büchi inclusion checks took 0.2s. Highest rank in rank-based complementation 3. Minimization of det autom 1. Minimization of nondet autom 0. Automata minimization No data available. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 0 states and ocurred in iteration 1. Nontrivial modules had stage [1, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 16 SDtfs, 17 SDslu, 7 SDs, 0 SdLazy, 7 SolverSat, 8 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc0 concLT0 SILN0 SILU0 SILI0 SILT0 lasso1 LassoPreprocessingBenchmarks: Lassos: inital192 mio100 ax100 hnf98 lsp96 ukn78 mio100 lsp48 div100 bol100 ite100 ukn100 eq188 hnf88 smp100 dnf211 smp97 tf100 neg96 sie111 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 20ms VariablesStem: 1 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! Received shutdown request...