./Ultimate.py --spec /storage/repos/svcomp/c/properties/termination.prp --file /storage/repos/svcomp/c/termination-memory-alloca/aviad_true-alloca_true-termination.c.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 91b1670e 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/aviad_true-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 3607a2efd08edc90448739913473b3ff26ff3cc3 ....................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-91b1670 [2018-11-28 23:19:35,027 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-28 23:19:35,029 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-28 23:19:35,042 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-28 23:19:35,042 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-28 23:19:35,043 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-28 23:19:35,045 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-28 23:19:35,047 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-28 23:19:35,048 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-28 23:19:35,049 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-28 23:19:35,050 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-28 23:19:35,051 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-28 23:19:35,052 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-28 23:19:35,053 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-28 23:19:35,055 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-28 23:19:35,056 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-28 23:19:35,057 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-28 23:19:35,059 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-28 23:19:35,062 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-28 23:19:35,064 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-28 23:19:35,065 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-28 23:19:35,067 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-28 23:19:35,070 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-28 23:19:35,070 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-28 23:19:35,070 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-28 23:19:35,071 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-28 23:19:35,073 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-28 23:19:35,074 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-28 23:19:35,076 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-28 23:19:35,077 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-28 23:19:35,077 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-28 23:19:35,078 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-28 23:19:35,078 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-28 23:19:35,079 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-28 23:19:35,080 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-28 23:19:35,081 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-28 23:19:35,082 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf [2018-11-28 23:19:35,099 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-28 23:19:35,099 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-28 23:19:35,101 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-28 23:19:35,101 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-28 23:19:35,101 INFO L133 SettingsManager]: * Use SBE=true [2018-11-28 23:19:35,101 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-11-28 23:19:35,102 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-11-28 23:19:35,102 INFO L133 SettingsManager]: * Use old map elimination=false [2018-11-28 23:19:35,102 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-11-28 23:19:35,102 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-11-28 23:19:35,102 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-11-28 23:19:35,103 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-28 23:19:35,105 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-28 23:19:35,106 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-28 23:19:35,106 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-28 23:19:35,106 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-11-28 23:19:35,106 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-11-28 23:19:35,106 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-11-28 23:19:35,107 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-28 23:19:35,107 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-11-28 23:19:35,107 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-28 23:19:35,107 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-11-28 23:19:35,107 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-28 23:19:35,107 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-28 23:19:35,110 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-11-28 23:19:35,110 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-28 23:19:35,111 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-28 23:19:35,111 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-11-28 23:19:35,115 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-11-28 23:19:35,115 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 -> 3607a2efd08edc90448739913473b3ff26ff3cc3 [2018-11-28 23:19:35,161 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-28 23:19:35,174 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-28 23:19:35,178 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-28 23:19:35,179 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-28 23:19:35,180 INFO L276 PluginConnector]: CDTParser initialized [2018-11-28 23:19:35,181 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/termination-memory-alloca/aviad_true-alloca_true-termination.c.i [2018-11-28 23:19:35,239 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/61c88a7c3/81ab57c9ab1e4bc297962fe4e78d7d43/FLAGf62f64ea3 [2018-11-28 23:19:35,779 INFO L307 CDTParser]: Found 1 translation units. [2018-11-28 23:19:35,780 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/termination-memory-alloca/aviad_true-alloca_true-termination.c.i [2018-11-28 23:19:35,795 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/61c88a7c3/81ab57c9ab1e4bc297962fe4e78d7d43/FLAGf62f64ea3 [2018-11-28 23:19:36,060 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/61c88a7c3/81ab57c9ab1e4bc297962fe4e78d7d43 [2018-11-28 23:19:36,064 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-28 23:19:36,066 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-28 23:19:36,067 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-28 23:19:36,067 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-28 23:19:36,072 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-28 23:19:36,074 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 11:19:36" (1/1) ... [2018-11-28 23:19:36,079 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@460492eb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:19:36, skipping insertion in model container [2018-11-28 23:19:36,080 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 11:19:36" (1/1) ... [2018-11-28 23:19:36,089 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-28 23:19:36,142 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-28 23:19:36,534 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-11-28 23:19:36,550 INFO L191 MainTranslator]: Completed pre-run [2018-11-28 23:19:36,607 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-11-28 23:19:36,665 INFO L195 MainTranslator]: Completed translation [2018-11-28 23:19:36,666 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:19:36 WrapperNode [2018-11-28 23:19:36,666 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-28 23:19:36,667 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-28 23:19:36,667 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-28 23:19:36,667 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-28 23:19:36,784 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:19:36" (1/1) ... [2018-11-28 23:19:36,802 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:19:36" (1/1) ... [2018-11-28 23:19:36,837 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-28 23:19:36,837 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-28 23:19:36,837 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-28 23:19:36,837 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-28 23:19:36,848 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:19:36" (1/1) ... [2018-11-28 23:19:36,849 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:19:36" (1/1) ... [2018-11-28 23:19:36,853 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:19:36" (1/1) ... [2018-11-28 23:19:36,853 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:19:36" (1/1) ... [2018-11-28 23:19:36,859 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:19:36" (1/1) ... [2018-11-28 23:19:36,864 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:19:36" (1/1) ... [2018-11-28 23:19:36,866 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:19:36" (1/1) ... [2018-11-28 23:19:36,869 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-28 23:19:36,870 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-28 23:19:36,870 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-28 23:19:36,870 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-28 23:19:36,871 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:19:36" (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 [2018-11-28 23:19:36,942 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-28 23:19:36,943 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-28 23:19:36,943 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-28 23:19:36,943 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-28 23:19:36,943 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-28 23:19:36,943 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-28 23:19:37,365 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-28 23:19:37,365 INFO L280 CfgBuilder]: Removed 7 assue(true) statements. [2018-11-28 23:19:37,366 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 11:19:37 BoogieIcfgContainer [2018-11-28 23:19:37,366 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-28 23:19:37,373 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-11-28 23:19:37,373 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-11-28 23:19:37,377 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-11-28 23:19:37,381 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-28 23:19:37,382 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 28.11 11:19:36" (1/3) ... [2018-11-28 23:19:37,385 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@6166c538 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 28.11 11:19:37, skipping insertion in model container [2018-11-28 23:19:37,385 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-28 23:19:37,385 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:19:36" (2/3) ... [2018-11-28 23:19:37,385 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@6166c538 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 28.11 11:19:37, skipping insertion in model container [2018-11-28 23:19:37,385 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-28 23:19:37,386 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 11:19:37" (3/3) ... [2018-11-28 23:19:37,387 INFO L375 chiAutomizerObserver]: Analyzing ICFG aviad_true-alloca_true-termination.c.i [2018-11-28 23:19:37,461 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-28 23:19:37,462 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-11-28 23:19:37,462 INFO L375 BuchiCegarLoop]: Hoare is false [2018-11-28 23:19:37,462 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-11-28 23:19:37,462 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-28 23:19:37,462 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-28 23:19:37,463 INFO L379 BuchiCegarLoop]: Difference is false [2018-11-28 23:19:37,463 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-28 23:19:37,463 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-11-28 23:19:37,479 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 11 states. [2018-11-28 23:19:37,503 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2018-11-28 23:19:37,503 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 23:19:37,503 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 23:19:37,511 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-28 23:19:37,511 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-11-28 23:19:37,511 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-11-28 23:19:37,512 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 11 states. [2018-11-28 23:19:37,513 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2018-11-28 23:19:37,513 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 23:19:37,513 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 23:19:37,514 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-28 23:19:37,514 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-11-28 23:19:37,523 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~ret14, main_~x~0, main_~count~1;main_~x~0 := main_#t~nondet13;havoc main_#t~nondet13;f_#in~a := main_~x~0;havoc f_#res;havoc f_#t~malloc2.base, f_#t~malloc2.offset, f_#t~malloc3.base, f_#t~malloc3.offset, f_#t~malloc4.base, f_#t~malloc4.offset, f_#t~mem6, f_#t~mem7, f_#t~mem8, f_#t~mem9, f_#t~mem10, f_#t~post11, f_#t~mem5, f_#t~mem12, f_~a, f_~a_ref~0.base, f_~a_ref~0.offset, f_~tmp~0.base, f_~tmp~0.offset, f_~count~0.base, f_~count~0.offset;f_~a := f_#in~a;call f_#t~malloc2.base, f_#t~malloc2.offset := #Ultimate.alloc(4);f_~a_ref~0.base, f_~a_ref~0.offset := f_#t~malloc2.base, f_#t~malloc2.offset;call f_#t~malloc3.base, f_#t~malloc3.offset := #Ultimate.alloc(4);f_~tmp~0.base, f_~tmp~0.offset := f_#t~malloc3.base, f_#t~malloc3.offset;call f_#t~malloc4.base, f_#t~malloc4.offset := #Ultimate.alloc(4);f_~count~0.base, f_~count~0.offset := f_#t~malloc4.base, f_#t~malloc4.offset;call write~int(f_~a, f_~a_ref~0.base, f_~a_ref~0.offset, 4);call write~int(0, f_~tmp~0.base, f_~tmp~0.offset, 4);call write~int(0, f_~count~0.base, f_~count~0.offset, 4); 6#L554-3true [2018-11-28 23:19:37,524 INFO L796 eck$LassoCheckResult]: Loop: 6#L554-3true call f_#t~mem5 := read~int(f_~a_ref~0.base, f_~a_ref~0.offset, 4); 4#L554-1true assume !!(f_#t~mem5 > 1);havoc f_#t~mem5;call f_#t~mem6 := read~int(f_~a_ref~0.base, f_~a_ref~0.offset, 4);call write~int((if f_#t~mem6 < 0 && 0 != f_#t~mem6 % 2 then f_#t~mem6 % 2 - 2 else f_#t~mem6 % 2), f_~tmp~0.base, f_~tmp~0.offset, 4);havoc f_#t~mem6;call f_#t~mem7 := read~int(f_~tmp~0.base, f_~tmp~0.offset, 4); 7#L556true assume !(0 == f_#t~mem7);havoc f_#t~mem7;call f_#t~mem9 := read~int(f_~a_ref~0.base, f_~a_ref~0.offset, 4);call write~int(f_#t~mem9 - 1, f_~a_ref~0.base, f_~a_ref~0.offset, 4);havoc f_#t~mem9; 13#L556-2true call f_#t~mem10 := read~int(f_~count~0.base, f_~count~0.offset, 4);f_#t~post11 := f_#t~mem10;call write~int(1 + f_#t~post11, f_~count~0.base, f_~count~0.offset, 4);havoc f_#t~mem10;havoc f_#t~post11; 6#L554-3true [2018-11-28 23:19:37,535 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:19:37,535 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2018-11-28 23:19:37,538 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:19:37,539 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:19:37,614 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:19:37,614 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:19:37,614 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:19:37,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:19:37,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:19:37,736 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:19:37,736 INFO L82 PathProgramCache]: Analyzing trace with hash 1144136, now seen corresponding path program 1 times [2018-11-28 23:19:37,737 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:19:37,737 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:19:37,739 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:19:37,739 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:19:37,739 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:19:37,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:19:37,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:19:37,822 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:19:37,822 INFO L82 PathProgramCache]: Analyzing trace with hash 889571338, now seen corresponding path program 1 times [2018-11-28 23:19:37,822 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:19:37,822 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:19:37,824 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:19:37,825 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:19:37,825 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:19:37,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:19:37,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:19:38,226 WARN L180 SmtUtils]: Spent 257.00 ms on a formula simplification that was a NOOP. DAG size: 71 [2018-11-28 23:19:38,726 WARN L180 SmtUtils]: Spent 485.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 54 [2018-11-28 23:19:39,607 WARN L180 SmtUtils]: Spent 876.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 81 [2018-11-28 23:19:39,842 WARN L180 SmtUtils]: Spent 232.00 ms on a formula simplification that was a NOOP. DAG size: 77 [2018-11-28 23:19:39,867 INFO L216 LassoAnalysis]: Preferences: [2018-11-28 23:19:39,868 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-28 23:19:39,869 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-28 23:19:39,869 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-28 23:19:39,869 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-28 23:19:39,869 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 23:19:39,869 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-28 23:19:39,870 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-28 23:19:39,870 INFO L131 ssoRankerPreferences]: Filename of dumped script: aviad_true-alloca_true-termination.c.i_Iteration1_Lasso [2018-11-28 23:19:39,871 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-28 23:19:39,871 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-28 23:19:39,906 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:19:39,936 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:19:39,939 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:19:40,447 WARN L180 SmtUtils]: Spent 356.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 66 [2018-11-28 23:19:40,628 WARN L180 SmtUtils]: Spent 168.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 61 [2018-11-28 23:19:40,629 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:19:40,632 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:19:40,643 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:19:40,662 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:19:40,665 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:19:40,668 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:19:40,671 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:19:40,674 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:19:40,677 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:19:40,680 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:19:40,682 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:19:40,686 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:19:40,689 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:19:40,691 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:19:40,694 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:19:40,696 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:19:40,698 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:19:41,442 WARN L180 SmtUtils]: Spent 171.00 ms on a formula simplification that was a NOOP. DAG size: 36 [2018-11-28 23:19:41,632 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-28 23:19:41,638 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-28 23:19:41,640 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 [2018-11-28 23:19:41,641 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:19:41,642 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:19:41,642 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:19:41,643 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:19:41,643 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:19:41,645 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:19:41,645 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:19:41,648 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:19:41,648 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 [2018-11-28 23:19:41,649 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:19:41,649 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:19:41,650 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:19:41,650 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:19:41,650 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:19:41,650 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:19:41,651 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:19:41,651 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:19:41,652 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 [2018-11-28 23:19:41,652 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:19:41,653 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:19:41,653 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:19:41,653 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:19:41,657 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:19:41,657 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:19:41,671 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:19:41,672 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 [2018-11-28 23:19:41,672 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:19:41,673 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-28 23:19:41,673 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:19:41,673 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:19:41,676 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-28 23:19:41,676 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:19:41,687 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:19:41,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 [2018-11-28 23:19:41,688 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:19:41,688 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-28 23:19:41,689 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:19:41,689 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:19:41,692 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-28 23:19:41,692 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:19:41,702 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:19:41,703 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 [2018-11-28 23:19:41,703 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:19:41,703 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:19:41,704 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:19:41,704 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:19:41,706 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:19:41,706 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:19:41,709 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:19:41,709 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 [2018-11-28 23:19:41,710 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:19:41,710 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:19:41,710 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:19:41,710 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:19:41,713 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:19:41,713 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:19:41,723 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:19:41,724 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 [2018-11-28 23:19:41,725 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:19:41,725 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:19:41,725 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:19:41,725 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:19:41,732 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:19:41,732 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:19:41,770 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:19:41,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 [2018-11-28 23:19:41,771 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:19:41,771 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-28 23:19:41,772 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:19:41,772 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:19:41,774 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-28 23:19:41,774 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:19:41,783 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:19:41,784 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 [2018-11-28 23:19:41,785 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:19:41,785 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:19:41,785 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:19:41,785 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:19:41,787 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:19:41,787 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:19:41,797 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:19:41,797 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 [2018-11-28 23:19:41,798 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:19:41,798 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:19:41,798 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:19:41,799 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:19:41,802 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:19:41,802 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:19:41,862 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-28 23:19:41,903 INFO L443 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. [2018-11-28 23:19:41,905 INFO L444 ModelExtractionUtils]: 13 out of 19 variables were initially zero. Simplification set additionally 4 variables to zero. [2018-11-28 23:19:41,908 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-28 23:19:41,911 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-28 23:19:41,911 INFO L518 LassoAnalysis]: Proved termination. [2018-11-28 23:19:41,912 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_f_~a_ref~0.base) ULTIMATE.start_f_~a_ref~0.offset)_1) = 1*v_rep(select (select #memory_int ULTIMATE.start_f_~a_ref~0.base) ULTIMATE.start_f_~a_ref~0.offset)_1 Supporting invariants [] [2018-11-28 23:19:42,234 INFO L297 tatePredicateManager]: 22 out of 24 supporting invariants were superfluous and have been removed [2018-11-28 23:19:42,246 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-28 23:19:42,278 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:19:42,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:19:42,315 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:19:42,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:19:42,338 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:19:42,454 WARN L307 Elim1Store]: Array PQE input equivalent to false [2018-11-28 23:19:42,454 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-28 23:19:42,559 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 2 new quantified variables, introduced 3 case distinctions, treesize of input 39 treesize of output 47 [2018-11-28 23:19:42,596 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 23:19:42,611 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 33 treesize of output 43 [2018-11-28 23:19:42,616 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-11-28 23:19:42,867 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 36 treesize of output 35 [2018-11-28 23:19:42,867 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-28 23:19:42,970 INFO L267 ElimStorePlain]: Start of recursive call 3: 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-11-28 23:19:43,077 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 2 new quantified variables, introduced 3 case distinctions, treesize of input 48 treesize of output 54 [2018-11-28 23:19:43,089 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 49 treesize of output 48 [2018-11-28 23:19:43,090 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-28 23:19:43,157 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 23:19:43,168 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 40 treesize of output 48 [2018-11-28 23:19:43,172 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-11-28 23:19:43,241 INFO L267 ElimStorePlain]: Start of recursive call 6: 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-11-28 23:19:43,325 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 3 dim-2 vars, End of recursive call: 6 dim-0 vars, and 4 xjuncts. [2018-11-28 23:19:43,326 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 9 variables, input treesize:154, output treesize:131 [2018-11-28 23:19:43,539 WARN L180 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 31 [2018-11-28 23:19:43,549 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 23:19:43,551 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 43 [2018-11-28 23:19:43,558 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 23:19:43,559 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 22 [2018-11-28 23:19:43,560 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 23:19:43,575 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 23:19:43,621 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 23:19:43,640 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 52 treesize of output 66 [2018-11-28 23:19:43,677 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 23:19:43,679 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 42 [2018-11-28 23:19:43,680 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-28 23:19:43,727 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 23:19:43,728 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 23:19:43,729 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 23:19:43,731 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 23:19:43,733 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 63 [2018-11-28 23:19:43,734 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-28 23:19:43,901 INFO L267 ElimStorePlain]: Start of recursive call 4: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-28 23:19:43,934 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: 3 dim-0 vars, and 2 xjuncts. [2018-11-28 23:19:43,935 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 5 variables, input treesize:93, output treesize:65 [2018-11-28 23:19:44,036 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 23:19:44,053 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 4 loop predicates [2018-11-28 23:19:44,054 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 11 states. Second operand 5 states. [2018-11-28 23:19:44,216 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 11 states.. Second operand 5 states. Result 22 states and 26 transitions. Complement of second has 10 states. [2018-11-28 23:19:44,220 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 1 stem states 3 non-accepting loop states 1 accepting loop states [2018-11-28 23:19:44,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-28 23:19:44,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 15 transitions. [2018-11-28 23:19:44,225 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 15 transitions. Stem has 2 letters. Loop has 4 letters. [2018-11-28 23:19:44,226 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:19:44,226 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 15 transitions. Stem has 6 letters. Loop has 4 letters. [2018-11-28 23:19:44,226 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:19:44,227 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 15 transitions. Stem has 2 letters. Loop has 8 letters. [2018-11-28 23:19:44,227 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:19:44,229 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 22 states and 26 transitions. [2018-11-28 23:19:44,231 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-28 23:19:44,235 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 22 states to 0 states and 0 transitions. [2018-11-28 23:19:44,236 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2018-11-28 23:19:44,237 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2018-11-28 23:19:44,238 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2018-11-28 23:19:44,238 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-28 23:19:44,238 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-28 23:19:44,238 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-28 23:19:44,240 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-28 23:19:44,240 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-11-28 23:19:44,240 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2018-11-28 23:19:44,240 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-28 23:19:44,241 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2018-11-28 23:19:44,248 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 28.11 11:19:44 BoogieIcfgContainer [2018-11-28 23:19:44,248 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-11-28 23:19:44,248 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-28 23:19:44,249 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-28 23:19:44,249 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-28 23:19:44,250 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 11:19:37" (3/4) ... [2018-11-28 23:19:44,254 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-11-28 23:19:44,254 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-28 23:19:44,254 INFO L168 Benchmark]: Toolchain (without parser) took 8189.87 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 196.6 MB). Free memory was 951.3 MB in the beginning and 1.0 GB in the end (delta: -97.9 MB). Peak memory consumption was 98.7 MB. Max. memory is 11.5 GB. [2018-11-28 23:19:44,256 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. [2018-11-28 23:19:44,256 INFO L168 Benchmark]: CACSL2BoogieTranslator took 599.44 ms. Allocated memory is still 1.0 GB. Free memory was 951.3 MB in the beginning and 929.9 MB in the end (delta: 21.5 MB). Peak memory consumption was 21.5 MB. Max. memory is 11.5 GB. [2018-11-28 23:19:44,257 INFO L168 Benchmark]: Boogie Procedure Inliner took 170.09 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 113.2 MB). Free memory was 929.9 MB in the beginning and 1.1 GB in the end (delta: -168.7 MB). Peak memory consumption was 14.1 MB. Max. memory is 11.5 GB. [2018-11-28 23:19:44,258 INFO L168 Benchmark]: Boogie Preprocessor took 32.19 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-28 23:19:44,259 INFO L168 Benchmark]: RCFGBuilder took 496.28 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 19.8 MB). Peak memory consumption was 19.8 MB. Max. memory is 11.5 GB. [2018-11-28 23:19:44,259 INFO L168 Benchmark]: BuchiAutomizer took 6875.35 ms. Allocated memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: 83.4 MB). Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 29.6 MB). Peak memory consumption was 112.9 MB. Max. memory is 11.5 GB. [2018-11-28 23:19:44,260 INFO L168 Benchmark]: Witness Printer took 5.24 ms. Allocated memory is still 1.2 GB. Free memory is still 1.0 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-28 23:19:44,266 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 599.44 ms. Allocated memory is still 1.0 GB. Free memory was 951.3 MB in the beginning and 929.9 MB in the end (delta: 21.5 MB). Peak memory consumption was 21.5 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 170.09 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 113.2 MB). Free memory was 929.9 MB in the beginning and 1.1 GB in the end (delta: -168.7 MB). Peak memory consumption was 14.1 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 32.19 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 496.28 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 19.8 MB). Peak memory consumption was 19.8 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 6875.35 ms. Allocated memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: 83.4 MB). Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 29.6 MB). Peak memory consumption was 112.9 MB. Max. memory is 11.5 GB. * Witness Printer took 5.24 ms. Allocated memory is still 1.2 GB. Free memory is still 1.0 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 1 terminating modules (0 trivial, 1 deterministic, 0 nondeterministic). One deterministic module has affine ranking function unknown-#memory_int-unknown[a_ref][a_ref] and consists of 6 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 6.8s and 2 iterations. TraceHistogramMax:1. Analysis of lassos took 4.7s. Construction of modules took 0.0s. Büchi inclusion checks took 1.9s. Highest rank in rank-based complementation 3. Minimization of det autom 1. Minimization of nondet autom 0. Automata minimization No data available. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 0 states and ocurred in iteration 1. Nontrivial modules had stage [1, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 2 SDtfs, 1 SDslu, 0 SDs, 0 SdLazy, 21 SolverSat, 9 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc0 concLT0 SILN0 SILU0 SILI0 SILT0 lasso1 LassoPreprocessingBenchmarks: Lassos: inital433 mio100 ax104 hnf100 lsp94 ukn41 mio100 lsp38 div102 bol100 ite100 ukn100 eq188 hnf87 smp100 dnf100 smp100 tf100 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 15ms VariablesStem: 2 VariablesLoop: 2 DisjunctsStem: 2 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 8 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! Received shutdown request...