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.r136-tall-171631132500361.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 DiscoveryGPU-PT-06a, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r136-tall-171631132500361
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 500K
-rw-r--r-- 1 mcc users 6.8K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 74K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.9K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 56K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:42 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K May 18 16:42 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.7K Apr 22 14:40 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Apr 22 14:40 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Apr 22 14:40 LTLFireability.txt
-rw-r--r-- 1 mcc users 14K Apr 22 14:40 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Apr 12 01:48 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 132K Apr 12 01:48 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.1K Apr 12 01:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 83K Apr 12 01:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 22 14:40 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 22 14:40 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 22K 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 DiscoveryGPU-PT-06a-CTLCardinality-2024-00
FORMULA_NAME DiscoveryGPU-PT-06a-CTLCardinality-2024-01
FORMULA_NAME DiscoveryGPU-PT-06a-CTLCardinality-2024-02
FORMULA_NAME DiscoveryGPU-PT-06a-CTLCardinality-2024-03
FORMULA_NAME DiscoveryGPU-PT-06a-CTLCardinality-2024-04
FORMULA_NAME DiscoveryGPU-PT-06a-CTLCardinality-2024-05
FORMULA_NAME DiscoveryGPU-PT-06a-CTLCardinality-2024-06
FORMULA_NAME DiscoveryGPU-PT-06a-CTLCardinality-2024-07
FORMULA_NAME DiscoveryGPU-PT-06a-CTLCardinality-2024-08
FORMULA_NAME DiscoveryGPU-PT-06a-CTLCardinality-2024-09
FORMULA_NAME DiscoveryGPU-PT-06a-CTLCardinality-2024-10
FORMULA_NAME DiscoveryGPU-PT-06a-CTLCardinality-2024-11
FORMULA_NAME DiscoveryGPU-PT-06a-CTLCardinality-2023-12
FORMULA_NAME DiscoveryGPU-PT-06a-CTLCardinality-2023-13
FORMULA_NAME DiscoveryGPU-PT-06a-CTLCardinality-2023-14
FORMULA_NAME DiscoveryGPU-PT-06a-CTLCardinality-2023-15

=== Now, execution of the tool begins

BK_START 1716373614238

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=CTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=DiscoveryGPU-PT-06a
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
CTLCardinality PT
Running Version 202405141337
[2024-05-22 10:26:55] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-22 10:26:55] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-22 10:26:55] [INFO ] Load time of PNML (sax parser for PT used): 55 ms
[2024-05-22 10:26:55] [INFO ] Transformed 63 places.
[2024-05-22 10:26:55] [INFO ] Transformed 85 transitions.
[2024-05-22 10:26:55] [INFO ] Found NUPN structural information;
[2024-05-22 10:26:55] [INFO ] Parsed PT model containing 63 places and 85 transitions and 273 arcs in 155 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 16 ms.
Support contains 54 out of 63 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 63/63 places, 85/85 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 62 transition count 84
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 62 transition count 84
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 0 with 6 rules applied. Total rules applied 8 place count 62 transition count 78
Applied a total of 8 rules in 22 ms. Remains 62 /63 variables (removed 1) and now considering 78/85 (removed 7) transitions.
// Phase 1: matrix 78 rows 62 cols
[2024-05-22 10:26:55] [INFO ] Computed 2 invariants in 6 ms
[2024-05-22 10:26:55] [INFO ] Implicit Places using invariants in 160 ms returned []
[2024-05-22 10:26:55] [INFO ] Invariant cache hit.
[2024-05-22 10:26:55] [INFO ] State equation strengthened by 48 read => feed constraints.
[2024-05-22 10:26:55] [INFO ] Implicit Places using invariants and state equation in 72 ms returned []
Implicit Place search using SMT with State Equation took 261 ms to find 0 implicit places.
Running 77 sub problems to find dead transitions.
[2024-05-22 10:26:55] [INFO ] Invariant cache hit.
[2024-05-22 10:26:55] [INFO ] State equation strengthened by 48 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/61 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 1 (OVERLAPS) 1/62 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/62 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 3 (OVERLAPS) 78/140 variables, 62/64 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/140 variables, 48/112 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/140 variables, 0/112 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 6 (OVERLAPS) 0/140 variables, 0/112 constraints. Problems are: Problem set: 0 solved, 77 unsolved
No progress, stopping.
After SMT solving in domain Real declared 140/140 variables, and 112 constraints, problems are : Problem set: 0 solved, 77 unsolved in 1305 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 62/62 constraints, ReadFeed: 48/48 constraints, PredecessorRefiner: 77/77 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 77 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/61 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 1 (OVERLAPS) 1/62 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/62 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 3 (OVERLAPS) 78/140 variables, 62/64 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/140 variables, 48/112 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/140 variables, 77/189 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/140 variables, 0/189 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 7 (OVERLAPS) 0/140 variables, 0/189 constraints. Problems are: Problem set: 0 solved, 77 unsolved
No progress, stopping.
After SMT solving in domain Int declared 140/140 variables, and 189 constraints, problems are : Problem set: 0 solved, 77 unsolved in 1046 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 62/62 constraints, ReadFeed: 48/48 constraints, PredecessorRefiner: 77/77 constraints, Known Traps: 0/0 constraints]
After SMT, in 2389ms problems are : Problem set: 0 solved, 77 unsolved
Search for dead transitions found 0 dead transitions in 2407ms
Starting structural reductions in LTL mode, iteration 1 : 62/63 places, 78/85 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2714 ms. Remains : 62/63 places, 78/85 transitions.
Support contains 54 out of 62 places after structural reductions.
[2024-05-22 10:26:58] [INFO ] Flatten gal took : 23 ms
[2024-05-22 10:26:58] [INFO ] Flatten gal took : 8 ms
[2024-05-22 10:26:58] [INFO ] Input system was already deterministic with 78 transitions.
RANDOM walk for 8866 steps (136 resets) in 242 ms. (36 steps per ms) remains 0/59 properties
[2024-05-22 10:26:58] [INFO ] Flatten gal took : 5 ms
[2024-05-22 10:26:58] [INFO ] Flatten gal took : 19 ms
[2024-05-22 10:26:58] [INFO ] Input system was already deterministic with 78 transitions.
Computed a total of 9 stabilizing places and 7 stable transitions
Graph (complete) has 171 edges and 62 vertex of which 57 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.2 ms
Starting structural reductions in LTL mode, iteration 0 : 62/62 places, 78/78 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 57 transition count 73
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 57 transition count 73
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 15 place count 52 transition count 68
Iterating global reduction 0 with 5 rules applied. Total rules applied 20 place count 52 transition count 68
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 23 place count 49 transition count 65
Iterating global reduction 0 with 3 rules applied. Total rules applied 26 place count 49 transition count 65
Applied a total of 26 rules in 5 ms. Remains 49 /62 variables (removed 13) and now considering 65/78 (removed 13) transitions.
// Phase 1: matrix 65 rows 49 cols
[2024-05-22 10:26:58] [INFO ] Computed 2 invariants in 2 ms
[2024-05-22 10:26:58] [INFO ] Implicit Places using invariants in 38 ms returned []
[2024-05-22 10:26:58] [INFO ] Invariant cache hit.
[2024-05-22 10:26:58] [INFO ] State equation strengthened by 43 read => feed constraints.
[2024-05-22 10:26:58] [INFO ] Implicit Places using invariants and state equation in 60 ms returned [48]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 100 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 48/62 places, 65/78 transitions.
Applied a total of 0 rules in 1 ms. Remains 48 /48 variables (removed 0) and now considering 65/65 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 107 ms. Remains : 48/62 places, 65/78 transitions.
[2024-05-22 10:26:58] [INFO ] Flatten gal took : 9 ms
[2024-05-22 10:26:58] [INFO ] Flatten gal took : 3 ms
[2024-05-22 10:26:58] [INFO ] Input system was already deterministic with 65 transitions.
[2024-05-22 10:26:58] [INFO ] Flatten gal took : 3 ms
[2024-05-22 10:26:58] [INFO ] Flatten gal took : 3 ms
[2024-05-22 10:26:58] [INFO ] Time to serialize gal into /tmp/CTLCardinality17306927487920071390.gal : 2 ms
[2024-05-22 10:26:58] [INFO ] Time to serialize properties into /tmp/CTLCardinality10418118581637567689.ctl : 2 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/CTLCardinality17306927487920071390.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality10418118581637567689.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,1.12397e+06,0.070208,6368,2,1133,5,18256,6,0,250,12890,0


Converting to forward existential form...Done !
original formula: EX(E(AX(!(AG((p54==1)))) U (AX(!((((p36==0)||(p5==1))||((p8==0)||(p33==1))))) * (!(((p35==0)||(p16==1))) + !(EX(TRUE))))))
=> equivalent forward existential formula: ([((FwdU(EY(Init),!(EX(!(!(!(E(TRUE U !((p54==1))))))))) * !(EX(!(!((((p36==0)||(p5==1))||((p8==0)||(p33==1)))))...338
Reverse transition relation is NOT exact ! Due to transitions t5, t12, t16, t20, t22, t23, t25, t58, t59, t60, t61, t62, t63, t64, Intersection with reach...229
(forward)formula 0,1,0.439111,20740,1,0,107,94308,156,67,1601,101084,151
FORMULA DiscoveryGPU-PT-06a-CTLCardinality-2024-00 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 62/62 places, 78/78 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 60 transition count 76
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 60 transition count 76
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 6 place count 58 transition count 74
Iterating global reduction 0 with 2 rules applied. Total rules applied 8 place count 58 transition count 74
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 57 transition count 73
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 57 transition count 73
Applied a total of 10 rules in 4 ms. Remains 57 /62 variables (removed 5) and now considering 73/78 (removed 5) transitions.
// Phase 1: matrix 73 rows 57 cols
[2024-05-22 10:26:59] [INFO ] Computed 2 invariants in 2 ms
[2024-05-22 10:26:59] [INFO ] Implicit Places using invariants in 35 ms returned []
[2024-05-22 10:26:59] [INFO ] Invariant cache hit.
[2024-05-22 10:26:59] [INFO ] State equation strengthened by 46 read => feed constraints.
[2024-05-22 10:26:59] [INFO ] Implicit Places using invariants and state equation in 65 ms returned [56]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 102 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 56/62 places, 73/78 transitions.
Applied a total of 0 rules in 0 ms. Remains 56 /56 variables (removed 0) and now considering 73/73 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 106 ms. Remains : 56/62 places, 73/78 transitions.
[2024-05-22 10:26:59] [INFO ] Flatten gal took : 3 ms
[2024-05-22 10:26:59] [INFO ] Flatten gal took : 3 ms
[2024-05-22 10:26:59] [INFO ] Input system was already deterministic with 73 transitions.
[2024-05-22 10:26:59] [INFO ] Flatten gal took : 3 ms
[2024-05-22 10:26:59] [INFO ] Flatten gal took : 3 ms
[2024-05-22 10:26:59] [INFO ] Time to serialize gal into /tmp/CTLCardinality10361327444661148999.gal : 2 ms
[2024-05-22 10:26:59] [INFO ] Time to serialize properties into /tmp/CTLCardinality11497003897476706443.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/CTLCardinality10361327444661148999.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality11497003897476706443.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,1.58183e+06,0.035441,5172,2,678,5,9203,6,0,288,5975,0


Converting to forward existential form...Done !
original formula: E(!((((p27==0)||(p4==1)) + ((p3!=0) + (AF((p7!=0)) * AX(!(((p29==0)||(p11==1)))))))) U (A(A(EX((p54==1)) U (p30==0)) U ((!(((EG((p60==1))...322
=> equivalent forward existential formula: ([((FwdU(Init,!((((p27==0)||(p4==1)) + ((p3!=0) + (!(EG(!((p7!=0)))) * !(EX(!(!(((p29==0)||(p11==1))))))))))) * ...845
Reverse transition relation is NOT exact ! Due to transitions t9, t15, t21, t26, t60, t62, t64, t65, t66, t67, t68, t69, t70, t71, t72, Intersection with ...234
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.56441,90460,1,0,1200,477864,221,737,1817,685907,1424
FORMULA DiscoveryGPU-PT-06a-CTLCardinality-2024-01 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 : 62/62 places, 78/78 transitions.
Graph (complete) has 171 edges and 62 vertex of which 57 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.2 ms
Discarding 5 places :
Also discarding 5 output transitions
Drop transitions (Output transitions of discarded places.) removed 5 transitions
Reduce places removed 1 places and 1 transitions.
Reduce places removed 2 places and 0 transitions.
Graph (complete) has 60 edges and 54 vertex of which 43 are kept as prefixes of interest. Removing 11 places using SCC suffix rule.1 ms
Discarding 11 places :
Also discarding 11 output transitions
Drop transitions (Output transitions of discarded places.) removed 11 transitions
Graph (trivial) has 46 edges and 43 vertex of which 24 / 43 are part of one of the 12 SCC in 1 ms
Free SCC test removed 12 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 0 with 9 rules applied. Total rules applied 10 place count 31 transition count 56
Reduce places removed 5 places and 0 transitions.
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 1 with 17 rules applied. Total rules applied 27 place count 26 transition count 44
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 31 place count 22 transition count 36
Iterating global reduction 2 with 4 rules applied. Total rules applied 35 place count 22 transition count 36
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 38 place count 19 transition count 30
Iterating global reduction 2 with 3 rules applied. Total rules applied 41 place count 19 transition count 30
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 44 place count 16 transition count 24
Iterating global reduction 2 with 3 rules applied. Total rules applied 47 place count 16 transition count 24
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 50 place count 13 transition count 21
Iterating global reduction 2 with 3 rules applied. Total rules applied 53 place count 13 transition count 21
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 2 with 2 rules applied. Total rules applied 55 place count 13 transition count 19
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 2 with 1 rules applied. Total rules applied 56 place count 13 transition count 18
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 57 place count 12 transition count 18
Reduce places removed 3 places and 3 transitions.
Iterating global reduction 4 with 3 rules applied. Total rules applied 60 place count 9 transition count 15
Applied a total of 60 rules in 26 ms. Remains 9 /62 variables (removed 53) and now considering 15/78 (removed 63) transitions.
[2024-05-22 10:27:02] [INFO ] Flow matrix only has 11 transitions (discarded 4 similar events)
// Phase 1: matrix 11 rows 9 cols
[2024-05-22 10:27:02] [INFO ] Computed 0 invariants in 0 ms
[2024-05-22 10:27:02] [INFO ] Implicit Places using invariants in 14 ms returned []
[2024-05-22 10:27:02] [INFO ] Flow matrix only has 11 transitions (discarded 4 similar events)
[2024-05-22 10:27:02] [INFO ] Invariant cache hit.
[2024-05-22 10:27:02] [INFO ] Implicit Places using invariants and state equation in 17 ms returned []
Implicit Place search using SMT with State Equation took 33 ms to find 0 implicit places.
[2024-05-22 10:27:02] [INFO ] Redundant transitions in 0 ms returned []
Running 9 sub problems to find dead transitions.
[2024-05-22 10:27:02] [INFO ] Flow matrix only has 11 transitions (discarded 4 similar events)
[2024-05-22 10:27:02] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (OVERLAPS) 10/16 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/16 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (OVERLAPS) 3/19 variables, 3/9 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/19 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 5 (OVERLAPS) 0/19 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 9 unsolved
No progress, stopping.
After SMT solving in domain Real declared 19/20 variables, and 9 constraints, problems are : Problem set: 0 solved, 9 unsolved in 59 ms.
Refiners :[State Equation: 9/9 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 9 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (OVERLAPS) 10/16 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/16 variables, 9/15 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/16 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 4 (OVERLAPS) 3/19 variables, 3/18 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/19 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 6 (OVERLAPS) 0/19 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 9 unsolved
No progress, stopping.
After SMT solving in domain Int declared 19/20 variables, and 18 constraints, problems are : Problem set: 0 solved, 9 unsolved in 53 ms.
Refiners :[State Equation: 9/9 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 0/0 constraints]
After SMT, in 116ms problems are : Problem set: 0 solved, 9 unsolved
Search for dead transitions found 0 dead transitions in 116ms
Starting structural reductions in SI_CTL mode, iteration 1 : 9/62 places, 15/78 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 181 ms. Remains : 9/62 places, 15/78 transitions.
[2024-05-22 10:27:02] [INFO ] Flatten gal took : 1 ms
[2024-05-22 10:27:02] [INFO ] Flatten gal took : 1 ms
[2024-05-22 10:27:02] [INFO ] Input system was already deterministic with 15 transitions.
[2024-05-22 10:27:02] [INFO ] Flatten gal took : 1 ms
[2024-05-22 10:27:02] [INFO ] Flatten gal took : 0 ms
[2024-05-22 10:27:02] [INFO ] Time to serialize gal into /tmp/CTLCardinality8608356059523850133.gal : 0 ms
[2024-05-22 10:27:02] [INFO ] Time to serialize properties into /tmp/CTLCardinality11393896532029215381.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/CTLCardinality8608356059523850133.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality11393896532029215381.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,325,0.002187,3344,2,40,5,174,6,0,43,153,0


Converting to forward existential form...Done !
original formula: AG(EF(((p6==0)&&(p43==1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((p6==0)&&(p43==1)))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t0, t3, t6, t14, Intersection with reachable at each step enabled. (destroyed/reverse/inters...176
(forward)formula 0,0,0.005459,3924,1,0,35,832,46,18,226,902,38
FORMULA DiscoveryGPU-PT-06a-CTLCardinality-2024-02 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 62/62 places, 78/78 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 59 transition count 75
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 59 transition count 75
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 9 place count 56 transition count 72
Iterating global reduction 0 with 3 rules applied. Total rules applied 12 place count 56 transition count 72
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 14 place count 54 transition count 70
Iterating global reduction 0 with 2 rules applied. Total rules applied 16 place count 54 transition count 70
Applied a total of 16 rules in 4 ms. Remains 54 /62 variables (removed 8) and now considering 70/78 (removed 8) transitions.
// Phase 1: matrix 70 rows 54 cols
[2024-05-22 10:27:02] [INFO ] Computed 2 invariants in 4 ms
[2024-05-22 10:27:02] [INFO ] Implicit Places using invariants in 31 ms returned []
[2024-05-22 10:27:02] [INFO ] Invariant cache hit.
[2024-05-22 10:27:02] [INFO ] State equation strengthened by 45 read => feed constraints.
[2024-05-22 10:27:02] [INFO ] Implicit Places using invariants and state equation in 78 ms returned [53]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 110 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 53/62 places, 70/78 transitions.
Applied a total of 0 rules in 1 ms. Remains 53 /53 variables (removed 0) and now considering 70/70 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 115 ms. Remains : 53/62 places, 70/78 transitions.
[2024-05-22 10:27:02] [INFO ] Flatten gal took : 3 ms
[2024-05-22 10:27:02] [INFO ] Flatten gal took : 3 ms
[2024-05-22 10:27:02] [INFO ] Input system was already deterministic with 70 transitions.
[2024-05-22 10:27:02] [INFO ] Flatten gal took : 3 ms
[2024-05-22 10:27:02] [INFO ] Flatten gal took : 3 ms
[2024-05-22 10:27:02] [INFO ] Time to serialize gal into /tmp/CTLCardinality15635549023241233940.gal : 1 ms
[2024-05-22 10:27:02] [INFO ] Time to serialize properties into /tmp/CTLCardinality10394401201310740620.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/CTLCardinality15635549023241233940.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality10394401201310740620.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,1.3823e+06,0.030333,4880,2,440,5,8375,6,0,273,4841,0


Converting to forward existential form...Done !
original formula: AG(((E(EG(((p11==0)||(p6==1))) U !((((p28==0)||(p19==1))||(p1==1)))) + (p16==0)) + AF((((p29==0)||(p20==1)) * AX((p55==1))))))
=> equivalent forward existential formula: [FwdG((FwdU(Init,TRUE) * !((E(EG(((p11==0)||(p6==1))) U !((((p28==0)||(p19==1))||(p1==1)))) + (p16==0)))),!((((p...205
Reverse transition relation is NOT exact ! Due to transitions t17, t19, t24, t26, t61, t62, t63, t64, t65, t66, t67, t68, t69, Intersection with reachable...225
(forward)formula 0,0,0.792165,36980,1,0,421,204806,175,235,1584,246571,495
FORMULA DiscoveryGPU-PT-06a-CTLCardinality-2024-03 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 62/62 places, 78/78 transitions.
Graph (complete) has 171 edges and 62 vertex of which 57 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.0 ms
Discarding 5 places :
Also discarding 5 output transitions
Drop transitions (Output transitions of discarded places.) removed 5 transitions
Reduce places removed 1 places and 1 transitions.
Reduce places removed 2 places and 0 transitions.
Graph (complete) has 60 edges and 54 vertex of which 43 are kept as prefixes of interest. Removing 11 places using SCC suffix rule.1 ms
Discarding 11 places :
Also discarding 11 output transitions
Drop transitions (Output transitions of discarded places.) removed 11 transitions
Graph (trivial) has 44 edges and 43 vertex of which 22 / 43 are part of one of the 11 SCC in 0 ms
Free SCC test removed 11 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 0 with 9 rules applied. Total rules applied 10 place count 32 transition count 56
Reduce places removed 5 places and 0 transitions.
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 1 with 16 rules applied. Total rules applied 26 place count 27 transition count 45
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 30 place count 23 transition count 37
Iterating global reduction 2 with 4 rules applied. Total rules applied 34 place count 23 transition count 37
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 38 place count 19 transition count 29
Iterating global reduction 2 with 4 rules applied. Total rules applied 42 place count 19 transition count 29
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 46 place count 15 transition count 21
Iterating global reduction 2 with 4 rules applied. Total rules applied 50 place count 15 transition count 21
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 54 place count 11 transition count 17
Iterating global reduction 2 with 4 rules applied. Total rules applied 58 place count 11 transition count 17
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 59 place count 11 transition count 16
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 2 with 1 rules applied. Total rules applied 60 place count 11 transition count 15
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 61 place count 10 transition count 15
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 63 place count 8 transition count 13
Applied a total of 63 rules in 6 ms. Remains 8 /62 variables (removed 54) and now considering 13/78 (removed 65) transitions.
[2024-05-22 10:27:03] [INFO ] Flow matrix only has 11 transitions (discarded 2 similar events)
// Phase 1: matrix 11 rows 8 cols
[2024-05-22 10:27:03] [INFO ] Computed 0 invariants in 0 ms
[2024-05-22 10:27:03] [INFO ] Implicit Places using invariants in 19 ms returned []
[2024-05-22 10:27:03] [INFO ] Flow matrix only has 11 transitions (discarded 2 similar events)
[2024-05-22 10:27:03] [INFO ] Invariant cache hit.
[2024-05-22 10:27:03] [INFO ] Implicit Places using invariants and state equation in 22 ms returned []
Implicit Place search using SMT with State Equation took 42 ms to find 0 implicit places.
[2024-05-22 10:27:03] [INFO ] Redundant transitions in 0 ms returned []
Running 9 sub problems to find dead transitions.
[2024-05-22 10:27:03] [INFO ] Flow matrix only has 11 transitions (discarded 2 similar events)
[2024-05-22 10:27:03] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (OVERLAPS) 10/16 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/16 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (OVERLAPS) 2/18 variables, 2/8 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/18 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 5 (OVERLAPS) 0/18 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 9 unsolved
No progress, stopping.
After SMT solving in domain Real declared 18/19 variables, and 8 constraints, problems are : Problem set: 0 solved, 9 unsolved in 64 ms.
Refiners :[State Equation: 8/8 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 9 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (OVERLAPS) 10/16 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/16 variables, 9/15 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/16 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 4 (OVERLAPS) 2/18 variables, 2/17 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/18 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 6 (OVERLAPS) 0/18 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 9 unsolved
No progress, stopping.
After SMT solving in domain Int declared 18/19 variables, and 17 constraints, problems are : Problem set: 0 solved, 9 unsolved in 52 ms.
Refiners :[State Equation: 8/8 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 0/0 constraints]
After SMT, in 118ms problems are : Problem set: 0 solved, 9 unsolved
Search for dead transitions found 0 dead transitions in 118ms
Starting structural reductions in SI_CTL mode, iteration 1 : 8/62 places, 13/78 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 171 ms. Remains : 8/62 places, 13/78 transitions.
[2024-05-22 10:27:03] [INFO ] Flatten gal took : 0 ms
[2024-05-22 10:27:03] [INFO ] Flatten gal took : 0 ms
[2024-05-22 10:27:03] [INFO ] Input system was already deterministic with 13 transitions.
[2024-05-22 10:27:03] [INFO ] Flatten gal took : 0 ms
[2024-05-22 10:27:03] [INFO ] Flatten gal took : 1 ms
[2024-05-22 10:27:03] [INFO ] Time to serialize gal into /tmp/CTLCardinality9975852030768620388.gal : 1 ms
[2024-05-22 10:27:03] [INFO ] Time to serialize properties into /tmp/CTLCardinality14935490996618961881.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/CTLCardinality9975852030768620388.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality14935490996618961881.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,147,0.002091,3336,2,19,5,104,6,0,40,90,0


Converting to forward existential form...Done !
original formula: AG(((p6==1) + EF((AG((p3==1)) * EF(((p3==0)||(p5==1)))))))
=> equivalent forward existential formula: [((FwdU(Init,TRUE) * !((p6==1))) * !(E(TRUE U (!(E(TRUE U !((p3==1)))) * E(TRUE U ((p3==0)||(p5==1)))))))] = FAL...157
Reverse transition relation is NOT exact ! Due to transitions t0, t3, t12, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/...172
(forward)formula 0,0,0.004935,3916,1,0,29,480,48,17,214,566,38
FORMULA DiscoveryGPU-PT-06a-CTLCardinality-2024-04 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 62/62 places, 78/78 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 57 transition count 73
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 57 transition count 73
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 15 place count 52 transition count 68
Iterating global reduction 0 with 5 rules applied. Total rules applied 20 place count 52 transition count 68
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 24 place count 48 transition count 64
Iterating global reduction 0 with 4 rules applied. Total rules applied 28 place count 48 transition count 64
Applied a total of 28 rules in 3 ms. Remains 48 /62 variables (removed 14) and now considering 64/78 (removed 14) transitions.
// Phase 1: matrix 64 rows 48 cols
[2024-05-22 10:27:03] [INFO ] Computed 2 invariants in 1 ms
[2024-05-22 10:27:03] [INFO ] Implicit Places using invariants in 30 ms returned []
[2024-05-22 10:27:03] [INFO ] Invariant cache hit.
[2024-05-22 10:27:03] [INFO ] State equation strengthened by 43 read => feed constraints.
[2024-05-22 10:27:03] [INFO ] Implicit Places using invariants and state equation in 72 ms returned [47]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 104 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 47/62 places, 64/78 transitions.
Applied a total of 0 rules in 1 ms. Remains 47 /47 variables (removed 0) and now considering 64/64 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 108 ms. Remains : 47/62 places, 64/78 transitions.
[2024-05-22 10:27:03] [INFO ] Flatten gal took : 2 ms
[2024-05-22 10:27:03] [INFO ] Flatten gal took : 3 ms
[2024-05-22 10:27:03] [INFO ] Input system was already deterministic with 64 transitions.
[2024-05-22 10:27:03] [INFO ] Flatten gal took : 3 ms
[2024-05-22 10:27:03] [INFO ] Flatten gal took : 2 ms
[2024-05-22 10:27:03] [INFO ] Time to serialize gal into /tmp/CTLCardinality2874213074490707006.gal : 0 ms
[2024-05-22 10:27:03] [INFO ] Time to serialize properties into /tmp/CTLCardinality11178357419232771110.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/CTLCardinality2874213074490707006.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality11178357419232771110.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,1.04653e+06,0.050419,5884,2,889,5,15700,6,0,245,9290,0


Converting to forward existential form...Done !
original formula: EG(AG((EF(((p19==0)||(p34==1))) + AX(((p47==0)||(p39==1))))))
=> equivalent forward existential formula: [FwdG(Init,!(E(TRUE U !((E(TRUE U ((p19==0)||(p34==1))) + !(EX(!(((p47==0)||(p39==1))))))))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t15, t17, t19, t21, t22, t24, t57, t58, t59, t60, t61, t62, t63, Intersection with reachable...225
(forward)formula 0,1,0.311326,17348,1,0,105,75242,155,69,1571,74674,150
FORMULA DiscoveryGPU-PT-06a-CTLCardinality-2024-05 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 62/62 places, 78/78 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 58 transition count 74
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 58 transition count 74
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 10 place count 56 transition count 72
Iterating global reduction 0 with 2 rules applied. Total rules applied 12 place count 56 transition count 72
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 55 transition count 71
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 55 transition count 71
Applied a total of 14 rules in 4 ms. Remains 55 /62 variables (removed 7) and now considering 71/78 (removed 7) transitions.
// Phase 1: matrix 71 rows 55 cols
[2024-05-22 10:27:03] [INFO ] Computed 2 invariants in 1 ms
[2024-05-22 10:27:03] [INFO ] Implicit Places using invariants in 33 ms returned []
[2024-05-22 10:27:03] [INFO ] Invariant cache hit.
[2024-05-22 10:27:03] [INFO ] State equation strengthened by 46 read => feed constraints.
[2024-05-22 10:27:03] [INFO ] Implicit Places using invariants and state equation in 71 ms returned [54]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 105 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 54/62 places, 71/78 transitions.
Applied a total of 0 rules in 1 ms. Remains 54 /54 variables (removed 0) and now considering 71/71 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 110 ms. Remains : 54/62 places, 71/78 transitions.
[2024-05-22 10:27:04] [INFO ] Flatten gal took : 3 ms
[2024-05-22 10:27:04] [INFO ] Flatten gal took : 3 ms
[2024-05-22 10:27:04] [INFO ] Input system was already deterministic with 71 transitions.
[2024-05-22 10:27:04] [INFO ] Flatten gal took : 2 ms
[2024-05-22 10:27:04] [INFO ] Flatten gal took : 3 ms
[2024-05-22 10:27:04] [INFO ] Time to serialize gal into /tmp/CTLCardinality4213372038320001529.gal : 1 ms
[2024-05-22 10:27:04] [INFO ] Time to serialize properties into /tmp/CTLCardinality13123179144761916571.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/CTLCardinality4213372038320001529.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality13123179144761916571.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,1.4795e+06,0.036461,5156,2,589,5,11101,6,0,279,6180,0


Converting to forward existential form...Done !
original formula: E(((p2==0)||(p1==1)) U A(((p18==0)||(p60==1)) U E((EF(((p12==0)||(p49==1))) * (((p48==0)||(p57==1)) + AX((p34==1)))) U (E((p35==1) U (p34...175
=> equivalent forward existential formula: [((FwdU(Init,((p2==0)||(p1==1))) * !(EG(!(E((E(TRUE U ((p12==0)||(p49==1))) * (((p48==0)||(p57==1)) + !(EX(!((p3...503
Reverse transition relation is NOT exact ! Due to transitions t18, t25, t27, t55, t57, t60, t63, t64, t65, t66, t67, t68, t69, t70, Intersection with reac...230
(forward)formula 0,0,0.746249,33844,1,0,248,184992,179,153,1680,174498,338
FORMULA DiscoveryGPU-PT-06a-CTLCardinality-2024-06 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 62/62 places, 78/78 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 58 transition count 74
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 58 transition count 74
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 12 place count 54 transition count 70
Iterating global reduction 0 with 4 rules applied. Total rules applied 16 place count 54 transition count 70
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 19 place count 51 transition count 67
Iterating global reduction 0 with 3 rules applied. Total rules applied 22 place count 51 transition count 67
Applied a total of 22 rules in 4 ms. Remains 51 /62 variables (removed 11) and now considering 67/78 (removed 11) transitions.
// Phase 1: matrix 67 rows 51 cols
[2024-05-22 10:27:04] [INFO ] Computed 2 invariants in 1 ms
[2024-05-22 10:27:04] [INFO ] Implicit Places using invariants in 34 ms returned []
[2024-05-22 10:27:04] [INFO ] Invariant cache hit.
[2024-05-22 10:27:04] [INFO ] State equation strengthened by 44 read => feed constraints.
[2024-05-22 10:27:04] [INFO ] Implicit Places using invariants and state equation in 46 ms returned []
Implicit Place search using SMT with State Equation took 81 ms to find 0 implicit places.
Running 66 sub problems to find dead transitions.
[2024-05-22 10:27:04] [INFO ] Invariant cache hit.
[2024-05-22 10:27:04] [INFO ] State equation strengthened by 44 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/50 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 1 (OVERLAPS) 1/51 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/51 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 3 (OVERLAPS) 67/118 variables, 51/53 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/118 variables, 44/97 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/118 variables, 0/97 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 6 (OVERLAPS) 0/118 variables, 0/97 constraints. Problems are: Problem set: 0 solved, 66 unsolved
No progress, stopping.
After SMT solving in domain Real declared 118/118 variables, and 97 constraints, problems are : Problem set: 0 solved, 66 unsolved in 907 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 51/51 constraints, ReadFeed: 44/44 constraints, PredecessorRefiner: 66/66 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 66 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/50 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 1 (OVERLAPS) 1/51 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/51 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 3 (OVERLAPS) 67/118 variables, 51/53 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/118 variables, 44/97 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/118 variables, 66/163 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/118 variables, 0/163 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 7 (OVERLAPS) 0/118 variables, 0/163 constraints. Problems are: Problem set: 0 solved, 66 unsolved
No progress, stopping.
After SMT solving in domain Int declared 118/118 variables, and 163 constraints, problems are : Problem set: 0 solved, 66 unsolved in 733 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 51/51 constraints, ReadFeed: 44/44 constraints, PredecessorRefiner: 66/66 constraints, Known Traps: 0/0 constraints]
After SMT, in 1652ms problems are : Problem set: 0 solved, 66 unsolved
Search for dead transitions found 0 dead transitions in 1653ms
Starting structural reductions in LTL mode, iteration 1 : 51/62 places, 67/78 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1739 ms. Remains : 51/62 places, 67/78 transitions.
[2024-05-22 10:27:06] [INFO ] Flatten gal took : 13 ms
[2024-05-22 10:27:06] [INFO ] Flatten gal took : 3 ms
[2024-05-22 10:27:06] [INFO ] Input system was already deterministic with 67 transitions.
[2024-05-22 10:27:06] [INFO ] Flatten gal took : 4 ms
[2024-05-22 10:27:06] [INFO ] Flatten gal took : 3 ms
[2024-05-22 10:27:06] [INFO ] Time to serialize gal into /tmp/CTLCardinality16902140702451484485.gal : 4 ms
[2024-05-22 10:27:06] [INFO ] Time to serialize properties into /tmp/CTLCardinality4665692732934184012.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/CTLCardinality16902140702451484485.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality4665692732934184012.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,1.21229e+06,0.052946,5688,2,452,5,13611,6,0,261,8967,0


Converting to forward existential form...Done !
original formula: EF(((EX(AF(AG((p27==1)))) * (p35==0)) * (AF((p40==0)) + AG(((p62==0)||(p51==1))))))
=> equivalent forward existential formula: ([((FwdU(Init,TRUE) * (EX(!(EG(!(!(E(TRUE U !((p27==1)))))))) * (p35==0))) * !(EG(!((p40==0)))))] != FALSE + [((...276
Reverse transition relation is NOT exact ! Due to transitions t18, t20, t22, t23, t25, t59, t60, t61, t62, t63, t64, t65, t66, Intersection with reachable...225
(forward)formula 0,0,0.513962,23484,1,0,277,112401,168,165,1604,126126,392
FORMULA DiscoveryGPU-PT-06a-CTLCardinality-2024-07 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 62/62 places, 78/78 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 57 transition count 73
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 57 transition count 73
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 14 place count 53 transition count 69
Iterating global reduction 0 with 4 rules applied. Total rules applied 18 place count 53 transition count 69
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 22 place count 49 transition count 65
Iterating global reduction 0 with 4 rules applied. Total rules applied 26 place count 49 transition count 65
Applied a total of 26 rules in 10 ms. Remains 49 /62 variables (removed 13) and now considering 65/78 (removed 13) transitions.
// Phase 1: matrix 65 rows 49 cols
[2024-05-22 10:27:07] [INFO ] Computed 2 invariants in 1 ms
[2024-05-22 10:27:07] [INFO ] Implicit Places using invariants in 37 ms returned []
[2024-05-22 10:27:07] [INFO ] Invariant cache hit.
[2024-05-22 10:27:07] [INFO ] State equation strengthened by 43 read => feed constraints.
[2024-05-22 10:27:07] [INFO ] Implicit Places using invariants and state equation in 66 ms returned [48]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 105 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 48/62 places, 65/78 transitions.
Applied a total of 0 rules in 1 ms. Remains 48 /48 variables (removed 0) and now considering 65/65 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 116 ms. Remains : 48/62 places, 65/78 transitions.
[2024-05-22 10:27:07] [INFO ] Flatten gal took : 2 ms
[2024-05-22 10:27:07] [INFO ] Flatten gal took : 2 ms
[2024-05-22 10:27:07] [INFO ] Input system was already deterministic with 65 transitions.
[2024-05-22 10:27:07] [INFO ] Flatten gal took : 2 ms
[2024-05-22 10:27:07] [INFO ] Flatten gal took : 3 ms
[2024-05-22 10:27:07] [INFO ] Time to serialize gal into /tmp/CTLCardinality2160129477112460274.gal : 1 ms
[2024-05-22 10:27:07] [INFO ] Time to serialize properties into /tmp/CTLCardinality8828062362528567689.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/CTLCardinality2160129477112460274.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality8828062362528567689.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,1.12397e+06,0.053739,5912,2,1007,5,16176,6,0,250,10795,0


Converting to forward existential form...Done !
original formula: EF(EX((EF((((p58==0)&&(p26==1))||(p26==0))) * !(A(((p0==0)||(p61==1)) U (p23==0))))))
=> equivalent forward existential formula: ([(FwdU((EY(FwdU(Init,TRUE)) * E(TRUE U (((p58==0)&&(p26==1))||(p26==0)))),!((p23==0))) * (!(((p0==0)||(p61==1))...281
Reverse transition relation is NOT exact ! Due to transitions t7, t12, t16, t18, t20, t22, t25, t58, t59, t60, t61, t62, t63, t64, Intersection with reach...229
Hit Full ! (commute/partial/dont) 63/0/2
(forward)formula 0,1,0.31304,17296,1,0,103,75236,166,65,1583,81323,149
FORMULA DiscoveryGPU-PT-06a-CTLCardinality-2024-08 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 62/62 places, 78/78 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 59 transition count 75
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 59 transition count 75
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 9 place count 56 transition count 72
Iterating global reduction 0 with 3 rules applied. Total rules applied 12 place count 56 transition count 72
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 55 transition count 71
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 55 transition count 71
Applied a total of 14 rules in 3 ms. Remains 55 /62 variables (removed 7) and now considering 71/78 (removed 7) transitions.
// Phase 1: matrix 71 rows 55 cols
[2024-05-22 10:27:07] [INFO ] Computed 2 invariants in 0 ms
[2024-05-22 10:27:07] [INFO ] Implicit Places using invariants in 38 ms returned []
[2024-05-22 10:27:07] [INFO ] Invariant cache hit.
[2024-05-22 10:27:07] [INFO ] State equation strengthened by 45 read => feed constraints.
[2024-05-22 10:27:07] [INFO ] Implicit Places using invariants and state equation in 56 ms returned [54]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 95 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 54/62 places, 71/78 transitions.
Applied a total of 0 rules in 1 ms. Remains 54 /54 variables (removed 0) and now considering 71/71 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 99 ms. Remains : 54/62 places, 71/78 transitions.
[2024-05-22 10:27:07] [INFO ] Flatten gal took : 3 ms
[2024-05-22 10:27:07] [INFO ] Flatten gal took : 2 ms
[2024-05-22 10:27:07] [INFO ] Input system was already deterministic with 71 transitions.
[2024-05-22 10:27:07] [INFO ] Flatten gal took : 2 ms
[2024-05-22 10:27:07] [INFO ] Flatten gal took : 3 ms
[2024-05-22 10:27:07] [INFO ] Time to serialize gal into /tmp/CTLCardinality9828541024095768646.gal : 1 ms
[2024-05-22 10:27:07] [INFO ] Time to serialize properties into /tmp/CTLCardinality14928158230691268151.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/CTLCardinality9828541024095768646.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality14928158230691268151.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,1.48618e+06,0.056885,5944,2,836,5,14579,6,0,279,10478,0


Converting to forward existential form...Done !
original formula: AG(EX(((EX((p60==0)) + ((p39==1) * (AG(((p42==0)||(p39==1))) + ((p3==0)&&(p59==1))))) + (AX((p23==1)) * ((p31==1)||(p14==1))))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(EX(((EX((p60==0)) + ((p39==1) * (!(E(TRUE U !(((p42==0)||(p39==1))))) + ((p3==0)&&(p59==1)...218
Reverse transition relation is NOT exact ! Due to transitions t9, t12, t15, t19, t23, t59, t61, t63, t64, t65, t66, t67, t68, t69, t70, Intersection with ...234
(forward)formula 0,0,0.272012,15184,1,0,127,64603,170,78,1640,74553,169
FORMULA DiscoveryGPU-PT-06a-CTLCardinality-2024-09 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 62/62 places, 78/78 transitions.
Graph (complete) has 171 edges and 62 vertex of which 57 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.2 ms
Discarding 5 places :
Also discarding 5 output transitions
Drop transitions (Output transitions of discarded places.) removed 5 transitions
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 5 Pre rules applied. Total rules applied 1 place count 57 transition count 68
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 11 place count 52 transition count 68
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 16 place count 47 transition count 63
Iterating global reduction 0 with 5 rules applied. Total rules applied 21 place count 47 transition count 63
Applied a total of 21 rules in 15 ms. Remains 47 /62 variables (removed 15) and now considering 63/78 (removed 15) transitions.
// Phase 1: matrix 63 rows 47 cols
[2024-05-22 10:27:07] [INFO ] Computed 2 invariants in 0 ms
[2024-05-22 10:27:07] [INFO ] Implicit Places using invariants in 30 ms returned []
[2024-05-22 10:27:07] [INFO ] Invariant cache hit.
[2024-05-22 10:27:07] [INFO ] State equation strengthened by 43 read => feed constraints.
[2024-05-22 10:27:08] [INFO ] Implicit Places using invariants and state equation in 48 ms returned [46]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 78 ms to find 1 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 46/62 places, 63/78 transitions.
Partial Post-agglomeration rule applied 3 times.
Drop transitions (Partial Post agglomeration) removed 3 transitions
Iterating global reduction 0 with 3 rules applied. Total rules applied 3 place count 46 transition count 63
Applied a total of 3 rules in 5 ms. Remains 46 /46 variables (removed 0) and now considering 63/63 (removed 0) transitions.
[2024-05-22 10:27:08] [INFO ] Flow matrix only has 62 transitions (discarded 1 similar events)
// Phase 1: matrix 62 rows 46 cols
[2024-05-22 10:27:08] [INFO ] Computed 1 invariants in 0 ms
[2024-05-22 10:27:08] [INFO ] Implicit Places using invariants in 25 ms returned []
[2024-05-22 10:27:08] [INFO ] Flow matrix only has 62 transitions (discarded 1 similar events)
[2024-05-22 10:27:08] [INFO ] Invariant cache hit.
[2024-05-22 10:27:08] [INFO ] State equation strengthened by 33 read => feed constraints.
[2024-05-22 10:27:08] [INFO ] Implicit Places using invariants and state equation in 41 ms returned []
Implicit Place search using SMT with State Equation took 66 ms to find 0 implicit places.
Starting structural reductions in SI_CTL mode, iteration 2 : 46/62 places, 63/78 transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 164 ms. Remains : 46/62 places, 63/78 transitions.
[2024-05-22 10:27:08] [INFO ] Flatten gal took : 2 ms
[2024-05-22 10:27:08] [INFO ] Flatten gal took : 2 ms
[2024-05-22 10:27:08] [INFO ] Input system was already deterministic with 63 transitions.
[2024-05-22 10:27:08] [INFO ] Flatten gal took : 2 ms
[2024-05-22 10:27:08] [INFO ] Flatten gal took : 2 ms
[2024-05-22 10:27:08] [INFO ] Time to serialize gal into /tmp/CTLCardinality17760341520577572115.gal : 1 ms
[2024-05-22 10:27:08] [INFO ] Time to serialize properties into /tmp/CTLCardinality1723495777748655851.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/CTLCardinality17760341520577572115.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality1723495777748655851.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,512001,0.03446,5096,2,829,5,10028,6,0,241,6542,0


Converting to forward existential form...Done !
original formula: E(((p38==0)||(p27==1)) U !(EF((((p10==0)||(p53==1))||((p25==0)||(p26==1))))))
=> equivalent forward existential formula: [(FwdU(Init,((p38==0)||(p27==1))) * !(E(TRUE U (((p10==0)||(p53==1))||((p25==0)||(p26==1))))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t1, t15, t17, t19, t21, t53, t54, t55, t56, t57, t58, t59, t60, Intersection with reachable ...224
(forward)formula 0,0,0.214672,13544,1,0,94,52049,145,59,1394,51310,134
FORMULA DiscoveryGPU-PT-06a-CTLCardinality-2024-10 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 62/62 places, 78/78 transitions.
Graph (complete) has 171 edges and 62 vertex of which 57 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.0 ms
Discarding 5 places :
Also discarding 5 output transitions
Drop transitions (Output transitions of discarded places.) removed 5 transitions
Reduce places removed 1 places and 1 transitions.
Reduce places removed 2 places and 0 transitions.
Graph (complete) has 60 edges and 54 vertex of which 43 are kept as prefixes of interest. Removing 11 places using SCC suffix rule.0 ms
Discarding 11 places :
Also discarding 11 output transitions
Drop transitions (Output transitions of discarded places.) removed 11 transitions
Graph (trivial) has 43 edges and 43 vertex of which 20 / 43 are part of one of the 10 SCC in 0 ms
Free SCC test removed 10 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 0 with 10 rules applied. Total rules applied 11 place count 33 transition count 55
Reduce places removed 6 places and 0 transitions.
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 1 with 16 rules applied. Total rules applied 27 place count 27 transition count 45
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 30 place count 24 transition count 39
Iterating global reduction 2 with 3 rules applied. Total rules applied 33 place count 24 transition count 39
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 35 place count 22 transition count 35
Iterating global reduction 2 with 2 rules applied. Total rules applied 37 place count 22 transition count 35
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 39 place count 20 transition count 31
Iterating global reduction 2 with 2 rules applied. Total rules applied 41 place count 20 transition count 31
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 43 place count 18 transition count 29
Iterating global reduction 2 with 2 rules applied. Total rules applied 45 place count 18 transition count 29
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 46 place count 18 transition count 28
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 2 with 1 rules applied. Total rules applied 47 place count 18 transition count 27
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 48 place count 17 transition count 27
Reduce places removed 4 places and 4 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 52 place count 13 transition count 23
Applied a total of 52 rules in 5 ms. Remains 13 /62 variables (removed 49) and now considering 23/78 (removed 55) transitions.
[2024-05-22 10:27:08] [INFO ] Flow matrix only has 18 transitions (discarded 5 similar events)
// Phase 1: matrix 18 rows 13 cols
[2024-05-22 10:27:08] [INFO ] Computed 0 invariants in 0 ms
[2024-05-22 10:27:08] [INFO ] Implicit Places using invariants in 17 ms returned []
[2024-05-22 10:27:08] [INFO ] Flow matrix only has 18 transitions (discarded 5 similar events)
[2024-05-22 10:27:08] [INFO ] Invariant cache hit.
[2024-05-22 10:27:08] [INFO ] Implicit Places using invariants and state equation in 21 ms returned []
Implicit Place search using SMT with State Equation took 40 ms to find 0 implicit places.
[2024-05-22 10:27:08] [INFO ] Redundant transitions in 0 ms returned []
Running 15 sub problems to find dead transitions.
[2024-05-22 10:27:08] [INFO ] Flow matrix only has 18 transitions (discarded 5 similar events)
[2024-05-22 10:27:08] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/9 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 1 (OVERLAPS) 17/26 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/26 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 3 (OVERLAPS) 4/30 variables, 4/13 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/30 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 5 (OVERLAPS) 0/30 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 15 unsolved
No progress, stopping.
After SMT solving in domain Real declared 30/31 variables, and 13 constraints, problems are : Problem set: 0 solved, 15 unsolved in 80 ms.
Refiners :[State Equation: 13/13 constraints, PredecessorRefiner: 15/15 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 15 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/9 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 1 (OVERLAPS) 17/26 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/26 variables, 15/24 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/26 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 4 (OVERLAPS) 4/30 variables, 4/28 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/30 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 6 (OVERLAPS) 0/30 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 15 unsolved
No progress, stopping.
After SMT solving in domain Int declared 30/31 variables, and 28 constraints, problems are : Problem set: 0 solved, 15 unsolved in 103 ms.
Refiners :[State Equation: 13/13 constraints, PredecessorRefiner: 15/15 constraints, Known Traps: 0/0 constraints]
After SMT, in 188ms problems are : Problem set: 0 solved, 15 unsolved
Search for dead transitions found 0 dead transitions in 188ms
Starting structural reductions in SI_CTL mode, iteration 1 : 13/62 places, 23/78 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 238 ms. Remains : 13/62 places, 23/78 transitions.
[2024-05-22 10:27:08] [INFO ] Flatten gal took : 1 ms
[2024-05-22 10:27:08] [INFO ] Flatten gal took : 1 ms
[2024-05-22 10:27:08] [INFO ] Input system was already deterministic with 23 transitions.
[2024-05-22 10:27:08] [INFO ] Flatten gal took : 0 ms
[2024-05-22 10:27:08] [INFO ] Flatten gal took : 0 ms
[2024-05-22 10:27:08] [INFO ] Time to serialize gal into /tmp/CTLCardinality5416717881570698704.gal : 0 ms
[2024-05-22 10:27:08] [INFO ] Time to serialize properties into /tmp/CTLCardinality17825233235772936074.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/CTLCardinality5416717881570698704.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality17825233235772936074.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,1000,0.002776,3388,2,25,5,119,6,0,62,96,0


Converting to forward existential form...Done !
original formula: AG(AF(E(EF(((p3==0)&&(p34==1))) U (p25==0))))
=> equivalent forward existential formula: [FwdG(FwdU(Init,TRUE),!(E(E(TRUE U ((p3==0)&&(p34==1))) U (p25==0))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t2, t4, t6, t9, t21, t22, Intersection with reachable at each step enabled. (destroyed/rever...185
(forward)formula 0,0,0.008114,3704,1,0,54,1149,71,35,347,1319,71
FORMULA DiscoveryGPU-PT-06a-CTLCardinality-2024-11 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 : 62/62 places, 78/78 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 57 transition count 73
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 57 transition count 73
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 15 place count 52 transition count 68
Iterating global reduction 0 with 5 rules applied. Total rules applied 20 place count 52 transition count 68
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 24 place count 48 transition count 64
Iterating global reduction 0 with 4 rules applied. Total rules applied 28 place count 48 transition count 64
Applied a total of 28 rules in 3 ms. Remains 48 /62 variables (removed 14) and now considering 64/78 (removed 14) transitions.
// Phase 1: matrix 64 rows 48 cols
[2024-05-22 10:27:08] [INFO ] Computed 2 invariants in 1 ms
[2024-05-22 10:27:08] [INFO ] Implicit Places using invariants in 30 ms returned []
[2024-05-22 10:27:08] [INFO ] Invariant cache hit.
[2024-05-22 10:27:08] [INFO ] State equation strengthened by 43 read => feed constraints.
[2024-05-22 10:27:08] [INFO ] Implicit Places using invariants and state equation in 62 ms returned [47]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 93 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 47/62 places, 64/78 transitions.
Applied a total of 0 rules in 1 ms. Remains 47 /47 variables (removed 0) and now considering 64/64 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 97 ms. Remains : 47/62 places, 64/78 transitions.
[2024-05-22 10:27:08] [INFO ] Flatten gal took : 2 ms
[2024-05-22 10:27:08] [INFO ] Flatten gal took : 1 ms
[2024-05-22 10:27:08] [INFO ] Input system was already deterministic with 64 transitions.
[2024-05-22 10:27:08] [INFO ] Flatten gal took : 2 ms
[2024-05-22 10:27:08] [INFO ] Flatten gal took : 2 ms
[2024-05-22 10:27:08] [INFO ] Time to serialize gal into /tmp/CTLCardinality6704339625635298817.gal : 1 ms
[2024-05-22 10:27:08] [INFO ] Time to serialize properties into /tmp/CTLCardinality14252631582532752547.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/CTLCardinality6704339625635298817.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality14252631582532752547.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,1.04653e+06,0.056456,5888,2,889,5,15700,6,0,245,9290,0


Converting to forward existential form...Done !
original formula: EG(A(EX(((p47==1) * EG((p58==0)))) U EF(EG((p54==1)))))
=> equivalent forward existential formula: [FwdG(Init,!((E(!(E(TRUE U EG((p54==1)))) U (!(EX(((p47==1) * EG((p58==0))))) * !(E(TRUE U EG((p54==1)))))) + EG...195
Reverse transition relation is NOT exact ! Due to transitions t15, t17, t19, t21, t22, t24, t57, t58, t59, t60, t61, t62, t63, Intersection with reachable...225
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 0
(forward)formula 0,1,2.11949,79800,1,0,822,443213,171,512,1548,566523,900
FORMULA DiscoveryGPU-PT-06a-CTLCardinality-2023-12 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 62/62 places, 78/78 transitions.
Graph (complete) has 171 edges and 62 vertex of which 58 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.2 ms
Discarding 4 places :
Also discarding 4 output transitions
Drop transitions (Output transitions of discarded places.) removed 4 transitions
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 4 Pre rules applied. Total rules applied 1 place count 58 transition count 70
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 9 place count 54 transition count 70
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 12 place count 51 transition count 67
Iterating global reduction 0 with 3 rules applied. Total rules applied 15 place count 51 transition count 67
Applied a total of 15 rules in 13 ms. Remains 51 /62 variables (removed 11) and now considering 67/78 (removed 11) transitions.
// Phase 1: matrix 67 rows 51 cols
[2024-05-22 10:27:10] [INFO ] Computed 2 invariants in 1 ms
[2024-05-22 10:27:10] [INFO ] Implicit Places using invariants in 29 ms returned []
[2024-05-22 10:27:10] [INFO ] Invariant cache hit.
[2024-05-22 10:27:10] [INFO ] State equation strengthened by 45 read => feed constraints.
[2024-05-22 10:27:10] [INFO ] Implicit Places using invariants and state equation in 52 ms returned [50]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 83 ms to find 1 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 50/62 places, 67/78 transitions.
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 50 transition count 67
Applied a total of 1 rules in 5 ms. Remains 50 /50 variables (removed 0) and now considering 67/67 (removed 0) transitions.
// Phase 1: matrix 67 rows 50 cols
[2024-05-22 10:27:10] [INFO ] Computed 1 invariants in 1 ms
[2024-05-22 10:27:10] [INFO ] Implicit Places using invariants in 26 ms returned []
[2024-05-22 10:27:10] [INFO ] Invariant cache hit.
[2024-05-22 10:27:10] [INFO ] State equation strengthened by 34 read => feed constraints.
[2024-05-22 10:27:10] [INFO ] Implicit Places using invariants and state equation in 44 ms returned []
Implicit Place search using SMT with State Equation took 71 ms to find 0 implicit places.
Starting structural reductions in SI_CTL mode, iteration 2 : 50/62 places, 67/78 transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 172 ms. Remains : 50/62 places, 67/78 transitions.
[2024-05-22 10:27:10] [INFO ] Flatten gal took : 2 ms
[2024-05-22 10:27:10] [INFO ] Flatten gal took : 2 ms
[2024-05-22 10:27:11] [INFO ] Input system was already deterministic with 67 transitions.
[2024-05-22 10:27:11] [INFO ] Flatten gal took : 2 ms
[2024-05-22 10:27:11] [INFO ] Flatten gal took : 2 ms
[2024-05-22 10:27:11] [INFO ] Time to serialize gal into /tmp/CTLCardinality1097756385625158558.gal : 0 ms
[2024-05-22 10:27:11] [INFO ] Time to serialize properties into /tmp/CTLCardinality7310448626393617131.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/CTLCardinality1097756385625158558.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality7310448626393617131.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,675841,0.031747,4612,2,546,5,7146,6,0,260,4388,0


Converting to forward existential form...Done !
original formula: EF(((A((!(AG((p23==1))) + EF((p22==0))) U (p32!=0)) * (p27==0)) * !(A((p31==0) U ((p40==0)||(p25==1))))))
=> equivalent forward existential formula: ([(FwdU((FwdU(Init,TRUE) * (!((E(!((p32!=0)) U (!((!(!(E(TRUE U !((p23==1))))) + E(TRUE U (p22==0)))) * !((p32!=...458
Reverse transition relation is NOT exact ! Due to transitions t15, t19, t21, t24, t55, t58, t59, t60, t61, t62, t63, t64, t65, Intersection with reachable...225
(forward)formula 0,0,0.610935,29600,1,0,325,155689,177,184,1557,182106,404
FORMULA DiscoveryGPU-PT-06a-CTLCardinality-2023-13 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 : 62/62 places, 78/78 transitions.
Graph (complete) has 171 edges and 62 vertex of which 57 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.0 ms
Discarding 5 places :
Also discarding 5 output transitions
Drop transitions (Output transitions of discarded places.) removed 5 transitions
Reduce places removed 1 places and 1 transitions.
Reduce places removed 2 places and 0 transitions.
Graph (complete) has 60 edges and 54 vertex of which 42 are kept as prefixes of interest. Removing 12 places using SCC suffix rule.0 ms
Discarding 12 places :
Also discarding 12 output transitions
Drop transitions (Output transitions of discarded places.) removed 12 transitions
Graph (trivial) has 44 edges and 42 vertex of which 22 / 42 are part of one of the 11 SCC in 0 ms
Free SCC test removed 11 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 0 with 9 rules applied. Total rules applied 10 place count 31 transition count 55
Reduce places removed 5 places and 0 transitions.
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 1 with 16 rules applied. Total rules applied 26 place count 26 transition count 44
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 30 place count 22 transition count 36
Iterating global reduction 2 with 4 rules applied. Total rules applied 34 place count 22 transition count 36
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 38 place count 18 transition count 28
Iterating global reduction 2 with 4 rules applied. Total rules applied 42 place count 18 transition count 28
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 46 place count 14 transition count 20
Iterating global reduction 2 with 4 rules applied. Total rules applied 50 place count 14 transition count 20
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 54 place count 10 transition count 16
Iterating global reduction 2 with 4 rules applied. Total rules applied 58 place count 10 transition count 16
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 59 place count 10 transition count 15
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 2 with 1 rules applied. Total rules applied 60 place count 10 transition count 14
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 61 place count 9 transition count 14
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 63 place count 7 transition count 12
Applied a total of 63 rules in 5 ms. Remains 7 /62 variables (removed 55) and now considering 12/78 (removed 66) transitions.
[2024-05-22 10:27:11] [INFO ] Flow matrix only has 10 transitions (discarded 2 similar events)
// Phase 1: matrix 10 rows 7 cols
[2024-05-22 10:27:11] [INFO ] Computed 0 invariants in 0 ms
[2024-05-22 10:27:11] [INFO ] Implicit Places using invariants in 14 ms returned []
[2024-05-22 10:27:11] [INFO ] Flow matrix only has 10 transitions (discarded 2 similar events)
[2024-05-22 10:27:11] [INFO ] Invariant cache hit.
[2024-05-22 10:27:11] [INFO ] Implicit Places using invariants and state equation in 17 ms returned []
Implicit Place search using SMT with State Equation took 33 ms to find 0 implicit places.
[2024-05-22 10:27:11] [INFO ] Redundant transitions in 0 ms returned []
Running 8 sub problems to find dead transitions.
[2024-05-22 10:27:11] [INFO ] Flow matrix only has 10 transitions (discarded 2 similar events)
[2024-05-22 10:27:11] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (OVERLAPS) 9/14 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/14 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (OVERLAPS) 2/16 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/16 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 5 (OVERLAPS) 0/16 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Real declared 16/17 variables, and 7 constraints, problems are : Problem set: 0 solved, 8 unsolved in 55 ms.
Refiners :[State Equation: 7/7 constraints, PredecessorRefiner: 8/8 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 8 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (OVERLAPS) 9/14 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/14 variables, 8/13 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/14 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 4 (OVERLAPS) 2/16 variables, 2/15 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/16 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 6 (OVERLAPS) 0/16 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Int declared 16/17 variables, and 15 constraints, problems are : Problem set: 0 solved, 8 unsolved in 57 ms.
Refiners :[State Equation: 7/7 constraints, PredecessorRefiner: 8/8 constraints, Known Traps: 0/0 constraints]
After SMT, in 116ms problems are : Problem set: 0 solved, 8 unsolved
Search for dead transitions found 0 dead transitions in 116ms
Starting structural reductions in SI_CTL mode, iteration 1 : 7/62 places, 12/78 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 158 ms. Remains : 7/62 places, 12/78 transitions.
[2024-05-22 10:27:11] [INFO ] Flatten gal took : 1 ms
[2024-05-22 10:27:11] [INFO ] Flatten gal took : 1 ms
[2024-05-22 10:27:11] [INFO ] Input system was already deterministic with 12 transitions.
[2024-05-22 10:27:11] [INFO ] Flatten gal took : 0 ms
[2024-05-22 10:27:11] [INFO ] Flatten gal took : 1 ms
[2024-05-22 10:27:11] [INFO ] Time to serialize gal into /tmp/CTLCardinality16009875397124479307.gal : 1 ms
[2024-05-22 10:27:11] [INFO ] Time to serialize properties into /tmp/CTLCardinality13601968974212507394.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/CTLCardinality16009875397124479307.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality13601968974212507394.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,126,0.001831,3332,2,17,5,94,6,0,35,83,0


Converting to forward existential form...Done !
original formula: AG(EF(((p34==0)&&(p37==1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((p34==0)&&(p37==1)))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t2, t4, t11, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/...171
(forward)formula 0,0,0.003531,3648,1,0,27,288,42,15,184,290,31
FORMULA DiscoveryGPU-PT-06a-CTLCardinality-2023-14 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 62/62 places, 78/78 transitions.
Graph (complete) has 171 edges and 62 vertex of which 58 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.0 ms
Discarding 4 places :
Also discarding 4 output transitions
Drop transitions (Output transitions of discarded places.) removed 4 transitions
Reduce places removed 1 places and 1 transitions.
Reduce places removed 2 places and 0 transitions.
Graph (complete) has 61 edges and 55 vertex of which 46 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.0 ms
Discarding 9 places :
Also discarding 9 output transitions
Drop transitions (Output transitions of discarded places.) removed 9 transitions
Graph (trivial) has 48 edges and 46 vertex of which 24 / 46 are part of one of the 12 SCC in 0 ms
Free SCC test removed 12 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 0 with 10 rules applied. Total rules applied 11 place count 34 transition count 58
Reduce places removed 6 places and 0 transitions.
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 1 with 18 rules applied. Total rules applied 29 place count 28 transition count 46
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 32 place count 25 transition count 40
Iterating global reduction 2 with 3 rules applied. Total rules applied 35 place count 25 transition count 40
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 37 place count 23 transition count 36
Iterating global reduction 2 with 2 rules applied. Total rules applied 39 place count 23 transition count 36
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 41 place count 21 transition count 32
Iterating global reduction 2 with 2 rules applied. Total rules applied 43 place count 21 transition count 32
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 45 place count 19 transition count 30
Iterating global reduction 2 with 2 rules applied. Total rules applied 47 place count 19 transition count 30
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 2 with 2 rules applied. Total rules applied 49 place count 19 transition count 28
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 2 with 1 rules applied. Total rules applied 50 place count 19 transition count 27
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 51 place count 18 transition count 27
Reduce places removed 4 places and 4 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 55 place count 14 transition count 23
Applied a total of 55 rules in 9 ms. Remains 14 /62 variables (removed 48) and now considering 23/78 (removed 55) transitions.
[2024-05-22 10:27:11] [INFO ] Flow matrix only has 17 transitions (discarded 6 similar events)
// Phase 1: matrix 17 rows 14 cols
[2024-05-22 10:27:11] [INFO ] Computed 0 invariants in 0 ms
[2024-05-22 10:27:11] [INFO ] Implicit Places using invariants in 13 ms returned []
[2024-05-22 10:27:11] [INFO ] Flow matrix only has 17 transitions (discarded 6 similar events)
[2024-05-22 10:27:11] [INFO ] Invariant cache hit.
[2024-05-22 10:27:11] [INFO ] Implicit Places using invariants and state equation in 17 ms returned []
Implicit Place search using SMT with State Equation took 31 ms to find 0 implicit places.
[2024-05-22 10:27:11] [INFO ] Redundant transitions in 0 ms returned []
Running 15 sub problems to find dead transitions.
[2024-05-22 10:27:11] [INFO ] Flow matrix only has 17 transitions (discarded 6 similar events)
[2024-05-22 10:27:11] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/10 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 1 (OVERLAPS) 16/26 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/26 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 3 (OVERLAPS) 4/30 variables, 4/14 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/30 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 5 (OVERLAPS) 0/30 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 15 unsolved
No progress, stopping.
After SMT solving in domain Real declared 30/31 variables, and 14 constraints, problems are : Problem set: 0 solved, 15 unsolved in 88 ms.
Refiners :[State Equation: 14/14 constraints, PredecessorRefiner: 15/15 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 15 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/10 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 1 (OVERLAPS) 16/26 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/26 variables, 15/25 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/26 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 4 (OVERLAPS) 4/30 variables, 4/29 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/30 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 6 (OVERLAPS) 0/30 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 15 unsolved
No progress, stopping.
After SMT solving in domain Int declared 30/31 variables, and 29 constraints, problems are : Problem set: 0 solved, 15 unsolved in 79 ms.
Refiners :[State Equation: 14/14 constraints, PredecessorRefiner: 15/15 constraints, Known Traps: 0/0 constraints]
After SMT, in 171ms problems are : Problem set: 0 solved, 15 unsolved
Search for dead transitions found 0 dead transitions in 171ms
Starting structural reductions in SI_CTL mode, iteration 1 : 14/62 places, 23/78 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 215 ms. Remains : 14/62 places, 23/78 transitions.
[2024-05-22 10:27:12] [INFO ] Flatten gal took : 1 ms
[2024-05-22 10:27:12] [INFO ] Flatten gal took : 1 ms
[2024-05-22 10:27:12] [INFO ] Input system was already deterministic with 23 transitions.
[2024-05-22 10:27:12] [INFO ] Flatten gal took : 1 ms
[2024-05-22 10:27:12] [INFO ] Flatten gal took : 1 ms
[2024-05-22 10:27:12] [INFO ] Time to serialize gal into /tmp/CTLCardinality4444604998802342350.gal : 1 ms
[2024-05-22 10:27:12] [INFO ] Time to serialize properties into /tmp/CTLCardinality2593125920858105826.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/CTLCardinality4444604998802342350.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality2593125920858105826.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,1320,0.002852,3384,2,37,5,190,6,0,66,168,0


Converting to forward existential form...Done !
original formula: AG((EF(((p11==0)||(p53==1))) + (p26==0)))
=> equivalent forward existential formula: [((FwdU(Init,TRUE) * !((p26==0))) * !(E(TRUE U ((p11==0)||(p53==1)))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t0, t6, t10, t20, t21, t22, Intersection with reachable at each step enabled. (destroyed/rev...187
(forward)formula 0,1,0.006842,3700,1,0,44,1188,60,22,344,1166,52
FORMULA DiscoveryGPU-PT-06a-CTLCardinality-2023-15 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

[2024-05-22 10:27:12] [INFO ] Flatten gal took : 3 ms
[2024-05-22 10:27:12] [INFO ] Flatten gal took : 2 ms
Total runtime 16651 ms.

BK_STOP 1716373632084

--------------------
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
+ [[ CTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution CTLCardinality -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 CTLCardinality -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="DiscoveryGPU-PT-06a"
export BK_EXAMINATION="CTLCardinality"
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 DiscoveryGPU-PT-06a, examination is CTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r136-tall-171631132500361"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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