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.r026-smll-171620167800465.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 BART-PT-020, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r026-smll-171620167800465
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 54M
-rw-r--r-- 1 mcc users 1.2M Apr 12 23:53 CTLCardinality.txt
-rw-r--r-- 1 mcc users 4.1M Apr 12 23:53 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0M Apr 12 23:07 CTLFireability.txt
-rw-r--r-- 1 mcc users 6.4M Apr 12 23:07 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:42 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.4K May 18 16:42 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 604K Apr 22 14:29 LTLCardinality.txt
-rw-r--r-- 1 mcc users 1.5M Apr 22 14:29 LTLCardinality.xml
-rw-r--r-- 1 mcc users 685K Apr 22 14:29 LTLFireability.txt
-rw-r--r-- 1 mcc users 1.7M Apr 22 14:29 LTLFireability.xml
-rw-r--r-- 1 mcc users 2.6M Apr 13 02:14 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 9.2M Apr 13 02:14 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 4.4M Apr 13 00:49 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 15M Apr 13 00:49 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 68K Apr 22 14:29 UpperBounds.txt
-rw-r--r-- 1 mcc users 136K Apr 22 14:29 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 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 4.8M 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 BART-PT-020-CTLCardinality-2024-00
FORMULA_NAME BART-PT-020-CTLCardinality-2024-01
FORMULA_NAME BART-PT-020-CTLCardinality-2024-02
FORMULA_NAME BART-PT-020-CTLCardinality-2024-03
FORMULA_NAME BART-PT-020-CTLCardinality-2024-04
FORMULA_NAME BART-PT-020-CTLCardinality-2024-05
FORMULA_NAME BART-PT-020-CTLCardinality-2024-06
FORMULA_NAME BART-PT-020-CTLCardinality-2024-07
FORMULA_NAME BART-PT-020-CTLCardinality-2024-08
FORMULA_NAME BART-PT-020-CTLCardinality-2024-09
FORMULA_NAME BART-PT-020-CTLCardinality-2024-10
FORMULA_NAME BART-PT-020-CTLCardinality-2024-11
FORMULA_NAME BART-PT-020-CTLCardinality-2024-12
FORMULA_NAME BART-PT-020-CTLCardinality-2024-13
FORMULA_NAME BART-PT-020-CTLCardinality-2024-14
FORMULA_NAME BART-PT-020-CTLCardinality-2024-15

=== Now, execution of the tool begins

BK_START 1716385748753

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=CTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=BART-PT-020
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
CTLCardinality PT
Running Version 202405141337
[2024-05-22 13:49:10] [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 13:49:10] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-22 13:49:12] [INFO ] Load time of PNML (sax parser for PT used): 893 ms
[2024-05-22 13:49:12] [INFO ] Transformed 2850 places.
[2024-05-22 13:49:12] [INFO ] Transformed 4040 transitions.
[2024-05-22 13:49:12] [INFO ] Found NUPN structural information;
[2024-05-22 13:49:12] [INFO ] Parsed PT model containing 2850 places and 4040 transitions and 32400 arcs in 1453 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 205 ms.
Reduce places removed 210 places and 0 transitions.
Initial state reduction rules removed 1 formulas.
FORMULA BART-PT-020-CTLCardinality-2024-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BART-PT-020-CTLCardinality-2024-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BART-PT-020-CTLCardinality-2024-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BART-PT-020-CTLCardinality-2024-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BART-PT-020-CTLCardinality-2024-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 54 out of 2640 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2640/2640 places, 4040/4040 transitions.
Discarding 615 places :
Symmetric choice reduction at 0 with 615 rule applications. Total rules 615 place count 2025 transition count 3425
Iterating global reduction 0 with 615 rules applied. Total rules applied 1230 place count 2025 transition count 3425
Discarding 507 places :
Symmetric choice reduction at 0 with 507 rule applications. Total rules 1737 place count 1518 transition count 2918
Iterating global reduction 0 with 507 rules applied. Total rules applied 2244 place count 1518 transition count 2918
Discarding 74 places :
Symmetric choice reduction at 0 with 74 rule applications. Total rules 2318 place count 1444 transition count 2844
Iterating global reduction 0 with 74 rules applied. Total rules applied 2392 place count 1444 transition count 2844
Discarding 54 places :
Symmetric choice reduction at 0 with 54 rule applications. Total rules 2446 place count 1390 transition count 2790
Iterating global reduction 0 with 54 rules applied. Total rules applied 2500 place count 1390 transition count 2790
Discarding 52 places :
Symmetric choice reduction at 0 with 52 rule applications. Total rules 2552 place count 1338 transition count 2738
Iterating global reduction 0 with 52 rules applied. Total rules applied 2604 place count 1338 transition count 2738
Discarding 52 places :
Symmetric choice reduction at 0 with 52 rule applications. Total rules 2656 place count 1286 transition count 2686
Iterating global reduction 0 with 52 rules applied. Total rules applied 2708 place count 1286 transition count 2686
Discarding 50 places :
Symmetric choice reduction at 0 with 50 rule applications. Total rules 2758 place count 1236 transition count 2636
Iterating global reduction 0 with 50 rules applied. Total rules applied 2808 place count 1236 transition count 2636
Discarding 47 places :
Symmetric choice reduction at 0 with 47 rule applications. Total rules 2855 place count 1189 transition count 2589
Iterating global reduction 0 with 47 rules applied. Total rules applied 2902 place count 1189 transition count 2589
Discarding 32 places :
Symmetric choice reduction at 0 with 32 rule applications. Total rules 2934 place count 1157 transition count 2557
Iterating global reduction 0 with 32 rules applied. Total rules applied 2966 place count 1157 transition count 2557
Discarding 27 places :
Symmetric choice reduction at 0 with 27 rule applications. Total rules 2993 place count 1130 transition count 2530
Iterating global reduction 0 with 27 rules applied. Total rules applied 3020 place count 1130 transition count 2530
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 3034 place count 1116 transition count 2516
Iterating global reduction 0 with 14 rules applied. Total rules applied 3048 place count 1116 transition count 2516
Applied a total of 3048 rules in 1727 ms. Remains 1116 /2640 variables (removed 1524) and now considering 2516/4040 (removed 1524) transitions.
// Phase 1: matrix 2516 rows 1116 cols
[2024-05-22 13:49:14] [INFO ] Computed 20 invariants in 47 ms
[2024-05-22 13:49:15] [INFO ] Implicit Places using invariants in 900 ms returned []
[2024-05-22 13:49:15] [INFO ] Invariant cache hit.
[2024-05-22 13:49:17] [INFO ] Implicit Places using invariants and state equation in 1868 ms returned []
Implicit Place search using SMT with State Equation took 2815 ms to find 0 implicit places.
Running 1796 sub problems to find dead transitions.
[2024-05-22 13:49:17] [INFO ] Invariant cache hit.
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1096/3632 variables, and 0 constraints, problems are : Problem set: 0 solved, 1796 unsolved in 30095 ms.
Refiners :[Positive P Invariants (semi-flows): 0/20 constraints, State Equation: 0/1116 constraints, PredecessorRefiner: 1796/1796 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1796 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1096/3632 variables, and 0 constraints, problems are : Problem set: 0 solved, 1796 unsolved in 30070 ms.
Refiners :[Positive P Invariants (semi-flows): 0/20 constraints, State Equation: 0/1116 constraints, PredecessorRefiner: 0/1796 constraints, Known Traps: 0/0 constraints]
After SMT, in 61374ms problems are : Problem set: 0 solved, 1796 unsolved
Search for dead transitions found 0 dead transitions in 61474ms
Starting structural reductions in LTL mode, iteration 1 : 1116/2640 places, 2516/4040 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 66074 ms. Remains : 1116/2640 places, 2516/4040 transitions.
Support contains 54 out of 1116 places after structural reductions.
[2024-05-22 13:50:19] [INFO ] Initial state reduction rules for CTL removed 3 formulas.
[2024-05-22 13:50:19] [INFO ] Flatten gal took : 224 ms
[2024-05-22 13:50:19] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
FORMULA BART-PT-020-CTLCardinality-2024-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BART-PT-020-CTLCardinality-2024-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BART-PT-020-CTLCardinality-2024-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BART-PT-020-CTLCardinality-2024-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-22 13:50:19] [INFO ] Flatten gal took : 108 ms
[2024-05-22 13:50:19] [INFO ] Input system was already deterministic with 2516 transitions.
Support contains 49 out of 1116 places (down from 54) after GAL structural reductions.
RANDOM walk for 40000 steps (8 resets) in 3742 ms. (10 steps per ms) remains 1/32 properties
BEST_FIRST walk for 40004 steps (8 resets) in 130 ms. (305 steps per ms) remains 1/1 properties
[2024-05-22 13:50:21] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 155/158 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/158 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 368/526 variables, 158/161 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/526 variables, 0/161 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 0/526 variables, 0/161 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 526/3632 variables, and 161 constraints, problems are : Problem set: 0 solved, 1 unsolved in 253 ms.
Refiners :[Positive P Invariants (semi-flows): 3/20 constraints, State Equation: 158/1116 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 155/158 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/158 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 368/526 variables, 158/161 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/526 variables, 1/162 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/526 variables, 0/162 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 0/526 variables, 0/162 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 526/3632 variables, and 162 constraints, problems are : Problem set: 0 solved, 1 unsolved in 352 ms.
Refiners :[Positive P Invariants (semi-flows): 3/20 constraints, State Equation: 158/1116 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 626ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 14 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=7 )
Parikh walk visited 1 properties in 14 ms.
[2024-05-22 13:50:22] [INFO ] Flatten gal took : 121 ms
[2024-05-22 13:50:22] [INFO ] Flatten gal took : 110 ms
[2024-05-22 13:50:22] [INFO ] Input system was already deterministic with 2516 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Starting structural reductions in SI_CTL mode, iteration 0 : 1116/1116 places, 2516/2516 transitions.
Graph (trivial) has 2510 edges and 1116 vertex of which 1108 / 1116 are part of one of the 20 SCC in 12 ms
Free SCC test removed 1088 places
Ensure Unique test removed 2483 transitions
Reduce isomorphic transitions removed 2483 transitions.
Reduce places removed 17 places and 0 transitions.
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 17 rules applied. Total rules applied 18 place count 11 transition count 16
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 3 rules applied. Total rules applied 21 place count 10 transition count 14
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 2 with 3 rules applied. Total rules applied 24 place count 9 transition count 12
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 25 place count 8 transition count 12
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 4 with 3 rules applied. Total rules applied 28 place count 8 transition count 9
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 28 place count 8 transition count 7
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 32 place count 6 transition count 7
Applied a total of 32 rules in 59 ms. Remains 6 /1116 variables (removed 1110) and now considering 7/2516 (removed 2509) transitions.
// Phase 1: matrix 7 rows 6 cols
[2024-05-22 13:50:22] [INFO ] Computed 3 invariants in 1 ms
[2024-05-22 13:50:22] [INFO ] Implicit Places using invariants in 39 ms returned []
[2024-05-22 13:50:22] [INFO ] Invariant cache hit.
[2024-05-22 13:50:22] [INFO ] Implicit Places using invariants and state equation in 27 ms returned []
Implicit Place search using SMT with State Equation took 69 ms to find 0 implicit places.
[2024-05-22 13:50:22] [INFO ] Redundant transitions in 1 ms returned []
Running 3 sub problems to find dead transitions.
[2024-05-22 13:50:22] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 3/6 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/6 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 6/12 variables, 6/9 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/12 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 0/12 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 12/13 variables, and 9 constraints, problems are : Problem set: 0 solved, 3 unsolved in 62 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 6/6 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 3/6 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/6 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 6/12 variables, 6/9 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/12 variables, 3/12 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/12 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 0/12 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 12/13 variables, and 12 constraints, problems are : Problem set: 0 solved, 3 unsolved in 61 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 6/6 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
After SMT, in 130ms problems are : Problem set: 0 solved, 3 unsolved
Search for dead transitions found 0 dead transitions in 131ms
Starting structural reductions in SI_CTL mode, iteration 1 : 6/1116 places, 7/2516 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 266 ms. Remains : 6/1116 places, 7/2516 transitions.
[2024-05-22 13:50:22] [INFO ] Flatten gal took : 1 ms
[2024-05-22 13:50:22] [INFO ] Flatten gal took : 1 ms
[2024-05-22 13:50:22] [INFO ] Input system was already deterministic with 7 transitions.
[2024-05-22 13:50:22] [INFO ] Flatten gal took : 1 ms
[2024-05-22 13:50:22] [INFO ] Flatten gal took : 0 ms
[2024-05-22 13:50:22] [INFO ] Time to serialize gal into /tmp/CTLCardinality12696722598978709080.gal : 2 ms
[2024-05-22 13:50:22] [INFO ] Time to serialize properties into /tmp/CTLCardinality7703490235769397024.ctl : 3 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/CTLCardinality12696722598978709080.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality7703490235769397024.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,8,0.0233,3144,2,13,5,45,5,0,32,27,0


Converting to forward existential form...Done !
original formula: EG(EF(((TrainState_9_4_26==1)&&((TrainState_14_2_35==0)||(TrainState_13_3_23==1)))))
=> equivalent forward existential formula: [FwdG(Init,E(TRUE U ((TrainState_9_4_26==1)&&((TrainState_14_2_35==0)||(TrainState_13_3_23==1)))))] != FALSE
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
(forward)formula 0,1,0.026161,3532,1,0,6,99,16,1,129,45,10
FORMULA BART-PT-020-CTLCardinality-2024-08 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 1116/1116 places, 2516/2516 transitions.
Graph (trivial) has 2504 edges and 1116 vertex of which 1089 / 1116 are part of one of the 20 SCC in 8 ms
Free SCC test removed 1069 places
Ensure Unique test removed 2450 transitions
Reduce isomorphic transitions removed 2450 transitions.
Reduce places removed 16 places and 0 transitions.
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
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 21 rules applied. Total rules applied 22 place count 31 transition count 45
Reduce places removed 6 places and 0 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 1 with 14 rules applied. Total rules applied 36 place count 25 transition count 37
Reduce places removed 4 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 2 with 9 rules applied. Total rules applied 45 place count 21 transition count 32
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 3 with 6 rules applied. Total rules applied 51 place count 19 transition count 28
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 4 with 6 rules applied. Total rules applied 57 place count 17 transition count 24
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 5 with 5 rules applied. Total rules applied 62 place count 15 transition count 21
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 63 place count 14 transition count 21
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 7 with 4 rules applied. Total rules applied 67 place count 14 transition count 17
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 2 Pre rules applied. Total rules applied 67 place count 14 transition count 15
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 7 with 4 rules applied. Total rules applied 71 place count 12 transition count 15
Applied a total of 71 rules in 31 ms. Remains 12 /1116 variables (removed 1104) and now considering 15/2516 (removed 2501) transitions.
// Phase 1: matrix 15 rows 12 cols
[2024-05-22 13:50:22] [INFO ] Computed 4 invariants in 1 ms
[2024-05-22 13:50:23] [INFO ] Implicit Places using invariants in 29 ms returned []
[2024-05-22 13:50:23] [INFO ] Invariant cache hit.
[2024-05-22 13:50:23] [INFO ] Implicit Places using invariants and state equation in 39 ms returned []
Implicit Place search using SMT with State Equation took 71 ms to find 0 implicit places.
[2024-05-22 13:50:23] [INFO ] Redundant transitions in 0 ms returned []
Running 8 sub problems to find dead transitions.
[2024-05-22 13:50:23] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (OVERLAPS) 4/12 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/12 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (OVERLAPS) 14/26 variables, 12/16 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/26 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 5 (OVERLAPS) 0/26 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Real declared 26/27 variables, and 16 constraints, problems are : Problem set: 0 solved, 8 unsolved in 136 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 12/12 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/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (OVERLAPS) 4/12 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/12 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (OVERLAPS) 14/26 variables, 12/16 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/26 variables, 8/24 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/26 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 6 (OVERLAPS) 0/26 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Int declared 26/27 variables, and 24 constraints, problems are : Problem set: 0 solved, 8 unsolved in 119 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 12/12 constraints, PredecessorRefiner: 8/8 constraints, Known Traps: 0/0 constraints]
After SMT, in 263ms problems are : Problem set: 0 solved, 8 unsolved
Search for dead transitions found 0 dead transitions in 263ms
Starting structural reductions in SI_CTL mode, iteration 1 : 12/1116 places, 15/2516 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 374 ms. Remains : 12/1116 places, 15/2516 transitions.
[2024-05-22 13:50:23] [INFO ] Flatten gal took : 8 ms
[2024-05-22 13:50:23] [INFO ] Flatten gal took : 1 ms
[2024-05-22 13:50:23] [INFO ] Input system was already deterministic with 15 transitions.
[2024-05-22 13:50:23] [INFO ] Flatten gal took : 1 ms
[2024-05-22 13:50:23] [INFO ] Flatten gal took : 1 ms
[2024-05-22 13:50:23] [INFO ] Time to serialize gal into /tmp/CTLCardinality7923666928966766763.gal : 2 ms
[2024-05-22 13:50:23] [INFO ] Time to serialize properties into /tmp/CTLCardinality9870867456184325194.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/CTLCardinality7923666928966766763.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality9870867456184325194.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,48,0.004374,3352,2,27,5,113,5,0,64,71,0


Converting to forward existential form...Done !
original formula: (AG(A(((TrainState_3_3_9==0)||(TrainState_20_2_22==1)) U EG(!(((TrainState_17_4_27==0)||(TrainState_17_2_16==1)))))) + (AF((TrainState_16...197
=> equivalent forward existential formula: ([FwdG((Init * !(!(E(TRUE U !(!((E(!(EG(!(((TrainState_17_4_27==0)||(TrainState_17_2_16==1))))) U (!(((TrainStat...706
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Using saturation style SCC detection
Hit Full ! (commute/partial/dont) 12/0/3
(forward)formula 0,0,0.012946,3832,1,0,15,513,38,9,300,386,24
FORMULA BART-PT-020-CTLCardinality-2024-10 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 1116/1116 places, 2516/2516 transitions.
Discarding 33 places :
Symmetric choice reduction at 0 with 33 rule applications. Total rules 33 place count 1083 transition count 2483
Iterating global reduction 0 with 33 rules applied. Total rules applied 66 place count 1083 transition count 2483
Discarding 22 places :
Symmetric choice reduction at 0 with 22 rule applications. Total rules 88 place count 1061 transition count 2461
Iterating global reduction 0 with 22 rules applied. Total rules applied 110 place count 1061 transition count 2461
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 124 place count 1047 transition count 2447
Iterating global reduction 0 with 14 rules applied. Total rules applied 138 place count 1047 transition count 2447
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 150 place count 1035 transition count 2435
Iterating global reduction 0 with 12 rules applied. Total rules applied 162 place count 1035 transition count 2435
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 172 place count 1025 transition count 2425
Iterating global reduction 0 with 10 rules applied. Total rules applied 182 place count 1025 transition count 2425
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 191 place count 1016 transition count 2416
Iterating global reduction 0 with 9 rules applied. Total rules applied 200 place count 1016 transition count 2416
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 207 place count 1009 transition count 2409
Iterating global reduction 0 with 7 rules applied. Total rules applied 214 place count 1009 transition count 2409
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 220 place count 1003 transition count 2403
Iterating global reduction 0 with 6 rules applied. Total rules applied 226 place count 1003 transition count 2403
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 229 place count 1000 transition count 2400
Iterating global reduction 0 with 3 rules applied. Total rules applied 232 place count 1000 transition count 2400
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 234 place count 998 transition count 2398
Iterating global reduction 0 with 2 rules applied. Total rules applied 236 place count 998 transition count 2398
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 237 place count 997 transition count 2397
Iterating global reduction 0 with 1 rules applied. Total rules applied 238 place count 997 transition count 2397
Applied a total of 238 rules in 641 ms. Remains 997 /1116 variables (removed 119) and now considering 2397/2516 (removed 119) transitions.
// Phase 1: matrix 2397 rows 997 cols
[2024-05-22 13:50:24] [INFO ] Computed 20 invariants in 38 ms
[2024-05-22 13:50:24] [INFO ] Implicit Places using invariants in 295 ms returned []
[2024-05-22 13:50:24] [INFO ] Invariant cache hit.
[2024-05-22 13:50:25] [INFO ] Implicit Places using invariants and state equation in 1374 ms returned []
Implicit Place search using SMT with State Equation took 1674 ms to find 0 implicit places.
Running 1677 sub problems to find dead transitions.
[2024-05-22 13:50:25] [INFO ] Invariant cache hit.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 977/3394 variables, and 0 constraints, problems are : Problem set: 0 solved, 1677 unsolved in 30040 ms.
Refiners :[Positive P Invariants (semi-flows): 0/20 constraints, State Equation: 0/997 constraints, PredecessorRefiner: 1677/1677 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1677 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 977/3394 variables, and 0 constraints, problems are : Problem set: 0 solved, 1677 unsolved in 30052 ms.
Refiners :[Positive P Invariants (semi-flows): 0/20 constraints, State Equation: 0/997 constraints, PredecessorRefiner: 0/1677 constraints, Known Traps: 0/0 constraints]
After SMT, in 61004ms problems are : Problem set: 0 solved, 1677 unsolved
Search for dead transitions found 0 dead transitions in 61038ms
Starting structural reductions in LTL mode, iteration 1 : 997/1116 places, 2397/2516 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 63363 ms. Remains : 997/1116 places, 2397/2516 transitions.
[2024-05-22 13:51:26] [INFO ] Flatten gal took : 95 ms
[2024-05-22 13:51:26] [INFO ] Flatten gal took : 85 ms
[2024-05-22 13:51:27] [INFO ] Input system was already deterministic with 2397 transitions.
[2024-05-22 13:51:27] [INFO ] Flatten gal took : 78 ms
[2024-05-22 13:51:27] [INFO ] Flatten gal took : 78 ms
[2024-05-22 13:51:27] [INFO ] Time to serialize gal into /tmp/CTLCardinality6293721386336270603.gal : 53 ms
[2024-05-22 13:51:27] [INFO ] Time to serialize properties into /tmp/CTLCardinality10774013538074818380.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/CTLCardinality6293721386336270603.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality10774013538074818380.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,8.72701e+33,2.30294,22580,2,2161,5,19516,6,0,6388,11027,0


Converting to forward existential form...Done !
original formula: E((AG((TrainState_18_2_6!=1)) * (TrainState_5_1_26!=0)) U (AF((EF((TrainState_18_1_37==1)) * ((((TrainState_2_1_30==0)||(TrainState_18_2_...379
=> equivalent forward existential formula: ([(FwdU(Init,(!(E(TRUE U !((TrainState_18_2_6!=1)))) * (TrainState_5_1_26!=0))) * !(EG(!((E(TRUE U (TrainState_1...649
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Hit Full ! (commute/partial/dont) 2393/0/4
Using saturation style SCC detection
(forward)formula 0,1,15.2516,203972,1,0,15,1.15297e+06,37,6,30335,67924,20
FORMULA BART-PT-020-CTLCardinality-2024-11 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 1116/1116 places, 2516/2516 transitions.
Graph (trivial) has 2492 edges and 1116 vertex of which 1042 / 1116 are part of one of the 19 SCC in 8 ms
Free SCC test removed 1023 places
Ensure Unique test removed 2336 transitions
Reduce isomorphic transitions removed 2336 transitions.
Reduce places removed 13 places and 0 transitions.
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
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 17 rules applied. Total rules applied 18 place count 80 transition count 163
Reduce places removed 5 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 1 with 9 rules applied. Total rules applied 27 place count 75 transition count 159
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 2 with 6 rules applied. Total rules applied 33 place count 73 transition count 155
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 3 with 6 rules applied. Total rules applied 39 place count 71 transition count 151
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 4 with 6 rules applied. Total rules applied 45 place count 69 transition count 147
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 5 with 4 rules applied. Total rules applied 49 place count 67 transition count 145
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 50 place count 66 transition count 145
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 1 Pre rules applied. Total rules applied 50 place count 66 transition count 144
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 52 place count 65 transition count 144
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 9
Deduced a syphon composed of 9 places in 1 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 7 with 18 rules applied. Total rules applied 70 place count 56 transition count 135
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 71 place count 56 transition count 134
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 73 place count 55 transition count 133
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 8 with 2 rules applied. Total rules applied 75 place count 55 transition count 131
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 9 with 2 rules applied. Total rules applied 77 place count 54 transition count 130
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 9 with 2 rules applied. Total rules applied 79 place count 54 transition count 128
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 10 with 2 rules applied. Total rules applied 81 place count 53 transition count 127
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 10 with 2 rules applied. Total rules applied 83 place count 53 transition count 125
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 11 with 2 rules applied. Total rules applied 85 place count 52 transition count 124
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 11 with 2 rules applied. Total rules applied 87 place count 52 transition count 122
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 12 with 2 rules applied. Total rules applied 89 place count 51 transition count 121
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 12 with 2 rules applied. Total rules applied 91 place count 51 transition count 119
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 13 with 2 rules applied. Total rules applied 93 place count 50 transition count 118
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 13 with 2 rules applied. Total rules applied 95 place count 50 transition count 116
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 14 with 2 rules applied. Total rules applied 97 place count 49 transition count 115
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 14 with 2 rules applied. Total rules applied 99 place count 49 transition count 113
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 15 with 2 rules applied. Total rules applied 101 place count 48 transition count 112
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 15 with 2 rules applied. Total rules applied 103 place count 48 transition count 110
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 16 with 2 rules applied. Total rules applied 105 place count 47 transition count 109
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 16 with 2 rules applied. Total rules applied 107 place count 47 transition count 107
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 17 with 2 rules applied. Total rules applied 109 place count 46 transition count 106
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 17 with 2 rules applied. Total rules applied 111 place count 46 transition count 104
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 18 with 2 rules applied. Total rules applied 113 place count 45 transition count 103
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 18 with 2 rules applied. Total rules applied 115 place count 45 transition count 101
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 19 with 2 rules applied. Total rules applied 117 place count 44 transition count 100
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 19 with 2 rules applied. Total rules applied 119 place count 44 transition count 98
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 20 with 2 rules applied. Total rules applied 121 place count 43 transition count 97
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 20 with 2 rules applied. Total rules applied 123 place count 43 transition count 95
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 21 with 2 rules applied. Total rules applied 125 place count 42 transition count 94
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 21 with 2 rules applied. Total rules applied 127 place count 42 transition count 92
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 22 with 2 rules applied. Total rules applied 129 place count 41 transition count 91
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 22 with 2 rules applied. Total rules applied 131 place count 41 transition count 89
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 23 with 2 rules applied. Total rules applied 133 place count 40 transition count 88
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 23 with 2 rules applied. Total rules applied 135 place count 40 transition count 86
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 24 with 2 rules applied. Total rules applied 137 place count 39 transition count 85
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 24 with 2 rules applied. Total rules applied 139 place count 39 transition count 83
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 25 with 2 rules applied. Total rules applied 141 place count 38 transition count 82
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 25 with 2 rules applied. Total rules applied 143 place count 38 transition count 80
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 26 with 2 rules applied. Total rules applied 145 place count 37 transition count 79
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 26 with 2 rules applied. Total rules applied 147 place count 37 transition count 77
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 27 with 2 rules applied. Total rules applied 149 place count 36 transition count 76
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 27 with 2 rules applied. Total rules applied 151 place count 36 transition count 74
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 28 with 2 rules applied. Total rules applied 153 place count 35 transition count 73
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 28 with 2 rules applied. Total rules applied 155 place count 35 transition count 71
Drop transitions (Redundant composition of simpler transitions.) removed 26 transitions
Redundant transition composition rules discarded 26 transitions
Iterating global reduction 29 with 26 rules applied. Total rules applied 181 place count 35 transition count 45
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 29 with 6 rules applied. Total rules applied 187 place count 35 transition count 39
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 30 with 6 rules applied. Total rules applied 193 place count 29 transition count 39
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 31 with 4 Pre rules applied. Total rules applied 193 place count 29 transition count 35
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 31 with 8 rules applied. Total rules applied 201 place count 25 transition count 35
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 31 with 3 rules applied. Total rules applied 204 place count 25 transition count 32
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 31 with 3 rules applied. Total rules applied 207 place count 25 transition count 29
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 32 with 3 rules applied. Total rules applied 210 place count 22 transition count 29
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 33 with 2 rules applied. Total rules applied 212 place count 22 transition count 27
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 33 with 1 rules applied. Total rules applied 213 place count 22 transition count 26
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 34 with 1 rules applied. Total rules applied 214 place count 21 transition count 26
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 35 with 1 Pre rules applied. Total rules applied 214 place count 21 transition count 25
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 35 with 2 rules applied. Total rules applied 216 place count 20 transition count 25
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 35 with 1 rules applied. Total rules applied 217 place count 20 transition count 24
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 35 with 1 Pre rules applied. Total rules applied 217 place count 20 transition count 23
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 35 with 2 rules applied. Total rules applied 219 place count 19 transition count 23
Applied a total of 219 rules in 158 ms. Remains 19 /1116 variables (removed 1097) and now considering 23/2516 (removed 2493) transitions.
// Phase 1: matrix 23 rows 19 cols
[2024-05-22 13:51:42] [INFO ] Computed 7 invariants in 1 ms
[2024-05-22 13:51:42] [INFO ] Implicit Places using invariants in 28 ms returned []
[2024-05-22 13:51:42] [INFO ] Invariant cache hit.
[2024-05-22 13:51:42] [INFO ] Implicit Places using invariants and state equation in 36 ms returned []
Implicit Place search using SMT with State Equation took 68 ms to find 0 implicit places.
[2024-05-22 13:51:42] [INFO ] Redundant transitions in 0 ms returned []
Running 12 sub problems to find dead transitions.
[2024-05-22 13:51:42] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/12 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 1 (OVERLAPS) 7/19 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/19 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 3 (OVERLAPS) 22/41 variables, 19/26 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/41 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 5 (OVERLAPS) 0/41 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 12 unsolved
No progress, stopping.
After SMT solving in domain Real declared 41/42 variables, and 26 constraints, problems are : Problem set: 0 solved, 12 unsolved in 182 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 19/19 constraints, PredecessorRefiner: 12/12 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 12 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/12 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 1 (OVERLAPS) 7/19 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/19 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 3 (OVERLAPS) 22/41 variables, 19/26 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/41 variables, 12/38 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/41 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 6 (OVERLAPS) 0/41 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 12 unsolved
No progress, stopping.
After SMT solving in domain Int declared 41/42 variables, and 38 constraints, problems are : Problem set: 0 solved, 12 unsolved in 145 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 19/19 constraints, PredecessorRefiner: 12/12 constraints, Known Traps: 0/0 constraints]
After SMT, in 332ms problems are : Problem set: 0 solved, 12 unsolved
Search for dead transitions found 0 dead transitions in 333ms
Starting structural reductions in SI_CTL mode, iteration 1 : 19/1116 places, 23/2516 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 569 ms. Remains : 19/1116 places, 23/2516 transitions.
[2024-05-22 13:51:43] [INFO ] Flatten gal took : 2 ms
[2024-05-22 13:51:43] [INFO ] Flatten gal took : 2 ms
[2024-05-22 13:51:43] [INFO ] Input system was already deterministic with 23 transitions.
[2024-05-22 13:51:43] [INFO ] Flatten gal took : 1 ms
[2024-05-22 13:51:43] [INFO ] Flatten gal took : 1 ms
[2024-05-22 13:51:43] [INFO ] Time to serialize gal into /tmp/CTLCardinality15900853918720787843.gal : 1 ms
[2024-05-22 13:51:43] [INFO ] Time to serialize properties into /tmp/CTLCardinality9536806584574256825.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/CTLCardinality15900853918720787843.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality9536806584574256825.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,768,0.004472,3408,2,32,5,135,5,0,100,87,0


Converting to forward existential form...Done !
original formula: A(A(AF(!((((TrainState_16_3_26==0)||(TrainState_19_1_1==0))||(TrainState_7_2_28==1)))) U ((TrainState_1_2_38==0)||(TrainState_1_2_34==1))...304
=> equivalent forward existential formula: [((Init * !(EG(!((!(E(TRUE U !((TrainState_11_4_15==1)))) * EG(((TrainState_7_4_33!=1) + !(!((E(!((TrainState_2_...1055
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Hit Full ! (commute/partial/dont) 20/0/3
Using saturation style SCC detection
Hit Full ! (commute/partial/dont) 18/4/5
(forward)formula 0,0,0.018598,3988,1,0,15,827,50,4,488,491,23
FORMULA BART-PT-020-CTLCardinality-2024-12 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 1116/1116 places, 2516/2516 transitions.
Graph (trivial) has 2476 edges and 1116 vertex of which 1071 / 1116 are part of one of the 20 SCC in 5 ms
Free SCC test removed 1051 places
Ensure Unique test removed 2416 transitions
Reduce isomorphic transitions removed 2416 transitions.
Reduce places removed 11 places and 0 transitions.
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
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 16 rules applied. Total rules applied 17 place count 54 transition count 84
Reduce places removed 6 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 1 with 12 rules applied. Total rules applied 29 place count 48 transition count 78
Reduce places removed 3 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 2 with 7 rules applied. Total rules applied 36 place count 45 transition count 74
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 3 with 6 rules applied. Total rules applied 42 place count 43 transition count 70
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 4 with 6 rules applied. Total rules applied 48 place count 41 transition count 66
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 5 with 6 rules applied. Total rules applied 54 place count 39 transition count 62
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 6 with 6 rules applied. Total rules applied 60 place count 37 transition count 58
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 7 with 6 rules applied. Total rules applied 66 place count 35 transition count 54
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 8 with 4 rules applied. Total rules applied 70 place count 33 transition count 52
Discarding 1 places :
Symmetric choice reduction at 9 with 1 rule applications. Total rules 71 place count 32 transition count 51
Iterating global reduction 9 with 1 rules applied. Total rules applied 72 place count 32 transition count 51
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 9 with 1 rules applied. Total rules applied 73 place count 32 transition count 50
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 10 with 2 rules applied. Total rules applied 75 place count 31 transition count 49
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 10 with 2 rules applied. Total rules applied 77 place count 31 transition count 47
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 11 with 2 rules applied. Total rules applied 79 place count 30 transition count 46
Drop transitions (Redundant composition of simpler transitions.) removed 10 transitions
Redundant transition composition rules discarded 10 transitions
Iterating global reduction 12 with 10 rules applied. Total rules applied 89 place count 30 transition count 36
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 12 with 3 Pre rules applied. Total rules applied 89 place count 30 transition count 33
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 12 with 6 rules applied. Total rules applied 95 place count 27 transition count 33
Applied a total of 95 rules in 48 ms. Remains 27 /1116 variables (removed 1089) and now considering 33/2516 (removed 2483) transitions.
// Phase 1: matrix 33 rows 27 cols
[2024-05-22 13:51:43] [INFO ] Computed 9 invariants in 0 ms
[2024-05-22 13:51:43] [INFO ] Implicit Places using invariants in 32 ms returned []
[2024-05-22 13:51:43] [INFO ] Invariant cache hit.
[2024-05-22 13:51:43] [INFO ] Implicit Places using invariants and state equation in 44 ms returned []
Implicit Place search using SMT with State Equation took 83 ms to find 0 implicit places.
[2024-05-22 13:51:43] [INFO ] Redundant transitions in 0 ms returned []
Running 18 sub problems to find dead transitions.
[2024-05-22 13:51:43] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/18 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 1 (OVERLAPS) 9/27 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/27 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 3 (OVERLAPS) 32/59 variables, 27/36 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/59 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 5 (OVERLAPS) 0/59 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 18 unsolved
No progress, stopping.
After SMT solving in domain Real declared 59/60 variables, and 36 constraints, problems are : Problem set: 0 solved, 18 unsolved in 309 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 27/27 constraints, PredecessorRefiner: 18/18 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 18 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/18 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 1 (OVERLAPS) 9/27 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/27 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 3 (OVERLAPS) 32/59 variables, 27/36 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/59 variables, 18/54 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/59 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 6 (OVERLAPS) 0/59 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 18 unsolved
No progress, stopping.
After SMT solving in domain Int declared 59/60 variables, and 54 constraints, problems are : Problem set: 0 solved, 18 unsolved in 225 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 27/27 constraints, PredecessorRefiner: 18/18 constraints, Known Traps: 0/0 constraints]
After SMT, in 546ms problems are : Problem set: 0 solved, 18 unsolved
Search for dead transitions found 0 dead transitions in 547ms
Starting structural reductions in SI_CTL mode, iteration 1 : 27/1116 places, 33/2516 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 686 ms. Remains : 27/1116 places, 33/2516 transitions.
[2024-05-22 13:51:43] [INFO ] Flatten gal took : 2 ms
[2024-05-22 13:51:43] [INFO ] Flatten gal took : 2 ms
[2024-05-22 13:51:43] [INFO ] Input system was already deterministic with 33 transitions.
[2024-05-22 13:51:43] [INFO ] Flatten gal took : 1 ms
[2024-05-22 13:51:43] [INFO ] Flatten gal took : 2 ms
[2024-05-22 13:51:43] [INFO ] Time to serialize gal into /tmp/CTLCardinality8815931489807505306.gal : 1 ms
[2024-05-22 13:51:43] [INFO ] Time to serialize properties into /tmp/CTLCardinality4296282331766871406.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/CTLCardinality8815931489807505306.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality4296282331766871406.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,9600,0.006187,3472,2,65,5,284,5,0,142,190,0


Converting to forward existential form...Done !
original formula: (AF(((TrainState_12_1_33==0) * EG(!(A((TrainState_11_2_5==1) U (TrainState_19_2_14==1)))))) + (AF(!(E(((TrainState_7_1_18==1)&&((TrainSta...425
=> equivalent forward existential formula: ([FwdG((Init * !(!(EG(!(((TrainState_12_1_33==0) * EG(!(!((E(!((TrainState_19_2_14==1)) U (!((TrainState_11_2_5=...779
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Hit Full ! (commute/partial/dont) 30/0/3
Using saturation style SCC detection
Using saturation style SCC detection
Hit Full ! (commute/partial/dont) 26/2/7
(forward)formula 0,1,0.021334,4316,1,0,19,1902,52,3,679,977,26
FORMULA BART-PT-020-CTLCardinality-2024-13 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 1116/1116 places, 2516/2516 transitions.
Graph (trivial) has 2511 edges and 1116 vertex of which 1114 / 1116 are part of one of the 20 SCC in 3 ms
Free SCC test removed 1094 places
Ensure Unique test removed 2492 transitions
Reduce isomorphic transitions removed 2492 transitions.
Reduce places removed 18 places and 0 transitions.
Ensure Unique test removed 17 transitions
Reduce isomorphic transitions removed 17 transitions.
Iterating post reduction 0 with 17 rules applied. Total rules applied 18 place count 4 transition count 7
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 1 with 2 rules applied. Total rules applied 20 place count 4 transition count 5
Applied a total of 20 rules in 11 ms. Remains 4 /1116 variables (removed 1112) and now considering 5/2516 (removed 2511) transitions.
// Phase 1: matrix 5 rows 4 cols
[2024-05-22 13:51:44] [INFO ] Computed 2 invariants in 6 ms
[2024-05-22 13:51:44] [INFO ] Implicit Places using invariants in 32 ms returned []
[2024-05-22 13:51:44] [INFO ] Invariant cache hit.
[2024-05-22 13:51:44] [INFO ] Implicit Places using invariants and state equation in 19 ms returned []
Implicit Place search using SMT with State Equation took 53 ms to find 0 implicit places.
[2024-05-22 13:51:44] [INFO ] Redundant transitions in 0 ms returned []
Running 2 sub problems to find dead transitions.
[2024-05-22 13:51:44] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 2/4 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/4 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 4/8 variables, 4/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/8 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 0/8 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 8/9 variables, and 6 constraints, problems are : Problem set: 0 solved, 2 unsolved in 31 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 4/4 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 2/4 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/4 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 4/8 variables, 4/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/8 variables, 2/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/8 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 0/8 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 8/9 variables, and 8 constraints, problems are : Problem set: 0 solved, 2 unsolved in 32 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 4/4 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 65ms problems are : Problem set: 0 solved, 2 unsolved
Search for dead transitions found 0 dead transitions in 66ms
Starting structural reductions in SI_CTL mode, iteration 1 : 4/1116 places, 5/2516 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 135 ms. Remains : 4/1116 places, 5/2516 transitions.
[2024-05-22 13:51:44] [INFO ] Flatten gal took : 0 ms
[2024-05-22 13:51:44] [INFO ] Flatten gal took : 1 ms
[2024-05-22 13:51:44] [INFO ] Input system was already deterministic with 5 transitions.
[2024-05-22 13:51:44] [INFO ] Flatten gal took : 0 ms
[2024-05-22 13:51:44] [INFO ] Flatten gal took : 1 ms
[2024-05-22 13:51:44] [INFO ] Time to serialize gal into /tmp/CTLCardinality16236369536464881545.gal : 1 ms
[2024-05-22 13:51:44] [INFO ] Time to serialize properties into /tmp/CTLCardinality1467697343504279094.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/CTLCardinality16236369536464881545.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality1467697343504279094.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,4,0.001774,3288,2,10,5,31,5,0,22,18,0


Converting to forward existential form...Done !
original formula: AF(EG((AG(EF((TrainState_13_2_24==1))) + (TrainState_17_1_5==0))))
=> equivalent forward existential formula: [FwdG(Init,!(EG((!(E(TRUE U !(E(TRUE U (TrainState_13_2_24==1))))) + (TrainState_17_1_5==0)))))] = FALSE
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
(forward)formula 0,1,0.003344,3604,1,0,7,59,19,1,84,30,9
FORMULA BART-PT-020-CTLCardinality-2024-14 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 1116/1116 places, 2516/2516 transitions.
Graph (trivial) has 2512 edges and 1116 vertex of which 1105 / 1116 are part of one of the 20 SCC in 2 ms
Free SCC test removed 1085 places
Ensure Unique test removed 2478 transitions
Reduce isomorphic transitions removed 2478 transitions.
Reduce places removed 18 places and 0 transitions.
Ensure Unique test removed 17 transitions
Reduce isomorphic transitions removed 17 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 19 rules applied. Total rules applied 20 place count 13 transition count 19
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 1 with 6 rules applied. Total rules applied 26 place count 11 transition count 15
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 2 with 6 rules applied. Total rules applied 32 place count 9 transition count 11
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 3 with 4 rules applied. Total rules applied 36 place count 7 transition count 9
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 37 place count 6 transition count 9
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 5 with 2 rules applied. Total rules applied 39 place count 6 transition count 7
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 2 Pre rules applied. Total rules applied 39 place count 6 transition count 5
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 43 place count 4 transition count 5
Applied a total of 43 rules in 15 ms. Remains 4 /1116 variables (removed 1112) and now considering 5/2516 (removed 2511) transitions.
// Phase 1: matrix 5 rows 4 cols
[2024-05-22 13:51:44] [INFO ] Computed 2 invariants in 1 ms
[2024-05-22 13:51:44] [INFO ] Implicit Places using invariants in 15 ms returned []
[2024-05-22 13:51:44] [INFO ] Invariant cache hit.
[2024-05-22 13:51:44] [INFO ] Implicit Places using invariants and state equation in 19 ms returned []
Implicit Place search using SMT with State Equation took 35 ms to find 0 implicit places.
[2024-05-22 13:51:44] [INFO ] Redundant transitions in 0 ms returned []
Running 2 sub problems to find dead transitions.
[2024-05-22 13:51:44] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 2/4 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/4 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 4/8 variables, 4/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/8 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 0/8 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 8/9 variables, and 6 constraints, problems are : Problem set: 0 solved, 2 unsolved in 49 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 4/4 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 2/4 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/4 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 4/8 variables, 4/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/8 variables, 2/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/8 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 0/8 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 8/9 variables, and 8 constraints, problems are : Problem set: 0 solved, 2 unsolved in 28 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 4/4 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 80ms problems are : Problem set: 0 solved, 2 unsolved
Search for dead transitions found 0 dead transitions in 80ms
Starting structural reductions in SI_CTL mode, iteration 1 : 4/1116 places, 5/2516 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 136 ms. Remains : 4/1116 places, 5/2516 transitions.
[2024-05-22 13:51:44] [INFO ] Flatten gal took : 0 ms
[2024-05-22 13:51:44] [INFO ] Flatten gal took : 1 ms
[2024-05-22 13:51:44] [INFO ] Input system was already deterministic with 5 transitions.
[2024-05-22 13:51:44] [INFO ] Flatten gal took : 0 ms
[2024-05-22 13:51:44] [INFO ] Flatten gal took : 0 ms
[2024-05-22 13:51:44] [INFO ] Time to serialize gal into /tmp/CTLCardinality3575741706035721406.gal : 0 ms
[2024-05-22 13:51:44] [INFO ] Time to serialize properties into /tmp/CTLCardinality18136452495622104080.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/CTLCardinality3575741706035721406.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality18136452495622104080.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,4,0.002528,3288,2,10,5,31,5,0,22,18,0


Converting to forward existential form...Done !
original formula: EG((EG((TrainState_6_4_20==1)) + (TrainState_3_4_25==0)))
=> equivalent forward existential formula: [FwdG(Init,(EG((TrainState_6_4_20==1)) + (TrainState_3_4_25==0)))] != FALSE
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
(forward)formula 0,1,0.004191,3604,1,0,9,64,22,6,85,52,15
FORMULA BART-PT-020-CTLCardinality-2024-15 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

ITS tools runner thread asked to quit. Dying gracefully.
[2024-05-22 13:51:44] [INFO ] Flatten gal took : 51 ms
[2024-05-22 13:51:44] [INFO ] Flatten gal took : 59 ms
Total runtime 153519 ms.

BK_STOP 1716385904546

--------------------
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="BART-PT-020"
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 BART-PT-020, 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 r026-smll-171620167800465"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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