./Ultimate.py --spec /storage/repos/svcomp/c/properties/termination.prp --file /storage/repos/svcomp/c/termination-15/cstrcat_malloc_true-termination.c.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 2e94e6aa Calling Ultimate with: java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i /storage/repos/svcomp/c/termination-15/cstrcat_malloc_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 8f2b899caa4822254a00d27fcecb2b75790fc0d9 .................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-2e94e6a [2019-01-01 22:02:08,667 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-01 22:02:08,669 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-01 22:02:08,682 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-01 22:02:08,682 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-01 22:02:08,683 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-01 22:02:08,685 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-01 22:02:08,688 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-01 22:02:08,690 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-01 22:02:08,690 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-01 22:02:08,692 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-01 22:02:08,692 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-01 22:02:08,693 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-01 22:02:08,694 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-01 22:02:08,696 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-01 22:02:08,696 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-01 22:02:08,698 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-01 22:02:08,700 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-01 22:02:08,702 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-01 22:02:08,704 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-01 22:02:08,705 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-01 22:02:08,707 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-01 22:02:08,709 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-01 22:02:08,711 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-01 22:02:08,711 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-01 22:02:08,712 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-01 22:02:08,713 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-01 22:02:08,715 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-01 22:02:08,716 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-01 22:02:08,722 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-01 22:02:08,723 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-01 22:02:08,724 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-01 22:02:08,724 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-01 22:02:08,724 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-01 22:02:08,728 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-01 22:02:08,730 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-01 22:02:08,730 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf [2019-01-01 22:02:08,763 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-01 22:02:08,764 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-01 22:02:08,765 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-01 22:02:08,766 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-01 22:02:08,767 INFO L133 SettingsManager]: * Use SBE=true [2019-01-01 22:02:08,767 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-01-01 22:02:08,767 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-01-01 22:02:08,767 INFO L133 SettingsManager]: * Use old map elimination=false [2019-01-01 22:02:08,767 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2019-01-01 22:02:08,768 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2019-01-01 22:02:08,768 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-01-01 22:02:08,768 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-01 22:02:08,768 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-01-01 22:02:08,768 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-01 22:02:08,768 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-01 22:02:08,769 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-01-01 22:02:08,771 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-01-01 22:02:08,771 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-01-01 22:02:08,771 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-01 22:02:08,772 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-01-01 22:02:08,772 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-01 22:02:08,772 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-01-01 22:02:08,772 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-01 22:02:08,772 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-01 22:02:08,772 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-01-01 22:02:08,773 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-01 22:02:08,773 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-01 22:02:08,773 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-01-01 22:02:08,776 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-01-01 22:02:08,777 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 -> 8f2b899caa4822254a00d27fcecb2b75790fc0d9 [2019-01-01 22:02:08,837 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-01 22:02:08,853 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-01 22:02:08,858 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-01 22:02:08,862 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-01 22:02:08,863 INFO L276 PluginConnector]: CDTParser initialized [2019-01-01 22:02:08,863 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/termination-15/cstrcat_malloc_true-termination.c.i [2019-01-01 22:02:08,920 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/953ba5c72/4935612667054dbbbaa04ca719769fd4/FLAG64993fcf6 [2019-01-01 22:02:09,423 INFO L307 CDTParser]: Found 1 translation units. [2019-01-01 22:02:09,423 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/termination-15/cstrcat_malloc_true-termination.c.i [2019-01-01 22:02:09,436 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/953ba5c72/4935612667054dbbbaa04ca719769fd4/FLAG64993fcf6 [2019-01-01 22:02:09,711 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/953ba5c72/4935612667054dbbbaa04ca719769fd4 [2019-01-01 22:02:09,716 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-01 22:02:09,717 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-01-01 22:02:09,718 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-01 22:02:09,718 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-01 22:02:09,722 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-01 22:02:09,723 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.01 10:02:09" (1/1) ... [2019-01-01 22:02:09,727 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5f40f54b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 10:02:09, skipping insertion in model container [2019-01-01 22:02:09,727 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.01 10:02:09" (1/1) ... [2019-01-01 22:02:09,739 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-01 22:02:09,797 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-01 22:02:10,251 INFO L204 PostProcessor]: Analyzing one entry point: main [2019-01-01 22:02:10,268 INFO L191 MainTranslator]: Completed pre-run [2019-01-01 22:02:10,422 INFO L204 PostProcessor]: Analyzing one entry point: main [2019-01-01 22:02:10,489 INFO L195 MainTranslator]: Completed translation [2019-01-01 22:02:10,490 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 10:02:10 WrapperNode [2019-01-01 22:02:10,490 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-01 22:02:10,491 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-01 22:02:10,491 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-01 22:02:10,491 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-01 22:02:10,502 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 10:02:10" (1/1) ... [2019-01-01 22:02:10,518 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 10:02:10" (1/1) ... [2019-01-01 22:02:10,545 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-01 22:02:10,545 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-01 22:02:10,546 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-01 22:02:10,546 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-01 22:02:10,557 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 10:02:10" (1/1) ... [2019-01-01 22:02:10,557 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 10:02:10" (1/1) ... [2019-01-01 22:02:10,560 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 10:02:10" (1/1) ... [2019-01-01 22:02:10,561 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 10:02:10" (1/1) ... [2019-01-01 22:02:10,568 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 10:02:10" (1/1) ... [2019-01-01 22:02:10,573 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 10:02:10" (1/1) ... [2019-01-01 22:02:10,575 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 10:02:10" (1/1) ... [2019-01-01 22:02:10,578 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-01 22:02:10,579 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-01 22:02:10,579 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-01 22:02:10,579 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-01 22:02:10,580 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 10:02:10" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 22:02:10,661 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-01-01 22:02:10,661 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-01-01 22:02:10,661 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-01-01 22:02:10,661 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-01-01 22:02:10,663 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-01 22:02:10,663 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-01 22:02:11,217 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-01 22:02:11,217 INFO L280 CfgBuilder]: Removed 8 assue(true) statements. [2019-01-01 22:02:11,217 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.01 10:02:11 BoogieIcfgContainer [2019-01-01 22:02:11,218 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-01 22:02:11,218 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-01-01 22:02:11,218 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-01-01 22:02:11,226 INFO L276 PluginConnector]: BuchiAutomizer initialized [2019-01-01 22:02:11,229 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-01 22:02:11,231 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 01.01 10:02:09" (1/3) ... [2019-01-01 22:02:11,232 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@26b21bad and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 01.01 10:02:11, skipping insertion in model container [2019-01-01 22:02:11,233 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-01 22:02:11,233 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 10:02:10" (2/3) ... [2019-01-01 22:02:11,233 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@26b21bad and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 01.01 10:02:11, skipping insertion in model container [2019-01-01 22:02:11,233 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-01 22:02:11,234 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.01 10:02:11" (3/3) ... [2019-01-01 22:02:11,237 INFO L375 chiAutomizerObserver]: Analyzing ICFG cstrcat_malloc_true-termination.c.i [2019-01-01 22:02:11,312 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-01 22:02:11,313 INFO L374 BuchiCegarLoop]: Interprodecural is true [2019-01-01 22:02:11,313 INFO L375 BuchiCegarLoop]: Hoare is false [2019-01-01 22:02:11,314 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-01-01 22:02:11,314 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-01 22:02:11,314 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-01 22:02:11,314 INFO L379 BuchiCegarLoop]: Difference is false [2019-01-01 22:02:11,314 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-01 22:02:11,315 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-01-01 22:02:11,333 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states. [2019-01-01 22:02:11,360 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2019-01-01 22:02:11,360 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 22:02:11,361 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 22:02:11,369 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2019-01-01 22:02:11,369 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-01-01 22:02:11,369 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2019-01-01 22:02:11,370 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states. [2019-01-01 22:02:11,371 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2019-01-01 22:02:11,371 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 22:02:11,371 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 22:02:11,373 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2019-01-01 22:02:11,373 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-01-01 22:02:11,380 INFO L794 eck$LassoCheckResult]: Stem: 11#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 9#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); 10#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.allocOnHeap(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.allocOnHeap(main_~length2~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc214.base, main_#t~malloc214.offset;call write~int(0, main_~nondetString1~0.base, main_~nondetString1~0.offset + (main_~length1~0 - 1), 1);call write~int(0, 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-01 22:02:11,381 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 !!(0 != 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-01 22:02:11,386 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 22:02:11,386 INFO L82 PathProgramCache]: Analyzing trace with hash 889572367, now seen corresponding path program 1 times [2019-01-01 22:02:11,388 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 22:02:11,389 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 22:02:11,434 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:02:11,435 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 22:02:11,435 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:02:11,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:02:11,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:02:11,587 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 22:02:11,588 INFO L82 PathProgramCache]: Analyzing trace with hash 1926, now seen corresponding path program 1 times [2019-01-01 22:02:11,588 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 22:02:11,588 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 22:02:11,591 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:02:11,591 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 22:02:11,591 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:02:11,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:02:11,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:02:11,613 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 22:02:11,613 INFO L82 PathProgramCache]: Analyzing trace with hash 180553748, now seen corresponding path program 1 times [2019-01-01 22:02:11,614 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 22:02:11,614 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 22:02:11,615 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:02:11,615 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 22:02:11,615 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:02:11,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:02:11,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:02:11,816 WARN L181 SmtUtils]: Spent 121.00 ms on a formula simplification that was a NOOP. DAG size: 24 [2019-01-01 22:02:12,868 WARN L181 SmtUtils]: Spent 955.00 ms on a formula simplification. DAG size of input: 110 DAG size of output: 93 [2019-01-01 22:02:13,306 WARN L181 SmtUtils]: Spent 434.00 ms on a formula simplification that was a NOOP. DAG size: 85 [2019-01-01 22:02:13,325 INFO L216 LassoAnalysis]: Preferences: [2019-01-01 22:02:13,327 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-01 22:02:13,327 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-01 22:02:13,327 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-01 22:02:13,327 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-01 22:02:13,328 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 22:02:13,328 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-01 22:02:13,328 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-01 22:02:13,328 INFO L131 ssoRankerPreferences]: Filename of dumped script: cstrcat_malloc_true-termination.c.i_Iteration1_Lasso [2019-01-01 22:02:13,328 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-01 22:02:13,329 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-01 22:02:13,382 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:02:13,393 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:02:13,396 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:02:13,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-01 22:02:13,413 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:02:13,417 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:02:13,978 WARN L181 SmtUtils]: Spent 393.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 70 [2019-01-01 22:02:14,064 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:02:14,074 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:02:14,077 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:02:14,080 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:02:14,083 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:02:14,088 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:02:14,100 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:02:14,103 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:02:14,106 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:02:14,110 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:02:14,132 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:02:14,138 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:02:14,143 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:02:14,365 WARN L181 SmtUtils]: Spent 123.00 ms on a formula simplification that was a NOOP. DAG size: 47 [2019-01-01 22:02:14,672 WARN L181 SmtUtils]: Spent 107.00 ms on a formula simplification that was a NOOP. DAG size: 47 [2019-01-01 22:02:15,201 WARN L181 SmtUtils]: Spent 447.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 40 [2019-01-01 22:02:15,279 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-01 22:02:15,285 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-01 22:02:15,288 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 22:02:15,290 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:02:15,291 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:02:15,291 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:02:15,292 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:02:15,292 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:02:15,295 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 22:02:15,295 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:02:15,297 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:02:15,298 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 22:02:15,299 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:02:15,300 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:02:15,300 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:02:15,300 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:02:15,303 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 22:02:15,303 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 22:02:15,307 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:02:15,308 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 22:02:15,309 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:02:15,309 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:02:15,309 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:02:15,309 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:02:15,309 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:02:15,310 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 22:02:15,310 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:02:15,312 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:02:15,313 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 22:02:15,313 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:02:15,314 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:02:15,315 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:02:15,315 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:02:15,315 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:02:15,315 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 22:02:15,316 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:02:15,317 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:02:15,317 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 22:02:15,318 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:02:15,318 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:02:15,318 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:02:15,318 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:02:15,322 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 22:02:15,322 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 22:02:15,326 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:02:15,327 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 22:02:15,327 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:02:15,328 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:02:15,328 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:02:15,328 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:02:15,332 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 22:02:15,332 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 22:02:15,338 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:02:15,339 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 22:02:15,339 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:02:15,339 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:02:15,339 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:02:15,341 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:02:15,345 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 22:02:15,345 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 22:02:15,366 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:02:15,366 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 22:02:15,367 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:02:15,367 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:02:15,367 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:02:15,367 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:02:15,371 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 22:02:15,371 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 22:02:15,375 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:02:15,376 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 22:02:15,377 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:02:15,377 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:02:15,377 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:02:15,377 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:02:15,388 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 22:02:15,388 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 22:02:15,471 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-01 22:02:15,546 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2019-01-01 22:02:15,550 INFO L444 ModelExtractionUtils]: 44 out of 49 variables were initially zero. Simplification set additionally 2 variables to zero. [2019-01-01 22:02:15,553 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-01 22:02:15,557 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-01-01 22:02:15,561 INFO L518 LassoAnalysis]: Proved termination. [2019-01-01 22:02:15,562 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-01 22:02:15,643 INFO L297 tatePredicateManager]: 8 out of 9 supporting invariants were superfluous and have been removed [2019-01-01 22:02:15,654 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2019-01-01 22:02:15,699 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 22:02:15,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 22:02:15,743 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 22:02:15,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 22:02:15,764 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 22:02:15,807 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 22:02:15,825 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-01 22:02:15,826 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 15 states. Second operand 3 states. [2019-01-01 22:02:15,923 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 15 states.. Second operand 3 states. Result 35 states and 45 transitions. Complement of second has 7 states. [2019-01-01 22:02:15,924 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-01 22:02:15,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-01-01 22:02:15,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 34 transitions. [2019-01-01 22:02:15,929 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 34 transitions. Stem has 6 letters. Loop has 2 letters. [2019-01-01 22:02:15,930 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 22:02:15,931 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 34 transitions. Stem has 8 letters. Loop has 2 letters. [2019-01-01 22:02:15,931 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 22:02:15,931 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 34 transitions. Stem has 6 letters. Loop has 4 letters. [2019-01-01 22:02:15,931 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 22:02:15,933 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 35 states and 45 transitions. [2019-01-01 22:02:15,936 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-01-01 22:02:15,939 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 35 states to 0 states and 0 transitions. [2019-01-01 22:02:15,941 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2019-01-01 22:02:15,941 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2019-01-01 22:02:15,941 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2019-01-01 22:02:15,941 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-01 22:02:15,941 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-01 22:02:15,942 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-01 22:02:15,942 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-01 22:02:15,942 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2019-01-01 22:02:15,942 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2019-01-01 22:02:15,942 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-01-01 22:02:15,942 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2019-01-01 22:02:15,948 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 01.01 10:02:15 BoogieIcfgContainer [2019-01-01 22:02:15,948 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2019-01-01 22:02:15,949 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-01 22:02:15,949 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-01 22:02:15,949 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-01 22:02:15,950 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.01 10:02:11" (3/4) ... [2019-01-01 22:02:15,953 INFO L147 WitnessPrinter]: No result that supports witness generation found [2019-01-01 22:02:15,953 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-01 22:02:15,954 INFO L168 Benchmark]: Toolchain (without parser) took 6237.24 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 188.7 MB). Free memory was 950.0 MB in the beginning and 1.1 GB in the end (delta: -183.9 MB). Peak memory consumption was 4.9 MB. Max. memory is 11.5 GB. [2019-01-01 22:02:15,955 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-01 22:02:15,956 INFO L168 Benchmark]: CACSL2BoogieTranslator took 772.36 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 113.8 MB). Free memory was 950.0 MB in the beginning and 1.1 GB in the end (delta: -137.8 MB). Peak memory consumption was 30.4 MB. Max. memory is 11.5 GB. [2019-01-01 22:02:15,957 INFO L168 Benchmark]: Boogie Procedure Inliner took 54.20 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-01 22:02:15,957 INFO L168 Benchmark]: Boogie Preprocessor took 32.78 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-01 22:02:15,958 INFO L168 Benchmark]: RCFGBuilder took 639.09 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 18.2 MB). Peak memory consumption was 18.2 MB. Max. memory is 11.5 GB. [2019-01-01 22:02:15,958 INFO L168 Benchmark]: BuchiAutomizer took 4730.24 ms. Allocated memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: 75.0 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -64.2 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2019-01-01 22:02:15,960 INFO L168 Benchmark]: Witness Printer took 4.10 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-01 22:02:15,964 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.16 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 772.36 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 113.8 MB). Free memory was 950.0 MB in the beginning and 1.1 GB in the end (delta: -137.8 MB). Peak memory consumption was 30.4 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 54.20 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 32.78 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 639.09 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 18.2 MB). Peak memory consumption was 18.2 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 4730.24 ms. Allocated memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: 75.0 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -64.2 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * Witness Printer took 4.10 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #length * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 1 terminating modules (0 trivial, 1 deterministic, 0 nondeterministic). One deterministic module has affine ranking function unknown-#length-unknown[malloc(length2 * sizeof(char))] + -1 * s and consists of 5 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 4.6s and 2 iterations. TraceHistogramMax:1. Analysis of lassos took 4.2s. 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: 19 SDtfs, 20 SDslu, 13 SDs, 0 SdLazy, 4 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: 9ms 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...