Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2024-input.r512-smll-171654407100187.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool ltsminxred
Input is PermAdmissibility-PT-20, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r512-smll-171654407100187
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.7M
-rw-r--r-- 1 mcc users 15K Apr 12 09:06 CTLCardinality.txt
-rw-r--r-- 1 mcc users 135K Apr 12 09:06 CTLCardinality.xml
-rw-r--r-- 1 mcc users 41K Apr 12 09:04 CTLFireability.txt
-rw-r--r-- 1 mcc users 207K Apr 12 09:04 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.3K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 4.7K Apr 23 07:42 LTLCardinality.txt
-rw-r--r-- 1 mcc users 29K Apr 23 07:42 LTLCardinality.xml
-rw-r--r-- 1 mcc users 20K Apr 23 07:42 LTLFireability.txt
-rw-r--r-- 1 mcc users 76K Apr 23 07:42 LTLFireability.xml
-rw-r--r-- 1 mcc users 20K Apr 12 09:13 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 171K Apr 12 09:13 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 100K Apr 12 09:12 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 504K Apr 12 09:12 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.1K Apr 23 07:42 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.9K Apr 23 07:42 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 3 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 336K May 18 16:43 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 PermAdmissibility-PT-20-LTLCardinality-00
FORMULA_NAME PermAdmissibility-PT-20-LTLCardinality-01
FORMULA_NAME PermAdmissibility-PT-20-LTLCardinality-02
FORMULA_NAME PermAdmissibility-PT-20-LTLCardinality-03
FORMULA_NAME PermAdmissibility-PT-20-LTLCardinality-04
FORMULA_NAME PermAdmissibility-PT-20-LTLCardinality-05
FORMULA_NAME PermAdmissibility-PT-20-LTLCardinality-06
FORMULA_NAME PermAdmissibility-PT-20-LTLCardinality-07
FORMULA_NAME PermAdmissibility-PT-20-LTLCardinality-08
FORMULA_NAME PermAdmissibility-PT-20-LTLCardinality-09
FORMULA_NAME PermAdmissibility-PT-20-LTLCardinality-10
FORMULA_NAME PermAdmissibility-PT-20-LTLCardinality-11
FORMULA_NAME PermAdmissibility-PT-20-LTLCardinality-12
FORMULA_NAME PermAdmissibility-PT-20-LTLCardinality-13
FORMULA_NAME PermAdmissibility-PT-20-LTLCardinality-14
FORMULA_NAME PermAdmissibility-PT-20-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1717256025309

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=PermAdmissibility-PT-20
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 15:33:47] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2024-06-01 15:33:47] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 15:33:47] [INFO ] Load time of PNML (sax parser for PT used): 170 ms
[2024-06-01 15:33:47] [INFO ] Transformed 168 places.
[2024-06-01 15:33:47] [INFO ] Transformed 592 transitions.
[2024-06-01 15:33:47] [INFO ] Parsed PT model containing 168 places and 592 transitions and 3456 arcs in 350 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 97 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 5 formulas.
FORMULA PermAdmissibility-PT-20-LTLCardinality-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PermAdmissibility-PT-20-LTLCardinality-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PermAdmissibility-PT-20-LTLCardinality-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PermAdmissibility-PT-20-LTLCardinality-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PermAdmissibility-PT-20-LTLCardinality-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 71 out of 168 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 168/168 places, 592/592 transitions.
Reduce places removed 39 places and 0 transitions.
Iterating post reduction 0 with 39 rules applied. Total rules applied 39 place count 129 transition count 592
Applied a total of 39 rules in 43 ms. Remains 129 /168 variables (removed 39) and now considering 592/592 (removed 0) transitions.
// Phase 1: matrix 592 rows 129 cols
[2024-06-01 15:33:47] [INFO ] Computed 19 invariants in 42 ms
[2024-06-01 15:33:48] [INFO ] Implicit Places using invariants in 548 ms returned []
[2024-06-01 15:33:48] [INFO ] Invariant cache hit.
[2024-06-01 15:33:48] [INFO ] Implicit Places using invariants and state equation in 515 ms returned []
Implicit Place search using SMT with State Equation took 1106 ms to find 0 implicit places.
Running 588 sub problems to find dead transitions.
[2024-06-01 15:33:49] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/103 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 588 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/103 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 588 unsolved
At refinement iteration 2 (OVERLAPS) 25/128 variables, 17/19 constraints. Problems are: Problem set: 0 solved, 588 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/128 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 588 unsolved
At refinement iteration 4 (OVERLAPS) 592/720 variables, 128/147 constraints. Problems are: Problem set: 0 solved, 588 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/720 variables, 0/147 constraints. Problems are: Problem set: 0 solved, 588 unsolved
At refinement iteration 6 (OVERLAPS) 1/721 variables, 1/148 constraints. Problems are: Problem set: 0 solved, 588 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/721 variables, 0/148 constraints. Problems are: Problem set: 0 solved, 588 unsolved
At refinement iteration 8 (OVERLAPS) 0/721 variables, 0/148 constraints. Problems are: Problem set: 0 solved, 588 unsolved
No progress, stopping.
After SMT solving in domain Real declared 721/721 variables, and 148 constraints, problems are : Problem set: 0 solved, 588 unsolved in 26387 ms.
Refiners :[Generalized P Invariants (flows): 19/19 constraints, State Equation: 129/129 constraints, PredecessorRefiner: 588/588 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 588 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/103 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 588 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/103 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 588 unsolved
At refinement iteration 2 (OVERLAPS) 25/128 variables, 17/19 constraints. Problems are: Problem set: 0 solved, 588 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/128 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 588 unsolved
At refinement iteration 4 (OVERLAPS) 592/720 variables, 128/147 constraints. Problems are: Problem set: 0 solved, 588 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/720 variables, 460/607 constraints. Problems are: Problem set: 0 solved, 588 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 720/721 variables, and 607 constraints, problems are : Problem set: 0 solved, 588 unsolved in 30058 ms.
Refiners :[Generalized P Invariants (flows): 19/19 constraints, State Equation: 128/129 constraints, PredecessorRefiner: 460/588 constraints, Known Traps: 0/0 constraints]
After SMT, in 58568ms problems are : Problem set: 0 solved, 588 unsolved
Search for dead transitions found 0 dead transitions in 58604ms
Starting structural reductions in LTL mode, iteration 1 : 129/168 places, 592/592 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 59813 ms. Remains : 129/168 places, 592/592 transitions.
Support contains 71 out of 129 places after structural reductions.
[2024-06-01 15:34:47] [INFO ] Flatten gal took : 140 ms
[2024-06-01 15:34:48] [INFO ] Flatten gal took : 80 ms
[2024-06-01 15:34:48] [INFO ] Input system was already deterministic with 592 transitions.
Support contains 70 out of 129 places (down from 71) after GAL structural reductions.
RANDOM walk for 7988 steps (22 resets) in 245 ms. (32 steps per ms) remains 0/20 properties
Computed a total of 129 stabilizing places and 592 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 129 transition count 592
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((!p0 U (p1 U (p1&&G(p2)))))))'
Support contains 12 out of 129 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 129/129 places, 592/592 transitions.
Reduce places removed 17 places and 0 transitions.
Iterating post reduction 0 with 17 rules applied. Total rules applied 17 place count 112 transition count 592
Discarding 20 places :
Symmetric choice reduction at 1 with 20 rule applications. Total rules 37 place count 92 transition count 356
Iterating global reduction 1 with 20 rules applied. Total rules applied 57 place count 92 transition count 356
Discarding 14 places :
Symmetric choice reduction at 1 with 14 rule applications. Total rules 71 place count 78 transition count 230
Iterating global reduction 1 with 14 rules applied. Total rules applied 85 place count 78 transition count 230
Applied a total of 85 rules in 45 ms. Remains 78 /129 variables (removed 51) and now considering 230/592 (removed 362) transitions.
// Phase 1: matrix 230 rows 78 cols
[2024-06-01 15:34:48] [INFO ] Computed 17 invariants in 13 ms
[2024-06-01 15:34:48] [INFO ] Implicit Places using invariants in 170 ms returned [0, 19, 33, 44]
[2024-06-01 15:34:48] [INFO ] Actually due to overlaps returned [0, 19, 33]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 174 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 75/129 places, 230/592 transitions.
Applied a total of 0 rules in 3 ms. Remains 75 /75 variables (removed 0) and now considering 230/230 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 224 ms. Remains : 75/129 places, 230/592 transitions.
Stuttering acceptance computed with spot in 518 ms :[(OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2)), true, (OR (NOT p1) (NOT p2)), (OR (NOT p2) (NOT p1)), (NOT p2), (NOT p2), (NOT p2)]
Running random walk in product with property : PermAdmissibility-PT-20-LTLCardinality-00
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 3 ms.
FORMULA PermAdmissibility-PT-20-LTLCardinality-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PermAdmissibility-PT-20-LTLCardinality-00 finished in 850 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((p0||G(F(p1))||G(p2)))))'
Support contains 19 out of 129 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 129/129 places, 592/592 transitions.
Reduce places removed 17 places and 0 transitions.
Iterating post reduction 0 with 17 rules applied. Total rules applied 17 place count 112 transition count 592
Discarding 14 places :
Symmetric choice reduction at 1 with 14 rule applications. Total rules 31 place count 98 transition count 368
Iterating global reduction 1 with 14 rules applied. Total rules applied 45 place count 98 transition count 368
Discarding 14 places :
Symmetric choice reduction at 1 with 14 rule applications. Total rules 59 place count 84 transition count 242
Iterating global reduction 1 with 14 rules applied. Total rules applied 73 place count 84 transition count 242
Applied a total of 73 rules in 19 ms. Remains 84 /129 variables (removed 45) and now considering 242/592 (removed 350) transitions.
// Phase 1: matrix 242 rows 84 cols
[2024-06-01 15:34:49] [INFO ] Computed 17 invariants in 4 ms
[2024-06-01 15:34:49] [INFO ] Implicit Places using invariants in 158 ms returned [0, 18, 39, 50]
[2024-06-01 15:34:49] [INFO ] Actually due to overlaps returned [0, 18, 39]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 160 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 81/129 places, 242/592 transitions.
Applied a total of 0 rules in 2 ms. Remains 81 /81 variables (removed 0) and now considering 242/242 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 182 ms. Remains : 81/129 places, 242/592 transitions.
Stuttering acceptance computed with spot in 242 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (NOT p1), (NOT p1), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : PermAdmissibility-PT-20-LTLCardinality-01
Product exploration explored 100000 steps with 33333 reset in 490 ms.
Product exploration explored 100000 steps with 33333 reset in 282 ms.
Computed a total of 81 stabilizing places and 242 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 81 transition count 242
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND p0 p1 (NOT p2)), (X (X (NOT p2))), (X (X (NOT (AND (NOT p0) p2)))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X p0)), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(X (X p1)), (X (X (NOT p1)))]
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 9 factoid took 22 ms. Reduced automaton from 6 states, 11 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA PermAdmissibility-PT-20-LTLCardinality-01 TRUE TECHNIQUES KNOWLEDGE
Treatment of property PermAdmissibility-PT-20-LTLCardinality-01 finished in 1484 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 8 out of 129 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 129/129 places, 592/592 transitions.
Graph (complete) has 1225 edges and 129 vertex of which 112 are kept as prefixes of interest. Removing 17 places using SCC suffix rule.7 ms
Discarding 17 places :
Also discarding 0 output transitions
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 21 place count 92 transition count 356
Iterating global reduction 0 with 20 rules applied. Total rules applied 41 place count 92 transition count 356
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 55 place count 78 transition count 230
Iterating global reduction 0 with 14 rules applied. Total rules applied 69 place count 78 transition count 230
Applied a total of 69 rules in 41 ms. Remains 78 /129 variables (removed 51) and now considering 230/592 (removed 362) transitions.
// Phase 1: matrix 230 rows 78 cols
[2024-06-01 15:34:51] [INFO ] Computed 17 invariants in 6 ms
[2024-06-01 15:34:51] [INFO ] Implicit Places using invariants in 153 ms returned [0, 19, 33, 44]
[2024-06-01 15:34:51] [INFO ] Actually due to overlaps returned [0, 19, 33]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 156 ms to find 3 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 75/129 places, 230/592 transitions.
Applied a total of 0 rules in 13 ms. Remains 75 /75 variables (removed 0) and now considering 230/230 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 210 ms. Remains : 75/129 places, 230/592 transitions.
Stuttering acceptance computed with spot in 41 ms :[(NOT p0)]
Running random walk in product with property : PermAdmissibility-PT-20-LTLCardinality-02
Product exploration explored 100000 steps with 311 reset in 817 ms.
Product exploration explored 100000 steps with 311 reset in 718 ms.
Computed a total of 75 stabilizing places and 230 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 75 transition count 230
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 98 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 33 ms :[(NOT p0)]
RANDOM walk for 1344 steps (0 resets) in 8 ms. (149 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 4 factoid took 119 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 34 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 34 ms :[(NOT p0)]
// Phase 1: matrix 230 rows 75 cols
[2024-06-01 15:34:53] [INFO ] Computed 14 invariants in 5 ms
[2024-06-01 15:34:53] [INFO ] [Real]Absence check using 0 positive and 14 generalized place invariants in 12 ms returned sat
[2024-06-01 15:34:53] [INFO ] [Real]Absence check using state equation in 79 ms returned sat
[2024-06-01 15:34:53] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 15:34:53] [INFO ] [Nat]Absence check using 0 positive and 14 generalized place invariants in 11 ms returned sat
[2024-06-01 15:34:53] [INFO ] [Nat]Absence check using state equation in 89 ms returned sat
[2024-06-01 15:34:53] [INFO ] Computed and/alt/rep : 28/176/28 causal constraints (skipped 198 transitions) in 40 ms.
[2024-06-01 15:34:53] [INFO ] Added : 24 causal constraints over 8 iterations in 218 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 8 out of 75 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 75/75 places, 230/230 transitions.
Applied a total of 0 rules in 11 ms. Remains 75 /75 variables (removed 0) and now considering 230/230 (removed 0) transitions.
[2024-06-01 15:34:54] [INFO ] Invariant cache hit.
[2024-06-01 15:34:54] [INFO ] Implicit Places using invariants in 107 ms returned [41]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 110 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 74/75 places, 230/230 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 74 transition count 229
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 73 transition count 229
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 2 place count 73 transition count 228
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 4 place count 72 transition count 228
Applied a total of 4 rules in 26 ms. Remains 72 /74 variables (removed 2) and now considering 228/230 (removed 2) transitions.
// Phase 1: matrix 228 rows 72 cols
[2024-06-01 15:34:54] [INFO ] Computed 13 invariants in 2 ms
[2024-06-01 15:34:54] [INFO ] Implicit Places using invariants in 177 ms returned []
[2024-06-01 15:34:54] [INFO ] Invariant cache hit.
[2024-06-01 15:34:54] [INFO ] Implicit Places using invariants and state equation in 259 ms returned []
Implicit Place search using SMT with State Equation took 440 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 72/75 places, 228/230 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 587 ms. Remains : 72/75 places, 228/230 transitions.
Computed a total of 72 stabilizing places and 228 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 72 transition count 228
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 90 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 36 ms :[(NOT p0)]
RANDOM walk for 1176 steps (0 resets) in 7 ms. (147 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 4 factoid took 120 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 35 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 33 ms :[(NOT p0)]
[2024-06-01 15:34:55] [INFO ] Invariant cache hit.
[2024-06-01 15:34:55] [INFO ] [Real]Absence check using 0 positive and 13 generalized place invariants in 10 ms returned sat
[2024-06-01 15:34:55] [INFO ] [Real]Absence check using state equation in 73 ms returned sat
[2024-06-01 15:34:55] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 15:34:55] [INFO ] [Nat]Absence check using 0 positive and 13 generalized place invariants in 10 ms returned sat
[2024-06-01 15:34:55] [INFO ] [Nat]Absence check using state equation in 72 ms returned sat
[2024-06-01 15:34:55] [INFO ] Computed and/alt/rep : 28/176/28 causal constraints (skipped 196 transitions) in 44 ms.
[2024-06-01 15:34:55] [INFO ] Added : 21 causal constraints over 6 iterations in 165 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 39 ms :[(NOT p0)]
Product exploration explored 100000 steps with 355 reset in 654 ms.
Product exploration explored 100000 steps with 355 reset in 680 ms.
Support contains 8 out of 72 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 72/72 places, 228/228 transitions.
Applied a total of 0 rules in 14 ms. Remains 72 /72 variables (removed 0) and now considering 228/228 (removed 0) transitions.
[2024-06-01 15:34:57] [INFO ] Invariant cache hit.
[2024-06-01 15:34:57] [INFO ] Implicit Places using invariants in 141 ms returned []
[2024-06-01 15:34:57] [INFO ] Invariant cache hit.
[2024-06-01 15:34:57] [INFO ] Implicit Places using invariants and state equation in 206 ms returned []
Implicit Place search using SMT with State Equation took 349 ms to find 0 implicit places.
[2024-06-01 15:34:57] [INFO ] Redundant transitions in 11 ms returned []
Running 224 sub problems to find dead transitions.
[2024-06-01 15:34:57] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/63 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 224 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/63 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 224 unsolved
At refinement iteration 2 (OVERLAPS) 9/72 variables, 10/13 constraints. Problems are: Problem set: 0 solved, 224 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/72 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 224 unsolved
At refinement iteration 4 (OVERLAPS) 228/300 variables, 72/85 constraints. Problems are: Problem set: 0 solved, 224 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/300 variables, 0/85 constraints. Problems are: Problem set: 0 solved, 224 unsolved
At refinement iteration 6 (OVERLAPS) 0/300 variables, 0/85 constraints. Problems are: Problem set: 0 solved, 224 unsolved
No progress, stopping.
After SMT solving in domain Real declared 300/300 variables, and 85 constraints, problems are : Problem set: 0 solved, 224 unsolved in 5605 ms.
Refiners :[Generalized P Invariants (flows): 13/13 constraints, State Equation: 72/72 constraints, PredecessorRefiner: 224/224 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 224 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/63 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 224 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/63 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 224 unsolved
At refinement iteration 2 (OVERLAPS) 9/72 variables, 10/13 constraints. Problems are: Problem set: 0 solved, 224 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/72 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 224 unsolved
At refinement iteration 4 (OVERLAPS) 228/300 variables, 72/85 constraints. Problems are: Problem set: 0 solved, 224 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/300 variables, 224/309 constraints. Problems are: Problem set: 0 solved, 224 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/300 variables, 0/309 constraints. Problems are: Problem set: 0 solved, 224 unsolved
At refinement iteration 7 (OVERLAPS) 0/300 variables, 0/309 constraints. Problems are: Problem set: 0 solved, 224 unsolved
No progress, stopping.
After SMT solving in domain Int declared 300/300 variables, and 309 constraints, problems are : Problem set: 0 solved, 224 unsolved in 25194 ms.
Refiners :[Generalized P Invariants (flows): 13/13 constraints, State Equation: 72/72 constraints, PredecessorRefiner: 224/224 constraints, Known Traps: 0/0 constraints]
After SMT, in 31271ms problems are : Problem set: 0 solved, 224 unsolved
Search for dead transitions found 0 dead transitions in 31275ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 31657 ms. Remains : 72/72 places, 228/228 transitions.
Treatment of property PermAdmissibility-PT-20-LTLCardinality-02 finished in 37832 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 10 out of 129 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 129/129 places, 592/592 transitions.
Graph (complete) has 1225 edges and 129 vertex of which 50 are kept as prefixes of interest. Removing 79 places using SCC suffix rule.3 ms
Discarding 79 places :
Also discarding 384 output transitions
Drop transitions (Output transitions of discarded places.) removed 384 transitions
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 8 place count 43 transition count 96
Iterating global reduction 0 with 7 rules applied. Total rules applied 15 place count 43 transition count 96
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 17 place count 41 transition count 82
Iterating global reduction 0 with 2 rules applied. Total rules applied 19 place count 41 transition count 82
Applied a total of 19 rules in 13 ms. Remains 41 /129 variables (removed 88) and now considering 82/592 (removed 510) transitions.
// Phase 1: matrix 82 rows 41 cols
[2024-06-01 15:35:28] [INFO ] Computed 10 invariants in 1 ms
[2024-06-01 15:35:28] [INFO ] Implicit Places using invariants in 93 ms returned [8]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 96 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 40/129 places, 82/592 transitions.
Applied a total of 0 rules in 4 ms. Remains 40 /40 variables (removed 0) and now considering 82/82 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 113 ms. Remains : 40/129 places, 82/592 transitions.
Stuttering acceptance computed with spot in 54 ms :[(NOT p0)]
Running random walk in product with property : PermAdmissibility-PT-20-LTLCardinality-03
Product exploration explored 100000 steps with 497 reset in 511 ms.
Product exploration explored 100000 steps with 497 reset in 539 ms.
Computed a total of 40 stabilizing places and 82 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 40 transition count 82
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 105 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 76 ms :[(NOT p0)]
RANDOM walk for 336 steps (0 resets) in 4 ms. (67 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 4 factoid took 113 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 33 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 33 ms :[(NOT p0)]
// Phase 1: matrix 82 rows 40 cols
[2024-06-01 15:35:30] [INFO ] Computed 9 invariants in 0 ms
[2024-06-01 15:35:30] [INFO ] [Real]Absence check using 0 positive and 9 generalized place invariants in 4 ms returned sat
[2024-06-01 15:35:30] [INFO ] [Real]Absence check using state equation in 30 ms returned sat
[2024-06-01 15:35:30] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 15:35:30] [INFO ] [Nat]Absence check using 0 positive and 9 generalized place invariants in 5 ms returned sat
[2024-06-01 15:35:30] [INFO ] [Nat]Absence check using state equation in 31 ms returned sat
[2024-06-01 15:35:30] [INFO ] Computed and/alt/rep : 28/176/28 causal constraints (skipped 50 transitions) in 8 ms.
[2024-06-01 15:35:30] [INFO ] Added : 15 causal constraints over 4 iterations in 49 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 10 out of 40 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 40/40 places, 82/82 transitions.
Applied a total of 0 rules in 3 ms. Remains 40 /40 variables (removed 0) and now considering 82/82 (removed 0) transitions.
[2024-06-01 15:35:30] [INFO ] Invariant cache hit.
[2024-06-01 15:35:30] [INFO ] Implicit Places using invariants in 59 ms returned []
[2024-06-01 15:35:30] [INFO ] Invariant cache hit.
[2024-06-01 15:35:31] [INFO ] Implicit Places using invariants and state equation in 88 ms returned []
Implicit Place search using SMT with State Equation took 156 ms to find 0 implicit places.
[2024-06-01 15:35:31] [INFO ] Redundant transitions in 2 ms returned []
Running 78 sub problems to find dead transitions.
[2024-06-01 15:35:31] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/39 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/39 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 2 (OVERLAPS) 1/40 variables, 4/9 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/40 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 4 (OVERLAPS) 82/122 variables, 40/49 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/122 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 6 (OVERLAPS) 0/122 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 78 unsolved
No progress, stopping.
After SMT solving in domain Real declared 122/122 variables, and 49 constraints, problems are : Problem set: 0 solved, 78 unsolved in 1315 ms.
Refiners :[Generalized P Invariants (flows): 9/9 constraints, State Equation: 40/40 constraints, PredecessorRefiner: 78/78 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 78 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/39 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/39 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 2 (OVERLAPS) 1/40 variables, 4/9 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/40 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 4 (OVERLAPS) 82/122 variables, 40/49 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/122 variables, 78/127 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/122 variables, 0/127 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 7 (OVERLAPS) 0/122 variables, 0/127 constraints. Problems are: Problem set: 0 solved, 78 unsolved
No progress, stopping.
After SMT solving in domain Int declared 122/122 variables, and 127 constraints, problems are : Problem set: 0 solved, 78 unsolved in 1950 ms.
Refiners :[Generalized P Invariants (flows): 9/9 constraints, State Equation: 40/40 constraints, PredecessorRefiner: 78/78 constraints, Known Traps: 0/0 constraints]
After SMT, in 3323ms problems are : Problem set: 0 solved, 78 unsolved
Search for dead transitions found 0 dead transitions in 3324ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 3490 ms. Remains : 40/40 places, 82/82 transitions.
Computed a total of 40 stabilizing places and 82 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 40 transition count 82
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 90 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 35 ms :[(NOT p0)]
RANDOM walk for 336 steps (0 resets) in 5 ms. (56 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 4 factoid took 115 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 34 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 34 ms :[(NOT p0)]
[2024-06-01 15:35:34] [INFO ] Invariant cache hit.
[2024-06-01 15:35:34] [INFO ] [Real]Absence check using 0 positive and 9 generalized place invariants in 3 ms returned sat
[2024-06-01 15:35:34] [INFO ] [Real]Absence check using state equation in 48 ms returned sat
[2024-06-01 15:35:34] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 15:35:34] [INFO ] [Nat]Absence check using 0 positive and 9 generalized place invariants in 6 ms returned sat
[2024-06-01 15:35:34] [INFO ] [Nat]Absence check using state equation in 30 ms returned sat
[2024-06-01 15:35:34] [INFO ] Computed and/alt/rep : 28/176/28 causal constraints (skipped 50 transitions) in 8 ms.
[2024-06-01 15:35:35] [INFO ] Added : 14 causal constraints over 4 iterations in 48 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 37 ms :[(NOT p0)]
Product exploration explored 100000 steps with 497 reset in 493 ms.
Product exploration explored 100000 steps with 497 reset in 516 ms.
Support contains 10 out of 40 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 40/40 places, 82/82 transitions.
Applied a total of 0 rules in 8 ms. Remains 40 /40 variables (removed 0) and now considering 82/82 (removed 0) transitions.
[2024-06-01 15:35:36] [INFO ] Invariant cache hit.
[2024-06-01 15:35:36] [INFO ] Implicit Places using invariants in 92 ms returned []
[2024-06-01 15:35:36] [INFO ] Invariant cache hit.
[2024-06-01 15:35:36] [INFO ] Implicit Places using invariants and state equation in 89 ms returned []
Implicit Place search using SMT with State Equation took 184 ms to find 0 implicit places.
[2024-06-01 15:35:36] [INFO ] Redundant transitions in 1 ms returned []
Running 78 sub problems to find dead transitions.
[2024-06-01 15:35:36] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/39 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/39 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 2 (OVERLAPS) 1/40 variables, 4/9 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/40 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 4 (OVERLAPS) 82/122 variables, 40/49 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/122 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 6 (OVERLAPS) 0/122 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 78 unsolved
No progress, stopping.
After SMT solving in domain Real declared 122/122 variables, and 49 constraints, problems are : Problem set: 0 solved, 78 unsolved in 1473 ms.
Refiners :[Generalized P Invariants (flows): 9/9 constraints, State Equation: 40/40 constraints, PredecessorRefiner: 78/78 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 78 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/39 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/39 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 2 (OVERLAPS) 1/40 variables, 4/9 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/40 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 4 (OVERLAPS) 82/122 variables, 40/49 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/122 variables, 78/127 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/122 variables, 0/127 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 7 (OVERLAPS) 0/122 variables, 0/127 constraints. Problems are: Problem set: 0 solved, 78 unsolved
No progress, stopping.
After SMT solving in domain Int declared 122/122 variables, and 127 constraints, problems are : Problem set: 0 solved, 78 unsolved in 2054 ms.
Refiners :[Generalized P Invariants (flows): 9/9 constraints, State Equation: 40/40 constraints, PredecessorRefiner: 78/78 constraints, Known Traps: 0/0 constraints]
After SMT, in 3577ms problems are : Problem set: 0 solved, 78 unsolved
Search for dead transitions found 0 dead transitions in 3578ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 3779 ms. Remains : 40/40 places, 82/82 transitions.
Treatment of property PermAdmissibility-PT-20-LTLCardinality-03 finished in 11067 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0)||X(p1)))'
Support contains 17 out of 129 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 129/129 places, 592/592 transitions.
Reduce places removed 17 places and 0 transitions.
Iterating post reduction 0 with 17 rules applied. Total rules applied 17 place count 112 transition count 592
Discarding 13 places :
Symmetric choice reduction at 1 with 13 rule applications. Total rules 30 place count 99 transition count 468
Iterating global reduction 1 with 13 rules applied. Total rules applied 43 place count 99 transition count 468
Applied a total of 43 rules in 6 ms. Remains 99 /129 variables (removed 30) and now considering 468/592 (removed 124) transitions.
// Phase 1: matrix 468 rows 99 cols
[2024-06-01 15:35:39] [INFO ] Computed 17 invariants in 5 ms
[2024-06-01 15:35:40] [INFO ] Implicit Places using invariants in 282 ms returned [26]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 285 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 98/129 places, 468/592 transitions.
Applied a total of 0 rules in 2 ms. Remains 98 /98 variables (removed 0) and now considering 468/468 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 294 ms. Remains : 98/129 places, 468/592 transitions.
Stuttering acceptance computed with spot in 181 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1)), (NOT p0)]
Running random walk in product with property : PermAdmissibility-PT-20-LTLCardinality-04
Entered a terminal (fully accepting) state of product in 39 steps with 0 reset in 0 ms.
FORMULA PermAdmissibility-PT-20-LTLCardinality-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PermAdmissibility-PT-20-LTLCardinality-04 finished in 495 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0||X(X(F((p1&&X(X(p2)))))))))'
Support contains 19 out of 129 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 129/129 places, 592/592 transitions.
Reduce places removed 17 places and 0 transitions.
Iterating post reduction 0 with 17 rules applied. Total rules applied 17 place count 112 transition count 592
Discarding 20 places :
Symmetric choice reduction at 1 with 20 rule applications. Total rules 37 place count 92 transition count 356
Iterating global reduction 1 with 20 rules applied. Total rules applied 57 place count 92 transition count 356
Discarding 14 places :
Symmetric choice reduction at 1 with 14 rule applications. Total rules 71 place count 78 transition count 230
Iterating global reduction 1 with 14 rules applied. Total rules applied 85 place count 78 transition count 230
Applied a total of 85 rules in 5 ms. Remains 78 /129 variables (removed 51) and now considering 230/592 (removed 362) transitions.
// Phase 1: matrix 230 rows 78 cols
[2024-06-01 15:35:40] [INFO ] Computed 17 invariants in 3 ms
[2024-06-01 15:35:40] [INFO ] Implicit Places using invariants in 112 ms returned [0, 18, 33, 44]
[2024-06-01 15:35:40] [INFO ] Actually due to overlaps returned [0, 18, 33]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 122 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 75/129 places, 230/592 transitions.
Applied a total of 0 rules in 1 ms. Remains 75 /75 variables (removed 0) and now considering 230/230 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 129 ms. Remains : 75/129 places, 230/592 transitions.
Stuttering acceptance computed with spot in 350 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (NOT p2), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (NOT p2), (NOT p2), (OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2))]
Running random walk in product with property : PermAdmissibility-PT-20-LTLCardinality-05
Stuttering criterion allowed to conclude after 320 steps with 0 reset in 3 ms.
FORMULA PermAdmissibility-PT-20-LTLCardinality-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PermAdmissibility-PT-20-LTLCardinality-05 finished in 501 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F(G(p1)))))'
Support contains 11 out of 129 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 129/129 places, 592/592 transitions.
Graph (complete) has 1225 edges and 129 vertex of which 94 are kept as prefixes of interest. Removing 35 places using SCC suffix rule.2 ms
Discarding 35 places :
Also discarding 128 output transitions
Drop transitions (Output transitions of discarded places.) removed 128 transitions
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 7 place count 88 transition count 368
Iterating global reduction 0 with 6 rules applied. Total rules applied 13 place count 88 transition count 368
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 25 place count 76 transition count 248
Iterating global reduction 0 with 12 rules applied. Total rules applied 37 place count 76 transition count 248
Applied a total of 37 rules in 16 ms. Remains 76 /129 variables (removed 53) and now considering 248/592 (removed 344) transitions.
// Phase 1: matrix 248 rows 76 cols
[2024-06-01 15:35:40] [INFO ] Computed 15 invariants in 2 ms
[2024-06-01 15:35:41] [INFO ] Implicit Places using invariants in 111 ms returned []
[2024-06-01 15:35:41] [INFO ] Invariant cache hit.
[2024-06-01 15:35:41] [INFO ] Implicit Places using invariants and state equation in 216 ms returned []
Implicit Place search using SMT with State Equation took 343 ms to find 0 implicit places.
[2024-06-01 15:35:41] [INFO ] Redundant transitions in 7 ms returned []
Running 244 sub problems to find dead transitions.
[2024-06-01 15:35:41] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/67 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 244 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/67 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 244 unsolved
At refinement iteration 2 (OVERLAPS) 9/76 variables, 10/15 constraints. Problems are: Problem set: 0 solved, 244 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/76 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 244 unsolved
At refinement iteration 4 (OVERLAPS) 248/324 variables, 76/91 constraints. Problems are: Problem set: 0 solved, 244 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/324 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 244 unsolved
At refinement iteration 6 (OVERLAPS) 0/324 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 244 unsolved
No progress, stopping.
After SMT solving in domain Real declared 324/324 variables, and 91 constraints, problems are : Problem set: 0 solved, 244 unsolved in 4256 ms.
Refiners :[Generalized P Invariants (flows): 15/15 constraints, State Equation: 76/76 constraints, PredecessorRefiner: 244/244 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 244 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/67 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 244 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/67 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 244 unsolved
At refinement iteration 2 (OVERLAPS) 9/76 variables, 10/15 constraints. Problems are: Problem set: 0 solved, 244 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/76 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 244 unsolved
At refinement iteration 4 (OVERLAPS) 248/324 variables, 76/91 constraints. Problems are: Problem set: 0 solved, 244 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/324 variables, 244/335 constraints. Problems are: Problem set: 0 solved, 244 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/324 variables, 0/335 constraints. Problems are: Problem set: 0 solved, 244 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 324/324 variables, and 335 constraints, problems are : Problem set: 0 solved, 244 unsolved in 30019 ms.
Refiners :[Generalized P Invariants (flows): 15/15 constraints, State Equation: 76/76 constraints, PredecessorRefiner: 244/244 constraints, Known Traps: 0/0 constraints]
After SMT, in 34647ms problems are : Problem set: 0 solved, 244 unsolved
Search for dead transitions found 0 dead transitions in 34652ms
Starting structural reductions in SI_LTL mode, iteration 1 : 76/129 places, 248/592 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 35031 ms. Remains : 76/129 places, 248/592 transitions.
Stuttering acceptance computed with spot in 113 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : PermAdmissibility-PT-20-LTLCardinality-06
Product exploration explored 100000 steps with 355 reset in 890 ms.
Product exploration explored 100000 steps with 355 reset in 865 ms.
Computed a total of 76 stabilizing places and 248 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 76 transition count 248
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND p0 (NOT p1)), (X p0), (X (NOT p1)), (X (X p0)), (X (X (NOT p1))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 164 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 111 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
RANDOM walk for 1096 steps (0 resets) in 6 ms. (156 steps per ms) remains 0/2 properties
Knowledge obtained : [(AND p0 (NOT p1)), (X p0), (X (NOT p1)), (X (X p0)), (X (X (NOT p1))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F p1), (F (NOT p0))]
Knowledge based reduction with 7 factoid took 245 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 109 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 109 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
[2024-06-01 15:36:18] [INFO ] Invariant cache hit.
[2024-06-01 15:36:18] [INFO ] [Real]Absence check using 0 positive and 15 generalized place invariants in 13 ms returned sat
[2024-06-01 15:36:18] [INFO ] [Real]Absence check using state equation in 87 ms returned sat
[2024-06-01 15:36:18] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 15:36:19] [INFO ] [Nat]Absence check using 0 positive and 15 generalized place invariants in 13 ms returned sat
[2024-06-01 15:36:19] [INFO ] [Nat]Absence check using state equation in 88 ms returned sat
[2024-06-01 15:36:19] [INFO ] Computed and/alt/rep : 28/176/28 causal constraints (skipped 216 transitions) in 39 ms.
[2024-06-01 15:36:19] [INFO ] Added : 19 causal constraints over 5 iterations in 225 ms. Result :sat
Could not prove EG (NOT p1)
Support contains 11 out of 76 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 76/76 places, 248/248 transitions.
Applied a total of 0 rules in 7 ms. Remains 76 /76 variables (removed 0) and now considering 248/248 (removed 0) transitions.
[2024-06-01 15:36:19] [INFO ] Invariant cache hit.
[2024-06-01 15:36:19] [INFO ] Implicit Places using invariants in 139 ms returned []
[2024-06-01 15:36:19] [INFO ] Invariant cache hit.
[2024-06-01 15:36:19] [INFO ] Implicit Places using invariants and state equation in 234 ms returned []
Implicit Place search using SMT with State Equation took 375 ms to find 0 implicit places.
[2024-06-01 15:36:19] [INFO ] Redundant transitions in 3 ms returned []
Running 244 sub problems to find dead transitions.
[2024-06-01 15:36:19] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/67 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 244 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/67 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 244 unsolved
At refinement iteration 2 (OVERLAPS) 9/76 variables, 10/15 constraints. Problems are: Problem set: 0 solved, 244 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/76 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 244 unsolved
At refinement iteration 4 (OVERLAPS) 248/324 variables, 76/91 constraints. Problems are: Problem set: 0 solved, 244 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/324 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 244 unsolved
At refinement iteration 6 (OVERLAPS) 0/324 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 244 unsolved
No progress, stopping.
After SMT solving in domain Real declared 324/324 variables, and 91 constraints, problems are : Problem set: 0 solved, 244 unsolved in 4071 ms.
Refiners :[Generalized P Invariants (flows): 15/15 constraints, State Equation: 76/76 constraints, PredecessorRefiner: 244/244 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 244 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/67 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 244 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/67 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 244 unsolved
At refinement iteration 2 (OVERLAPS) 9/76 variables, 10/15 constraints. Problems are: Problem set: 0 solved, 244 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/76 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 244 unsolved
At refinement iteration 4 (OVERLAPS) 248/324 variables, 76/91 constraints. Problems are: Problem set: 0 solved, 244 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/324 variables, 244/335 constraints. Problems are: Problem set: 0 solved, 244 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/324 variables, 0/335 constraints. Problems are: Problem set: 0 solved, 244 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 324/324 variables, and 335 constraints, problems are : Problem set: 0 solved, 244 unsolved in 30014 ms.
Refiners :[Generalized P Invariants (flows): 15/15 constraints, State Equation: 76/76 constraints, PredecessorRefiner: 244/244 constraints, Known Traps: 0/0 constraints]
After SMT, in 34451ms problems are : Problem set: 0 solved, 244 unsolved
Search for dead transitions found 0 dead transitions in 34454ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 34846 ms. Remains : 76/76 places, 248/248 transitions.
Computed a total of 76 stabilizing places and 248 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 76 transition count 248
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND p0 (NOT p1)), (X p0), (X (NOT p1)), (X (X p0)), (X (X (NOT p1))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 157 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 110 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
RANDOM walk for 1096 steps (0 resets) in 7 ms. (137 steps per ms) remains 0/2 properties
Knowledge obtained : [(AND p0 (NOT p1)), (X p0), (X (NOT p1)), (X (X p0)), (X (X (NOT p1))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F p1), (F (NOT p0))]
Knowledge based reduction with 7 factoid took 240 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 107 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 110 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
[2024-06-01 15:36:55] [INFO ] Invariant cache hit.
[2024-06-01 15:36:55] [INFO ] [Real]Absence check using 0 positive and 15 generalized place invariants in 12 ms returned sat
[2024-06-01 15:36:55] [INFO ] [Real]Absence check using state equation in 88 ms returned sat
[2024-06-01 15:36:55] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 15:36:55] [INFO ] [Nat]Absence check using 0 positive and 15 generalized place invariants in 13 ms returned sat
[2024-06-01 15:36:55] [INFO ] [Nat]Absence check using state equation in 87 ms returned sat
[2024-06-01 15:36:55] [INFO ] Computed and/alt/rep : 28/176/28 causal constraints (skipped 216 transitions) in 27 ms.
[2024-06-01 15:36:55] [INFO ] Added : 19 causal constraints over 5 iterations in 158 ms. Result :sat
Could not prove EG (NOT p1)
Stuttering acceptance computed with spot in 107 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Product exploration explored 100000 steps with 355 reset in 828 ms.
Product exploration explored 100000 steps with 355 reset in 865 ms.
Support contains 11 out of 76 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 76/76 places, 248/248 transitions.
Applied a total of 0 rules in 10 ms. Remains 76 /76 variables (removed 0) and now considering 248/248 (removed 0) transitions.
[2024-06-01 15:36:57] [INFO ] Invariant cache hit.
[2024-06-01 15:36:57] [INFO ] Implicit Places using invariants in 126 ms returned []
[2024-06-01 15:36:57] [INFO ] Invariant cache hit.
[2024-06-01 15:36:58] [INFO ] Implicit Places using invariants and state equation in 213 ms returned []
Implicit Place search using SMT with State Equation took 341 ms to find 0 implicit places.
[2024-06-01 15:36:58] [INFO ] Redundant transitions in 2 ms returned []
Running 244 sub problems to find dead transitions.
[2024-06-01 15:36:58] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/67 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 244 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/67 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 244 unsolved
At refinement iteration 2 (OVERLAPS) 9/76 variables, 10/15 constraints. Problems are: Problem set: 0 solved, 244 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/76 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 244 unsolved
At refinement iteration 4 (OVERLAPS) 248/324 variables, 76/91 constraints. Problems are: Problem set: 0 solved, 244 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/324 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 244 unsolved
At refinement iteration 6 (OVERLAPS) 0/324 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 244 unsolved
No progress, stopping.
After SMT solving in domain Real declared 324/324 variables, and 91 constraints, problems are : Problem set: 0 solved, 244 unsolved in 4172 ms.
Refiners :[Generalized P Invariants (flows): 15/15 constraints, State Equation: 76/76 constraints, PredecessorRefiner: 244/244 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 244 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/67 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 244 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/67 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 244 unsolved
At refinement iteration 2 (OVERLAPS) 9/76 variables, 10/15 constraints. Problems are: Problem set: 0 solved, 244 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/76 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 244 unsolved
At refinement iteration 4 (OVERLAPS) 248/324 variables, 76/91 constraints. Problems are: Problem set: 0 solved, 244 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/324 variables, 244/335 constraints. Problems are: Problem set: 0 solved, 244 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/324 variables, 0/335 constraints. Problems are: Problem set: 0 solved, 244 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 324/324 variables, and 335 constraints, problems are : Problem set: 0 solved, 244 unsolved in 30015 ms.
Refiners :[Generalized P Invariants (flows): 15/15 constraints, State Equation: 76/76 constraints, PredecessorRefiner: 244/244 constraints, Known Traps: 0/0 constraints]
After SMT, in 34526ms problems are : Problem set: 0 solved, 244 unsolved
Search for dead transitions found 0 dead transitions in 34529ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 34890 ms. Remains : 76/76 places, 248/248 transitions.
Treatment of property PermAdmissibility-PT-20-LTLCardinality-06 finished in 111698 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0)||X(X(F(p1)))))'
Support contains 2 out of 129 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 129/129 places, 592/592 transitions.
Reduce places removed 25 places and 0 transitions.
Iterating post reduction 0 with 25 rules applied. Total rules applied 25 place count 104 transition count 592
Discarding 26 places :
Symmetric choice reduction at 1 with 26 rule applications. Total rules 51 place count 78 transition count 344
Iterating global reduction 1 with 26 rules applied. Total rules applied 77 place count 78 transition count 344
Discarding 23 places :
Symmetric choice reduction at 1 with 23 rule applications. Total rules 100 place count 55 transition count 114
Iterating global reduction 1 with 23 rules applied. Total rules applied 123 place count 55 transition count 114
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 126 place count 52 transition count 90
Iterating global reduction 1 with 3 rules applied. Total rules applied 129 place count 52 transition count 90
Applied a total of 129 rules in 8 ms. Remains 52 /129 variables (removed 77) and now considering 90/592 (removed 502) transitions.
// Phase 1: matrix 90 rows 52 cols
[2024-06-01 15:37:32] [INFO ] Computed 16 invariants in 2 ms
[2024-06-01 15:37:32] [INFO ] Implicit Places using invariants in 92 ms returned [0, 5, 18, 26]
[2024-06-01 15:37:32] [INFO ] Actually due to overlaps returned [0, 5, 18]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 95 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 49/129 places, 90/592 transitions.
Applied a total of 0 rules in 1 ms. Remains 49 /49 variables (removed 0) and now considering 90/90 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 104 ms. Remains : 49/129 places, 90/592 transitions.
Stuttering acceptance computed with spot in 186 ms :[(NOT p1), (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : PermAdmissibility-PT-20-LTLCardinality-09
Product exploration explored 100000 steps with 33333 reset in 138 ms.
Product exploration explored 100000 steps with 33333 reset in 147 ms.
Computed a total of 49 stabilizing places and 90 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 49 transition count 90
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND p1 (NOT p0)), (X (NOT p0)), (X (X (NOT (AND p0 (NOT p1))))), (X (X p1)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT p0))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 8 factoid took 61 ms. Reduced automaton from 5 states, 8 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA PermAdmissibility-PT-20-LTLCardinality-09 TRUE TECHNIQUES KNOWLEDGE
Treatment of property PermAdmissibility-PT-20-LTLCardinality-09 finished in 709 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(p0))'
Support contains 2 out of 129 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 129/129 places, 592/592 transitions.
Reduce places removed 24 places and 0 transitions.
Iterating post reduction 0 with 24 rules applied. Total rules applied 24 place count 105 transition count 592
Discarding 25 places :
Symmetric choice reduction at 1 with 25 rule applications. Total rules 49 place count 80 transition count 346
Iterating global reduction 1 with 25 rules applied. Total rules applied 74 place count 80 transition count 346
Discarding 22 places :
Symmetric choice reduction at 1 with 22 rule applications. Total rules 96 place count 58 transition count 124
Iterating global reduction 1 with 22 rules applied. Total rules applied 118 place count 58 transition count 124
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 120 place count 56 transition count 108
Iterating global reduction 1 with 2 rules applied. Total rules applied 122 place count 56 transition count 108
Applied a total of 122 rules in 8 ms. Remains 56 /129 variables (removed 73) and now considering 108/592 (removed 484) transitions.
// Phase 1: matrix 108 rows 56 cols
[2024-06-01 15:37:33] [INFO ] Computed 16 invariants in 1 ms
[2024-06-01 15:37:33] [INFO ] Implicit Places using invariants in 105 ms returned [0, 7, 21, 28]
[2024-06-01 15:37:33] [INFO ] Actually due to overlaps returned [0, 7, 21]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 107 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 53/129 places, 108/592 transitions.
Applied a total of 0 rules in 1 ms. Remains 53 /53 variables (removed 0) and now considering 108/108 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 116 ms. Remains : 53/129 places, 108/592 transitions.
Stuttering acceptance computed with spot in 81 ms :[(NOT p0), (NOT p0), true]
Running random walk in product with property : PermAdmissibility-PT-20-LTLCardinality-10
Product exploration explored 100000 steps with 50000 reset in 249 ms.
Product exploration explored 100000 steps with 50000 reset in 305 ms.
Computed a total of 53 stabilizing places and 108 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 53 transition count 108
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [p0, (X p0), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 3 factoid took 14 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA PermAdmissibility-PT-20-LTLCardinality-10 TRUE TECHNIQUES KNOWLEDGE
Treatment of property PermAdmissibility-PT-20-LTLCardinality-10 finished in 837 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F(p0))))'
Support contains 2 out of 129 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 129/129 places, 592/592 transitions.
Reduce places removed 24 places and 0 transitions.
Iterating post reduction 0 with 24 rules applied. Total rules applied 24 place count 105 transition count 592
Discarding 25 places :
Symmetric choice reduction at 1 with 25 rule applications. Total rules 49 place count 80 transition count 348
Iterating global reduction 1 with 25 rules applied. Total rules applied 74 place count 80 transition count 348
Discarding 22 places :
Symmetric choice reduction at 1 with 22 rule applications. Total rules 96 place count 58 transition count 118
Iterating global reduction 1 with 22 rules applied. Total rules applied 118 place count 58 transition count 118
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 120 place count 56 transition count 102
Iterating global reduction 1 with 2 rules applied. Total rules applied 122 place count 56 transition count 102
Applied a total of 122 rules in 6 ms. Remains 56 /129 variables (removed 73) and now considering 102/592 (removed 490) transitions.
// Phase 1: matrix 102 rows 56 cols
[2024-06-01 15:37:34] [INFO ] Computed 16 invariants in 1 ms
[2024-06-01 15:37:34] [INFO ] Implicit Places using invariants in 86 ms returned [0]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 87 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 55/129 places, 102/592 transitions.
Applied a total of 0 rules in 1 ms. Remains 55 /55 variables (removed 0) and now considering 102/102 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 94 ms. Remains : 55/129 places, 102/592 transitions.
Stuttering acceptance computed with spot in 107 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : PermAdmissibility-PT-20-LTLCardinality-11
Stuttering criterion allowed to conclude after 22814 steps with 179 reset in 133 ms.
FORMULA PermAdmissibility-PT-20-LTLCardinality-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PermAdmissibility-PT-20-LTLCardinality-11 finished in 346 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G(p0))))'
Support contains 1 out of 129 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 129/129 places, 592/592 transitions.
Reduce places removed 25 places and 0 transitions.
Iterating post reduction 0 with 25 rules applied. Total rules applied 25 place count 104 transition count 592
Discarding 26 places :
Symmetric choice reduction at 1 with 26 rule applications. Total rules 51 place count 78 transition count 344
Iterating global reduction 1 with 26 rules applied. Total rules applied 77 place count 78 transition count 344
Discarding 24 places :
Symmetric choice reduction at 1 with 24 rule applications. Total rules 101 place count 54 transition count 108
Iterating global reduction 1 with 24 rules applied. Total rules applied 125 place count 54 transition count 108
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 127 place count 52 transition count 92
Iterating global reduction 1 with 2 rules applied. Total rules applied 129 place count 52 transition count 92
Applied a total of 129 rules in 6 ms. Remains 52 /129 variables (removed 77) and now considering 92/592 (removed 500) transitions.
// Phase 1: matrix 92 rows 52 cols
[2024-06-01 15:37:34] [INFO ] Computed 16 invariants in 1 ms
[2024-06-01 15:37:34] [INFO ] Implicit Places using invariants in 79 ms returned [0, 5, 19, 26]
[2024-06-01 15:37:34] [INFO ] Actually due to overlaps returned [0, 5, 19]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 91 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 49/129 places, 92/592 transitions.
Applied a total of 0 rules in 2 ms. Remains 49 /49 variables (removed 0) and now considering 92/92 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 99 ms. Remains : 49/129 places, 92/592 transitions.
Stuttering acceptance computed with spot in 113 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : PermAdmissibility-PT-20-LTLCardinality-14
Entered a terminal (fully accepting) state of product in 15 steps with 0 reset in 0 ms.
FORMULA PermAdmissibility-PT-20-LTLCardinality-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PermAdmissibility-PT-20-LTLCardinality-14 finished in 225 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F(G(p1)))))'
[2024-06-01 15:37:35] [INFO ] Flatten gal took : 59 ms
[2024-06-01 15:37:35] [INFO ] Export to MCC of 3 properties in file /home/mcc/execution/LTLCardinality.sr.xml took 3 ms.
[2024-06-01 15:37:35] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 129 places, 592 transitions and 3144 arcs took 12 ms.
Total runtime 228274 ms.
There are residual formulas that ITS could not solve within timeout
Could not compute solution for formula : PermAdmissibility-PT-20-LTLCardinality-02
Could not compute solution for formula : PermAdmissibility-PT-20-LTLCardinality-03
Could not compute solution for formula : PermAdmissibility-PT-20-LTLCardinality-06

BK_STOP 1717256623759

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLCardinality -timeout 360 -rebuildPNML
mcc2024
ltl formula name PermAdmissibility-PT-20-LTLCardinality-02
ltl formula formula --ltl=/tmp/1220/ltl_0_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 129 places, 592 transitions and 3144 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.070 real 0.030 user 0.020 sys
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1220/ltl_0_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1220/ltl_0_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1220/ltl_0_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1220/ltl_0_
pnml2lts-mc( 0/ 4): buchi has 2 states
pnml2lts-mc( 0/ 4): There are 105 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 130, there are 596 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 2/ 4): ~321 levels ~10000 states ~19268 transitions
pnml2lts-mc( 2/ 4): ~321 levels ~20000 states ~37992 transitions
pnml2lts-mc( 2/ 4): ~321 levels ~40000 states ~99856 transitions
pnml2lts-mc( 2/ 4): ~321 levels ~80000 states ~232444 transitions
pnml2lts-mc( 2/ 4): ~321 levels ~160000 states ~481496 transitions
pnml2lts-mc( 2/ 4): ~321 levels ~320000 states ~1192444 transitions
pnml2lts-mc( 2/ 4): ~321 levels ~640000 states ~2497900 transitions
pnml2lts-mc( 2/ 4): ~321 levels ~1280000 states ~4991212 transitions
pnml2lts-mc( 1/ 4): ~321 levels ~2560000 states ~11778436 transitions
pnml2lts-mc( 2/ 4): ~321 levels ~5120000 states ~21805512 transitions
pnml2lts-mc( 2/ 4): ~321 levels ~10240000 states ~41701192 transitions
pnml2lts-mc( 1/ 4): Error: tree leafs table full! Change -s/--ratio.
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 13667973
pnml2lts-mc( 0/ 4): unique states count: 13669228
pnml2lts-mc( 0/ 4): unique transitions count: 75318134
pnml2lts-mc( 0/ 4): - self-loop count: 5508
pnml2lts-mc( 0/ 4): - claim dead count: 61636157
pnml2lts-mc( 0/ 4): - claim found count: 0
pnml2lts-mc( 0/ 4): - claim success count: 13669232
pnml2lts-mc( 0/ 4): - cum. max stack depth: 1284
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 13669232 states 75318155 transitions, fanout: 5.510
pnml2lts-mc( 0/ 4): Total exploration time 138.560 sec (138.520 sec minimum, 138.540 sec on average)
pnml2lts-mc( 0/ 4): States per second: 98652, Transitions per second: 543578
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 168.3MB, 12.9 B/state, compr.: 2.5%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 40.0%/99.0%
pnml2lts-mc( 0/ 4): Stored 604 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 168.3MB (~256.0MB paged-in)
ltl formula name PermAdmissibility-PT-20-LTLCardinality-03
ltl formula formula --ltl=/tmp/1220/ltl_1_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 129 places, 592 transitions and 3144 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.070 real 0.030 user 0.020 sys
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1220/ltl_1_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1220/ltl_1_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1220/ltl_1_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1220/ltl_1_
pnml2lts-mc( 0/ 4): buchi has 2 states
pnml2lts-mc( 0/ 4): There are 105 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 130, there are 596 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 2/ 4): ~321 levels ~10000 states ~32700 transitions
pnml2lts-mc( 2/ 4): ~321 levels ~20000 states ~61988 transitions
pnml2lts-mc( 2/ 4): ~321 levels ~40000 states ~145968 transitions
pnml2lts-mc( 2/ 4): ~321 levels ~80000 states ~297912 transitions
pnml2lts-mc( 2/ 4): ~321 levels ~160000 states ~591444 transitions
pnml2lts-mc( 2/ 4): ~321 levels ~320000 states ~1212360 transitions
pnml2lts-mc( 1/ 4): ~321 levels ~640000 states ~2281816 transitions
pnml2lts-mc( 1/ 4): ~321 levels ~1280000 states ~4590348 transitions
pnml2lts-mc( 1/ 4): ~321 levels ~2560000 states ~9165792 transitions
pnml2lts-mc( 1/ 4): ~321 levels ~5120000 states ~18550104 transitions
pnml2lts-mc( 2/ 4): ~321 levels ~10240000 states ~40158388 transitions
pnml2lts-mc( 0/ 4): Error: tree leafs table full! Change -s/--ratio.
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 9530014
pnml2lts-mc( 0/ 4): unique states count: 9531260
pnml2lts-mc( 0/ 4): unique transitions count: 61535890
pnml2lts-mc( 0/ 4): - self-loop count: 6248
pnml2lts-mc( 0/ 4): - claim dead count: 51987998
pnml2lts-mc( 0/ 4): - claim found count: 0
pnml2lts-mc( 0/ 4): - claim success count: 9531265
pnml2lts-mc( 0/ 4): - cum. max stack depth: 1284
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 9531265 states 61535918 transitions, fanout: 6.456
pnml2lts-mc( 0/ 4): Total exploration time 98.750 sec (98.730 sec minimum, 98.740 sec on average)
pnml2lts-mc( 0/ 4): States per second: 96519, Transitions per second: 623149
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 136.8MB, 15.0 B/state, compr.: 2.9%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 28.0%/99.0%
pnml2lts-mc( 0/ 4): Stored 604 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 136.8MB (~256.0MB paged-in)
ltl formula name PermAdmissibility-PT-20-LTLCardinality-06
ltl formula formula --ltl=/tmp/1220/ltl_2_
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 129 places, 592 transitions and 3144 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.070 real 0.030 user 0.020 sys
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1220/ltl_2_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1220/ltl_2_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1220/ltl_2_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1220/ltl_2_
pnml2lts-mc( 0/ 4): buchi has 4 states
pnml2lts-mc( 0/ 4): There are 105 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 130, there are 600 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 3/ 4): ~321 levels ~10000 states ~20416 transitions
pnml2lts-mc( 3/ 4): ~321 levels ~20000 states ~39116 transitions
pnml2lts-mc( 3/ 4): ~321 levels ~40000 states ~104148 transitions
pnml2lts-mc( 3/ 4): ~321 levels ~80000 states ~233296 transitions
pnml2lts-mc( 3/ 4): ~321 levels ~160000 states ~485212 transitions
pnml2lts-mc( 3/ 4): ~321 levels ~320000 states ~1197648 transitions
pnml2lts-mc( 3/ 4): ~321 levels ~640000 states ~2379604 transitions
pnml2lts-mc( 3/ 4): ~321 levels ~1280000 states ~4771756 transitions
pnml2lts-mc( 3/ 4): ~321 levels ~2560000 states ~9710348 transitions
pnml2lts-mc( 3/ 4): ~321 levels ~5120000 states ~19639524 transitions
pnml2lts-mc( 3/ 4): ~321 levels ~10240000 states ~38115932 transitions
pnml2lts-mc( 2/ 4): Error: tree leafs table full! Change -s/--ratio.
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 12833535
pnml2lts-mc( 0/ 4): unique states count: 12834766
pnml2lts-mc( 0/ 4): unique transitions count: 67669926
pnml2lts-mc( 0/ 4): - self-loop count: 4994
pnml2lts-mc( 0/ 4): - claim dead count: 54824059
pnml2lts-mc( 0/ 4): - claim found count: 0
pnml2lts-mc( 0/ 4): - claim success count: 12834770
pnml2lts-mc( 0/ 4): - cum. max stack depth: 1284
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 12834770 states 67669957 transitions, fanout: 5.272
pnml2lts-mc( 0/ 4): Total exploration time 128.830 sec (128.750 sec minimum, 128.780 sec on average)
pnml2lts-mc( 0/ 4): States per second: 99626, Transitions per second: 525266
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 162.0MB, 13.2 B/state, compr.: 2.5%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 38.0%/99.0%
pnml2lts-mc( 0/ 4): Stored 604 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 162.0MB (~256.0MB paged-in)

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="PermAdmissibility-PT-20"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="ltsminxred"
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-5568"
echo " Executing tool ltsminxred"
echo " Input is PermAdmissibility-PT-20, 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 r512-smll-171654407100187"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/PermAdmissibility-PT-20.tgz
mv PermAdmissibility-PT-20 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 ;