Execution Chart

Sorry, for this execution, no execution chart could be reported.

Trace from the execution

Formatting '/mnt/tpsp/fkordon/mcc2024-input.r290-tajo-171654446900337.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2024-input.qcow2' backing_fmt='qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
.................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool itstools
Input is PolyORBLF-PT-S06J06T04, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r290-tajo-171654446900337
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 12M
-rw-r--r-- 1 mcc users 16K Apr 11 17:27 CTLCardinality.txt
-rw-r--r-- 1 mcc users 101K Apr 11 17:27 CTLCardinality.xml
-rw-r--r-- 1 mcc users 221K Apr 11 17:23 CTLFireability.txt
-rw-r--r-- 1 mcc users 855K Apr 11 17:23 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.3K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 9.5K Apr 23 07:44 LTLCardinality.txt
-rw-r--r-- 1 mcc users 42K Apr 23 07:44 LTLCardinality.xml
-rw-r--r-- 1 mcc users 113K Apr 23 07:44 LTLFireability.txt
-rw-r--r-- 1 mcc users 341K Apr 23 07:44 LTLFireability.xml
-rw-r--r-- 1 mcc users 23K Apr 11 17:59 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 134K Apr 11 17:59 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 483K Apr 11 17:56 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 2.1M Apr 11 17:56 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 3.2K Apr 23 07:44 UpperBounds.txt
-rw-r--r-- 1 mcc users 6.8K Apr 23 07:44 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 10 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 6.9M May 18 16:43 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME PolyORBLF-PT-S06J06T04-CTLCardinality-2024-00
FORMULA_NAME PolyORBLF-PT-S06J06T04-CTLCardinality-2024-01
FORMULA_NAME PolyORBLF-PT-S06J06T04-CTLCardinality-2024-02
FORMULA_NAME PolyORBLF-PT-S06J06T04-CTLCardinality-2024-03
FORMULA_NAME PolyORBLF-PT-S06J06T04-CTLCardinality-2024-04
FORMULA_NAME PolyORBLF-PT-S06J06T04-CTLCardinality-2024-05
FORMULA_NAME PolyORBLF-PT-S06J06T04-CTLCardinality-2024-06
FORMULA_NAME PolyORBLF-PT-S06J06T04-CTLCardinality-2024-07
FORMULA_NAME PolyORBLF-PT-S06J06T04-CTLCardinality-2024-08
FORMULA_NAME PolyORBLF-PT-S06J06T04-CTLCardinality-2024-09
FORMULA_NAME PolyORBLF-PT-S06J06T04-CTLCardinality-2024-10
FORMULA_NAME PolyORBLF-PT-S06J06T04-CTLCardinality-2024-11
FORMULA_NAME PolyORBLF-PT-S06J06T04-CTLCardinality-2024-12
FORMULA_NAME PolyORBLF-PT-S06J06T04-CTLCardinality-2024-13
FORMULA_NAME PolyORBLF-PT-S06J06T04-CTLCardinality-2024-14
FORMULA_NAME PolyORBLF-PT-S06J06T04-CTLCardinality-2024-15

=== Now, execution of the tool begins

BK_START 1716920330647

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=CTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=PolyORBLF-PT-S06J06T04
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
CTLCardinality PT
Running Version 202405141337
[2024-05-28 18:18:52] [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-28 18:18:52] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-28 18:18:52] [INFO ] Load time of PNML (sax parser for PT used): 508 ms
[2024-05-28 18:18:52] [INFO ] Transformed 506 places.
[2024-05-28 18:18:53] [INFO ] Transformed 7154 transitions.
[2024-05-28 18:18:53] [INFO ] Parsed PT model containing 506 places and 7154 transitions and 59824 arcs in 721 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 20 ms.
Ensure Unique test removed 5380 transitions
Reduce redundant transitions removed 5380 transitions.
Support contains 318 out of 506 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 506/506 places, 1774/1774 transitions.
Ensure Unique test removed 6 places
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 500 transition count 1774
Applied a total of 6 rules in 75 ms. Remains 500 /506 variables (removed 6) and now considering 1774/1774 (removed 0) transitions.
Running 1768 sub problems to find dead transitions.
[2024-05-28 18:18:53] [INFO ] Flow matrix only has 1750 transitions (discarded 24 similar events)
// Phase 1: matrix 1750 rows 500 cols
[2024-05-28 18:18:53] [INFO ] Computed 48 invariants in 68 ms
[2024-05-28 18:18:53] [INFO ] State equation strengthened by 112 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/494 variables, 19/19 constraints. Problems are: Problem set: 0 solved, 1768 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/494 variables, 18/37 constraints. Problems are: Problem set: 0 solved, 1768 unsolved
[2024-05-28 18:19:21] [INFO ] Deduced a trap composed of 3 places in 106 ms of which 17 ms to minimize.
[2024-05-28 18:19:23] [INFO ] Deduced a trap composed of 83 places in 186 ms of which 4 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 494/2250 variables, and 39 constraints, problems are : Problem set: 0 solved, 1768 unsolved in 20087 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, Generalized P Invariants (flows): 18/29 constraints, State Equation: 0/500 constraints, ReadFeed: 0/112 constraints, PredecessorRefiner: 1768/1768 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1768 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/494 variables, 19/19 constraints. Problems are: Problem set: 0 solved, 1768 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/494 variables, 18/37 constraints. Problems are: Problem set: 0 solved, 1768 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/494 variables, 2/39 constraints. Problems are: Problem set: 0 solved, 1768 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/494 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 1768 unsolved
Problem TDEAD66 is UNSAT
Problem TDEAD79 is UNSAT
Problem TDEAD82 is UNSAT
Problem TDEAD97 is UNSAT
Problem TDEAD123 is UNSAT
Problem TDEAD125 is UNSAT
Problem TDEAD127 is UNSAT
Problem TDEAD129 is UNSAT
Problem TDEAD149 is UNSAT
Problem TDEAD151 is UNSAT
Problem TDEAD162 is UNSAT
Problem TDEAD200 is UNSAT
Problem TDEAD210 is UNSAT
Problem TDEAD219 is UNSAT
Problem TDEAD229 is UNSAT
Problem TDEAD236 is UNSAT
Problem TDEAD241 is UNSAT
Problem TDEAD253 is UNSAT
Problem TDEAD268 is UNSAT
Problem TDEAD285 is UNSAT
Problem TDEAD288 is UNSAT
Problem TDEAD302 is UNSAT
Problem TDEAD307 is UNSAT
Problem TDEAD326 is UNSAT
Problem TDEAD361 is UNSAT
Problem TDEAD366 is UNSAT
Problem TDEAD389 is UNSAT
Problem TDEAD391 is UNSAT
Problem TDEAD400 is UNSAT
Problem TDEAD405 is UNSAT
At refinement iteration 4 (OVERLAPS) 6/500 variables, 11/50 constraints. Problems are: Problem set: 30 solved, 1738 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 500/2250 variables, and 50 constraints, problems are : Problem set: 30 solved, 1738 unsolved in 20093 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, Generalized P Invariants (flows): 29/29 constraints, State Equation: 0/500 constraints, ReadFeed: 0/112 constraints, PredecessorRefiner: 0/1768 constraints, Known Traps: 2/2 constraints]
After SMT, in 55464ms problems are : Problem set: 30 solved, 1738 unsolved
Search for dead transitions found 30 dead transitions in 55522ms
Found 30 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 30 transitions
Dead transitions reduction (with SMT) triggered by suspicious arc values removed 30 transitions.
[2024-05-28 18:19:48] [INFO ] Flow matrix only has 1720 transitions (discarded 24 similar events)
// Phase 1: matrix 1720 rows 500 cols
[2024-05-28 18:19:48] [INFO ] Computed 48 invariants in 113 ms
[2024-05-28 18:19:49] [INFO ] Implicit Places using invariants in 717 ms returned []
[2024-05-28 18:19:49] [INFO ] Flow matrix only has 1720 transitions (discarded 24 similar events)
[2024-05-28 18:19:49] [INFO ] Invariant cache hit.
[2024-05-28 18:19:50] [INFO ] State equation strengthened by 112 read => feed constraints.
[2024-05-28 18:19:54] [INFO ] Implicit Places using invariants and state equation in 4720 ms returned []
Implicit Place search using SMT with State Equation took 5459 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 500/506 places, 1744/1774 transitions.
Applied a total of 0 rules in 38 ms. Remains 500 /500 variables (removed 0) and now considering 1744/1744 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61167 ms. Remains : 500/506 places, 1744/1774 transitions.
Support contains 318 out of 500 places after structural reductions.
[2024-05-28 18:19:55] [INFO ] Flatten gal took : 254 ms
[2024-05-28 18:19:55] [INFO ] Flatten gal took : 159 ms
[2024-05-28 18:19:55] [INFO ] Input system was already deterministic with 1744 transitions.
RANDOM walk for 40000 steps (147 resets) in 2396 ms. (16 steps per ms) remains 52/80 properties
BEST_FIRST walk for 4003 steps (9 resets) in 66 ms. (59 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4000 steps (9 resets) in 132 ms. (30 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4002 steps (11 resets) in 52 ms. (75 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4004 steps (12 resets) in 47 ms. (83 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4002 steps (14 resets) in 92 ms. (43 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4002 steps (10 resets) in 46 ms. (85 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4003 steps (18 resets) in 47 ms. (83 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4002 steps (17 resets) in 40 ms. (97 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4003 steps (11 resets) in 22 ms. (174 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4002 steps (13 resets) in 67 ms. (58 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4000 steps (112 resets) in 40 ms. (97 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4002 steps (16 resets) in 34 ms. (114 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4000 steps (112 resets) in 35 ms. (111 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4002 steps (43 resets) in 46 ms. (85 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4000 steps (112 resets) in 34 ms. (114 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4002 steps (12 resets) in 32 ms. (121 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4003 steps (14 resets) in 41 ms. (95 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4003 steps (11 resets) in 26 ms. (148 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4002 steps (12 resets) in 41 ms. (95 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4002 steps (13 resets) in 26 ms. (148 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4001 steps (11 resets) in 25 ms. (153 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4002 steps (11 resets) in 27 ms. (142 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4003 steps (10 resets) in 32 ms. (121 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4003 steps (16 resets) in 37 ms. (105 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4002 steps (12 resets) in 35 ms. (111 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4003 steps (12 resets) in 54 ms. (72 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4004 steps (15 resets) in 63 ms. (62 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4004 steps (14 resets) in 58 ms. (67 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4004 steps (22 resets) in 35 ms. (111 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4001 steps (15 resets) in 96 ms. (41 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4003 steps (14 resets) in 36 ms. (108 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4001 steps (11 resets) in 36 ms. (108 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4002 steps (16 resets) in 31 ms. (125 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4003 steps (11 resets) in 31 ms. (125 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4001 steps (13 resets) in 30 ms. (129 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4002 steps (10 resets) in 33 ms. (117 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4001 steps (11 resets) in 27 ms. (142 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4004 steps (21 resets) in 37 ms. (105 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4003 steps (14 resets) in 36 ms. (108 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4003 steps (14 resets) in 36 ms. (108 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4000 steps (17 resets) in 36 ms. (108 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4003 steps (16 resets) in 32 ms. (121 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4000 steps (9 resets) in 35 ms. (111 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4002 steps (12 resets) in 29 ms. (133 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4003 steps (13 resets) in 31 ms. (125 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4002 steps (11 resets) in 31 ms. (125 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4002 steps (12 resets) in 30 ms. (129 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4003 steps (14 resets) in 29 ms. (133 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4004 steps (16 resets) in 27 ms. (143 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4003 steps (21 resets) in 30 ms. (129 steps per ms) remains 52/52 properties
[2024-05-28 18:19:57] [INFO ] Flow matrix only has 1720 transitions (discarded 24 similar events)
[2024-05-28 18:19:57] [INFO ] Invariant cache hit.
[2024-05-28 18:19:57] [INFO ] State equation strengthened by 112 read => feed constraints.
Problem AtomicPropp11 is UNSAT
Problem AtomicPropp16 is UNSAT
Problem AtomicPropp20 is UNSAT
Problem AtomicPropp25 is UNSAT
Problem AtomicPropp27 is UNSAT
Problem AtomicPropp29 is UNSAT
Problem AtomicPropp32 is UNSAT
Problem AtomicPropp68 is UNSAT
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/192 variables, 3/3 constraints. Problems are: Problem set: 8 solved, 44 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/192 variables, 6/9 constraints. Problems are: Problem set: 8 solved, 44 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/192 variables, 0/9 constraints. Problems are: Problem set: 8 solved, 44 unsolved
Problem AtomicPropp3 is UNSAT
Problem AtomicPropp42 is UNSAT
Problem AtomicPropp45 is UNSAT
Problem AtomicPropp52 is UNSAT
Problem AtomicPropp58 is UNSAT
Problem AtomicPropp64 is UNSAT
Problem AtomicPropp67 is UNSAT
Problem AtomicPropp73 is UNSAT
At refinement iteration 3 (OVERLAPS) 101/293 variables, 12/21 constraints. Problems are: Problem set: 16 solved, 36 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/293 variables, 1/22 constraints. Problems are: Problem set: 16 solved, 36 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/293 variables, 0/22 constraints. Problems are: Problem set: 16 solved, 36 unsolved
At refinement iteration 6 (OVERLAPS) 12/305 variables, 2/24 constraints. Problems are: Problem set: 16 solved, 36 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/305 variables, 0/24 constraints. Problems are: Problem set: 16 solved, 36 unsolved
Problem AtomicPropp0 is UNSAT
Problem AtomicPropp1 is UNSAT
Problem AtomicPropp2 is UNSAT
Problem AtomicPropp6 is UNSAT
Problem AtomicPropp7 is UNSAT
Problem AtomicPropp8 is UNSAT
Problem AtomicPropp9 is UNSAT
Problem AtomicPropp10 is UNSAT
Problem AtomicPropp13 is UNSAT
Problem AtomicPropp14 is UNSAT
Problem AtomicPropp15 is UNSAT
Problem AtomicPropp17 is UNSAT
Problem AtomicPropp23 is UNSAT
Problem AtomicPropp24 is UNSAT
Problem AtomicPropp26 is UNSAT
Problem AtomicPropp28 is UNSAT
Problem AtomicPropp31 is UNSAT
Problem AtomicPropp35 is UNSAT
Problem AtomicPropp36 is UNSAT
Problem AtomicPropp41 is UNSAT
Problem AtomicPropp43 is UNSAT
Problem AtomicPropp47 is UNSAT
Problem AtomicPropp49 is UNSAT
Problem AtomicPropp50 is UNSAT
Problem AtomicPropp53 is UNSAT
Problem AtomicPropp56 is UNSAT
Problem AtomicPropp61 is UNSAT
Problem AtomicPropp62 is UNSAT
Problem AtomicPropp63 is UNSAT
Problem AtomicPropp66 is UNSAT
Problem AtomicPropp70 is UNSAT
Problem AtomicPropp71 is UNSAT
Problem AtomicPropp75 is UNSAT
Problem AtomicPropp76 is UNSAT
Problem AtomicPropp77 is UNSAT
Problem AtomicPropp79 is UNSAT
After SMT solving in domain Real declared 497/2220 variables, and 46 constraints, problems are : Problem set: 52 solved, 0 unsolved in 805 ms.
Refiners :[Positive P Invariants (semi-flows): 17/19 constraints, Generalized P Invariants (flows): 29/29 constraints, State Equation: 0/500 constraints, ReadFeed: 0/112 constraints, PredecessorRefiner: 52/52 constraints, Known Traps: 0/0 constraints]
After SMT, in 915ms problems are : Problem set: 52 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Successfully simplified 52 atomic propositions for a total of 16 simplifications.
Initial state reduction rules removed 3 formulas.
FORMULA PolyORBLF-PT-S06J06T04-CTLCardinality-2024-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-PT-S06J06T04-CTLCardinality-2024-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-PT-S06J06T04-CTLCardinality-2024-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-PT-S06J06T04-CTLCardinality-2024-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-PT-S06J06T04-CTLCardinality-2024-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-PT-S06J06T04-CTLCardinality-2024-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-PT-S06J06T04-CTLCardinality-2024-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-28 18:19:58] [INFO ] Initial state reduction rules for CTL removed 3 formulas.
[2024-05-28 18:19:58] [INFO ] Flatten gal took : 117 ms
[2024-05-28 18:19:58] [INFO ] Initial state reduction rules for CTL removed 2 formulas.
FORMULA PolyORBLF-PT-S06J06T04-CTLCardinality-2024-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-PT-S06J06T04-CTLCardinality-2024-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-PT-S06J06T04-CTLCardinality-2024-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-PT-S06J06T04-CTLCardinality-2024-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-PT-S06J06T04-CTLCardinality-2024-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-28 18:19:58] [INFO ] Flatten gal took : 118 ms
[2024-05-28 18:19:58] [INFO ] Input system was already deterministic with 1744 transitions.
Support contains 63 out of 500 places (down from 88) after GAL structural reductions.
Computed a total of 0 stabilizing places and 0 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 500/500 places, 1744/1744 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 496 transition count 1740
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 496 transition count 1740
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 12 place count 492 transition count 1736
Iterating global reduction 0 with 4 rules applied. Total rules applied 16 place count 492 transition count 1736
Applied a total of 16 rules in 80 ms. Remains 492 /500 variables (removed 8) and now considering 1736/1744 (removed 8) transitions.
Running 1730 sub problems to find dead transitions.
[2024-05-28 18:19:59] [INFO ] Flow matrix only has 1712 transitions (discarded 24 similar events)
// Phase 1: matrix 1712 rows 492 cols
[2024-05-28 18:19:59] [INFO ] Computed 48 invariants in 53 ms
[2024-05-28 18:19:59] [INFO ] State equation strengthened by 112 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/486 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 1730 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/486 variables, 20/37 constraints. Problems are: Problem set: 0 solved, 1730 unsolved
[2024-05-28 18:20:27] [INFO ] Deduced a trap composed of 3 places in 99 ms of which 2 ms to minimize.
[2024-05-28 18:20:33] [INFO ] Deduced a trap composed of 74 places in 139 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 486/2204 variables, and 39 constraints, problems are : Problem set: 0 solved, 1730 unsolved in 20028 ms.
Refiners :[Positive P Invariants (semi-flows): 17/19 constraints, Generalized P Invariants (flows): 20/29 constraints, State Equation: 0/492 constraints, ReadFeed: 0/112 constraints, PredecessorRefiner: 1730/1730 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1730 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/486 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 1730 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/486 variables, 20/37 constraints. Problems are: Problem set: 0 solved, 1730 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/486 variables, 2/39 constraints. Problems are: Problem set: 0 solved, 1730 unsolved
[2024-05-28 18:20:42] [INFO ] Deduced a trap composed of 92 places in 463 ms of which 5 ms to minimize.
[2024-05-28 18:20:43] [INFO ] Deduced a trap composed of 91 places in 109 ms of which 2 ms to minimize.
[2024-05-28 18:20:43] [INFO ] Deduced a trap composed of 92 places in 72 ms of which 0 ms to minimize.
[2024-05-28 18:20:43] [INFO ] Deduced a trap composed of 11 places in 83 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/486 variables, 4/43 constraints. Problems are: Problem set: 0 solved, 1730 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 486/2204 variables, and 43 constraints, problems are : Problem set: 0 solved, 1730 unsolved in 20027 ms.
Refiners :[Positive P Invariants (semi-flows): 17/19 constraints, Generalized P Invariants (flows): 20/29 constraints, State Equation: 0/492 constraints, ReadFeed: 0/112 constraints, PredecessorRefiner: 0/1730 constraints, Known Traps: 6/6 constraints]
After SMT, in 56382ms problems are : Problem set: 0 solved, 1730 unsolved
Search for dead transitions found 0 dead transitions in 56404ms
[2024-05-28 18:20:55] [INFO ] Flow matrix only has 1712 transitions (discarded 24 similar events)
[2024-05-28 18:20:55] [INFO ] Invariant cache hit.
[2024-05-28 18:20:55] [INFO ] Implicit Places using invariants in 416 ms returned [22, 102, 209, 411]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 429 ms to find 4 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 488/500 places, 1736/1744 transitions.
Applied a total of 0 rules in 16 ms. Remains 488 /488 variables (removed 0) and now considering 1736/1736 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 56936 ms. Remains : 488/500 places, 1736/1744 transitions.
[2024-05-28 18:20:55] [INFO ] Flatten gal took : 71 ms
[2024-05-28 18:20:56] [INFO ] Flatten gal took : 81 ms
[2024-05-28 18:20:56] [INFO ] Input system was already deterministic with 1736 transitions.
[2024-05-28 18:20:56] [INFO ] Flatten gal took : 79 ms
[2024-05-28 18:20:56] [INFO ] Flatten gal took : 80 ms
[2024-05-28 18:20:56] [INFO ] Time to serialize gal into /tmp/CTLCardinality395025684582312075.gal : 45 ms
[2024-05-28 18:20:56] [INFO ] Time to serialize properties into /tmp/CTLCardinality5910814405165965054.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/CTLCardinality395025684582312075.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality5910814405165965054.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 -...282
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2024-05-28 18:21:26] [INFO ] Flatten gal took : 82 ms
[2024-05-28 18:21:26] [INFO ] Applying decomposition
[2024-05-28 18:21:26] [INFO ] Flatten gal took : 77 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph12886624593473831402.txt' '-o' '/tmp/graph12886624593473831402.bin' '-w' '/tmp/graph12886624593473831402.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph12886624593473831402.bin' '-l' '-1' '-v' '-w' '/tmp/graph12886624593473831402.weights' '-q' '0' '-e' '0.001'
[2024-05-28 18:21:27] [INFO ] Decomposing Gal with order
[2024-05-28 18:21:27] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-28 18:21:28] [INFO ] Removed a total of 2169 redundant transitions.
[2024-05-28 18:21:28] [INFO ] Flatten gal took : 1032 ms
[2024-05-28 18:21:29] [INFO ] Fuse similar labels procedure discarded/fused a total of 1031 labels/synchronizations in 148 ms.
[2024-05-28 18:21:29] [INFO ] Time to serialize gal into /tmp/CTLCardinality6616405825935253265.gal : 108 ms
[2024-05-28 18:21:29] [INFO ] Time to serialize properties into /tmp/CTLCardinality11134607718675996703.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/CTLCardinality6616405825935253265.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality11134607718675996703.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.
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 500/500 places, 1744/1744 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 35 transitions
Trivial Post-agglo rules discarded 35 transitions
Performed 35 trivial Post agglomeration. Transition count delta: 35
Iterating post reduction 0 with 35 rules applied. Total rules applied 35 place count 500 transition count 1709
Reduce places removed 35 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 36 rules applied. Total rules applied 71 place count 465 transition count 1708
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 72 place count 464 transition count 1708
Performed 55 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 55 Pre rules applied. Total rules applied 72 place count 464 transition count 1653
Deduced a syphon composed of 55 places in 2 ms
Reduce places removed 55 places and 0 transitions.
Iterating global reduction 3 with 110 rules applied. Total rules applied 182 place count 409 transition count 1653
Performed 42 Post agglomeration using F-continuation condition.Transition count delta: 42
Deduced a syphon composed of 42 places in 1 ms
Reduce places removed 42 places and 0 transitions.
Iterating global reduction 3 with 84 rules applied. Total rules applied 266 place count 367 transition count 1611
Applied a total of 266 rules in 351 ms. Remains 367 /500 variables (removed 133) and now considering 1611/1744 (removed 133) transitions.
Running 1605 sub problems to find dead transitions.
[2024-05-28 18:22:00] [INFO ] Flow matrix only has 1587 transitions (discarded 24 similar events)
// Phase 1: matrix 1587 rows 367 cols
[2024-05-28 18:22:00] [INFO ] Computed 48 invariants in 39 ms
[2024-05-28 18:22:00] [INFO ] State equation strengthened by 112 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/361 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 1605 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/361 variables, 20/37 constraints. Problems are: Problem set: 0 solved, 1605 unsolved
[2024-05-28 18:22:26] [INFO ] Deduced a trap composed of 3 places in 57 ms of which 1 ms to minimize.
[2024-05-28 18:22:27] [INFO ] Deduced a trap composed of 26 places in 130 ms of which 2 ms to minimize.
[2024-05-28 18:22:31] [INFO ] Deduced a trap composed of 25 places in 110 ms of which 2 ms to minimize.
[2024-05-28 18:22:37] [INFO ] Deduced a trap composed of 87 places in 156 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 361/1954 variables, and 41 constraints, problems are : Problem set: 0 solved, 1605 unsolved in 20027 ms.
Refiners :[Positive P Invariants (semi-flows): 17/19 constraints, Generalized P Invariants (flows): 20/29 constraints, State Equation: 0/367 constraints, ReadFeed: 0/112 constraints, PredecessorRefiner: 1605/1605 constraints, Known Traps: 4/4 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1605 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/361 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 1605 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/361 variables, 20/37 constraints. Problems are: Problem set: 0 solved, 1605 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/361 variables, 4/41 constraints. Problems are: Problem set: 0 solved, 1605 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/361 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 1605 unsolved
Problem TDEAD179 is UNSAT
Problem TDEAD180 is UNSAT
Problem TDEAD221 is UNSAT
Problem TDEAD236 is UNSAT
Problem TDEAD240 is UNSAT
Problem TDEAD242 is UNSAT
Problem TDEAD252 is UNSAT
Problem TDEAD270 is UNSAT
Problem TDEAD291 is UNSAT
Problem TDEAD313 is UNSAT
Problem TDEAD323 is UNSAT
Problem TDEAD330 is UNSAT
Problem TDEAD332 is UNSAT
Problem TDEAD343 is UNSAT
Problem TDEAD348 is UNSAT
Problem TDEAD349 is UNSAT
Problem TDEAD353 is UNSAT
Problem TDEAD356 is UNSAT
Problem TDEAD357 is UNSAT
Problem TDEAD359 is UNSAT
Problem TDEAD361 is UNSAT
Problem TDEAD369 is UNSAT
Problem TDEAD375 is UNSAT
Problem TDEAD377 is UNSAT
Problem TDEAD380 is UNSAT
Problem TDEAD402 is UNSAT
Problem TDEAD413 is UNSAT
Problem TDEAD416 is UNSAT
Problem TDEAD424 is UNSAT
Problem TDEAD430 is UNSAT
Problem TDEAD431 is UNSAT
Problem TDEAD433 is UNSAT
Problem TDEAD435 is UNSAT
Problem TDEAD444 is UNSAT
Problem TDEAD455 is UNSAT
Problem TDEAD456 is UNSAT
Problem TDEAD465 is UNSAT
Problem TDEAD471 is UNSAT
Problem TDEAD472 is UNSAT
Problem TDEAD474 is UNSAT
Problem TDEAD480 is UNSAT
Problem TDEAD482 is UNSAT
Problem TDEAD490 is UNSAT
Problem TDEAD504 is UNSAT
Problem TDEAD506 is UNSAT
Problem TDEAD523 is UNSAT
Problem TDEAD532 is UNSAT
Problem TDEAD538 is UNSAT
Problem TDEAD544 is UNSAT
Problem TDEAD550 is UNSAT
Problem TDEAD551 is UNSAT
Problem TDEAD554 is UNSAT
Problem TDEAD561 is UNSAT
Problem TDEAD568 is UNSAT
Problem TDEAD570 is UNSAT
Problem TDEAD574 is UNSAT
Problem TDEAD582 is UNSAT
Problem TDEAD583 is UNSAT
Problem TDEAD588 is UNSAT
Problem TDEAD591 is UNSAT
Problem TDEAD596 is UNSAT
Problem TDEAD598 is UNSAT
Problem TDEAD600 is UNSAT
Problem TDEAD602 is UNSAT
Problem TDEAD613 is UNSAT
Problem TDEAD617 is UNSAT
Problem TDEAD621 is UNSAT
Problem TDEAD622 is UNSAT
Problem TDEAD624 is UNSAT
Problem TDEAD626 is UNSAT
Problem TDEAD630 is UNSAT
Problem TDEAD632 is UNSAT
Problem TDEAD633 is UNSAT
Problem TDEAD638 is UNSAT
Problem TDEAD640 is UNSAT
Problem TDEAD644 is UNSAT
Problem TDEAD649 is UNSAT
Problem TDEAD653 is UNSAT
Problem TDEAD659 is UNSAT
Problem TDEAD665 is UNSAT
Problem TDEAD668 is UNSAT
Problem TDEAD671 is UNSAT
Problem TDEAD681 is UNSAT
Problem TDEAD685 is UNSAT
Problem TDEAD686 is UNSAT
Problem TDEAD690 is UNSAT
Problem TDEAD691 is UNSAT
Problem TDEAD702 is UNSAT
Problem TDEAD706 is UNSAT
Problem TDEAD710 is UNSAT
Problem TDEAD717 is UNSAT
Problem TDEAD728 is UNSAT
Problem TDEAD733 is UNSAT
Problem TDEAD734 is UNSAT
Problem TDEAD737 is UNSAT
Problem TDEAD741 is UNSAT
Problem TDEAD746 is UNSAT
Problem TDEAD750 is UNSAT
Problem TDEAD752 is UNSAT
Problem TDEAD759 is UNSAT
Problem TDEAD760 is UNSAT
Problem TDEAD763 is UNSAT
Problem TDEAD769 is UNSAT
Problem TDEAD782 is UNSAT
Problem TDEAD783 is UNSAT
Problem TDEAD788 is UNSAT
Problem TDEAD789 is UNSAT
Problem TDEAD793 is UNSAT
Problem TDEAD795 is UNSAT
Problem TDEAD801 is UNSAT
Problem TDEAD803 is UNSAT
Problem TDEAD809 is UNSAT
Problem TDEAD811 is UNSAT
Problem TDEAD812 is UNSAT
Problem TDEAD814 is UNSAT
Problem TDEAD815 is UNSAT
Problem TDEAD821 is UNSAT
Problem TDEAD823 is UNSAT
Problem TDEAD833 is UNSAT
Problem TDEAD838 is UNSAT
Problem TDEAD841 is UNSAT
Problem TDEAD842 is UNSAT
Problem TDEAD849 is UNSAT
Problem TDEAD854 is UNSAT
Problem TDEAD857 is UNSAT
Problem TDEAD860 is UNSAT
Problem TDEAD862 is UNSAT
Problem TDEAD866 is UNSAT
Problem TDEAD869 is UNSAT
Problem TDEAD885 is UNSAT
Problem TDEAD886 is UNSAT
Problem TDEAD888 is UNSAT
Problem TDEAD892 is UNSAT
Problem TDEAD893 is UNSAT
Problem TDEAD894 is UNSAT
Problem TDEAD895 is UNSAT
Problem TDEAD897 is UNSAT
Problem TDEAD899 is UNSAT
Problem TDEAD915 is UNSAT
Problem TDEAD916 is UNSAT
Problem TDEAD919 is UNSAT
Problem TDEAD933 is UNSAT
Problem TDEAD937 is UNSAT
Problem TDEAD940 is UNSAT
Problem TDEAD941 is UNSAT
Problem TDEAD943 is UNSAT
Problem TDEAD951 is UNSAT
Problem TDEAD952 is UNSAT
Problem TDEAD954 is UNSAT
Problem TDEAD957 is UNSAT
Problem TDEAD961 is UNSAT
Problem TDEAD963 is UNSAT
Problem TDEAD965 is UNSAT
Problem TDEAD968 is UNSAT
Problem TDEAD969 is UNSAT
Problem TDEAD970 is UNSAT
Problem TDEAD974 is UNSAT
Problem TDEAD976 is UNSAT
Problem TDEAD978 is UNSAT
Problem TDEAD979 is UNSAT
Problem TDEAD980 is UNSAT
Problem TDEAD985 is UNSAT
Problem TDEAD995 is UNSAT
Problem TDEAD998 is UNSAT
Problem TDEAD999 is UNSAT
Problem TDEAD1008 is UNSAT
Problem TDEAD1010 is UNSAT
Problem TDEAD1014 is UNSAT
Problem TDEAD1021 is UNSAT
Problem TDEAD1027 is UNSAT
Problem TDEAD1032 is UNSAT
Problem TDEAD1034 is UNSAT
Problem TDEAD1035 is UNSAT
Problem TDEAD1041 is UNSAT
Problem TDEAD1042 is UNSAT
Problem TDEAD1044 is UNSAT
Problem TDEAD1051 is UNSAT
Problem TDEAD1054 is UNSAT
Problem TDEAD1060 is UNSAT
Problem TDEAD1063 is UNSAT
Problem TDEAD1067 is UNSAT
Problem TDEAD1068 is UNSAT
Problem TDEAD1073 is UNSAT
Problem TDEAD1075 is UNSAT
Problem TDEAD1079 is UNSAT
Problem TDEAD1080 is UNSAT
Problem TDEAD1085 is UNSAT
Problem TDEAD1090 is UNSAT
Problem TDEAD1099 is UNSAT
Problem TDEAD1100 is UNSAT
Problem TDEAD1103 is UNSAT
Problem TDEAD1104 is UNSAT
Problem TDEAD1107 is UNSAT
Problem TDEAD1118 is UNSAT
Problem TDEAD1124 is UNSAT
Problem TDEAD1125 is UNSAT
Problem TDEAD1128 is UNSAT
Problem TDEAD1146 is UNSAT
Problem TDEAD1149 is UNSAT
Problem TDEAD1159 is UNSAT
Problem TDEAD1166 is UNSAT
Problem TDEAD1170 is UNSAT
Problem TDEAD1171 is UNSAT
Problem TDEAD1178 is UNSAT
Problem TDEAD1179 is UNSAT
Problem TDEAD1181 is UNSAT
Problem TDEAD1182 is UNSAT
Problem TDEAD1183 is UNSAT
Problem TDEAD1187 is UNSAT
Problem TDEAD1190 is UNSAT
Problem TDEAD1201 is UNSAT
Problem TDEAD1207 is UNSAT
Problem TDEAD1209 is UNSAT
At refinement iteration 4 (OVERLAPS) 2/363 variables, 2/43 constraints. Problems are: Problem set: 213 solved, 1392 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 363/1954 variables, and 43 constraints, problems are : Problem set: 213 solved, 1392 unsolved in 20514 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, Generalized P Invariants (flows): 20/29 constraints, State Equation: 0/367 constraints, ReadFeed: 0/112 constraints, PredecessorRefiner: 0/1605 constraints, Known Traps: 4/4 constraints]
After SMT, in 58770ms problems are : Problem set: 213 solved, 1392 unsolved
Search for dead transitions found 213 dead transitions in 58793ms
Found 213 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 213 transitions
Dead transitions reduction (with SMT) triggered by suspicious arc values removed 213 transitions.
[2024-05-28 18:22:58] [INFO ] Flow matrix only has 1374 transitions (discarded 24 similar events)
// Phase 1: matrix 1374 rows 367 cols
[2024-05-28 18:22:58] [INFO ] Computed 48 invariants in 159 ms

BK_STOP 1716920581613

--------------------
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="PolyORBLF-PT-S06J06T04"
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 PolyORBLF-PT-S06J06T04, 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 r290-tajo-171654446900337"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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