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.r268-smll-171654406800058.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 itstools
Input is Parking-PT-104, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r268-smll-171654406800058
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 512K
-rw-r--r-- 1 mcc users 6.1K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 65K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.8K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 45K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.5K Apr 23 07:41 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Apr 23 07:41 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Apr 23 07:41 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Apr 23 07:41 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Apr 11 16:14 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 150K Apr 11 16:14 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.3K Apr 11 16:13 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 85K Apr 11 16:13 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 23 07:41 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Apr 23 07:41 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 4 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 23K 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 Parking-PT-104-CTLFireability-2024-00
FORMULA_NAME Parking-PT-104-CTLFireability-2024-01
FORMULA_NAME Parking-PT-104-CTLFireability-2024-02
FORMULA_NAME Parking-PT-104-CTLFireability-2024-03
FORMULA_NAME Parking-PT-104-CTLFireability-2024-04
FORMULA_NAME Parking-PT-104-CTLFireability-2024-05
FORMULA_NAME Parking-PT-104-CTLFireability-2024-06
FORMULA_NAME Parking-PT-104-CTLFireability-2024-07
FORMULA_NAME Parking-PT-104-CTLFireability-2024-08
FORMULA_NAME Parking-PT-104-CTLFireability-2024-09
FORMULA_NAME Parking-PT-104-CTLFireability-2024-10
FORMULA_NAME Parking-PT-104-CTLFireability-2024-11
FORMULA_NAME Parking-PT-104-CTLFireability-2023-12
FORMULA_NAME Parking-PT-104-CTLFireability-2023-13
FORMULA_NAME Parking-PT-104-CTLFireability-2023-14
FORMULA_NAME Parking-PT-104-CTLFireability-2023-15

=== Now, execution of the tool begins

BK_START 1716654984823

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=CTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=Parking-PT-104
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
CTLFireability PT
Running Version 202405141337
[2024-05-25 16:36:26] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-25 16:36:26] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-25 16:36:26] [INFO ] Load time of PNML (sax parser for PT used): 200 ms
[2024-05-25 16:36:26] [INFO ] Transformed 65 places.
[2024-05-25 16:36:26] [INFO ] Transformed 97 transitions.
[2024-05-25 16:36:26] [INFO ] Found NUPN structural information;
[2024-05-25 16:36:26] [INFO ] Parsed PT model containing 65 places and 97 transitions and 284 arcs in 364 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 103 ms.
Ensure Unique test removed 41 transitions
Reduce redundant transitions removed 41 transitions.
Support contains 49 out of 65 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 65/65 places, 56/56 transitions.
Applied a total of 0 rules in 14 ms. Remains 65 /65 variables (removed 0) and now considering 56/56 (removed 0) transitions.
// Phase 1: matrix 56 rows 65 cols
[2024-05-25 16:36:27] [INFO ] Computed 16 invariants in 8 ms
[2024-05-25 16:36:27] [INFO ] Implicit Places using invariants in 268 ms returned [32]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 317 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 64/65 places, 56/56 transitions.
Applied a total of 0 rules in 2 ms. Remains 64 /64 variables (removed 0) and now considering 56/56 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 372 ms. Remains : 64/65 places, 56/56 transitions.
Support contains 49 out of 64 places after structural reductions.
[2024-05-25 16:36:27] [INFO ] Flatten gal took : 33 ms
[2024-05-25 16:36:27] [INFO ] Flatten gal took : 16 ms
[2024-05-25 16:36:28] [INFO ] Input system was already deterministic with 56 transitions.
Reduction of identical properties reduced properties to check from 56 to 51
RANDOM walk for 40000 steps (2383 resets) in 1874 ms. (21 steps per ms) remains 12/51 properties
BEST_FIRST walk for 40002 steps (414 resets) in 200 ms. (199 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40002 steps (422 resets) in 199 ms. (200 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40003 steps (389 resets) in 93 ms. (425 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40003 steps (408 resets) in 94 ms. (421 steps per ms) remains 11/12 properties
BEST_FIRST walk for 40004 steps (414 resets) in 99 ms. (400 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (387 resets) in 106 ms. (373 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (413 resets) in 188 ms. (211 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (411 resets) in 150 ms. (264 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (420 resets) in 122 ms. (325 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40002 steps (441 resets) in 140 ms. (283 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (401 resets) in 127 ms. (312 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (408 resets) in 122 ms. (325 steps per ms) remains 9/11 properties
// Phase 1: matrix 56 rows 64 cols
[2024-05-25 16:36:29] [INFO ] Computed 15 invariants in 4 ms
[2024-05-25 16:36:29] [INFO ] State equation strengthened by 12 read => feed constraints.
Problem AtomicPropp0 is UNSAT
Problem AtomicPropp23 is UNSAT
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/22 variables, 22/22 constraints. Problems are: Problem set: 2 solved, 7 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/22 variables, 0/22 constraints. Problems are: Problem set: 2 solved, 7 unsolved
Problem AtomicPropp3 is UNSAT
Problem AtomicPropp7 is UNSAT
Problem AtomicPropp28 is UNSAT
Problem AtomicPropp38 is UNSAT
Problem AtomicPropp48 is UNSAT
At refinement iteration 2 (OVERLAPS) 38/60 variables, 13/35 constraints. Problems are: Problem set: 7 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/60 variables, 38/73 constraints. Problems are: Problem set: 7 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/60 variables, 0/73 constraints. Problems are: Problem set: 7 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 4/64 variables, 2/75 constraints. Problems are: Problem set: 7 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/64 variables, 4/79 constraints. Problems are: Problem set: 7 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/64 variables, 0/79 constraints. Problems are: Problem set: 7 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 56/120 variables, 64/143 constraints. Problems are: Problem set: 7 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/120 variables, 12/155 constraints. Problems are: Problem set: 7 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/120 variables, 0/155 constraints. Problems are: Problem set: 7 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 0/120 variables, 0/155 constraints. Problems are: Problem set: 7 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 120/120 variables, and 155 constraints, problems are : Problem set: 7 solved, 2 unsolved in 254 ms.
Refiners :[Domain max(s): 64/64 constraints, Positive P Invariants (semi-flows): 15/15 constraints, State Equation: 64/64 constraints, ReadFeed: 12/12 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 7 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 4/4 constraints. Problems are: Problem set: 7 solved, 2 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/4 variables, 0/4 constraints. Problems are: Problem set: 7 solved, 2 unsolved
At refinement iteration 2 (OVERLAPS) 40/44 variables, 4/8 constraints. Problems are: Problem set: 7 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/44 variables, 40/48 constraints. Problems are: Problem set: 7 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/44 variables, 0/48 constraints. Problems are: Problem set: 7 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 20/64 variables, 11/59 constraints. Problems are: Problem set: 7 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/64 variables, 20/79 constraints. Problems are: Problem set: 7 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/64 variables, 0/79 constraints. Problems are: Problem set: 7 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 56/120 variables, 64/143 constraints. Problems are: Problem set: 7 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/120 variables, 12/155 constraints. Problems are: Problem set: 7 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/120 variables, 2/157 constraints. Problems are: Problem set: 7 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/120 variables, 0/157 constraints. Problems are: Problem set: 7 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 0/120 variables, 0/157 constraints. Problems are: Problem set: 7 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 120/120 variables, and 157 constraints, problems are : Problem set: 7 solved, 2 unsolved in 187 ms.
Refiners :[Domain max(s): 64/64 constraints, Positive P Invariants (semi-flows): 15/15 constraints, State Equation: 64/64 constraints, ReadFeed: 12/12 constraints, PredecessorRefiner: 2/9 constraints, Known Traps: 0/0 constraints]
After SMT, in 509ms problems are : Problem set: 7 solved, 2 unsolved
Parikh walk visited 0 properties in 102 ms.
Support contains 4 out of 64 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 64/64 places, 56/56 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 64 transition count 54
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 62 transition count 54
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 4 place count 62 transition count 52
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 8 place count 60 transition count 52
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 9 place count 59 transition count 51
Iterating global reduction 2 with 1 rules applied. Total rules applied 10 place count 59 transition count 51
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 2 with 6 rules applied. Total rules applied 16 place count 56 transition count 48
Free-agglomeration rule applied 7 times.
Iterating global reduction 2 with 7 rules applied. Total rules applied 23 place count 56 transition count 41
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 2 with 7 rules applied. Total rules applied 30 place count 49 transition count 41
Applied a total of 30 rules in 48 ms. Remains 49 /64 variables (removed 15) and now considering 41/56 (removed 15) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 48 ms. Remains : 49/64 places, 41/56 transitions.
RANDOM walk for 38598 steps (1014 resets) in 127 ms. (301 steps per ms) remains 0/2 properties
Successfully simplified 7 atomic propositions for a total of 16 simplifications.
Initial state reduction rules removed 1 formulas.
FORMULA Parking-PT-104-CTLFireability-2024-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-25 16:36:30] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2024-05-25 16:36:30] [INFO ] Flatten gal took : 12 ms
FORMULA Parking-PT-104-CTLFireability-2024-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-25 16:36:30] [INFO ] Flatten gal took : 10 ms
[2024-05-25 16:36:30] [INFO ] Input system was already deterministic with 56 transitions.
Support contains 43 out of 64 places (down from 45) after GAL structural reductions.
FORMULA Parking-PT-104-CTLFireability-2024-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 1 stabilizing places and 1 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 64/64 places, 56/56 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 63 transition count 55
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 63 transition count 55
Applied a total of 2 rules in 6 ms. Remains 63 /64 variables (removed 1) and now considering 55/56 (removed 1) transitions.
// Phase 1: matrix 55 rows 63 cols
[2024-05-25 16:36:30] [INFO ] Computed 15 invariants in 5 ms
[2024-05-25 16:36:30] [INFO ] Implicit Places using invariants in 92 ms returned [24, 39, 47, 57, 59]
Discarding 5 places :
Implicit Place search using SMT only with invariants took 93 ms to find 5 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 58/64 places, 55/56 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 54 transition count 51
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 54 transition count 51
Applied a total of 8 rules in 6 ms. Remains 54 /58 variables (removed 4) and now considering 51/55 (removed 4) transitions.
// Phase 1: matrix 51 rows 54 cols
[2024-05-25 16:36:30] [INFO ] Computed 10 invariants in 1 ms
[2024-05-25 16:36:30] [INFO ] Implicit Places using invariants in 73 ms returned []
[2024-05-25 16:36:30] [INFO ] Invariant cache hit.
[2024-05-25 16:36:30] [INFO ] State equation strengthened by 12 read => feed constraints.
[2024-05-25 16:36:30] [INFO ] Implicit Places using invariants and state equation in 109 ms returned []
Implicit Place search using SMT with State Equation took 184 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 54/64 places, 51/56 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 289 ms. Remains : 54/64 places, 51/56 transitions.
[2024-05-25 16:36:30] [INFO ] Flatten gal took : 6 ms
[2024-05-25 16:36:30] [INFO ] Flatten gal took : 6 ms
[2024-05-25 16:36:30] [INFO ] Input system was already deterministic with 51 transitions.
[2024-05-25 16:36:30] [INFO ] Flatten gal took : 5 ms
[2024-05-25 16:36:30] [INFO ] Flatten gal took : 5 ms
[2024-05-25 16:36:30] [INFO ] Time to serialize gal into /tmp/CTLFireability9098435734649315530.gal : 3 ms
[2024-05-25 16:36:30] [INFO ] Time to serialize properties into /tmp/CTLFireability13956647011187503486.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability9098435734649315530.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability13956647011187503486.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,24065,0.032072,3932,2,232,5,1973,6,0,269,2137,0


Converting to forward existential form...Done !
original formula: EX(TRUE)
=> equivalent forward existential formula: [(EY(Init) * TRUE)] != FALSE
(forward)formula 0,1,0.033686,3932,1,0,6,1973,7,1,360,2137,1
FORMULA Parking-PT-104-CTLFireability-2024-00 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

***************************************

Starting structural reductions in SI_CTL mode, iteration 0 : 64/64 places, 56/56 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 64 transition count 55
Reduce places removed 1 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 2 rules applied. Total rules applied 3 place count 63 transition count 54
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 4 place count 62 transition count 54
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 4 place count 62 transition count 53
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 6 place count 61 transition count 53
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 7 place count 60 transition count 52
Iterating global reduction 3 with 1 rules applied. Total rules applied 8 place count 60 transition count 52
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 10 place count 59 transition count 51
Applied a total of 10 rules in 17 ms. Remains 59 /64 variables (removed 5) and now considering 51/56 (removed 5) transitions.
// Phase 1: matrix 51 rows 59 cols
[2024-05-25 16:36:30] [INFO ] Computed 15 invariants in 3 ms
[2024-05-25 16:36:30] [INFO ] Implicit Places using invariants in 82 ms returned [24, 37, 44, 54]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 83 ms to find 4 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 55/64 places, 51/56 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 53 transition count 49
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 53 transition count 49
Applied a total of 4 rules in 7 ms. Remains 53 /55 variables (removed 2) and now considering 49/51 (removed 2) transitions.
// Phase 1: matrix 49 rows 53 cols
[2024-05-25 16:36:30] [INFO ] Computed 11 invariants in 1 ms
[2024-05-25 16:36:30] [INFO ] Implicit Places using invariants in 58 ms returned []
[2024-05-25 16:36:30] [INFO ] Invariant cache hit.
[2024-05-25 16:36:30] [INFO ] State equation strengthened by 16 read => feed constraints.
[2024-05-25 16:36:30] [INFO ] Implicit Places using invariants and state equation in 104 ms returned []
Implicit Place search using SMT with State Equation took 166 ms to find 0 implicit places.
Starting structural reductions in SI_CTL mode, iteration 2 : 53/64 places, 49/56 transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 274 ms. Remains : 53/64 places, 49/56 transitions.
[2024-05-25 16:36:30] [INFO ] Flatten gal took : 5 ms
[2024-05-25 16:36:30] [INFO ] Flatten gal took : 5 ms
[2024-05-25 16:36:31] [INFO ] Input system was already deterministic with 49 transitions.
[2024-05-25 16:36:31] [INFO ] Flatten gal took : 4 ms
[2024-05-25 16:36:31] [INFO ] Flatten gal took : 4 ms
[2024-05-25 16:36:31] [INFO ] Time to serialize gal into /tmp/CTLFireability4398623651059609544.gal : 2 ms
[2024-05-25 16:36:31] [INFO ] Time to serialize properties into /tmp/CTLFireability11708424133936321614.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability4398623651059609544.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability11708424133936321614.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,16897,0.017642,3996,2,262,5,1975,6,0,263,1951,0


Converting to forward existential form...Done !
original formula: A(((p17==1)&&(p60==1)) U (AF((p45==1)) + EG(((A(((p16==1)&&(p53==1)) U ((p41==1)&&(p60==1))) * (p13==1)) * (p57==1)))))
=> equivalent forward existential formula: [((Init * !(EG(!((!(EG(!((p45==1)))) + EG(((!((E(!(((p41==1)&&(p60==1))) U (!(((p16==1)&&(p53==1))) * !(((p41==1...625
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Hit Full ! (commute/partial/dont) 47/0/2
Hit Full ! (commute/partial/dont) 40/0/9
Hit Full ! (commute/partial/dont) 40/0/9
Using saturation style SCC detection
(forward)formula 0,0,0.549394,21300,1,0,69,124806,45,49,1407,75629,61
FORMULA Parking-PT-104-CTLFireability-2024-02 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

***************************************

Starting structural reductions in LTL mode, iteration 0 : 64/64 places, 56/56 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 63 transition count 55
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 63 transition count 55
Applied a total of 2 rules in 4 ms. Remains 63 /64 variables (removed 1) and now considering 55/56 (removed 1) transitions.
// Phase 1: matrix 55 rows 63 cols
[2024-05-25 16:36:31] [INFO ] Computed 15 invariants in 1 ms
[2024-05-25 16:36:31] [INFO ] Implicit Places using invariants in 119 ms returned [24, 39, 47, 57]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 120 ms to find 4 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 59/64 places, 55/56 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 56 transition count 52
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 56 transition count 52
Applied a total of 6 rules in 4 ms. Remains 56 /59 variables (removed 3) and now considering 52/55 (removed 3) transitions.
// Phase 1: matrix 52 rows 56 cols
[2024-05-25 16:36:31] [INFO ] Computed 11 invariants in 0 ms
[2024-05-25 16:36:31] [INFO ] Implicit Places using invariants in 56 ms returned []
[2024-05-25 16:36:31] [INFO ] Invariant cache hit.
[2024-05-25 16:36:31] [INFO ] State equation strengthened by 12 read => feed constraints.
[2024-05-25 16:36:31] [INFO ] Implicit Places using invariants and state equation in 114 ms returned []
Implicit Place search using SMT with State Equation took 172 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 56/64 places, 52/56 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 301 ms. Remains : 56/64 places, 52/56 transitions.
[2024-05-25 16:36:31] [INFO ] Flatten gal took : 4 ms
[2024-05-25 16:36:31] [INFO ] Flatten gal took : 4 ms
[2024-05-25 16:36:31] [INFO ] Input system was already deterministic with 52 transitions.
[2024-05-25 16:36:31] [INFO ] Flatten gal took : 5 ms
[2024-05-25 16:36:31] [INFO ] Flatten gal took : 4 ms
[2024-05-25 16:36:31] [INFO ] Time to serialize gal into /tmp/CTLFireability15869654083780085993.gal : 2 ms
[2024-05-25 16:36:31] [INFO ] Time to serialize properties into /tmp/CTLFireability14385083322836715769.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability15869654083780085993.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability14385083322836715769.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...285
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,24833,0.021317,4016,2,269,5,2249,6,0,278,2409,0


Converting to forward existential form...Done !
original formula: AG((EF(AX((p10==0))) + (AG(((p41==1)&&(p60==1))) * (AX((p44==1)) + ((p10==1)&&(p34==1))))))
=> equivalent forward existential formula: ([(FwdU((FwdU(Init,TRUE) * !(E(TRUE U !(EX(!((p10==0))))))),TRUE) * !(((p41==1)&&(p60==1))))] = FALSE * [(EY(((F...257
Reverse transition relation is NOT exact ! Due to transitions t2, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0...163
(forward)formula 0,1,0.087528,6656,1,0,106,14414,130,55,1696,9161,120
FORMULA Parking-PT-104-CTLFireability-2024-03 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

***************************************

Starting structural reductions in SI_CTL mode, iteration 0 : 64/64 places, 56/56 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 64 transition count 55
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 63 transition count 55
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 63 transition count 54
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 4 place count 62 transition count 54
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 5 place count 61 transition count 53
Iterating global reduction 2 with 1 rules applied. Total rules applied 6 place count 61 transition count 53
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
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 8 place count 60 transition count 52
Applied a total of 8 rules in 15 ms. Remains 60 /64 variables (removed 4) and now considering 52/56 (removed 4) transitions.
// Phase 1: matrix 52 rows 60 cols
[2024-05-25 16:36:32] [INFO ] Computed 15 invariants in 0 ms
[2024-05-25 16:36:32] [INFO ] Implicit Places using invariants in 70 ms returned [24, 37, 55, 57]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 71 ms to find 4 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 56/64 places, 52/56 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 53 transition count 49
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 53 transition count 49
Applied a total of 6 rules in 7 ms. Remains 53 /56 variables (removed 3) and now considering 49/52 (removed 3) transitions.
// Phase 1: matrix 49 rows 53 cols
[2024-05-25 16:36:32] [INFO ] Computed 11 invariants in 0 ms
[2024-05-25 16:36:32] [INFO ] Implicit Places using invariants in 52 ms returned []
[2024-05-25 16:36:32] [INFO ] Invariant cache hit.
[2024-05-25 16:36:32] [INFO ] State equation strengthened by 16 read => feed constraints.
[2024-05-25 16:36:32] [INFO ] Implicit Places using invariants and state equation in 109 ms returned []
Implicit Place search using SMT with State Equation took 164 ms to find 0 implicit places.
Starting structural reductions in SI_CTL mode, iteration 2 : 53/64 places, 49/56 transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 257 ms. Remains : 53/64 places, 49/56 transitions.
[2024-05-25 16:36:32] [INFO ] Flatten gal took : 4 ms
[2024-05-25 16:36:32] [INFO ] Flatten gal took : 4 ms
[2024-05-25 16:36:32] [INFO ] Input system was already deterministic with 49 transitions.
[2024-05-25 16:36:32] [INFO ] Flatten gal took : 4 ms
[2024-05-25 16:36:32] [INFO ] Flatten gal took : 4 ms
[2024-05-25 16:36:32] [INFO ] Time to serialize gal into /tmp/CTLFireability15648819756220837664.gal : 1 ms
[2024-05-25 16:36:32] [INFO ] Time to serialize properties into /tmp/CTLFireability7763119490414943848.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability15648819756220837664.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability7763119490414943848.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,16897,0.017887,3988,2,255,5,1841,6,0,263,2042,0


Converting to forward existential form...Done !
original formula: A(EG(((p48==1)&&(p59==1))) U E(((p20==1) + EF(EG((p44==1)))) U AG((p2==1))))
=> equivalent forward existential formula: [((Init * !(EG(!(E(((p20==1) + E(TRUE U EG((p44==1)))) U !(E(TRUE U !((p2==1))))))))) * !(E(!(E(((p20==1) + E(TR...317
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
(forward)formula 0,0,0.072048,5836,1,0,12,13245,35,4,1303,4281,13
FORMULA Parking-PT-104-CTLFireability-2024-04 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

***************************************

Starting structural reductions in LTL mode, iteration 0 : 64/64 places, 56/56 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 63 transition count 55
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 63 transition count 55
Applied a total of 2 rules in 3 ms. Remains 63 /64 variables (removed 1) and now considering 55/56 (removed 1) transitions.
// Phase 1: matrix 55 rows 63 cols
[2024-05-25 16:36:32] [INFO ] Computed 15 invariants in 1 ms
[2024-05-25 16:36:32] [INFO ] Implicit Places using invariants in 74 ms returned [24, 39, 47, 57, 59]
Discarding 5 places :
Implicit Place search using SMT only with invariants took 76 ms to find 5 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 58/64 places, 55/56 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 54 transition count 51
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 54 transition count 51
Applied a total of 8 rules in 4 ms. Remains 54 /58 variables (removed 4) and now considering 51/55 (removed 4) transitions.
// Phase 1: matrix 51 rows 54 cols
[2024-05-25 16:36:32] [INFO ] Computed 10 invariants in 0 ms
[2024-05-25 16:36:32] [INFO ] Implicit Places using invariants in 53 ms returned []
[2024-05-25 16:36:32] [INFO ] Invariant cache hit.
[2024-05-25 16:36:32] [INFO ] State equation strengthened by 12 read => feed constraints.
[2024-05-25 16:36:32] [INFO ] Implicit Places using invariants and state equation in 82 ms returned []
Implicit Place search using SMT with State Equation took 137 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 54/64 places, 51/56 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 220 ms. Remains : 54/64 places, 51/56 transitions.
[2024-05-25 16:36:32] [INFO ] Flatten gal took : 3 ms
[2024-05-25 16:36:32] [INFO ] Flatten gal took : 3 ms
[2024-05-25 16:36:32] [INFO ] Input system was already deterministic with 51 transitions.
[2024-05-25 16:36:32] [INFO ] Flatten gal took : 4 ms
[2024-05-25 16:36:32] [INFO ] Flatten gal took : 4 ms
[2024-05-25 16:36:32] [INFO ] Time to serialize gal into /tmp/CTLFireability2505969626920147827.gal : 1 ms
[2024-05-25 16:36:32] [INFO ] Time to serialize properties into /tmp/CTLFireability2973808428045513680.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability2505969626920147827.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability2973808428045513680.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,24065,0.018416,4008,2,232,5,1973,6,0,269,2137,0


Converting to forward existential form...Done !
original formula: AX(A(!(((((p7==1)&&(p31==1))&&(p4==1)) + AF(((p35==1)&&(p64==1))))) U !(AF((p28==1)))))
=> equivalent forward existential formula: ([((FwdU(EY(Init),!(!(!(EG(!((p28==1))))))) * !(!(((((p7==1)&&(p31==1))&&(p4==1)) + !(EG(!(((p35==1)&&(p64==1)))...245
Reverse transition relation is NOT exact ! Due to transitions t2, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0...163
(forward)formula 0,1,0.555714,21728,1,0,476,125876,138,243,1576,83485,598
FORMULA Parking-PT-104-CTLFireability-2024-05 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

***************************************

Starting structural reductions in SI_CTL mode, iteration 0 : 64/64 places, 56/56 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 64 transition count 54
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 62 transition count 54
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 4 place count 62 transition count 52
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 8 place count 60 transition count 52
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 9 place count 59 transition count 51
Iterating global reduction 2 with 1 rules applied. Total rules applied 10 place count 59 transition count 51
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 12 place count 58 transition count 50
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 13 place count 58 transition count 50
Applied a total of 13 rules in 12 ms. Remains 58 /64 variables (removed 6) and now considering 50/56 (removed 6) transitions.
// Phase 1: matrix 50 rows 58 cols
[2024-05-25 16:36:33] [INFO ] Computed 15 invariants in 1 ms
[2024-05-25 16:36:33] [INFO ] Implicit Places using invariants in 59 ms returned [24, 37, 43, 53]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 59 ms to find 4 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 54/64 places, 50/56 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 51 transition count 47
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 51 transition count 47
Applied a total of 6 rules in 4 ms. Remains 51 /54 variables (removed 3) and now considering 47/50 (removed 3) transitions.
// Phase 1: matrix 47 rows 51 cols
[2024-05-25 16:36:33] [INFO ] Computed 11 invariants in 1 ms
[2024-05-25 16:36:33] [INFO ] Implicit Places using invariants in 50 ms returned []
[2024-05-25 16:36:33] [INFO ] Invariant cache hit.
[2024-05-25 16:36:33] [INFO ] State equation strengthened by 17 read => feed constraints.
[2024-05-25 16:36:33] [INFO ] Implicit Places using invariants and state equation in 92 ms returned []
Implicit Place search using SMT with State Equation took 144 ms to find 0 implicit places.
Starting structural reductions in SI_CTL mode, iteration 2 : 51/64 places, 47/56 transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 220 ms. Remains : 51/64 places, 47/56 transitions.
[2024-05-25 16:36:33] [INFO ] Flatten gal took : 3 ms
[2024-05-25 16:36:33] [INFO ] Flatten gal took : 3 ms
[2024-05-25 16:36:33] [INFO ] Input system was already deterministic with 47 transitions.
[2024-05-25 16:36:33] [INFO ] Flatten gal took : 3 ms
[2024-05-25 16:36:33] [INFO ] Flatten gal took : 3 ms
[2024-05-25 16:36:33] [INFO ] Time to serialize gal into /tmp/CTLFireability8859121260199954251.gal : 3 ms
[2024-05-25 16:36:33] [INFO ] Time to serialize properties into /tmp/CTLFireability8823192290014072309.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability8859121260199954251.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability8823192290014072309.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,15873,0.016617,3984,2,254,5,1953,6,0,253,1977,0


Converting to forward existential form...Done !
original formula: EF(EG((((p41==1)&&(p60==1)) * ((AG(((p2==1)&&(p18==1))) + ((p2==1)&&(p18==1))) + ((p15==1)&&(p47==1))))))
=> equivalent forward existential formula: [FwdG(FwdU(Init,TRUE),(((p41==1)&&(p60==1)) * ((!(E(TRUE U !(((p2==1)&&(p18==1))))) + ((p2==1)&&(p18==1))) + ((p...185
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
(forward)formula 0,0,0.044562,5040,1,0,13,6744,23,4,1265,3018,11
FORMULA Parking-PT-104-CTLFireability-2024-07 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

***************************************

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in SI_CTL mode, iteration 0 : 64/64 places, 56/56 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 64 transition count 54
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 62 transition count 54
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 4 place count 62 transition count 52
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 8 place count 60 transition count 52
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 9 place count 59 transition count 51
Iterating global reduction 2 with 1 rules applied. Total rules applied 10 place count 59 transition count 51
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 12 place count 58 transition count 50
Applied a total of 12 rules in 8 ms. Remains 58 /64 variables (removed 6) and now considering 50/56 (removed 6) transitions.
// Phase 1: matrix 50 rows 58 cols
[2024-05-25 16:36:33] [INFO ] Computed 15 invariants in 0 ms
[2024-05-25 16:36:33] [INFO ] Implicit Places using invariants in 78 ms returned [24, 37, 43, 53, 55]
Discarding 5 places :
Implicit Place search using SMT only with invariants took 80 ms to find 5 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 53/64 places, 50/56 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 49 transition count 46
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 49 transition count 46
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 10 place count 48 transition count 45
Applied a total of 10 rules in 11 ms. Remains 48 /53 variables (removed 5) and now considering 45/50 (removed 5) transitions.
// Phase 1: matrix 45 rows 48 cols
[2024-05-25 16:36:33] [INFO ] Computed 10 invariants in 1 ms
[2024-05-25 16:36:33] [INFO ] Implicit Places using invariants in 84 ms returned []
[2024-05-25 16:36:33] [INFO ] Invariant cache hit.
[2024-05-25 16:36:33] [INFO ] State equation strengthened by 16 read => feed constraints.
[2024-05-25 16:36:33] [INFO ] Implicit Places using invariants and state equation in 114 ms returned []
Implicit Place search using SMT with State Equation took 224 ms to find 0 implicit places.
Starting structural reductions in SI_CTL mode, iteration 2 : 48/64 places, 45/56 transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 326 ms. Remains : 48/64 places, 45/56 transitions.
[2024-05-25 16:36:33] [INFO ] Flatten gal took : 3 ms
[2024-05-25 16:36:33] [INFO ] Flatten gal took : 3 ms
[2024-05-25 16:36:33] [INFO ] Input system was already deterministic with 45 transitions.
[2024-05-25 16:36:33] [INFO ] Flatten gal took : 4 ms
[2024-05-25 16:36:33] [INFO ] Flatten gal took : 3 ms
[2024-05-25 16:36:33] [INFO ] Time to serialize gal into /tmp/CTLFireability16324403095338254967.gal : 1 ms
[2024-05-25 16:36:33] [INFO ] Time to serialize properties into /tmp/CTLFireability7402396842483967117.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability16324403095338254967.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability7402396842483967117.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,14849,0.022848,3644,2,224,5,1560,6,0,239,1556,0


Converting to forward existential form...Done !
original formula: AF(AG(E(EF((p0==1)) U !(EF(((p4==1)&&(p50==1)))))))
=> equivalent forward existential formula: [FwdG(Init,!(!(E(TRUE U !(E(E(TRUE U (p0==1)) U !(E(TRUE U ((p4==1)&&(p50==1))))))))))] = FALSE
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
(forward)formula 0,0,0.289807,10560,1,0,73,41338,24,51,1185,41171,62
FORMULA Parking-PT-104-CTLFireability-2024-09 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

***************************************

Starting structural reductions in LTL mode, iteration 0 : 64/64 places, 56/56 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 63 transition count 55
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 63 transition count 55
Applied a total of 2 rules in 2 ms. Remains 63 /64 variables (removed 1) and now considering 55/56 (removed 1) transitions.
// Phase 1: matrix 55 rows 63 cols
[2024-05-25 16:36:34] [INFO ] Computed 15 invariants in 0 ms
[2024-05-25 16:36:34] [INFO ] Implicit Places using invariants in 68 ms returned [39, 47, 57]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 69 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 60/64 places, 55/56 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 59 transition count 54
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 59 transition count 54
Applied a total of 2 rules in 2 ms. Remains 59 /60 variables (removed 1) and now considering 54/55 (removed 1) transitions.
// Phase 1: matrix 54 rows 59 cols
[2024-05-25 16:36:34] [INFO ] Computed 12 invariants in 1 ms
[2024-05-25 16:36:34] [INFO ] Implicit Places using invariants in 59 ms returned []
[2024-05-25 16:36:34] [INFO ] Invariant cache hit.
[2024-05-25 16:36:34] [INFO ] State equation strengthened by 12 read => feed constraints.
[2024-05-25 16:36:34] [INFO ] Implicit Places using invariants and state equation in 150 ms returned []
Implicit Place search using SMT with State Equation took 212 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 59/64 places, 54/56 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 285 ms. Remains : 59/64 places, 54/56 transitions.
[2024-05-25 16:36:34] [INFO ] Flatten gal took : 6 ms
[2024-05-25 16:36:34] [INFO ] Flatten gal took : 6 ms
[2024-05-25 16:36:34] [INFO ] Input system was already deterministic with 54 transitions.
[2024-05-25 16:36:34] [INFO ] Flatten gal took : 6 ms
[2024-05-25 16:36:34] [INFO ] Flatten gal took : 5 ms
[2024-05-25 16:36:34] [INFO ] Time to serialize gal into /tmp/CTLFireability18160847653918220778.gal : 5 ms
[2024-05-25 16:36:34] [INFO ] Time to serialize properties into /tmp/CTLFireability15537947522724292223.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability18160847653918220778.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability15537947522724292223.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...285
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,26369,0.032742,4040,2,357,5,2162,6,0,292,1891,0


Converting to forward existential form...Done !
original formula: A((p37!=1) U !((!((AF((p28==1)) + AF(AX(((p33==1)&&(p60==1)))))) * !(((A((((p25==1)&&(p60==1))||((p29==1)&&(p64==1))) U E((p8==1) U ((p24...265
=> equivalent forward existential formula: [((Init * !(EG(!(!((!((!(EG(!((p28==1)))) + !(EG(!(!(EX(!(((p33==1)&&(p60==1)))))))))) * !(((!((E(!(E((p8==1) U ...1147
Reverse transition relation is NOT exact ! Due to transitions t2, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0...163
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 0
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 0
(forward)formula 0,0,2.66718,67588,1,0,938,465924,158,606,1831,296513,1091
FORMULA Parking-PT-104-CTLFireability-2024-10 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

***************************************

Starting structural reductions in SI_CTL mode, iteration 0 : 64/64 places, 56/56 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 63 transition count 53
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 61 transition count 53
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 4 place count 61 transition count 51
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 8 place count 59 transition count 51
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 9 place count 58 transition count 50
Iterating global reduction 2 with 1 rules applied. Total rules applied 10 place count 58 transition count 50
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 12 place count 57 transition count 49
Applied a total of 12 rules in 10 ms. Remains 57 /64 variables (removed 7) and now considering 49/56 (removed 7) transitions.
// Phase 1: matrix 49 rows 57 cols
[2024-05-25 16:36:37] [INFO ] Computed 15 invariants in 1 ms
[2024-05-25 16:36:37] [INFO ] Implicit Places using invariants in 71 ms returned [23, 36, 42, 52, 54]
Discarding 5 places :
Implicit Place search using SMT only with invariants took 73 ms to find 5 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 52/64 places, 49/56 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 48 transition count 45
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 48 transition count 45
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 10 place count 47 transition count 44
Applied a total of 10 rules in 4 ms. Remains 47 /52 variables (removed 5) and now considering 44/49 (removed 5) transitions.
// Phase 1: matrix 44 rows 47 cols
[2024-05-25 16:36:37] [INFO ] Computed 10 invariants in 1 ms
[2024-05-25 16:36:37] [INFO ] Implicit Places using invariants in 45 ms returned []
[2024-05-25 16:36:37] [INFO ] Invariant cache hit.
[2024-05-25 16:36:37] [INFO ] Implicit Places using invariants and state equation in 74 ms returned []
Implicit Place search using SMT with State Equation took 121 ms to find 0 implicit places.
Starting structural reductions in SI_CTL mode, iteration 2 : 47/64 places, 44/56 transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 208 ms. Remains : 47/64 places, 44/56 transitions.
[2024-05-25 16:36:37] [INFO ] Flatten gal took : 3 ms
[2024-05-25 16:36:37] [INFO ] Flatten gal took : 3 ms
[2024-05-25 16:36:37] [INFO ] Input system was already deterministic with 44 transitions.
[2024-05-25 16:36:37] [INFO ] Flatten gal took : 2 ms
[2024-05-25 16:36:37] [INFO ] Flatten gal took : 3 ms
[2024-05-25 16:36:37] [INFO ] Time to serialize gal into /tmp/CTLFireability1725004466778497331.gal : 1 ms
[2024-05-25 16:36:37] [INFO ] Time to serialize properties into /tmp/CTLFireability17500124032516294995.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability1725004466778497331.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability17500124032516294995.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,14848,0.023506,3632,2,134,5,1231,6,0,235,1206,0


Converting to forward existential form...Done !
original formula: AF(AG(AF(((p9==0)||(p56==0)))))
=> equivalent forward existential formula: [FwdG(Init,!(!(E(TRUE U !(!(EG(!(((p9==0)||(p56==0))))))))))] = FALSE
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
(forward)formula 0,1,0.064934,4476,1,0,8,7023,26,3,1067,2799,5
FORMULA Parking-PT-104-CTLFireability-2024-11 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

***************************************

Starting structural reductions in LTL mode, iteration 0 : 64/64 places, 56/56 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 63 transition count 55
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 63 transition count 55
Applied a total of 2 rules in 1 ms. Remains 63 /64 variables (removed 1) and now considering 55/56 (removed 1) transitions.
// Phase 1: matrix 55 rows 63 cols
[2024-05-25 16:36:37] [INFO ] Computed 15 invariants in 1 ms
[2024-05-25 16:36:37] [INFO ] Implicit Places using invariants in 91 ms returned [24, 39, 47, 57, 59]
Discarding 5 places :
Implicit Place search using SMT only with invariants took 92 ms to find 5 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 58/64 places, 55/56 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 54 transition count 51
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 54 transition count 51
Applied a total of 8 rules in 2 ms. Remains 54 /58 variables (removed 4) and now considering 51/55 (removed 4) transitions.
// Phase 1: matrix 51 rows 54 cols
[2024-05-25 16:36:37] [INFO ] Computed 10 invariants in 1 ms
[2024-05-25 16:36:37] [INFO ] Implicit Places using invariants in 49 ms returned []
[2024-05-25 16:36:37] [INFO ] Invariant cache hit.
[2024-05-25 16:36:37] [INFO ] State equation strengthened by 12 read => feed constraints.
[2024-05-25 16:36:37] [INFO ] Implicit Places using invariants and state equation in 89 ms returned []
Implicit Place search using SMT with State Equation took 140 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 54/64 places, 51/56 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 235 ms. Remains : 54/64 places, 51/56 transitions.
[2024-05-25 16:36:37] [INFO ] Flatten gal took : 2 ms
[2024-05-25 16:36:37] [INFO ] Flatten gal took : 2 ms
[2024-05-25 16:36:37] [INFO ] Input system was already deterministic with 51 transitions.
[2024-05-25 16:36:37] [INFO ] Flatten gal took : 3 ms
[2024-05-25 16:36:37] [INFO ] Flatten gal took : 3 ms
[2024-05-25 16:36:37] [INFO ] Time to serialize gal into /tmp/CTLFireability6931239880211466989.gal : 5 ms
[2024-05-25 16:36:37] [INFO ] Time to serialize properties into /tmp/CTLFireability7504829678818298313.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability6931239880211466989.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability7504829678818298313.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,24065,0.022383,4000,2,232,5,1973,6,0,269,2137,0


Converting to forward existential form...Done !
original formula: AG(E(EF(AX((p4==1))) U ((p15==1)&&(p47==1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(E(TRUE U !(EX(!((p4==1))))) U ((p15==1)&&(p47==1)))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t2, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0...163
(forward)formula 0,0,0.147042,7696,1,0,110,25890,123,57,1606,15918,129
FORMULA Parking-PT-104-CTLFireability-2023-12 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

***************************************

Starting structural reductions in LTL mode, iteration 0 : 64/64 places, 56/56 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 63 transition count 55
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 63 transition count 55
Applied a total of 2 rules in 2 ms. Remains 63 /64 variables (removed 1) and now considering 55/56 (removed 1) transitions.
// Phase 1: matrix 55 rows 63 cols
[2024-05-25 16:36:37] [INFO ] Computed 15 invariants in 1 ms
[2024-05-25 16:36:37] [INFO ] Implicit Places using invariants in 84 ms returned [24, 47, 57, 59]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 89 ms to find 4 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 59/64 places, 55/56 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 56 transition count 52
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 56 transition count 52
Applied a total of 6 rules in 3 ms. Remains 56 /59 variables (removed 3) and now considering 52/55 (removed 3) transitions.
// Phase 1: matrix 52 rows 56 cols
[2024-05-25 16:36:38] [INFO ] Computed 11 invariants in 1 ms
[2024-05-25 16:36:38] [INFO ] Implicit Places using invariants in 56 ms returned []
[2024-05-25 16:36:38] [INFO ] Invariant cache hit.
[2024-05-25 16:36:38] [INFO ] State equation strengthened by 12 read => feed constraints.
[2024-05-25 16:36:38] [INFO ] Implicit Places using invariants and state equation in 86 ms returned []
Implicit Place search using SMT with State Equation took 143 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 56/64 places, 52/56 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 238 ms. Remains : 56/64 places, 52/56 transitions.
[2024-05-25 16:36:38] [INFO ] Flatten gal took : 4 ms
[2024-05-25 16:36:38] [INFO ] Flatten gal took : 3 ms
[2024-05-25 16:36:38] [INFO ] Input system was already deterministic with 52 transitions.
[2024-05-25 16:36:38] [INFO ] Flatten gal took : 3 ms
[2024-05-25 16:36:38] [INFO ] Flatten gal took : 3 ms
[2024-05-25 16:36:38] [INFO ] Time to serialize gal into /tmp/CTLFireability12748241240779445940.gal : 1 ms
[2024-05-25 16:36:38] [INFO ] Time to serialize properties into /tmp/CTLFireability2144862281244389079.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability12748241240779445940.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability2144862281244389079.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,24833,0.021416,4012,2,273,5,2202,6,0,278,2363,0


Converting to forward existential form...Done !
original formula: AX(EX(E(EG(((p40==1)&&(p59==1))) U EX(((p46==1)&&(p64==1))))))
=> equivalent forward existential formula: [(EY(Init) * !(EX(E(EG(((p40==1)&&(p59==1))) U EX(((p46==1)&&(p64==1)))))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t2, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0...163
(forward)formula 0,0,0.087896,6388,1,0,135,14983,128,74,1623,8155,189
FORMULA Parking-PT-104-CTLFireability-2023-13 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

***************************************

Starting structural reductions in LTL mode, iteration 0 : 64/64 places, 56/56 transitions.
Applied a total of 0 rules in 1 ms. Remains 64 /64 variables (removed 0) and now considering 56/56 (removed 0) transitions.
// Phase 1: matrix 56 rows 64 cols
[2024-05-25 16:36:38] [INFO ] Computed 15 invariants in 1 ms
[2024-05-25 16:36:38] [INFO ] Implicit Places using invariants in 79 ms returned [24, 39, 47, 57, 59]
Discarding 5 places :
Implicit Place search using SMT only with invariants took 80 ms to find 5 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 59/64 places, 56/56 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 55 transition count 52
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 55 transition count 52
Applied a total of 8 rules in 1 ms. Remains 55 /59 variables (removed 4) and now considering 52/56 (removed 4) transitions.
// Phase 1: matrix 52 rows 55 cols
[2024-05-25 16:36:38] [INFO ] Computed 10 invariants in 1 ms
[2024-05-25 16:36:38] [INFO ] Implicit Places using invariants in 49 ms returned []
[2024-05-25 16:36:38] [INFO ] Invariant cache hit.
[2024-05-25 16:36:38] [INFO ] State equation strengthened by 12 read => feed constraints.
[2024-05-25 16:36:38] [INFO ] Implicit Places using invariants and state equation in 105 ms returned []
Implicit Place search using SMT with State Equation took 157 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 55/64 places, 52/56 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 239 ms. Remains : 55/64 places, 52/56 transitions.
[2024-05-25 16:36:38] [INFO ] Flatten gal took : 3 ms
[2024-05-25 16:36:38] [INFO ] Flatten gal took : 2 ms
[2024-05-25 16:36:38] [INFO ] Input system was already deterministic with 52 transitions.
[2024-05-25 16:36:38] [INFO ] Flatten gal took : 4 ms
[2024-05-25 16:36:38] [INFO ] Flatten gal took : 3 ms
[2024-05-25 16:36:38] [INFO ] Time to serialize gal into /tmp/CTLFireability9668471864884661737.gal : 1 ms
[2024-05-25 16:36:38] [INFO ] Time to serialize properties into /tmp/CTLFireability16016470389512174717.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability9668471864884661737.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability16016470389512174717.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,28673,0.033886,4008,2,309,5,2152,6,0,274,2652,0


Converting to forward existential form...Done !
original formula: AF((AG(AF((p36==1))) * (AX(AF((p61==0))) + EF((p44==0)))))
=> equivalent forward existential formula: [FwdG(Init,!((!(E(TRUE U !(!(EG(!((p36==1))))))) * (!(EX(!(!(EG(!((p61==0))))))) + E(TRUE U (p44==0))))))] = FAL...157
Reverse transition relation is NOT exact ! Due to transitions t2, t3, t29, t32, t35, t36, Intersection with reachable at each step enabled. (destroyed/rev...187
(forward)formula 0,0,0.80975,26140,1,0,418,155958,141,192,1763,113918,528
FORMULA Parking-PT-104-CTLFireability-2023-14 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

***************************************

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 64/64 places, 56/56 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 63 transition count 55
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 63 transition count 55
Applied a total of 2 rules in 1 ms. Remains 63 /64 variables (removed 1) and now considering 55/56 (removed 1) transitions.
// Phase 1: matrix 55 rows 63 cols
[2024-05-25 16:36:39] [INFO ] Computed 15 invariants in 2 ms
[2024-05-25 16:36:39] [INFO ] Implicit Places using invariants in 83 ms returned [24, 39, 47, 57]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 84 ms to find 4 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 59/64 places, 55/56 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 57 transition count 53
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 57 transition count 53
Applied a total of 4 rules in 1 ms. Remains 57 /59 variables (removed 2) and now considering 53/55 (removed 2) transitions.
// Phase 1: matrix 53 rows 57 cols
[2024-05-25 16:36:39] [INFO ] Computed 11 invariants in 0 ms
[2024-05-25 16:36:39] [INFO ] Implicit Places using invariants in 71 ms returned []
[2024-05-25 16:36:39] [INFO ] Invariant cache hit.
[2024-05-25 16:36:39] [INFO ] State equation strengthened by 12 read => feed constraints.
[2024-05-25 16:36:39] [INFO ] Implicit Places using invariants and state equation in 78 ms returned []
Implicit Place search using SMT with State Equation took 151 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 57/64 places, 53/56 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 237 ms. Remains : 57/64 places, 53/56 transitions.
[2024-05-25 16:36:39] [INFO ] Flatten gal took : 3 ms
[2024-05-25 16:36:39] [INFO ] Flatten gal took : 3 ms
[2024-05-25 16:36:39] [INFO ] Input system was already deterministic with 53 transitions.
[2024-05-25 16:36:39] [INFO ] Flatten gal took : 3 ms
[2024-05-25 16:36:39] [INFO ] Flatten gal took : 3 ms
[2024-05-25 16:36:39] [INFO ] Time to serialize gal into /tmp/CTLFireability15538555844294062207.gal : 9 ms
[2024-05-25 16:36:39] [INFO ] Time to serialize properties into /tmp/CTLFireability7446355605382990399.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability15538555844294062207.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability7446355605382990399.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,25601,0.021792,4024,2,260,5,2381,6,0,283,2724,0


Converting to forward existential form...Done !
original formula: AX((E((AF(((p2==1)&&(p19==1))) * EF(((p41==1)&&(p60==1)))) U ((p6==1)&&(p26==1))) * (EX(!(E((p36==1) U (p36==1)))) + (EG(((p9==0)||(p56==...197
=> equivalent forward existential formula: ([(EY(Init) * !(E((!(EG(!(((p2==1)&&(p19==1))))) * E(TRUE U ((p41==1)&&(p60==1)))) U ((p6==1)&&(p26==1)))))] = F...285
Reverse transition relation is NOT exact ! Due to transitions t2, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0...163
(forward)formula 0,0,0.853552,30440,1,0,502,183252,147,251,1757,130957,618
FORMULA Parking-PT-104-CTLFireability-2023-15 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

***************************************

[2024-05-25 16:36:40] [INFO ] Flatten gal took : 4 ms
[2024-05-25 16:36:40] [INFO ] Flatten gal took : 3 ms
Total runtime 13918 ms.

BK_STOP 1716655000556

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

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ CTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution CTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ 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//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination CTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

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="Parking-PT-104"
export BK_EXAMINATION="CTLFireability"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool itstools"
echo " Input is Parking-PT-104, examination is CTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r268-smll-171654406800058"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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