./Ultimate.py --spec /storage/repos/svcomp/c/properties/termination.prp --file /storage/repos/svcomp/c/ldv-memsafety/memleaks_test18_2_false-valid-memtrack_true-termination.i --full-output --architecture 32bit -------------------------------------------------------------------------------- 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/ldv-memsafety/memleaks_test18_2_false-valid-memtrack_true-termination.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-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 32bit --witnessprinter.graph.data.programhash 12e277c835ccbb2e237f5234b2aa8358e814750b ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ 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 04:59:49,269 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-14 04:59:49,271 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-14 04:59:49,283 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-14 04:59:49,283 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-14 04:59:49,284 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-14 04:59:49,286 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-14 04:59:49,287 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-14 04:59:49,289 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-14 04:59:49,290 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-14 04:59:49,291 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-14 04:59:49,291 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-14 04:59:49,292 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-14 04:59:49,293 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-14 04:59:49,294 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-14 04:59:49,295 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-14 04:59:49,296 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-14 04:59:49,298 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-14 04:59:49,300 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-14 04:59:49,301 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-14 04:59:49,303 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-14 04:59:49,304 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-14 04:59:49,306 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-14 04:59:49,307 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-14 04:59:49,307 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-14 04:59:49,308 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-14 04:59:49,309 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-14 04:59:49,310 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-14 04:59:49,311 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-14 04:59:49,312 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-14 04:59:49,312 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-14 04:59:49,313 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-14 04:59:49,313 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-14 04:59:49,313 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-14 04:59:49,314 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-14 04:59:49,315 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-14 04:59:49,315 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2019-01-14 04:59:49,332 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-14 04:59:49,333 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-14 04:59:49,334 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-14 04:59:49,334 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-14 04:59:49,334 INFO L133 SettingsManager]: * Use SBE=true [2019-01-14 04:59:49,334 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-01-14 04:59:49,335 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-01-14 04:59:49,335 INFO L133 SettingsManager]: * Use old map elimination=false [2019-01-14 04:59:49,335 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2019-01-14 04:59:49,335 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2019-01-14 04:59:49,335 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-01-14 04:59:49,336 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-14 04:59:49,336 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-14 04:59:49,336 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-01-14 04:59:49,336 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-14 04:59:49,336 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-14 04:59:49,336 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-14 04:59:49,337 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-01-14 04:59:49,337 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-01-14 04:59:49,337 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-01-14 04:59:49,337 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-14 04:59:49,337 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-14 04:59:49,337 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-01-14 04:59:49,338 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-14 04:59:49,338 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-01-14 04:59:49,338 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-14 04:59:49,338 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-14 04:59:49,338 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-01-14 04:59:49,338 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-14 04:59:49,339 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-14 04:59:49,339 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-01-14 04:59:49,340 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-01-14 04:59:49,340 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 -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 12e277c835ccbb2e237f5234b2aa8358e814750b [2019-01-14 04:59:49,386 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-14 04:59:49,399 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-14 04:59:49,402 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-14 04:59:49,404 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-14 04:59:49,405 INFO L276 PluginConnector]: CDTParser initialized [2019-01-14 04:59:49,405 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/ldv-memsafety/memleaks_test18_2_false-valid-memtrack_true-termination.i [2019-01-14 04:59:49,468 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0a25e7518/5c419806b61c4946a38a811845cbe438/FLAGcea3dc5aa [2019-01-14 04:59:50,034 INFO L307 CDTParser]: Found 1 translation units. [2019-01-14 04:59:50,035 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/ldv-memsafety/memleaks_test18_2_false-valid-memtrack_true-termination.i [2019-01-14 04:59:50,060 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0a25e7518/5c419806b61c4946a38a811845cbe438/FLAGcea3dc5aa [2019-01-14 04:59:50,256 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0a25e7518/5c419806b61c4946a38a811845cbe438 [2019-01-14 04:59:50,260 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-14 04:59:50,261 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-01-14 04:59:50,263 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-14 04:59:50,263 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-14 04:59:50,267 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-14 04:59:50,268 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.01 04:59:50" (1/1) ... [2019-01-14 04:59:50,272 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@213218a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:59:50, skipping insertion in model container [2019-01-14 04:59:50,272 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.01 04:59:50" (1/1) ... [2019-01-14 04:59:50,281 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-14 04:59:50,340 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-14 04:59:50,845 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-14 04:59:50,868 INFO L191 MainTranslator]: Completed pre-run [2019-01-14 04:59:51,030 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-14 04:59:51,131 INFO L195 MainTranslator]: Completed translation [2019-01-14 04:59:51,131 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:59:51 WrapperNode [2019-01-14 04:59:51,132 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-14 04:59:51,133 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-14 04:59:51,133 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-14 04:59:51,133 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-14 04:59:51,143 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:59:51" (1/1) ... [2019-01-14 04:59:51,178 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:59:51" (1/1) ... [2019-01-14 04:59:51,206 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-14 04:59:51,207 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-14 04:59:51,207 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-14 04:59:51,207 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-14 04:59:51,217 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:59:51" (1/1) ... [2019-01-14 04:59:51,218 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:59:51" (1/1) ... [2019-01-14 04:59:51,221 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:59:51" (1/1) ... [2019-01-14 04:59:51,221 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:59:51" (1/1) ... [2019-01-14 04:59:51,235 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:59:51" (1/1) ... [2019-01-14 04:59:51,247 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:59:51" (1/1) ... [2019-01-14 04:59:51,249 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:59:51" (1/1) ... [2019-01-14 04:59:51,252 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-14 04:59:51,254 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-14 04:59:51,255 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-14 04:59:51,255 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-14 04:59:51,256 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:59:51" (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 04:59:51,316 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-01-14 04:59:51,317 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-01-14 04:59:51,317 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-01-14 04:59:51,317 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-01-14 04:59:51,317 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-01-14 04:59:51,317 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2019-01-14 04:59:51,317 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-14 04:59:51,317 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-14 04:59:51,749 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-14 04:59:51,749 INFO L286 CfgBuilder]: Removed 12 assue(true) statements. [2019-01-14 04:59:51,750 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 04:59:51 BoogieIcfgContainer [2019-01-14 04:59:51,750 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-14 04:59:51,751 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-01-14 04:59:51,751 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-01-14 04:59:51,755 INFO L276 PluginConnector]: BuchiAutomizer initialized [2019-01-14 04:59:51,756 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-14 04:59:51,756 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 14.01 04:59:50" (1/3) ... [2019-01-14 04:59:51,757 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@3f5f64e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 14.01 04:59:51, skipping insertion in model container [2019-01-14 04:59:51,757 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-14 04:59:51,757 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:59:51" (2/3) ... [2019-01-14 04:59:51,757 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@3f5f64e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 14.01 04:59:51, skipping insertion in model container [2019-01-14 04:59:51,758 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-14 04:59:51,758 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 04:59:51" (3/3) ... [2019-01-14 04:59:51,759 INFO L375 chiAutomizerObserver]: Analyzing ICFG memleaks_test18_2_false-valid-memtrack_true-termination.i [2019-01-14 04:59:51,812 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-14 04:59:51,812 INFO L374 BuchiCegarLoop]: Interprodecural is true [2019-01-14 04:59:51,812 INFO L375 BuchiCegarLoop]: Hoare is false [2019-01-14 04:59:51,813 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-01-14 04:59:51,813 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-14 04:59:51,813 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-14 04:59:51,813 INFO L379 BuchiCegarLoop]: Difference is false [2019-01-14 04:59:51,813 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-14 04:59:51,813 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-01-14 04:59:51,825 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 16 states. [2019-01-14 04:59:51,856 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 7 [2019-01-14 04:59:51,857 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 04:59:51,857 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 04:59:51,864 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2019-01-14 04:59:51,865 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2019-01-14 04:59:51,865 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2019-01-14 04:59:51,865 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 16 states. [2019-01-14 04:59:51,867 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 7 [2019-01-14 04:59:51,867 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 04:59:51,867 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 04:59:51,868 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2019-01-14 04:59:51,868 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2019-01-14 04:59:51,873 INFO L794 eck$LassoCheckResult]: Stem: 12#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];call ~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset := #Ultimate.allocOnStack(8);call write~init~$Pointer$(~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, ~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, 4);call write~init~$Pointer$(~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, ~#ldv_global_msg_list~0.base, 4 + ~#ldv_global_msg_list~0.offset, 4); 8#L-1true havoc entry_point_#t~ret38.base, entry_point_#t~ret38.offset, entry_point_#t~ret40.base, entry_point_#t~ret40.offset, entry_point_#t~post39, entry_point_#t~mem42.base, entry_point_#t~mem42.offset, entry_point_#t~post41, entry_point_~len~0, entry_point_~array~0.base, entry_point_~array~0.offset, entry_point_~p~0.base, entry_point_~p~0.offset, entry_point_~i~0, entry_point_~j~0;entry_point_~len~0 := 10;ldv_malloc_#in~size := 4 * entry_point_~len~0;havoc ldv_malloc_#res.base, ldv_malloc_#res.offset;havoc ldv_malloc_#t~nondet11, ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset, ldv_malloc_~size;ldv_malloc_~size := ldv_malloc_#in~size; 14#L1073true assume !(0 != ldv_malloc_#t~nondet11);havoc ldv_malloc_#t~nondet11;ldv_malloc_#res.base, ldv_malloc_#res.offset := 0, 0; 10#L1076true entry_point_#t~ret38.base, entry_point_#t~ret38.offset := ldv_malloc_#res.base, ldv_malloc_#res.offset;entry_point_~array~0.base, entry_point_~array~0.offset := entry_point_#t~ret38.base, entry_point_#t~ret38.offset;havoc entry_point_#t~ret38.base, entry_point_#t~ret38.offset;havoc entry_point_~p~0.base, entry_point_~p~0.offset;entry_point_~i~0 := 0;havoc entry_point_~j~0; 3#L1444true assume !(entry_point_~array~0.base == 0 && entry_point_~array~0.offset == 0); 5#L1445-3true [2019-01-14 04:59:51,874 INFO L796 eck$LassoCheckResult]: Loop: 5#L1445-3true assume !!(entry_point_~i~0 < entry_point_~len~0);ldv_malloc_#in~size := 4;havoc ldv_malloc_#res.base, ldv_malloc_#res.offset;havoc ldv_malloc_#t~nondet11, ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset, ldv_malloc_~size;ldv_malloc_~size := ldv_malloc_#in~size; 18#L1073-1true assume 0 != ldv_malloc_#t~nondet11;havoc ldv_malloc_#t~nondet11;call ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset := #Ultimate.allocOnHeap(ldv_malloc_~size);ldv_malloc_#res.base, ldv_malloc_#res.offset := ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset; 11#L1076-1true entry_point_#t~ret40.base, entry_point_#t~ret40.offset := ldv_malloc_#res.base, ldv_malloc_#res.offset;entry_point_~p~0.base, entry_point_~p~0.offset := entry_point_#t~ret40.base, entry_point_#t~ret40.offset;havoc entry_point_#t~ret40.base, entry_point_#t~ret40.offset; 13#L1447true assume !(entry_point_~p~0.base == 0 && entry_point_~p~0.offset == 0);call write~$Pointer$(entry_point_~p~0.base, entry_point_~p~0.offset, entry_point_~array~0.base, entry_point_~array~0.offset + 4 * entry_point_~i~0, 4); 4#L1445-2true entry_point_#t~post39 := entry_point_~i~0;entry_point_~i~0 := 1 + entry_point_#t~post39;havoc entry_point_#t~post39; 5#L1445-3true [2019-01-14 04:59:51,879 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:59:51,879 INFO L82 PathProgramCache]: Analyzing trace with hash 28695753, now seen corresponding path program 1 times [2019-01-14 04:59:51,880 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:59:51,881 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:59:51,927 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:59:51,928 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 04:59:51,928 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:59:51,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:59:52,070 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 04:59:52,072 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 04:59:52,073 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-14 04:59:52,076 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-01-14 04:59:52,076 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:59:52,077 INFO L82 PathProgramCache]: Analyzing trace with hash 49720347, now seen corresponding path program 1 times [2019-01-14 04:59:52,077 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:59:52,077 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:59:52,080 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:59:52,080 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 04:59:52,080 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:59:52,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:59:52,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:59:52,641 WARN L181 SmtUtils]: Spent 501.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 72 [2019-01-14 04:59:52,833 WARN L181 SmtUtils]: Spent 184.00 ms on a formula simplification that was a NOOP. DAG size: 69 [2019-01-14 04:59:52,847 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-14 04:59:52,847 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-14 04:59:52,849 INFO L87 Difference]: Start difference. First operand 16 states. Second operand 4 states. [2019-01-14 04:59:52,991 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 04:59:52,992 INFO L93 Difference]: Finished difference Result 32 states and 37 transitions. [2019-01-14 04:59:52,993 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-14 04:59:52,995 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 32 states and 37 transitions. [2019-01-14 04:59:52,998 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 13 [2019-01-14 04:59:53,003 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 32 states to 20 states and 23 transitions. [2019-01-14 04:59:53,004 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 20 [2019-01-14 04:59:53,004 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 20 [2019-01-14 04:59:53,005 INFO L73 IsDeterministic]: Start isDeterministic. Operand 20 states and 23 transitions. [2019-01-14 04:59:53,005 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-14 04:59:53,006 INFO L706 BuchiCegarLoop]: Abstraction has 20 states and 23 transitions. [2019-01-14 04:59:53,024 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states and 23 transitions. [2019-01-14 04:59:53,033 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 13. [2019-01-14 04:59:53,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2019-01-14 04:59:53,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 15 transitions. [2019-01-14 04:59:53,035 INFO L729 BuchiCegarLoop]: Abstraction has 13 states and 15 transitions. [2019-01-14 04:59:53,035 INFO L609 BuchiCegarLoop]: Abstraction has 13 states and 15 transitions. [2019-01-14 04:59:53,035 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2019-01-14 04:59:53,035 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 13 states and 15 transitions. [2019-01-14 04:59:53,036 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 7 [2019-01-14 04:59:53,036 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 04:59:53,037 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 04:59:53,037 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2019-01-14 04:59:53,037 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2019-01-14 04:59:53,038 INFO L794 eck$LassoCheckResult]: Stem: 71#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];call ~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset := #Ultimate.allocOnStack(8);call write~init~$Pointer$(~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, ~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, 4);call write~init~$Pointer$(~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, ~#ldv_global_msg_list~0.base, 4 + ~#ldv_global_msg_list~0.offset, 4); 66#L-1 havoc entry_point_#t~ret38.base, entry_point_#t~ret38.offset, entry_point_#t~ret40.base, entry_point_#t~ret40.offset, entry_point_#t~post39, entry_point_#t~mem42.base, entry_point_#t~mem42.offset, entry_point_#t~post41, entry_point_~len~0, entry_point_~array~0.base, entry_point_~array~0.offset, entry_point_~p~0.base, entry_point_~p~0.offset, entry_point_~i~0, entry_point_~j~0;entry_point_~len~0 := 10;ldv_malloc_#in~size := 4 * entry_point_~len~0;havoc ldv_malloc_#res.base, ldv_malloc_#res.offset;havoc ldv_malloc_#t~nondet11, ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset, ldv_malloc_~size;ldv_malloc_~size := ldv_malloc_#in~size; 67#L1073 assume 0 != ldv_malloc_#t~nondet11;havoc ldv_malloc_#t~nondet11;call ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset := #Ultimate.allocOnHeap(ldv_malloc_~size);ldv_malloc_#res.base, ldv_malloc_#res.offset := ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset; 68#L1076 entry_point_#t~ret38.base, entry_point_#t~ret38.offset := ldv_malloc_#res.base, ldv_malloc_#res.offset;entry_point_~array~0.base, entry_point_~array~0.offset := entry_point_#t~ret38.base, entry_point_#t~ret38.offset;havoc entry_point_#t~ret38.base, entry_point_#t~ret38.offset;havoc entry_point_~p~0.base, entry_point_~p~0.offset;entry_point_~i~0 := 0;havoc entry_point_~j~0; 60#L1444 assume !(entry_point_~array~0.base == 0 && entry_point_~array~0.offset == 0); 61#L1445-3 [2019-01-14 04:59:53,038 INFO L796 eck$LassoCheckResult]: Loop: 61#L1445-3 assume !!(entry_point_~i~0 < entry_point_~len~0);ldv_malloc_#in~size := 4;havoc ldv_malloc_#res.base, ldv_malloc_#res.offset;havoc ldv_malloc_#t~nondet11, ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset, ldv_malloc_~size;ldv_malloc_~size := ldv_malloc_#in~size; 63#L1073-1 assume 0 != ldv_malloc_#t~nondet11;havoc ldv_malloc_#t~nondet11;call ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset := #Ultimate.allocOnHeap(ldv_malloc_~size);ldv_malloc_#res.base, ldv_malloc_#res.offset := ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset; 69#L1076-1 entry_point_#t~ret40.base, entry_point_#t~ret40.offset := ldv_malloc_#res.base, ldv_malloc_#res.offset;entry_point_~p~0.base, entry_point_~p~0.offset := entry_point_#t~ret40.base, entry_point_#t~ret40.offset;havoc entry_point_#t~ret40.base, entry_point_#t~ret40.offset; 70#L1447 assume !(entry_point_~p~0.base == 0 && entry_point_~p~0.offset == 0);call write~$Pointer$(entry_point_~p~0.base, entry_point_~p~0.offset, entry_point_~array~0.base, entry_point_~array~0.offset + 4 * entry_point_~i~0, 4); 62#L1445-2 entry_point_#t~post39 := entry_point_~i~0;entry_point_~i~0 := 1 + entry_point_#t~post39;havoc entry_point_#t~post39; 61#L1445-3 [2019-01-14 04:59:53,038 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:59:53,038 INFO L82 PathProgramCache]: Analyzing trace with hash 28693831, now seen corresponding path program 1 times [2019-01-14 04:59:53,038 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:59:53,040 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:59:53,042 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:59:53,042 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 04:59:53,042 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:59:53,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:59:53,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:59:53,077 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:59:53,077 INFO L82 PathProgramCache]: Analyzing trace with hash 49720347, now seen corresponding path program 2 times [2019-01-14 04:59:53,077 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:59:53,077 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:59:53,079 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:59:53,079 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 04:59:53,079 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:59:53,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:59:53,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:59:53,109 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:59:53,109 INFO L82 PathProgramCache]: Analyzing trace with hash -1173278059, now seen corresponding path program 1 times [2019-01-14 04:59:53,109 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:59:53,109 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:59:53,111 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:59:53,112 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 04:59:53,112 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:59:53,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:59:53,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:59:53,801 WARN L181 SmtUtils]: Spent 618.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 72 [2019-01-14 04:59:54,146 WARN L181 SmtUtils]: Spent 257.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 75 [2019-01-14 04:59:54,328 WARN L181 SmtUtils]: Spent 179.00 ms on a formula simplification that was a NOOP. DAG size: 68 [2019-01-14 04:59:54,340 INFO L216 LassoAnalysis]: Preferences: [2019-01-14 04:59:54,341 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-14 04:59:54,341 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-14 04:59:54,342 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-14 04:59:54,342 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-14 04:59:54,342 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 04:59:54,342 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-14 04:59:54,342 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-14 04:59:54,342 INFO L131 ssoRankerPreferences]: Filename of dumped script: memleaks_test18_2_false-valid-memtrack_true-termination.i_Iteration2_Lasso [2019-01-14 04:59:54,343 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-14 04:59:54,343 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-14 04:59:54,373 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 04:59:54,382 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:59:54,384 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 04:59:54,388 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 04:59:54,668 WARN L181 SmtUtils]: Spent 173.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 60 [2019-01-14 04:59:54,778 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 04:59:54,781 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 04:59:54,784 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 04:59:54,787 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 04:59:54,790 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:59:54,792 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 04:59:54,798 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 04:59:54,803 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 04:59:54,805 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 04:59:54,808 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 04:59:54,813 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 04:59:54,818 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 04:59:54,823 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 04:59:54,825 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 04:59:55,542 WARN L181 SmtUtils]: Spent 292.00 ms on a formula simplification. DAG size of input: 31 DAG size of output: 30 [2019-01-14 04:59:55,795 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-14 04:59:55,800 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-14 04:59:55,802 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 04:59:55,804 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:59:55,804 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:59:55,805 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:59:55,805 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:59:55,809 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 04:59:55,809 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 04:59:55,814 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:59:55,815 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 04:59:55,815 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:59:55,815 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:59:55,816 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:59:55,816 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:59:55,816 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:59:55,817 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:59:55,817 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:59:55,818 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:59:55,818 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 04:59:55,818 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:59:55,819 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:59:55,819 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:59:55,819 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:59:55,819 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:59:55,820 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:59:55,820 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:59:55,821 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:59:55,821 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 04:59:55,822 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:59:55,822 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:59:55,822 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:59:55,822 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:59:55,822 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:59:55,823 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:59:55,823 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:59:55,824 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:59:55,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 04:59:55,825 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:59:55,825 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:59:55,825 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:59:55,825 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:59:55,828 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 04:59:55,828 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 04:59:55,836 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:59:55,836 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 04:59:55,837 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:59:55,837 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:59:55,837 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:59:55,837 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:59:55,839 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 04:59:55,840 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 04:59:55,846 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:59:55,847 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 04:59:55,847 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:59:55,847 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:59:55,847 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:59:55,848 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:59:55,850 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 04:59:55,850 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 04:59:55,860 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:59:55,860 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 04:59:55,861 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:59:55,861 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:59:55,861 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:59:55,861 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:59:55,861 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:59:55,862 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:59:55,862 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:59:55,863 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:59:55,863 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 04:59:55,864 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:59:55,864 INFO L205 nArgumentSynthesizer]: 3 stem disjuncts [2019-01-14 04:59:55,864 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2019-01-14 04:59:55,865 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:59:55,885 INFO L402 nArgumentSynthesizer]: We have 24 Motzkin's Theorem applications. [2019-01-14 04:59:55,885 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2019-01-14 04:59:56,025 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:59:56,026 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 04:59:56,026 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:59:56,026 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:59:56,027 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:59:56,030 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:59:56,048 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 04:59:56,050 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 04:59:56,149 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-14 04:59:56,193 INFO L443 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. [2019-01-14 04:59:56,194 INFO L444 ModelExtractionUtils]: 35 out of 43 variables were initially zero. Simplification set additionally 5 variables to zero. [2019-01-14 04:59:56,197 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-14 04:59:56,198 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-01-14 04:59:56,199 INFO L518 LassoAnalysis]: Proved termination. [2019-01-14 04:59:56,199 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_entry_point_~len~0, ULTIMATE.start_entry_point_~i~0) = 1*ULTIMATE.start_entry_point_~len~0 - 1*ULTIMATE.start_entry_point_~i~0 Supporting invariants [] [2019-01-14 04:59:56,279 INFO L297 tatePredicateManager]: 5 out of 5 supporting invariants were superfluous and have been removed [2019-01-14 04:59:56,330 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:59:56,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:59:56,350 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 04:59:56,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:59:56,375 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 04:59:56,387 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 04:59:56,391 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 04:59:56,392 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 13 states and 15 transitions. cyclomatic complexity: 4 Second operand 3 states. [2019-01-14 04:59:56,441 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 13 states and 15 transitions. cyclomatic complexity: 4. Second operand 3 states. Result 21 states and 26 transitions. Complement of second has 4 states. [2019-01-14 04:59:56,442 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2019-01-14 04:59:56,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-01-14 04:59:56,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 15 transitions. [2019-01-14 04:59:56,445 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 15 transitions. Stem has 5 letters. Loop has 5 letters. [2019-01-14 04:59:56,446 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 04:59:56,447 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 15 transitions. Stem has 10 letters. Loop has 5 letters. [2019-01-14 04:59:56,447 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 04:59:56,447 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 15 transitions. Stem has 5 letters. Loop has 10 letters. [2019-01-14 04:59:56,447 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 04:59:56,448 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 21 states and 26 transitions. [2019-01-14 04:59:56,449 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-01-14 04:59:56,450 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 21 states to 17 states and 21 transitions. [2019-01-14 04:59:56,450 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2019-01-14 04:59:56,450 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 12 [2019-01-14 04:59:56,450 INFO L73 IsDeterministic]: Start isDeterministic. Operand 17 states and 21 transitions. [2019-01-14 04:59:56,450 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-14 04:59:56,450 INFO L706 BuchiCegarLoop]: Abstraction has 17 states and 21 transitions. [2019-01-14 04:59:56,451 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states and 21 transitions. [2019-01-14 04:59:56,452 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2019-01-14 04:59:56,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2019-01-14 04:59:56,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 21 transitions. [2019-01-14 04:59:56,453 INFO L729 BuchiCegarLoop]: Abstraction has 17 states and 21 transitions. [2019-01-14 04:59:56,453 INFO L609 BuchiCegarLoop]: Abstraction has 17 states and 21 transitions. [2019-01-14 04:59:56,453 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2019-01-14 04:59:56,453 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states and 21 transitions. [2019-01-14 04:59:56,454 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-01-14 04:59:56,454 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 04:59:56,454 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 04:59:56,455 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 04:59:56,455 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-01-14 04:59:56,455 INFO L794 eck$LassoCheckResult]: Stem: 179#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];call ~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset := #Ultimate.allocOnStack(8);call write~init~$Pointer$(~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, ~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, 4);call write~init~$Pointer$(~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, ~#ldv_global_msg_list~0.base, 4 + ~#ldv_global_msg_list~0.offset, 4); 172#L-1 havoc entry_point_#t~ret38.base, entry_point_#t~ret38.offset, entry_point_#t~ret40.base, entry_point_#t~ret40.offset, entry_point_#t~post39, entry_point_#t~mem42.base, entry_point_#t~mem42.offset, entry_point_#t~post41, entry_point_~len~0, entry_point_~array~0.base, entry_point_~array~0.offset, entry_point_~p~0.base, entry_point_~p~0.offset, entry_point_~i~0, entry_point_~j~0;entry_point_~len~0 := 10;ldv_malloc_#in~size := 4 * entry_point_~len~0;havoc ldv_malloc_#res.base, ldv_malloc_#res.offset;havoc ldv_malloc_#t~nondet11, ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset, ldv_malloc_~size;ldv_malloc_~size := ldv_malloc_#in~size; 173#L1073 assume 0 != ldv_malloc_#t~nondet11;havoc ldv_malloc_#t~nondet11;call ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset := #Ultimate.allocOnHeap(ldv_malloc_~size);ldv_malloc_#res.base, ldv_malloc_#res.offset := ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset; 174#L1076 entry_point_#t~ret38.base, entry_point_#t~ret38.offset := ldv_malloc_#res.base, ldv_malloc_#res.offset;entry_point_~array~0.base, entry_point_~array~0.offset := entry_point_#t~ret38.base, entry_point_#t~ret38.offset;havoc entry_point_#t~ret38.base, entry_point_#t~ret38.offset;havoc entry_point_~p~0.base, entry_point_~p~0.offset;entry_point_~i~0 := 0;havoc entry_point_~j~0; 164#L1444 assume !(entry_point_~array~0.base == 0 && entry_point_~array~0.offset == 0); 165#L1445-3 assume !!(entry_point_~i~0 < entry_point_~len~0);ldv_malloc_#in~size := 4;havoc ldv_malloc_#res.base, ldv_malloc_#res.offset;havoc ldv_malloc_#t~nondet11, ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset, ldv_malloc_~size;ldv_malloc_~size := ldv_malloc_#in~size; 169#L1073-1 assume !(0 != ldv_malloc_#t~nondet11);havoc ldv_malloc_#t~nondet11;ldv_malloc_#res.base, ldv_malloc_#res.offset := 0, 0; 175#L1076-1 entry_point_#t~ret40.base, entry_point_#t~ret40.offset := ldv_malloc_#res.base, ldv_malloc_#res.offset;entry_point_~p~0.base, entry_point_~p~0.offset := entry_point_#t~ret40.base, entry_point_#t~ret40.offset;havoc entry_point_#t~ret40.base, entry_point_#t~ret40.offset; 176#L1447 assume entry_point_~p~0.base == 0 && entry_point_~p~0.offset == 0; 180#L1447-1 entry_point_~j~0 := entry_point_~i~0 - 1; 171#L1453-3 [2019-01-14 04:59:56,455 INFO L796 eck$LassoCheckResult]: Loop: 171#L1453-3 assume !!(entry_point_~j~0 >= 0);call entry_point_#t~mem42.base, entry_point_#t~mem42.offset := read~$Pointer$(entry_point_~array~0.base, entry_point_~array~0.offset + 4 * entry_point_~j~0, 4);call ULTIMATE.dealloc(entry_point_#t~mem42.base, entry_point_#t~mem42.offset);havoc entry_point_#t~mem42.base, entry_point_#t~mem42.offset; 170#L1453-2 entry_point_#t~post41 := entry_point_~j~0;entry_point_~j~0 := entry_point_#t~post41 - 1;havoc entry_point_#t~post41; 171#L1453-3 [2019-01-14 04:59:56,455 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:59:56,455 INFO L82 PathProgramCache]: Analyzing trace with hash -1173218534, now seen corresponding path program 1 times [2019-01-14 04:59:56,456 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:59:56,456 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:59:56,457 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:59:56,457 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 04:59:56,457 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:59:56,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:59:56,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:59:56,475 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:59:56,475 INFO L82 PathProgramCache]: Analyzing trace with hash 2531, now seen corresponding path program 1 times [2019-01-14 04:59:56,475 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:59:56,475 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:59:56,476 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:59:56,477 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 04:59:56,477 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:59:56,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:59:56,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:59:56,482 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:59:56,482 INFO L82 PathProgramCache]: Analyzing trace with hash 2113389244, now seen corresponding path program 1 times [2019-01-14 04:59:56,483 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:59:56,483 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:59:56,484 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:59:56,484 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 04:59:56,484 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:59:56,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:59:56,615 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 04:59:56,615 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 04:59:56,616 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-14 04:59:56,842 WARN L181 SmtUtils]: Spent 128.00 ms on a formula simplification that was a NOOP. DAG size: 27 [2019-01-14 04:59:56,843 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-14 04:59:56,843 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-14 04:59:56,844 INFO L87 Difference]: Start difference. First operand 17 states and 21 transitions. cyclomatic complexity: 6 Second operand 4 states. [2019-01-14 04:59:56,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 04:59:56,916 INFO L93 Difference]: Finished difference Result 26 states and 31 transitions. [2019-01-14 04:59:56,916 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-14 04:59:56,917 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 26 states and 31 transitions. [2019-01-14 04:59:56,918 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-01-14 04:59:56,918 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 26 states to 21 states and 25 transitions. [2019-01-14 04:59:56,918 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 12 [2019-01-14 04:59:56,920 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 12 [2019-01-14 04:59:56,920 INFO L73 IsDeterministic]: Start isDeterministic. Operand 21 states and 25 transitions. [2019-01-14 04:59:56,920 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-14 04:59:56,920 INFO L706 BuchiCegarLoop]: Abstraction has 21 states and 25 transitions. [2019-01-14 04:59:56,920 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states and 25 transitions. [2019-01-14 04:59:56,922 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 17. [2019-01-14 04:59:56,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2019-01-14 04:59:56,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 20 transitions. [2019-01-14 04:59:56,922 INFO L729 BuchiCegarLoop]: Abstraction has 17 states and 20 transitions. [2019-01-14 04:59:56,922 INFO L609 BuchiCegarLoop]: Abstraction has 17 states and 20 transitions. [2019-01-14 04:59:56,923 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2019-01-14 04:59:56,923 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states and 20 transitions. [2019-01-14 04:59:56,923 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-01-14 04:59:56,923 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 04:59:56,924 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 04:59:56,924 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 04:59:56,924 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-01-14 04:59:56,925 INFO L794 eck$LassoCheckResult]: Stem: 233#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];call ~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset := #Ultimate.allocOnStack(8);call write~init~$Pointer$(~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, ~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, 4);call write~init~$Pointer$(~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, ~#ldv_global_msg_list~0.base, 4 + ~#ldv_global_msg_list~0.offset, 4); 226#L-1 havoc entry_point_#t~ret38.base, entry_point_#t~ret38.offset, entry_point_#t~ret40.base, entry_point_#t~ret40.offset, entry_point_#t~post39, entry_point_#t~mem42.base, entry_point_#t~mem42.offset, entry_point_#t~post41, entry_point_~len~0, entry_point_~array~0.base, entry_point_~array~0.offset, entry_point_~p~0.base, entry_point_~p~0.offset, entry_point_~i~0, entry_point_~j~0;entry_point_~len~0 := 10;ldv_malloc_#in~size := 4 * entry_point_~len~0;havoc ldv_malloc_#res.base, ldv_malloc_#res.offset;havoc ldv_malloc_#t~nondet11, ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset, ldv_malloc_~size;ldv_malloc_~size := ldv_malloc_#in~size; 227#L1073 assume 0 != ldv_malloc_#t~nondet11;havoc ldv_malloc_#t~nondet11;call ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset := #Ultimate.allocOnHeap(ldv_malloc_~size);ldv_malloc_#res.base, ldv_malloc_#res.offset := ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset; 228#L1076 entry_point_#t~ret38.base, entry_point_#t~ret38.offset := ldv_malloc_#res.base, ldv_malloc_#res.offset;entry_point_~array~0.base, entry_point_~array~0.offset := entry_point_#t~ret38.base, entry_point_#t~ret38.offset;havoc entry_point_#t~ret38.base, entry_point_#t~ret38.offset;havoc entry_point_~p~0.base, entry_point_~p~0.offset;entry_point_~i~0 := 0;havoc entry_point_~j~0; 218#L1444 assume !(entry_point_~array~0.base == 0 && entry_point_~array~0.offset == 0); 219#L1445-3 assume !!(entry_point_~i~0 < entry_point_~len~0);ldv_malloc_#in~size := 4;havoc ldv_malloc_#res.base, ldv_malloc_#res.offset;havoc ldv_malloc_#t~nondet11, ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset, ldv_malloc_~size;ldv_malloc_~size := ldv_malloc_#in~size; 222#L1073-1 assume !(0 != ldv_malloc_#t~nondet11);havoc ldv_malloc_#t~nondet11;ldv_malloc_#res.base, ldv_malloc_#res.offset := 0, 0; 231#L1076-1 entry_point_#t~ret40.base, entry_point_#t~ret40.offset := ldv_malloc_#res.base, ldv_malloc_#res.offset;entry_point_~p~0.base, entry_point_~p~0.offset := entry_point_#t~ret40.base, entry_point_#t~ret40.offset;havoc entry_point_#t~ret40.base, entry_point_#t~ret40.offset; 232#L1447 assume !(entry_point_~p~0.base == 0 && entry_point_~p~0.offset == 0);call write~$Pointer$(entry_point_~p~0.base, entry_point_~p~0.offset, entry_point_~array~0.base, entry_point_~array~0.offset + 4 * entry_point_~i~0, 4); 220#L1445-2 entry_point_#t~post39 := entry_point_~i~0;entry_point_~i~0 := 1 + entry_point_#t~post39;havoc entry_point_#t~post39; 221#L1445-3 assume !!(entry_point_~i~0 < entry_point_~len~0);ldv_malloc_#in~size := 4;havoc ldv_malloc_#res.base, ldv_malloc_#res.offset;havoc ldv_malloc_#t~nondet11, ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset, ldv_malloc_~size;ldv_malloc_~size := ldv_malloc_#in~size; 223#L1073-1 assume !(0 != ldv_malloc_#t~nondet11);havoc ldv_malloc_#t~nondet11;ldv_malloc_#res.base, ldv_malloc_#res.offset := 0, 0; 229#L1076-1 entry_point_#t~ret40.base, entry_point_#t~ret40.offset := ldv_malloc_#res.base, ldv_malloc_#res.offset;entry_point_~p~0.base, entry_point_~p~0.offset := entry_point_#t~ret40.base, entry_point_#t~ret40.offset;havoc entry_point_#t~ret40.base, entry_point_#t~ret40.offset; 230#L1447 assume entry_point_~p~0.base == 0 && entry_point_~p~0.offset == 0; 234#L1447-1 entry_point_~j~0 := entry_point_~i~0 - 1; 225#L1453-3 [2019-01-14 04:59:56,925 INFO L796 eck$LassoCheckResult]: Loop: 225#L1453-3 assume !!(entry_point_~j~0 >= 0);call entry_point_#t~mem42.base, entry_point_#t~mem42.offset := read~$Pointer$(entry_point_~array~0.base, entry_point_~array~0.offset + 4 * entry_point_~j~0, 4);call ULTIMATE.dealloc(entry_point_#t~mem42.base, entry_point_#t~mem42.offset);havoc entry_point_#t~mem42.base, entry_point_#t~mem42.offset; 224#L1453-2 entry_point_#t~post41 := entry_point_~j~0;entry_point_~j~0 := entry_point_#t~post41 - 1;havoc entry_point_#t~post41; 225#L1453-3 [2019-01-14 04:59:56,925 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:59:56,925 INFO L82 PathProgramCache]: Analyzing trace with hash 1659616398, now seen corresponding path program 1 times [2019-01-14 04:59:56,925 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:59:56,925 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:59:56,926 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:59:56,927 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 04:59:56,927 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:59:56,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:59:57,101 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 04:59:57,101 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 04:59:57,102 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-14 04:59:57,102 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-01-14 04:59:57,102 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:59:57,102 INFO L82 PathProgramCache]: Analyzing trace with hash 2531, now seen corresponding path program 2 times [2019-01-14 04:59:57,102 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:59:57,102 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:59:57,104 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:59:57,104 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 04:59:57,104 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:59:57,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:59:57,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:59:57,175 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-14 04:59:57,176 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-14 04:59:57,176 INFO L87 Difference]: Start difference. First operand 17 states and 20 transitions. cyclomatic complexity: 5 Second operand 4 states. [2019-01-14 04:59:57,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 04:59:57,213 INFO L93 Difference]: Finished difference Result 24 states and 26 transitions. [2019-01-14 04:59:57,214 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-14 04:59:57,214 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 24 states and 26 transitions. [2019-01-14 04:59:57,216 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2019-01-14 04:59:57,217 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 24 states to 22 states and 24 transitions. [2019-01-14 04:59:57,217 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 17 [2019-01-14 04:59:57,218 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 17 [2019-01-14 04:59:57,218 INFO L73 IsDeterministic]: Start isDeterministic. Operand 22 states and 24 transitions. [2019-01-14 04:59:57,218 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-14 04:59:57,218 INFO L706 BuchiCegarLoop]: Abstraction has 22 states and 24 transitions. [2019-01-14 04:59:57,218 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states and 24 transitions. [2019-01-14 04:59:57,219 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 17. [2019-01-14 04:59:57,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2019-01-14 04:59:57,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 19 transitions. [2019-01-14 04:59:57,221 INFO L729 BuchiCegarLoop]: Abstraction has 17 states and 19 transitions. [2019-01-14 04:59:57,221 INFO L609 BuchiCegarLoop]: Abstraction has 17 states and 19 transitions. [2019-01-14 04:59:57,222 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2019-01-14 04:59:57,222 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states and 19 transitions. [2019-01-14 04:59:57,223 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-01-14 04:59:57,223 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 04:59:57,223 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 04:59:57,225 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 04:59:57,225 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-01-14 04:59:57,225 INFO L794 eck$LassoCheckResult]: Stem: 283#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];call ~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset := #Ultimate.allocOnStack(8);call write~init~$Pointer$(~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, ~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, 4);call write~init~$Pointer$(~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, ~#ldv_global_msg_list~0.base, 4 + ~#ldv_global_msg_list~0.offset, 4); 276#L-1 havoc entry_point_#t~ret38.base, entry_point_#t~ret38.offset, entry_point_#t~ret40.base, entry_point_#t~ret40.offset, entry_point_#t~post39, entry_point_#t~mem42.base, entry_point_#t~mem42.offset, entry_point_#t~post41, entry_point_~len~0, entry_point_~array~0.base, entry_point_~array~0.offset, entry_point_~p~0.base, entry_point_~p~0.offset, entry_point_~i~0, entry_point_~j~0;entry_point_~len~0 := 10;ldv_malloc_#in~size := 4 * entry_point_~len~0;havoc ldv_malloc_#res.base, ldv_malloc_#res.offset;havoc ldv_malloc_#t~nondet11, ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset, ldv_malloc_~size;ldv_malloc_~size := ldv_malloc_#in~size; 277#L1073 assume 0 != ldv_malloc_#t~nondet11;havoc ldv_malloc_#t~nondet11;call ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset := #Ultimate.allocOnHeap(ldv_malloc_~size);ldv_malloc_#res.base, ldv_malloc_#res.offset := ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset; 278#L1076 entry_point_#t~ret38.base, entry_point_#t~ret38.offset := ldv_malloc_#res.base, ldv_malloc_#res.offset;entry_point_~array~0.base, entry_point_~array~0.offset := entry_point_#t~ret38.base, entry_point_#t~ret38.offset;havoc entry_point_#t~ret38.base, entry_point_#t~ret38.offset;havoc entry_point_~p~0.base, entry_point_~p~0.offset;entry_point_~i~0 := 0;havoc entry_point_~j~0; 268#L1444 assume !(entry_point_~array~0.base == 0 && entry_point_~array~0.offset == 0); 269#L1445-3 assume !!(entry_point_~i~0 < entry_point_~len~0);ldv_malloc_#in~size := 4;havoc ldv_malloc_#res.base, ldv_malloc_#res.offset;havoc ldv_malloc_#t~nondet11, ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset, ldv_malloc_~size;ldv_malloc_~size := ldv_malloc_#in~size; 272#L1073-1 assume 0 != ldv_malloc_#t~nondet11;havoc ldv_malloc_#t~nondet11;call ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset := #Ultimate.allocOnHeap(ldv_malloc_~size);ldv_malloc_#res.base, ldv_malloc_#res.offset := ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset; 281#L1076-1 entry_point_#t~ret40.base, entry_point_#t~ret40.offset := ldv_malloc_#res.base, ldv_malloc_#res.offset;entry_point_~p~0.base, entry_point_~p~0.offset := entry_point_#t~ret40.base, entry_point_#t~ret40.offset;havoc entry_point_#t~ret40.base, entry_point_#t~ret40.offset; 282#L1447 assume !(entry_point_~p~0.base == 0 && entry_point_~p~0.offset == 0);call write~$Pointer$(entry_point_~p~0.base, entry_point_~p~0.offset, entry_point_~array~0.base, entry_point_~array~0.offset + 4 * entry_point_~i~0, 4); 270#L1445-2 entry_point_#t~post39 := entry_point_~i~0;entry_point_~i~0 := 1 + entry_point_#t~post39;havoc entry_point_#t~post39; 271#L1445-3 assume !!(entry_point_~i~0 < entry_point_~len~0);ldv_malloc_#in~size := 4;havoc ldv_malloc_#res.base, ldv_malloc_#res.offset;havoc ldv_malloc_#t~nondet11, ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset, ldv_malloc_~size;ldv_malloc_~size := ldv_malloc_#in~size; 273#L1073-1 assume !(0 != ldv_malloc_#t~nondet11);havoc ldv_malloc_#t~nondet11;ldv_malloc_#res.base, ldv_malloc_#res.offset := 0, 0; 279#L1076-1 entry_point_#t~ret40.base, entry_point_#t~ret40.offset := ldv_malloc_#res.base, ldv_malloc_#res.offset;entry_point_~p~0.base, entry_point_~p~0.offset := entry_point_#t~ret40.base, entry_point_#t~ret40.offset;havoc entry_point_#t~ret40.base, entry_point_#t~ret40.offset; 280#L1447 assume entry_point_~p~0.base == 0 && entry_point_~p~0.offset == 0; 284#L1447-1 entry_point_~j~0 := entry_point_~i~0 - 1; 275#L1453-3 [2019-01-14 04:59:57,225 INFO L796 eck$LassoCheckResult]: Loop: 275#L1453-3 assume !!(entry_point_~j~0 >= 0);call entry_point_#t~mem42.base, entry_point_#t~mem42.offset := read~$Pointer$(entry_point_~array~0.base, entry_point_~array~0.offset + 4 * entry_point_~j~0, 4);call ULTIMATE.dealloc(entry_point_#t~mem42.base, entry_point_#t~mem42.offset);havoc entry_point_#t~mem42.base, entry_point_#t~mem42.offset; 274#L1453-2 entry_point_#t~post41 := entry_point_~j~0;entry_point_~j~0 := entry_point_#t~post41 - 1;havoc entry_point_#t~post41; 275#L1453-3 [2019-01-14 04:59:57,225 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:59:57,226 INFO L82 PathProgramCache]: Analyzing trace with hash 979558028, now seen corresponding path program 1 times [2019-01-14 04:59:57,229 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:59:57,229 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:59:57,230 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:59:57,230 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 04:59:57,230 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:59:57,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:59:57,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:59:57,254 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:59:57,254 INFO L82 PathProgramCache]: Analyzing trace with hash 2531, now seen corresponding path program 3 times [2019-01-14 04:59:57,255 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:59:57,255 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:59:57,256 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:59:57,256 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 04:59:57,256 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:59:57,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:59:57,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:59:57,261 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:59:57,261 INFO L82 PathProgramCache]: Analyzing trace with hash 757428654, now seen corresponding path program 1 times [2019-01-14 04:59:57,261 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:59:57,261 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:59:57,262 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:59:57,263 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 04:59:57,263 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:59:57,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:59:57,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:59:57,481 WARN L181 SmtUtils]: Spent 174.00 ms on a formula simplification that was a NOOP. DAG size: 27 [2019-01-14 04:59:57,633 WARN L181 SmtUtils]: Spent 150.00 ms on a formula simplification that was a NOOP. DAG size: 27 [2019-01-14 04:59:58,302 WARN L181 SmtUtils]: Spent 664.00 ms on a formula simplification. DAG size of input: 165 DAG size of output: 145 [2019-01-14 04:59:58,505 WARN L181 SmtUtils]: Spent 190.00 ms on a formula simplification that was a NOOP. DAG size: 98 [2019-01-14 04:59:58,507 INFO L216 LassoAnalysis]: Preferences: [2019-01-14 04:59:58,507 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-14 04:59:58,507 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-14 04:59:58,507 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-14 04:59:58,507 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-14 04:59:58,507 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 04:59:58,507 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-14 04:59:58,507 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-14 04:59:58,508 INFO L131 ssoRankerPreferences]: Filename of dumped script: memleaks_test18_2_false-valid-memtrack_true-termination.i_Iteration5_Lasso [2019-01-14 04:59:58,508 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-14 04:59:58,508 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-14 04:59:58,513 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 04:59:58,518 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 04:59:58,523 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:59:58,526 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 04:59:58,529 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 04:59:58,540 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 04:59:58,542 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 04:59:58,545 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 04:59:58,547 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 04:59:58,550 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 04:59:58,552 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 04:59:58,555 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 04:59:58,558 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 04:59:58,561 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 04:59:58,565 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 04:59:58,570 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 04:59:58,575 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 04:59:58,578 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 04:59:58,829 WARN L181 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 50 [2019-01-14 04:59:58,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-01-14 04:59:58,892 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 04:59:58,896 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 04:59:58,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 04:59:59,585 WARN L181 SmtUtils]: Spent 274.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 32 [2019-01-14 04:59:59,643 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-14 04:59:59,643 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-14 04:59:59,643 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 04:59:59,646 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:59:59,646 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:59:59,646 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:59:59,646 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:59:59,646 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:59:59,647 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:59:59,647 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:59:59,648 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:59:59,649 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 04:59:59,651 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:59:59,651 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:59:59,651 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:59:59,651 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:59:59,654 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 04:59:59,654 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 04:59:59,657 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:59:59,657 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:59:59,657 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:59:59,658 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:59:59,658 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:59:59,658 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:59:59,658 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:59:59,658 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:59:59,658 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:59:59,659 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:59:59,659 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 04:59:59,659 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:59:59,664 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:59:59,664 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:59:59,665 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:59:59,665 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 04:59:59,666 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 04:59:59,668 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:59:59,669 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 04:59:59,671 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:59:59,671 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:59:59,671 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:59:59,671 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:59:59,672 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 04:59:59,672 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 04:59:59,673 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:59:59,674 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 04:59:59,674 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:59:59,674 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:59:59,674 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:59:59,675 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:59:59,678 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:59:59,678 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:59:59,679 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:59:59,679 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:59:59,679 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:59:59,682 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:59:59,683 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:59:59,683 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:59:59,683 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:59:59,684 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 04:59:59,684 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 04:59:59,687 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:59:59,688 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 04:59:59,688 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:59:59,688 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:59:59,688 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:59:59,688 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:59:59,688 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:59:59,689 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:59:59,689 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:59:59,689 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:59:59,690 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:59:59,693 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:59:59,693 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:59:59,694 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:59:59,694 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:59:59,694 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:59:59,694 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:59:59,694 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:59:59,695 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:59:59,698 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:59:59,698 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:59:59,699 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:59:59,701 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:59:59,701 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:59:59,701 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:59:59,701 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:59:59,701 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:59:59,703 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:59:59,704 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:59:59,704 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:59:59,704 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:59:59,704 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:59:59,704 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:59:59,707 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 04:59:59,708 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 04:59:59,709 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:59:59,710 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 04:59:59,710 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:59:59,710 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:59:59,710 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:59:59,711 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:59:59,713 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:59:59,714 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:59:59,714 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:59:59,715 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:59:59,715 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 04:59:59,716 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:59:59,716 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:59:59,716 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:59:59,716 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:59:59,716 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:59:59,717 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:59:59,717 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:59:59,717 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:59:59,718 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 04:59:59,722 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:59:59,722 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:59:59,722 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:59:59,723 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:59:59,723 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 04:59:59,723 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 04:59:59,728 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:59:59,728 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 04:59:59,728 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:59:59,729 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:59:59,729 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:59:59,729 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:59:59,730 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 04:59:59,730 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 04:59:59,734 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:59:59,735 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 04:59:59,735 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:59:59,736 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:59:59,736 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:59:59,736 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:59:59,736 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 04:59:59,737 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 04:59:59,741 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:59:59,741 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 04:59:59,742 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:59:59,742 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:59:59,742 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:59:59,742 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:59:59,742 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:59:59,746 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:59:59,746 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:59:59,747 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:59:59,747 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 04:59:59,747 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:59:59,748 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:59:59,750 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:59:59,751 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:59:59,751 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:59:59,751 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:59:59,751 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:59:59,753 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:59:59,753 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 04:59:59,756 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:59:59,756 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:59:59,756 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:59:59,756 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:59:59,759 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 04:59:59,759 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 04:59:59,768 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-14 04:59:59,786 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2019-01-14 04:59:59,786 INFO L444 ModelExtractionUtils]: 12 out of 19 variables were initially zero. Simplification set additionally 4 variables to zero. [2019-01-14 04:59:59,789 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-14 04:59:59,790 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-01-14 04:59:59,790 INFO L518 LassoAnalysis]: Proved termination. [2019-01-14 04:59:59,790 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_entry_point_~j~0) = 2*ULTIMATE.start_entry_point_~j~0 + 1 Supporting invariants [] [2019-01-14 04:59:59,959 INFO L297 tatePredicateManager]: 6 out of 6 supporting invariants were superfluous and have been removed [2019-01-14 05:00:00,235 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 05:00:00,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 05:00:00,282 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 05:00:00,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 05:00:00,316 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 05:00:00,477 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 05:00:00,477 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 05:00:00,477 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 17 states and 19 transitions. cyclomatic complexity: 4 Second operand 3 states. [2019-01-14 05:00:00,570 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 17 states and 19 transitions. cyclomatic complexity: 4. Second operand 3 states. Result 19 states and 22 transitions. Complement of second has 4 states. [2019-01-14 05:00:00,572 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2019-01-14 05:00:00,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-01-14 05:00:00,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 15 transitions. [2019-01-14 05:00:00,574 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 15 transitions. Stem has 15 letters. Loop has 2 letters. [2019-01-14 05:00:00,575 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 05:00:00,575 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 15 transitions. Stem has 17 letters. Loop has 2 letters. [2019-01-14 05:00:00,575 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 05:00:00,575 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 15 transitions. Stem has 15 letters. Loop has 4 letters. [2019-01-14 05:00:00,579 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 05:00:00,579 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 19 states and 22 transitions. [2019-01-14 05:00:00,580 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-01-14 05:00:00,581 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 19 states to 0 states and 0 transitions. [2019-01-14 05:00:00,581 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2019-01-14 05:00:00,581 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2019-01-14 05:00:00,581 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2019-01-14 05:00:00,581 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-14 05:00:00,582 INFO L706 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-14 05:00:00,589 INFO L729 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-14 05:00:00,589 INFO L609 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-14 05:00:00,589 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2019-01-14 05:00:00,589 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2019-01-14 05:00:00,590 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-01-14 05:00:00,590 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2019-01-14 05:00:00,606 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 14.01 05:00:00 BoogieIcfgContainer [2019-01-14 05:00:00,614 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2019-01-14 05:00:00,614 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-14 05:00:00,615 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-14 05:00:00,615 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-14 05:00:00,616 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 04:59:51" (3/4) ... [2019-01-14 05:00:00,633 INFO L147 WitnessPrinter]: No result that supports witness generation found [2019-01-14 05:00:00,633 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-14 05:00:00,634 INFO L168 Benchmark]: Toolchain (without parser) took 10373.46 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 303.6 MB). Free memory was 947.3 MB in the beginning and 1.3 GB in the end (delta: -304.4 MB). There was no memory consumed. Max. memory is 11.5 GB. [2019-01-14 05:00:00,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 05:00:00,640 INFO L168 Benchmark]: CACSL2BoogieTranslator took 869.40 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 150.5 MB). Free memory was 947.3 MB in the beginning and 1.1 GB in the end (delta: -170.9 MB). Peak memory consumption was 37.2 MB. Max. memory is 11.5 GB. [2019-01-14 05:00:00,642 INFO L168 Benchmark]: Boogie Procedure Inliner took 73.80 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 05:00:00,642 INFO L168 Benchmark]: Boogie Preprocessor took 47.45 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 05:00:00,643 INFO L168 Benchmark]: RCFGBuilder took 496.11 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 17.7 MB). Peak memory consumption was 17.7 MB. Max. memory is 11.5 GB. [2019-01-14 05:00:00,647 INFO L168 Benchmark]: BuchiAutomizer took 8862.85 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 153.1 MB). Free memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: -160.3 MB). There was no memory consumed. Max. memory is 11.5 GB. [2019-01-14 05:00:00,650 INFO L168 Benchmark]: Witness Printer took 18.51 ms. Allocated memory is still 1.3 GB. Free memory was 1.3 GB in the beginning and 1.3 GB in the end (delta: 9.2 MB). Peak memory consumption was 9.2 MB. Max. memory is 11.5 GB. [2019-01-14 05:00:00,664 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 869.40 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 150.5 MB). Free memory was 947.3 MB in the beginning and 1.1 GB in the end (delta: -170.9 MB). Peak memory consumption was 37.2 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 73.80 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 47.45 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 496.11 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 17.7 MB). Peak memory consumption was 17.7 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 8862.85 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 153.1 MB). Free memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: -160.3 MB). There was no memory consumed. Max. memory is 11.5 GB. * Witness Printer took 18.51 ms. Allocated memory is still 1.3 GB. Free memory was 1.3 GB in the beginning and 1.3 GB in the end (delta: 9.2 MB). Peak memory consumption was 9.2 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 5 terminating modules (3 trivial, 2 deterministic, 0 nondeterministic). One deterministic module has affine ranking function len + -1 * i and consists of 3 locations. One deterministic module has affine ranking function 2 * j + 1 and consists of 3 locations. 3 modules have a trivial ranking function, the largest among these consists of 4 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 8.7s and 6 iterations. TraceHistogramMax:2. Analysis of lassos took 7.5s. Construction of modules took 0.2s. Büchi inclusion checks took 0.7s. Highest rank in rank-based complementation 3. Minimization of det autom 2. Minimization of nondet autom 3. Automata minimization 0.0s AutomataMinimizationTime, 4 MinimizatonAttempts, 16 StatesRemovedByMinimization, 3 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 17 states and ocurred in iteration 2. Nontrivial modules had stage [2, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 85 SDtfs, 59 SDslu, 71 SDs, 0 SdLazy, 59 SolverSat, 7 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.2s Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc1 concLT0 SILN0 SILU2 SILI0 SILT0 lasso2 LassoPreprocessingBenchmarks: Lassos: inital246 mio100 ax112 hnf101 lsp82 ukn55 mio100 lsp52 div100 bol100 ite100 ukn100 eq187 hnf87 smp100 dnf253 smp66 tf100 neg94 sie124 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 161ms VariablesStem: 7 VariablesLoop: 8 DisjunctsStem: 3 DisjunctsLoop: 2 SupportingInvariants: 4 MotzkinApplications: 24 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...