./Ultimate.py --spec /storage/repos/svcomp/c/properties/termination.prp --file /storage/repos/svcomp/c/termination-memory-alloca/java_AG313-alloca_true-termination.c.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 2e94e6aa Calling Ultimate with: java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i /storage/repos/svcomp/c/termination-memory-alloca/java_AG313-alloca_true-termination.c.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash b64613d278f1b2a5aec6d84cb3470147257700f5 ....................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-2e94e6a [2019-01-01 21:50:19,357 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-01 21:50:19,359 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-01 21:50:19,376 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-01 21:50:19,380 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-01 21:50:19,381 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-01 21:50:19,385 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-01 21:50:19,388 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-01 21:50:19,391 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-01 21:50:19,392 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-01 21:50:19,396 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-01 21:50:19,397 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-01 21:50:19,398 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-01 21:50:19,399 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-01 21:50:19,403 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-01 21:50:19,404 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-01 21:50:19,405 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-01 21:50:19,414 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-01 21:50:19,418 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-01 21:50:19,422 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-01 21:50:19,423 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-01 21:50:19,426 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-01 21:50:19,431 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-01 21:50:19,432 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-01 21:50:19,433 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-01 21:50:19,434 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-01 21:50:19,437 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-01 21:50:19,438 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-01 21:50:19,438 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-01 21:50:19,441 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-01 21:50:19,441 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-01 21:50:19,443 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-01 21:50:19,443 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-01 21:50:19,443 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-01 21:50:19,445 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-01 21:50:19,446 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-01 21:50:19,447 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf [2019-01-01 21:50:19,468 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-01 21:50:19,469 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-01 21:50:19,471 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-01 21:50:19,471 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-01 21:50:19,471 INFO L133 SettingsManager]: * Use SBE=true [2019-01-01 21:50:19,471 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-01-01 21:50:19,472 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-01-01 21:50:19,472 INFO L133 SettingsManager]: * Use old map elimination=false [2019-01-01 21:50:19,472 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2019-01-01 21:50:19,472 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2019-01-01 21:50:19,472 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-01-01 21:50:19,472 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-01 21:50:19,474 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-01-01 21:50:19,474 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-01 21:50:19,474 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-01 21:50:19,474 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-01-01 21:50:19,474 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-01-01 21:50:19,474 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-01-01 21:50:19,475 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-01 21:50:19,476 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-01-01 21:50:19,476 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-01 21:50:19,476 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-01-01 21:50:19,476 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-01 21:50:19,477 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-01 21:50:19,477 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-01-01 21:50:19,477 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-01 21:50:19,477 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-01 21:50:19,478 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-01-01 21:50:19,479 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-01-01 21:50:19,479 INFO L133 SettingsManager]: * TransformationType=MODULO_NEIGHBOR Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(F end) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> b64613d278f1b2a5aec6d84cb3470147257700f5 [2019-01-01 21:50:19,537 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-01 21:50:19,559 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-01 21:50:19,566 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-01 21:50:19,568 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-01 21:50:19,568 INFO L276 PluginConnector]: CDTParser initialized [2019-01-01 21:50:19,569 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/termination-memory-alloca/java_AG313-alloca_true-termination.c.i [2019-01-01 21:50:19,632 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a3d3efc0b/61f0ed632c3940b0a0092150b70b740b/FLAG2b9c78b47 [2019-01-01 21:50:20,231 INFO L307 CDTParser]: Found 1 translation units. [2019-01-01 21:50:20,231 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/termination-memory-alloca/java_AG313-alloca_true-termination.c.i [2019-01-01 21:50:20,250 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a3d3efc0b/61f0ed632c3940b0a0092150b70b740b/FLAG2b9c78b47 [2019-01-01 21:50:20,464 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a3d3efc0b/61f0ed632c3940b0a0092150b70b740b [2019-01-01 21:50:20,468 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-01 21:50:20,470 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-01-01 21:50:20,470 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-01 21:50:20,471 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-01 21:50:20,474 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-01 21:50:20,475 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.01 09:50:20" (1/1) ... [2019-01-01 21:50:20,479 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2f4fbf7a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:50:20, skipping insertion in model container [2019-01-01 21:50:20,480 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.01 09:50:20" (1/1) ... [2019-01-01 21:50:20,490 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-01 21:50:20,531 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-01 21:50:20,852 INFO L204 PostProcessor]: Analyzing one entry point: main [2019-01-01 21:50:20,864 INFO L191 MainTranslator]: Completed pre-run [2019-01-01 21:50:20,979 INFO L204 PostProcessor]: Analyzing one entry point: main [2019-01-01 21:50:21,044 INFO L195 MainTranslator]: Completed translation [2019-01-01 21:50:21,044 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:50:21 WrapperNode [2019-01-01 21:50:21,045 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-01 21:50:21,046 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-01 21:50:21,046 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-01 21:50:21,046 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-01 21:50:21,056 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:50:21" (1/1) ... [2019-01-01 21:50:21,074 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:50:21" (1/1) ... [2019-01-01 21:50:21,099 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-01 21:50:21,099 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-01 21:50:21,100 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-01 21:50:21,100 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-01 21:50:21,111 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:50:21" (1/1) ... [2019-01-01 21:50:21,112 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:50:21" (1/1) ... [2019-01-01 21:50:21,116 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:50:21" (1/1) ... [2019-01-01 21:50:21,116 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:50:21" (1/1) ... [2019-01-01 21:50:21,128 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:50:21" (1/1) ... [2019-01-01 21:50:21,135 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:50:21" (1/1) ... [2019-01-01 21:50:21,138 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:50:21" (1/1) ... [2019-01-01 21:50:21,146 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-01 21:50:21,148 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-01 21:50:21,148 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-01 21:50:21,148 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-01 21:50:21,151 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:50:21" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 21:50:21,211 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-01-01 21:50:21,211 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-01-01 21:50:21,212 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-01-01 21:50:21,212 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-01-01 21:50:21,212 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-01 21:50:21,212 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-01 21:50:21,538 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-01 21:50:21,538 INFO L280 CfgBuilder]: Removed 7 assue(true) statements. [2019-01-01 21:50:21,539 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.01 09:50:21 BoogieIcfgContainer [2019-01-01 21:50:21,539 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-01 21:50:21,540 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-01-01 21:50:21,540 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-01-01 21:50:21,544 INFO L276 PluginConnector]: BuchiAutomizer initialized [2019-01-01 21:50:21,545 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-01 21:50:21,545 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 01.01 09:50:20" (1/3) ... [2019-01-01 21:50:21,547 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@a59a187 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 01.01 09:50:21, skipping insertion in model container [2019-01-01 21:50:21,547 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-01 21:50:21,547 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:50:21" (2/3) ... [2019-01-01 21:50:21,548 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@a59a187 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 01.01 09:50:21, skipping insertion in model container [2019-01-01 21:50:21,548 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-01 21:50:21,548 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.01 09:50:21" (3/3) ... [2019-01-01 21:50:21,550 INFO L375 chiAutomizerObserver]: Analyzing ICFG java_AG313-alloca_true-termination.c.i [2019-01-01 21:50:21,638 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-01 21:50:21,639 INFO L374 BuchiCegarLoop]: Interprodecural is true [2019-01-01 21:50:21,639 INFO L375 BuchiCegarLoop]: Hoare is false [2019-01-01 21:50:21,639 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-01-01 21:50:21,639 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-01 21:50:21,640 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-01 21:50:21,640 INFO L379 BuchiCegarLoop]: Difference is false [2019-01-01 21:50:21,640 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-01 21:50:21,640 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-01-01 21:50:21,656 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 11 states. [2019-01-01 21:50:21,683 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-01-01 21:50:21,685 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 21:50:21,685 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 21:50:21,692 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2019-01-01 21:50:21,692 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-01-01 21:50:21,692 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2019-01-01 21:50:21,693 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 11 states. [2019-01-01 21:50:21,694 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-01-01 21:50:21,694 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 21:50:21,694 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 21:50:21,695 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2019-01-01 21:50:21,695 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-01-01 21:50:21,704 INFO L794 eck$LassoCheckResult]: Stem: 5#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 3#L-1true havoc main_#res;havoc main_#t~nondet13, main_#t~nondet14, main_#t~ret15;quot_#in~x, quot_#in~y := main_#t~nondet13, main_#t~nondet14;havoc quot_#res;havoc quot_#t~malloc2.base, quot_#t~malloc2.offset, quot_#t~malloc3.base, quot_#t~malloc3.offset, quot_#t~malloc4.base, quot_#t~malloc4.offset, quot_#t~mem5, quot_#t~mem9, quot_#t~mem10, quot_#t~mem11, quot_#t~mem6, quot_#t~mem7, quot_#t~short8, quot_#t~mem12, quot_~x, quot_~y, quot_~x_ref~0.base, quot_~x_ref~0.offset, quot_~y_ref~0.base, quot_~y_ref~0.offset, quot_~i~0.base, quot_~i~0.offset;quot_~x := quot_#in~x;quot_~y := quot_#in~y;call quot_#t~malloc2.base, quot_#t~malloc2.offset := #Ultimate.allocOnStack(4);quot_~x_ref~0.base, quot_~x_ref~0.offset := quot_#t~malloc2.base, quot_#t~malloc2.offset;call quot_#t~malloc3.base, quot_#t~malloc3.offset := #Ultimate.allocOnStack(4);quot_~y_ref~0.base, quot_~y_ref~0.offset := quot_#t~malloc3.base, quot_#t~malloc3.offset;call quot_#t~malloc4.base, quot_#t~malloc4.offset := #Ultimate.allocOnStack(4);quot_~i~0.base, quot_~i~0.offset := quot_#t~malloc4.base, quot_#t~malloc4.offset;call write~int(quot_~x, quot_~x_ref~0.base, quot_~x_ref~0.offset, 4);call write~int(quot_~y, quot_~y_ref~0.base, quot_~y_ref~0.offset, 4);call write~int(0, quot_~i~0.base, quot_~i~0.offset, 4);call quot_#t~mem5 := read~int(quot_~x_ref~0.base, quot_~x_ref~0.offset, 4); 10#L555true assume !(0 == quot_#t~mem5);havoc quot_#t~mem5; 7#L556-5true [2019-01-01 21:50:21,704 INFO L796 eck$LassoCheckResult]: Loop: 7#L556-5true call quot_#t~mem6 := read~int(quot_~x_ref~0.base, quot_~x_ref~0.offset, 4);quot_#t~short8 := quot_#t~mem6 > 0; 11#L556-1true assume !quot_#t~short8; 4#L556-3true assume !!quot_#t~short8;havoc quot_#t~mem6;havoc quot_#t~short8;havoc quot_#t~mem7;call quot_#t~mem9 := read~int(quot_~i~0.base, quot_~i~0.offset, 4);call write~int(1 + quot_#t~mem9, quot_~i~0.base, quot_~i~0.offset, 4);havoc quot_#t~mem9;call quot_#t~mem10 := read~int(quot_~x_ref~0.base, quot_~x_ref~0.offset, 4);call quot_#t~mem11 := read~int(quot_~y_ref~0.base, quot_~y_ref~0.offset, 4);call write~int(quot_#t~mem10 - 1 - (quot_#t~mem11 - 1), quot_~x_ref~0.base, quot_~x_ref~0.offset, 4);havoc quot_#t~mem11;havoc quot_#t~mem10; 7#L556-5true [2019-01-01 21:50:21,710 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:50:21,711 INFO L82 PathProgramCache]: Analyzing trace with hash 29860, now seen corresponding path program 1 times [2019-01-01 21:50:21,713 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:50:21,714 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:50:21,766 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:50:21,766 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 21:50:21,766 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:50:21,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:50:21,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:50:21,888 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:50:21,889 INFO L82 PathProgramCache]: Analyzing trace with hash 41873, now seen corresponding path program 1 times [2019-01-01 21:50:21,889 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:50:21,889 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:50:21,891 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:50:21,891 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 21:50:21,891 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:50:21,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:50:21,999 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 21:50:22,001 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 21:50:22,004 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-01 21:50:22,009 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-01-01 21:50:22,029 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-01 21:50:22,030 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-01 21:50:22,033 INFO L87 Difference]: Start difference. First operand 11 states. Second operand 3 states. [2019-01-01 21:50:22,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 21:50:22,154 INFO L93 Difference]: Finished difference Result 12 states and 14 transitions. [2019-01-01 21:50:22,155 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-01 21:50:22,157 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 12 states and 14 transitions. [2019-01-01 21:50:22,159 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-01-01 21:50:22,166 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 12 states to 6 states and 6 transitions. [2019-01-01 21:50:22,167 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 6 [2019-01-01 21:50:22,171 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 6 [2019-01-01 21:50:22,172 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 6 transitions. [2019-01-01 21:50:22,172 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-01 21:50:22,173 INFO L705 BuchiCegarLoop]: Abstraction has 6 states and 6 transitions. [2019-01-01 21:50:22,204 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6 states and 6 transitions. [2019-01-01 21:50:22,211 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6 to 6. [2019-01-01 21:50:22,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2019-01-01 21:50:22,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 6 transitions. [2019-01-01 21:50:22,213 INFO L728 BuchiCegarLoop]: Abstraction has 6 states and 6 transitions. [2019-01-01 21:50:22,214 INFO L608 BuchiCegarLoop]: Abstraction has 6 states and 6 transitions. [2019-01-01 21:50:22,214 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2019-01-01 21:50:22,214 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 6 states and 6 transitions. [2019-01-01 21:50:22,214 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-01-01 21:50:22,215 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 21:50:22,215 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 21:50:22,215 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2019-01-01 21:50:22,215 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-01-01 21:50:22,216 INFO L794 eck$LassoCheckResult]: Stem: 36#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 32#L-1 havoc main_#res;havoc main_#t~nondet13, main_#t~nondet14, main_#t~ret15;quot_#in~x, quot_#in~y := main_#t~nondet13, main_#t~nondet14;havoc quot_#res;havoc quot_#t~malloc2.base, quot_#t~malloc2.offset, quot_#t~malloc3.base, quot_#t~malloc3.offset, quot_#t~malloc4.base, quot_#t~malloc4.offset, quot_#t~mem5, quot_#t~mem9, quot_#t~mem10, quot_#t~mem11, quot_#t~mem6, quot_#t~mem7, quot_#t~short8, quot_#t~mem12, quot_~x, quot_~y, quot_~x_ref~0.base, quot_~x_ref~0.offset, quot_~y_ref~0.base, quot_~y_ref~0.offset, quot_~i~0.base, quot_~i~0.offset;quot_~x := quot_#in~x;quot_~y := quot_#in~y;call quot_#t~malloc2.base, quot_#t~malloc2.offset := #Ultimate.allocOnStack(4);quot_~x_ref~0.base, quot_~x_ref~0.offset := quot_#t~malloc2.base, quot_#t~malloc2.offset;call quot_#t~malloc3.base, quot_#t~malloc3.offset := #Ultimate.allocOnStack(4);quot_~y_ref~0.base, quot_~y_ref~0.offset := quot_#t~malloc3.base, quot_#t~malloc3.offset;call quot_#t~malloc4.base, quot_#t~malloc4.offset := #Ultimate.allocOnStack(4);quot_~i~0.base, quot_~i~0.offset := quot_#t~malloc4.base, quot_#t~malloc4.offset;call write~int(quot_~x, quot_~x_ref~0.base, quot_~x_ref~0.offset, 4);call write~int(quot_~y, quot_~y_ref~0.base, quot_~y_ref~0.offset, 4);call write~int(0, quot_~i~0.base, quot_~i~0.offset, 4);call quot_#t~mem5 := read~int(quot_~x_ref~0.base, quot_~x_ref~0.offset, 4); 33#L555 assume !(0 == quot_#t~mem5);havoc quot_#t~mem5; 35#L556-5 [2019-01-01 21:50:22,216 INFO L796 eck$LassoCheckResult]: Loop: 35#L556-5 call quot_#t~mem6 := read~int(quot_~x_ref~0.base, quot_~x_ref~0.offset, 4);quot_#t~short8 := quot_#t~mem6 > 0; 37#L556-1 assume quot_#t~short8;call quot_#t~mem7 := read~int(quot_~y_ref~0.base, quot_~y_ref~0.offset, 4);quot_#t~short8 := quot_#t~mem7 > 0; 34#L556-3 assume !!quot_#t~short8;havoc quot_#t~mem6;havoc quot_#t~short8;havoc quot_#t~mem7;call quot_#t~mem9 := read~int(quot_~i~0.base, quot_~i~0.offset, 4);call write~int(1 + quot_#t~mem9, quot_~i~0.base, quot_~i~0.offset, 4);havoc quot_#t~mem9;call quot_#t~mem10 := read~int(quot_~x_ref~0.base, quot_~x_ref~0.offset, 4);call quot_#t~mem11 := read~int(quot_~y_ref~0.base, quot_~y_ref~0.offset, 4);call write~int(quot_#t~mem10 - 1 - (quot_#t~mem11 - 1), quot_~x_ref~0.base, quot_~x_ref~0.offset, 4);havoc quot_#t~mem11;havoc quot_#t~mem10; 35#L556-5 [2019-01-01 21:50:22,216 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:50:22,216 INFO L82 PathProgramCache]: Analyzing trace with hash 29860, now seen corresponding path program 2 times [2019-01-01 21:50:22,216 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:50:22,216 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:50:22,218 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:50:22,218 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 21:50:22,218 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:50:22,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:50:22,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:50:22,270 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:50:22,275 INFO L82 PathProgramCache]: Analyzing trace with hash 41811, now seen corresponding path program 1 times [2019-01-01 21:50:22,275 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:50:22,275 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:50:22,277 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:50:22,279 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 21:50:22,279 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:50:22,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:50:22,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:50:22,336 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:50:22,336 INFO L82 PathProgramCache]: Analyzing trace with hash 889571280, now seen corresponding path program 1 times [2019-01-01 21:50:22,339 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:50:22,339 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:50:22,341 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:50:22,341 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 21:50:22,341 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:50:22,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:50:22,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:50:22,967 WARN L181 SmtUtils]: Spent 546.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 59 [2019-01-01 21:50:23,207 WARN L181 SmtUtils]: Spent 222.00 ms on a formula simplification that was a NOOP. DAG size: 53 [2019-01-01 21:50:24,067 WARN L181 SmtUtils]: Spent 855.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 94 [2019-01-01 21:50:24,230 WARN L181 SmtUtils]: Spent 159.00 ms on a formula simplification that was a NOOP. DAG size: 90 [2019-01-01 21:50:24,250 INFO L216 LassoAnalysis]: Preferences: [2019-01-01 21:50:24,251 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-01 21:50:24,251 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-01 21:50:24,252 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-01 21:50:24,252 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-01 21:50:24,252 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 21:50:24,252 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-01 21:50:24,252 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-01 21:50:24,253 INFO L131 ssoRankerPreferences]: Filename of dumped script: java_AG313-alloca_true-termination.c.i_Iteration2_Lasso [2019-01-01 21:50:24,253 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-01 21:50:24,253 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-01 21:50:24,280 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:50:24,290 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:50:24,292 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:50:24,308 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:50:24,335 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:50:24,350 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:50:24,357 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:50:24,380 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:50:24,386 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:50:24,404 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:50:24,407 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:50:24,410 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:50:24,414 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:50:24,418 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:50:24,422 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:50:24,986 WARN L181 SmtUtils]: Spent 400.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 79 [2019-01-01 21:50:25,152 WARN L181 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 59 [2019-01-01 21:50:25,153 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:50:25,156 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:50:25,158 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:50:25,592 WARN L181 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 35 [2019-01-01 21:50:26,526 WARN L181 SmtUtils]: Spent 728.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 38 [2019-01-01 21:50:26,744 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-01 21:50:26,749 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-01 21:50:26,752 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:50:26,753 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:50:26,754 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:50:26,754 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:50:26,755 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:50:26,755 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:50:26,757 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:50:26,757 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:50:26,759 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:50:26,760 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:50:26,760 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:50:26,760 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:50:26,761 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:50:26,761 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:50:26,761 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:50:26,761 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:50:26,761 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:50:26,762 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:50:26,763 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:50:26,763 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:50:26,763 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:50:26,763 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:50:26,764 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:50:26,766 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:50:26,766 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:50:26,770 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:50:26,771 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:50:26,771 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:50:26,772 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:50:26,772 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:50:26,772 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:50:26,772 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:50:26,773 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:50:26,773 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:50:26,774 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:50:26,774 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:50:26,775 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:50:26,775 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:50:26,775 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:50:26,775 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:50:26,775 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:50:26,776 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:50:26,776 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:50:26,776 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:50:26,777 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:50:26,777 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:50:26,777 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:50:26,777 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:50:26,778 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:50:26,780 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:50:26,780 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:50:26,784 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:50:26,785 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:50:26,785 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:50:26,785 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:50:26,785 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:50:26,786 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:50:26,786 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:50:26,786 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:50:26,786 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:50:26,787 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:50:26,788 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:50:26,788 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:50:26,788 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:50:26,789 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:50:26,789 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:50:26,789 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:50:26,789 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:50:26,789 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:50:26,790 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:50:26,791 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:50:26,791 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:50:26,791 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:50:26,791 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:50:26,792 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:50:26,794 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:50:26,794 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:50:26,799 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:50:26,799 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:50:26,800 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:50:26,800 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:50:26,800 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:50:26,801 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:50:26,805 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:50:26,806 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:50:26,815 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:50:26,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-01 21:50:26,818 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:50:26,818 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:50:26,818 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:50:26,819 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:50:26,821 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:50:26,821 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:50:26,827 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:50:26,827 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:50:26,828 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:50:26,828 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:50:26,828 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:50:26,828 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:50:26,828 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:50:26,829 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:50:26,829 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:50:26,832 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:50:26,833 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:50:26,833 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:50:26,833 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:50:26,833 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:50:26,834 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:50:26,834 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:50:26,834 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:50:26,834 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:50:26,837 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:50:26,838 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:50:26,838 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:50:26,839 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:50:26,839 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:50:26,839 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:50:26,839 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:50:26,840 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:50:26,840 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:50:26,841 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:50:26,843 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:50:26,844 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:50:26,844 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:50:26,844 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:50:26,844 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:50:26,848 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:50:26,848 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:50:26,859 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:50:26,859 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:50:26,860 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:50:26,860 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:50:26,860 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:50:26,860 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:50:26,864 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:50:26,864 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:50:26,879 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:50:26,880 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:50:26,881 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:50:26,881 INFO L205 nArgumentSynthesizer]: 8 stem disjuncts [2019-01-01 21:50:26,881 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:50:26,881 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:50:26,903 INFO L402 nArgumentSynthesizer]: We have 20 Motzkin's Theorem applications. [2019-01-01 21:50:26,903 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:50:27,001 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:50:27,002 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:50:27,002 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:50:27,002 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:50:27,003 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:50:27,003 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:50:27,006 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:50:27,008 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:50:27,010 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:50:27,011 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:50:27,012 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:50:27,012 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:50:27,012 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:50:27,012 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:50:27,018 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:50:27,019 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:50:27,058 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:50:27,058 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:50:27,059 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:50:27,059 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:50:27,059 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:50:27,059 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:50:27,060 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:50:27,060 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:50:27,075 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:50:27,081 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:50:27,083 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:50:27,083 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:50:27,083 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:50:27,084 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:50:27,086 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:50:27,087 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:50:27,093 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:50:27,094 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:50:27,094 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:50:27,096 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2019-01-01 21:50:27,096 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:50:27,096 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:50:27,100 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2019-01-01 21:50:27,101 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:50:27,126 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-01 21:50:27,140 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-01-01 21:50:27,141 INFO L444 ModelExtractionUtils]: 25 out of 28 variables were initially zero. Simplification set additionally 1 variables to zero. [2019-01-01 21:50:27,143 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-01 21:50:27,144 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-01-01 21:50:27,145 INFO L518 LassoAnalysis]: Proved termination. [2019-01-01 21:50:27,145 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_quot_~x_ref~0.base) ULTIMATE.start_quot_~x_ref~0.offset)_1) = 1*v_rep(select (select #memory_int ULTIMATE.start_quot_~x_ref~0.base) ULTIMATE.start_quot_~x_ref~0.offset)_1 Supporting invariants [] [2019-01-01 21:50:27,465 INFO L297 tatePredicateManager]: 22 out of 24 supporting invariants were superfluous and have been removed [2019-01-01 21:50:27,476 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-01-01 21:50:27,512 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:50:27,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:50:27,547 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:50:27,582 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 40 [2019-01-01 21:50:27,587 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-01-01 21:50:27,588 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-01 21:50:27,690 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 39 treesize of output 46 [2019-01-01 21:50:27,807 WARN L181 SmtUtils]: Spent 109.00 ms on a formula simplification that was a NOOP. DAG size: 50 [2019-01-01 21:50:27,811 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 30 [2019-01-01 21:50:27,812 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-01 21:50:27,820 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 25 [2019-01-01 21:50:27,821 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-01 21:50:27,921 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 17 [2019-01-01 21:50:27,922 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-01-01 21:50:27,926 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 22 [2019-01-01 21:50:27,927 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-01-01 21:50:28,009 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 29 [2019-01-01 21:50:28,015 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 12 [2019-01-01 21:50:28,016 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-01-01 21:50:28,036 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 11 [2019-01-01 21:50:28,037 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2019-01-01 21:50:28,052 INFO L267 ElimStorePlain]: Start of recursive call 9: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-01-01 21:50:28,067 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 26 [2019-01-01 21:50:28,085 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-01-01 21:50:28,086 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2019-01-01 21:50:28,106 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 10 [2019-01-01 21:50:28,106 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2019-01-01 21:50:28,122 INFO L267 ElimStorePlain]: Start of recursive call 12: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-01-01 21:50:28,224 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 12 [2019-01-01 21:50:28,228 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2019-01-01 21:50:28,229 INFO L267 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 1 xjuncts. [2019-01-01 21:50:28,232 INFO L267 ElimStorePlain]: Start of recursive call 15: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 21:50:28,235 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 18 [2019-01-01 21:50:28,243 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2019-01-01 21:50:28,244 INFO L267 ElimStorePlain]: Start of recursive call 18: End of recursive call: and 1 xjuncts. [2019-01-01 21:50:28,250 INFO L267 ElimStorePlain]: Start of recursive call 17: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 21:50:28,279 INFO L267 ElimStorePlain]: Start of recursive call 4: 2 dim-1 vars, 3 dim-2 vars, End of recursive call: and 3 xjuncts. [2019-01-01 21:50:28,295 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 3 xjuncts. [2019-01-01 21:50:28,319 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2019-01-01 21:50:28,320 INFO L202 ElimStorePlain]: Needed 18 recursive calls to eliminate 4 variables, input treesize:68, output treesize:21 [2019-01-01 21:50:28,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:50:28,366 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:50:28,634 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 21:50:28,638 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 3 loop predicates [2019-01-01 21:50:28,639 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 6 states and 6 transitions. cyclomatic complexity: 1 Second operand 5 states. [2019-01-01 21:50:28,756 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 6 states and 6 transitions. cyclomatic complexity: 1. Second operand 5 states. Result 9 states and 10 transitions. Complement of second has 7 states. [2019-01-01 21:50:28,758 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 2 stem states 2 non-accepting loop states 1 accepting loop states [2019-01-01 21:50:28,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2019-01-01 21:50:28,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 6 transitions. [2019-01-01 21:50:28,761 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 6 transitions. Stem has 3 letters. Loop has 3 letters. [2019-01-01 21:50:28,761 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:50:28,761 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 6 transitions. Stem has 6 letters. Loop has 3 letters. [2019-01-01 21:50:28,761 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:50:28,761 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 6 transitions. Stem has 3 letters. Loop has 6 letters. [2019-01-01 21:50:28,762 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:50:28,762 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 9 states and 10 transitions. [2019-01-01 21:50:28,763 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-01-01 21:50:28,763 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 9 states to 0 states and 0 transitions. [2019-01-01 21:50:28,763 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2019-01-01 21:50:28,763 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2019-01-01 21:50:28,763 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2019-01-01 21:50:28,763 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-01 21:50:28,763 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-01 21:50:28,764 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-01 21:50:28,764 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-01 21:50:28,764 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2019-01-01 21:50:28,764 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2019-01-01 21:50:28,764 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-01-01 21:50:28,764 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2019-01-01 21:50:28,770 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 01.01 09:50:28 BoogieIcfgContainer [2019-01-01 21:50:28,770 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2019-01-01 21:50:28,771 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-01 21:50:28,771 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-01 21:50:28,771 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-01 21:50:28,771 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.01 09:50:21" (3/4) ... [2019-01-01 21:50:28,774 INFO L147 WitnessPrinter]: No result that supports witness generation found [2019-01-01 21:50:28,774 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-01 21:50:28,775 INFO L168 Benchmark]: Toolchain (without parser) took 8306.76 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 199.8 MB). Free memory was 951.3 MB in the beginning and 925.0 MB in the end (delta: 26.3 MB). Peak memory consumption was 226.1 MB. Max. memory is 11.5 GB. [2019-01-01 21:50:28,777 INFO L168 Benchmark]: CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-01 21:50:28,777 INFO L168 Benchmark]: CACSL2BoogieTranslator took 574.51 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 126.9 MB). Free memory was 951.3 MB in the beginning and 1.1 GB in the end (delta: -155.0 MB). Peak memory consumption was 30.4 MB. Max. memory is 11.5 GB. [2019-01-01 21:50:28,778 INFO L168 Benchmark]: Boogie Procedure Inliner took 53.38 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-01 21:50:28,780 INFO L168 Benchmark]: Boogie Preprocessor took 47.96 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-01 21:50:28,780 INFO L168 Benchmark]: RCFGBuilder took 391.27 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 19.0 MB). Peak memory consumption was 19.0 MB. Max. memory is 11.5 GB. [2019-01-01 21:50:28,781 INFO L168 Benchmark]: BuchiAutomizer took 7230.60 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 72.9 MB). Free memory was 1.1 GB in the beginning and 925.0 MB in the end (delta: 162.3 MB). Peak memory consumption was 235.2 MB. Max. memory is 11.5 GB. [2019-01-01 21:50:28,783 INFO L168 Benchmark]: Witness Printer took 4.00 ms. Allocated memory is still 1.2 GB. Free memory is still 925.0 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-01 21:50:28,787 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.15 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 574.51 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 126.9 MB). Free memory was 951.3 MB in the beginning and 1.1 GB in the end (delta: -155.0 MB). Peak memory consumption was 30.4 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 53.38 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.96 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 391.27 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 19.0 MB). Peak memory consumption was 19.0 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 7230.60 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 72.9 MB). Free memory was 1.1 GB in the beginning and 925.0 MB in the end (delta: 162.3 MB). Peak memory consumption was 235.2 MB. Max. memory is 11.5 GB. * Witness Printer took 4.00 ms. Allocated memory is still 1.2 GB. Free memory is still 925.0 MB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 2 terminating modules (1 trivial, 1 deterministic, 0 nondeterministic). One deterministic module has affine ranking function unknown-#memory_int-unknown[x_ref][x_ref] and consists of 5 locations. 1 modules have a trivial ranking function, the largest among these consists of 3 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 7.1s and 3 iterations. TraceHistogramMax:1. Analysis of lassos took 5.5s. Construction of modules took 0.1s. Büchi inclusion checks took 1.2s. Highest rank in rank-based complementation 3. Minimization of det autom 2. Minimization of nondet autom 0. Automata minimization 0.0s AutomataMinimizationTime, 1 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 6 states and ocurred in iteration 1. Nontrivial modules had stage [1, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 14 SDtfs, 1 SDslu, 8 SDs, 0 SdLazy, 13 SolverSat, 7 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.1s Time LassoAnalysisResults: nont0 unkn0 SFLI1 SFLT0 conc0 concLT0 SILN0 SILU0 SILI0 SILT0 lasso1 LassoPreprocessingBenchmarks: Lassos: inital347 mio100 ax105 hnf100 lsp92 ukn57 mio100 lsp37 div100 bol100 ite100 ukn100 eq182 hnf88 smp94 dnf303 smp92 tf100 neg92 sie126 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 120ms VariablesStem: 7 VariablesLoop: 6 DisjunctsStem: 8 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 20 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...