./Ultimate.py --spec /storage/repos/svcomp/c/properties/termination.prp --file /storage/repos/svcomp/c/termination-15/cstrcmp_malloc_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/cstrcmp_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 2b3cf29a1a2b298bac4a0639392dc4a433a50703 ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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:45:39,659 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-14 02:45:39,661 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-14 02:45:39,673 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-14 02:45:39,673 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-14 02:45:39,674 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-14 02:45:39,676 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-14 02:45:39,678 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-14 02:45:39,679 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-14 02:45:39,680 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-14 02:45:39,681 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-14 02:45:39,682 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-14 02:45:39,683 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-14 02:45:39,686 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-14 02:45:39,689 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-14 02:45:39,691 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-14 02:45:39,692 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-14 02:45:39,698 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-14 02:45:39,700 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-14 02:45:39,704 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-14 02:45:39,707 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-14 02:45:39,708 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-14 02:45:39,715 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-14 02:45:39,715 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-14 02:45:39,715 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-14 02:45:39,718 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-14 02:45:39,721 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-14 02:45:39,722 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-14 02:45:39,722 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-14 02:45:39,723 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-14 02:45:39,724 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-14 02:45:39,727 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-14 02:45:39,727 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-14 02:45:39,727 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-14 02:45:39,728 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-14 02:45:39,729 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-14 02:45:39,729 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:45:39,747 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-14 02:45:39,747 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-14 02:45:39,750 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-14 02:45:39,750 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-14 02:45:39,750 INFO L133 SettingsManager]: * Use SBE=true [2019-01-14 02:45:39,750 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-01-14 02:45:39,750 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-01-14 02:45:39,751 INFO L133 SettingsManager]: * Use old map elimination=false [2019-01-14 02:45:39,752 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2019-01-14 02:45:39,752 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2019-01-14 02:45:39,752 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-01-14 02:45:39,752 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-14 02:45:39,753 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-01-14 02:45:39,753 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-14 02:45:39,753 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-14 02:45:39,753 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-01-14 02:45:39,753 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-01-14 02:45:39,753 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-01-14 02:45:39,756 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-14 02:45:39,756 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-01-14 02:45:39,756 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-14 02:45:39,756 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-01-14 02:45:39,756 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-14 02:45:39,757 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-14 02:45:39,758 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-01-14 02:45:39,759 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-14 02:45:39,759 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-14 02:45:39,759 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-01-14 02:45:39,760 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-01-14 02:45:39,760 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 -> 2b3cf29a1a2b298bac4a0639392dc4a433a50703 [2019-01-14 02:45:39,818 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-14 02:45:39,836 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-14 02:45:39,843 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-14 02:45:39,844 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-14 02:45:39,845 INFO L276 PluginConnector]: CDTParser initialized [2019-01-14 02:45:39,846 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/termination-15/cstrcmp_malloc_true-termination.c.i [2019-01-14 02:45:39,896 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6ca99c744/7480bcad8c814718a34ef2738412f999/FLAG2a8cf2ab7 [2019-01-14 02:45:40,418 INFO L307 CDTParser]: Found 1 translation units. [2019-01-14 02:45:40,419 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/termination-15/cstrcmp_malloc_true-termination.c.i [2019-01-14 02:45:40,433 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6ca99c744/7480bcad8c814718a34ef2738412f999/FLAG2a8cf2ab7 [2019-01-14 02:45:40,652 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6ca99c744/7480bcad8c814718a34ef2738412f999 [2019-01-14 02:45:40,656 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-14 02:45:40,658 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-01-14 02:45:40,659 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-14 02:45:40,659 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-14 02:45:40,663 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-14 02:45:40,664 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.01 02:45:40" (1/1) ... [2019-01-14 02:45:40,667 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1d504f3e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:45:40, skipping insertion in model container [2019-01-14 02:45:40,668 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.01 02:45:40" (1/1) ... [2019-01-14 02:45:40,678 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-14 02:45:40,725 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-14 02:45:41,152 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-14 02:45:41,168 INFO L191 MainTranslator]: Completed pre-run [2019-01-14 02:45:41,359 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-14 02:45:41,433 INFO L195 MainTranslator]: Completed translation [2019-01-14 02:45:41,434 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:45:41 WrapperNode [2019-01-14 02:45:41,434 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-14 02:45:41,435 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-14 02:45:41,435 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-14 02:45:41,435 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-14 02:45:41,444 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:45:41" (1/1) ... [2019-01-14 02:45:41,458 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:45:41" (1/1) ... [2019-01-14 02:45:41,482 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-14 02:45:41,483 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-14 02:45:41,483 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-14 02:45:41,483 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-14 02:45:41,493 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:45:41" (1/1) ... [2019-01-14 02:45:41,493 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:45:41" (1/1) ... [2019-01-14 02:45:41,496 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:45:41" (1/1) ... [2019-01-14 02:45:41,496 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:45:41" (1/1) ... [2019-01-14 02:45:41,503 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:45:41" (1/1) ... [2019-01-14 02:45:41,508 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:45:41" (1/1) ... [2019-01-14 02:45:41,510 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:45:41" (1/1) ... [2019-01-14 02:45:41,513 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-14 02:45:41,513 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-14 02:45:41,513 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-14 02:45:41,514 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-14 02:45:41,515 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:45:41" (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:45:41,571 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-01-14 02:45:41,572 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-01-14 02:45:41,572 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-01-14 02:45:41,572 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-01-14 02:45:41,572 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-14 02:45:41,572 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-14 02:45:41,933 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-14 02:45:41,934 INFO L286 CfgBuilder]: Removed 7 assue(true) statements. [2019-01-14 02:45:41,935 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 02:45:41 BoogieIcfgContainer [2019-01-14 02:45:41,935 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-14 02:45:41,936 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-01-14 02:45:41,936 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-01-14 02:45:41,939 INFO L276 PluginConnector]: BuchiAutomizer initialized [2019-01-14 02:45:41,939 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-14 02:45:41,940 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 14.01 02:45:40" (1/3) ... [2019-01-14 02:45:41,941 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@4cdab1ef and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 14.01 02:45:41, skipping insertion in model container [2019-01-14 02:45:41,941 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-14 02:45:41,941 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:45:41" (2/3) ... [2019-01-14 02:45:41,941 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@4cdab1ef and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 14.01 02:45:41, skipping insertion in model container [2019-01-14 02:45:41,941 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-14 02:45:41,942 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 02:45:41" (3/3) ... [2019-01-14 02:45:41,943 INFO L375 chiAutomizerObserver]: Analyzing ICFG cstrcmp_malloc_true-termination.c.i [2019-01-14 02:45:41,998 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-14 02:45:41,999 INFO L374 BuchiCegarLoop]: Interprodecural is true [2019-01-14 02:45:41,999 INFO L375 BuchiCegarLoop]: Hoare is false [2019-01-14 02:45:41,999 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-01-14 02:45:41,999 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-14 02:45:41,999 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-14 02:45:42,000 INFO L379 BuchiCegarLoop]: Difference is false [2019-01-14 02:45:42,000 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-14 02:45:42,000 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-01-14 02:45:42,015 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states. [2019-01-14 02:45:42,036 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-01-14 02:45:42,036 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 02:45:42,036 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 02:45:42,042 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2019-01-14 02:45:42,042 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-01-14 02:45:42,042 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2019-01-14 02:45:42,042 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states. [2019-01-14 02:45:42,044 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-01-14 02:45:42,044 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 02:45:42,044 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 02:45:42,045 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2019-01-14 02:45:42,045 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-01-14 02:45:42,052 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~nondet214, main_#t~nondet215, main_#t~malloc216.base, main_#t~malloc216.offset, main_#t~malloc217.base, main_#t~malloc217.offset, main_#t~ret218, main_~length1~0, main_~length2~0, main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset, main_~res~0;main_~length1~0 := main_#t~nondet214;havoc main_#t~nondet214;main_~length2~0 := main_#t~nondet215;havoc main_#t~nondet215; 17#L378true assume !(main_~length1~0 < 1); 4#L378-2true assume !(main_~length2~0 < 1); 14#L381-1true call main_#t~malloc216.base, main_#t~malloc216.offset := #Ultimate.allocOnHeap(main_~length1~0);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc216.base, main_#t~malloc216.offset;call main_#t~malloc217.base, main_#t~malloc217.offset := #Ultimate.allocOnHeap(main_~length2~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc217.base, main_#t~malloc217.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_~length2~0 - 1), 1);cstrcmp_#in~s1.base, cstrcmp_#in~s1.offset, cstrcmp_#in~s2.base, cstrcmp_#in~s2.offset := main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;havoc cstrcmp_#res;havoc cstrcmp_#t~post209.base, cstrcmp_#t~post209.offset, cstrcmp_#t~post210.base, cstrcmp_#t~post210.offset, cstrcmp_#t~mem205, cstrcmp_#t~mem206, cstrcmp_#t~mem207, cstrcmp_#t~short208, cstrcmp_#t~mem211, cstrcmp_#t~mem212, cstrcmp_#t~ite213, cstrcmp_~s1.base, cstrcmp_~s1.offset, cstrcmp_~s2.base, cstrcmp_~s2.offset, cstrcmp_~uc1~0, cstrcmp_~uc2~0;cstrcmp_~s1.base, cstrcmp_~s1.offset := cstrcmp_#in~s1.base, cstrcmp_#in~s1.offset;cstrcmp_~s2.base, cstrcmp_~s2.offset := cstrcmp_#in~s2.base, cstrcmp_#in~s2.offset;havoc cstrcmp_~uc1~0;havoc cstrcmp_~uc2~0; 7#L367-5true [2019-01-14 02:45:42,053 INFO L796 eck$LassoCheckResult]: Loop: 7#L367-5true call cstrcmp_#t~mem205 := read~int(cstrcmp_~s1.base, cstrcmp_~s1.offset, 1);cstrcmp_#t~short208 := 0 != cstrcmp_#t~mem205; 3#L367-1true assume cstrcmp_#t~short208;call cstrcmp_#t~mem206 := read~int(cstrcmp_~s1.base, cstrcmp_~s1.offset, 1);call cstrcmp_#t~mem207 := read~int(cstrcmp_~s2.base, cstrcmp_~s2.offset, 1);cstrcmp_#t~short208 := cstrcmp_#t~mem206 == cstrcmp_#t~mem207; 5#L367-3true assume !!cstrcmp_#t~short208;havoc cstrcmp_#t~mem207;havoc cstrcmp_#t~mem205;havoc cstrcmp_#t~mem206;havoc cstrcmp_#t~short208;cstrcmp_#t~post209.base, cstrcmp_#t~post209.offset := cstrcmp_~s1.base, cstrcmp_~s1.offset;cstrcmp_~s1.base, cstrcmp_~s1.offset := cstrcmp_#t~post209.base, 1 + cstrcmp_#t~post209.offset;havoc cstrcmp_#t~post209.base, cstrcmp_#t~post209.offset;cstrcmp_#t~post210.base, cstrcmp_#t~post210.offset := cstrcmp_~s2.base, cstrcmp_~s2.offset;cstrcmp_~s2.base, cstrcmp_~s2.offset := cstrcmp_#t~post210.base, 1 + cstrcmp_#t~post210.offset;havoc cstrcmp_#t~post210.base, cstrcmp_#t~post210.offset; 7#L367-5true [2019-01-14 02:45:42,059 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:45:42,059 INFO L82 PathProgramCache]: Analyzing trace with hash 28695878, now seen corresponding path program 1 times [2019-01-14 02:45:42,061 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:45:42,061 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:45:42,101 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:45:42,101 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:45:42,102 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:45:42,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:45:42,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:45:42,207 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:45:42,208 INFO L82 PathProgramCache]: Analyzing trace with hash 49755, now seen corresponding path program 1 times [2019-01-14 02:45:42,208 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:45:42,208 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:45:42,209 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:45:42,209 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:45:42,209 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:45:42,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:45:42,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:45:42,233 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:45:42,233 INFO L82 PathProgramCache]: Analyzing trace with hash 180429558, now seen corresponding path program 1 times [2019-01-14 02:45:42,233 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:45:42,233 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:45:42,234 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:45:42,234 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:45:42,234 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:45:42,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:45:42,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:45:42,799 WARN L181 SmtUtils]: Spent 467.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 45 [2019-01-14 02:45:43,675 WARN L181 SmtUtils]: Spent 764.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 83 [2019-01-14 02:45:43,798 WARN L181 SmtUtils]: Spent 120.00 ms on a formula simplification that was a NOOP. DAG size: 77 [2019-01-14 02:45:43,814 INFO L216 LassoAnalysis]: Preferences: [2019-01-14 02:45:43,815 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-14 02:45:43,815 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-14 02:45:43,816 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-14 02:45:43,816 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-14 02:45:43,816 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 02:45:43,816 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-14 02:45:43,816 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-14 02:45:43,817 INFO L131 ssoRankerPreferences]: Filename of dumped script: cstrcmp_malloc_true-termination.c.i_Iteration1_Lasso [2019-01-14 02:45:43,818 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-14 02:45:43,818 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-14 02:45:43,843 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:45:43,875 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:45:43,881 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:45:43,884 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:45:43,891 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:45:43,897 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:45:43,903 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:45:43,910 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:45:43,918 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:45:43,925 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:45:43,927 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:45:44,439 WARN L181 SmtUtils]: Spent 360.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 66 [2019-01-14 02:45:44,672 WARN L181 SmtUtils]: Spent 172.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 56 [2019-01-14 02:45:44,673 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:45:44,678 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:45:44,679 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:45:44,681 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:45:44,685 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:45:44,690 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:45:44,692 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:45:44,694 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:45:44,696 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:45:44,709 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:45:44,715 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:45:45,079 WARN L181 SmtUtils]: Spent 134.00 ms on a formula simplification that was a NOOP. DAG size: 34 [2019-01-14 02:45:45,582 WARN L181 SmtUtils]: Spent 386.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 37 [2019-01-14 02:45:45,778 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-14 02:45:45,786 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-14 02:45:45,788 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:45:45,790 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:45:45,791 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:45:45,792 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:45:45,792 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:45:45,792 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:45:45,795 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:45:45,795 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:45:45,797 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:45:45,798 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:45:45,798 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:45:45,799 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:45:45,799 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:45:45,799 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:45:45,799 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:45:45,800 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:45:45,800 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:45:45,801 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:45:45,801 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:45:45,802 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:45:45,802 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:45:45,802 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:45:45,802 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:45:45,802 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:45:45,803 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:45:45,803 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:45:45,806 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:45:45,807 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:45:45,807 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:45:45,808 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:45:45,808 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:45:45,808 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:45:45,808 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:45:45,808 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:45:45,809 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:45:45,809 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:45:45,810 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:45:45,810 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:45:45,810 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:45:45,811 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:45:45,813 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:45:45,815 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:45:45,816 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:45:45,821 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:45:45,824 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:45:45,825 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:45:45,825 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:45:45,825 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:45:45,826 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:45:45,826 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:45:45,826 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:45:45,826 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:45:45,832 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:45:45,833 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:45:45,835 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:45:45,835 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:45:45,836 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:45:45,836 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:45:45,836 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:45:45,837 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:45:45,838 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:45:45,840 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:45:45,840 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:45:45,840 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:45:45,841 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:45:45,841 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:45:45,841 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:45:45,841 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:45:45,842 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:45:45,842 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:45:45,843 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:45:45,843 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:45:45,844 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:45:45,844 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:45:45,844 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:45:45,844 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:45:45,846 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:45:45,846 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:45:45,849 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:45:45,850 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:45:45,850 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:45:45,850 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:45:45,851 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:45:45,851 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:45:45,851 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:45:45,851 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:45:45,851 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:45:45,852 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:45:45,853 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:45:45,853 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:45:45,853 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:45:45,853 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:45:45,854 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:45:45,856 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:45:45,856 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:45:45,861 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:45:45,861 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:45:45,862 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:45:45,862 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:45:45,862 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:45:45,862 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:45:45,865 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:45:45,865 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:45:45,888 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:45:45,889 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:45:45,889 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:45:45,889 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:45:45,890 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:45:45,893 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:45:45,894 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:45:45,895 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:45:45,901 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:45:45,901 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:45:45,902 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:45:45,902 INFO L205 nArgumentSynthesizer]: 4 stem disjuncts [2019-01-14 02:45:45,902 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:45:45,902 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:45:45,924 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2019-01-14 02:45:45,924 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:45:46,022 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:45:46,023 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:45:46,023 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:45:46,024 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:45:46,024 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:45:46,024 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2019-01-14 02:45:46,024 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:45:46,025 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-01-14 02:45:46,025 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:45:46,032 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:45:46,033 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:45:46,033 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:45:46,033 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:45:46,033 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:45:46,034 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:45:46,035 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:45:46,036 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:45:46,044 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:45:46,045 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:45:46,045 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:45:46,046 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:45:46,046 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:45:46,046 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:45:46,047 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:45:46,047 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:45:46,049 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:45:46,050 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:45:46,050 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:45:46,050 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:45:46,051 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:45:46,051 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:45:46,056 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:45:46,056 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:45:46,144 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-14 02:45:46,191 INFO L443 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. [2019-01-14 02:45:46,192 INFO L444 ModelExtractionUtils]: 30 out of 37 variables were initially zero. Simplification set additionally 4 variables to zero. [2019-01-14 02:45:46,200 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-14 02:45:46,202 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-01-14 02:45:46,202 INFO L518 LassoAnalysis]: Proved termination. [2019-01-14 02:45:46,204 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_cstrcmp_~s1.offset, v_rep(select #length ULTIMATE.start_main_#t~malloc216.base)_1) = -1*ULTIMATE.start_cstrcmp_~s1.offset + 1*v_rep(select #length ULTIMATE.start_main_#t~malloc216.base)_1 Supporting invariants [] [2019-01-14 02:45:46,361 INFO L297 tatePredicateManager]: 15 out of 16 supporting invariants were superfluous and have been removed [2019-01-14 02:45:46,371 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2019-01-14 02:45:46,408 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:45:46,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:45:46,443 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:45:46,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:45:46,459 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:45:46,507 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:45:46,520 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:45:46,521 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 15 states. Second operand 3 states. [2019-01-14 02:45:46,603 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 15 states.. Second operand 3 states. Result 32 states and 41 transitions. Complement of second has 5 states. [2019-01-14 02:45:46,607 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2019-01-14 02:45:46,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-01-14 02:45:46,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 27 transitions. [2019-01-14 02:45:46,611 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 27 transitions. Stem has 5 letters. Loop has 3 letters. [2019-01-14 02:45:46,612 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:45:46,613 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 27 transitions. Stem has 8 letters. Loop has 3 letters. [2019-01-14 02:45:46,613 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:45:46,613 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 27 transitions. Stem has 5 letters. Loop has 6 letters. [2019-01-14 02:45:46,613 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:45:46,614 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 32 states and 41 transitions. [2019-01-14 02:45:46,617 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-01-14 02:45:46,620 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 32 states to 0 states and 0 transitions. [2019-01-14 02:45:46,621 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2019-01-14 02:45:46,621 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2019-01-14 02:45:46,622 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2019-01-14 02:45:46,622 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-14 02:45:46,622 INFO L706 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-14 02:45:46,622 INFO L729 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-14 02:45:46,622 INFO L609 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-14 02:45:46,622 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2019-01-14 02:45:46,623 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2019-01-14 02:45:46,623 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-01-14 02:45:46,623 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2019-01-14 02:45:46,629 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 14.01 02:45:46 BoogieIcfgContainer [2019-01-14 02:45:46,629 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2019-01-14 02:45:46,629 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-14 02:45:46,629 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-14 02:45:46,630 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-14 02:45:46,630 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 02:45:41" (3/4) ... [2019-01-14 02:45:46,633 INFO L147 WitnessPrinter]: No result that supports witness generation found [2019-01-14 02:45:46,633 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-14 02:45:46,634 INFO L168 Benchmark]: Toolchain (without parser) took 5976.99 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 224.4 MB). Free memory was 951.3 MB in the beginning and 1.1 GB in the end (delta: -163.9 MB). Peak memory consumption was 60.5 MB. Max. memory is 11.5 GB. [2019-01-14 02:45:46,635 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-14 02:45:46,635 INFO L168 Benchmark]: CACSL2BoogieTranslator took 775.50 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 159.9 MB). Free memory was 946.0 MB in the beginning and 1.1 GB in the end (delta: -186.4 MB). Peak memory consumption was 24.4 MB. Max. memory is 11.5 GB. [2019-01-14 02:45:46,636 INFO L168 Benchmark]: Boogie Procedure Inliner took 47.46 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:45:46,636 INFO L168 Benchmark]: Boogie Preprocessor took 30.15 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:45:46,637 INFO L168 Benchmark]: RCFGBuilder took 421.88 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 19.2 MB). Peak memory consumption was 19.2 MB. Max. memory is 11.5 GB. [2019-01-14 02:45:46,638 INFO L168 Benchmark]: BuchiAutomizer took 4693.21 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 64.5 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -2.1 MB). Peak memory consumption was 62.4 MB. Max. memory is 11.5 GB. [2019-01-14 02:45:46,641 INFO L168 Benchmark]: Witness Printer took 3.62 ms. Allocated memory is still 1.3 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-14 02:45:46,646 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 775.50 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 159.9 MB). Free memory was 946.0 MB in the beginning and 1.1 GB in the end (delta: -186.4 MB). Peak memory consumption was 24.4 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 47.46 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 30.15 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 421.88 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 19.2 MB). Peak memory consumption was 19.2 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 4693.21 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 64.5 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -2.1 MB). Peak memory consumption was 62.4 MB. Max. memory is 11.5 GB. * Witness Printer took 3.62 ms. Allocated memory is still 1.3 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #length * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 1 terminating modules (0 trivial, 1 deterministic, 0 nondeterministic). One deterministic module has affine ranking function -1 * s1 + unknown-#length-unknown[malloc(length1 * sizeof(char))] and consists of 4 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 4.6s and 2 iterations. TraceHistogramMax:1. Analysis of lassos took 4.3s. 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: 15 SDtfs, 27 SDslu, 8 SDs, 0 SdLazy, 7 SolverSat, 4 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc0 concLT0 SILN0 SILU0 SILI0 SILT0 lasso1 LassoPreprocessingBenchmarks: Lassos: inital213 mio100 ax100 hnf99 lsp97 ukn85 mio100 lsp40 div100 bol100 ite100 ukn100 eq192 hnf88 smp100 dnf200 smp97 tf100 neg96 sie112 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 121ms VariablesStem: 9 VariablesLoop: 8 DisjunctsStem: 4 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 12 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! Received shutdown request...