Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2025-input.r044-tall-174854028600543.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2025-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-5832
Executing tool itstools
Input is CO4-PT-21, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r044-tall-174854028600543
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 764K
-rw-r--r-- 1 mcc users 5.9K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 62K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.9K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 44K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.6K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 120K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.7K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 75K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.5K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.5K May 29 14:47 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 29 14:32 equiv_col
-rw-r--r-- 1 mcc users 3 May 29 14:32 instance
-rw-r--r-- 1 mcc users 6 May 29 14:32 iscolored
-rw-r--r-- 1 mcc users 344K May 29 14:32 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

echo here is the order used to build the result vector(from xml file)
FORMULA_NAME CO4-PT-21-ReachabilityFireability-2025-00
FORMULA_NAME CO4-PT-21-ReachabilityFireability-2025-01
FORMULA_NAME CO4-PT-21-ReachabilityFireability-2025-02
FORMULA_NAME CO4-PT-21-ReachabilityFireability-2025-03
FORMULA_NAME CO4-PT-21-ReachabilityFireability-2025-04
FORMULA_NAME CO4-PT-21-ReachabilityFireability-2025-05
FORMULA_NAME CO4-PT-21-ReachabilityFireability-2025-06
FORMULA_NAME CO4-PT-21-ReachabilityFireability-2025-07
FORMULA_NAME CO4-PT-21-ReachabilityFireability-2025-08
FORMULA_NAME CO4-PT-21-ReachabilityFireability-2025-09
FORMULA_NAME CO4-PT-21-ReachabilityFireability-2025-10
FORMULA_NAME CO4-PT-21-ReachabilityFireability-2025-11
FORMULA_NAME CO4-PT-21-ReachabilityFireability-2025-12
FORMULA_NAME CO4-PT-21-ReachabilityFireability-2025-13
FORMULA_NAME CO4-PT-21-ReachabilityFireability-2025-14
FORMULA_NAME CO4-PT-21-ReachabilityFireability-2025-15

=== Now, execution of the tool begins

BK_START 1748613789710

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=ReachabilityFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=CO4-PT-21
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
ReachabilityFireability PT
Running Version 202505121319
[2025-05-30 14:03:10] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2025-05-30 14:03:10] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-05-30 14:03:11] [INFO ] Load time of PNML (sax parser for PT used): 118 ms
[2025-05-30 14:03:11] [INFO ] Transformed 1400 places.
[2025-05-30 14:03:11] [INFO ] Transformed 1583 transitions.
[2025-05-30 14:03:11] [INFO ] Found NUPN structural information;
[2025-05-30 14:03:11] [INFO ] Parsed PT model containing 1400 places and 1583 transitions and 3434 arcs in 216 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 14 ms.
Working with output stream class java.io.PrintStream
Deduced a syphon composed of 307 places in 16 ms
Reduce places removed 307 places and 347 transitions.
FORMULA CO4-PT-21-ReachabilityFireability-2025-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CO4-PT-21-ReachabilityFireability-2025-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CO4-PT-21-ReachabilityFireability-2025-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 40000 steps (103 resets) in 1381 ms. (28 steps per ms) remains 10/13 properties
FORMULA CO4-PT-21-ReachabilityFireability-2025-09 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CO4-PT-21-ReachabilityFireability-2025-07 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CO4-PT-21-ReachabilityFireability-2025-03 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40002 steps (105 resets) in 323 ms. (123 steps per ms) remains 10/10 properties
[2025-05-30 14:03:11] [INFO ] Flatten gal took : 248 ms
BEST_FIRST walk for 40001 steps (101 resets) in 294 ms. (135 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40000 steps (127 resets) in 217 ms. (183 steps per ms) remains 9/10 properties
FORMULA CO4-PT-21-ReachabilityFireability-2025-00 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
[2025-05-30 14:03:12] [INFO ] Flatten gal took : 138 ms
BEST_FIRST walk for 40002 steps (143 resets) in 173 ms. (229 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40001 steps (124 resets) in 146 ms. (272 steps per ms) remains 9/9 properties
[2025-05-30 14:03:12] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality210408830913726474.gal : 58 ms
[2025-05-30 14:03:12] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality11935935337154473095.prop : 5 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.202505121319/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality210408830913726474.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality11935935337154473095.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...328
BEST_FIRST walk for 40000 steps (87 resets) in 420 ms. (95 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40000 steps (117 resets) in 225 ms. (176 steps per ms) remains 9/9 properties
Loading property file /tmp/ReachabilityCardinality11935935337154473095.prop.
BEST_FIRST walk for 40000 steps (44 resets) in 264 ms. (150 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40000 steps (82 resets) in 190 ms. (209 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40001 steps (109 resets) in 182 ms. (218 steps per ms) remains 9/9 properties
// Phase 1: matrix 1236 rows 1093 cols
[2025-05-30 14:03:12] [INFO ] Computed 9 invariants in 31 ms
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
SDD proceeding with computation,9 properties remain. new max is 4
SDD size :1 after 5
SDD proceeding with computation,9 properties remain. new max is 8
SDD size :5 after 10
SDD proceeding with computation,9 properties remain. new max is 16
SDD size :10 after 14
SDD proceeding with computation,9 properties remain. new max is 32
SDD size :14 after 18
SDD proceeding with computation,9 properties remain. new max is 64
SDD size :18 after 22
SDD proceeding with computation,9 properties remain. new max is 128
SDD size :22 after 26
SDD proceeding with computation,9 properties remain. new max is 256
SDD size :26 after 171
SDD proceeding with computation,9 properties remain. new max is 512
SDD size :171 after 201
SDD proceeding with computation,9 properties remain. new max is 1024
SDD size :201 after 254
SDD proceeding with computation,9 properties remain. new max is 2048
SDD size :254 after 643
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/59 variables, 59/59 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/59 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 9 unsolved
SDD proceeding with computation,9 properties remain. new max is 4096
SDD size :643 after 1330
Problem CO4-PT-21-ReachabilityFireability-2025-12 is UNSAT
FORMULA CO4-PT-21-ReachabilityFireability-2025-12 FALSE TECHNIQUES SMT_REFINEMENT
At refinement iteration 2 (OVERLAPS) 1028/1087 variables, 7/66 constraints. Problems are: Problem set: 1 solved, 8 unsolved
SDD proceeding with computation,9 properties remain. new max is 8192
SDD size :1330 after 809765
At refinement iteration 3 (INCLUDED_ONLY) 0/1087 variables, 1028/1094 constraints. Problems are: Problem set: 1 solved, 8 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1087 variables, 0/1094 constraints. Problems are: Problem set: 1 solved, 8 unsolved
Reachability property CO4-PT-21-ReachabilityFireability-2025-13 is true.
FORMULA CO4-PT-21-ReachabilityFireability-2025-13 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING
SDD proceeding with computation,8 properties remain. new max is 8192
SDD size :809765 after 851092
At refinement iteration 5 (OVERLAPS) 6/1093 variables, 2/1096 constraints. Problems are: Problem set: 2 solved, 7 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1093 variables, 6/1102 constraints. Problems are: Problem set: 2 solved, 7 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1093 variables, 0/1102 constraints. Problems are: Problem set: 2 solved, 7 unsolved
At refinement iteration 8 (OVERLAPS) 1236/2329 variables, 1093/2195 constraints. Problems are: Problem set: 2 solved, 7 unsolved
Reachability property CO4-PT-21-ReachabilityFireability-2025-14 is true.
FORMULA CO4-PT-21-ReachabilityFireability-2025-14 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING
SDD proceeding with computation,7 properties remain. new max is 8192
SDD size :851092 after 3.10232e+06
At refinement iteration 9 (INCLUDED_ONLY) 0/2329 variables, 0/2195 constraints. Problems are: Problem set: 3 solved, 6 unsolved
At refinement iteration 10 (OVERLAPS) 0/2329 variables, 0/2195 constraints. Problems are: Problem set: 3 solved, 6 unsolved
No progress, stopping.
SDD proceeding with computation,7 properties remain. new max is 16384
SDD size :3.10232e+06 after 5.6651e+06
After SMT solving in domain Real declared 2329/2329 variables, and 2195 constraints, problems are : Problem set: 3 solved, 6 unsolved in 4592 ms.
Refiners :[Domain max(s): 1093/1093 constraints, Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 1093/1093 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 3 solved, 6 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/48 variables, 48/48 constraints. Problems are: Problem set: 3 solved, 6 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/48 variables, 0/48 constraints. Problems are: Problem set: 3 solved, 6 unsolved
At refinement iteration 2 (OVERLAPS) 1039/1087 variables, 7/55 constraints. Problems are: Problem set: 3 solved, 6 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1087 variables, 1039/1094 constraints. Problems are: Problem set: 3 solved, 6 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 14:03:18] [INFO ] Deduced a trap composed of 23 places in 205 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 14:03:18] [INFO ] Deduced a trap composed of 366 places in 483 ms of which 245 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 14:03:19] [INFO ] Deduced a trap composed of 453 places in 460 ms of which 231 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 14:03:19] [INFO ] Deduced a trap composed of 366 places in 481 ms of which 241 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 14:03:20] [INFO ] Deduced a trap composed of 453 places in 507 ms of which 232 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/1087 variables, 5/1099 constraints. Problems are: Problem set: 3 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1087 variables, 0/1099 constraints. Problems are: Problem set: 3 solved, 6 unsolved
At refinement iteration 6 (OVERLAPS) 6/1093 variables, 2/1101 constraints. Problems are: Problem set: 3 solved, 6 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1093 variables, 6/1107 constraints. Problems are: Problem set: 3 solved, 6 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1093 variables, 0/1107 constraints. Problems are: Problem set: 3 solved, 6 unsolved
SMT process timed out in 9748ms, After SMT, problems are : Problem set: 3 solved, 6 unsolved
Fused 6 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 48 out of 1093 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1093/1093 places, 1236/1236 transitions.
Graph (trivial) has 989 edges and 1093 vertex of which 3 / 1093 are part of one of the 1 SCC in 6 ms
Free SCC test removed 2 places
Drop transitions (Empty/Sink Transition effects.) removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Graph (complete) has 1468 edges and 1091 vertex of which 1028 are kept as prefixes of interest. Removing 63 places using SCC suffix rule.4 ms
Discarding 63 places :
Also discarding 37 output transitions
Drop transitions (Output transitions of discarded places.) removed 37 transitions
Drop transitions (Empty/Sink Transition effects.) removed 18 transitions
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 21 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 581 transitions
Trivial Post-agglo rules discarded 581 transitions
Performed 581 trivial Post agglomeration. Transition count delta: 581
Iterating post reduction 0 with 602 rules applied. Total rules applied 604 place count 1028 transition count 594
Reduce places removed 581 places and 0 transitions.
Performed 36 Post agglomeration using F-continuation condition.Transition count delta: 36
Iterating post reduction 1 with 617 rules applied. Total rules applied 1221 place count 447 transition count 558
Reduce places removed 36 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 38 rules applied. Total rules applied 1259 place count 411 transition count 556
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 1260 place count 410 transition count 556
Performed 18 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 18 Pre rules applied. Total rules applied 1260 place count 410 transition count 538
Deduced a syphon composed of 18 places in 1 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 4 with 36 rules applied. Total rules applied 1296 place count 392 transition count 538
Discarding 50 places :
Symmetric choice reduction at 4 with 50 rule applications. Total rules 1346 place count 342 transition count 488
Iterating global reduction 4 with 50 rules applied. Total rules applied 1396 place count 342 transition count 488
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 1398 place count 342 transition count 486
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 11 Pre rules applied. Total rules applied 1398 place count 342 transition count 475
Deduced a syphon composed of 11 places in 1 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 5 with 22 rules applied. Total rules applied 1420 place count 331 transition count 475
Discarding 21 places :
Symmetric choice reduction at 5 with 21 rule applications. Total rules 1441 place count 310 transition count 454
Iterating global reduction 5 with 21 rules applied. Total rules applied 1462 place count 310 transition count 454
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 5 with 4 rules applied. Total rules applied 1466 place count 310 transition count 450
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 1467 place count 309 transition count 450
Performed 93 Post agglomeration using F-continuation condition with reduction of 9 identical transitions.
Deduced a syphon composed of 93 places in 0 ms
Reduce places removed 93 places and 0 transitions.
Iterating global reduction 7 with 186 rules applied. Total rules applied 1653 place count 216 transition count 348
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 7 with 4 rules applied. Total rules applied 1657 place count 216 transition count 344
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 1658 place count 215 transition count 343
Iterating global reduction 8 with 1 rules applied. Total rules applied 1659 place count 215 transition count 343
Performed 38 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 38 places in 1 ms
Reduce places removed 38 places and 0 transitions.
Iterating global reduction 8 with 76 rules applied. Total rules applied 1735 place count 177 transition count 345
Ensure Unique test removed 17 transitions
Reduce isomorphic transitions removed 17 transitions.
Iterating post reduction 8 with 17 rules applied. Total rules applied 1752 place count 177 transition count 328
Discarding 26 places :
Symmetric choice reduction at 9 with 26 rule applications. Total rules 1778 place count 151 transition count 276
Iterating global reduction 9 with 26 rules applied. Total rules applied 1804 place count 151 transition count 276
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Iterating post reduction 9 with 13 rules applied. Total rules applied 1817 place count 151 transition count 263
Discarding 4 places :
Symmetric choice reduction at 10 with 4 rule applications. Total rules 1821 place count 147 transition count 252
Iterating global reduction 10 with 4 rules applied. Total rules applied 1825 place count 147 transition count 252
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 10 with 2 rules applied. Total rules applied 1827 place count 147 transition count 250
Drop transitions (Redundant composition of simpler transitions.) removed 9 transitions
Redundant transition composition rules discarded 9 transitions
Iterating global reduction 11 with 9 rules applied. Total rules applied 1836 place count 147 transition count 241
Free-agglomeration rule applied 9 times.
Iterating global reduction 11 with 9 rules applied. Total rules applied 1845 place count 147 transition count 232
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 11 with 9 rules applied. Total rules applied 1854 place count 138 transition count 232
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 12 with 1 rules applied. Total rules applied 1855 place count 138 transition count 231
Partial Free-agglomeration rule applied 5 times.
Drop transitions (Partial Free agglomeration) removed 5 transitions
Iterating global reduction 12 with 5 rules applied. Total rules applied 1860 place count 138 transition count 231
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 12 with 1 rules applied. Total rules applied 1861 place count 138 transition count 230
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 12 with 1 rules applied. Total rules applied 1862 place count 138 transition count 230
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 12 with 1 rules applied. Total rules applied 1863 place count 137 transition count 229
Applied a total of 1863 rules in 211 ms. Remains 137 /1093 variables (removed 956) and now considering 229/1236 (removed 1007) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 216 ms. Remains : 137/1093 places, 229/1236 transitions.
RANDOM walk for 40000 steps (1853 resets) in 756 ms. (52 steps per ms) remains 3/6 properties
FORMULA CO4-PT-21-ReachabilityFireability-2025-10 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CO4-PT-21-ReachabilityFireability-2025-06 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CO4-PT-21-ReachabilityFireability-2025-05 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40003 steps (366 resets) in 114 ms. (347 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (355 resets) in 77 ms. (512 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (339 resets) in 68 ms. (579 steps per ms) remains 2/3 properties
FORMULA CO4-PT-21-ReachabilityFireability-2025-15 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
[2025-05-30 14:03:23] [INFO ] Flow matrix only has 217 transitions (discarded 12 similar events)
// Phase 1: matrix 217 rows 137 cols
[2025-05-30 14:03:23] [INFO ] Computed 0 invariants in 1 ms
[2025-05-30 14:03:23] [INFO ] State equation strengthened by 4 read => feed constraints.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/25 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 91/116 variables, 25/25 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/116 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 166/282 variables, 62/87 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/282 variables, 2/89 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/282 variables, 0/89 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 66/348 variables, 45/134 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/348 variables, 2/136 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/348 variables, 0/136 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 6/354 variables, 5/141 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/354 variables, 0/141 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 0/354 variables, 0/141 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 354/354 variables, and 141 constraints, problems are : Problem set: 0 solved, 2 unsolved in 140 ms.
Refiners :[State Equation: 137/137 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/25 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 91/116 variables, 25/25 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/116 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 166/282 variables, 62/87 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/282 variables, 2/89 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/282 variables, 2/91 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/282 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 66/348 variables, 45/136 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/348 variables, 2/138 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/348 variables, 0/138 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 6/354 variables, 5/143 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/354 variables, 0/143 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 0/354 variables, 0/143 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 354/354 variables, and 143 constraints, problems are : Problem set: 0 solved, 2 unsolved in 389 ms.
Refiners :[State Equation: 137/137 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 542ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
FORMULA CO4-PT-21-ReachabilityFireability-2025-01 TRUE TECHNIQUES PARIKH_WALK
Parikh walk visited 1 properties in 27 ms.
Support contains 10 out of 137 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 137/137 places, 229/229 transitions.
Graph (complete) has 344 edges and 137 vertex of which 135 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.0 ms
Discarding 2 places :
Also discarding 2 output transitions
Drop transitions (Output transitions of discarded places.) removed 2 transitions
Drop transitions (Empty/Sink Transition effects.) removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 16 transitions
Trivial Post-agglo rules discarded 16 transitions
Performed 16 trivial Post agglomeration. Transition count delta: 16
Iterating post reduction 0 with 21 rules applied. Total rules applied 22 place count 135 transition count 206
Reduce places removed 16 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 20 rules applied. Total rules applied 42 place count 119 transition count 202
Reduce places removed 1 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 2 rules applied. Total rules applied 44 place count 118 transition count 201
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 45 place count 117 transition count 201
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 12 Pre rules applied. Total rules applied 45 place count 117 transition count 189
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 4 with 24 rules applied. Total rules applied 69 place count 105 transition count 189
Discarding 7 places :
Symmetric choice reduction at 4 with 7 rule applications. Total rules 76 place count 98 transition count 181
Iterating global reduction 4 with 7 rules applied. Total rules applied 83 place count 98 transition count 181
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 84 place count 98 transition count 180
Performed 15 Post agglomeration using F-continuation condition.Transition count delta: 15
Deduced a syphon composed of 15 places in 1 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 5 with 31 rules applied. Total rules applied 115 place count 82 transition count 165
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 5 with 6 rules applied. Total rules applied 121 place count 82 transition count 159
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 122 place count 81 transition count 159
Discarding 6 places :
Symmetric choice reduction at 7 with 6 rule applications. Total rules 128 place count 75 transition count 147
Iterating global reduction 7 with 6 rules applied. Total rules applied 134 place count 75 transition count 147
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 7 with 3 rules applied. Total rules applied 137 place count 75 transition count 144
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 8 with 10 rules applied. Total rules applied 147 place count 70 transition count 146
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 8 with 4 rules applied. Total rules applied 151 place count 70 transition count 142
Discarding 5 places :
Symmetric choice reduction at 9 with 5 rule applications. Total rules 156 place count 65 transition count 131
Iterating global reduction 9 with 5 rules applied. Total rules applied 161 place count 65 transition count 131
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 9 with 4 rules applied. Total rules applied 165 place count 65 transition count 127
Discarding 3 places :
Symmetric choice reduction at 10 with 3 rule applications. Total rules 168 place count 62 transition count 118
Iterating global reduction 10 with 3 rules applied. Total rules applied 171 place count 62 transition count 118
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 10 with 2 rules applied. Total rules applied 173 place count 62 transition count 116
Drop transitions (Redundant composition of simpler transitions.) removed 5 transitions
Redundant transition composition rules discarded 5 transitions
Iterating global reduction 11 with 5 rules applied. Total rules applied 178 place count 62 transition count 111
Free-agglomeration rule applied 3 times.
Iterating global reduction 11 with 3 rules applied. Total rules applied 181 place count 62 transition count 108
Reduce places removed 4 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Graph (complete) has 171 edges and 58 vertex of which 57 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Graph (trivial) has 14 edges and 57 vertex of which 2 / 57 are part of one of the 1 SCC in 0 ms
Free SCC test removed 1 places
Iterating post reduction 11 with 8 rules applied. Total rules applied 189 place count 56 transition count 106
Drop transitions (Empty/Sink Transition effects.) removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Graph (complete) has 165 edges and 56 vertex of which 54 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.0 ms
Discarding 2 places :
Also discarding 0 output transitions
Iterating post reduction 12 with 4 rules applied. Total rules applied 193 place count 54 transition count 103
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 13 with 2 rules applied. Total rules applied 195 place count 54 transition count 101
Drop transitions (Redundant composition of simpler transitions.) removed 5 transitions
Redundant transition composition rules discarded 5 transitions
Iterating global reduction 14 with 5 rules applied. Total rules applied 200 place count 54 transition count 96
Discarding 3 places :
Symmetric choice reduction at 14 with 3 rule applications. Total rules 203 place count 51 transition count 93
Iterating global reduction 14 with 3 rules applied. Total rules applied 206 place count 51 transition count 93
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 14 with 3 rules applied. Total rules applied 209 place count 51 transition count 90
Discarding 1 places :
Symmetric choice reduction at 15 with 1 rule applications. Total rules 210 place count 50 transition count 89
Iterating global reduction 15 with 1 rules applied. Total rules applied 211 place count 50 transition count 89
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 15 with 1 rules applied. Total rules applied 212 place count 50 transition count 88
Free-agglomeration rule applied 1 times.
Iterating global reduction 16 with 1 rules applied. Total rules applied 213 place count 50 transition count 87
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 16 with 1 rules applied. Total rules applied 214 place count 49 transition count 87
Partial Free-agglomeration rule applied 2 times.
Drop transitions (Partial Free agglomeration) removed 2 transitions
Iterating global reduction 17 with 2 rules applied. Total rules applied 216 place count 49 transition count 87
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 17 with 2 rules applied. Total rules applied 218 place count 47 transition count 85
Applied a total of 218 rules in 42 ms. Remains 47 /137 variables (removed 90) and now considering 85/229 (removed 144) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 42 ms. Remains : 47/137 places, 85/229 transitions.
RANDOM walk for 32629 steps (1270 resets) in 160 ms. (202 steps per ms) remains 0/1 properties
FORMULA CO4-PT-21-ReachabilityFireability-2025-04 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
All properties solved without resorting to model-checking.
Total runtime 12853 ms.

BK_STOP 1748613803856

--------------------
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
+ [[ ReachabilityFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution ReachabilityFireability -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
++ 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.202505121319.jar
+ VERSION=202505121319
+ echo 'Running Version 202505121319'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination ReachabilityFireability -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="CO4-PT-21"
export BK_EXAMINATION="ReachabilityFireability"
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-5832"
echo " Executing tool itstools"
echo " Input is CO4-PT-21, examination is ReachabilityFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r044-tall-174854028600543"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/CO4-PT-21.tgz
mv CO4-PT-21 execution
cd execution
if [ "ReachabilityFireability" = "ReachabilityDeadlock" ] || [ "ReachabilityFireability" = "UpperBounds" ] || [ "ReachabilityFireability" = "QuasiLiveness" ] || [ "ReachabilityFireability" = "StableMarking" ] || [ "ReachabilityFireability" = "Liveness" ] || [ "ReachabilityFireability" = "OneSafe" ] || [ "ReachabilityFireability" = "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 [ "ReachabilityFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "ReachabilityFireability" != "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 "ReachabilityFireability.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 '' ReachabilityFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "ReachabilityFireability" = "ReachabilityDeadlock" ] || [ "ReachabilityFireability" = "QuasiLiveness" ] || [ "ReachabilityFireability" = "StableMarking" ] || [ "ReachabilityFireability" = "Liveness" ] || [ "ReachabilityFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME ReachabilityFireability"
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 ;