YES 2019-05-11 07:12:10,192 INFO [UltimateCore.java:185]: Initializing application 2019-05-11 07:12:10,195 INFO [UltimateCore.java:202]: -------------------------------------------------------------------------------- 2019-05-11 07:12:10,199 INFO [PluginFactory.java:62]: -------------------------------------------------------------------------------- 2019-05-11 07:12:10,199 INFO [PluginFactory.java:63]: Detecting plugins... 2019-05-11 07:12:10,200 INFO [PluginFactory.java:287]: 1 IController plugins available 2019-05-11 07:12:10,200 INFO [PluginFactory.java:287]: 4 ISource plugins available 2019-05-11 07:12:10,201 INFO [PluginFactory.java:287]: 1 IOutput plugins available 2019-05-11 07:12:10,201 INFO [PluginFactory.java:287]: 10 IGenerator plugins available 2019-05-11 07:12:10,201 INFO [PluginFactory.java:287]: 5 IAnalysis plugins available 2019-05-11 07:12:10,204 INFO [PluginFactory.java:241]: Loaded controller UltimateCore 2019-05-11 07:12:10,204 INFO [PluginFactory.java:70]: Finished detecting plugins! 2019-05-11 07:12:10,204 INFO [PluginFactory.java:71]: Loading services ... 2019-05-11 07:12:10,205 INFO [PluginFactory.java:272]: 0 IServiceFactory services available 2019-05-11 07:12:10,205 INFO [PluginFactory.java:73]: Finished loading services! 2019-05-11 07:12:10,205 INFO [PluginFactory.java:74]: -------------------------------------------------------------------------------- 2019-05-11 07:12:10,207 INFO [SettingsManager.java:46]: Loading settings from ./../termcomp2015.epf 2019-05-11 07:12:12,267 INFO [SettingsManager.java:54]: Loading preferences was successful 2019-05-11 07:12:12,267 INFO [SettingsManager.java:55]: Preferences different from defaults: 2019-05-11 07:12:12,267 INFO [PluginFactory.java:178]: -------------------------------------------------------------------------------- 2019-05-11 07:12:12,268 INFO [PluginFactory.java:179]: Loading all admissible plugins (creating one instance, loading preferences) 2019-05-11 07:12:12,621 INFO [PluginFactory.java:196]: Finished loading 20 admissible plugins (all were admissible) 2019-05-11 07:12:12,621 INFO [PluginFactory.java:198]: -------------------------------------------------------------------------------- 2019-05-11 07:12:12,622 INFO [SettingsManager.java:61]: Preferences of LassoRanker differ from their defaults: 2019-05-11 07:12:12,622 INFO [SettingsManager.java:63]: * Only non-decreasing invariants=true 2019-05-11 07:12:12,622 INFO [SettingsManager.java:63]: * Termination analysis=LINEAR_WITH_GUESSES 2019-05-11 07:12:12,622 INFO [SettingsManager.java:63]: * SMT solver command=z3 -smt2 -in SMTLIB2_COMPLIANT=true 2019-05-11 07:12:12,623 INFO [SettingsManager.java:63]: * Nontermination analysis=LINEAR_WITH_GUESSES 2019-05-11 07:12:12,623 INFO [SettingsManager.java:61]: Preferences of BlockEncoding differ from their defaults: 2019-05-11 07:12:12,623 INFO [SettingsManager.java:63]: * Rating-Boundary (empty for LBE)=0 2019-05-11 07:12:12,623 INFO [SettingsManager.java:63]: * Strategy for the edge rating=DISJUNCTIVE_RATING 2019-05-11 07:12:12,623 INFO [SettingsManager.java:61]: Preferences of BuchiAutomizer differ from their defaults: 2019-05-11 07:12:12,624 INFO [SettingsManager.java:63]: * Lasso Analysis=Linear_with_guesses 2019-05-11 07:12:12,624 INFO [SettingsManager.java:63]: * Use external solver (rank synthesis)=false 2019-05-11 07:12:12,624 INFO [SettingsManager.java:63]: * Buchi interpolant automaton=StagedBlast 2019-05-11 07:12:12,624 INFO [SettingsManager.java:63]: * Construct termination proof for TermComp=true 2019-05-11 07:12:12,624 INFO [SettingsManager.java:61]: Preferences of CACSL2BoogieTranslator differ from their defaults: 2019-05-11 07:12:12,625 INFO [SettingsManager.java:63]: * Check unreachability of error function in SV-COMP mode=false 2019-05-11 07:12:12,625 INFO [SettingsManager.java:63]: * Size of pointer (in bytes)=8 2019-05-11 07:12:12,625 INFO [SettingsManager.java:63]: * Check if freed pointer was valid=false 2019-05-11 07:12:12,625 INFO [SettingsManager.java:63]: * How to treat unsigned ints differently from normal ones=IGNORE 2019-05-11 07:12:12,625 INFO [SettingsManager.java:61]: Preferences of CodeCheck differ from their defaults: 2019-05-11 07:12:12,626 INFO [SettingsManager.java:63]: * Timeout in seconds=100000 2019-05-11 07:12:12,626 INFO [SettingsManager.java:63]: * The redirection strategy for Impulse=RANDOmSTRONGEST 2019-05-11 07:12:12,626 INFO [SettingsManager.java:61]: Preferences of RCFGBuilder differ from their defaults: 2019-05-11 07:12:12,626 INFO [SettingsManager.java:63]: * Size of a code block=SequenceOfStatements 2019-05-11 07:12:12,626 INFO [SettingsManager.java:63]: * Convert code blocks to CNF=false 2019-05-11 07:12:12,626 INFO [SettingsManager.java:63]: * To the following directory=/home/matthias/ultimate/dump 2019-05-11 07:12:12,627 INFO [SettingsManager.java:63]: * Command for external solver=./../z3/z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 2019-05-11 07:12:12,627 INFO [SettingsManager.java:61]: Preferences of TraceAbstraction differ from their defaults: 2019-05-11 07:12:12,627 INFO [SettingsManager.java:63]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true 2019-05-11 07:12:12,627 INFO [SettingsManager.java:61]: Preferences of UltimateCore differ from their defaults: 2019-05-11 07:12:12,627 INFO [SettingsManager.java:63]: * Log level for plugins=warn 2019-05-11 07:12:12,628 INFO [SettingsManager.java:61]: Preferences of UltimateCore differ from their defaults: 2019-05-11 07:12:12,628 INFO [SettingsManager.java:63]: * Log level for plugins=warn 2019-05-11 07:12:12,628 INFO [UltimateCore.java:76]: Initializing controller ... 2019-05-11 07:12:12,862 INFO [PersistenceAwareModelManager.java:56]: Repository-Root is: /tmp 2019-05-11 07:12:12,869 INFO [ToolchainManager.java:402]: [Toolchain 1]: Parser CDTParser is usable for /export/starexec/sandbox/benchmark/theBenchmark.c 2019-05-11 07:12:12,869 INFO [ToolchainManager.java:214]: [Toolchain 1]: Parser(s) successfully initiated... 2019-05-11 07:12:12,872 INFO [ToolchainManager.java:187]: [Toolchain 1]: Toolchain data selected. 2019-05-11 07:12:12,873 INFO [PluginConnector.java:252]: Initializing CDTParser... 2019-05-11 07:12:12,873 INFO [PluginConnector.java:257]: CDTParser initialized 2019-05-11 07:12:12,874 INFO [ToolchainManager.java:355]: [Toolchain 1]: Parsing single file: /export/starexec/sandbox/benchmark/theBenchmark.c 2019-05-11 07:12:13,002 INFO [ToolchainManager.java:238]: ####################### [Toolchain 1] ####################### 2019-05-11 07:12:13,003 INFO [ToolchainWalker.java:61]: Walking toolchain with 6 elements. 2019-05-11 07:12:13,004 INFO [PluginConnector.java:90]: ------------------------CACSL2BoogieTranslator---------------------------- 2019-05-11 07:12:13,004 INFO [PluginConnector.java:252]: Initializing CACSL2BoogieTranslator... 2019-05-11 07:12:13,008 INFO [PluginConnector.java:257]: CACSL2BoogieTranslator initialized 2019-05-11 07:12:13,008 INFO [PluginConnector.java:162]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.05 07:12:12" (1/1) ... 2019-05-11 07:12:13,117 INFO [PluginConnector.java:110]: ------------------------ END CACSL2BoogieTranslator---------------------------- 2019-05-11 07:12:13,117 INFO [PluginConnector.java:90]: ------------------------Boogie Preprocessor---------------------------- 2019-05-11 07:12:13,118 INFO [PluginConnector.java:252]: Initializing Boogie Preprocessor... 2019-05-11 07:12:13,118 INFO [PluginConnector.java:257]: Boogie Preprocessor initialized 2019-05-11 07:12:13,133 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:12:13" (1/1) ... 2019-05-11 07:12:13,138 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:12:13" (1/1) ... 2019-05-11 07:12:13,138 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:12:13" (1/1) ... 2019-05-11 07:12:13,140 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:12:13" (1/1) ... 2019-05-11 07:12:13,141 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:12:13" (1/1) ... 2019-05-11 07:12:13,142 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:12:13" (1/1) ... 2019-05-11 07:12:13,143 INFO [PluginConnector.java:110]: ------------------------ END Boogie Preprocessor---------------------------- 2019-05-11 07:12:13,143 INFO [PluginConnector.java:90]: ------------------------RCFGBuilder---------------------------- 2019-05-11 07:12:13,143 INFO [PluginConnector.java:252]: Initializing RCFGBuilder... 2019-05-11 07:12:13,143 INFO [PluginConnector.java:257]: RCFGBuilder initialized 2019-05-11 07:12:13,145 INFO [PluginConnector.java:162]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.05 07:12:13" (1/1) ... 2019-05-11 07:12:13,237 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:12:13,240 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:12:13,342 INFO [PluginConnector.java:110]: ------------------------ END RCFGBuilder---------------------------- 2019-05-11 07:12:13,343 INFO [PluginConnector.java:90]: ------------------------BlockEncoding---------------------------- 2019-05-11 07:12:13,343 INFO [PluginConnector.java:252]: Initializing BlockEncoding... 2019-05-11 07:12:13,344 INFO [PluginConnector.java:257]: BlockEncoding initialized 2019-05-11 07:12:13,344 INFO [PluginConnector.java:162]: Executing the observer BlockEncodingObserver from plugin BlockEncoding for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.05 07:12:13" (1/1) ... 2019-05-11 07:12:13,358 INFO [PluginConnector.java:162]: Executing the observer MinModelConversionObserver from plugin BlockEncoding for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.05 07:12:13" (1/1) ... 2019-05-11 07:12:13,390 WARN [TransFormula.java:607]: CodeBlock already infeasible 2019-05-11 07:12:13,391 WARN [TransFormula.java:607]: CodeBlock already infeasible 2019-05-11 07:12:13,392 WARN [TransFormula.java:607]: CodeBlock already infeasible 2019-05-11 07:12:13,393 WARN [TransFormula.java:607]: CodeBlock already infeasible 2019-05-11 07:12:13,394 INFO [PluginConnector.java:110]: ------------------------ END BlockEncoding---------------------------- 2019-05-11 07:12:13,394 INFO [PluginConnector.java:90]: ------------------------TraceAbstraction---------------------------- 2019-05-11 07:12:13,394 INFO [PluginConnector.java:252]: Initializing TraceAbstraction... 2019-05-11 07:12:13,395 INFO [PluginConnector.java:257]: TraceAbstraction initialized 2019-05-11 07:12:13,396 INFO [PluginConnector.java:162]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.05 07:12:12" (1/5) ... 2019-05-11 07:12:13,396 INFO [PluginConnector.java:162]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.blockencoding CFG 11.05 07:12:13" (2/5) ... 2019-05-11 07:12:13,397 INFO [PluginConnector.java:162]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "BlockEncodedModel CFG 11.05 07:12:13" (3/5) ... 2019-05-11 07:12:13,397 INFO [PluginConnector.java:162]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.05 07:12:13" (4/5) ... 2019-05-11 07:12:13,398 INFO [PluginConnector.java:162]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.05 07:12:13" (5/5) ... Automizer settings: Hoare:true NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION 2019-05-11 07:12:13,489 INFO [PluginConnector.java:110]: ------------------------ END TraceAbstraction---------------------------- 2019-05-11 07:12:13,489 INFO [PluginConnector.java:90]: ------------------------BuchiAutomizer---------------------------- 2019-05-11 07:12:13,489 INFO [PluginConnector.java:252]: Initializing BuchiAutomizer... 2019-05-11 07:12:13,490 INFO [PluginConnector.java:257]: BuchiAutomizer initialized 2019-05-11 07:12:13,492 INFO [PluginConnector.java:162]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.05 07:12:13" (1/1) ... 2019-05-11 07:12:14,813 INFO [PluginConnector.java:110]: ------------------------ END BuchiAutomizer---------------------------- 2019-05-11 07:12:14,814 INFO [Benchmark.java:150]: Toolchain (without parser) took 1812.04 ms. Allocated memory is still 643.3 MB. Free memory was 606.8 MB in the beginning and 413.4 MB in the end (delta: 193.4 MB). Peak memory consumption was 193.4 MB. Max. memory is 53.1 GB 2019-05-11 07:12:14,816 INFO [Benchmark.java:150]: CDTParser took 116.35 ms. Allocated memory is still 643.3 MB. Free memory was 614.9 MB in the beginning and 608.1 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:12:14,817 INFO [Benchmark.java:150]: CACSL2BoogieTranslator took 113.42 ms. Allocated memory is still 643.3 MB. Free memory was 606.8 MB in the beginning and 600.1 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:12:14,818 INFO [Benchmark.java:150]: Boogie Preprocessor took 25.36 ms. Allocated memory is still 643.3 MB. Free memory was 600.1 MB in the beginning and 598.8 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:12:14,819 INFO [Benchmark.java:150]: RCFGBuilder took 199.39 ms. Allocated memory is still 643.3 MB. Free memory was 598.8 MB in the beginning and 583.2 MB in the end (delta: 15.6 MB). Peak memory consumption was 15.6 MB. Max. memory is 53.1 GB 2019-05-11 07:12:14,820 INFO [Benchmark.java:150]: BlockEncoding took 51.42 ms. Allocated memory is still 643.3 MB. Free memory was 583.2 MB in the beginning and 579.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:12:14,820 INFO [Benchmark.java:150]: TraceAbstraction took 94.92 ms. Allocated memory is still 643.3 MB. Free memory was 579.2 MB in the beginning and 573.9 MB in the end (delta: 5.3 MB). Peak memory consumption was 5.3 MB. Max. memory is 53.1 GB 2019-05-11 07:12:14,821 INFO [Benchmark.java:150]: BuchiAutomizer took 1324.27 ms. Allocated memory is still 643.3 MB. Free memory was 573.9 MB in the beginning and 413.4 MB in the end (delta: 160.5 MB). Peak memory consumption was 160.5 MB. Max. memory is 53.1 GB 2019-05-11 07:12:14,828 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:12:14,829 INFO [ToolchainManager.java:286]: ####################### End [Toolchain 1] ####################### 2019-05-11 07:12:14,829 INFO [BasicToolchainJob.java:73]: --- Results --- 2019-05-11 07:12:14,829 INFO [BasicToolchainJob.java:75]: * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: 2019-05-11 07:12:14,829 INFO [BasicToolchainJob.java:89]: - AllSpecificationsHoldResult: All specifications hold 2019-05-11 07:12:14,829 INFO [BasicToolchainJob.java:95]: We were not able to verify any specifiation because the program does not contain any specification. 2019-05-11 07:12:14,830 INFO [BasicToolchainJob.java:89]: - ProcedureContractResult [Line: 13]: Procedure Contract for main 2019-05-11 07:12:14,830 INFO [BasicToolchainJob.java:95]: Derived contract for procedure main: 1 2019-05-11 07:12:14,830 INFO [BasicToolchainJob.java:89]: - InvariantResult [Line: 19]: Loop Invariant 2019-05-11 07:12:14,830 INFO [BasicToolchainJob.java:95]: Derived loop invariant: 1 2019-05-11 07:12:14,830 INFO [BasicToolchainJob.java:89]: - InvariantResult [Line: 17]: Loop Invariant 2019-05-11 07:12:14,830 INFO [BasicToolchainJob.java:95]: Derived loop invariant: 1 2019-05-11 07:12:14,831 INFO [BasicToolchainJob.java:89]: - BenchmarkResult: Ultimate Automizer benchmark data 2019-05-11 07:12:14,831 INFO [BasicToolchainJob.java:95]: CFG has 12 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 12 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:12:14,831 INFO [BasicToolchainJob.java:75]: * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: 2019-05-11 07:12:14,831 INFO [BasicToolchainJob.java:89]: - BenchmarkResult: Constructed decomposition of program 2019-05-11 07:12:14,831 INFO [BasicToolchainJob.java:95]: Your program was decomposed into 6 terminating modules (3 trivial, 2 deterministic, 1 nondeterministic). One deterministic module has affine ranking function i + 0 and consists of 4 locations. One deterministic module has affine ranking function j + 0 and consists of 4 locations. One nondeterministic module has affine ranking function j + 0 and consists of 4 locations. 3 modules have a trivial ranking function, the largest among these consists of 7 locations. 2019-05-11 07:12:14,831 INFO [BasicToolchainJob.java:89]: - BenchmarkResult: Constructed termination proof in form of nested word automata 2019-05-11 07:12:14,831 INFO [BasicToolchainJob.java:95]: Your program was decomposed into the following automata NestedWordAutomaton finiteAutomatonIteration2 = ( callAlphabet = {"call #t~ret1 := main();" "call ULTIMATE.init();" }, internalAlphabet = {"assume !true;" "assume true;assume !!(~j~2 > 0);~j~2 := ~j~2 - 1;" "assume !true;" "assume true;assume !(~j~2 > 0);" "assume true;" "~i~2 := ~i~2 - 1;" "assume true;" "assume true;assume !(~i~2 > 0);" "havoc ~i~2;havoc ~j~2;havoc ~N~2;~N~2 := #t~nondet0;havoc #t~nondet0;~i~2 := ~N~2;" "#res := 0;assume true;" "assume true;assume !!(~i~2 > 0);~j~2 := ~N~2;" }, returnAlphabet = {"return;" "return;" }, states = {"115#(and (<= main_~i~2 oldRank0) (<= 1 main_~i~2))" "102#unseeded" "105#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "111#(and (<= 0 oldRank0) (<= (+ main_~i~2 1) oldRank0))" }, initialStates = {"102#unseeded" }, finalStates = {"111#(and (<= 0 oldRank0) (<= (+ main_~i~2 1) oldRank0))" }, callTransitions = { ("102#unseeded" "call #t~ret1 := main();" "105#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") ("102#unseeded" "call ULTIMATE.init();" "105#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") }, internalTransitions = { ("115#(and (<= main_~i~2 oldRank0) (<= 1 main_~i~2))" "assume true;assume !!(~j~2 > 0);~j~2 := ~j~2 - 1;" "115#(and (<= main_~i~2 oldRank0) (<= 1 main_~i~2))") ("115#(and (<= main_~i~2 oldRank0) (<= 1 main_~i~2))" "assume true;assume !(~j~2 > 0);" "115#(and (<= main_~i~2 oldRank0) (<= 1 main_~i~2))") ("115#(and (<= main_~i~2 oldRank0) (<= 1 main_~i~2))" "~i~2 := ~i~2 - 1;" "111#(and (<= 0 oldRank0) (<= (+ main_~i~2 1) oldRank0))") ("105#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "assume true;" "105#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") ("105#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "havoc ~i~2;havoc ~j~2;havoc ~N~2;~N~2 := #t~nondet0;havoc #t~nondet0;~i~2 := ~N~2;" "111#(and (<= 0 oldRank0) (<= (+ main_~i~2 1) oldRank0))") ("111#(and (<= 0 oldRank0) (<= (+ main_~i~2 1) oldRank0))" "assume true;assume !!(~i~2 > 0);~j~2 := ~N~2;" "115#(and (<= main_~i~2 oldRank0) (<= 1 main_~i~2))") }, returnTransitions = { ("105#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "102#unseeded" "return;" "102#unseeded") } ); NestedWordAutomaton finiteAutomatonIteration4 = ( callAlphabet = {"call #t~ret1 := main();" "call ULTIMATE.init();" }, internalAlphabet = {"assume !true;" "assume true;assume !!(~j~2 > 0);~j~2 := ~j~2 - 1;" "assume !true;" "assume true;assume !(~j~2 > 0);" "assume true;" "~i~2 := ~i~2 - 1;" "assume true;" "assume true;assume !(~i~2 > 0);" "havoc ~i~2;havoc ~j~2;havoc ~N~2;~N~2 := #t~nondet0;havoc #t~nondet0;~i~2 := ~N~2;" "#res := 0;assume true;" "assume true;assume !!(~i~2 > 0);~j~2 := ~N~2;" }, returnAlphabet = {"return;" "return;" }, states = {"448#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "455#(and (<= (+ main_~j~2 1) oldRank0) (<= 0 oldRank0))" "456#(<= main_~j~2 oldRank0)" "445#unseeded" }, initialStates = {"445#unseeded" }, finalStates = {"455#(and (<= (+ main_~j~2 1) oldRank0) (<= 0 oldRank0))" }, callTransitions = { ("445#unseeded" "call #t~ret1 := main();" "448#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") ("445#unseeded" "call ULTIMATE.init();" "448#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") }, internalTransitions = { ("448#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "assume true;assume !!(~j~2 > 0);~j~2 := ~j~2 - 1;" "448#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") ("448#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "assume true;assume !(~j~2 > 0);" "448#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") ("448#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "assume true;" "448#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") ("448#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "~i~2 := ~i~2 - 1;" "448#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") ("448#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "havoc ~i~2;havoc ~j~2;havoc ~N~2;~N~2 := #t~nondet0;havoc #t~nondet0;~i~2 := ~N~2;" "448#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") ("448#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "assume true;assume !!(~i~2 > 0);~j~2 := ~N~2;" "448#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") ("448#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "assume true;assume !!(~i~2 > 0);~j~2 := ~N~2;" "455#(and (<= (+ main_~j~2 1) oldRank0) (<= 0 oldRank0))") ("455#(and (<= (+ main_~j~2 1) oldRank0) (<= 0 oldRank0))" "assume true;assume !!(~j~2 > 0);~j~2 := ~j~2 - 1;" "455#(and (<= (+ main_~j~2 1) oldRank0) (<= 0 oldRank0))") ("455#(and (<= (+ main_~j~2 1) oldRank0) (<= 0 oldRank0))" "assume true;assume !(~j~2 > 0);" "456#(<= main_~j~2 oldRank0)") ("456#(<= main_~j~2 oldRank0)" "~i~2 := ~i~2 - 1;" "456#(<= main_~j~2 oldRank0)") }, returnTransitions = { ("448#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "445#unseeded" "return;" "445#unseeded") } ); NestedWordAutomaton buchiAutomatonIteration2 = ( callAlphabet = {"call #t~ret1 := main();" "call ULTIMATE.init();" }, internalAlphabet = {"assume !true;" "assume true;assume !!(~j~2 > 0);~j~2 := ~j~2 - 1;" "assume !true;" "assume true;assume !(~j~2 > 0);" "assume true;" "~i~2 := ~i~2 - 1;" "assume true;" "assume true;assume !(~i~2 > 0);" "havoc ~i~2;havoc ~j~2;havoc ~N~2;~N~2 := #t~nondet0;havoc #t~nondet0;~i~2 := ~N~2;" "#res := 0;assume true;" "assume true;assume !!(~i~2 > 0);~j~2 := ~N~2;" }, returnAlphabet = {"return;" "return;" }, states = {"115#(and (<= main_~i~2 oldRank0) (<= 1 main_~i~2))" "102#unseeded" "105#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "111#(and (<= 0 oldRank0) (<= (+ main_~i~2 1) oldRank0))" }, initialStates = {"102#unseeded" }, finalStates = {"111#(and (<= 0 oldRank0) (<= (+ main_~i~2 1) oldRank0))" }, callTransitions = { ("102#unseeded" "call #t~ret1 := main();" "105#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") ("102#unseeded" "call ULTIMATE.init();" "105#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") }, internalTransitions = { ("115#(and (<= main_~i~2 oldRank0) (<= 1 main_~i~2))" "assume true;assume !!(~j~2 > 0);~j~2 := ~j~2 - 1;" "115#(and (<= main_~i~2 oldRank0) (<= 1 main_~i~2))") ("115#(and (<= main_~i~2 oldRank0) (<= 1 main_~i~2))" "assume true;assume !(~j~2 > 0);" "115#(and (<= main_~i~2 oldRank0) (<= 1 main_~i~2))") ("115#(and (<= main_~i~2 oldRank0) (<= 1 main_~i~2))" "~i~2 := ~i~2 - 1;" "111#(and (<= 0 oldRank0) (<= (+ main_~i~2 1) oldRank0))") ("105#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "assume true;" "105#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") ("105#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "havoc ~i~2;havoc ~j~2;havoc ~N~2;~N~2 := #t~nondet0;havoc #t~nondet0;~i~2 := ~N~2;" "111#(and (<= 0 oldRank0) (<= (+ main_~i~2 1) oldRank0))") ("111#(and (<= 0 oldRank0) (<= (+ main_~i~2 1) oldRank0))" "assume true;assume !!(~i~2 > 0);~j~2 := ~N~2;" "115#(and (<= main_~i~2 oldRank0) (<= 1 main_~i~2))") }, returnTransitions = { ("105#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "102#unseeded" "return;" "102#unseeded") } ); NestedWordAutomaton buchiAutomatonIteration3 = ( callAlphabet = {"call #t~ret1 := main();" "call ULTIMATE.init();" }, internalAlphabet = {"assume !true;" "assume true;assume !!(~j~2 > 0);~j~2 := ~j~2 - 1;" "assume !true;" "assume true;assume !(~j~2 > 0);" "assume true;" "~i~2 := ~i~2 - 1;" "assume true;" "assume true;assume !(~i~2 > 0);" "havoc ~i~2;havoc ~j~2;havoc ~N~2;~N~2 := #t~nondet0;havoc #t~nondet0;~i~2 := ~N~2;" "#res := 0;assume true;" "assume true;assume !!(~i~2 > 0);~j~2 := ~N~2;" }, returnAlphabet = {"return;" "return;" }, states = {"192#unseeded" "195#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "202#(and (<= (+ main_~j~2 1) oldRank0) (<= 0 oldRank0))" "203#(<= main_~j~2 oldRank0)" }, initialStates = {"192#unseeded" }, finalStates = {"202#(and (<= (+ main_~j~2 1) oldRank0) (<= 0 oldRank0))" }, callTransitions = { ("192#unseeded" "call #t~ret1 := main();" "195#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") ("192#unseeded" "call ULTIMATE.init();" "195#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") }, internalTransitions = { ("195#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "assume true;" "195#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") ("195#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "havoc ~i~2;havoc ~j~2;havoc ~N~2;~N~2 := #t~nondet0;havoc #t~nondet0;~i~2 := ~N~2;" "195#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") ("195#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "assume true;assume !!(~i~2 > 0);~j~2 := ~N~2;" "202#(and (<= (+ main_~j~2 1) oldRank0) (<= 0 oldRank0))") ("202#(and (<= (+ main_~j~2 1) oldRank0) (<= 0 oldRank0))" "assume true;assume !!(~j~2 > 0);~j~2 := ~j~2 - 1;" "202#(and (<= (+ main_~j~2 1) oldRank0) (<= 0 oldRank0))") ("202#(and (<= (+ main_~j~2 1) oldRank0) (<= 0 oldRank0))" "assume true;assume !(~j~2 > 0);" "203#(<= main_~j~2 oldRank0)") ("203#(<= main_~j~2 oldRank0)" "~i~2 := ~i~2 - 1;" "203#(<= main_~j~2 oldRank0)") }, returnTransitions = { ("195#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "192#unseeded" "return;" "192#unseeded") } ); NestedWordAutomaton buchiAutomatonIteration4 = ( callAlphabet = {"call #t~ret1 := main();" "call ULTIMATE.init();" }, internalAlphabet = {"assume !true;" "assume true;assume !!(~j~2 > 0);~j~2 := ~j~2 - 1;" "assume !true;" "assume true;assume !(~j~2 > 0);" "assume true;" "~i~2 := ~i~2 - 1;" "assume true;" "assume true;assume !(~i~2 > 0);" "havoc ~i~2;havoc ~j~2;havoc ~N~2;~N~2 := #t~nondet0;havoc #t~nondet0;~i~2 := ~N~2;" "#res := 0;assume true;" "assume true;assume !!(~i~2 > 0);~j~2 := ~N~2;" }, returnAlphabet = {"return;" "return;" }, states = {"448#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "455#(and (<= (+ main_~j~2 1) oldRank0) (<= 0 oldRank0))" "456#(<= main_~j~2 oldRank0)" "445#unseeded" }, initialStates = {"445#unseeded" }, finalStates = {"455#(and (<= (+ main_~j~2 1) oldRank0) (<= 0 oldRank0))" }, callTransitions = { ("445#unseeded" "call #t~ret1 := main();" "448#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") ("445#unseeded" "call ULTIMATE.init();" "448#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") }, internalTransitions = { ("448#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "assume true;assume !!(~j~2 > 0);~j~2 := ~j~2 - 1;" "448#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") ("448#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "assume true;assume !(~j~2 > 0);" "448#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") ("448#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "assume true;" "448#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") ("448#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "~i~2 := ~i~2 - 1;" "448#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") ("448#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "havoc ~i~2;havoc ~j~2;havoc ~N~2;~N~2 := #t~nondet0;havoc #t~nondet0;~i~2 := ~N~2;" "448#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") ("448#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "assume true;assume !!(~i~2 > 0);~j~2 := ~N~2;" "448#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))") ("448#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "assume true;assume !!(~i~2 > 0);~j~2 := ~N~2;" "455#(and (<= (+ main_~j~2 1) oldRank0) (<= 0 oldRank0))") ("455#(and (<= (+ main_~j~2 1) oldRank0) (<= 0 oldRank0))" "assume true;assume !!(~j~2 > 0);~j~2 := ~j~2 - 1;" "455#(and (<= (+ main_~j~2 1) oldRank0) (<= 0 oldRank0))") ("455#(and (<= (+ main_~j~2 1) oldRank0) (<= 0 oldRank0))" "assume true;assume !(~j~2 > 0);" "456#(<= main_~j~2 oldRank0)") ("456#(<= main_~j~2 oldRank0)" "~i~2 := ~i~2 - 1;" "456#(<= main_~j~2 oldRank0)") }, returnTransitions = { ("448#(and unseeded (or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|))))" "445#unseeded" "return;" "445#unseeded") } ); 2019-05-11 07:12:14,832 INFO [BasicToolchainJob.java:89]: - BenchmarkResult: Timing statistics 2019-05-11 07:12:14,832 INFO [BasicToolchainJob.java:95]: BüchiAutomizer plugin needed 1.2s and 5 iterations. Analysis of lassos took 0.4s. Construction of modules took 0.1s. Büchi inclusion checks took 0.6s. Highest rank in rank-based complementation 3. Minimization removed 8 states and took 0.0s. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 11 states and ocurred in iteration 2. Nontrivial modules had stage [2, 0, 1, 0, 0]. InterpolantCoveringCapabilityFinite: 0/2 InterpolantCoveringCapabilityBuchi: 0/0 EdgeCheckerBenchmarkData: HoareTripleChecks: 17 SDtfs, 3 SDslu, 6 SDs, 0 lazy, 71 Sat,77 Unsat,0 Unknown,0 NotChecked. HoareTripleCheck time: 0.1s LassoAnalysisResults: nont0 unkn0 SFLI1 SFLT1 conc0 concLT1 SILN0 SILU0 SILI0 SILT1 lasso0 LassoPreprocessingBenchmarks: Termination: inital12 mio100 ax100 hnf98 lsp87 arr100 mio100 lsp100 div100 bol100 ite100 ukn100 eq160 hnf93 smp100 dnf100 smp100 tf113 neg100 sie100 Nontermination: inital12 mio100 ax100 hnf98 lsp87 arr100 mio100 lsp100 div100 bol100 ite100 ukn100 eq160 hnf93 smp100 dnf100 smp100 tf113 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: sat Degree: 0 Time: 28ms VariablesStem: 0 VariablesLoop: 2 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 0 MotzkinApplications: 2 2019-05-11 07:12:14,833 INFO [BasicToolchainJob.java:89]: - TerminationAnalysisResult: Termination proven 2019-05-11 07:12:14,833 INFO [BasicToolchainJob.java:95]: Buchi Automizer proved that your program is terminating 2019-05-11 07:12:14,833 INFO [BasicToolchainJob.java:75]: * Results from UltimateCore: 2019-05-11 07:12:14,833 INFO [BasicToolchainJob.java:89]: - BenchmarkResult: Toolchain Benchmarks 2019-05-11 07:12:14,840 INFO [BasicToolchainJob.java:95]: Benchmark results are: * CDTParser took 116.35 ms. Allocated memory is still 643.3 MB. Free memory was 614.9 MB in the beginning and 608.1 MB in the end (delta: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 53.1 GB * CACSL2BoogieTranslator took 113.42 ms. Allocated memory is still 643.3 MB. Free memory was 606.8 MB in the beginning and 600.1 MB in the end (delta: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 53.1 GB * Boogie Preprocessor took 25.36 ms. Allocated memory is still 643.3 MB. Free memory was 600.1 MB in the beginning and 598.8 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 53.1 GB * RCFGBuilder took 199.39 ms. Allocated memory is still 643.3 MB. Free memory was 598.8 MB in the beginning and 583.2 MB in the end (delta: 15.6 MB). Peak memory consumption was 15.6 MB. Max. memory is 53.1 GB * BlockEncoding took 51.42 ms. Allocated memory is still 643.3 MB. Free memory was 583.2 MB in the beginning and 579.2 MB in the end (delta: 4.0 MB). Peak memory consumption was 4.0 MB. Max. memory is 53.1 GB * TraceAbstraction took 94.92 ms. Allocated memory is still 643.3 MB. Free memory was 579.2 MB in the beginning and 573.9 MB in the end (delta: 5.3 MB). Peak memory consumption was 5.3 MB. Max. memory is 53.1 GB * BuchiAutomizer took 1324.27 ms. Allocated memory is still 643.3 MB. Free memory was 573.9 MB in the beginning and 413.4 MB in the end (delta: 160.5 MB). Peak memory consumption was 160.5 MB. Max. memory is 53.1 GB 2019-05-11 07:12:14,866 INFO [UltimateCore.java:84]: Preparing to exit Ultimate with return code 0 Closed successfully