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.r500-smll-171649588000339.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 ltsminxred
Input is IBM5964-PT-none, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r500-smll-171649588000339
=====================================================================

--------------------
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-LTLCardinality-00
FORMULA_NAME IBM5964-PT-none-LTLCardinality-01
FORMULA_NAME IBM5964-PT-none-LTLCardinality-02
FORMULA_NAME IBM5964-PT-none-LTLCardinality-03
FORMULA_NAME IBM5964-PT-none-LTLCardinality-04
FORMULA_NAME IBM5964-PT-none-LTLCardinality-05
FORMULA_NAME IBM5964-PT-none-LTLCardinality-06
FORMULA_NAME IBM5964-PT-none-LTLCardinality-07
FORMULA_NAME IBM5964-PT-none-LTLCardinality-08
FORMULA_NAME IBM5964-PT-none-LTLCardinality-09
FORMULA_NAME IBM5964-PT-none-LTLCardinality-10
FORMULA_NAME IBM5964-PT-none-LTLCardinality-11
FORMULA_NAME IBM5964-PT-none-LTLCardinality-12
FORMULA_NAME IBM5964-PT-none-LTLCardinality-13
FORMULA_NAME IBM5964-PT-none-LTLCardinality-14
FORMULA_NAME IBM5964-PT-none-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1717286099016

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=IBM5964-PT-none
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 23:55:01] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2024-06-01 23:55:01] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 23:55:02] [INFO ] Load time of PNML (sax parser for PT used): 195 ms
[2024-06-01 23:55:02] [INFO ] Transformed 263 places.
[2024-06-01 23:55:02] [INFO ] Transformed 139 transitions.
[2024-06-01 23:55:02] [INFO ] Parsed PT model containing 263 places and 139 transitions and 541 arcs in 623 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 72 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 4 formulas.
FORMULA IBM5964-PT-none-LTLCardinality-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA IBM5964-PT-none-LTLCardinality-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA IBM5964-PT-none-LTLCardinality-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA IBM5964-PT-none-LTLCardinality-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 48 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 110 places
Reduce places removed 118 places and 0 transitions.
Iterating post reduction 0 with 118 rules applied. Total rules applied 118 place count 145 transition count 139
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 122 place count 141 transition count 135
Iterating global reduction 1 with 4 rules applied. Total rules applied 126 place count 141 transition count 135
Applied a total of 126 rules in 110 ms. Remains 141 /263 variables (removed 122) and now considering 135/139 (removed 4) transitions.
// Phase 1: matrix 135 rows 141 cols
[2024-06-01 23:55:02] [INFO ] Computed 12 invariants in 34 ms
[2024-06-01 23:55:03] [INFO ] Implicit Places using invariants in 415 ms returned [27, 113]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 483 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 139/263 places, 135/139 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 137 transition count 133
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 137 transition count 133
Applied a total of 4 rules in 26 ms. Remains 137 /139 variables (removed 2) and now considering 133/135 (removed 2) transitions.
// Phase 1: matrix 133 rows 137 cols
[2024-06-01 23:55:03] [INFO ] Computed 10 invariants in 7 ms
[2024-06-01 23:55:03] [INFO ] Implicit Places using invariants in 131 ms returned []
[2024-06-01 23:55:03] [INFO ] Invariant cache hit.
[2024-06-01 23:55:03] [INFO ] Implicit Places using invariants and state equation in 307 ms returned []
Implicit Place search using SMT with State Equation took 442 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 137/263 places, 133/139 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1103 ms. Remains : 137/263 places, 133/139 transitions.
Support contains 48 out of 137 places after structural reductions.
[2024-06-01 23:55:04] [INFO ] Flatten gal took : 83 ms
[2024-06-01 23:55:04] [INFO ] Flatten gal took : 31 ms
[2024-06-01 23:55:04] [INFO ] Input system was already deterministic with 133 transitions.
RANDOM walk for 40002 steps (841 resets) in 2598 ms. (15 steps per ms) remains 26/32 properties
BEST_FIRST walk for 4004 steps (21 resets) in 105 ms. (37 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4004 steps (24 resets) in 107 ms. (37 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4002 steps (21 resets) in 51 ms. (76 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4003 steps (22 resets) in 50 ms. (78 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4004 steps (28 resets) in 71 ms. (55 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4004 steps (22 resets) in 62 ms. (63 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4003 steps (26 resets) in 44 ms. (88 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4002 steps (23 resets) in 37 ms. (105 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4004 steps (28 resets) in 17 ms. (222 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4003 steps (22 resets) in 17 ms. (222 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4002 steps (20 resets) in 19 ms. (200 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4003 steps (24 resets) in 20 ms. (190 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4003 steps (21 resets) in 25 ms. (153 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4002 steps (21 resets) in 12 ms. (307 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4003 steps (21 resets) in 19 ms. (200 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4004 steps (23 resets) in 14 ms. (266 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4003 steps (22 resets) in 25 ms. (153 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4003 steps (21 resets) in 12 ms. (307 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4004 steps (21 resets) in 14 ms. (266 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4004 steps (20 resets) in 15 ms. (250 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4003 steps (21 resets) in 15 ms. (250 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4003 steps (22 resets) in 27 ms. (142 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4002 steps (20 resets) in 23 ms. (166 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4004 steps (21 resets) in 9 ms. (400 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4003 steps (22 resets) in 14 ms. (266 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4003 steps (22 resets) in 16 ms. (235 steps per ms) remains 26/26 properties
[2024-06-01 23:55:05] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/40 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/40 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 2 (OVERLAPS) 29/69 variables, 4/9 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/69 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 4 (OVERLAPS) 85/154 variables, 69/78 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/154 variables, 0/78 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 6 (OVERLAPS) 85/239 variables, 45/123 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/239 variables, 1/124 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/239 variables, 0/124 constraints. Problems are: Problem set: 0 solved, 26 unsolved
Problem AtomicPropp27 is UNSAT
At refinement iteration 9 (OVERLAPS) 27/266 variables, 20/144 constraints. Problems are: Problem set: 1 solved, 25 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/266 variables, 0/144 constraints. Problems are: Problem set: 1 solved, 25 unsolved
Problem AtomicPropp13 is UNSAT
Problem AtomicPropp14 is UNSAT
Problem AtomicPropp15 is UNSAT
Problem AtomicPropp17 is UNSAT
Problem AtomicPropp18 is UNSAT
Problem AtomicPropp19 is UNSAT
Problem AtomicPropp20 is UNSAT
Problem AtomicPropp21 is UNSAT
Problem AtomicPropp26 is UNSAT
Problem AtomicPropp29 is UNSAT
At refinement iteration 11 (OVERLAPS) 4/270 variables, 3/147 constraints. Problems are: Problem set: 11 solved, 15 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/270 variables, 0/147 constraints. Problems are: Problem set: 11 solved, 15 unsolved
At refinement iteration 13 (OVERLAPS) 0/270 variables, 0/147 constraints. Problems are: Problem set: 11 solved, 15 unsolved
No progress, stopping.
After SMT solving in domain Real declared 270/270 variables, and 147 constraints, problems are : Problem set: 11 solved, 15 unsolved in 1379 ms.
Refiners :[Generalized P Invariants (flows): 10/10 constraints, State Equation: 137/137 constraints, PredecessorRefiner: 26/26 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 11 solved, 15 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/29 variables, 3/3 constraints. Problems are: Problem set: 11 solved, 15 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/29 variables, 0/3 constraints. Problems are: Problem set: 11 solved, 15 unsolved
At refinement iteration 2 (OVERLAPS) 25/54 variables, 4/7 constraints. Problems are: Problem set: 11 solved, 15 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/54 variables, 0/7 constraints. Problems are: Problem set: 11 solved, 15 unsolved
At refinement iteration 4 (OVERLAPS) 68/122 variables, 54/61 constraints. Problems are: Problem set: 11 solved, 15 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/122 variables, 0/61 constraints. Problems are: Problem set: 11 solved, 15 unsolved
At refinement iteration 6 (OVERLAPS) 75/197 variables, 39/100 constraints. Problems are: Problem set: 11 solved, 15 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/197 variables, 1/101 constraints. Problems are: Problem set: 11 solved, 15 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/197 variables, 15/116 constraints. Problems are: Problem set: 11 solved, 15 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/197 variables, 0/116 constraints. Problems are: Problem set: 11 solved, 15 unsolved
Problem AtomicPropp8 is UNSAT
Problem AtomicPropp16 is UNSAT
At refinement iteration 10 (OVERLAPS) 39/236 variables, 24/140 constraints. Problems are: Problem set: 13 solved, 13 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/236 variables, 0/140 constraints. Problems are: Problem set: 13 solved, 13 unsolved
At refinement iteration 12 (OVERLAPS) 19/255 variables, 10/150 constraints. Problems are: Problem set: 13 solved, 13 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/255 variables, 0/150 constraints. Problems are: Problem set: 13 solved, 13 unsolved
At refinement iteration 14 (OVERLAPS) 4/259 variables, 1/151 constraints. Problems are: Problem set: 13 solved, 13 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/259 variables, 0/151 constraints. Problems are: Problem set: 13 solved, 13 unsolved
Problem AtomicPropp0 is UNSAT
Problem AtomicPropp1 is UNSAT
Problem AtomicPropp2 is UNSAT
Problem AtomicPropp3 is UNSAT
Problem AtomicPropp4 is UNSAT
Problem AtomicPropp7 is UNSAT
Problem AtomicPropp11 is UNSAT
Problem AtomicPropp12 is UNSAT
Problem AtomicPropp22 is UNSAT
Problem AtomicPropp23 is UNSAT
Problem AtomicPropp24 is UNSAT
Problem AtomicPropp25 is UNSAT
Problem AtomicPropp28 is UNSAT
After SMT solving in domain Int declared 270/270 variables, and 161 constraints, problems are : Problem set: 26 solved, 0 unsolved in 1307 ms.
Refiners :[Generalized P Invariants (flows): 9/10 constraints, State Equation: 137/137 constraints, PredecessorRefiner: 15/26 constraints, Known Traps: 0/0 constraints]
After SMT, in 2732ms problems are : Problem set: 26 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Successfully simplified 26 atomic propositions for a total of 12 simplifications.
FORMULA IBM5964-PT-none-LTLCardinality-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA IBM5964-PT-none-LTLCardinality-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA IBM5964-PT-none-LTLCardinality-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA IBM5964-PT-none-LTLCardinality-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA IBM5964-PT-none-LTLCardinality-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA IBM5964-PT-none-LTLCardinality-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA IBM5964-PT-none-LTLCardinality-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA IBM5964-PT-none-LTLCardinality-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 137 stabilizing places and 133 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 137 transition count 133
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
FORMULA IBM5964-PT-none-LTLCardinality-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA IBM5964-PT-none-LTLCardinality-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F((p0||G(p1)))&&F(p2))))'
Support contains 4 out of 137 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 137/137 places, 133/133 transitions.
Graph (complete) has 161 edges and 137 vertex of which 55 are kept as prefixes of interest. Removing 82 places using SCC suffix rule.2 ms
Discarding 82 places :
Also discarding 80 output transitions
Drop transitions (Output transitions of discarded places.) removed 80 transitions
Ensure Unique test removed 3 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 23 transitions
Trivial Post-agglo rules discarded 23 transitions
Performed 23 trivial Post agglomeration. Transition count delta: 23
Iterating post reduction 0 with 23 rules applied. Total rules applied 24 place count 52 transition count 30
Reduce places removed 23 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 25 rules applied. Total rules applied 49 place count 29 transition count 28
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 51 place count 27 transition count 28
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 7 Pre rules applied. Total rules applied 51 place count 27 transition count 21
Deduced a syphon composed of 7 places in 1 ms
Ensure Unique test removed 1 places
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 3 with 15 rules applied. Total rules applied 66 place count 19 transition count 21
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 68 place count 17 transition count 19
Iterating global reduction 3 with 2 rules applied. Total rules applied 70 place count 17 transition count 19
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 70 place count 17 transition count 18
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 72 place count 16 transition count 18
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 76 place count 14 transition count 16
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 77 place count 14 transition count 15
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 78 place count 14 transition count 14
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 78 place count 14 transition count 13
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 80 place count 13 transition count 13
Partial Post-agglomeration rule applied 2 times.
Drop transitions (Partial Post agglomeration) removed 2 transitions
Iterating global reduction 4 with 2 rules applied. Total rules applied 82 place count 13 transition count 13
Applied a total of 82 rules in 48 ms. Remains 13 /137 variables (removed 124) and now considering 13/133 (removed 120) transitions.
// Phase 1: matrix 13 rows 13 cols
[2024-06-01 23:55:08] [INFO ] Computed 1 invariants in 1 ms
[2024-06-01 23:55:08] [INFO ] Implicit Places using invariants in 37 ms returned []
[2024-06-01 23:55:08] [INFO ] Invariant cache hit.
[2024-06-01 23:55:08] [INFO ] Implicit Places using invariants and state equation in 48 ms returned [2]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 87 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 12/137 places, 13/133 transitions.
Applied a total of 0 rules in 1 ms. Remains 12 /12 variables (removed 0) and now considering 13/13 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 137 ms. Remains : 12/137 places, 13/133 transitions.
Stuttering acceptance computed with spot in 411 ms :[(OR (NOT p2) (AND (NOT p0) (NOT p1))), (AND (NOT p0) (NOT p1)), (NOT p2)]
Running random walk in product with property : IBM5964-PT-none-LTLCardinality-02
Stuttering criterion allowed to conclude after 81 steps with 13 reset in 5 ms.
FORMULA IBM5964-PT-none-LTLCardinality-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property IBM5964-PT-none-LTLCardinality-02 finished in 683 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(p0)||G(p1))))'
Support contains 2 out of 137 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 137/137 places, 133/133 transitions.
Graph (complete) has 161 edges and 137 vertex of which 15 are kept as prefixes of interest. Removing 122 places using SCC suffix rule.1 ms
Discarding 122 places :
Also discarding 117 output transitions
Drop transitions (Output transitions of discarded places.) removed 117 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 3 place count 14 transition count 13
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 5 place count 12 transition count 13
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 5 place count 12 transition count 10
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 11 place count 9 transition count 10
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 13 place count 7 transition count 8
Iterating global reduction 2 with 2 rules applied. Total rules applied 15 place count 7 transition count 8
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 19 place count 5 transition count 6
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 20 place count 4 transition count 5
Applied a total of 20 rules in 12 ms. Remains 4 /137 variables (removed 133) and now considering 5/133 (removed 128) transitions.
// Phase 1: matrix 5 rows 4 cols
[2024-06-01 23:55:09] [INFO ] Computed 0 invariants in 0 ms
[2024-06-01 23:55:09] [INFO ] Implicit Places using invariants in 22 ms returned []
[2024-06-01 23:55:09] [INFO ] Invariant cache hit.
[2024-06-01 23:55:09] [INFO ] Implicit Places using invariants and state equation in 28 ms returned []
Implicit Place search using SMT with State Equation took 54 ms to find 0 implicit places.
[2024-06-01 23:55:09] [INFO ] Redundant transitions in 0 ms returned []
Running 3 sub problems to find dead transitions.
[2024-06-01 23:55:09] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 5/7 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/7 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 2/9 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/9 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 0/9 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 9/9 variables, and 4 constraints, problems are : Problem set: 0 solved, 3 unsolved in 65 ms.
Refiners :[State Equation: 4/4 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/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 5/7 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/7 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/7 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (OVERLAPS) 2/9 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/9 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/9 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 0/9 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 9/9 variables, and 7 constraints, problems are : Problem set: 0 solved, 3 unsolved in 74 ms.
Refiners :[State Equation: 4/4 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
After SMT, in 145ms problems are : Problem set: 0 solved, 3 unsolved
Search for dead transitions found 0 dead transitions in 146ms
Starting structural reductions in SI_LTL mode, iteration 1 : 4/137 places, 5/133 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 221 ms. Remains : 4/137 places, 5/133 transitions.
Stuttering acceptance computed with spot in 55 ms :[(AND (NOT p0) (NOT p1))]
Running random walk in product with property : IBM5964-PT-none-LTLCardinality-13
Stuttering criterion allowed to conclude after 14 steps with 0 reset in 1 ms.
FORMULA IBM5964-PT-none-LTLCardinality-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property IBM5964-PT-none-LTLCardinality-13 finished in 312 ms.
All properties solved by simple procedures.
Total runtime 7995 ms.
ITS solved all properties within timeout

BK_STOP 1717286109612

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

+ 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//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLCardinality -timeout 360 -rebuildPNML

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="LTLCardinality"
export BK_TOOL="ltsminxred"
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 ltsminxred"
echo " Input is IBM5964-PT-none, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r500-smll-171649588000339"
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 [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "UpperBounds" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] || [ "LTLCardinality" = "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 [ "LTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLCardinality" != "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 "LTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLCardinality.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 '' LTLCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLCardinality"
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 ;