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.r069-tall-171620503600004.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 greatspnxred
Input is CANConstruction-PT-005, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r069-tall-171620503600004
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 696K
-rw-r--r-- 1 mcc users 13K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 121K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.5K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 49K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.5K Apr 22 14:31 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Apr 22 14:31 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.8K Apr 22 14:31 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 22 14:31 LTLFireability.xml
-rw-r--r-- 1 mcc users 17K Apr 12 18:15 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 148K Apr 12 18:15 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Apr 12 18:14 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 68K Apr 12 18:14 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.9K Apr 22 14:31 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K Apr 22 14:31 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 4 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 167K May 18 16:42 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 CANConstruction-PT-005-LTLFireability-00
FORMULA_NAME CANConstruction-PT-005-LTLFireability-01
FORMULA_NAME CANConstruction-PT-005-LTLFireability-02
FORMULA_NAME CANConstruction-PT-005-LTLFireability-03
FORMULA_NAME CANConstruction-PT-005-LTLFireability-04
FORMULA_NAME CANConstruction-PT-005-LTLFireability-05
FORMULA_NAME CANConstruction-PT-005-LTLFireability-06
FORMULA_NAME CANConstruction-PT-005-LTLFireability-07
FORMULA_NAME CANConstruction-PT-005-LTLFireability-08
FORMULA_NAME CANConstruction-PT-005-LTLFireability-09
FORMULA_NAME CANConstruction-PT-005-LTLFireability-10
FORMULA_NAME CANConstruction-PT-005-LTLFireability-11
FORMULA_NAME CANConstruction-PT-005-LTLFireability-12
FORMULA_NAME CANConstruction-PT-005-LTLFireability-13
FORMULA_NAME CANConstruction-PT-005-LTLFireability-14
FORMULA_NAME CANConstruction-PT-005-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1716361399171

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=CANConstruction-PT-005
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-22 07:03:20] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2024-05-22 07:03:20] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-22 07:03:20] [INFO ] Load time of PNML (sax parser for PT used): 88 ms
[2024-05-22 07:03:20] [INFO ] Transformed 112 places.
[2024-05-22 07:03:20] [INFO ] Transformed 140 transitions.
[2024-05-22 07:03:20] [INFO ] Parsed PT model containing 112 places and 140 transitions and 400 arcs in 207 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 11 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 4 formulas.
FORMULA CANConstruction-PT-005-LTLFireability-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CANConstruction-PT-005-LTLFireability-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CANConstruction-PT-005-LTLFireability-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CANConstruction-PT-005-LTLFireability-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 35 out of 112 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 112/112 places, 140/140 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 105 transition count 126
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 105 transition count 126
Applied a total of 14 rules in 43 ms. Remains 105 /112 variables (removed 7) and now considering 126/140 (removed 14) transitions.
// Phase 1: matrix 126 rows 105 cols
[2024-05-22 07:03:20] [INFO ] Computed 11 invariants in 8 ms
[2024-05-22 07:03:21] [INFO ] Implicit Places using invariants in 283 ms returned [40]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 364 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 104/112 places, 126/140 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 103 transition count 125
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 103 transition count 125
Applied a total of 2 rules in 8 ms. Remains 103 /104 variables (removed 1) and now considering 125/126 (removed 1) transitions.
// Phase 1: matrix 125 rows 103 cols
[2024-05-22 07:03:21] [INFO ] Computed 10 invariants in 4 ms
[2024-05-22 07:03:21] [INFO ] Implicit Places using invariants in 113 ms returned []
[2024-05-22 07:03:21] [INFO ] Invariant cache hit.
[2024-05-22 07:03:21] [INFO ] State equation strengthened by 45 read => feed constraints.
[2024-05-22 07:03:21] [INFO ] Implicit Places using invariants and state equation in 159 ms returned []
Implicit Place search using SMT with State Equation took 278 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 103/112 places, 125/140 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 716 ms. Remains : 103/112 places, 125/140 transitions.
Support contains 35 out of 103 places after structural reductions.
[2024-05-22 07:03:21] [INFO ] Flatten gal took : 32 ms
[2024-05-22 07:03:21] [INFO ] Flatten gal took : 14 ms
[2024-05-22 07:03:21] [INFO ] Input system was already deterministic with 125 transitions.
RANDOM walk for 40000 steps (534 resets) in 943 ms. (42 steps per ms) remains 1/24 properties
BEST_FIRST walk for 40002 steps (133 resets) in 104 ms. (380 steps per ms) remains 1/1 properties
[2024-05-22 07:03:22] [INFO ] Invariant cache hit.
[2024-05-22 07:03:22] [INFO ] State equation strengthened by 45 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Problem AtomicPropp13 is UNSAT
After SMT solving in domain Real declared 96/228 variables, and 4 constraints, problems are : Problem set: 1 solved, 0 unsolved in 131 ms.
Refiners :[Positive P Invariants (semi-flows): 4/6 constraints, Generalized P Invariants (flows): 0/4 constraints, State Equation: 0/103 constraints, ReadFeed: 0/45 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 165ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Successfully simplified 1 atomic propositions for a total of 12 simplifications.
FORMULA CANConstruction-PT-005-LTLFireability-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 20 stabilizing places and 24 stable transitions
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(F(p0)))'
Support contains 3 out of 103 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 103/103 places, 125/125 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 95 transition count 109
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 95 transition count 109
Applied a total of 16 rules in 16 ms. Remains 95 /103 variables (removed 8) and now considering 109/125 (removed 16) transitions.
// Phase 1: matrix 109 rows 95 cols
[2024-05-22 07:03:22] [INFO ] Computed 10 invariants in 9 ms
[2024-05-22 07:03:22] [INFO ] Implicit Places using invariants in 65 ms returned [12, 26, 52, 66]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 66 ms to find 4 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 91/103 places, 109/125 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 87 transition count 105
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 87 transition count 105
Applied a total of 8 rules in 5 ms. Remains 87 /91 variables (removed 4) and now considering 105/109 (removed 4) transitions.
// Phase 1: matrix 105 rows 87 cols
[2024-05-22 07:03:22] [INFO ] Computed 6 invariants in 1 ms
[2024-05-22 07:03:22] [INFO ] Implicit Places using invariants in 87 ms returned []
[2024-05-22 07:03:22] [INFO ] Invariant cache hit.
[2024-05-22 07:03:23] [INFO ] State equation strengthened by 45 read => feed constraints.
[2024-05-22 07:03:23] [INFO ] Implicit Places using invariants and state equation in 157 ms returned []
Implicit Place search using SMT with State Equation took 269 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 87/103 places, 105/125 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 356 ms. Remains : 87/103 places, 105/125 transitions.
Stuttering acceptance computed with spot in 230 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : CANConstruction-PT-005-LTLFireability-00
Product exploration explored 100000 steps with 50000 reset in 204 ms.
Product exploration explored 100000 steps with 50000 reset in 184 ms.
Computed a total of 16 stabilizing places and 20 stable transitions
Computed a total of 16 stabilizing places and 20 stable transitions
Knowledge obtained : [p0, (X p0)]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0))]
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 2 factoid took 23 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA CANConstruction-PT-005-LTLFireability-00 TRUE TECHNIQUES KNOWLEDGE
Treatment of property CANConstruction-PT-005-LTLFireability-00 finished in 1094 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 2 out of 103 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 103/103 places, 125/125 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 29 transitions
Trivial Post-agglo rules discarded 29 transitions
Performed 29 trivial Post agglomeration. Transition count delta: 29
Iterating post reduction 0 with 29 rules applied. Total rules applied 29 place count 103 transition count 96
Reduce places removed 29 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 30 rules applied. Total rules applied 59 place count 74 transition count 95
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 60 place count 73 transition count 95
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 60 place count 73 transition count 94
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 62 place count 72 transition count 94
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 70 place count 64 transition count 78
Iterating global reduction 3 with 8 rules applied. Total rules applied 78 place count 64 transition count 78
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 3 with 1 rules applied. Total rules applied 79 place count 64 transition count 77
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 80 place count 63 transition count 77
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 5 with 8 rules applied. Total rules applied 88 place count 59 transition count 73
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: -10
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 5 with 10 rules applied. Total rules applied 98 place count 54 transition count 83
Applied a total of 98 rules in 32 ms. Remains 54 /103 variables (removed 49) and now considering 83/125 (removed 42) transitions.
// Phase 1: matrix 83 rows 54 cols
[2024-05-22 07:03:23] [INFO ] Computed 10 invariants in 1 ms
[2024-05-22 07:03:23] [INFO ] Implicit Places using invariants in 55 ms returned [6, 13, 24, 31]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 57 ms to find 4 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 50/103 places, 83/125 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 46 transition count 79
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 46 transition count 79
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 42 transition count 75
Applied a total of 16 rules in 6 ms. Remains 42 /50 variables (removed 8) and now considering 75/83 (removed 8) transitions.
// Phase 1: matrix 75 rows 42 cols
[2024-05-22 07:03:23] [INFO ] Computed 6 invariants in 1 ms
[2024-05-22 07:03:23] [INFO ] Implicit Places using invariants in 41 ms returned []
[2024-05-22 07:03:23] [INFO ] Invariant cache hit.
[2024-05-22 07:03:23] [INFO ] State equation strengthened by 65 read => feed constraints.
[2024-05-22 07:03:24] [INFO ] Implicit Places using invariants and state equation in 75 ms returned []
Implicit Place search using SMT with State Equation took 119 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 42/103 places, 75/125 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 214 ms. Remains : 42/103 places, 75/125 transitions.
Stuttering acceptance computed with spot in 38 ms :[(NOT p0)]
Running random walk in product with property : CANConstruction-PT-005-LTLFireability-01
Stuttering criterion allowed to conclude after 24 steps with 0 reset in 1 ms.
FORMULA CANConstruction-PT-005-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANConstruction-PT-005-LTLFireability-01 finished in 268 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(p0)||X((G(p2)||X((p3 U p4))||p1))))'
Support contains 10 out of 103 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 103/103 places, 125/125 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 95 transition count 109
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 95 transition count 109
Applied a total of 16 rules in 4 ms. Remains 95 /103 variables (removed 8) and now considering 109/125 (removed 16) transitions.
// Phase 1: matrix 109 rows 95 cols
[2024-05-22 07:03:24] [INFO ] Computed 10 invariants in 0 ms
[2024-05-22 07:03:24] [INFO ] Implicit Places using invariants in 52 ms returned [12, 66]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 54 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 93/103 places, 109/125 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 91 transition count 107
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 91 transition count 107
Applied a total of 4 rules in 4 ms. Remains 91 /93 variables (removed 2) and now considering 107/109 (removed 2) transitions.
// Phase 1: matrix 107 rows 91 cols
[2024-05-22 07:03:24] [INFO ] Computed 8 invariants in 1 ms
[2024-05-22 07:03:24] [INFO ] Implicit Places using invariants in 42 ms returned []
[2024-05-22 07:03:24] [INFO ] Invariant cache hit.
[2024-05-22 07:03:24] [INFO ] State equation strengthened by 45 read => feed constraints.
[2024-05-22 07:03:24] [INFO ] Implicit Places using invariants and state equation in 91 ms returned []
Implicit Place search using SMT with State Equation took 135 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 91/103 places, 107/125 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 197 ms. Remains : 91/103 places, 107/125 transitions.
Stuttering acceptance computed with spot in 307 ms :[(AND (NOT p0) (NOT p4)), (NOT p0), (AND (NOT p0) (NOT p1) (NOT p2) (NOT p4)), (AND (NOT p0) (NOT p1) (NOT p2) (NOT p4)), (AND (NOT p0) (NOT p2) (NOT p4)), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : CANConstruction-PT-005-LTLFireability-02
Product exploration explored 100000 steps with 50000 reset in 125 ms.
Product exploration explored 100000 steps with 50000 reset in 105 ms.
Computed a total of 18 stabilizing places and 22 stable transitions
Computed a total of 18 stabilizing places and 22 stable transitions
Detected a total of 18/91 stabilizing places and 22/107 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/5 atomic propositions.
Knowledge obtained : [(AND (NOT p0) (NOT p4) (NOT p3) p1 p2), (X (NOT p2)), (X (NOT (AND (NOT p0) (NOT p1) p2))), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (NOT p0)), (X p1), (X (X (NOT p2))), (X (X (NOT p3))), (X (X (NOT p4))), (X (X (NOT (AND (NOT p0) p2 (NOT p4) p3)))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p4) p3)))), (X (X (NOT (AND (NOT p0) p2 (NOT p4) (NOT p3))))), (X (X (AND (NOT p0) (NOT p4) (NOT p3)))), (X (X (AND (NOT p0) (NOT p2) (NOT p4) (NOT p3)))), (X (X (NOT (AND (NOT p0) (NOT p4) p3)))), (X (X (NOT p0))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 17 factoid took 20 ms. Reduced automaton from 6 states, 12 edges and 5 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA CANConstruction-PT-005-LTLFireability-02 TRUE TECHNIQUES KNOWLEDGE
Treatment of property CANConstruction-PT-005-LTLFireability-02 finished in 776 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||F(p1)||(p2 U (p3||G(p2))))))'
Support contains 7 out of 103 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 103/103 places, 125/125 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 25 transitions
Trivial Post-agglo rules discarded 25 transitions
Performed 25 trivial Post agglomeration. Transition count delta: 25
Iterating post reduction 0 with 25 rules applied. Total rules applied 25 place count 103 transition count 100
Reduce places removed 25 places and 0 transitions.
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Iterating post reduction 1 with 31 rules applied. Total rules applied 56 place count 78 transition count 94
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 62 place count 72 transition count 94
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 62 place count 72 transition count 91
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 68 place count 69 transition count 91
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 75 place count 62 transition count 77
Iterating global reduction 3 with 7 rules applied. Total rules applied 82 place count 62 transition count 77
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 3 with 1 rules applied. Total rules applied 83 place count 62 transition count 76
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 84 place count 61 transition count 76
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 5 with 6 rules applied. Total rules applied 90 place count 58 transition count 73
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -7
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 5 with 8 rules applied. Total rules applied 98 place count 54 transition count 80
Applied a total of 98 rules in 16 ms. Remains 54 /103 variables (removed 49) and now considering 80/125 (removed 45) transitions.
// Phase 1: matrix 80 rows 54 cols
[2024-05-22 07:03:24] [INFO ] Computed 10 invariants in 0 ms
[2024-05-22 07:03:24] [INFO ] Implicit Places using invariants in 42 ms returned [13, 22, 29]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 44 ms to find 3 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 51/103 places, 80/125 transitions.
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 0 with 12 rules applied. Total rules applied 12 place count 45 transition count 74
Applied a total of 12 rules in 4 ms. Remains 45 /51 variables (removed 6) and now considering 74/80 (removed 6) transitions.
// Phase 1: matrix 74 rows 45 cols
[2024-05-22 07:03:24] [INFO ] Computed 7 invariants in 2 ms
[2024-05-22 07:03:24] [INFO ] Implicit Places using invariants in 39 ms returned []
[2024-05-22 07:03:24] [INFO ] Invariant cache hit.
[2024-05-22 07:03:24] [INFO ] State equation strengthened by 60 read => feed constraints.
[2024-05-22 07:03:25] [INFO ] Implicit Places using invariants and state equation in 62 ms returned []
Implicit Place search using SMT with State Equation took 103 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 45/103 places, 74/125 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 167 ms. Remains : 45/103 places, 74/125 transitions.
Stuttering acceptance computed with spot in 133 ms :[(AND (NOT p0) (NOT p1) (NOT p3) (NOT p2)), (NOT p1), (AND (NOT p1) p0 (NOT p3) (NOT p2))]
Running random walk in product with property : CANConstruction-PT-005-LTLFireability-03
Product exploration explored 100000 steps with 3459 reset in 157 ms.
Stack based approach found an accepted trace after 6052 steps with 202 reset with depth 35 and stack size 31 in 11 ms.
FORMULA CANConstruction-PT-005-LTLFireability-03 FALSE TECHNIQUES STACK_TEST
Treatment of property CANConstruction-PT-005-LTLFireability-03 finished in 486 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' '!((p0 U X(X(G(p1)))))'
Support contains 3 out of 103 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 103/103 places, 125/125 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 96 transition count 111
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 96 transition count 111
Applied a total of 14 rules in 3 ms. Remains 96 /103 variables (removed 7) and now considering 111/125 (removed 14) transitions.
// Phase 1: matrix 111 rows 96 cols
[2024-05-22 07:03:25] [INFO ] Computed 10 invariants in 1 ms
[2024-05-22 07:03:25] [INFO ] Implicit Places using invariants in 50 ms returned [12, 26, 52, 66]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 51 ms to find 4 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 92/103 places, 111/125 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 88 transition count 107
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 88 transition count 107
Applied a total of 8 rules in 2 ms. Remains 88 /92 variables (removed 4) and now considering 107/111 (removed 4) transitions.
// Phase 1: matrix 107 rows 88 cols
[2024-05-22 07:03:25] [INFO ] Computed 6 invariants in 1 ms
[2024-05-22 07:03:25] [INFO ] Implicit Places using invariants in 41 ms returned []
[2024-05-22 07:03:25] [INFO ] Invariant cache hit.
[2024-05-22 07:03:25] [INFO ] State equation strengthened by 45 read => feed constraints.
[2024-05-22 07:03:25] [INFO ] Implicit Places using invariants and state equation in 85 ms returned []
Implicit Place search using SMT with State Equation took 129 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 88/103 places, 107/125 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 187 ms. Remains : 88/103 places, 107/125 transitions.
Stuttering acceptance computed with spot in 142 ms :[(NOT p1), (NOT p1), true, (NOT p1)]
Running random walk in product with property : CANConstruction-PT-005-LTLFireability-05
Entered a terminal (fully accepting) state of product in 204 steps with 2 reset in 1 ms.
FORMULA CANConstruction-PT-005-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANConstruction-PT-005-LTLFireability-05 finished in 353 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) U X(X(X(p1)))))'
Support contains 2 out of 103 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 103/103 places, 125/125 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 97 transition count 113
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 97 transition count 113
Applied a total of 12 rules in 3 ms. Remains 97 /103 variables (removed 6) and now considering 113/125 (removed 12) transitions.
// Phase 1: matrix 113 rows 97 cols
[2024-05-22 07:03:25] [INFO ] Computed 10 invariants in 2 ms
[2024-05-22 07:03:25] [INFO ] Implicit Places using invariants in 57 ms returned [12, 26, 52, 66]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 58 ms to find 4 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 93/103 places, 113/125 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 89 transition count 109
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 89 transition count 109
Applied a total of 8 rules in 3 ms. Remains 89 /93 variables (removed 4) and now considering 109/113 (removed 4) transitions.
// Phase 1: matrix 109 rows 89 cols
[2024-05-22 07:03:25] [INFO ] Computed 6 invariants in 0 ms
[2024-05-22 07:03:25] [INFO ] Implicit Places using invariants in 39 ms returned []
[2024-05-22 07:03:25] [INFO ] Invariant cache hit.
[2024-05-22 07:03:25] [INFO ] State equation strengthened by 45 read => feed constraints.
[2024-05-22 07:03:25] [INFO ] Implicit Places using invariants and state equation in 79 ms returned []
Implicit Place search using SMT with State Equation took 121 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 89/103 places, 109/125 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 186 ms. Remains : 89/103 places, 109/125 transitions.
Stuttering acceptance computed with spot in 339 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), (NOT p1), true, (NOT p1), (NOT p1), (NOT p0)]
Running random walk in product with property : CANConstruction-PT-005-LTLFireability-07
Product exploration explored 100000 steps with 25000 reset in 70 ms.
Product exploration explored 100000 steps with 25000 reset in 75 ms.
Computed a total of 16 stabilizing places and 20 stable transitions
Computed a total of 16 stabilizing places and 20 stable transitions
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 85 ms. Reduced automaton from 9 states, 15 edges and 2 AP (stutter sensitive) to 5 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 156 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), true]
RANDOM walk for 659 steps (8 resets) in 7 ms. (82 steps per ms) remains 0/1 properties
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F (NOT p1))]
Knowledge based reduction with 3 factoid took 98 ms. Reduced automaton from 5 states, 5 edges and 1 AP (stutter sensitive) to 5 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 174 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), true]
Stuttering acceptance computed with spot in 177 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), true]
Support contains 1 out of 89 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 89/89 places, 109/109 transitions.
Applied a total of 0 rules in 2 ms. Remains 89 /89 variables (removed 0) and now considering 109/109 (removed 0) transitions.
[2024-05-22 07:03:27] [INFO ] Invariant cache hit.
[2024-05-22 07:03:27] [INFO ] Implicit Places using invariants in 58 ms returned []
[2024-05-22 07:03:27] [INFO ] Invariant cache hit.
[2024-05-22 07:03:27] [INFO ] State equation strengthened by 45 read => feed constraints.
[2024-05-22 07:03:27] [INFO ] Implicit Places using invariants and state equation in 80 ms returned []
Implicit Place search using SMT with State Equation took 139 ms to find 0 implicit places.
Running 104 sub problems to find dead transitions.
[2024-05-22 07:03:27] [INFO ] Invariant cache hit.
[2024-05-22 07:03:27] [INFO ] State equation strengthened by 45 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/88 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 104 unsolved
[2024-05-22 07:03:27] [INFO ] Deduced a trap composed of 18 places in 49 ms of which 8 ms to minimize.
[2024-05-22 07:03:27] [INFO ] Deduced a trap composed of 17 places in 64 ms of which 9 ms to minimize.
[2024-05-22 07:03:27] [INFO ] Deduced a trap composed of 20 places in 35 ms of which 1 ms to minimize.
[2024-05-22 07:03:27] [INFO ] Deduced a trap composed of 17 places in 29 ms of which 0 ms to minimize.
[2024-05-22 07:03:27] [INFO ] Deduced a trap composed of 17 places in 43 ms of which 0 ms to minimize.
[2024-05-22 07:03:28] [INFO ] Deduced a trap composed of 20 places in 55 ms of which 1 ms to minimize.
[2024-05-22 07:03:28] [INFO ] Deduced a trap composed of 17 places in 38 ms of which 7 ms to minimize.
[2024-05-22 07:03:28] [INFO ] Deduced a trap composed of 17 places in 39 ms of which 1 ms to minimize.
[2024-05-22 07:03:28] [INFO ] Deduced a trap composed of 17 places in 23 ms of which 0 ms to minimize.
[2024-05-22 07:03:28] [INFO ] Deduced a trap composed of 17 places in 26 ms of which 0 ms to minimize.
[2024-05-22 07:03:28] [INFO ] Deduced a trap composed of 17 places in 36 ms of which 1 ms to minimize.
[2024-05-22 07:03:28] [INFO ] Deduced a trap composed of 18 places in 40 ms of which 1 ms to minimize.
[2024-05-22 07:03:28] [INFO ] Deduced a trap composed of 17 places in 55 ms of which 1 ms to minimize.
[2024-05-22 07:03:28] [INFO ] Deduced a trap composed of 18 places in 27 ms of which 1 ms to minimize.
[2024-05-22 07:03:28] [INFO ] Deduced a trap composed of 17 places in 35 ms of which 1 ms to minimize.
[2024-05-22 07:03:28] [INFO ] Deduced a trap composed of 17 places in 46 ms of which 0 ms to minimize.
[2024-05-22 07:03:28] [INFO ] Deduced a trap composed of 17 places in 60 ms of which 1 ms to minimize.
[2024-05-22 07:03:28] [INFO ] Deduced a trap composed of 17 places in 46 ms of which 0 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/88 variables, 18/24 constraints. Problems are: Problem set: 0 solved, 104 unsolved
[2024-05-22 07:03:29] [INFO ] Deduced a trap composed of 17 places in 79 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/88 variables, 1/25 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/88 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 4 (OVERLAPS) 109/197 variables, 88/113 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/197 variables, 45/158 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/197 variables, 0/158 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 7 (OVERLAPS) 1/198 variables, 1/159 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/198 variables, 0/159 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 9 (OVERLAPS) 0/198 variables, 0/159 constraints. Problems are: Problem set: 0 solved, 104 unsolved
No progress, stopping.
After SMT solving in domain Real declared 198/198 variables, and 159 constraints, problems are : Problem set: 0 solved, 104 unsolved in 5144 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 89/89 constraints, ReadFeed: 45/45 constraints, PredecessorRefiner: 104/104 constraints, Known Traps: 19/19 constraints]
Escalating to Integer solving :Problem set: 0 solved, 104 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/88 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/88 variables, 19/25 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/88 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 3 (OVERLAPS) 109/197 variables, 88/113 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/197 variables, 45/158 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/197 variables, 104/262 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/197 variables, 0/262 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 7 (OVERLAPS) 1/198 variables, 1/263 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/198 variables, 0/263 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 9 (OVERLAPS) 0/198 variables, 0/263 constraints. Problems are: Problem set: 0 solved, 104 unsolved
No progress, stopping.
After SMT solving in domain Int declared 198/198 variables, and 263 constraints, problems are : Problem set: 0 solved, 104 unsolved in 2998 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 89/89 constraints, ReadFeed: 45/45 constraints, PredecessorRefiner: 104/104 constraints, Known Traps: 19/19 constraints]
After SMT, in 8189ms problems are : Problem set: 0 solved, 104 unsolved
Search for dead transitions found 0 dead transitions in 8191ms
Finished structural reductions in LTL mode , in 1 iterations and 8336 ms. Remains : 89/89 places, 109/109 transitions.
Computed a total of 16 stabilizing places and 20 stable transitions
Computed a total of 16 stabilizing places and 20 stable transitions
Knowledge obtained : [p1]
False Knowledge obtained : []
Knowledge based reduction with 1 factoid took 89 ms. Reduced automaton from 5 states, 5 edges and 1 AP (stutter sensitive) to 5 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 151 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), true]
RANDOM walk for 1366 steps (15 resets) in 6 ms. (195 steps per ms) remains 0/1 properties
Knowledge obtained : [p1]
False Knowledge obtained : [(F (NOT p1))]
Knowledge based reduction with 1 factoid took 103 ms. Reduced automaton from 5 states, 5 edges and 1 AP (stutter sensitive) to 5 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 141 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), true]
Stuttering acceptance computed with spot in 128 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), true]
Stuttering acceptance computed with spot in 160 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), true]
Product exploration explored 100000 steps with 25000 reset in 147 ms.
Product exploration explored 100000 steps with 25000 reset in 252 ms.
Applying partial POR strategy [true, false, false, false, true]
Stuttering acceptance computed with spot in 179 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), true]
Support contains 1 out of 89 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 89/89 places, 109/109 transitions.
Performed 20 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 20 rules applied. Total rules applied 20 place count 89 transition count 109
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 5 Pre rules applied. Total rules applied 20 place count 89 transition count 109
Deduced a syphon composed of 25 places in 0 ms
Iterating global reduction 1 with 5 rules applied. Total rules applied 25 place count 89 transition count 109
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 36 place count 78 transition count 97
Deduced a syphon composed of 15 places in 0 ms
Iterating global reduction 1 with 11 rules applied. Total rules applied 47 place count 78 transition count 97
Performed 20 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 35 places in 0 ms
Iterating global reduction 1 with 20 rules applied. Total rules applied 67 place count 78 transition count 97
Discarding 25 places :
Symmetric choice reduction at 1 with 25 rule applications. Total rules 92 place count 53 transition count 72
Deduced a syphon composed of 10 places in 0 ms
Iterating global reduction 1 with 25 rules applied. Total rules applied 117 place count 53 transition count 72
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: -19
Deduced a syphon composed of 15 places in 0 ms
Iterating global reduction 1 with 5 rules applied. Total rules applied 122 place count 53 transition count 91
Deduced a syphon composed of 15 places in 0 ms
Applied a total of 122 rules in 50 ms. Remains 53 /89 variables (removed 36) and now considering 91/109 (removed 18) transitions.
[2024-05-22 07:03:37] [INFO ] Redundant transitions in 1 ms returned []
Running 86 sub problems to find dead transitions.
// Phase 1: matrix 91 rows 53 cols
[2024-05-22 07:03:37] [INFO ] Computed 6 invariants in 0 ms
[2024-05-22 07:03:37] [INFO ] State equation strengthened by 64 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/52 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 86 unsolved
[2024-05-22 07:03:37] [INFO ] Deduced a trap composed of 7 places in 49 ms of which 4 ms to minimize.
[2024-05-22 07:03:37] [INFO ] Deduced a trap composed of 7 places in 38 ms of which 4 ms to minimize.
[2024-05-22 07:03:37] [INFO ] Deduced a trap composed of 7 places in 26 ms of which 1 ms to minimize.
[2024-05-22 07:03:37] [INFO ] Deduced a trap composed of 8 places in 35 ms of which 0 ms to minimize.
[2024-05-22 07:03:37] [INFO ] Deduced a trap composed of 7 places in 31 ms of which 0 ms to minimize.
[2024-05-22 07:03:37] [INFO ] Deduced a trap composed of 7 places in 39 ms of which 1 ms to minimize.
[2024-05-22 07:03:37] [INFO ] Deduced a trap composed of 7 places in 26 ms of which 1 ms to minimize.
[2024-05-22 07:03:37] [INFO ] Deduced a trap composed of 7 places in 29 ms of which 1 ms to minimize.
[2024-05-22 07:03:37] [INFO ] Deduced a trap composed of 7 places in 34 ms of which 0 ms to minimize.
[2024-05-22 07:03:37] [INFO ] Deduced a trap composed of 7 places in 27 ms of which 0 ms to minimize.
[2024-05-22 07:03:37] [INFO ] Deduced a trap composed of 7 places in 41 ms of which 1 ms to minimize.
[2024-05-22 07:03:37] [INFO ] Deduced a trap composed of 7 places in 81 ms of which 0 ms to minimize.
[2024-05-22 07:03:38] [INFO ] Deduced a trap composed of 7 places in 45 ms of which 1 ms to minimize.
[2024-05-22 07:03:38] [INFO ] Deduced a trap composed of 7 places in 36 ms of which 1 ms to minimize.
[2024-05-22 07:03:38] [INFO ] Deduced a trap composed of 7 places in 33 ms of which 1 ms to minimize.
[2024-05-22 07:03:38] [INFO ] Deduced a trap composed of 7 places in 29 ms of which 5 ms to minimize.
[2024-05-22 07:03:38] [INFO ] Deduced a trap composed of 7 places in 30 ms of which 0 ms to minimize.
[2024-05-22 07:03:38] [INFO ] Deduced a trap composed of 8 places in 37 ms of which 0 ms to minimize.
[2024-05-22 07:03:38] [INFO ] Deduced a trap composed of 7 places in 38 ms of which 1 ms to minimize.
[2024-05-22 07:03:38] [INFO ] Deduced a trap composed of 7 places in 32 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/52 variables, 20/26 constraints. Problems are: Problem set: 0 solved, 86 unsolved
[2024-05-22 07:03:38] [INFO ] Deduced a trap composed of 8 places in 47 ms of which 1 ms to minimize.
[2024-05-22 07:03:38] [INFO ] Deduced a trap composed of 8 places in 23 ms of which 1 ms to minimize.
[2024-05-22 07:03:38] [INFO ] Deduced a trap composed of 7 places in 27 ms of which 1 ms to minimize.
[2024-05-22 07:03:38] [INFO ] Deduced a trap composed of 2 places in 50 ms of which 1 ms to minimize.
[2024-05-22 07:03:38] [INFO ] Deduced a trap composed of 2 places in 42 ms of which 1 ms to minimize.
[2024-05-22 07:03:38] [INFO ] Deduced a trap composed of 2 places in 36 ms of which 1 ms to minimize.
[2024-05-22 07:03:38] [INFO ] Deduced a trap composed of 2 places in 29 ms of which 0 ms to minimize.
[2024-05-22 07:03:38] [INFO ] Deduced a trap composed of 7 places in 24 ms of which 1 ms to minimize.
[2024-05-22 07:03:38] [INFO ] Deduced a trap composed of 8 places in 25 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/52 variables, 9/35 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/52 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 86 unsolved
Problem TDEAD21 is UNSAT
Problem TDEAD22 is UNSAT
Problem TDEAD23 is UNSAT
Problem TDEAD24 is UNSAT
Problem TDEAD25 is UNSAT
Problem TDEAD26 is UNSAT
Problem TDEAD27 is UNSAT
Problem TDEAD30 is UNSAT
Problem TDEAD31 is UNSAT
Problem TDEAD32 is UNSAT
Problem TDEAD35 is UNSAT
Problem TDEAD36 is UNSAT
Problem TDEAD37 is UNSAT
Problem TDEAD40 is UNSAT
Problem TDEAD41 is UNSAT
Problem TDEAD42 is UNSAT
Problem TDEAD45 is UNSAT
Problem TDEAD46 is UNSAT
Problem TDEAD48 is UNSAT
Problem TDEAD51 is UNSAT
At refinement iteration 4 (OVERLAPS) 91/143 variables, 52/87 constraints. Problems are: Problem set: 20 solved, 66 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/143 variables, 64/151 constraints. Problems are: Problem set: 20 solved, 66 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/143 variables, 0/151 constraints. Problems are: Problem set: 20 solved, 66 unsolved
At refinement iteration 7 (OVERLAPS) 1/144 variables, 1/152 constraints. Problems are: Problem set: 20 solved, 66 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/144 variables, 0/152 constraints. Problems are: Problem set: 20 solved, 66 unsolved
At refinement iteration 9 (OVERLAPS) 0/144 variables, 0/152 constraints. Problems are: Problem set: 20 solved, 66 unsolved
No progress, stopping.
After SMT solving in domain Real declared 144/144 variables, and 152 constraints, problems are : Problem set: 20 solved, 66 unsolved in 2887 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 53/53 constraints, ReadFeed: 64/64 constraints, PredecessorRefiner: 86/86 constraints, Known Traps: 29/29 constraints]
Escalating to Integer solving :Problem set: 20 solved, 66 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/37 variables, 29/29 constraints. Problems are: Problem set: 20 solved, 66 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/37 variables, 0/29 constraints. Problems are: Problem set: 20 solved, 66 unsolved
At refinement iteration 2 (OVERLAPS) 15/52 variables, 6/35 constraints. Problems are: Problem set: 20 solved, 66 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/52 variables, 0/35 constraints. Problems are: Problem set: 20 solved, 66 unsolved
At refinement iteration 4 (OVERLAPS) 91/143 variables, 52/87 constraints. Problems are: Problem set: 20 solved, 66 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/143 variables, 64/151 constraints. Problems are: Problem set: 20 solved, 66 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/143 variables, 66/217 constraints. Problems are: Problem set: 20 solved, 66 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/143 variables, 0/217 constraints. Problems are: Problem set: 20 solved, 66 unsolved
At refinement iteration 8 (OVERLAPS) 1/144 variables, 1/218 constraints. Problems are: Problem set: 20 solved, 66 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/144 variables, 0/218 constraints. Problems are: Problem set: 20 solved, 66 unsolved
At refinement iteration 10 (OVERLAPS) 0/144 variables, 0/218 constraints. Problems are: Problem set: 20 solved, 66 unsolved
No progress, stopping.
After SMT solving in domain Int declared 144/144 variables, and 218 constraints, problems are : Problem set: 20 solved, 66 unsolved in 1764 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 53/53 constraints, ReadFeed: 64/64 constraints, PredecessorRefiner: 66/86 constraints, Known Traps: 29/29 constraints]
After SMT, in 4674ms problems are : Problem set: 20 solved, 66 unsolved
Search for dead transitions found 20 dead transitions in 4675ms
Found 20 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 20 transitions
Dead transitions reduction (with SMT) removed 20 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 53/89 places, 71/109 transitions.
Graph (complete) has 217 edges and 53 vertex of which 38 are kept as prefixes of interest. Removing 15 places using SCC suffix rule.1 ms
Discarding 15 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 5 ms. Remains 38 /53 variables (removed 15) and now considering 71/71 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 38/89 places, 71/109 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 4741 ms. Remains : 38/89 places, 71/109 transitions.
Support contains 1 out of 89 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 89/89 places, 109/109 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 88 transition count 107
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 88 transition count 107
Applied a total of 2 rules in 1 ms. Remains 88 /89 variables (removed 1) and now considering 107/109 (removed 2) transitions.
// Phase 1: matrix 107 rows 88 cols
[2024-05-22 07:03:41] [INFO ] Computed 6 invariants in 3 ms
[2024-05-22 07:03:41] [INFO ] Implicit Places using invariants in 86 ms returned []
[2024-05-22 07:03:42] [INFO ] Invariant cache hit.
[2024-05-22 07:03:42] [INFO ] State equation strengthened by 45 read => feed constraints.
[2024-05-22 07:03:42] [INFO ] Implicit Places using invariants and state equation in 205 ms returned []
Implicit Place search using SMT with State Equation took 315 ms to find 0 implicit places.
Running 102 sub problems to find dead transitions.
[2024-05-22 07:03:42] [INFO ] Invariant cache hit.
[2024-05-22 07:03:42] [INFO ] State equation strengthened by 45 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/87 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 102 unsolved
[2024-05-22 07:03:42] [INFO ] Deduced a trap composed of 17 places in 39 ms of which 1 ms to minimize.
[2024-05-22 07:03:42] [INFO ] Deduced a trap composed of 17 places in 40 ms of which 1 ms to minimize.
[2024-05-22 07:03:43] [INFO ] Deduced a trap composed of 20 places in 44 ms of which 2 ms to minimize.
[2024-05-22 07:03:43] [INFO ] Deduced a trap composed of 17 places in 45 ms of which 1 ms to minimize.
[2024-05-22 07:03:43] [INFO ] Deduced a trap composed of 17 places in 21 ms of which 0 ms to minimize.
[2024-05-22 07:03:43] [INFO ] Deduced a trap composed of 20 places in 37 ms of which 1 ms to minimize.
[2024-05-22 07:03:43] [INFO ] Deduced a trap composed of 17 places in 35 ms of which 1 ms to minimize.
[2024-05-22 07:03:43] [INFO ] Deduced a trap composed of 17 places in 25 ms of which 5 ms to minimize.
[2024-05-22 07:03:43] [INFO ] Deduced a trap composed of 17 places in 38 ms of which 1 ms to minimize.
[2024-05-22 07:03:43] [INFO ] Deduced a trap composed of 18 places in 36 ms of which 1 ms to minimize.
[2024-05-22 07:03:43] [INFO ] Deduced a trap composed of 17 places in 42 ms of which 1 ms to minimize.
[2024-05-22 07:03:43] [INFO ] Deduced a trap composed of 17 places in 45 ms of which 1 ms to minimize.
[2024-05-22 07:03:43] [INFO ] Deduced a trap composed of 17 places in 41 ms of which 0 ms to minimize.
[2024-05-22 07:03:43] [INFO ] Deduced a trap composed of 17 places in 37 ms of which 1 ms to minimize.
[2024-05-22 07:03:43] [INFO ] Deduced a trap composed of 17 places in 41 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/87 variables, 15/21 constraints. Problems are: Problem set: 0 solved, 102 unsolved
[2024-05-22 07:03:43] [INFO ] Deduced a trap composed of 17 places in 27 ms of which 7 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/87 variables, 1/22 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/87 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 4 (OVERLAPS) 107/194 variables, 87/109 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/194 variables, 45/154 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/194 variables, 0/154 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 7 (OVERLAPS) 1/195 variables, 1/155 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/195 variables, 0/155 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 9 (OVERLAPS) 0/195 variables, 0/155 constraints. Problems are: Problem set: 0 solved, 102 unsolved
No progress, stopping.
After SMT solving in domain Real declared 195/195 variables, and 155 constraints, problems are : Problem set: 0 solved, 102 unsolved in 4084 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 88/88 constraints, ReadFeed: 45/45 constraints, PredecessorRefiner: 102/102 constraints, Known Traps: 16/16 constraints]
Escalating to Integer solving :Problem set: 0 solved, 102 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/87 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/87 variables, 16/22 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/87 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 3 (OVERLAPS) 107/194 variables, 87/109 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/194 variables, 45/154 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/194 variables, 102/256 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/194 variables, 0/256 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 7 (OVERLAPS) 1/195 variables, 1/257 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/195 variables, 0/257 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 9 (OVERLAPS) 0/195 variables, 0/257 constraints. Problems are: Problem set: 0 solved, 102 unsolved
No progress, stopping.
After SMT solving in domain Int declared 195/195 variables, and 257 constraints, problems are : Problem set: 0 solved, 102 unsolved in 2377 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 88/88 constraints, ReadFeed: 45/45 constraints, PredecessorRefiner: 102/102 constraints, Known Traps: 16/16 constraints]
After SMT, in 6500ms problems are : Problem set: 0 solved, 102 unsolved
Search for dead transitions found 0 dead transitions in 6504ms
Starting structural reductions in LTL mode, iteration 1 : 88/89 places, 107/109 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6821 ms. Remains : 88/89 places, 107/109 transitions.
Treatment of property CANConstruction-PT-005-LTLFireability-07 finished in 23072 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 1 out of 103 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 103/103 places, 125/125 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 96 transition count 111
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 96 transition count 111
Applied a total of 14 rules in 1 ms. Remains 96 /103 variables (removed 7) and now considering 111/125 (removed 14) transitions.
// Phase 1: matrix 111 rows 96 cols
[2024-05-22 07:03:48] [INFO ] Computed 10 invariants in 1 ms
[2024-05-22 07:03:48] [INFO ] Implicit Places using invariants in 49 ms returned [12, 26, 52, 66]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 50 ms to find 4 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 92/103 places, 111/125 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 88 transition count 107
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 88 transition count 107
Applied a total of 8 rules in 1 ms. Remains 88 /92 variables (removed 4) and now considering 107/111 (removed 4) transitions.
// Phase 1: matrix 107 rows 88 cols
[2024-05-22 07:03:48] [INFO ] Computed 6 invariants in 1 ms
[2024-05-22 07:03:48] [INFO ] Implicit Places using invariants in 41 ms returned []
[2024-05-22 07:03:48] [INFO ] Invariant cache hit.
[2024-05-22 07:03:48] [INFO ] State equation strengthened by 45 read => feed constraints.
[2024-05-22 07:03:48] [INFO ] Implicit Places using invariants and state equation in 75 ms returned []
Implicit Place search using SMT with State Equation took 117 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 88/103 places, 107/125 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 169 ms. Remains : 88/103 places, 107/125 transitions.
Stuttering acceptance computed with spot in 121 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : CANConstruction-PT-005-LTLFireability-10
Stuttering criterion allowed to conclude after 67 steps with 0 reset in 0 ms.
FORMULA CANConstruction-PT-005-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANConstruction-PT-005-LTLFireability-10 finished in 305 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((X(X(F(p0)))||(!p1 U p2)))))'
Support contains 5 out of 103 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 103/103 places, 125/125 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 30 transitions
Trivial Post-agglo rules discarded 30 transitions
Performed 30 trivial Post agglomeration. Transition count delta: 30
Iterating post reduction 0 with 30 rules applied. Total rules applied 30 place count 103 transition count 95
Reduce places removed 30 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 31 rules applied. Total rules applied 61 place count 73 transition count 94
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 62 place count 72 transition count 94
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 62 place count 72 transition count 91
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 68 place count 69 transition count 91
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 76 place count 61 transition count 75
Iterating global reduction 3 with 8 rules applied. Total rules applied 84 place count 61 transition count 75
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 3 with 1 rules applied. Total rules applied 85 place count 61 transition count 74
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 86 place count 60 transition count 74
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 5 with 6 rules applied. Total rules applied 92 place count 57 transition count 71
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -8
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 5 with 8 rules applied. Total rules applied 100 place count 53 transition count 79
Applied a total of 100 rules in 15 ms. Remains 53 /103 variables (removed 50) and now considering 79/125 (removed 46) transitions.
// Phase 1: matrix 79 rows 53 cols
[2024-05-22 07:03:49] [INFO ] Computed 10 invariants in 1 ms
[2024-05-22 07:03:49] [INFO ] Implicit Places using invariants in 37 ms returned [5, 12, 22]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 38 ms to find 3 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 50/103 places, 79/125 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 49 transition count 78
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 49 transition count 78
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 0 with 10 rules applied. Total rules applied 12 place count 44 transition count 73
Applied a total of 12 rules in 4 ms. Remains 44 /50 variables (removed 6) and now considering 73/79 (removed 6) transitions.
// Phase 1: matrix 73 rows 44 cols
[2024-05-22 07:03:49] [INFO ] Computed 7 invariants in 0 ms
[2024-05-22 07:03:49] [INFO ] Implicit Places using invariants in 38 ms returned []
[2024-05-22 07:03:49] [INFO ] Invariant cache hit.
[2024-05-22 07:03:49] [INFO ] State equation strengthened by 61 read => feed constraints.
[2024-05-22 07:03:49] [INFO ] Implicit Places using invariants and state equation in 66 ms returned []
Implicit Place search using SMT with State Equation took 105 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 44/103 places, 73/125 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 164 ms. Remains : 44/103 places, 73/125 transitions.
Stuttering acceptance computed with spot in 116 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : CANConstruction-PT-005-LTLFireability-11
Product exploration explored 100000 steps with 4025 reset in 128 ms.
Stack based approach found an accepted trace after 286 steps with 12 reset with depth 12 and stack size 12 in 1 ms.
FORMULA CANConstruction-PT-005-LTLFireability-11 FALSE TECHNIQUES STACK_TEST
Treatment of property CANConstruction-PT-005-LTLFireability-11 finished in 431 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 103 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 103/103 places, 125/125 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 96 transition count 111
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 96 transition count 111
Applied a total of 14 rules in 2 ms. Remains 96 /103 variables (removed 7) and now considering 111/125 (removed 14) transitions.
// Phase 1: matrix 111 rows 96 cols
[2024-05-22 07:03:49] [INFO ] Computed 10 invariants in 2 ms
[2024-05-22 07:03:49] [INFO ] Implicit Places using invariants in 57 ms returned [12, 26, 52, 66]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 57 ms to find 4 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 92/103 places, 111/125 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 88 transition count 107
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 88 transition count 107
Applied a total of 8 rules in 0 ms. Remains 88 /92 variables (removed 4) and now considering 107/111 (removed 4) transitions.
// Phase 1: matrix 107 rows 88 cols
[2024-05-22 07:03:49] [INFO ] Computed 6 invariants in 2 ms
[2024-05-22 07:03:49] [INFO ] Implicit Places using invariants in 43 ms returned []
[2024-05-22 07:03:49] [INFO ] Invariant cache hit.
[2024-05-22 07:03:49] [INFO ] State equation strengthened by 45 read => feed constraints.
[2024-05-22 07:03:49] [INFO ] Implicit Places using invariants and state equation in 83 ms returned []
Implicit Place search using SMT with State Equation took 127 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 88/103 places, 107/125 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 187 ms. Remains : 88/103 places, 107/125 transitions.
Stuttering acceptance computed with spot in 143 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : CANConstruction-PT-005-LTLFireability-12
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA CANConstruction-PT-005-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANConstruction-PT-005-LTLFireability-12 finished in 350 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(F(p0)) U p1))))'
Support contains 3 out of 103 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 103/103 places, 125/125 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 97 transition count 113
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 97 transition count 113
Applied a total of 12 rules in 2 ms. Remains 97 /103 variables (removed 6) and now considering 113/125 (removed 12) transitions.
// Phase 1: matrix 113 rows 97 cols
[2024-05-22 07:03:49] [INFO ] Computed 10 invariants in 1 ms
[2024-05-22 07:03:49] [INFO ] Implicit Places using invariants in 55 ms returned [12, 26, 52, 66]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 55 ms to find 4 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 93/103 places, 113/125 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 89 transition count 109
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 89 transition count 109
Applied a total of 8 rules in 1 ms. Remains 89 /93 variables (removed 4) and now considering 109/113 (removed 4) transitions.
// Phase 1: matrix 109 rows 89 cols
[2024-05-22 07:03:49] [INFO ] Computed 6 invariants in 0 ms
[2024-05-22 07:03:49] [INFO ] Implicit Places using invariants in 43 ms returned []
[2024-05-22 07:03:49] [INFO ] Invariant cache hit.
[2024-05-22 07:03:50] [INFO ] State equation strengthened by 45 read => feed constraints.
[2024-05-22 07:03:50] [INFO ] Implicit Places using invariants and state equation in 79 ms returned []
Implicit Place search using SMT with State Equation took 123 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 89/103 places, 109/125 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 181 ms. Remains : 89/103 places, 109/125 transitions.
Stuttering acceptance computed with spot in 400 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p0), (NOT p0)]
Running random walk in product with property : CANConstruction-PT-005-LTLFireability-13
Stuttering criterion allowed to conclude after 151 steps with 1 reset in 1 ms.
FORMULA CANConstruction-PT-005-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANConstruction-PT-005-LTLFireability-13 finished in 602 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((X(G((p0||F(p1))))&&(!p2||X(p2)))))'
Support contains 4 out of 103 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 103/103 places, 125/125 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 31 transitions
Trivial Post-agglo rules discarded 31 transitions
Performed 31 trivial Post agglomeration. Transition count delta: 31
Iterating post reduction 0 with 31 rules applied. Total rules applied 31 place count 103 transition count 94
Reduce places removed 31 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 32 rules applied. Total rules applied 63 place count 72 transition count 93
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 64 place count 71 transition count 93
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 64 place count 71 transition count 92
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 66 place count 70 transition count 92
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 73 place count 63 transition count 78
Iterating global reduction 3 with 7 rules applied. Total rules applied 80 place count 63 transition count 78
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 3 with 1 rules applied. Total rules applied 81 place count 63 transition count 77
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 82 place count 62 transition count 77
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 5 with 8 rules applied. Total rules applied 90 place count 58 transition count 73
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: -9
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 5 with 10 rules applied. Total rules applied 100 place count 53 transition count 82
Applied a total of 100 rules in 17 ms. Remains 53 /103 variables (removed 50) and now considering 82/125 (removed 43) transitions.
// Phase 1: matrix 82 rows 53 cols
[2024-05-22 07:03:50] [INFO ] Computed 10 invariants in 0 ms
[2024-05-22 07:03:50] [INFO ] Implicit Places using invariants in 46 ms returned [5, 11, 23, 29]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 47 ms to find 4 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 49/103 places, 82/125 transitions.
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 0 with 16 rules applied. Total rules applied 16 place count 41 transition count 74
Applied a total of 16 rules in 3 ms. Remains 41 /49 variables (removed 8) and now considering 74/82 (removed 8) transitions.
// Phase 1: matrix 74 rows 41 cols
[2024-05-22 07:03:50] [INFO ] Computed 6 invariants in 0 ms
[2024-05-22 07:03:50] [INFO ] Implicit Places using invariants in 34 ms returned []
[2024-05-22 07:03:50] [INFO ] Invariant cache hit.
[2024-05-22 07:03:50] [INFO ] State equation strengthened by 64 read => feed constraints.
[2024-05-22 07:03:50] [INFO ] Implicit Places using invariants and state equation in 65 ms returned []
Implicit Place search using SMT with State Equation took 100 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 41/103 places, 74/125 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 167 ms. Remains : 41/103 places, 74/125 transitions.
Stuttering acceptance computed with spot in 188 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), false]
Running random walk in product with property : CANConstruction-PT-005-LTLFireability-15
Stuttering criterion allowed to conclude after 30 steps with 0 reset in 1 ms.
FORMULA CANConstruction-PT-005-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANConstruction-PT-005-LTLFireability-15 finished in 378 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) U X(X(X(p1)))))'
[2024-05-22 07:03:50] [INFO ] Flatten gal took : 11 ms
[2024-05-22 07:03:50] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/LTLFireability.sr.xml took 2 ms.
[2024-05-22 07:03:50] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 103 places, 125 transitions and 366 arcs took 8 ms.
Total runtime 30628 ms.
There are residual formulas that ITS could not solve within timeout
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------

Running CANConstruction-PT-005

IS_COLORED=
IS_NUPN=

LOADING PETRI NET FILE /home/mcc/execution/406/model.pnml (PNML) ...
PNML VERSION 2009, P/T NET.
COLOR CLASSES: 0
CONSTANTS: 0
PLACES: 103
TRANSITIONS: 125
COLOR VARS: 0
MEASURES: 0
LOADING TIME: [User 0.002s, Sys 0.000s]


SAVING FILE /home/mcc/execution/406/model (.net / .def) ...
EXPORT TIME: [User 0.000s, Sys 0.000s]


----------------------------------------------------------------------
GreatSPN/Meddly.
Copyright (C) 1987-2022, University of Torino, Italy.
website: https://github.com/greatspn/SOURCES

Based on MEDDLY version 0.16.0
Copyright (C) 2009, Iowa State University Research Foundation, Inc.
website: http://meddly.sourceforge.net

Process ID: 1288
MODEL NAME: /home/mcc/execution/406/model
103 places, 125 transitions.

Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Building monolithic NSF...
FORMULA CANConstruction-PT-005-LTLFireability-07 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
Ok.
EXITCODE: 0
----------------------------------------------------------------------

BK_STOP 1716361431746

--------------------
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 LTLFireability -timeout 360 -rebuildPNML

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="CANConstruction-PT-005"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="greatspnxred"
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 greatspnxred"
echo " Input is CANConstruction-PT-005, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r069-tall-171620503600004"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/CANConstruction-PT-005.tgz
mv CANConstruction-PT-005 execution
cd execution
if [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "UpperBounds" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] || [ "LTLFireability" = "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 [ "LTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLFireability" != "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 "LTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLFireability.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 '' LTLFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLFireability"
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 ;