./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/termination-15/cstrncmp_malloc.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 30f4e4ab Calling Ultimate with: /usr/bin/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 ../sv-benchmarks/c/termination-15/cstrncmp_malloc.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 56be9dfe64f940b7419bf11610ecc3d24973c46d .................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-30f4e4a [2019-11-28 03:03:56,967 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-28 03:03:56,970 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-28 03:03:56,983 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-28 03:03:56,984 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-28 03:03:56,985 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-28 03:03:56,987 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-28 03:03:56,989 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-28 03:03:56,991 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-28 03:03:56,992 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-28 03:03:56,994 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-28 03:03:56,995 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-28 03:03:56,996 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-28 03:03:56,997 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-28 03:03:56,998 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-28 03:03:57,000 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-28 03:03:57,001 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-28 03:03:57,002 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-28 03:03:57,005 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-28 03:03:57,009 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-28 03:03:57,012 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-28 03:03:57,016 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-28 03:03:57,019 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-28 03:03:57,020 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-28 03:03:57,024 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-28 03:03:57,024 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-28 03:03:57,024 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-28 03:03:57,026 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-28 03:03:57,028 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-28 03:03:57,029 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-28 03:03:57,030 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-28 03:03:57,031 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-28 03:03:57,032 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-28 03:03:57,033 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-28 03:03:57,038 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-28 03:03:57,038 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-28 03:03:57,039 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-28 03:03:57,039 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-28 03:03:57,040 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-28 03:03:57,042 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-28 03:03:57,044 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-28 03:03:57,045 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf [2019-11-28 03:03:57,076 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-28 03:03:57,076 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-28 03:03:57,080 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-28 03:03:57,080 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-28 03:03:57,080 INFO L138 SettingsManager]: * Use SBE=true [2019-11-28 03:03:57,081 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-11-28 03:03:57,081 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-11-28 03:03:57,081 INFO L138 SettingsManager]: * Use old map elimination=false [2019-11-28 03:03:57,081 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2019-11-28 03:03:57,081 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2019-11-28 03:03:57,083 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-11-28 03:03:57,083 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-28 03:03:57,083 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-11-28 03:03:57,084 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-28 03:03:57,084 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-28 03:03:57,084 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-11-28 03:03:57,084 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-11-28 03:03:57,085 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-11-28 03:03:57,085 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-28 03:03:57,085 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-11-28 03:03:57,085 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-28 03:03:57,085 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-11-28 03:03:57,086 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-28 03:03:57,086 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-28 03:03:57,086 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-11-28 03:03:57,086 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-28 03:03:57,087 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-28 03:03:57,087 INFO L138 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-11-28 03:03:57,088 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-11-28 03:03:57,088 INFO L138 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 -> 56be9dfe64f940b7419bf11610ecc3d24973c46d [2019-11-28 03:03:57,407 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-28 03:03:57,423 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-28 03:03:57,426 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-28 03:03:57,427 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-28 03:03:57,428 INFO L275 PluginConnector]: CDTParser initialized [2019-11-28 03:03:57,428 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/termination-15/cstrncmp_malloc.i [2019-11-28 03:03:57,502 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/34d6761e9/7ee1a826401640049bdaed09026a9810/FLAGc922c5184 [2019-11-28 03:03:58,054 INFO L306 CDTParser]: Found 1 translation units. [2019-11-28 03:03:58,055 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-15/cstrncmp_malloc.i [2019-11-28 03:03:58,070 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/34d6761e9/7ee1a826401640049bdaed09026a9810/FLAGc922c5184 [2019-11-28 03:03:58,426 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/34d6761e9/7ee1a826401640049bdaed09026a9810 [2019-11-28 03:03:58,430 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-28 03:03:58,431 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-28 03:03:58,433 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-28 03:03:58,433 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-28 03:03:58,437 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-28 03:03:58,438 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 03:03:58" (1/1) ... [2019-11-28 03:03:58,441 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@75c5318a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:03:58, skipping insertion in model container [2019-11-28 03:03:58,442 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 03:03:58" (1/1) ... [2019-11-28 03:03:58,449 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-28 03:03:58,486 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-28 03:03:58,942 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 03:03:58,957 INFO L203 MainTranslator]: Completed pre-run [2019-11-28 03:03:59,041 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 03:03:59,127 INFO L208 MainTranslator]: Completed translation [2019-11-28 03:03:59,128 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:03:59 WrapperNode [2019-11-28 03:03:59,128 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-28 03:03:59,129 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-28 03:03:59,129 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-28 03:03:59,130 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-28 03:03:59,138 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:03:59" (1/1) ... [2019-11-28 03:03:59,156 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:03:59" (1/1) ... [2019-11-28 03:03:59,176 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-28 03:03:59,176 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-28 03:03:59,177 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-28 03:03:59,177 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-28 03:03:59,184 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:03:59" (1/1) ... [2019-11-28 03:03:59,184 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:03:59" (1/1) ... [2019-11-28 03:03:59,187 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:03:59" (1/1) ... [2019-11-28 03:03:59,187 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:03:59" (1/1) ... [2019-11-28 03:03:59,193 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:03:59" (1/1) ... [2019-11-28 03:03:59,198 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:03:59" (1/1) ... [2019-11-28 03:03:59,200 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:03:59" (1/1) ... [2019-11-28 03:03:59,202 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-28 03:03:59,203 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-28 03:03:59,203 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-28 03:03:59,203 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-28 03:03:59,204 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:03:59" (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-11-28 03:03:59,271 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-11-28 03:03:59,271 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-11-28 03:03:59,272 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-11-28 03:03:59,272 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-28 03:03:59,272 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-28 03:03:59,272 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-28 03:03:59,622 INFO L292 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-28 03:03:59,622 INFO L297 CfgBuilder]: Removed 7 assume(true) statements. [2019-11-28 03:03:59,623 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 03:03:59 BoogieIcfgContainer [2019-11-28 03:03:59,624 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-28 03:03:59,624 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-11-28 03:03:59,625 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-11-28 03:03:59,628 INFO L275 PluginConnector]: BuchiAutomizer initialized [2019-11-28 03:03:59,629 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-28 03:03:59,629 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 28.11 03:03:58" (1/3) ... [2019-11-28 03:03:59,630 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@1d22d6fd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 28.11 03:03:59, skipping insertion in model container [2019-11-28 03:03:59,630 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-28 03:03:59,631 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:03:59" (2/3) ... [2019-11-28 03:03:59,631 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@1d22d6fd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 28.11 03:03:59, skipping insertion in model container [2019-11-28 03:03:59,631 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-28 03:03:59,632 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 03:03:59" (3/3) ... [2019-11-28 03:03:59,633 INFO L371 chiAutomizerObserver]: Analyzing ICFG cstrncmp_malloc.i [2019-11-28 03:03:59,671 INFO L356 BuchiCegarLoop]: Interprodecural is true [2019-11-28 03:03:59,671 INFO L357 BuchiCegarLoop]: Hoare is false [2019-11-28 03:03:59,671 INFO L358 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-11-28 03:03:59,671 INFO L359 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-28 03:03:59,671 INFO L360 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-28 03:03:59,672 INFO L361 BuchiCegarLoop]: Difference is false [2019-11-28 03:03:59,672 INFO L362 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-28 03:03:59,672 INFO L365 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-11-28 03:03:59,684 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states. [2019-11-28 03:03:59,704 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2019-11-28 03:03:59,704 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 03:03:59,705 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 03:03:59,710 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2019-11-28 03:03:59,710 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2019-11-28 03:03:59,710 INFO L424 BuchiCegarLoop]: ======== Iteration 1============ [2019-11-28 03:03:59,710 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states. [2019-11-28 03:03:59,712 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2019-11-28 03:03:59,712 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 03:03:59,712 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 03:03:59,713 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2019-11-28 03:03:59,713 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2019-11-28 03:03:59,719 INFO L794 eck$LassoCheckResult]: Stem: 13#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 11#L-1true havoc main_#res;havoc main_#t~nondet216, main_#t~nondet217, main_#t~malloc218.base, main_#t~malloc218.offset, main_#t~malloc219.base, main_#t~malloc219.offset, main_#t~nondet220, main_#t~ret221, 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~nondet216;havoc main_#t~nondet216;main_~length2~0 := main_#t~nondet217;havoc main_#t~nondet217; 12#L382true assume !(main_~length1~0 < 1); 15#L382-2true assume !(main_~length2~0 < 1); 10#L385-1true call main_#t~malloc218.base, main_#t~malloc218.offset := #Ultimate.allocOnHeap(main_~length1~0);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc218.base, main_#t~malloc218.offset;call main_#t~malloc219.base, main_#t~malloc219.offset := #Ultimate.allocOnHeap(main_~length2~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc219.base, main_#t~malloc219.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);cstrncmp_#in~s1.base, cstrncmp_#in~s1.offset, cstrncmp_#in~s2.base, cstrncmp_#in~s2.offset, cstrncmp_#in~n := main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset, main_#t~nondet220;havoc cstrncmp_#res;havoc cstrncmp_#t~mem209, cstrncmp_#t~short210, cstrncmp_#t~post211.base, cstrncmp_#t~post211.offset, cstrncmp_#t~post212.base, cstrncmp_#t~post212.offset, cstrncmp_#t~post205, cstrncmp_#t~mem206, cstrncmp_#t~mem207, cstrncmp_#t~short208, cstrncmp_#t~mem213, cstrncmp_#t~mem214, cstrncmp_#t~ite215, cstrncmp_~s1.base, cstrncmp_~s1.offset, cstrncmp_~s2.base, cstrncmp_~s2.offset, cstrncmp_~n, cstrncmp_~uc1~0, cstrncmp_~uc2~0;cstrncmp_~s1.base, cstrncmp_~s1.offset := cstrncmp_#in~s1.base, cstrncmp_#in~s1.offset;cstrncmp_~s2.base, cstrncmp_~s2.offset := cstrncmp_#in~s2.base, cstrncmp_#in~s2.offset;cstrncmp_~n := cstrncmp_#in~n;havoc cstrncmp_~uc1~0;havoc cstrncmp_~uc2~0; 20#L367true assume !(0 == cstrncmp_~n); 6#L369-5true [2019-11-28 03:03:59,720 INFO L796 eck$LassoCheckResult]: Loop: 6#L369-5true cstrncmp_#t~post205 := cstrncmp_~n;cstrncmp_~n := cstrncmp_#t~post205 - 1;cstrncmp_#t~short208 := cstrncmp_#t~post205 > 0; 17#L369-1true assume cstrncmp_#t~short208;call cstrncmp_#t~mem206 := read~int(cstrncmp_~s1.base, cstrncmp_~s1.offset, 1);call cstrncmp_#t~mem207 := read~int(cstrncmp_~s2.base, cstrncmp_~s2.offset, 1);cstrncmp_#t~short208 := cstrncmp_#t~mem206 == cstrncmp_#t~mem207; 4#L369-3true assume !!cstrncmp_#t~short208;havoc cstrncmp_#t~mem207;havoc cstrncmp_#t~mem206;havoc cstrncmp_#t~post205;havoc cstrncmp_#t~short208;cstrncmp_#t~short210 := 0 == cstrncmp_~n; 14#L370true assume cstrncmp_#t~short210; 19#L370-2true assume !cstrncmp_#t~short210;havoc cstrncmp_#t~short210;havoc cstrncmp_#t~mem209;cstrncmp_#t~post211.base, cstrncmp_#t~post211.offset := cstrncmp_~s1.base, cstrncmp_~s1.offset;cstrncmp_~s1.base, cstrncmp_~s1.offset := cstrncmp_#t~post211.base, 1 + cstrncmp_#t~post211.offset;havoc cstrncmp_#t~post211.base, cstrncmp_#t~post211.offset;cstrncmp_#t~post212.base, cstrncmp_#t~post212.offset := cstrncmp_~s2.base, cstrncmp_~s2.offset;cstrncmp_~s2.base, cstrncmp_~s2.offset := cstrncmp_#t~post212.base, 1 + cstrncmp_#t~post212.offset;havoc cstrncmp_#t~post212.base, cstrncmp_#t~post212.offset; 6#L369-5true [2019-11-28 03:03:59,726 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:03:59,726 INFO L82 PathProgramCache]: Analyzing trace with hash 889572238, now seen corresponding path program 1 times [2019-11-28 03:03:59,732 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 03:03:59,733 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [49105003] [2019-11-28 03:03:59,733 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 03:03:59,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:03:59,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:03:59,888 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 03:03:59,889 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:03:59,889 INFO L82 PathProgramCache]: Analyzing trace with hash 52587176, now seen corresponding path program 1 times [2019-11-28 03:03:59,890 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 03:03:59,890 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [672498718] [2019-11-28 03:03:59,890 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 03:03:59,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 03:03:59,946 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 03:03:59,947 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [672498718] [2019-11-28 03:03:59,948 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 03:03:59,948 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 03:03:59,948 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1676869291] [2019-11-28 03:03:59,953 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-11-28 03:03:59,954 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 03:03:59,967 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 03:03:59,967 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 03:03:59,969 INFO L87 Difference]: Start difference. First operand 18 states. Second operand 3 states. [2019-11-28 03:04:00,014 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 03:04:00,014 INFO L93 Difference]: Finished difference Result 19 states and 26 transitions. [2019-11-28 03:04:00,014 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 03:04:00,016 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 19 states and 26 transitions. [2019-11-28 03:04:00,018 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2019-11-28 03:04:00,022 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 19 states to 11 states and 14 transitions. [2019-11-28 03:04:00,024 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2019-11-28 03:04:00,024 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2019-11-28 03:04:00,025 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 14 transitions. [2019-11-28 03:04:00,025 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-28 03:04:00,025 INFO L688 BuchiCegarLoop]: Abstraction has 11 states and 14 transitions. [2019-11-28 03:04:00,038 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states and 14 transitions. [2019-11-28 03:04:00,045 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2019-11-28 03:04:00,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2019-11-28 03:04:00,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 14 transitions. [2019-11-28 03:04:00,047 INFO L711 BuchiCegarLoop]: Abstraction has 11 states and 14 transitions. [2019-11-28 03:04:00,047 INFO L591 BuchiCegarLoop]: Abstraction has 11 states and 14 transitions. [2019-11-28 03:04:00,047 INFO L424 BuchiCegarLoop]: ======== Iteration 2============ [2019-11-28 03:04:00,047 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 11 states and 14 transitions. [2019-11-28 03:04:00,048 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2019-11-28 03:04:00,048 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 03:04:00,048 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 03:04:00,049 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2019-11-28 03:04:00,049 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2019-11-28 03:04:00,049 INFO L794 eck$LassoCheckResult]: Stem: 51#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 46#L-1 havoc main_#res;havoc main_#t~nondet216, main_#t~nondet217, main_#t~malloc218.base, main_#t~malloc218.offset, main_#t~malloc219.base, main_#t~malloc219.offset, main_#t~nondet220, main_#t~ret221, 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~nondet216;havoc main_#t~nondet216;main_~length2~0 := main_#t~nondet217;havoc main_#t~nondet217; 47#L382 assume !(main_~length1~0 < 1); 50#L382-2 assume !(main_~length2~0 < 1); 55#L385-1 call main_#t~malloc218.base, main_#t~malloc218.offset := #Ultimate.allocOnHeap(main_~length1~0);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc218.base, main_#t~malloc218.offset;call main_#t~malloc219.base, main_#t~malloc219.offset := #Ultimate.allocOnHeap(main_~length2~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc219.base, main_#t~malloc219.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);cstrncmp_#in~s1.base, cstrncmp_#in~s1.offset, cstrncmp_#in~s2.base, cstrncmp_#in~s2.offset, cstrncmp_#in~n := main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset, main_#t~nondet220;havoc cstrncmp_#res;havoc cstrncmp_#t~mem209, cstrncmp_#t~short210, cstrncmp_#t~post211.base, cstrncmp_#t~post211.offset, cstrncmp_#t~post212.base, cstrncmp_#t~post212.offset, cstrncmp_#t~post205, cstrncmp_#t~mem206, cstrncmp_#t~mem207, cstrncmp_#t~short208, cstrncmp_#t~mem213, cstrncmp_#t~mem214, cstrncmp_#t~ite215, cstrncmp_~s1.base, cstrncmp_~s1.offset, cstrncmp_~s2.base, cstrncmp_~s2.offset, cstrncmp_~n, cstrncmp_~uc1~0, cstrncmp_~uc2~0;cstrncmp_~s1.base, cstrncmp_~s1.offset := cstrncmp_#in~s1.base, cstrncmp_#in~s1.offset;cstrncmp_~s2.base, cstrncmp_~s2.offset := cstrncmp_#in~s2.base, cstrncmp_#in~s2.offset;cstrncmp_~n := cstrncmp_#in~n;havoc cstrncmp_~uc1~0;havoc cstrncmp_~uc2~0; 56#L367 assume !(0 == cstrncmp_~n); 53#L369-5 [2019-11-28 03:04:00,050 INFO L796 eck$LassoCheckResult]: Loop: 53#L369-5 cstrncmp_#t~post205 := cstrncmp_~n;cstrncmp_~n := cstrncmp_#t~post205 - 1;cstrncmp_#t~short208 := cstrncmp_#t~post205 > 0; 54#L369-1 assume cstrncmp_#t~short208;call cstrncmp_#t~mem206 := read~int(cstrncmp_~s1.base, cstrncmp_~s1.offset, 1);call cstrncmp_#t~mem207 := read~int(cstrncmp_~s2.base, cstrncmp_~s2.offset, 1);cstrncmp_#t~short208 := cstrncmp_#t~mem206 == cstrncmp_#t~mem207; 48#L369-3 assume !!cstrncmp_#t~short208;havoc cstrncmp_#t~mem207;havoc cstrncmp_#t~mem206;havoc cstrncmp_#t~post205;havoc cstrncmp_#t~short208;cstrncmp_#t~short210 := 0 == cstrncmp_~n; 49#L370 assume !cstrncmp_#t~short210;call cstrncmp_#t~mem209 := read~int(cstrncmp_~s1.base, cstrncmp_~s1.offset, 1);cstrncmp_#t~short210 := 0 == cstrncmp_#t~mem209; 52#L370-2 assume !cstrncmp_#t~short210;havoc cstrncmp_#t~short210;havoc cstrncmp_#t~mem209;cstrncmp_#t~post211.base, cstrncmp_#t~post211.offset := cstrncmp_~s1.base, cstrncmp_~s1.offset;cstrncmp_~s1.base, cstrncmp_~s1.offset := cstrncmp_#t~post211.base, 1 + cstrncmp_#t~post211.offset;havoc cstrncmp_#t~post211.base, cstrncmp_#t~post211.offset;cstrncmp_#t~post212.base, cstrncmp_#t~post212.offset := cstrncmp_~s2.base, cstrncmp_~s2.offset;cstrncmp_~s2.base, cstrncmp_~s2.offset := cstrncmp_#t~post212.base, 1 + cstrncmp_#t~post212.offset;havoc cstrncmp_#t~post212.base, cstrncmp_#t~post212.offset; 53#L369-5 [2019-11-28 03:04:00,050 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:04:00,050 INFO L82 PathProgramCache]: Analyzing trace with hash 889572238, now seen corresponding path program 2 times [2019-11-28 03:04:00,050 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 03:04:00,051 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1364071058] [2019-11-28 03:04:00,051 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 03:04:00,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:04:00,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:04:00,105 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 03:04:00,105 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:04:00,105 INFO L82 PathProgramCache]: Analyzing trace with hash 52587238, now seen corresponding path program 1 times [2019-11-28 03:04:00,106 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 03:04:00,106 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2032492254] [2019-11-28 03:04:00,106 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 03:04:00,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:04:00,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:04:00,141 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 03:04:00,141 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:04:00,141 INFO L82 PathProgramCache]: Analyzing trace with hash -2120298631, now seen corresponding path program 1 times [2019-11-28 03:04:00,141 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 03:04:00,143 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [160635819] [2019-11-28 03:04:00,143 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 03:04:00,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:04:00,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:04:00,249 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 03:04:00,510 WARN L192 SmtUtils]: Spent 255.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 59 [2019-11-28 03:04:00,978 WARN L192 SmtUtils]: Spent 385.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 91 [2019-11-28 03:04:01,144 WARN L192 SmtUtils]: Spent 161.00 ms on a formula simplification that was a NOOP. DAG size: 85 [2019-11-28 03:04:01,157 INFO L210 LassoAnalysis]: Preferences: [2019-11-28 03:04:01,158 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2019-11-28 03:04:01,158 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-28 03:04:01,159 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2019-11-28 03:04:01,159 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2019-11-28 03:04:01,159 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:04:01,159 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-28 03:04:01,159 INFO L132 ssoRankerPreferences]: Path of dumped script: [2019-11-28 03:04:01,160 INFO L133 ssoRankerPreferences]: Filename of dumped script: cstrncmp_malloc.i_Iteration2_Lasso [2019-11-28 03:04:01,160 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-28 03:04:01,160 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-28 03:04:01,185 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:04:01,192 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:04:01,195 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:04:01,200 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:04:01,221 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:04:01,226 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:04:01,230 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:04:01,234 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:04:01,236 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:04:01,663 WARN L192 SmtUtils]: Spent 251.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 67 [2019-11-28 03:04:01,854 WARN L192 SmtUtils]: Spent 166.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 56 [2019-11-28 03:04:01,856 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:04:01,861 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:04:01,866 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:04:01,871 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:04:01,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-11-28 03:04:01,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-11-28 03:04:01,885 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:04:01,889 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:04:01,893 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:04:01,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-11-28 03:04:01,900 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:04:01,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-11-28 03:04:01,906 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:04:01,909 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:04:01,912 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:04:01,916 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:04:03,104 WARN L192 SmtUtils]: Spent 549.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 38 [2019-11-28 03:04:03,180 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-28 03:04:03,185 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 03:04:03,196 INFO L120 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-11-28 03:04:03,198 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:04:03,199 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 03:04:03,199 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:04:03,200 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:04:03,200 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:04:03,202 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 03:04:03,202 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:04:03,222 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 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 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:04:03,248 INFO L120 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-11-28 03:04:03,250 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:04:03,250 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 03:04:03,250 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:04:03,250 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:04:03,251 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:04:03,264 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 03:04:03,265 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 03:04:03,267 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 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 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:04:03,277 INFO L120 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-11-28 03:04:03,278 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:04:03,278 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 03:04:03,279 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:04:03,279 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:04:03,279 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:04:03,280 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 03:04:03,280 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 03:04:03,282 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 03:04:03,297 INFO L120 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-11-28 03:04:03,299 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:04:03,299 INFO L203 nArgumentSynthesizer]: 2 stem disjuncts [2019-11-28 03:04:03,299 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:04:03,299 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:04:03,310 INFO L401 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2019-11-28 03:04:03,310 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:04:03,320 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-28 03:04:03,377 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2019-11-28 03:04:03,377 INFO L444 ModelExtractionUtils]: 4 out of 13 variables were initially zero. Simplification set additionally 7 variables to zero. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 03:04:03,415 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... Waiting until toolchain timeout for monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:04:03,419 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-11-28 03:04:03,419 INFO L510 LassoAnalysis]: Proved termination. [2019-11-28 03:04:03,420 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_cstrncmp_~n) = 1*ULTIMATE.start_cstrncmp_~n Supporting invariants [] [2019-11-28 03:04:03,514 INFO L297 tatePredicateManager]: 16 out of 16 supporting invariants were superfluous and have been removed [2019-11-28 03:04:03,532 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:04:03,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 03:04:03,555 INFO L255 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-28 03:04:03,556 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 03:04:03,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 03:04:03,578 INFO L255 TraceCheckSpWp]: Trace formula consists of 40 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-28 03:04:03,579 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 03:04:03,584 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 03:04:03,632 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 03:04:03,636 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2019-11-28 03:04:03,637 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 11 states and 14 transitions. cyclomatic complexity: 4 Second operand 4 states. [2019-11-28 03:04:03,697 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 11 states and 14 transitions. cyclomatic complexity: 4. Second operand 4 states. Result 21 states and 26 transitions. Complement of second has 6 states. [2019-11-28 03:04:03,698 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2019-11-28 03:04:03,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-11-28 03:04:03,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 17 transitions. [2019-11-28 03:04:03,702 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 17 transitions. Stem has 6 letters. Loop has 5 letters. [2019-11-28 03:04:03,703 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 03:04:03,703 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 17 transitions. Stem has 11 letters. Loop has 5 letters. [2019-11-28 03:04:03,704 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 03:04:03,704 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 17 transitions. Stem has 6 letters. Loop has 10 letters. [2019-11-28 03:04:03,704 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 03:04:03,705 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 21 states and 26 transitions. [2019-11-28 03:04:03,706 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-11-28 03:04:03,706 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 21 states to 0 states and 0 transitions. [2019-11-28 03:04:03,706 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2019-11-28 03:04:03,707 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2019-11-28 03:04:03,707 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2019-11-28 03:04:03,707 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-28 03:04:03,707 INFO L688 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-28 03:04:03,707 INFO L711 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-28 03:04:03,707 INFO L591 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-28 03:04:03,707 INFO L424 BuchiCegarLoop]: ======== Iteration 3============ [2019-11-28 03:04:03,707 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2019-11-28 03:04:03,708 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-11-28 03:04:03,708 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2019-11-28 03:04:03,715 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 28.11 03:04:03 BoogieIcfgContainer [2019-11-28 03:04:03,715 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2019-11-28 03:04:03,716 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-28 03:04:03,716 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-28 03:04:03,716 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-28 03:04:03,717 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 03:03:59" (3/4) ... [2019-11-28 03:04:03,721 INFO L140 WitnessPrinter]: No result that supports witness generation found [2019-11-28 03:04:03,721 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-28 03:04:03,723 INFO L168 Benchmark]: Toolchain (without parser) took 5291.89 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 217.6 MB). Free memory was 961.7 MB in the beginning and 1.0 GB in the end (delta: -51.2 MB). Peak memory consumption was 166.4 MB. Max. memory is 11.5 GB. [2019-11-28 03:04:03,724 INFO L168 Benchmark]: CDTParser took 0.25 ms. Allocated memory is still 1.0 GB. Free memory is still 987.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-28 03:04:03,725 INFO L168 Benchmark]: CACSL2BoogieTranslator took 696.06 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 143.1 MB). Free memory was 961.7 MB in the beginning and 1.1 GB in the end (delta: -149.9 MB). Peak memory consumption was 21.0 MB. Max. memory is 11.5 GB. [2019-11-28 03:04:03,726 INFO L168 Benchmark]: Boogie Procedure Inliner took 46.97 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-11-28 03:04:03,726 INFO L168 Benchmark]: Boogie Preprocessor took 25.95 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-11-28 03:04:03,727 INFO L168 Benchmark]: RCFGBuilder took 421.05 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: 25.9 MB). Peak memory consumption was 25.9 MB. Max. memory is 11.5 GB. [2019-11-28 03:04:03,728 INFO L168 Benchmark]: BuchiAutomizer took 4091.22 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 74.4 MB). Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 64.9 MB). Peak memory consumption was 139.3 MB. Max. memory is 11.5 GB. [2019-11-28 03:04:03,729 INFO L168 Benchmark]: Witness Printer took 5.36 ms. Allocated memory is still 1.2 GB. Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 7.9 MB). Peak memory consumption was 7.9 MB. Max. memory is 11.5 GB. [2019-11-28 03:04:03,734 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.25 ms. Allocated memory is still 1.0 GB. Free memory is still 987.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 696.06 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 143.1 MB). Free memory was 961.7 MB in the beginning and 1.1 GB in the end (delta: -149.9 MB). Peak memory consumption was 21.0 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 46.97 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 25.95 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.05 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: 25.9 MB). Peak memory consumption was 25.9 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 4091.22 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 74.4 MB). Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 64.9 MB). Peak memory consumption was 139.3 MB. Max. memory is 11.5 GB. * Witness Printer took 5.36 ms. Allocated memory is still 1.2 GB. Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 7.9 MB). Peak memory consumption was 7.9 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 2 terminating modules (1 trivial, 1 deterministic, 0 nondeterministic). One deterministic module has affine ranking function n and consists of 4 locations. 1 modules have a trivial ranking function, the largest among these consists of 3 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 4.0s and 3 iterations. TraceHistogramMax:1. Analysis of lassos took 3.7s. Construction of modules took 0.0s. Büchi inclusion checks took 0.1s. Highest rank in rank-based complementation 3. Minimization of det autom 2. Minimization of nondet autom 0. Automata minimization 0.0s AutomataMinimizationTime, 1 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 11 states and ocurred in iteration 1. Nontrivial modules had stage [1, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 34 SDtfs, 12 SDslu, 23 SDs, 0 SdLazy, 15 SolverSat, 4 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time LassoAnalysisResults: nont0 unkn0 SFLI1 SFLT0 conc0 concLT0 SILN0 SILU0 SILI0 SILT0 lasso1 LassoPreprocessingBenchmarks: Lassos: inital238 mio100 ax100 hnf99 lsp88 ukn86 mio100 lsp44 div100 bol100 ite100 ukn100 eq197 hnf87 smp100 dnf182 smp91 tf100 neg96 sie111 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: sat Degree: 0 Time: 135ms VariablesStem: 3 VariablesLoop: 2 DisjunctsStem: 2 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 8 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...