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.r202-smll-171649588000337.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 IBM5964-PT-none, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r202-smll-171649588000337
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 736K
-rw-r--r-- 1 mcc users 16K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 104K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 9.6K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 55K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:42 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.1K May 18 16:42 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 6.4K Apr 22 14:50 LTLCardinality.txt
-rw-r--r-- 1 mcc users 29K Apr 22 14:50 LTLCardinality.xml
-rw-r--r-- 1 mcc users 4.1K Apr 22 14:50 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Apr 22 14:50 LTLFireability.xml
-rw-r--r-- 1 mcc users 22K Apr 11 18:59 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 133K Apr 11 18:59 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 18K Apr 11 18:58 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 88K Apr 11 18:58 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.1K Apr 22 14:50 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.1K Apr 22 14:50 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 5 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 171K 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 IBM5964-PT-none-CTLCardinality-2024-00
FORMULA_NAME IBM5964-PT-none-CTLCardinality-2024-01
FORMULA_NAME IBM5964-PT-none-CTLCardinality-2024-02
FORMULA_NAME IBM5964-PT-none-CTLCardinality-2024-03
FORMULA_NAME IBM5964-PT-none-CTLCardinality-2024-04
FORMULA_NAME IBM5964-PT-none-CTLCardinality-2024-05
FORMULA_NAME IBM5964-PT-none-CTLCardinality-2024-06
FORMULA_NAME IBM5964-PT-none-CTLCardinality-2024-07
FORMULA_NAME IBM5964-PT-none-CTLCardinality-2024-08
FORMULA_NAME IBM5964-PT-none-CTLCardinality-2024-09
FORMULA_NAME IBM5964-PT-none-CTLCardinality-2024-10
FORMULA_NAME IBM5964-PT-none-CTLCardinality-2024-11
FORMULA_NAME IBM5964-PT-none-CTLCardinality-2023-12
FORMULA_NAME IBM5964-PT-none-CTLCardinality-2023-13
FORMULA_NAME IBM5964-PT-none-CTLCardinality-2023-14
FORMULA_NAME IBM5964-PT-none-CTLCardinality-2023-15

=== Now, execution of the tool begins

BK_START 1716776978851

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=CTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=IBM5964-PT-none
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
CTLCardinality PT
Running Version 202405141337
[2024-05-27 02:29:41] [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-27 02:29:41] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-27 02:29:42] [INFO ] Load time of PNML (sax parser for PT used): 194 ms
[2024-05-27 02:29:42] [INFO ] Transformed 263 places.
[2024-05-27 02:29:42] [INFO ] Transformed 139 transitions.
[2024-05-27 02:29:42] [INFO ] Parsed PT model containing 263 places and 139 transitions and 541 arcs in 437 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 39 ms.
Support contains 152 out of 263 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 263/263 places, 139/139 transitions.
Ensure Unique test removed 70 places
Reduce places removed 75 places and 0 transitions.
Iterating post reduction 0 with 75 rules applied. Total rules applied 75 place count 188 transition count 139
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 78 place count 185 transition count 136
Iterating global reduction 1 with 3 rules applied. Total rules applied 81 place count 185 transition count 136
Applied a total of 81 rules in 179 ms. Remains 185 /263 variables (removed 78) and now considering 136/139 (removed 3) transitions.
// Phase 1: matrix 136 rows 185 cols
[2024-05-27 02:29:42] [INFO ] Computed 54 invariants in 43 ms
[2024-05-27 02:29:42] [INFO ] Implicit Places using invariants in 478 ms returned []
[2024-05-27 02:29:42] [INFO ] Invariant cache hit.
[2024-05-27 02:29:43] [INFO ] Implicit Places using invariants and state equation in 356 ms returned []
Implicit Place search using SMT with State Equation took 898 ms to find 0 implicit places.
Running 135 sub problems to find dead transitions.
[2024-05-27 02:29:43] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/180 variables, 49/49 constraints. Problems are: Problem set: 0 solved, 135 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/180 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 135 unsolved
At refinement iteration 2 (OVERLAPS) 5/185 variables, 5/54 constraints. Problems are: Problem set: 0 solved, 135 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/185 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 135 unsolved
Problem TDEAD0 is UNSAT
Problem TDEAD1 is UNSAT
Problem TDEAD2 is UNSAT
Problem TDEAD3 is UNSAT
Problem TDEAD4 is UNSAT
Problem TDEAD6 is UNSAT
Problem TDEAD7 is UNSAT
Problem TDEAD8 is UNSAT
Problem TDEAD10 is UNSAT
Problem TDEAD12 is UNSAT
Problem TDEAD13 is UNSAT
Problem TDEAD15 is UNSAT
Problem TDEAD16 is UNSAT
Problem TDEAD17 is UNSAT
Problem TDEAD18 is UNSAT
Problem TDEAD20 is UNSAT
Problem TDEAD21 is UNSAT
Problem TDEAD22 is UNSAT
Problem TDEAD24 is UNSAT
Problem TDEAD25 is UNSAT
Problem TDEAD26 is UNSAT
Problem TDEAD27 is UNSAT
Problem TDEAD28 is UNSAT
Problem TDEAD29 is UNSAT
Problem TDEAD30 is UNSAT
Problem TDEAD31 is UNSAT
Problem TDEAD32 is UNSAT
Problem TDEAD33 is UNSAT
Problem TDEAD34 is UNSAT
Problem TDEAD35 is UNSAT
Problem TDEAD37 is UNSAT
Problem TDEAD38 is UNSAT
Problem TDEAD40 is UNSAT
Problem TDEAD41 is UNSAT
Problem TDEAD42 is UNSAT
Problem TDEAD43 is UNSAT
Problem TDEAD44 is UNSAT
Problem TDEAD47 is UNSAT
Problem TDEAD48 is UNSAT
Problem TDEAD49 is UNSAT
Problem TDEAD50 is UNSAT
Problem TDEAD51 is UNSAT
Problem TDEAD53 is UNSAT
Problem TDEAD54 is UNSAT
Problem TDEAD57 is UNSAT
Problem TDEAD58 is UNSAT
Problem TDEAD60 is UNSAT
Problem TDEAD63 is UNSAT
Problem TDEAD64 is UNSAT
Problem TDEAD65 is UNSAT
Problem TDEAD66 is UNSAT
Problem TDEAD68 is UNSAT
Problem TDEAD69 is UNSAT
Problem TDEAD70 is UNSAT
Problem TDEAD71 is UNSAT
Problem TDEAD72 is UNSAT
Problem TDEAD73 is UNSAT
Problem TDEAD75 is UNSAT
Problem TDEAD76 is UNSAT
Problem TDEAD77 is UNSAT
Problem TDEAD78 is UNSAT
Problem TDEAD79 is UNSAT
Problem TDEAD80 is UNSAT
Problem TDEAD81 is UNSAT
Problem TDEAD82 is UNSAT
Problem TDEAD83 is UNSAT
Problem TDEAD84 is UNSAT
Problem TDEAD85 is UNSAT
Problem TDEAD86 is UNSAT
Problem TDEAD87 is UNSAT
Problem TDEAD88 is UNSAT
Problem TDEAD89 is UNSAT
Problem TDEAD90 is UNSAT
Problem TDEAD91 is UNSAT
Problem TDEAD92 is UNSAT
Problem TDEAD93 is UNSAT
Problem TDEAD94 is UNSAT
Problem TDEAD95 is UNSAT
Problem TDEAD96 is UNSAT
Problem TDEAD97 is UNSAT
Problem TDEAD99 is UNSAT
Problem TDEAD100 is UNSAT
Problem TDEAD101 is UNSAT
Problem TDEAD102 is UNSAT
Problem TDEAD103 is UNSAT
Problem TDEAD104 is UNSAT
Problem TDEAD105 is UNSAT
Problem TDEAD106 is UNSAT
Problem TDEAD107 is UNSAT
Problem TDEAD108 is UNSAT
Problem TDEAD109 is UNSAT
Problem TDEAD110 is UNSAT
Problem TDEAD111 is UNSAT
Problem TDEAD112 is UNSAT
Problem TDEAD113 is UNSAT
Problem TDEAD114 is UNSAT
Problem TDEAD115 is UNSAT
Problem TDEAD116 is UNSAT
Problem TDEAD117 is UNSAT
Problem TDEAD118 is UNSAT
Problem TDEAD119 is UNSAT
Problem TDEAD120 is UNSAT
Problem TDEAD122 is UNSAT
Problem TDEAD123 is UNSAT
Problem TDEAD124 is UNSAT
Problem TDEAD125 is UNSAT
Problem TDEAD129 is UNSAT
Problem TDEAD130 is UNSAT
Problem TDEAD131 is UNSAT
Problem TDEAD132 is UNSAT
Problem TDEAD135 is UNSAT
At refinement iteration 4 (OVERLAPS) 136/321 variables, 185/239 constraints. Problems are: Problem set: 111 solved, 24 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/321 variables, 0/239 constraints. Problems are: Problem set: 111 solved, 24 unsolved
At refinement iteration 6 (OVERLAPS) 0/321 variables, 0/239 constraints. Problems are: Problem set: 111 solved, 24 unsolved
No progress, stopping.
After SMT solving in domain Real declared 321/321 variables, and 239 constraints, problems are : Problem set: 111 solved, 24 unsolved in 5286 ms.
Refiners :[Generalized P Invariants (flows): 54/54 constraints, State Equation: 185/185 constraints, PredecessorRefiner: 135/135 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 111 solved, 24 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/29 variables, 5/5 constraints. Problems are: Problem set: 111 solved, 24 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/29 variables, 0/5 constraints. Problems are: Problem set: 111 solved, 24 unsolved
At refinement iteration 2 (OVERLAPS) 1/30 variables, 2/7 constraints. Problems are: Problem set: 111 solved, 24 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/30 variables, 0/7 constraints. Problems are: Problem set: 111 solved, 24 unsolved
At refinement iteration 4 (OVERLAPS) 84/114 variables, 2/9 constraints. Problems are: Problem set: 111 solved, 24 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/114 variables, 0/9 constraints. Problems are: Problem set: 111 solved, 24 unsolved
At refinement iteration 6 (OVERLAPS) 42/156 variables, 38/47 constraints. Problems are: Problem set: 111 solved, 24 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/156 variables, 0/47 constraints. Problems are: Problem set: 111 solved, 24 unsolved
At refinement iteration 8 (OVERLAPS) 116/272 variables, 156/203 constraints. Problems are: Problem set: 111 solved, 24 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/272 variables, 21/224 constraints. Problems are: Problem set: 111 solved, 24 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/272 variables, 0/224 constraints. Problems are: Problem set: 111 solved, 24 unsolved
At refinement iteration 11 (OVERLAPS) 10/282 variables, 6/230 constraints. Problems are: Problem set: 111 solved, 24 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/282 variables, 1/231 constraints. Problems are: Problem set: 111 solved, 24 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/282 variables, 3/234 constraints. Problems are: Problem set: 111 solved, 24 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/282 variables, 0/234 constraints. Problems are: Problem set: 111 solved, 24 unsolved
At refinement iteration 15 (OVERLAPS) 10/292 variables, 5/239 constraints. Problems are: Problem set: 111 solved, 24 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/292 variables, 0/239 constraints. Problems are: Problem set: 111 solved, 24 unsolved
At refinement iteration 17 (OVERLAPS) 11/303 variables, 4/243 constraints. Problems are: Problem set: 111 solved, 24 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/303 variables, 0/243 constraints. Problems are: Problem set: 111 solved, 24 unsolved
At refinement iteration 19 (OVERLAPS) 2/305 variables, 2/245 constraints. Problems are: Problem set: 111 solved, 24 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/305 variables, 0/245 constraints. Problems are: Problem set: 111 solved, 24 unsolved
At refinement iteration 21 (OVERLAPS) 12/317 variables, 16/261 constraints. Problems are: Problem set: 111 solved, 24 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/317 variables, 0/261 constraints. Problems are: Problem set: 111 solved, 24 unsolved
At refinement iteration 23 (OVERLAPS) 4/321 variables, 2/263 constraints. Problems are: Problem set: 111 solved, 24 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/321 variables, 0/263 constraints. Problems are: Problem set: 111 solved, 24 unsolved
At refinement iteration 25 (OVERLAPS) 0/321 variables, 0/263 constraints. Problems are: Problem set: 111 solved, 24 unsolved
No progress, stopping.
After SMT solving in domain Int declared 321/321 variables, and 263 constraints, problems are : Problem set: 111 solved, 24 unsolved in 2847 ms.
Refiners :[Generalized P Invariants (flows): 54/54 constraints, State Equation: 185/185 constraints, PredecessorRefiner: 24/135 constraints, Known Traps: 0/0 constraints]
After SMT, in 8242ms problems are : Problem set: 111 solved, 24 unsolved
Search for dead transitions found 111 dead transitions in 8273ms
Found 111 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 111 transitions
Dead transitions reduction (with SMT) removed 111 transitions
Starting structural reductions in LTL mode, iteration 1 : 185/263 places, 25/139 transitions.
Reduce places removed 24 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 25 rules applied. Total rules applied 25 place count 161 transition count 24
Deduced a syphon composed of 129 places in 0 ms
Applied a total of 25 rules in 3 ms. Remains 161 /185 variables (removed 24) and now considering 24/25 (removed 1) transitions.
// Phase 1: matrix 24 rows 161 cols
[2024-05-27 02:29:51] [INFO ] Computed 137 invariants in 7 ms
[2024-05-27 02:29:51] [INFO ] Implicit Places using invariants in 126 ms returned []
[2024-05-27 02:29:51] [INFO ] Invariant cache hit.
[2024-05-27 02:29:51] [INFO ] Implicit Places using invariants and state equation in 173 ms returned []
Implicit Place search using SMT with State Equation took 304 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 161/263 places, 24/139 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 9720 ms. Remains : 161/263 places, 24/139 transitions.
Deduced a syphon composed of 129 places in 0 ms
Reduce places removed 129 places and 0 transitions.
Support contains 11 out of 32 places after structural reductions.
FORMULA IBM5964-PT-none-CTLCardinality-2024-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-27 02:29:52] [INFO ] Initial state reduction rules for CTL removed 7 formulas.
[2024-05-27 02:29:52] [INFO ] Flatten gal took : 36 ms
[2024-05-27 02:29:52] [INFO ] Initial state reduction rules for CTL removed 2 formulas.
FORMULA IBM5964-PT-none-CTLCardinality-2023-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA IBM5964-PT-none-CTLCardinality-2023-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA IBM5964-PT-none-CTLCardinality-2024-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA IBM5964-PT-none-CTLCardinality-2024-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA IBM5964-PT-none-CTLCardinality-2024-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA IBM5964-PT-none-CTLCardinality-2024-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA IBM5964-PT-none-CTLCardinality-2024-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA IBM5964-PT-none-CTLCardinality-2024-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA IBM5964-PT-none-CTLCardinality-2024-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-27 02:29:52] [INFO ] Flatten gal took : 11 ms
[2024-05-27 02:29:52] [INFO ] Input system was already deterministic with 24 transitions.
Support contains 4 out of 32 places (down from 11) after GAL structural reductions.
FORMULA IBM5964-PT-none-CTLCardinality-2023-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 26275 steps (557 resets) in 672 ms. (39 steps per ms) remains 0/3 properties
[2024-05-27 02:29:52] [INFO ] Flatten gal took : 8 ms
[2024-05-27 02:29:52] [INFO ] Flatten gal took : 7 ms
[2024-05-27 02:29:52] [INFO ] Input system was already deterministic with 24 transitions.
Computed a total of 32 stabilizing places and 24 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 32 transition count 24
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
AF dead knowledge conclusive for 2 formulas.
FORMULA IBM5964-PT-none-CTLCardinality-2024-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA IBM5964-PT-none-CTLCardinality-2024-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Starting structural reductions in LTL mode, iteration 0 : 32/32 places, 24/24 transitions.
Ensure Unique test removed 4 places
Reduce places removed 6 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 7 rules applied. Total rules applied 7 place count 26 transition count 23
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 9 place count 24 transition count 21
Iterating global reduction 1 with 2 rules applied. Total rules applied 11 place count 24 transition count 21
Applied a total of 11 rules in 5 ms. Remains 24 /32 variables (removed 8) and now considering 21/24 (removed 3) transitions.
// Phase 1: matrix 21 rows 24 cols
[2024-05-27 02:29:52] [INFO ] Computed 3 invariants in 1 ms
[2024-05-27 02:29:52] [INFO ] Implicit Places using invariants in 52 ms returned [5, 6]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 55 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 22/32 places, 21/24 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 20 transition count 19
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 20 transition count 19
Applied a total of 4 rules in 5 ms. Remains 20 /22 variables (removed 2) and now considering 19/21 (removed 2) transitions.
// Phase 1: matrix 19 rows 20 cols
[2024-05-27 02:29:52] [INFO ] Computed 1 invariants in 1 ms
[2024-05-27 02:29:52] [INFO ] Implicit Places using invariants in 35 ms returned []
[2024-05-27 02:29:52] [INFO ] Invariant cache hit.
[2024-05-27 02:29:52] [INFO ] Implicit Places using invariants and state equation in 50 ms returned []
Implicit Place search using SMT with State Equation took 88 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 20/32 places, 19/24 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 154 ms. Remains : 20/32 places, 19/24 transitions.
[2024-05-27 02:29:52] [INFO ] Flatten gal took : 5 ms
[2024-05-27 02:29:52] [INFO ] Flatten gal took : 4 ms
[2024-05-27 02:29:52] [INFO ] Input system was already deterministic with 19 transitions.
[2024-05-27 02:29:52] [INFO ] Flatten gal took : 4 ms
[2024-05-27 02:29:52] [INFO ] Flatten gal took : 3 ms
[2024-05-27 02:29:52] [INFO ] Time to serialize gal into /tmp/CTLCardinality18084036045206985479.gal : 3 ms
[2024-05-27 02:29:52] [INFO ] Time to serialize properties into /tmp/CTLCardinality13265604535451105826.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/CTLCardinality18084036045206985479.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality13265604535451105826.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

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


Converting to forward existential form...Done !
original formula: AF(EX(TRUE))
=> equivalent forward existential formula: [FwdG(Init,!(EX(TRUE)))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t5, t7, Intersection with reachable at each step enabled. (destroyed/reverse/interse...175
(forward)formula 0,1,0.167087,6028,1,0,85,15161,58,25,551,17169,88
FORMULA IBM5964-PT-none-CTLCardinality-2024-09 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 32/32 places, 24/24 transitions.
Graph (complete) has 43 edges and 32 vertex of which 26 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.2 ms
Discarding 6 places :
Also discarding 4 output transitions
Drop transitions (Output transitions of discarded places.) removed 4 transitions
Ensure Unique test removed 3 places
Reduce places removed 4 places and 1 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 6 rules applied. Total rules applied 7 place count 22 transition count 13
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 13 place count 16 transition count 13
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 13 place count 16 transition count 9
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 21 place count 12 transition count 9
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 22 place count 11 transition count 8
Iterating global reduction 2 with 1 rules applied. Total rules applied 23 place count 11 transition count 8
Performed 1(complex) Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 25 place count 10 transition count 8
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 27 place count 8 transition count 6
Ensure Unique test removed 2 places
Iterating post reduction 2 with 2 rules applied. Total rules applied 29 place count 6 transition count 6
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 30 place count 5 transition count 4
Iterating global reduction 3 with 1 rules applied. Total rules applied 31 place count 5 transition count 4
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 32 place count 4 transition count 3
Applied a total of 32 rules in 72 ms. Remains 4 /32 variables (removed 28) and now considering 3/24 (removed 21) transitions.
// Phase 1: matrix 3 rows 4 cols
[2024-05-27 02:29:53] [INFO ] Computed 1 invariants in 0 ms
[2024-05-27 02:29:53] [INFO ] Implicit Places using invariants in 45 ms returned []
[2024-05-27 02:29:53] [INFO ] Invariant cache hit.
[2024-05-27 02:29:53] [INFO ] Implicit Places using invariants and state equation in 39 ms returned [0]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 86 ms to find 1 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 3/32 places, 3/24 transitions.
Applied a total of 0 rules in 1 ms. Remains 3 /3 variables (removed 0) and now considering 3/3 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 159 ms. Remains : 3/32 places, 3/24 transitions.
[2024-05-27 02:29:53] [INFO ] Flatten gal took : 2 ms
[2024-05-27 02:29:53] [INFO ] Flatten gal took : 1 ms
[2024-05-27 02:29:53] [INFO ] Input system was already deterministic with 3 transitions.
[2024-05-27 02:29:53] [INFO ] Flatten gal took : 1 ms
RANDOM walk for 29 steps (5 resets) in 9 ms. (2 steps per ms) remains 0/1 properties
FORMULA IBM5964-PT-none-CTLCardinality-2024-11 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
[2024-05-27 02:29:53] [INFO ] Flatten gal took : 2 ms
[2024-05-27 02:29:53] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality9561057350346042226.gal : 1 ms
[2024-05-27 02:29:53] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality10814423693983175064.prop : 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-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality9561057350346042226.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality10814423693983175064.prop' '--nowitness' '--gen-order' 'FOLLOW'

ITS runner timed out or was interrupted.
its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...329
Loading property file /tmp/ReachabilityCardinality10814423693983175064.prop.
Found states matching all0 target predicate
Will report total states built up to this point. Computation was interrupted after 3 fixpoint passes
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst,7,0.022473,3344,2,5,5,23,6,0,15,15,0
Total reachable state count : 7
java.io.IOException: Stream closed
at java.base/java.io.BufferedInputStream.getBufIfOpen(BufferedInputStream.java:168)
at java.base/java.io.BufferedInputStream.read(BufferedInputStream.java:334)
at java.base/sun.nio.cs.StreamDecoder.readBytes(StreamDecoder.java:270)
at java.base/sun.nio.cs.StreamDecoder.implRead(StreamDecoder.java:313)
at java.base/sun.nio.cs.StreamDecoder.read(StreamDecoder.java:188)
at java.base/java.io.InputStreamReader.read(InputStreamReader.java:177)
at java.base/java.io.BufferedReader.fill(BufferedReader.java:162)
at java.base/java.io.BufferedReader.readLine(BufferedReader.java:329)
at java.base/java.io.BufferedReader.readLine(BufferedReader.java:396)
at fr.lip6.move.gal.application.runner.its.ITSRunner$ITSInterpreter.run(ITSRunner.java:211)
at java.base/java.lang.Thread.run(Thread.java:840)
ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 32/32 places, 24/24 transitions.
Ensure Unique test removed 4 places
Reduce places removed 6 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 7 rules applied. Total rules applied 7 place count 26 transition count 23
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 9 place count 24 transition count 21
Iterating global reduction 1 with 2 rules applied. Total rules applied 11 place count 24 transition count 21
Applied a total of 11 rules in 4 ms. Remains 24 /32 variables (removed 8) and now considering 21/24 (removed 3) transitions.
// Phase 1: matrix 21 rows 24 cols
[2024-05-27 02:29:53] [INFO ] Computed 3 invariants in 1 ms
[2024-05-27 02:29:53] [INFO ] Implicit Places using invariants in 45 ms returned [5, 6]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 47 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 22/32 places, 21/24 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 20 transition count 19
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 20 transition count 19
Applied a total of 4 rules in 3 ms. Remains 20 /22 variables (removed 2) and now considering 19/21 (removed 2) transitions.
// Phase 1: matrix 19 rows 20 cols
[2024-05-27 02:29:53] [INFO ] Computed 1 invariants in 1 ms
[2024-05-27 02:29:53] [INFO ] Implicit Places using invariants in 38 ms returned []
[2024-05-27 02:29:53] [INFO ] Invariant cache hit.
[2024-05-27 02:29:53] [INFO ] Implicit Places using invariants and state equation in 58 ms returned []
Implicit Place search using SMT with State Equation took 101 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 20/32 places, 19/24 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 155 ms. Remains : 20/32 places, 19/24 transitions.
[2024-05-27 02:29:53] [INFO ] Flatten gal took : 4 ms
[2024-05-27 02:29:53] [INFO ] Flatten gal took : 4 ms
[2024-05-27 02:29:53] [INFO ] Input system was already deterministic with 19 transitions.
[2024-05-27 02:29:53] [INFO ] Flatten gal took : 4 ms
[2024-05-27 02:29:53] [INFO ] Flatten gal took : 4 ms
[2024-05-27 02:29:53] [INFO ] Time to serialize gal into /tmp/CTLCardinality13775506178748543211.gal : 1 ms
[2024-05-27 02:29:53] [INFO ] Time to serialize properties into /tmp/CTLCardinality9027748568923513788.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/CTLCardinality13775506178748543211.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality9027748568923513788.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,7035,0.0189,3724,2,216,5,1700,6,0,101,1723,0


Converting to forward existential form...Done !
original formula: A((!(EX(AX(FALSE))) + EX((callToProcess_s00002538_input_s00000952>=1))) U EF(!(EF((fork_s00001537_activated_s00000993>=1)))))
=> equivalent forward existential formula: [((Init * !(EG(!(E(TRUE U !(E(TRUE U (fork_s00001537_activated_s00000993>=1)))))))) * !(E(!(E(TRUE U !(E(TRUE U ...362
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t5, t7, Intersection with reachable at each step enabled. (destroyed/reverse/interse...175
(forward)formula 0,1,0.144605,6364,1,0,92,16460,64,29,566,17907,103
FORMULA IBM5964-PT-none-CTLCardinality-2023-14 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

[2024-05-27 02:29:53] [INFO ] Flatten gal took : 4 ms
[2024-05-27 02:29:53] [INFO ] Flatten gal took : 4 ms
Total runtime 12176 ms.

BK_STOP 1716776993852

--------------------
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:
++ perl -pe 's/.*\.//g'
++ sed s/.jar//
++ 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="IBM5964-PT-none"
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 IBM5964-PT-none, 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 r202-smll-171649588000337"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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