YES 2019-05-11 07:11:10,896 INFO [UltimateCore.java:185]: Initializing application 2019-05-11 07:11:10,899 INFO [UltimateCore.java:202]: -------------------------------------------------------------------------------- 2019-05-11 07:11:10,903 INFO [PluginFactory.java:62]: -------------------------------------------------------------------------------- 2019-05-11 07:11:10,903 INFO [PluginFactory.java:63]: Detecting plugins... 2019-05-11 07:11:10,905 INFO [PluginFactory.java:287]: 1 IController plugins available 2019-05-11 07:11:10,905 INFO [PluginFactory.java:287]: 4 ISource plugins available 2019-05-11 07:11:10,905 INFO [PluginFactory.java:287]: 1 IOutput plugins available 2019-05-11 07:11:10,906 INFO [PluginFactory.java:287]: 10 IGenerator plugins available 2019-05-11 07:11:10,906 INFO [PluginFactory.java:287]: 5 IAnalysis plugins available 2019-05-11 07:11:10,908 INFO [PluginFactory.java:241]: Loaded controller UltimateCore 2019-05-11 07:11:10,909 INFO [PluginFactory.java:70]: Finished detecting plugins! 2019-05-11 07:11:10,909 INFO [PluginFactory.java:71]: Loading services ... 2019-05-11 07:11:10,909 INFO [PluginFactory.java:272]: 0 IServiceFactory services available 2019-05-11 07:11:10,910 INFO [PluginFactory.java:73]: Finished loading services! 2019-05-11 07:11:10,910 INFO [PluginFactory.java:74]: -------------------------------------------------------------------------------- 2019-05-11 07:11:10,911 INFO [SettingsManager.java:46]: Loading settings from ./../termcomp2015.epf 2019-05-11 07:11:12,889 INFO [SettingsManager.java:54]: Loading preferences was successful 2019-05-11 07:11:12,889 INFO [SettingsManager.java:55]: Preferences different from defaults: 2019-05-11 07:11:12,889 INFO [PluginFactory.java:178]: -------------------------------------------------------------------------------- 2019-05-11 07:11:12,889 INFO [PluginFactory.java:179]: Loading all admissible plugins (creating one instance, loading preferences) 2019-05-11 07:11:13,245 INFO [PluginFactory.java:196]: Finished loading 20 admissible plugins (all were admissible) 2019-05-11 07:11:13,245 INFO [PluginFactory.java:198]: -------------------------------------------------------------------------------- 2019-05-11 07:11:13,246 INFO [SettingsManager.java:61]: Preferences of LassoRanker differ from their defaults: 2019-05-11 07:11:13,246 INFO [SettingsManager.java:63]: * Only non-decreasing invariants=true 2019-05-11 07:11:13,246 INFO [SettingsManager.java:63]: * Termination analysis=LINEAR_WITH_GUESSES 2019-05-11 07:11:13,246 INFO [SettingsManager.java:63]: * SMT solver command=z3 -smt2 -in SMTLIB2_COMPLIANT=true 2019-05-11 07:11:13,247 INFO [SettingsManager.java:63]: * Nontermination analysis=LINEAR_WITH_GUESSES 2019-05-11 07:11:13,247 INFO [SettingsManager.java:61]: Preferences of BlockEncoding differ from their defaults: 2019-05-11 07:11:13,247 INFO [SettingsManager.java:63]: * Rating-Boundary (empty for LBE)=0 2019-05-11 07:11:13,247 INFO [SettingsManager.java:63]: * Strategy for the edge rating=DISJUNCTIVE_RATING 2019-05-11 07:11:13,247 INFO [SettingsManager.java:61]: Preferences of BuchiAutomizer differ from their defaults: 2019-05-11 07:11:13,248 INFO [SettingsManager.java:63]: * Lasso Analysis=Linear_with_guesses 2019-05-11 07:11:13,248 INFO [SettingsManager.java:63]: * Use external solver (rank synthesis)=false 2019-05-11 07:11:13,248 INFO [SettingsManager.java:63]: * Buchi interpolant automaton=StagedBlast 2019-05-11 07:11:13,248 INFO [SettingsManager.java:63]: * Construct termination proof for TermComp=true 2019-05-11 07:11:13,248 INFO [SettingsManager.java:61]: Preferences of CACSL2BoogieTranslator differ from their defaults: 2019-05-11 07:11:13,249 INFO [SettingsManager.java:63]: * Check unreachability of error function in SV-COMP mode=false 2019-05-11 07:11:13,249 INFO [SettingsManager.java:63]: * Size of pointer (in bytes)=8 2019-05-11 07:11:13,249 INFO [SettingsManager.java:63]: * Check if freed pointer was valid=false 2019-05-11 07:11:13,249 INFO [SettingsManager.java:63]: * How to treat unsigned ints differently from normal ones=IGNORE 2019-05-11 07:11:13,249 INFO [SettingsManager.java:61]: Preferences of CodeCheck differ from their defaults: 2019-05-11 07:11:13,249 INFO [SettingsManager.java:63]: * Timeout in seconds=100000 2019-05-11 07:11:13,250 INFO [SettingsManager.java:63]: * The redirection strategy for Impulse=RANDOmSTRONGEST 2019-05-11 07:11:13,250 INFO [SettingsManager.java:61]: Preferences of RCFGBuilder differ from their defaults: 2019-05-11 07:11:13,250 INFO [SettingsManager.java:63]: * Size of a code block=SequenceOfStatements 2019-05-11 07:11:13,250 INFO [SettingsManager.java:63]: * Convert code blocks to CNF=false 2019-05-11 07:11:13,250 INFO [SettingsManager.java:63]: * To the following directory=/home/matthias/ultimate/dump 2019-05-11 07:11:13,250 INFO [SettingsManager.java:63]: * Command for external solver=./../z3/z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 2019-05-11 07:11:13,251 INFO [SettingsManager.java:61]: Preferences of TraceAbstraction differ from their defaults: 2019-05-11 07:11:13,251 INFO [SettingsManager.java:63]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true 2019-05-11 07:11:13,251 INFO [SettingsManager.java:61]: Preferences of UltimateCore differ from their defaults: 2019-05-11 07:11:13,251 INFO [SettingsManager.java:63]: * Log level for plugins=warn 2019-05-11 07:11:13,251 INFO [SettingsManager.java:61]: Preferences of UltimateCore differ from their defaults: 2019-05-11 07:11:13,252 INFO [SettingsManager.java:63]: * Log level for plugins=warn 2019-05-11 07:11:13,252 INFO [UltimateCore.java:76]: Initializing controller ... 2019-05-11 07:11:13,467 INFO [PersistenceAwareModelManager.java:56]: Repository-Root is: /tmp 2019-05-11 07:11:13,473 INFO [ToolchainManager.java:402]: [Toolchain 1]: Parser CDTParser is usable for /export/starexec/sandbox2/benchmark/theBenchmark.c 2019-05-11 07:11:13,474 INFO [ToolchainManager.java:214]: [Toolchain 1]: Parser(s) successfully initiated... 2019-05-11 07:11:13,476 INFO [ToolchainManager.java:187]: [Toolchain 1]: Toolchain data selected. 2019-05-11 07:11:13,477 INFO [PluginConnector.java:252]: Initializing CDTParser... 2019-05-11 07:11:13,478 INFO [PluginConnector.java:257]: CDTParser initialized 2019-05-11 07:11:13,478 INFO [ToolchainManager.java:355]: [Toolchain 1]: Parsing single file: /export/starexec/sandbox2/benchmark/theBenchmark.c 2019-05-11 07:11:13,600 INFO [ToolchainManager.java:238]: ####################### [Toolchain 1] ####################### 2019-05-11 07:11:13,602 INFO [ToolchainWalker.java:61]: Walking toolchain with 6 elements. 2019-05-11 07:11:13,602 INFO [PluginConnector.java:90]: ------------------------CACSL2BoogieTranslator---------------------------- 2019-05-11 07:11:13,602 INFO [PluginConnector.java:252]: Initializing CACSL2BoogieTranslator... 2019-05-11 07:11:13,606 INFO [PluginConnector.java:257]: CACSL2BoogieTranslator initialized 2019-05-11 07:11:13,607 INFO [PluginConnector.java:162]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.05 07:11:13" (1/1) ... 2019-05-11 07:11:13,715 INFO [PluginConnector.java:110]: ------------------------ END CACSL2BoogieTranslator---------------------------- 2019-05-11 07:11:13,715 INFO [PluginConnector.java:90]: ------------------------Boogie Preprocessor---------------------------- 2019-05-11 07:11:13,716 INFO [PluginConnector.java:252]: Initializing Boogie Preprocessor... 2019-05-11 07:11:13,716 INFO [PluginConnector.java:257]: Boogie Preprocessor initialized 2019-05-11 07:11:13,731 INFO [PluginConnector.java:162]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.05 07:11:13" (1/1) ... 2019-05-11 07:11:13,736 INFO [PluginConnector.java:162]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.05 07:11:13" (1/1) ... 2019-05-11 07:11:13,736 INFO [PluginConnector.java:162]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.05 07:11:13" (1/1) ... 2019-05-11 07:11:13,738 INFO [PluginConnector.java:162]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.05 07:11:13" (1/1) ... 2019-05-11 07:11:13,739 INFO [PluginConnector.java:162]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.05 07:11:13" (1/1) ... 2019-05-11 07:11:13,740 INFO [PluginConnector.java:162]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.05 07:11:13" (1/1) ... 2019-05-11 07:11:13,741 INFO [PluginConnector.java:110]: ------------------------ END Boogie Preprocessor---------------------------- 2019-05-11 07:11:13,741 INFO [PluginConnector.java:90]: ------------------------RCFGBuilder---------------------------- 2019-05-11 07:11:13,741 INFO [PluginConnector.java:252]: Initializing RCFGBuilder... 2019-05-11 07:11:13,741 INFO [PluginConnector.java:257]: RCFGBuilder initialized 2019-05-11 07:11:13,743 INFO [PluginConnector.java:162]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.05 07:11:13" (1/1) ... 2019-05-11 07:11:13,839 INFO [MonitoredProcess.java:173]: Starting monitored process 1 with ./../z3/z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 2019-05-11 07:11:13,841 INFO [MonitoredProcess.java:275]: Waiting until toolchain timeout for monitored process 1 with ./../z3/z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 2019-05-11 07:11:13,953 INFO [PluginConnector.java:110]: ------------------------ END RCFGBuilder---------------------------- 2019-05-11 07:11:13,953 INFO [PluginConnector.java:90]: ------------------------BlockEncoding---------------------------- 2019-05-11 07:11:13,953 INFO [PluginConnector.java:252]: Initializing BlockEncoding... 2019-05-11 07:11:13,954 INFO [PluginConnector.java:257]: BlockEncoding initialized 2019-05-11 07:11:13,955 INFO [PluginConnector.java:162]: Executing the observer BlockEncodingObserver from plugin BlockEncoding for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.05 07:11:13" (1/1) ... 2019-05-11 07:11:13,968 INFO [PluginConnector.java:162]: Executing the observer MinModelConversionObserver from plugin BlockEncoding for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.05 07:11:13" (1/1) ... 2019-05-11 07:11:13,994 WARN [TransFormula.java:607]: CodeBlock already infeasible 2019-05-11 07:11:13,995 WARN [TransFormula.java:607]: CodeBlock already infeasible 2019-05-11 07:11:14,014 INFO [PluginConnector.java:110]: ------------------------ END BlockEncoding---------------------------- 2019-05-11 07:11:14,014 INFO [PluginConnector.java:90]: ------------------------TraceAbstraction---------------------------- 2019-05-11 07:11:14,014 INFO [PluginConnector.java:252]: Initializing TraceAbstraction... 2019-05-11 07:11:14,015 INFO [PluginConnector.java:257]: TraceAbstraction initialized 2019-05-11 07:11:14,015 INFO [PluginConnector.java:162]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.05 07:11:13" (1/5) ... 2019-05-11 07:11:14,016 INFO [PluginConnector.java:162]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "BlockEncodedModel CFG 11.05 07:11:13" (2/5) ... 2019-05-11 07:11:14,017 INFO [PluginConnector.java:162]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.05 07:11:13" (3/5) ... 2019-05-11 07:11:14,017 INFO [PluginConnector.java:162]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.05 07:11:13" (4/5) ... 2019-05-11 07:11:14,018 INFO [PluginConnector.java:162]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.blockencoding CFG 11.05 07:11:14" (5/5) ... Automizer settings: Hoare:true NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION 2019-05-11 07:11:14,128 INFO [PluginConnector.java:110]: ------------------------ END TraceAbstraction---------------------------- 2019-05-11 07:11:14,129 INFO [PluginConnector.java:90]: ------------------------BuchiAutomizer---------------------------- 2019-05-11 07:11:14,129 INFO [PluginConnector.java:252]: Initializing BuchiAutomizer... 2019-05-11 07:11:14,129 INFO [PluginConnector.java:257]: BuchiAutomizer initialized 2019-05-11 07:11:14,131 INFO [PluginConnector.java:162]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.05 07:11:14" (1/1) ... 2019-05-11 07:11:16,367 INFO [PluginConnector.java:110]: ------------------------ END BuchiAutomizer---------------------------- 2019-05-11 07:11:16,368 INFO [Benchmark.java:150]: Toolchain (without parser) took 2767.09 ms. Allocated memory is still 649.6 MB. Free memory was 610.2 MB in the beginning and 485.2 MB in the end (delta: 125.0 MB). Peak memory consumption was 125.0 MB. Max. memory is 53.1 GB 2019-05-11 07:11:16,370 INFO [Benchmark.java:150]: CDTParser took 111.32 ms. Allocated memory is still 649.6 MB. Free memory was 618.3 MB in the beginning and 611.6 MB in the end (delta: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 53.1 GB 2019-05-11 07:11:16,371 INFO [Benchmark.java:150]: CACSL2BoogieTranslator took 112.94 ms. Allocated memory is still 649.6 MB. Free memory was 610.2 MB in the beginning and 606.2 MB in the end (delta: 4.0 MB). Peak memory consumption was 4.0 MB. Max. memory is 53.1 GB 2019-05-11 07:11:16,372 INFO [Benchmark.java:150]: Boogie Preprocessor took 25.51 ms. Allocated memory is still 649.6 MB. Free memory was 606.2 MB in the beginning and 604.9 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 53.1 GB 2019-05-11 07:11:16,373 INFO [Benchmark.java:150]: RCFGBuilder took 211.76 ms. Allocated memory is still 649.6 MB. Free memory was 604.9 MB in the beginning and 588.3 MB in the end (delta: 16.5 MB). Peak memory consumption was 16.5 MB. Max. memory is 53.1 GB 2019-05-11 07:11:16,373 INFO [Benchmark.java:150]: BlockEncoding took 60.83 ms. Allocated memory is still 649.6 MB. Free memory was 588.3 MB in the beginning and 584.3 MB in the end (delta: 4.1 MB). Peak memory consumption was 4.1 MB. Max. memory is 53.1 GB 2019-05-11 07:11:16,374 INFO [Benchmark.java:150]: TraceAbstraction took 114.63 ms. Allocated memory is still 649.6 MB. Free memory was 584.3 MB in the beginning and 577.5 MB in the end (delta: 6.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 53.1 GB 2019-05-11 07:11:16,375 INFO [Benchmark.java:150]: BuchiAutomizer took 2238.28 ms. Allocated memory is still 649.6 MB. Free memory was 577.5 MB in the beginning and 485.2 MB in the end (delta: 92.2 MB). Peak memory consumption was 92.2 MB. Max. memory is 53.1 GB 2019-05-11 07:11:16,381 INFO [ResultNotifier.java:119]: RESULT: Ultimate could not prove your program: Toolchain returned no Result. RESULT: Ultimate could not prove your program: Toolchain returned no Result. 2019-05-11 07:11:16,382 INFO [ToolchainManager.java:286]: ####################### End [Toolchain 1] ####################### 2019-05-11 07:11:16,382 INFO [BasicToolchainJob.java:73]: --- Results --- 2019-05-11 07:11:16,382 INFO [BasicToolchainJob.java:75]: * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: 2019-05-11 07:11:16,382 INFO [BasicToolchainJob.java:89]: - AllSpecificationsHoldResult: All specifications hold 2019-05-11 07:11:16,382 INFO [BasicToolchainJob.java:95]: We were not able to verify any specifiation because the program does not contain any specification. 2019-05-11 07:11:16,382 INFO [BasicToolchainJob.java:89]: - ProcedureContractResult [Line: 13]: Procedure Contract for main 2019-05-11 07:11:16,383 INFO [BasicToolchainJob.java:95]: Derived contract for procedure main: 1 2019-05-11 07:11:16,383 INFO [BasicToolchainJob.java:89]: - InvariantResult [Line: 20]: Loop Invariant 2019-05-11 07:11:16,383 INFO [BasicToolchainJob.java:95]: Derived loop invariant: 1 2019-05-11 07:11:16,383 INFO [BasicToolchainJob.java:89]: - BenchmarkResult: Ultimate Automizer benchmark data 2019-05-11 07:11:16,383 INFO [BasicToolchainJob.java:95]: CFG has 14 locations, 0 error locations. Automizer needed 0.0s and 0 iterations. Automata difference (including EdgeChecker) took 0.0s. Computation of Hoare annotation took 0.0s. Minimization removed 0 states and took 0.0s. Biggest automaton had 14 states and ocurred in iteration 0. InterpolantCoveringCapability: 0/0 ICC %: NaN EdgeCheckerBenchmarkData: No data available TraceCheckerBenchmark: No data available InterpolantConsolidationBenchmark: No data available 2019-05-11 07:11:16,383 INFO [BasicToolchainJob.java:75]: * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: 2019-05-11 07:11:16,384 INFO [BasicToolchainJob.java:89]: - BenchmarkResult: Constructed decomposition of program 2019-05-11 07:11:16,384 INFO [BasicToolchainJob.java:95]: Your program was decomposed into 7 terminating modules (3 trivial, 3 deterministic, 1 nondeterministic). One deterministic module has affine ranking function 2 * v2 + -2 * m + 1 and consists of 5 locations. One deterministic module has affine ranking function -1 * v2 + m + 0 and consists of 4 locations. One deterministic module has affine ranking function v1 + 0 and consists of 5 locations. One nondeterministic module has affine ranking function v2 + -1 * m + 1 and consists of 7 locations. 3 modules have a trivial ranking function, the largest among these consists of 6 locations. 2019-05-11 07:11:16,384 INFO [BasicToolchainJob.java:89]: - BenchmarkResult: Constructed termination proof in form of nested word automata 2019-05-11 07:11:16,384 INFO [BasicToolchainJob.java:95]: Your program was decomposed into the following automata NestedWordAutomaton finiteAutomatonIteration5 = ( callAlphabet = {"call #t~ret2 := main();" "call ULTIMATE.init();" }, internalAlphabet = {"assume !(~v1~2 > 0);" "assume true;" "assume true;" "havoc ~m~2;havoc ~n~2;havoc ~v1~2;havoc ~v2~2;~n~2 := #t~nondet0;havoc #t~nondet0;~m~2 := #t~nondet1;havoc #t~nondet1;assume !(~n~2 >= 0 && ~m~2 > 0);" "#res := 0;assume true;" "havoc ~m~2;havoc ~n~2;havoc ~v1~2;havoc ~v2~2;~n~2 := #t~nondet0;havoc #t~nondet0;~m~2 := #t~nondet1;havoc #t~nondet1;assume ~n~2 >= 0 && ~m~2 > 0;~v1~2 := ~n~2;~v2~2 := 0;" "assume !true;" "assume true;" "assume true;" "assume !!(~v1~2 > 0);" "assume !(~v2~2 < ~m~2);~v2~2 := 0;" "assume true;" "assume ~v2~2 < ~m~2;~v2~2 := ~v2~2 + 1;~v1~2 := ~v1~2 - 1;" }, returnAlphabet = {"return;" "return;" }, states = {"901#(and (<= 0 oldRank0) (<= (+ main_~v1~2 1) oldRank0))" "902#(<= main_~v1~2 oldRank0)" "888#unseeded" "922#(and (<= main_~v1~2 oldRank0) (<= (+ main_~v1~2 1) oldRank0))" "891#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" }, initialStates = {"888#unseeded" }, finalStates = {"901#(and (<= 0 oldRank0) (<= (+ main_~v1~2 1) oldRank0))" }, callTransitions = { ("888#unseeded" "call #t~ret2 := main();" "891#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") ("888#unseeded" "call ULTIMATE.init();" "891#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") }, internalTransitions = { ("901#(and (<= 0 oldRank0) (<= (+ main_~v1~2 1) oldRank0))" "assume true;" "902#(<= main_~v1~2 oldRank0)") ("901#(and (<= 0 oldRank0) (<= (+ main_~v1~2 1) oldRank0))" "assume !(~v2~2 < ~m~2);~v2~2 := 0;" "902#(<= main_~v1~2 oldRank0)") ("901#(and (<= 0 oldRank0) (<= (+ main_~v1~2 1) oldRank0))" "assume ~v2~2 < ~m~2;~v2~2 := ~v2~2 + 1;~v1~2 := ~v1~2 - 1;" "922#(and (<= main_~v1~2 oldRank0) (<= (+ main_~v1~2 1) oldRank0))") ("902#(<= main_~v1~2 oldRank0)" "assume true;" "902#(<= main_~v1~2 oldRank0)") ("902#(<= main_~v1~2 oldRank0)" "assume !!(~v1~2 > 0);" "902#(<= main_~v1~2 oldRank0)") ("902#(<= main_~v1~2 oldRank0)" "assume !(~v2~2 < ~m~2);~v2~2 := 0;" "902#(<= main_~v1~2 oldRank0)") ("902#(<= main_~v1~2 oldRank0)" "assume true;" "902#(<= main_~v1~2 oldRank0)") ("902#(<= main_~v1~2 oldRank0)" "assume ~v2~2 < ~m~2;~v2~2 := ~v2~2 + 1;~v1~2 := ~v1~2 - 1;" "922#(and (<= main_~v1~2 oldRank0) (<= (+ main_~v1~2 1) oldRank0))") ("922#(and (<= main_~v1~2 oldRank0) (<= (+ main_~v1~2 1) oldRank0))" "assume true;" "922#(and (<= main_~v1~2 oldRank0) (<= (+ main_~v1~2 1) oldRank0))") ("922#(and (<= main_~v1~2 oldRank0) (<= (+ main_~v1~2 1) oldRank0))" "assume !!(~v1~2 > 0);" "901#(and (<= 0 oldRank0) (<= (+ main_~v1~2 1) oldRank0))") ("922#(and (<= main_~v1~2 oldRank0) (<= (+ main_~v1~2 1) oldRank0))" "assume true;" "922#(and (<= main_~v1~2 oldRank0) (<= (+ main_~v1~2 1) oldRank0))") ("891#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "havoc ~m~2;havoc ~n~2;havoc ~v1~2;havoc ~v2~2;~n~2 := #t~nondet0;havoc #t~nondet0;~m~2 := #t~nondet1;havoc #t~nondet1;assume ~n~2 >= 0 && ~m~2 > 0;~v1~2 := ~n~2;~v2~2 := 0;" "891#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") ("891#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "assume true;" "891#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") ("891#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "assume true;" "891#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") ("891#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "assume !!(~v1~2 > 0);" "891#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") ("891#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "assume true;" "901#(and (<= 0 oldRank0) (<= (+ main_~v1~2 1) oldRank0))") ("891#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "assume ~v2~2 < ~m~2;~v2~2 := ~v2~2 + 1;~v1~2 := ~v1~2 - 1;" "891#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") }, returnTransitions = { ("891#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "888#unseeded" "return;" "888#unseeded") } ); NestedWordAutomaton finiteAutomatonIteration6 = ( callAlphabet = {"call #t~ret2 := main();" "call ULTIMATE.init();" }, internalAlphabet = {"assume !(~v1~2 > 0);" "assume true;" "assume true;" "havoc ~m~2;havoc ~n~2;havoc ~v1~2;havoc ~v2~2;~n~2 := #t~nondet0;havoc #t~nondet0;~m~2 := #t~nondet1;havoc #t~nondet1;assume !(~n~2 >= 0 && ~m~2 > 0);" "#res := 0;assume true;" "havoc ~m~2;havoc ~n~2;havoc ~v1~2;havoc ~v2~2;~n~2 := #t~nondet0;havoc #t~nondet0;~m~2 := #t~nondet1;havoc #t~nondet1;assume ~n~2 >= 0 && ~m~2 > 0;~v1~2 := ~n~2;~v2~2 := 0;" "assume !true;" "assume true;" "assume true;" "assume !!(~v1~2 > 0);" "assume !(~v2~2 < ~m~2);~v2~2 := 0;" "assume true;" "assume ~v2~2 < ~m~2;~v2~2 := ~v2~2 + 1;~v1~2 := ~v1~2 - 1;" }, returnAlphabet = {"return;" "return;" }, states = {"901#(and (<= 0 oldRank0) (<= (+ main_~v1~2 1) oldRank0))" "902#(<= main_~v1~2 oldRank0)" "888#unseeded" "922#(and (<= main_~v1~2 oldRank0) (<= (+ main_~v1~2 1) oldRank0))" "891#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" }, initialStates = {"888#unseeded" }, finalStates = {"901#(and (<= 0 oldRank0) (<= (+ main_~v1~2 1) oldRank0))" }, callTransitions = { ("888#unseeded" "call #t~ret2 := main();" "891#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") ("888#unseeded" "call ULTIMATE.init();" "891#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") }, internalTransitions = { ("901#(and (<= 0 oldRank0) (<= (+ main_~v1~2 1) oldRank0))" "assume true;" "902#(<= main_~v1~2 oldRank0)") ("901#(and (<= 0 oldRank0) (<= (+ main_~v1~2 1) oldRank0))" "assume !(~v2~2 < ~m~2);~v2~2 := 0;" "902#(<= main_~v1~2 oldRank0)") ("901#(and (<= 0 oldRank0) (<= (+ main_~v1~2 1) oldRank0))" "assume ~v2~2 < ~m~2;~v2~2 := ~v2~2 + 1;~v1~2 := ~v1~2 - 1;" "922#(and (<= main_~v1~2 oldRank0) (<= (+ main_~v1~2 1) oldRank0))") ("902#(<= main_~v1~2 oldRank0)" "assume true;" "902#(<= main_~v1~2 oldRank0)") ("902#(<= main_~v1~2 oldRank0)" "assume !!(~v1~2 > 0);" "902#(<= main_~v1~2 oldRank0)") ("902#(<= main_~v1~2 oldRank0)" "assume !(~v2~2 < ~m~2);~v2~2 := 0;" "902#(<= main_~v1~2 oldRank0)") ("902#(<= main_~v1~2 oldRank0)" "assume true;" "902#(<= main_~v1~2 oldRank0)") ("902#(<= main_~v1~2 oldRank0)" "assume ~v2~2 < ~m~2;~v2~2 := ~v2~2 + 1;~v1~2 := ~v1~2 - 1;" "922#(and (<= main_~v1~2 oldRank0) (<= (+ main_~v1~2 1) oldRank0))") ("922#(and (<= main_~v1~2 oldRank0) (<= (+ main_~v1~2 1) oldRank0))" "assume true;" "922#(and (<= main_~v1~2 oldRank0) (<= (+ main_~v1~2 1) oldRank0))") ("922#(and (<= main_~v1~2 oldRank0) (<= (+ main_~v1~2 1) oldRank0))" "assume !!(~v1~2 > 0);" "901#(and (<= 0 oldRank0) (<= (+ main_~v1~2 1) oldRank0))") ("922#(and (<= main_~v1~2 oldRank0) (<= (+ main_~v1~2 1) oldRank0))" "assume true;" "922#(and (<= main_~v1~2 oldRank0) (<= (+ main_~v1~2 1) oldRank0))") ("891#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "havoc ~m~2;havoc ~n~2;havoc ~v1~2;havoc ~v2~2;~n~2 := #t~nondet0;havoc #t~nondet0;~m~2 := #t~nondet1;havoc #t~nondet1;assume ~n~2 >= 0 && ~m~2 > 0;~v1~2 := ~n~2;~v2~2 := 0;" "891#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") ("891#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "assume true;" "891#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") ("891#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "assume true;" "891#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") ("891#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "assume !!(~v1~2 > 0);" "891#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") ("891#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "assume true;" "901#(and (<= 0 oldRank0) (<= (+ main_~v1~2 1) oldRank0))") ("891#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "assume ~v2~2 < ~m~2;~v2~2 := ~v2~2 + 1;~v1~2 := ~v1~2 - 1;" "891#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") }, returnTransitions = { ("891#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "888#unseeded" "return;" "888#unseeded") } ); NestedWordAutomaton buchiAutomatonIteration2 = ( callAlphabet = {"call #t~ret2 := main();" "call ULTIMATE.init();" }, internalAlphabet = {"assume !(~v1~2 > 0);" "assume true;" "assume true;" "havoc ~m~2;havoc ~n~2;havoc ~v1~2;havoc ~v2~2;~n~2 := #t~nondet0;havoc #t~nondet0;~m~2 := #t~nondet1;havoc #t~nondet1;assume !(~n~2 >= 0 && ~m~2 > 0);" "#res := 0;assume true;" "havoc ~m~2;havoc ~n~2;havoc ~v1~2;havoc ~v2~2;~n~2 := #t~nondet0;havoc #t~nondet0;~m~2 := #t~nondet1;havoc #t~nondet1;assume ~n~2 >= 0 && ~m~2 > 0;~v1~2 := ~n~2;~v2~2 := 0;" "assume !true;" "assume true;" "assume true;" "assume !!(~v1~2 > 0);" "assume !(~v2~2 < ~m~2);~v2~2 := 0;" "assume true;" "assume ~v2~2 < ~m~2;~v2~2 := ~v2~2 + 1;~v1~2 := ~v1~2 - 1;" }, returnAlphabet = {"return;" "return;" }, states = {"145#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))) (<= 1 main_~m~2))" "151#(and (<= 0 oldRank0) (<= (+ (* 2 main_~v2~2) 2) (+ (* 2 main_~m~2) oldRank0)) (<= 1 main_~m~2))" "136#unseeded" "152#(and (<= (+ (* 2 main_~v2~2) 1) (+ (* 2 main_~m~2) oldRank0)) (<= 1 main_~m~2))" "139#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" }, initialStates = {"136#unseeded" }, finalStates = {"151#(and (<= 0 oldRank0) (<= (+ (* 2 main_~v2~2) 2) (+ (* 2 main_~m~2) oldRank0)) (<= 1 main_~m~2))" }, callTransitions = { ("136#unseeded" "call #t~ret2 := main();" "139#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") ("136#unseeded" "call ULTIMATE.init();" "139#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") }, internalTransitions = { ("145#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))) (<= 1 main_~m~2))" "assume true;" "145#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))) (<= 1 main_~m~2))") ("145#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))) (<= 1 main_~m~2))" "assume !!(~v1~2 > 0);" "145#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))) (<= 1 main_~m~2))") ("145#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))) (<= 1 main_~m~2))" "assume ~v2~2 < ~m~2;~v2~2 := ~v2~2 + 1;~v1~2 := ~v1~2 - 1;" "151#(and (<= 0 oldRank0) (<= (+ (* 2 main_~v2~2) 2) (+ (* 2 main_~m~2) oldRank0)) (<= 1 main_~m~2))") ("151#(and (<= 0 oldRank0) (<= (+ (* 2 main_~v2~2) 2) (+ (* 2 main_~m~2) oldRank0)) (<= 1 main_~m~2))" "assume true;" "152#(and (<= (+ (* 2 main_~v2~2) 1) (+ (* 2 main_~m~2) oldRank0)) (<= 1 main_~m~2))") ("152#(and (<= (+ (* 2 main_~v2~2) 1) (+ (* 2 main_~m~2) oldRank0)) (<= 1 main_~m~2))" "assume true;" "152#(and (<= (+ (* 2 main_~v2~2) 1) (+ (* 2 main_~m~2) oldRank0)) (<= 1 main_~m~2))") ("152#(and (<= (+ (* 2 main_~v2~2) 1) (+ (* 2 main_~m~2) oldRank0)) (<= 1 main_~m~2))" "assume !!(~v1~2 > 0);" "152#(and (<= (+ (* 2 main_~v2~2) 1) (+ (* 2 main_~m~2) oldRank0)) (<= 1 main_~m~2))") ("152#(and (<= (+ (* 2 main_~v2~2) 1) (+ (* 2 main_~m~2) oldRank0)) (<= 1 main_~m~2))" "assume !(~v2~2 < ~m~2);~v2~2 := 0;" "151#(and (<= 0 oldRank0) (<= (+ (* 2 main_~v2~2) 2) (+ (* 2 main_~m~2) oldRank0)) (<= 1 main_~m~2))") ("139#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "havoc ~m~2;havoc ~n~2;havoc ~v1~2;havoc ~v2~2;~n~2 := #t~nondet0;havoc #t~nondet0;~m~2 := #t~nondet1;havoc #t~nondet1;assume ~n~2 >= 0 && ~m~2 > 0;~v1~2 := ~n~2;~v2~2 := 0;" "145#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))) (<= 1 main_~m~2))") ("139#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "assume true;" "139#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") }, returnTransitions = { ("139#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "136#unseeded" "return;" "136#unseeded") } ); NestedWordAutomaton buchiAutomatonIteration3 = ( callAlphabet = {"call #t~ret2 := main();" "call ULTIMATE.init();" }, internalAlphabet = {"assume !(~v1~2 > 0);" "assume true;" "assume true;" "havoc ~m~2;havoc ~n~2;havoc ~v1~2;havoc ~v2~2;~n~2 := #t~nondet0;havoc #t~nondet0;~m~2 := #t~nondet1;havoc #t~nondet1;assume !(~n~2 >= 0 && ~m~2 > 0);" "#res := 0;assume true;" "havoc ~m~2;havoc ~n~2;havoc ~v1~2;havoc ~v2~2;~n~2 := #t~nondet0;havoc #t~nondet0;~m~2 := #t~nondet1;havoc #t~nondet1;assume ~n~2 >= 0 && ~m~2 > 0;~v1~2 := ~n~2;~v2~2 := 0;" "assume !true;" "assume true;" "assume true;" "assume !!(~v1~2 > 0);" "assume !(~v2~2 < ~m~2);~v2~2 := 0;" "assume true;" "assume ~v2~2 < ~m~2;~v2~2 := ~v2~2 + 1;~v1~2 := ~v1~2 - 1;" }, returnAlphabet = {"return;" "return;" }, states = {"433#unseeded" "449#(and (<= 1 main_~v2~2) (<= 0 main_~v2~2) unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "436#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "442#(and (<= 0 main_~v2~2) unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "461#(and (<= 0 oldRank0) (<= 2 main_~m~2) (<= (+ main_~v2~2 2) (+ main_~m~2 oldRank0)))" "462#(and (<= 2 main_~m~2) (<= (+ main_~v2~2 1) (+ main_~m~2 oldRank0)))" "447#(and (<= 0 oldRank0) (<= (+ main_~v2~2 2) (+ main_~m~2 oldRank0)))" }, initialStates = {"433#unseeded" }, finalStates = {"461#(and (<= 0 oldRank0) (<= 2 main_~m~2) (<= (+ main_~v2~2 2) (+ main_~m~2 oldRank0)))" "447#(and (<= 0 oldRank0) (<= (+ main_~v2~2 2) (+ main_~m~2 oldRank0)))" }, callTransitions = { ("433#unseeded" "call #t~ret2 := main();" "436#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") ("433#unseeded" "call ULTIMATE.init();" "436#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") }, internalTransitions = { ("449#(and (<= 1 main_~v2~2) (<= 0 main_~v2~2) unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "assume true;" "449#(and (<= 1 main_~v2~2) (<= 0 main_~v2~2) unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") ("449#(and (<= 1 main_~v2~2) (<= 0 main_~v2~2) unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "assume !!(~v1~2 > 0);" "449#(and (<= 1 main_~v2~2) (<= 0 main_~v2~2) unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") ("449#(and (<= 1 main_~v2~2) (<= 0 main_~v2~2) unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "assume !(~v2~2 < ~m~2);~v2~2 := 0;" "442#(and (<= 0 main_~v2~2) unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") ("449#(and (<= 1 main_~v2~2) (<= 0 main_~v2~2) unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "assume true;" "449#(and (<= 1 main_~v2~2) (<= 0 main_~v2~2) unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") ("449#(and (<= 1 main_~v2~2) (<= 0 main_~v2~2) unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "assume ~v2~2 < ~m~2;~v2~2 := ~v2~2 + 1;~v1~2 := ~v1~2 - 1;" "449#(and (<= 1 main_~v2~2) (<= 0 main_~v2~2) unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") ("449#(and (<= 1 main_~v2~2) (<= 0 main_~v2~2) unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "assume ~v2~2 < ~m~2;~v2~2 := ~v2~2 + 1;~v1~2 := ~v1~2 - 1;" "461#(and (<= 0 oldRank0) (<= 2 main_~m~2) (<= (+ main_~v2~2 2) (+ main_~m~2 oldRank0)))") ("436#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "havoc ~m~2;havoc ~n~2;havoc ~v1~2;havoc ~v2~2;~n~2 := #t~nondet0;havoc #t~nondet0;~m~2 := #t~nondet1;havoc #t~nondet1;assume ~n~2 >= 0 && ~m~2 > 0;~v1~2 := ~n~2;~v2~2 := 0;" "442#(and (<= 0 main_~v2~2) unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") ("436#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "assume true;" "436#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") ("442#(and (<= 0 main_~v2~2) unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "assume true;" "442#(and (<= 0 main_~v2~2) unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") ("442#(and (<= 0 main_~v2~2) unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "assume !!(~v1~2 > 0);" "442#(and (<= 0 main_~v2~2) unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") ("442#(and (<= 0 main_~v2~2) unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "assume !(~v2~2 < ~m~2);~v2~2 := 0;" "442#(and (<= 0 main_~v2~2) unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") ("442#(and (<= 0 main_~v2~2) unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "assume true;" "442#(and (<= 0 main_~v2~2) unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") ("442#(and (<= 0 main_~v2~2) unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "assume ~v2~2 < ~m~2;~v2~2 := ~v2~2 + 1;~v1~2 := ~v1~2 - 1;" "449#(and (<= 1 main_~v2~2) (<= 0 main_~v2~2) unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") ("442#(and (<= 0 main_~v2~2) unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "assume ~v2~2 < ~m~2;~v2~2 := ~v2~2 + 1;~v1~2 := ~v1~2 - 1;" "447#(and (<= 0 oldRank0) (<= (+ main_~v2~2 2) (+ main_~m~2 oldRank0)))") ("461#(and (<= 0 oldRank0) (<= 2 main_~m~2) (<= (+ main_~v2~2 2) (+ main_~m~2 oldRank0)))" "assume true;" "462#(and (<= 2 main_~m~2) (<= (+ main_~v2~2 1) (+ main_~m~2 oldRank0)))") ("462#(and (<= 2 main_~m~2) (<= (+ main_~v2~2 1) (+ main_~m~2 oldRank0)))" "assume true;" "462#(and (<= 2 main_~m~2) (<= (+ main_~v2~2 1) (+ main_~m~2 oldRank0)))") ("462#(and (<= 2 main_~m~2) (<= (+ main_~v2~2 1) (+ main_~m~2 oldRank0)))" "assume !!(~v1~2 > 0);" "462#(and (<= 2 main_~m~2) (<= (+ main_~v2~2 1) (+ main_~m~2 oldRank0)))") ("462#(and (<= 2 main_~m~2) (<= (+ main_~v2~2 1) (+ main_~m~2 oldRank0)))" "assume !(~v2~2 < ~m~2);~v2~2 := 0;" "461#(and (<= 0 oldRank0) (<= 2 main_~m~2) (<= (+ main_~v2~2 2) (+ main_~m~2 oldRank0)))") }, returnTransitions = { ("436#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "433#unseeded" "return;" "433#unseeded") } ); NestedWordAutomaton buchiAutomatonIteration4 = ( callAlphabet = {"call #t~ret2 := main();" "call ULTIMATE.init();" }, internalAlphabet = {"assume !(~v1~2 > 0);" "assume true;" "assume true;" "havoc ~m~2;havoc ~n~2;havoc ~v1~2;havoc ~v2~2;~n~2 := #t~nondet0;havoc #t~nondet0;~m~2 := #t~nondet1;havoc #t~nondet1;assume !(~n~2 >= 0 && ~m~2 > 0);" "#res := 0;assume true;" "havoc ~m~2;havoc ~n~2;havoc ~v1~2;havoc ~v2~2;~n~2 := #t~nondet0;havoc #t~nondet0;~m~2 := #t~nondet1;havoc #t~nondet1;assume ~n~2 >= 0 && ~m~2 > 0;~v1~2 := ~n~2;~v2~2 := 0;" "assume !true;" "assume true;" "assume true;" "assume !!(~v1~2 > 0);" "assume !(~v2~2 < ~m~2);~v2~2 := 0;" "assume true;" "assume ~v2~2 < ~m~2;~v2~2 := ~v2~2 + 1;~v1~2 := ~v1~2 - 1;" }, returnAlphabet = {"return;" "return;" }, states = {"609#(and (<= 0 oldRank0) (<= (+ main_~m~2 1) (+ main_~v2~2 oldRank0)))" "610#(<= main_~m~2 (+ main_~v2~2 oldRank0))" "596#unseeded" "599#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" }, initialStates = {"596#unseeded" }, finalStates = {"609#(and (<= 0 oldRank0) (<= (+ main_~m~2 1) (+ main_~v2~2 oldRank0)))" }, callTransitions = { ("596#unseeded" "call #t~ret2 := main();" "599#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") ("596#unseeded" "call ULTIMATE.init();" "599#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") }, internalTransitions = { ("609#(and (<= 0 oldRank0) (<= (+ main_~m~2 1) (+ main_~v2~2 oldRank0)))" "assume true;" "610#(<= main_~m~2 (+ main_~v2~2 oldRank0))") ("609#(and (<= 0 oldRank0) (<= (+ main_~m~2 1) (+ main_~v2~2 oldRank0)))" "assume true;" "610#(<= main_~m~2 (+ main_~v2~2 oldRank0))") ("610#(<= main_~m~2 (+ main_~v2~2 oldRank0))" "assume true;" "610#(<= main_~m~2 (+ main_~v2~2 oldRank0))") ("610#(<= main_~m~2 (+ main_~v2~2 oldRank0))" "assume !!(~v1~2 > 0);" "610#(<= main_~m~2 (+ main_~v2~2 oldRank0))") ("610#(<= main_~m~2 (+ main_~v2~2 oldRank0))" "assume ~v2~2 < ~m~2;~v2~2 := ~v2~2 + 1;~v1~2 := ~v1~2 - 1;" "609#(and (<= 0 oldRank0) (<= (+ main_~m~2 1) (+ main_~v2~2 oldRank0)))") ("599#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "havoc ~m~2;havoc ~n~2;havoc ~v1~2;havoc ~v2~2;~n~2 := #t~nondet0;havoc #t~nondet0;~m~2 := #t~nondet1;havoc #t~nondet1;assume ~n~2 >= 0 && ~m~2 > 0;~v1~2 := ~n~2;~v2~2 := 0;" "599#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") ("599#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "assume true;" "599#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") ("599#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "assume true;" "599#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") ("599#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "assume !!(~v1~2 > 0);" "599#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") ("599#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "assume true;" "609#(and (<= 0 oldRank0) (<= (+ main_~m~2 1) (+ main_~v2~2 oldRank0)))") ("599#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "assume ~v2~2 < ~m~2;~v2~2 := ~v2~2 + 1;~v1~2 := ~v1~2 - 1;" "599#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") }, returnTransitions = { ("599#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "596#unseeded" "return;" "596#unseeded") } ); NestedWordAutomaton buchiAutomatonIteration5 = ( callAlphabet = {"call #t~ret2 := main();" "call ULTIMATE.init();" }, internalAlphabet = {"assume !(~v1~2 > 0);" "assume true;" "assume true;" "havoc ~m~2;havoc ~n~2;havoc ~v1~2;havoc ~v2~2;~n~2 := #t~nondet0;havoc #t~nondet0;~m~2 := #t~nondet1;havoc #t~nondet1;assume !(~n~2 >= 0 && ~m~2 > 0);" "#res := 0;assume true;" "havoc ~m~2;havoc ~n~2;havoc ~v1~2;havoc ~v2~2;~n~2 := #t~nondet0;havoc #t~nondet0;~m~2 := #t~nondet1;havoc #t~nondet1;assume ~n~2 >= 0 && ~m~2 > 0;~v1~2 := ~n~2;~v2~2 := 0;" "assume !true;" "assume true;" "assume true;" "assume !!(~v1~2 > 0);" "assume !(~v2~2 < ~m~2);~v2~2 := 0;" "assume true;" "assume ~v2~2 < ~m~2;~v2~2 := ~v2~2 + 1;~v1~2 := ~v1~2 - 1;" }, returnAlphabet = {"return;" "return;" }, states = {"901#(and (<= 0 oldRank0) (<= (+ main_~v1~2 1) oldRank0))" "902#(<= main_~v1~2 oldRank0)" "888#unseeded" "922#(and (<= main_~v1~2 oldRank0) (<= (+ main_~v1~2 1) oldRank0))" "891#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" }, initialStates = {"888#unseeded" }, finalStates = {"901#(and (<= 0 oldRank0) (<= (+ main_~v1~2 1) oldRank0))" }, callTransitions = { ("888#unseeded" "call #t~ret2 := main();" "891#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") ("888#unseeded" "call ULTIMATE.init();" "891#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") }, internalTransitions = { ("901#(and (<= 0 oldRank0) (<= (+ main_~v1~2 1) oldRank0))" "assume true;" "902#(<= main_~v1~2 oldRank0)") ("901#(and (<= 0 oldRank0) (<= (+ main_~v1~2 1) oldRank0))" "assume !(~v2~2 < ~m~2);~v2~2 := 0;" "902#(<= main_~v1~2 oldRank0)") ("901#(and (<= 0 oldRank0) (<= (+ main_~v1~2 1) oldRank0))" "assume ~v2~2 < ~m~2;~v2~2 := ~v2~2 + 1;~v1~2 := ~v1~2 - 1;" "922#(and (<= main_~v1~2 oldRank0) (<= (+ main_~v1~2 1) oldRank0))") ("902#(<= main_~v1~2 oldRank0)" "assume true;" "902#(<= main_~v1~2 oldRank0)") ("902#(<= main_~v1~2 oldRank0)" "assume !!(~v1~2 > 0);" "902#(<= main_~v1~2 oldRank0)") ("902#(<= main_~v1~2 oldRank0)" "assume !(~v2~2 < ~m~2);~v2~2 := 0;" "902#(<= main_~v1~2 oldRank0)") ("902#(<= main_~v1~2 oldRank0)" "assume true;" "902#(<= main_~v1~2 oldRank0)") ("902#(<= main_~v1~2 oldRank0)" "assume ~v2~2 < ~m~2;~v2~2 := ~v2~2 + 1;~v1~2 := ~v1~2 - 1;" "922#(and (<= main_~v1~2 oldRank0) (<= (+ main_~v1~2 1) oldRank0))") ("922#(and (<= main_~v1~2 oldRank0) (<= (+ main_~v1~2 1) oldRank0))" "assume true;" "922#(and (<= main_~v1~2 oldRank0) (<= (+ main_~v1~2 1) oldRank0))") ("922#(and (<= main_~v1~2 oldRank0) (<= (+ main_~v1~2 1) oldRank0))" "assume !!(~v1~2 > 0);" "901#(and (<= 0 oldRank0) (<= (+ main_~v1~2 1) oldRank0))") ("922#(and (<= main_~v1~2 oldRank0) (<= (+ main_~v1~2 1) oldRank0))" "assume true;" "922#(and (<= main_~v1~2 oldRank0) (<= (+ main_~v1~2 1) oldRank0))") ("891#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "havoc ~m~2;havoc ~n~2;havoc ~v1~2;havoc ~v2~2;~n~2 := #t~nondet0;havoc #t~nondet0;~m~2 := #t~nondet1;havoc #t~nondet1;assume ~n~2 >= 0 && ~m~2 > 0;~v1~2 := ~n~2;~v2~2 := 0;" "891#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") ("891#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "assume true;" "891#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") ("891#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "assume true;" "891#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") ("891#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "assume !!(~v1~2 > 0);" "891#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") ("891#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "assume true;" "901#(and (<= 0 oldRank0) (<= (+ main_~v1~2 1) oldRank0))") ("891#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "assume ~v2~2 < ~m~2;~v2~2 := ~v2~2 + 1;~v1~2 := ~v1~2 - 1;" "891#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") }, returnTransitions = { ("891#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "888#unseeded" "return;" "888#unseeded") } ); 2019-05-11 07:11:16,385 INFO [BasicToolchainJob.java:89]: - BenchmarkResult: Timing statistics 2019-05-11 07:11:16,386 INFO [BasicToolchainJob.java:95]: BüchiAutomizer plugin needed 2.2s and 7 iterations. Analysis of lassos took 1.0s. Construction of modules took 0.1s. Büchi inclusion checks took 0.8s. Highest rank in rank-based complementation 3. Minimization removed 27 states and took 0.0s. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 69 states and ocurred in iteration 5. Nontrivial modules had stage [3, 0, 1, 0, 0]. InterpolantCoveringCapabilityFinite: 59/76 InterpolantCoveringCapabilityBuchi: 12/12 EdgeCheckerBenchmarkData: HoareTripleChecks: 50 SDtfs, 5 SDslu, 67 SDs, 0 lazy, 216 Sat,166 Unsat,0 Unknown,0 NotChecked. HoareTripleCheck time: 0.1s LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT1 conc2 concLT1 SILN0 SILU0 SILI0 SILT0 lasso2 LassoPreprocessingBenchmarks: Termination: inital17 mio100 ax100 hnf95 lsp66 arr100 mio100 lsp100 div100 bol100 ite100 ukn100 eq148 hnf92 smp100 dnf100 smp100 tf111 neg100 sie100 Nontermination: inital17 mio100 ax100 hnf95 lsp66 arr100 mio100 lsp100 div100 bol100 ite100 ukn100 eq148 hnf92 smp100 dnf100 smp100 tf111 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: sat Degree: 0 Time: 57ms VariablesStem: 2 VariablesLoop: 3 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 2019-05-11 07:11:16,386 INFO [BasicToolchainJob.java:89]: - TerminationAnalysisResult: Termination proven 2019-05-11 07:11:16,387 INFO [BasicToolchainJob.java:95]: Buchi Automizer proved that your program is terminating 2019-05-11 07:11:16,387 INFO [BasicToolchainJob.java:75]: * Results from UltimateCore: 2019-05-11 07:11:16,387 INFO [BasicToolchainJob.java:89]: - BenchmarkResult: Toolchain Benchmarks 2019-05-11 07:11:16,393 INFO [BasicToolchainJob.java:95]: Benchmark results are: * CDTParser took 111.32 ms. Allocated memory is still 649.6 MB. Free memory was 618.3 MB in the beginning and 611.6 MB in the end (delta: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 53.1 GB * CACSL2BoogieTranslator took 112.94 ms. Allocated memory is still 649.6 MB. Free memory was 610.2 MB in the beginning and 606.2 MB in the end (delta: 4.0 MB). Peak memory consumption was 4.0 MB. Max. memory is 53.1 GB * Boogie Preprocessor took 25.51 ms. Allocated memory is still 649.6 MB. Free memory was 606.2 MB in the beginning and 604.9 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 53.1 GB * RCFGBuilder took 211.76 ms. Allocated memory is still 649.6 MB. Free memory was 604.9 MB in the beginning and 588.3 MB in the end (delta: 16.5 MB). Peak memory consumption was 16.5 MB. Max. memory is 53.1 GB * BlockEncoding took 60.83 ms. Allocated memory is still 649.6 MB. Free memory was 588.3 MB in the beginning and 584.3 MB in the end (delta: 4.1 MB). Peak memory consumption was 4.1 MB. Max. memory is 53.1 GB * TraceAbstraction took 114.63 ms. Allocated memory is still 649.6 MB. Free memory was 584.3 MB in the beginning and 577.5 MB in the end (delta: 6.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 53.1 GB * BuchiAutomizer took 2238.28 ms. Allocated memory is still 649.6 MB. Free memory was 577.5 MB in the beginning and 485.2 MB in the end (delta: 92.2 MB). Peak memory consumption was 92.2 MB. Max. memory is 53.1 GB 2019-05-11 07:11:16,419 INFO [UltimateCore.java:84]: Preparing to exit Ultimate with return code 0 Closed successfully