Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/data/fkordon/mcc2022-input.r168-tall-165277017200811.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2022-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
..............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itstools
Input is PolyORBNT-PT-S05J20, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r168-tall-165277017200811
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 2.2M
-rw-r--r-- 1 mcc users 17K Apr 30 03:06 CTLCardinality.txt
-rw-r--r-- 1 mcc users 119K Apr 30 03:06 CTLCardinality.xml
-rw-r--r-- 1 mcc users 50K Apr 30 03:05 CTLFireability.txt
-rw-r--r-- 1 mcc users 220K Apr 30 03:05 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:34 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K May 10 09:34 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 7.3K May 9 08:29 LTLCardinality.txt
-rw-r--r-- 1 mcc users 33K May 9 08:29 LTLCardinality.xml
-rw-r--r-- 1 mcc users 36K May 9 08:29 LTLFireability.txt
-rw-r--r-- 1 mcc users 120K May 9 08:29 LTLFireability.xml
-rw-r--r-- 1 mcc users 2.0K May 9 08:29 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.5K May 9 08:29 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 10 09:34 equiv_col
-rw-r--r-- 1 mcc users 7 May 10 09:34 instance
-rw-r--r-- 1 mcc users 6 May 10 09:34 iscolored
-rw-r--r-- 1 mcc users 1.6M May 10 09:34 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME PolyORBNT-PT-S05J20-LTLCardinality-00
FORMULA_NAME PolyORBNT-PT-S05J20-LTLCardinality-01
FORMULA_NAME PolyORBNT-PT-S05J20-LTLCardinality-02
FORMULA_NAME PolyORBNT-PT-S05J20-LTLCardinality-03
FORMULA_NAME PolyORBNT-PT-S05J20-LTLCardinality-04
FORMULA_NAME PolyORBNT-PT-S05J20-LTLCardinality-05
FORMULA_NAME PolyORBNT-PT-S05J20-LTLCardinality-06
FORMULA_NAME PolyORBNT-PT-S05J20-LTLCardinality-07
FORMULA_NAME PolyORBNT-PT-S05J20-LTLCardinality-08
FORMULA_NAME PolyORBNT-PT-S05J20-LTLCardinality-09
FORMULA_NAME PolyORBNT-PT-S05J20-LTLCardinality-10
FORMULA_NAME PolyORBNT-PT-S05J20-LTLCardinality-11
FORMULA_NAME PolyORBNT-PT-S05J20-LTLCardinality-12
FORMULA_NAME PolyORBNT-PT-S05J20-LTLCardinality-13
FORMULA_NAME PolyORBNT-PT-S05J20-LTLCardinality-14
FORMULA_NAME PolyORBNT-PT-S05J20-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1652955683714

Running Version 202205111006
[2022-05-19 10:21:24] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2022-05-19 10:21:24] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-19 10:21:25] [INFO ] Load time of PNML (sax parser for PT used): 193 ms
[2022-05-19 10:21:25] [INFO ] Transformed 349 places.
[2022-05-19 10:21:25] [INFO ] Transformed 1210 transitions.
[2022-05-19 10:21:25] [INFO ] Parsed PT model containing 349 places and 1210 transitions in 308 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 12 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
Ensure Unique test removed 655 transitions
Reduce redundant transitions removed 655 transitions.
FORMULA PolyORBNT-PT-S05J20-LTLCardinality-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBNT-PT-S05J20-LTLCardinality-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBNT-PT-S05J20-LTLCardinality-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBNT-PT-S05J20-LTLCardinality-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 177 out of 349 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 349/349 places, 555/555 transitions.
Ensure Unique test removed 5 places
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 344 transition count 555
Applied a total of 5 rules in 32 ms. Remains 344 /349 variables (removed 5) and now considering 555/555 (removed 0) transitions.
[2022-05-19 10:21:25] [INFO ] Flow matrix only has 551 transitions (discarded 4 similar events)
// Phase 1: matrix 551 rows 344 cols
[2022-05-19 10:21:25] [INFO ] Computed 57 place invariants in 43 ms
[2022-05-19 10:21:26] [INFO ] Dead Transitions using invariants and state equation in 651 ms found 95 transitions.
Found 95 dead transitions using SMT.
Drop transitions removed 95 transitions
Dead transitions reduction (with SMT) triggered by suspicious arc values removed 95 transitions.
[2022-05-19 10:21:26] [INFO ] Flow matrix only has 456 transitions (discarded 4 similar events)
// Phase 1: matrix 456 rows 344 cols
[2022-05-19 10:21:26] [INFO ] Computed 57 place invariants in 37 ms
[2022-05-19 10:21:26] [INFO ] Implicit Places using invariants in 266 ms returned []
[2022-05-19 10:21:26] [INFO ] Flow matrix only has 456 transitions (discarded 4 similar events)
// Phase 1: matrix 456 rows 344 cols
[2022-05-19 10:21:26] [INFO ] Computed 57 place invariants in 33 ms
[2022-05-19 10:21:26] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-19 10:21:27] [INFO ] Implicit Places using invariants and state equation in 1278 ms returned []
Implicit Place search using SMT with State Equation took 1546 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 344/349 places, 460/555 transitions.
Applied a total of 0 rules in 18 ms. Remains 344 /344 variables (removed 0) and now considering 460/460 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 344/349 places, 460/555 transitions.
Support contains 177 out of 344 places after structural reductions.
[2022-05-19 10:21:27] [INFO ] Flatten gal took : 77 ms
[2022-05-19 10:21:27] [INFO ] Flatten gal took : 43 ms
[2022-05-19 10:21:28] [INFO ] Input system was already deterministic with 460 transitions.
Incomplete random walk after 10000 steps, including 682 resets, run finished after 518 ms. (steps per millisecond=19 ) properties (out of 27) seen :18
Incomplete Best-First random walk after 10001 steps, including 174 resets, run finished after 98 ms. (steps per millisecond=102 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10000 steps, including 164 resets, run finished after 62 ms. (steps per millisecond=161 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10000 steps, including 133 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 9) seen :1
Incomplete Best-First random walk after 10001 steps, including 145 resets, run finished after 57 ms. (steps per millisecond=175 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10000 steps, including 158 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 303 resets, run finished after 69 ms. (steps per millisecond=144 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 303 resets, run finished after 75 ms. (steps per millisecond=133 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 202 resets, run finished after 67 ms. (steps per millisecond=149 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 168 resets, run finished after 59 ms. (steps per millisecond=169 ) properties (out of 8) seen :0
Running SMT prover for 8 properties.
[2022-05-19 10:21:29] [INFO ] Flow matrix only has 456 transitions (discarded 4 similar events)
// Phase 1: matrix 456 rows 344 cols
[2022-05-19 10:21:29] [INFO ] Computed 57 place invariants in 13 ms
[2022-05-19 10:21:29] [INFO ] [Real]Absence check using 43 positive place invariants in 13 ms returned sat
[2022-05-19 10:21:29] [INFO ] [Real]Absence check using 43 positive and 14 generalized place invariants in 12 ms returned sat
[2022-05-19 10:21:29] [INFO ] After 163ms SMT Verify possible using all constraints in real domain returned unsat :3 sat :0 real:5
[2022-05-19 10:21:29] [INFO ] [Nat]Absence check using 43 positive place invariants in 14 ms returned sat
[2022-05-19 10:21:29] [INFO ] [Nat]Absence check using 43 positive and 14 generalized place invariants in 13 ms returned sat
[2022-05-19 10:21:29] [INFO ] After 171ms SMT Verify possible using all constraints in natural domain returned unsat :8 sat :0
Fused 8 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 1 ms.
FORMULA PolyORBNT-PT-S05J20-LTLCardinality-01 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 8 atomic propositions for a total of 11 simplifications.
FORMULA PolyORBNT-PT-S05J20-LTLCardinality-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBNT-PT-S05J20-LTLCardinality-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBNT-PT-S05J20-LTLCardinality-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 0 stabilizing places and 0 stable transitions
FORMULA PolyORBNT-PT-S05J20-LTLCardinality-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 105 out of 344 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 344/344 places, 460/460 transitions.
Drop transitions removed 26 transitions
Trivial Post-agglo rules discarded 26 transitions
Performed 26 trivial Post agglomeration. Transition count delta: 26
Iterating post reduction 0 with 26 rules applied. Total rules applied 26 place count 344 transition count 434
Reduce places removed 26 places and 0 transitions.
Iterating post reduction 1 with 26 rules applied. Total rules applied 52 place count 318 transition count 434
Performed 25 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 25 Pre rules applied. Total rules applied 52 place count 318 transition count 409
Deduced a syphon composed of 25 places in 0 ms
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 2 with 50 rules applied. Total rules applied 102 place count 293 transition count 409
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 103 place count 292 transition count 408
Iterating global reduction 2 with 1 rules applied. Total rules applied 104 place count 292 transition count 408
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 2 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 108 place count 290 transition count 406
Applied a total of 108 rules in 71 ms. Remains 290 /344 variables (removed 54) and now considering 406/460 (removed 54) transitions.
[2022-05-19 10:21:29] [INFO ] Flow matrix only has 402 transitions (discarded 4 similar events)
// Phase 1: matrix 402 rows 290 cols
[2022-05-19 10:21:29] [INFO ] Computed 57 place invariants in 5 ms
[2022-05-19 10:21:30] [INFO ] Dead Transitions using invariants and state equation in 254 ms found 0 transitions.
[2022-05-19 10:21:30] [INFO ] Flow matrix only has 402 transitions (discarded 4 similar events)
// Phase 1: matrix 402 rows 290 cols
[2022-05-19 10:21:30] [INFO ] Computed 57 place invariants in 5 ms
[2022-05-19 10:21:30] [INFO ] Implicit Places using invariants in 243 ms returned []
[2022-05-19 10:21:30] [INFO ] Flow matrix only has 402 transitions (discarded 4 similar events)
// Phase 1: matrix 402 rows 290 cols
[2022-05-19 10:21:30] [INFO ] Computed 57 place invariants in 10 ms
[2022-05-19 10:21:30] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-19 10:21:31] [INFO ] Implicit Places using invariants and state equation in 1507 ms returned []
Implicit Place search using SMT with State Equation took 1755 ms to find 0 implicit places.
[2022-05-19 10:21:31] [INFO ] Redundant transitions in 33 ms returned []
[2022-05-19 10:21:31] [INFO ] Flow matrix only has 402 transitions (discarded 4 similar events)
// Phase 1: matrix 402 rows 290 cols
[2022-05-19 10:21:31] [INFO ] Computed 57 place invariants in 11 ms
[2022-05-19 10:21:32] [INFO ] Dead Transitions using invariants and state equation in 262 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 290/344 places, 406/460 transitions.
Finished structural reductions, in 1 iterations. Remains : 290/344 places, 406/460 transitions.
Stuttering acceptance computed with spot in 136 ms :[(NOT p0)]
Running random walk in product with property : PolyORBNT-PT-S05J20-LTLCardinality-02 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(LEQ 1 (ADD s2 s4 s5 s6 s8 s10 s11 s18 s23 s24 s27 s32 s33 s43 s44 s47 s50 s52 s53 s56 s58 s60 s62 s63 s64 s67 s78 s79 s88 s90 s92 s94 s95 s97 s102 s10...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 22 steps with 2 reset in 2 ms.
FORMULA PolyORBNT-PT-S05J20-LTLCardinality-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBNT-PT-S05J20-LTLCardinality-02 finished in 2583 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F((F(!(p0 U p1))&&F(G(X(F(G(!p0))))))))'
Support contains 23 out of 344 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 344/344 places, 460/460 transitions.
Drop transitions removed 25 transitions
Trivial Post-agglo rules discarded 25 transitions
Performed 25 trivial Post agglomeration. Transition count delta: 25
Iterating post reduction 0 with 25 rules applied. Total rules applied 25 place count 344 transition count 435
Reduce places removed 25 places and 0 transitions.
Iterating post reduction 1 with 25 rules applied. Total rules applied 50 place count 319 transition count 435
Performed 25 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 25 Pre rules applied. Total rules applied 50 place count 319 transition count 410
Deduced a syphon composed of 25 places in 0 ms
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 2 with 50 rules applied. Total rules applied 100 place count 294 transition count 410
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 101 place count 293 transition count 409
Iterating global reduction 2 with 1 rules applied. Total rules applied 102 place count 293 transition count 409
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 106 place count 291 transition count 407
Applied a total of 106 rules in 58 ms. Remains 291 /344 variables (removed 53) and now considering 407/460 (removed 53) transitions.
[2022-05-19 10:21:32] [INFO ] Flow matrix only has 403 transitions (discarded 4 similar events)
// Phase 1: matrix 403 rows 291 cols
[2022-05-19 10:21:32] [INFO ] Computed 57 place invariants in 4 ms
[2022-05-19 10:21:32] [INFO ] Dead Transitions using invariants and state equation in 254 ms found 0 transitions.
[2022-05-19 10:21:32] [INFO ] Flow matrix only has 403 transitions (discarded 4 similar events)
// Phase 1: matrix 403 rows 291 cols
[2022-05-19 10:21:32] [INFO ] Computed 57 place invariants in 4 ms
[2022-05-19 10:21:32] [INFO ] Implicit Places using invariants in 289 ms returned []
[2022-05-19 10:21:32] [INFO ] Flow matrix only has 403 transitions (discarded 4 similar events)
// Phase 1: matrix 403 rows 291 cols
[2022-05-19 10:21:32] [INFO ] Computed 57 place invariants in 25 ms
[2022-05-19 10:21:33] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-19 10:21:34] [INFO ] Implicit Places using invariants and state equation in 2024 ms returned []
Implicit Place search using SMT with State Equation took 2317 ms to find 0 implicit places.
[2022-05-19 10:21:34] [INFO ] Redundant transitions in 10 ms returned []
[2022-05-19 10:21:34] [INFO ] Flow matrix only has 403 transitions (discarded 4 similar events)
// Phase 1: matrix 403 rows 291 cols
[2022-05-19 10:21:34] [INFO ] Computed 57 place invariants in 6 ms
[2022-05-19 10:21:35] [INFO ] Dead Transitions using invariants and state equation in 275 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 291/344 places, 407/460 transitions.
Finished structural reductions, in 1 iterations. Remains : 291/344 places, 407/460 transitions.
Stuttering acceptance computed with spot in 114 ms :[(OR p0 p1), p1, p0]
Running random walk in product with property : PolyORBNT-PT-S05J20-LTLCardinality-03 automaton TGBA Formula[mat=[[{ cond=(OR p0 p1), acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 1}, { cond=p1, acceptance={0} source=1 dest: 1}], [{ cond=(NOT p0), acceptance={} source=2 dest: 2}, { cond=p0, acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(LEQ 1 s279), p1:(LEQ s182 (ADD s29 s31 s46 s76 s77 s83 s93 s106 s114 s132 s155 s166 s183 s193 s202 s206 s227 s233 s250 s272 s287))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 1408 steps with 130 reset in 28 ms.
FORMULA PolyORBNT-PT-S05J20-LTLCardinality-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBNT-PT-S05J20-LTLCardinality-03 finished in 3095 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(!(p0 U p1))))'
Support contains 3 out of 344 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 344/344 places, 460/460 transitions.
Applied a total of 0 rules in 14 ms. Remains 344 /344 variables (removed 0) and now considering 460/460 (removed 0) transitions.
[2022-05-19 10:21:35] [INFO ] Flow matrix only has 456 transitions (discarded 4 similar events)
// Phase 1: matrix 456 rows 344 cols
[2022-05-19 10:21:35] [INFO ] Computed 57 place invariants in 7 ms
[2022-05-19 10:21:35] [INFO ] Dead Transitions using invariants and state equation in 342 ms found 0 transitions.
[2022-05-19 10:21:35] [INFO ] Flow matrix only has 456 transitions (discarded 4 similar events)
// Phase 1: matrix 456 rows 344 cols
[2022-05-19 10:21:35] [INFO ] Computed 57 place invariants in 5 ms
[2022-05-19 10:21:36] [INFO ] Implicit Places using invariants in 280 ms returned []
[2022-05-19 10:21:36] [INFO ] Flow matrix only has 456 transitions (discarded 4 similar events)
// Phase 1: matrix 456 rows 344 cols
[2022-05-19 10:21:36] [INFO ] Computed 57 place invariants in 7 ms
[2022-05-19 10:21:36] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-19 10:21:37] [INFO ] Implicit Places using invariants and state equation in 1569 ms returned []
Implicit Place search using SMT with State Equation took 1854 ms to find 0 implicit places.
[2022-05-19 10:21:37] [INFO ] Flow matrix only has 456 transitions (discarded 4 similar events)
// Phase 1: matrix 456 rows 344 cols
[2022-05-19 10:21:37] [INFO ] Computed 57 place invariants in 5 ms
[2022-05-19 10:21:38] [INFO ] Dead Transitions using invariants and state equation in 391 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 344/344 places, 460/460 transitions.
Stuttering acceptance computed with spot in 125 ms :[true, p1, p1, p1]
Running random walk in product with property : PolyORBNT-PT-S05J20-LTLCardinality-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=p1, acceptance={} source=1 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}]], initial=3, aps=[p1:(LEQ 3 s58), p0:(LEQ s147 s75)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 33333 reset in 472 ms.
Product exploration explored 100000 steps with 33333 reset in 415 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT p1)))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (X (NOT p1)))
Knowledge based reduction with 3 factoid took 75 ms. Reduced automaton from 4 states, 5 edges and 2 AP to 1 states, 0 edges and 0 AP.
FORMULA PolyORBNT-PT-S05J20-LTLCardinality-04 TRUE TECHNIQUES KNOWLEDGE
Treatment of property PolyORBNT-PT-S05J20-LTLCardinality-04 finished in 3717 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X((false U p0)))'
Support contains 21 out of 344 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 344/344 places, 460/460 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 343 transition count 459
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 343 transition count 459
Applied a total of 2 rules in 26 ms. Remains 343 /344 variables (removed 1) and now considering 459/460 (removed 1) transitions.
[2022-05-19 10:21:39] [INFO ] Flow matrix only has 455 transitions (discarded 4 similar events)
// Phase 1: matrix 455 rows 343 cols
[2022-05-19 10:21:39] [INFO ] Computed 57 place invariants in 9 ms
[2022-05-19 10:21:39] [INFO ] Dead Transitions using invariants and state equation in 344 ms found 0 transitions.
[2022-05-19 10:21:39] [INFO ] Flow matrix only has 455 transitions (discarded 4 similar events)
// Phase 1: matrix 455 rows 343 cols
[2022-05-19 10:21:39] [INFO ] Computed 57 place invariants in 4 ms
[2022-05-19 10:21:39] [INFO ] Implicit Places using invariants in 269 ms returned []
[2022-05-19 10:21:39] [INFO ] Flow matrix only has 455 transitions (discarded 4 similar events)
// Phase 1: matrix 455 rows 343 cols
[2022-05-19 10:21:39] [INFO ] Computed 57 place invariants in 9 ms
[2022-05-19 10:21:40] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-19 10:21:42] [INFO ] Implicit Places using invariants and state equation in 2552 ms returned []
Implicit Place search using SMT with State Equation took 2822 ms to find 0 implicit places.
[2022-05-19 10:21:42] [INFO ] Flow matrix only has 455 transitions (discarded 4 similar events)
// Phase 1: matrix 455 rows 343 cols
[2022-05-19 10:21:42] [INFO ] Computed 57 place invariants in 10 ms
[2022-05-19 10:21:42] [INFO ] Dead Transitions using invariants and state equation in 400 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 343/344 places, 459/460 transitions.
Finished structural reductions, in 1 iterations. Remains : 343/344 places, 459/460 transitions.
Stuttering acceptance computed with spot in 80 ms :[(NOT p0), (NOT p0), true]
Running random walk in product with property : PolyORBNT-PT-S05J20-LTLCardinality-06 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={0} source=2 dest: 2}]], initial=1, aps=[p0:(GT 3 (ADD s0 s16 s30 s40 s61 s72 s86 s90 s120 s162 s189 s214 s215 s224 s227 s247 s268 s283 s292 s303 s304))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 451 ms.
Product exploration explored 100000 steps with 50000 reset in 438 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0), true]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X p0)
Knowledge based reduction with 3 factoid took 75 ms. Reduced automaton from 3 states, 3 edges and 1 AP to 1 states, 0 edges and 0 AP.
FORMULA PolyORBNT-PT-S05J20-LTLCardinality-06 TRUE TECHNIQUES KNOWLEDGE
Treatment of property PolyORBNT-PT-S05J20-LTLCardinality-06 finished in 4659 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((X(p0)||p1))))'
Support contains 4 out of 344 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 344/344 places, 460/460 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 343 transition count 459
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 343 transition count 459
Applied a total of 2 rules in 14 ms. Remains 343 /344 variables (removed 1) and now considering 459/460 (removed 1) transitions.
[2022-05-19 10:21:43] [INFO ] Flow matrix only has 455 transitions (discarded 4 similar events)
// Phase 1: matrix 455 rows 343 cols
[2022-05-19 10:21:43] [INFO ] Computed 57 place invariants in 9 ms
[2022-05-19 10:21:44] [INFO ] Dead Transitions using invariants and state equation in 385 ms found 0 transitions.
[2022-05-19 10:21:44] [INFO ] Flow matrix only has 455 transitions (discarded 4 similar events)
// Phase 1: matrix 455 rows 343 cols
[2022-05-19 10:21:44] [INFO ] Computed 57 place invariants in 5 ms
[2022-05-19 10:21:44] [INFO ] Implicit Places using invariants in 299 ms returned []
[2022-05-19 10:21:44] [INFO ] Flow matrix only has 455 transitions (discarded 4 similar events)
// Phase 1: matrix 455 rows 343 cols
[2022-05-19 10:21:44] [INFO ] Computed 57 place invariants in 12 ms
[2022-05-19 10:21:44] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-19 10:21:46] [INFO ] Implicit Places using invariants and state equation in 2163 ms returned []
Implicit Place search using SMT with State Equation took 2468 ms to find 0 implicit places.
[2022-05-19 10:21:46] [INFO ] Flow matrix only has 455 transitions (discarded 4 similar events)
// Phase 1: matrix 455 rows 343 cols
[2022-05-19 10:21:46] [INFO ] Computed 57 place invariants in 9 ms
[2022-05-19 10:21:47] [INFO ] Dead Transitions using invariants and state equation in 370 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 343/344 places, 459/460 transitions.
Finished structural reductions, in 1 iterations. Remains : 343/344 places, 459/460 transitions.
Stuttering acceptance computed with spot in 130 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : PolyORBNT-PT-S05J20-LTLCardinality-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p1), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p1:(GT s275 s215), p0:(GT s331 s58)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 11948 reset in 241 ms.
Product exploration explored 100000 steps with 11931 reset in 298 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT p1)), (X (X (AND (NOT p1) (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 301 ms. Reduced automaton from 3 states, 3 edges and 2 AP to 3 states, 3 edges and 2 AP.
Stuttering acceptance computed with spot in 113 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Finished random walk after 8 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=4 )
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT p1)), (X (X (AND (NOT p1) (NOT p0))))]
False Knowledge obtained : [(F (NOT (AND (NOT p0) (NOT p1))))]
Knowledge based reduction with 3 factoid took 116 ms. Reduced automaton from 3 states, 3 edges and 2 AP to 3 states, 3 edges and 2 AP.
Stuttering acceptance computed with spot in 96 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 94 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
[2022-05-19 10:21:48] [INFO ] Flow matrix only has 455 transitions (discarded 4 similar events)
// Phase 1: matrix 455 rows 343 cols
[2022-05-19 10:21:48] [INFO ] Computed 57 place invariants in 6 ms
[2022-05-19 10:21:48] [INFO ] [Real]Absence check using 44 positive place invariants in 16 ms returned sat
[2022-05-19 10:21:48] [INFO ] [Real]Absence check using 44 positive and 13 generalized place invariants in 17 ms returned sat
[2022-05-19 10:21:48] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-19 10:21:49] [INFO ] [Real]Absence check using state equation in 626 ms returned sat
[2022-05-19 10:21:49] [INFO ] Solution in real domain found non-integer solution.
[2022-05-19 10:21:49] [INFO ] [Nat]Absence check using 44 positive place invariants in 15 ms returned sat
[2022-05-19 10:21:49] [INFO ] [Nat]Absence check using 44 positive and 13 generalized place invariants in 23 ms returned sat
[2022-05-19 10:21:49] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-19 10:21:50] [INFO ] [Nat]Absence check using state equation in 1079 ms returned sat
[2022-05-19 10:21:50] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-19 10:21:50] [INFO ] [Nat]Added 1 Read/Feed constraints in 28 ms returned sat
[2022-05-19 10:21:50] [INFO ] Deduced a trap composed of 144 places in 120 ms of which 3 ms to minimize.
[2022-05-19 10:21:51] [INFO ] Deduced a trap composed of 147 places in 130 ms of which 1 ms to minimize.
[2022-05-19 10:21:51] [INFO ] Deduced a trap composed of 150 places in 118 ms of which 1 ms to minimize.
[2022-05-19 10:21:51] [INFO ] Deduced a trap composed of 141 places in 117 ms of which 0 ms to minimize.
[2022-05-19 10:21:51] [INFO ] Deduced a trap composed of 129 places in 117 ms of which 0 ms to minimize.
[2022-05-19 10:21:51] [INFO ] Deduced a trap composed of 146 places in 117 ms of which 0 ms to minimize.
[2022-05-19 10:21:51] [INFO ] Deduced a trap composed of 141 places in 111 ms of which 1 ms to minimize.
[2022-05-19 10:21:51] [INFO ] Deduced a trap composed of 138 places in 109 ms of which 1 ms to minimize.
[2022-05-19 10:21:52] [INFO ] Deduced a trap composed of 138 places in 104 ms of which 1 ms to minimize.
[2022-05-19 10:21:52] [INFO ] Deduced a trap composed of 144 places in 106 ms of which 1 ms to minimize.
[2022-05-19 10:21:53] [INFO ] Deduced a trap composed of 147 places in 107 ms of which 0 ms to minimize.
[2022-05-19 10:21:53] [INFO ] Deduced a trap composed of 144 places in 106 ms of which 0 ms to minimize.
[2022-05-19 10:21:53] [INFO ] Deduced a trap composed of 141 places in 107 ms of which 0 ms to minimize.
[2022-05-19 10:21:53] [INFO ] Deduced a trap composed of 148 places in 114 ms of which 0 ms to minimize.
[2022-05-19 10:21:53] [INFO ] Deduced a trap composed of 153 places in 104 ms of which 1 ms to minimize.
[2022-05-19 10:21:53] [INFO ] Deduced a trap composed of 144 places in 109 ms of which 1 ms to minimize.
[2022-05-19 10:21:54] [INFO ] Deduced a trap composed of 141 places in 109 ms of which 1 ms to minimize.
[2022-05-19 10:21:54] [INFO ] Deduced a trap composed of 144 places in 118 ms of which 0 ms to minimize.
[2022-05-19 10:21:54] [INFO ] Deduced a trap composed of 143 places in 113 ms of which 0 ms to minimize.
[2022-05-19 10:21:54] [INFO ] Deduced a trap composed of 147 places in 116 ms of which 0 ms to minimize.
[2022-05-19 10:21:55] [INFO ] Deduced a trap composed of 136 places in 111 ms of which 0 ms to minimize.
[2022-05-19 10:21:55] [INFO ] Deduced a trap composed of 141 places in 109 ms of which 1 ms to minimize.
[2022-05-19 10:21:55] [INFO ] Deduced a trap composed of 147 places in 109 ms of which 1 ms to minimize.
[2022-05-19 10:21:56] [INFO ] Deduced a trap composed of 144 places in 122 ms of which 0 ms to minimize.
[2022-05-19 10:21:57] [INFO ] Deduced a trap composed of 144 places in 109 ms of which 1 ms to minimize.
[2022-05-19 10:21:57] [INFO ] Deduced a trap composed of 147 places in 110 ms of which 0 ms to minimize.
[2022-05-19 10:21:57] [INFO ] Deduced a trap composed of 141 places in 111 ms of which 1 ms to minimize.
[2022-05-19 10:21:58] [INFO ] Trap strengthening (SAT) tested/added 28/27 trap constraints in 7582 ms
[2022-05-19 10:21:58] [INFO ] Computed and/alt/rep : 254/594/254 causal constraints (skipped 195 transitions) in 30 ms.
[2022-05-19 10:21:58] [INFO ] Added : 32 causal constraints over 7 iterations in 346 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p1))
Support contains 4 out of 343 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 343/343 places, 459/459 transitions.
Applied a total of 0 rules in 6 ms. Remains 343 /343 variables (removed 0) and now considering 459/459 (removed 0) transitions.
[2022-05-19 10:21:58] [INFO ] Flow matrix only has 455 transitions (discarded 4 similar events)
// Phase 1: matrix 455 rows 343 cols
[2022-05-19 10:21:58] [INFO ] Computed 57 place invariants in 4 ms
[2022-05-19 10:21:59] [INFO ] Dead Transitions using invariants and state equation in 384 ms found 0 transitions.
[2022-05-19 10:21:59] [INFO ] Flow matrix only has 455 transitions (discarded 4 similar events)
// Phase 1: matrix 455 rows 343 cols
[2022-05-19 10:21:59] [INFO ] Computed 57 place invariants in 3 ms
[2022-05-19 10:21:59] [INFO ] Implicit Places using invariants in 307 ms returned []
[2022-05-19 10:21:59] [INFO ] Flow matrix only has 455 transitions (discarded 4 similar events)
// Phase 1: matrix 455 rows 343 cols
[2022-05-19 10:21:59] [INFO ] Computed 57 place invariants in 4 ms
[2022-05-19 10:21:59] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-19 10:22:01] [INFO ] Implicit Places using invariants and state equation in 2363 ms returned []
Implicit Place search using SMT with State Equation took 2672 ms to find 0 implicit places.
[2022-05-19 10:22:01] [INFO ] Flow matrix only has 455 transitions (discarded 4 similar events)
// Phase 1: matrix 455 rows 343 cols
[2022-05-19 10:22:01] [INFO ] Computed 57 place invariants in 4 ms
[2022-05-19 10:22:02] [INFO ] Dead Transitions using invariants and state equation in 376 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 343/343 places, 459/459 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (X (AND (NOT p0) (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 84 ms. Reduced automaton from 3 states, 3 edges and 2 AP to 3 states, 3 edges and 2 AP.
Stuttering acceptance computed with spot in 131 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Finished random walk after 7 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=7 )
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (X (AND (NOT p0) (NOT p1))))]
False Knowledge obtained : [(F (NOT (AND (NOT p0) (NOT p1))))]
Knowledge based reduction with 2 factoid took 103 ms. Reduced automaton from 3 states, 3 edges and 2 AP to 3 states, 3 edges and 2 AP.
Stuttering acceptance computed with spot in 112 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 126 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
[2022-05-19 10:22:02] [INFO ] Flow matrix only has 455 transitions (discarded 4 similar events)
// Phase 1: matrix 455 rows 343 cols
[2022-05-19 10:22:02] [INFO ] Computed 57 place invariants in 5 ms
[2022-05-19 10:22:02] [INFO ] [Real]Absence check using 44 positive place invariants in 14 ms returned sat
[2022-05-19 10:22:02] [INFO ] [Real]Absence check using 44 positive and 13 generalized place invariants in 18 ms returned sat
[2022-05-19 10:22:02] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-19 10:22:03] [INFO ] [Real]Absence check using state equation in 706 ms returned sat
[2022-05-19 10:22:03] [INFO ] Solution in real domain found non-integer solution.
[2022-05-19 10:22:03] [INFO ] [Nat]Absence check using 44 positive place invariants in 17 ms returned sat
[2022-05-19 10:22:03] [INFO ] [Nat]Absence check using 44 positive and 13 generalized place invariants in 25 ms returned sat
[2022-05-19 10:22:03] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-19 10:22:05] [INFO ] [Nat]Absence check using state equation in 1117 ms returned sat
[2022-05-19 10:22:05] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-19 10:22:05] [INFO ] [Nat]Added 1 Read/Feed constraints in 24 ms returned sat
[2022-05-19 10:22:05] [INFO ] Deduced a trap composed of 144 places in 112 ms of which 1 ms to minimize.
[2022-05-19 10:22:05] [INFO ] Deduced a trap composed of 147 places in 110 ms of which 0 ms to minimize.
[2022-05-19 10:22:05] [INFO ] Deduced a trap composed of 150 places in 113 ms of which 0 ms to minimize.
[2022-05-19 10:22:05] [INFO ] Deduced a trap composed of 141 places in 107 ms of which 0 ms to minimize.
[2022-05-19 10:22:05] [INFO ] Deduced a trap composed of 129 places in 108 ms of which 1 ms to minimize.
[2022-05-19 10:22:05] [INFO ] Deduced a trap composed of 146 places in 113 ms of which 0 ms to minimize.
[2022-05-19 10:22:06] [INFO ] Deduced a trap composed of 141 places in 114 ms of which 0 ms to minimize.
[2022-05-19 10:22:06] [INFO ] Deduced a trap composed of 138 places in 111 ms of which 1 ms to minimize.
[2022-05-19 10:22:06] [INFO ] Deduced a trap composed of 138 places in 107 ms of which 0 ms to minimize.
[2022-05-19 10:22:07] [INFO ] Deduced a trap composed of 144 places in 112 ms of which 1 ms to minimize.
[2022-05-19 10:22:07] [INFO ] Deduced a trap composed of 147 places in 110 ms of which 0 ms to minimize.
[2022-05-19 10:22:07] [INFO ] Deduced a trap composed of 144 places in 108 ms of which 1 ms to minimize.
[2022-05-19 10:22:07] [INFO ] Deduced a trap composed of 141 places in 111 ms of which 0 ms to minimize.
[2022-05-19 10:22:07] [INFO ] Deduced a trap composed of 148 places in 132 ms of which 0 ms to minimize.
[2022-05-19 10:22:08] [INFO ] Deduced a trap composed of 153 places in 121 ms of which 1 ms to minimize.
[2022-05-19 10:22:08] [INFO ] Deduced a trap composed of 144 places in 123 ms of which 1 ms to minimize.
[2022-05-19 10:22:08] [INFO ] Deduced a trap composed of 141 places in 115 ms of which 0 ms to minimize.
[2022-05-19 10:22:08] [INFO ] Deduced a trap composed of 144 places in 118 ms of which 0 ms to minimize.
[2022-05-19 10:22:09] [INFO ] Deduced a trap composed of 143 places in 118 ms of which 0 ms to minimize.
[2022-05-19 10:22:09] [INFO ] Deduced a trap composed of 147 places in 122 ms of which 1 ms to minimize.
[2022-05-19 10:22:09] [INFO ] Deduced a trap composed of 136 places in 119 ms of which 1 ms to minimize.
[2022-05-19 10:22:10] [INFO ] Deduced a trap composed of 141 places in 112 ms of which 0 ms to minimize.
[2022-05-19 10:22:10] [INFO ] Deduced a trap composed of 147 places in 122 ms of which 1 ms to minimize.
[2022-05-19 10:22:10] [INFO ] Deduced a trap composed of 144 places in 108 ms of which 1 ms to minimize.
[2022-05-19 10:22:11] [INFO ] Deduced a trap composed of 144 places in 108 ms of which 1 ms to minimize.
[2022-05-19 10:22:11] [INFO ] Deduced a trap composed of 147 places in 110 ms of which 1 ms to minimize.
[2022-05-19 10:22:12] [INFO ] Deduced a trap composed of 141 places in 110 ms of which 0 ms to minimize.
[2022-05-19 10:22:12] [INFO ] Trap strengthening (SAT) tested/added 28/27 trap constraints in 7542 ms
[2022-05-19 10:22:12] [INFO ] Computed and/alt/rep : 254/594/254 causal constraints (skipped 195 transitions) in 36 ms.
[2022-05-19 10:22:12] [INFO ] Added : 32 causal constraints over 7 iterations in 343 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p1))
Stuttering acceptance computed with spot in 116 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 11938 reset in 271 ms.
Product exploration explored 100000 steps with 11950 reset in 267 ms.
Applying partial POR strategy [true, false, false]
Stuttering acceptance computed with spot in 112 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 4 out of 343 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 343/343 places, 459/459 transitions.
Performed 24 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 24 rules applied. Total rules applied 24 place count 343 transition count 459
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 1 Pre rules applied. Total rules applied 24 place count 343 transition count 460
Deduced a syphon composed of 25 places in 0 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 25 place count 343 transition count 460
Performed 26 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 51 places in 0 ms
Iterating global reduction 1 with 26 rules applied. Total rules applied 51 place count 343 transition count 460
Discarding 23 places :
Symmetric choice reduction at 1 with 23 rule applications. Total rules 74 place count 320 transition count 437
Deduced a syphon composed of 28 places in 0 ms
Iterating global reduction 1 with 23 rules applied. Total rules applied 97 place count 320 transition count 437
Deduced a syphon composed of 28 places in 0 ms
Applied a total of 97 rules in 115 ms. Remains 320 /343 variables (removed 23) and now considering 437/459 (removed 22) transitions.
[2022-05-19 10:22:14] [INFO ] Flow matrix only has 433 transitions (discarded 4 similar events)
// Phase 1: matrix 433 rows 320 cols
[2022-05-19 10:22:14] [INFO ] Computed 57 place invariants in 9 ms
[2022-05-19 10:22:14] [INFO ] Dead Transitions using invariants and state equation in 312 ms found 0 transitions.
[2022-05-19 10:22:14] [INFO ] Redundant transitions in 8 ms returned []
[2022-05-19 10:22:14] [INFO ] Flow matrix only has 433 transitions (discarded 4 similar events)
// Phase 1: matrix 433 rows 320 cols
[2022-05-19 10:22:14] [INFO ] Computed 57 place invariants in 5 ms
[2022-05-19 10:22:14] [INFO ] Dead Transitions using invariants and state equation in 250 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 320/343 places, 437/459 transitions.
Finished structural reductions, in 1 iterations. Remains : 320/343 places, 437/459 transitions.
Product exploration explored 100000 steps with 13406 reset in 850 ms.
Product exploration explored 100000 steps with 13405 reset in 785 ms.
Built C files in :
/tmp/ltsmin12696700460389116663
[2022-05-19 10:22:16] [INFO ] Built C files in 44ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12696700460389116663
Running compilation step : cd /tmp/ltsmin12696700460389116663;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 901 ms.
Running link step : cd /tmp/ltsmin12696700460389116663;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 42 ms.
Running LTSmin : cd /tmp/ltsmin12696700460389116663;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased17847333819975289185.hoa' '--buchi-type=spotba'
LTSmin run took 166 ms.
FORMULA PolyORBNT-PT-S05J20-LTLCardinality-12 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property PolyORBNT-PT-S05J20-LTLCardinality-12 finished in 33684 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((G((F(p0) U G(!F(X(p1)))))||X(p2)))'
Support contains 6 out of 344 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 344/344 places, 460/460 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 343 transition count 459
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 343 transition count 459
Applied a total of 2 rules in 19 ms. Remains 343 /344 variables (removed 1) and now considering 459/460 (removed 1) transitions.
[2022-05-19 10:22:17] [INFO ] Flow matrix only has 455 transitions (discarded 4 similar events)
// Phase 1: matrix 455 rows 343 cols
[2022-05-19 10:22:17] [INFO ] Computed 57 place invariants in 7 ms
[2022-05-19 10:22:17] [INFO ] Dead Transitions using invariants and state equation in 391 ms found 0 transitions.
[2022-05-19 10:22:17] [INFO ] Flow matrix only has 455 transitions (discarded 4 similar events)
// Phase 1: matrix 455 rows 343 cols
[2022-05-19 10:22:17] [INFO ] Computed 57 place invariants in 5 ms
[2022-05-19 10:22:18] [INFO ] Implicit Places using invariants in 282 ms returned []
[2022-05-19 10:22:18] [INFO ] Flow matrix only has 455 transitions (discarded 4 similar events)
// Phase 1: matrix 455 rows 343 cols
[2022-05-19 10:22:18] [INFO ] Computed 57 place invariants in 8 ms
[2022-05-19 10:22:18] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-19 10:22:20] [INFO ] Implicit Places using invariants and state equation in 2209 ms returned []
Implicit Place search using SMT with State Equation took 2494 ms to find 0 implicit places.
[2022-05-19 10:22:20] [INFO ] Flow matrix only has 455 transitions (discarded 4 similar events)
// Phase 1: matrix 455 rows 343 cols
[2022-05-19 10:22:20] [INFO ] Computed 57 place invariants in 4 ms
[2022-05-19 10:22:20] [INFO ] Dead Transitions using invariants and state equation in 386 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 343/344 places, 459/460 transitions.
Finished structural reductions, in 1 iterations. Remains : 343/344 places, 459/460 transitions.
Stuttering acceptance computed with spot in 231 ms :[(AND p1 (NOT p2)), (AND (NOT p0) (NOT p2) p1), (AND p1 (NOT p2)), (NOT p0), (AND (NOT p0) p1), p1]
Running random walk in product with property : PolyORBNT-PT-S05J20-LTLCardinality-14 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}], [{ cond=(AND (NOT p0) (NOT p2) p1), acceptance={} source=1 dest: 3}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=2 dest: 4}, { cond=(NOT p2), acceptance={} source=2 dest: 5}], [{ cond=(NOT p0), acceptance={0} source=3 dest: 3}], [{ cond=(AND (NOT p0) p1), acceptance={} source=4 dest: 3}], [{ cond=(NOT p0), acceptance={} source=5 dest: 4}, { cond=(NOT p1), acceptance={} source=5 dest: 5}, { cond=p1, acceptance={0} source=5 dest: 5}]], initial=0, aps=[p0:(LEQ s231 s89), p2:(LEQ s315 s3), p1:(LEQ s158 s273)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Stuttering criterion allowed to conclude after 12 steps with 0 reset in 0 ms.
FORMULA PolyORBNT-PT-S05J20-LTLCardinality-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBNT-PT-S05J20-LTLCardinality-14 finished in 3554 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(!(false U X(X(p0)))))'
Support contains 2 out of 344 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 344/344 places, 460/460 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 343 transition count 459
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 343 transition count 459
Applied a total of 2 rules in 15 ms. Remains 343 /344 variables (removed 1) and now considering 459/460 (removed 1) transitions.
[2022-05-19 10:22:21] [INFO ] Flow matrix only has 455 transitions (discarded 4 similar events)
// Phase 1: matrix 455 rows 343 cols
[2022-05-19 10:22:21] [INFO ] Computed 57 place invariants in 7 ms
[2022-05-19 10:22:21] [INFO ] Dead Transitions using invariants and state equation in 364 ms found 0 transitions.
[2022-05-19 10:22:21] [INFO ] Flow matrix only has 455 transitions (discarded 4 similar events)
// Phase 1: matrix 455 rows 343 cols
[2022-05-19 10:22:21] [INFO ] Computed 57 place invariants in 4 ms
[2022-05-19 10:22:21] [INFO ] Implicit Places using invariants in 306 ms returned []
[2022-05-19 10:22:21] [INFO ] Flow matrix only has 455 transitions (discarded 4 similar events)
// Phase 1: matrix 455 rows 343 cols
[2022-05-19 10:22:21] [INFO ] Computed 57 place invariants in 4 ms
[2022-05-19 10:22:21] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-19 10:22:24] [INFO ] Implicit Places using invariants and state equation in 2450 ms returned []
Implicit Place search using SMT with State Equation took 2758 ms to find 0 implicit places.
[2022-05-19 10:22:24] [INFO ] Flow matrix only has 455 transitions (discarded 4 similar events)
// Phase 1: matrix 455 rows 343 cols
[2022-05-19 10:22:24] [INFO ] Computed 57 place invariants in 8 ms
[2022-05-19 10:22:24] [INFO ] Dead Transitions using invariants and state equation in 365 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 343/344 places, 459/460 transitions.
Finished structural reductions, in 1 iterations. Remains : 343/344 places, 459/460 transitions.
Stuttering acceptance computed with spot in 143 ms :[p0, p0, p0, p0, true]
Running random walk in product with property : PolyORBNT-PT-S05J20-LTLCardinality-15 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 4}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}], [{ cond=true, acceptance={0} source=4 dest: 4}]], initial=3, aps=[p0:(LEQ s216 s191)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 3 steps with 0 reset in 0 ms.
FORMULA PolyORBNT-PT-S05J20-LTLCardinality-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBNT-PT-S05J20-LTLCardinality-15 finished in 3668 ms.
All properties solved by simple procedures.
Total runtime 59801 ms.

BK_STOP 1652955744774

--------------------
content from stderr:

+ export LANG=C
+ LANG=C
+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution LTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ export PYTHONPATH=/usr/lib/python3.9/site-packages/
+ PYTHONPATH=/usr/lib/python3.9/site-packages/
+ export LD_LIBRARY_PATH=/usr/local/lib:
+ LD_LIBRARY_PATH=/usr/local/lib:
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202205111006.jar
+ VERSION=202205111006
+ echo 'Running Version 202205111006'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data @none -pnfolder /home/mcc/execution -examination LTLCardinality -spotpath /home/mcc/BenchKit/bin//..//ltlfilt -z3path /home/mcc/BenchKit/bin//..//z3/bin/z3 -yices2path /home/mcc/BenchKit/bin//..//yices/bin/yices -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=@none -Xss128m -Xms40m -Xmx8192m

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="PolyORBNT-PT-S05J20"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-4028"
echo " Executing tool itstools"
echo " Input is PolyORBNT-PT-S05J20, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r168-tall-165277017200811"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/PolyORBNT-PT-S05J20.tgz
mv PolyORBNT-PT-S05J20 execution
cd execution
if [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "UpperBounds" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] || [ "LTLCardinality" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLCardinality" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "LTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLCardinality.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' LTLCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLCardinality"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;