./Ultimate.py --spec /storage/repos/svcomp/c/properties/termination.prp --file /storage/repos/svcomp/c/termination-memory-alloca/b.16-alloca_true-termination_true-no-overflow.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/b.16-alloca_true-termination_true-no-overflow.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 59be66e49b54b8b00b9c1d5bff1f6857d45f8bbd ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. 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:48:14,182 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-01 21:48:14,184 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-01 21:48:14,203 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-01 21:48:14,204 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-01 21:48:14,205 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-01 21:48:14,208 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-01 21:48:14,211 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-01 21:48:14,214 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-01 21:48:14,223 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-01 21:48:14,225 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-01 21:48:14,226 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-01 21:48:14,227 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-01 21:48:14,229 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-01 21:48:14,231 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-01 21:48:14,233 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-01 21:48:14,234 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-01 21:48:14,239 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-01 21:48:14,243 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-01 21:48:14,246 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-01 21:48:14,247 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-01 21:48:14,249 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-01 21:48:14,251 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-01 21:48:14,251 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-01 21:48:14,252 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-01 21:48:14,253 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-01 21:48:14,254 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-01 21:48:14,257 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-01 21:48:14,258 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-01 21:48:14,259 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-01 21:48:14,259 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-01 21:48:14,262 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-01 21:48:14,262 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-01 21:48:14,262 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-01 21:48:14,263 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-01 21:48:14,264 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-01 21:48:14,264 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:48:14,295 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-01 21:48:14,296 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-01 21:48:14,297 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-01 21:48:14,298 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-01 21:48:14,298 INFO L133 SettingsManager]: * Use SBE=true [2019-01-01 21:48:14,298 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-01-01 21:48:14,298 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-01-01 21:48:14,298 INFO L133 SettingsManager]: * Use old map elimination=false [2019-01-01 21:48:14,298 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2019-01-01 21:48:14,300 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2019-01-01 21:48:14,300 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-01-01 21:48:14,300 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-01 21:48:14,300 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-01-01 21:48:14,301 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-01 21:48:14,301 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-01 21:48:14,301 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-01-01 21:48:14,301 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-01-01 21:48:14,301 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-01-01 21:48:14,301 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-01 21:48:14,301 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-01-01 21:48:14,302 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-01 21:48:14,303 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-01-01 21:48:14,305 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-01 21:48:14,305 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-01 21:48:14,305 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-01-01 21:48:14,305 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-01 21:48:14,305 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-01 21:48:14,306 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-01-01 21:48:14,307 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-01-01 21:48:14,307 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 -> 59be66e49b54b8b00b9c1d5bff1f6857d45f8bbd [2019-01-01 21:48:14,344 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-01 21:48:14,358 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-01 21:48:14,363 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-01 21:48:14,367 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-01 21:48:14,368 INFO L276 PluginConnector]: CDTParser initialized [2019-01-01 21:48:14,369 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/termination-memory-alloca/b.16-alloca_true-termination_true-no-overflow.c.i [2019-01-01 21:48:14,439 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f8fc946c6/6ef8ed78cb2d428a92949067d23686c7/FLAG5a61e8f5f [2019-01-01 21:48:14,986 INFO L307 CDTParser]: Found 1 translation units. [2019-01-01 21:48:14,987 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/termination-memory-alloca/b.16-alloca_true-termination_true-no-overflow.c.i [2019-01-01 21:48:15,002 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f8fc946c6/6ef8ed78cb2d428a92949067d23686c7/FLAG5a61e8f5f [2019-01-01 21:48:15,259 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f8fc946c6/6ef8ed78cb2d428a92949067d23686c7 [2019-01-01 21:48:15,263 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-01 21:48:15,264 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-01-01 21:48:15,265 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-01 21:48:15,265 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-01 21:48:15,269 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-01 21:48:15,270 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.01 09:48:15" (1/1) ... [2019-01-01 21:48:15,274 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1fa198c2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:48:15, skipping insertion in model container [2019-01-01 21:48:15,274 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.01 09:48:15" (1/1) ... [2019-01-01 21:48:15,283 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-01 21:48:15,342 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-01 21:48:15,753 INFO L204 PostProcessor]: Analyzing one entry point: main [2019-01-01 21:48:15,767 INFO L191 MainTranslator]: Completed pre-run [2019-01-01 21:48:15,897 INFO L204 PostProcessor]: Analyzing one entry point: main [2019-01-01 21:48:15,969 INFO L195 MainTranslator]: Completed translation [2019-01-01 21:48:15,970 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:48:15 WrapperNode [2019-01-01 21:48:15,970 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-01 21:48:15,971 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-01 21:48:15,971 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-01 21:48:15,971 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-01 21:48:15,982 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:48:15" (1/1) ... [2019-01-01 21:48:16,004 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:48:15" (1/1) ... [2019-01-01 21:48:16,030 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-01 21:48:16,030 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-01 21:48:16,030 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-01 21:48:16,030 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-01 21:48:16,042 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:48:15" (1/1) ... [2019-01-01 21:48:16,042 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:48:15" (1/1) ... [2019-01-01 21:48:16,046 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:48:15" (1/1) ... [2019-01-01 21:48:16,046 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:48:15" (1/1) ... [2019-01-01 21:48:16,051 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:48:15" (1/1) ... [2019-01-01 21:48:16,056 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:48:15" (1/1) ... [2019-01-01 21:48:16,058 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:48:15" (1/1) ... [2019-01-01 21:48:16,061 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-01 21:48:16,069 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-01 21:48:16,069 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-01 21:48:16,069 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-01 21:48:16,071 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:48:15" (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:48:16,129 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-01-01 21:48:16,129 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-01-01 21:48:16,129 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-01-01 21:48:16,129 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-01-01 21:48:16,130 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-01 21:48:16,130 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-01 21:48:16,516 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-01 21:48:16,517 INFO L280 CfgBuilder]: Removed 8 assue(true) statements. [2019-01-01 21:48:16,517 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.01 09:48:16 BoogieIcfgContainer [2019-01-01 21:48:16,517 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-01 21:48:16,518 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-01-01 21:48:16,518 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-01-01 21:48:16,524 INFO L276 PluginConnector]: BuchiAutomizer initialized [2019-01-01 21:48:16,525 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-01 21:48:16,525 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 01.01 09:48:15" (1/3) ... [2019-01-01 21:48:16,527 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@7e86fee6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 01.01 09:48:16, skipping insertion in model container [2019-01-01 21:48:16,527 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-01 21:48:16,527 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:48:15" (2/3) ... [2019-01-01 21:48:16,528 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@7e86fee6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 01.01 09:48:16, skipping insertion in model container [2019-01-01 21:48:16,528 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-01 21:48:16,528 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.01 09:48:16" (3/3) ... [2019-01-01 21:48:16,531 INFO L375 chiAutomizerObserver]: Analyzing ICFG b.16-alloca_true-termination_true-no-overflow.c.i [2019-01-01 21:48:16,597 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-01 21:48:16,598 INFO L374 BuchiCegarLoop]: Interprodecural is true [2019-01-01 21:48:16,599 INFO L375 BuchiCegarLoop]: Hoare is false [2019-01-01 21:48:16,599 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-01-01 21:48:16,599 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-01 21:48:16,599 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-01 21:48:16,599 INFO L379 BuchiCegarLoop]: Difference is false [2019-01-01 21:48:16,599 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-01 21:48:16,599 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-01-01 21:48:16,617 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 12 states. [2019-01-01 21:48:16,641 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2019-01-01 21:48:16,641 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 21:48:16,641 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 21:48:16,648 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2019-01-01 21:48:16,648 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2019-01-01 21:48:16,648 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2019-01-01 21:48:16,649 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 12 states. [2019-01-01 21:48:16,650 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2019-01-01 21:48:16,650 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 21:48:16,650 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 21:48:16,651 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2019-01-01 21:48:16,651 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2019-01-01 21:48:16,661 INFO L794 eck$LassoCheckResult]: Stem: 6#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 3#L-1true havoc main_#res;havoc main_#t~nondet10, main_#t~nondet11, main_#t~ret12;test_fun_#in~x, test_fun_#in~y := main_#t~nondet10, main_#t~nondet11;havoc test_fun_#res;havoc test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset, test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset, test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset, test_fun_#t~mem7, test_fun_#t~mem6, test_fun_#t~mem8, test_fun_#t~mem5, test_fun_#t~mem9, test_fun_~x, test_fun_~y, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, test_fun_~c~0.base, test_fun_~c~0.offset;test_fun_~x := test_fun_#in~x;test_fun_~y := test_fun_#in~y;call test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset := #Ultimate.allocOnStack(4);test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset := test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset;call test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset := #Ultimate.allocOnStack(4);test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset := test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset;call test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset := #Ultimate.allocOnStack(4);test_fun_~c~0.base, test_fun_~c~0.offset := test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset;call write~int(test_fun_~x, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call write~int(test_fun_~y, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call write~int(0, test_fun_~c~0.base, test_fun_~c~0.offset, 4); 7#L555-3true [2019-01-01 21:48:16,661 INFO L796 eck$LassoCheckResult]: Loop: 7#L555-3true call test_fun_#t~mem5 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); 14#L555-1true assume !!(test_fun_#t~mem5 > 0);havoc test_fun_#t~mem5; 5#L556-3true assume !true; 8#L556-4true call test_fun_#t~mem8 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call write~int(test_fun_#t~mem8 - 1, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);havoc test_fun_#t~mem8; 7#L555-3true [2019-01-01 21:48:16,668 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:48:16,669 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2019-01-01 21:48:16,671 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:48:16,672 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:48:16,731 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:48:16,731 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 21:48:16,731 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:48:16,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:48:16,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:48:16,883 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:48:16,884 INFO L82 PathProgramCache]: Analyzing trace with hash 1144360, now seen corresponding path program 1 times [2019-01-01 21:48:16,884 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:48:16,884 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:48:16,886 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:48:16,886 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 21:48:16,887 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:48:16,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:48:16,923 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:48:16,925 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 21:48:16,925 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-01 21:48:16,930 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-01-01 21:48:16,950 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-01-01 21:48:16,951 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-01-01 21:48:16,953 INFO L87 Difference]: Start difference. First operand 12 states. Second operand 2 states. [2019-01-01 21:48:16,970 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 21:48:16,971 INFO L93 Difference]: Finished difference Result 12 states and 13 transitions. [2019-01-01 21:48:16,971 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-01-01 21:48:16,976 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 12 states and 13 transitions. [2019-01-01 21:48:16,978 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2019-01-01 21:48:16,984 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 12 states to 7 states and 8 transitions. [2019-01-01 21:48:16,986 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 7 [2019-01-01 21:48:16,987 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 7 [2019-01-01 21:48:16,987 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 8 transitions. [2019-01-01 21:48:16,988 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-01 21:48:16,988 INFO L705 BuchiCegarLoop]: Abstraction has 7 states and 8 transitions. [2019-01-01 21:48:17,012 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7 states and 8 transitions. [2019-01-01 21:48:17,023 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7 to 7. [2019-01-01 21:48:17,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2019-01-01 21:48:17,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 8 transitions. [2019-01-01 21:48:17,029 INFO L728 BuchiCegarLoop]: Abstraction has 7 states and 8 transitions. [2019-01-01 21:48:17,030 INFO L608 BuchiCegarLoop]: Abstraction has 7 states and 8 transitions. [2019-01-01 21:48:17,030 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2019-01-01 21:48:17,031 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 7 states and 8 transitions. [2019-01-01 21:48:17,032 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2019-01-01 21:48:17,033 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 21:48:17,033 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 21:48:17,033 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2019-01-01 21:48:17,034 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2019-01-01 21:48:17,034 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~nondet10, main_#t~nondet11, main_#t~ret12;test_fun_#in~x, test_fun_#in~y := main_#t~nondet10, main_#t~nondet11;havoc test_fun_#res;havoc test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset, test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset, test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset, test_fun_#t~mem7, test_fun_#t~mem6, test_fun_#t~mem8, test_fun_#t~mem5, test_fun_#t~mem9, test_fun_~x, test_fun_~y, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, test_fun_~c~0.base, test_fun_~c~0.offset;test_fun_~x := test_fun_#in~x;test_fun_~y := test_fun_#in~y;call test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset := #Ultimate.allocOnStack(4);test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset := test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset;call test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset := #Ultimate.allocOnStack(4);test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset := test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset;call test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset := #Ultimate.allocOnStack(4);test_fun_~c~0.base, test_fun_~c~0.offset := test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset;call write~int(test_fun_~x, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call write~int(test_fun_~y, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call write~int(0, test_fun_~c~0.base, test_fun_~c~0.offset, 4); 33#L555-3 [2019-01-01 21:48:17,034 INFO L796 eck$LassoCheckResult]: Loop: 33#L555-3 call test_fun_#t~mem5 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); 37#L555-1 assume !!(test_fun_#t~mem5 > 0);havoc test_fun_#t~mem5; 34#L556-3 call test_fun_#t~mem6 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); 35#L556-1 assume !(test_fun_#t~mem6 > 0);havoc test_fun_#t~mem6; 38#L556-4 call test_fun_#t~mem8 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call write~int(test_fun_#t~mem8 - 1, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);havoc test_fun_#t~mem8; 33#L555-3 [2019-01-01 21:48:17,036 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:48:17,036 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 2 times [2019-01-01 21:48:17,037 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:48:17,037 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:48:17,042 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:48:17,045 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 21:48:17,045 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:48:17,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:48:17,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:48:17,142 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:48:17,144 INFO L82 PathProgramCache]: Analyzing trace with hash 35468273, now seen corresponding path program 1 times [2019-01-01 21:48:17,144 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:48:17,145 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:48:17,149 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:48:17,151 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 21:48:17,151 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:48:17,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:48:17,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:48:17,195 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:48:17,195 INFO L82 PathProgramCache]: Analyzing trace with hash 1806907759, now seen corresponding path program 1 times [2019-01-01 21:48:17,195 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:48:17,195 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:48:17,197 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:48:17,197 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 21:48:17,197 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:48:17,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:48:17,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:48:17,461 WARN L181 SmtUtils]: Spent 156.00 ms on a formula simplification that was a NOOP. DAG size: 40 [2019-01-01 21:48:17,613 WARN L181 SmtUtils]: Spent 144.00 ms on a formula simplification that was a NOOP. DAG size: 35 [2019-01-01 21:48:18,476 WARN L181 SmtUtils]: Spent 860.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 88 [2019-01-01 21:48:18,927 WARN L181 SmtUtils]: Spent 447.00 ms on a formula simplification that was a NOOP. DAG size: 86 [2019-01-01 21:48:18,942 INFO L216 LassoAnalysis]: Preferences: [2019-01-01 21:48:18,943 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-01 21:48:18,944 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-01 21:48:18,944 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-01 21:48:18,944 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-01 21:48:18,944 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 21:48:18,944 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-01 21:48:18,944 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-01 21:48:18,945 INFO L131 ssoRankerPreferences]: Filename of dumped script: b.16-alloca_true-termination_true-no-overflow.c.i_Iteration2_Lasso [2019-01-01 21:48:18,945 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-01 21:48:18,945 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-01 21:48:18,983 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:48:18,989 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:48:18,995 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:48:18,999 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:48:19,006 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:48:19,009 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:48:19,018 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:48:19,604 WARN L181 SmtUtils]: Spent 451.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 75 [2019-01-01 21:48:19,736 WARN L181 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 47 [2019-01-01 21:48:19,737 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:48:19,740 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:48:19,744 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:48:19,753 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:48:19,757 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:48:19,760 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:48:19,765 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:48:20,896 WARN L181 SmtUtils]: Spent 468.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 38 [2019-01-01 21:48:21,026 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-01 21:48:21,032 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-01 21:48:21,035 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:48:21,037 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:48:21,037 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:48:21,038 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:48:21,038 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:48:21,038 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:48:21,040 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:48:21,041 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:48:21,043 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:48:21,043 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:48:21,044 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:48:21,044 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:48:21,044 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:48:21,044 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:48:21,044 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:48:21,045 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:48:21,045 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:48:21,046 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:48:21,046 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:48:21,047 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:48:21,047 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:48:21,047 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:48:21,047 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:48:21,047 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:48:21,048 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:48:21,048 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:48:21,049 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:48:21,050 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:48:21,050 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:48:21,050 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:48:21,050 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:48:21,051 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:48:21,051 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:48:21,051 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:48:21,051 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:48:21,052 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:48:21,052 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:48:21,053 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:48:21,053 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:48:21,053 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:48:21,053 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:48:21,053 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:48:21,054 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:48:21,054 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:48:21,055 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:48:21,055 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:48:21,056 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:48:21,056 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:48:21,056 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:48:21,056 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:48:21,059 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:48:21,059 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:48:21,063 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:48:21,063 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:48:21,064 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:48:21,064 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:48:21,064 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:48:21,064 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:48:21,066 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:48:21,067 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:48:21,072 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:48:21,073 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:48:21,073 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:48:21,073 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:48:21,074 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:48:21,074 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:48:21,076 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:48:21,076 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:48:21,086 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:48:21,087 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:48:21,089 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:48:21,089 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:48:21,089 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:48:21,090 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:48:21,092 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:48:21,092 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:48:21,097 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:48:21,097 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:48:21,098 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:48:21,098 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:48:21,098 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:48:21,098 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:48:21,101 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:48:21,102 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:48:21,104 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:48:21,105 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:48:21,106 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:48:21,106 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:48:21,106 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:48:21,106 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:48:21,113 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:48:21,113 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:48:21,141 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:48:21,141 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:48:21,143 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:48:21,143 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:48:21,144 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:48:21,144 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:48:21,147 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:48:21,147 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:48:21,162 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-01 21:48:21,183 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2019-01-01 21:48:21,183 INFO L444 ModelExtractionUtils]: 10 out of 16 variables were initially zero. Simplification set additionally 4 variables to zero. [2019-01-01 21:48:21,188 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-01 21:48:21,190 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-01-01 21:48:21,191 INFO L518 LassoAnalysis]: Proved termination. [2019-01-01 21:48:21,192 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_test_fun_~x_ref~0.base) ULTIMATE.start_test_fun_~x_ref~0.offset)_1) = 1*v_rep(select (select #memory_int ULTIMATE.start_test_fun_~x_ref~0.base) ULTIMATE.start_test_fun_~x_ref~0.offset)_1 Supporting invariants [] [2019-01-01 21:48:21,596 INFO L297 tatePredicateManager]: 20 out of 20 supporting invariants were superfluous and have been removed [2019-01-01 21:48:21,602 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-01-01 21:48:21,628 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:48:21,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:48:21,661 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:48:21,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:48:21,678 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:48:21,740 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:48:21,744 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2019-01-01 21:48:21,745 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 7 states and 8 transitions. cyclomatic complexity: 2 Second operand 4 states. [2019-01-01 21:48:21,864 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 7 states and 8 transitions. cyclomatic complexity: 2. Second operand 4 states. Result 21 states and 26 transitions. Complement of second has 8 states. [2019-01-01 21:48:21,865 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 3 non-accepting loop states 1 accepting loop states [2019-01-01 21:48:21,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-01-01 21:48:21,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 13 transitions. [2019-01-01 21:48:21,868 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 13 transitions. Stem has 2 letters. Loop has 5 letters. [2019-01-01 21:48:21,870 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:48:21,870 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 13 transitions. Stem has 7 letters. Loop has 5 letters. [2019-01-01 21:48:21,870 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:48:21,870 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 13 transitions. Stem has 2 letters. Loop has 10 letters. [2019-01-01 21:48:21,871 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:48:21,871 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 21 states and 26 transitions. [2019-01-01 21:48:21,872 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2019-01-01 21:48:21,874 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 21 states to 20 states and 25 transitions. [2019-01-01 21:48:21,875 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2019-01-01 21:48:21,875 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2019-01-01 21:48:21,875 INFO L73 IsDeterministic]: Start isDeterministic. Operand 20 states and 25 transitions. [2019-01-01 21:48:21,875 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-01 21:48:21,875 INFO L705 BuchiCegarLoop]: Abstraction has 20 states and 25 transitions. [2019-01-01 21:48:21,875 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states and 25 transitions. [2019-01-01 21:48:21,878 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 19. [2019-01-01 21:48:21,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2019-01-01 21:48:21,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 24 transitions. [2019-01-01 21:48:21,880 INFO L728 BuchiCegarLoop]: Abstraction has 19 states and 24 transitions. [2019-01-01 21:48:21,880 INFO L608 BuchiCegarLoop]: Abstraction has 19 states and 24 transitions. [2019-01-01 21:48:21,880 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2019-01-01 21:48:21,880 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 19 states and 24 transitions. [2019-01-01 21:48:21,882 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2019-01-01 21:48:21,882 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 21:48:21,882 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 21:48:21,883 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2019-01-01 21:48:21,883 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [2, 1, 1, 1, 1, 1] [2019-01-01 21:48:21,883 INFO L794 eck$LassoCheckResult]: Stem: 194#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 188#L-1 havoc main_#res;havoc main_#t~nondet10, main_#t~nondet11, main_#t~ret12;test_fun_#in~x, test_fun_#in~y := main_#t~nondet10, main_#t~nondet11;havoc test_fun_#res;havoc test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset, test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset, test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset, test_fun_#t~mem7, test_fun_#t~mem6, test_fun_#t~mem8, test_fun_#t~mem5, test_fun_#t~mem9, test_fun_~x, test_fun_~y, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, test_fun_~c~0.base, test_fun_~c~0.offset;test_fun_~x := test_fun_#in~x;test_fun_~y := test_fun_#in~y;call test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset := #Ultimate.allocOnStack(4);test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset := test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset;call test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset := #Ultimate.allocOnStack(4);test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset := test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset;call test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset := #Ultimate.allocOnStack(4);test_fun_~c~0.base, test_fun_~c~0.offset := test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset;call write~int(test_fun_~x, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call write~int(test_fun_~y, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call write~int(0, test_fun_~c~0.base, test_fun_~c~0.offset, 4); 189#L555-3 call test_fun_#t~mem5 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); 196#L555-1 [2019-01-01 21:48:21,883 INFO L796 eck$LassoCheckResult]: Loop: 196#L555-1 assume !!(test_fun_#t~mem5 > 0);havoc test_fun_#t~mem5; 190#L556-3 call test_fun_#t~mem6 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); 191#L556-1 assume !!(test_fun_#t~mem6 > 0);havoc test_fun_#t~mem6;call test_fun_#t~mem7 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call write~int(test_fun_#t~mem7 - 1, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);havoc test_fun_#t~mem7; 201#L556-3 call test_fun_#t~mem6 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); 203#L556-1 assume !(test_fun_#t~mem6 > 0);havoc test_fun_#t~mem6; 199#L556-4 call test_fun_#t~mem8 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call write~int(test_fun_#t~mem8 - 1, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);havoc test_fun_#t~mem8; 195#L555-3 call test_fun_#t~mem5 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); 196#L555-1 [2019-01-01 21:48:21,886 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:48:21,886 INFO L82 PathProgramCache]: Analyzing trace with hash 29860, now seen corresponding path program 1 times [2019-01-01 21:48:21,886 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:48:21,887 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:48:21,889 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:48:21,889 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 21:48:21,889 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:48:21,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:48:21,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:48:21,915 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:48:21,915 INFO L82 PathProgramCache]: Analyzing trace with hash 15492128, now seen corresponding path program 1 times [2019-01-01 21:48:21,915 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:48:21,915 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:48:21,916 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:48:21,916 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 21:48:21,917 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:48:21,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:48:21,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:48:21,934 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:48:21,939 INFO L82 PathProgramCache]: Analyzing trace with hash 765526557, now seen corresponding path program 1 times [2019-01-01 21:48:21,939 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:48:21,939 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:48:21,940 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:48:21,940 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 21:48:21,940 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:48:21,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:48:22,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:48:22,391 WARN L181 SmtUtils]: Spent 371.00 ms on a formula simplification that was a NOOP. DAG size: 53 [2019-01-01 21:48:22,733 WARN L181 SmtUtils]: Spent 299.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 92 [2019-01-01 21:48:22,877 WARN L181 SmtUtils]: Spent 142.00 ms on a formula simplification that was a NOOP. DAG size: 90 [2019-01-01 21:48:22,883 INFO L216 LassoAnalysis]: Preferences: [2019-01-01 21:48:22,884 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-01 21:48:22,884 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-01 21:48:22,884 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-01 21:48:22,884 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-01 21:48:22,884 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 21:48:22,884 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-01 21:48:22,884 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-01 21:48:22,884 INFO L131 ssoRankerPreferences]: Filename of dumped script: b.16-alloca_true-termination_true-no-overflow.c.i_Iteration3_Lasso [2019-01-01 21:48:22,885 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-01 21:48:22,885 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-01 21:48:22,891 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:48:22,927 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:48:22,957 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:48:22,979 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:48:23,022 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:48:23,039 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:48:23,041 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:48:23,043 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:48:23,045 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:48:23,048 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:48:23,054 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:48:23,452 WARN L181 SmtUtils]: Spent 268.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 75 [2019-01-01 21:48:23,570 WARN L181 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 58 [2019-01-01 21:48:23,571 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:48:23,573 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:48:23,574 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:48:24,492 WARN L181 SmtUtils]: Spent 409.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 38 [2019-01-01 21:48:24,674 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-01 21:48:24,675 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-01 21:48:24,675 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:48:24,678 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:48:24,678 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:48:24,678 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:48:24,679 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:48:24,679 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:48:24,679 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:48:24,679 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:48:24,680 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:48:24,682 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:48:24,683 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:48:24,684 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:48:24,685 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:48:24,685 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:48:24,685 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:48:24,686 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:48:24,686 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:48:24,687 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:48:24,687 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:48:24,688 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:48:24,688 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:48:24,688 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:48:24,688 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:48:24,688 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:48:24,691 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:48:24,691 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:48:24,692 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:48:24,692 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:48:24,693 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:48:24,693 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:48:24,693 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:48:24,693 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:48:24,697 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:48:24,697 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:48:24,699 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:48:24,700 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:48:24,701 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:48:24,701 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:48:24,701 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:48:24,701 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:48:24,704 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:48:24,704 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:48:24,708 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:48:24,708 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:48:24,709 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:48:24,709 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:48:24,709 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:48:24,709 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:48:24,709 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:48:24,710 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:48:24,710 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:48:24,713 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:48:24,714 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:48:24,714 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:48:24,715 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:48:24,715 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:48:24,715 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:48:24,715 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:48:24,715 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:48:24,715 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:48:24,718 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:48:24,719 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:48:24,719 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:48:24,719 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:48:24,721 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:48:24,722 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:48:24,724 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:48:24,724 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:48:24,726 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:48:24,727 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:48:24,727 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:48:24,727 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:48:24,727 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:48:24,728 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:48:24,730 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:48:24,731 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:48:24,733 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:48:24,734 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:48:24,734 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:48:24,734 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:48:24,734 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:48:24,735 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:48:24,735 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:48:24,737 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:48:24,740 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:48:24,740 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:48:24,741 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:48:24,741 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:48:24,741 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:48:24,741 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:48:24,744 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:48:24,744 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:48:24,748 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:48:24,748 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:48:24,750 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:48:24,750 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:48:24,751 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:48:24,751 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:48:24,753 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:48:24,753 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:48:24,760 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:48:24,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:48:24,761 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:48:24,761 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:48:24,761 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:48:24,761 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:48:24,764 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:48:24,764 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:48:24,767 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:48:24,767 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:48:24,768 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:48:24,768 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:48:24,769 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:48:24,769 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:48:24,772 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:48:24,772 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:48:24,775 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:48:24,776 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:48:24,776 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:48:24,776 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:48:24,777 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:48:24,779 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:48:24,780 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:48:24,781 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:48:24,786 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:48:24,787 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:48:24,788 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:48:24,788 INFO L205 nArgumentSynthesizer]: 8 stem disjuncts [2019-01-01 21:48:24,788 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:48:24,788 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:48:24,795 INFO L402 nArgumentSynthesizer]: We have 20 Motzkin's Theorem applications. [2019-01-01 21:48:24,796 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:48:24,823 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:48:24,824 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:48:24,824 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:48:24,826 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:48:24,826 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:48:24,826 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:48:24,829 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:48:24,829 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:48:24,834 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:48:24,835 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:48:24,835 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:48:24,835 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:48:24,835 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:48:24,836 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:48:24,839 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:48:24,839 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:48:24,847 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-01 21:48:24,853 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-01-01 21:48:24,853 INFO L444 ModelExtractionUtils]: 13 out of 16 variables were initially zero. Simplification set additionally 1 variables to zero. [2019-01-01 21:48:24,854 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-01 21:48:24,855 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-01-01 21:48:24,855 INFO L518 LassoAnalysis]: Proved termination. [2019-01-01 21:48:24,855 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_test_fun_~y_ref~0.base) ULTIMATE.start_test_fun_~y_ref~0.offset)_2) = 1*v_rep(select (select #memory_int ULTIMATE.start_test_fun_~y_ref~0.base) ULTIMATE.start_test_fun_~y_ref~0.offset)_2 Supporting invariants [] [2019-01-01 21:48:25,174 INFO L297 tatePredicateManager]: 23 out of 23 supporting invariants were superfluous and have been removed [2019-01-01 21:48:25,187 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-01-01 21:48:25,257 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:48:25,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:48:25,280 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:48:25,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:48:25,297 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:48:25,424 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:48:25,430 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 32 treesize of output 33 [2019-01-01 21:48:25,436 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:48:25,437 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 33 treesize of output 22 [2019-01-01 21:48:25,439 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-01 21:48:25,465 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 21:48:25,473 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-01 21:48:25,473 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:32, output treesize:17 [2019-01-01 21:48:25,501 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:48:25,520 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 34 treesize of output 52 [2019-01-01 21:48:25,534 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:48:25,535 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 43 treesize of output 36 [2019-01-01 21:48:25,536 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-01 21:48:25,573 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:48:25,589 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 28 treesize of output 46 [2019-01-01 21:48:25,596 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 3 xjuncts. [2019-01-01 21:48:25,639 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 3 xjuncts. [2019-01-01 21:48:25,683 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2019-01-01 21:48:25,684 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:34, output treesize:37 [2019-01-01 21:48:25,738 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 21:48:25,738 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 [2019-01-01 21:48:25,739 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 19 states and 24 transitions. cyclomatic complexity: 7 Second operand 6 states. [2019-01-01 21:48:25,770 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 19 states and 24 transitions. cyclomatic complexity: 7. Second operand 6 states. Result 37 states and 46 transitions. Complement of second has 6 states. [2019-01-01 21:48:25,771 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2019-01-01 21:48:25,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2019-01-01 21:48:25,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 11 transitions. [2019-01-01 21:48:25,771 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 11 transitions. Stem has 3 letters. Loop has 7 letters. [2019-01-01 21:48:25,772 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:48:25,772 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 11 transitions. Stem has 10 letters. Loop has 7 letters. [2019-01-01 21:48:25,772 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:48:25,772 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 11 transitions. Stem has 3 letters. Loop has 14 letters. [2019-01-01 21:48:25,773 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:48:25,773 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 37 states and 46 transitions. [2019-01-01 21:48:25,776 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-01-01 21:48:25,776 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 37 states to 0 states and 0 transitions. [2019-01-01 21:48:25,776 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2019-01-01 21:48:25,776 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2019-01-01 21:48:25,777 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2019-01-01 21:48:25,777 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-01 21:48:25,777 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-01 21:48:25,777 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-01 21:48:25,777 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-01 21:48:25,777 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2019-01-01 21:48:25,777 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2019-01-01 21:48:25,777 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-01-01 21:48:25,777 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2019-01-01 21:48:25,784 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 01.01 09:48:25 BoogieIcfgContainer [2019-01-01 21:48:25,784 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2019-01-01 21:48:25,784 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-01 21:48:25,785 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-01 21:48:25,785 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-01 21:48:25,785 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.01 09:48:16" (3/4) ... [2019-01-01 21:48:25,789 INFO L147 WitnessPrinter]: No result that supports witness generation found [2019-01-01 21:48:25,789 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-01 21:48:25,790 INFO L168 Benchmark]: Toolchain (without parser) took 10526.17 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 178.3 MB). Free memory was 947.3 MB in the beginning and 710.6 MB in the end (delta: 236.7 MB). Peak memory consumption was 415.0 MB. Max. memory is 11.5 GB. [2019-01-01 21:48:25,791 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:48:25,791 INFO L168 Benchmark]: CACSL2BoogieTranslator took 704.89 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 67.1 MB). Free memory was 942.0 MB in the beginning and 1.0 GB in the end (delta: -102.3 MB). Peak memory consumption was 24.6 MB. Max. memory is 11.5 GB. [2019-01-01 21:48:25,792 INFO L168 Benchmark]: Boogie Procedure Inliner took 59.13 ms. Allocated memory is still 1.1 GB. Free memory is still 1.0 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-01 21:48:25,794 INFO L168 Benchmark]: Boogie Preprocessor took 31.15 ms. Allocated memory is still 1.1 GB. Free memory is still 1.0 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-01 21:48:25,795 INFO L168 Benchmark]: RCFGBuilder took 448.56 ms. Allocated memory is still 1.1 GB. Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 19.6 MB). Peak memory consumption was 19.6 MB. Max. memory is 11.5 GB. [2019-01-01 21:48:25,795 INFO L168 Benchmark]: BuchiAutomizer took 9265.81 ms. Allocated memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: 111.1 MB). Free memory was 1.0 GB in the beginning and 710.6 MB in the end (delta: 314.0 MB). Peak memory consumption was 425.2 MB. Max. memory is 11.5 GB. [2019-01-01 21:48:25,797 INFO L168 Benchmark]: Witness Printer took 4.34 ms. Allocated memory is still 1.2 GB. Free memory is still 710.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-01 21:48:25,804 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 704.89 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 67.1 MB). Free memory was 942.0 MB in the beginning and 1.0 GB in the end (delta: -102.3 MB). Peak memory consumption was 24.6 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 59.13 ms. Allocated memory is still 1.1 GB. Free memory is still 1.0 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 31.15 ms. Allocated memory is still 1.1 GB. Free memory is still 1.0 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 448.56 ms. Allocated memory is still 1.1 GB. Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 19.6 MB). Peak memory consumption was 19.6 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 9265.81 ms. Allocated memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: 111.1 MB). Free memory was 1.0 GB in the beginning and 710.6 MB in the end (delta: 314.0 MB). Peak memory consumption was 425.2 MB. Max. memory is 11.5 GB. * Witness Printer took 4.34 ms. Allocated memory is still 1.2 GB. Free memory is still 710.6 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 - 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 3 terminating modules (1 trivial, 2 deterministic, 0 nondeterministic). One deterministic module has affine ranking function unknown-#memory_int-unknown[x_ref][x_ref] and consists of 5 locations. One deterministic module has affine ranking function unknown-#memory_int-unknown[y_ref][y_ref] and consists of 4 locations. 1 modules have a trivial ranking function, the largest among these consists of 2 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 9.2s and 4 iterations. TraceHistogramMax:2. Analysis of lassos took 8.1s. Construction of modules took 0.0s. Büchi inclusion checks took 0.8s. Highest rank in rank-based complementation 3. Minimization of det autom 2. Minimization of nondet autom 1. Automata minimization 0.0s AutomataMinimizationTime, 2 MinimizatonAttempts, 1 StatesRemovedByMinimization, 1 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 19 states and ocurred in iteration 2. Nontrivial modules had stage [2, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 1/2 HoareTripleCheckerStatistics: 20 SDtfs, 10 SDslu, 5 SDs, 0 SdLazy, 30 SolverSat, 10 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time LassoAnalysisResults: nont0 unkn0 SFLI1 SFLT0 conc0 concLT0 SILN0 SILU0 SILI0 SILT0 lasso2 LassoPreprocessingBenchmarks: Lassos: inital291 mio100 ax106 hnf100 lsp91 ukn62 mio100 lsp32 div100 bol100 ite100 ukn100 eq188 hnf88 smp98 dnf364 smp91 tf100 neg92 sie127 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 36ms 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...