Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2025-input.r030-smll-174853813700310.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 CANInsertWithFailure-PT-070, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r030-smll-174853813700310
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 31M
-rw-r--r-- 1 mcc users 7.9K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 64K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 8.1K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 59K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.7K 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 3.0K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 18K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 147K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 16K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 106K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.0K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.4K 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 4 May 29 14:32 instance
-rw-r--r-- 1 mcc users 6 May 29 14:32 iscolored
-rw-r--r-- 1 mcc users 30M 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 CANInsertWithFailure-PT-070-ReachabilityCardinality-2023-06
FORMULA_NAME CANInsertWithFailure-PT-070-ReachabilityCardinality-2023-11
FORMULA_NAME CANInsertWithFailure-PT-070-ReachabilityCardinality-2023-15
FORMULA_NAME CANInsertWithFailure-PT-070-ReachabilityCardinality-2024-08
FORMULA_NAME CANInsertWithFailure-PT-070-ReachabilityCardinality-2025-00
FORMULA_NAME CANInsertWithFailure-PT-070-ReachabilityCardinality-2025-01
FORMULA_NAME CANInsertWithFailure-PT-070-ReachabilityCardinality-2025-02
FORMULA_NAME CANInsertWithFailure-PT-070-ReachabilityCardinality-2025-03
FORMULA_NAME CANInsertWithFailure-PT-070-ReachabilityCardinality-2025-04
FORMULA_NAME CANInsertWithFailure-PT-070-ReachabilityCardinality-2025-05
FORMULA_NAME CANInsertWithFailure-PT-070-ReachabilityCardinality-2025-07
FORMULA_NAME CANInsertWithFailure-PT-070-ReachabilityCardinality-2025-09
FORMULA_NAME CANInsertWithFailure-PT-070-ReachabilityCardinality-2025-10
FORMULA_NAME CANInsertWithFailure-PT-070-ReachabilityCardinality-2025-12
FORMULA_NAME CANInsertWithFailure-PT-070-ReachabilityCardinality-2025-13
FORMULA_NAME CANInsertWithFailure-PT-070-ReachabilityCardinality-2025-14

=== Now, execution of the tool begins

BK_START 1748825016679

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=ReachabilityCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=CANInsertWithFailure-PT-070
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
ReachabilityCardinality PT
Running Version 202505121319
[2025-06-02 00:43:38] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2025-06-02 00:43:38] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-02 00:43:40] [INFO ] Load time of PNML (sax parser for PT used): 1408 ms
[2025-06-02 00:43:40] [INFO ] Transformed 10644 places.
[2025-06-02 00:43:40] [INFO ] Transformed 29820 transitions.
[2025-06-02 00:43:40] [INFO ] Parsed PT model containing 10644 places and 29820 transitions and 79800 arcs in 1691 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 39 ms.
Working with output stream class java.io.PrintStream
RANDOM walk for 40000 steps (21 resets) in 6693 ms. (5 steps per ms) remains 13/16 properties
FORMULA CANInsertWithFailure-PT-070-ReachabilityCardinality-2025-12 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANInsertWithFailure-PT-070-ReachabilityCardinality-2025-03 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANInsertWithFailure-PT-070-ReachabilityCardinality-2025-01 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (8 resets) in 1484 ms. (26 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (8 resets) in 1712 ms. (23 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (8 resets) in 394 ms. (101 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (8 resets) in 444 ms. (89 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (8 resets) in 272 ms. (146 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (8 resets) in 267 ms. (149 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (8 resets) in 315 ms. (126 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (8 resets) in 362 ms. (110 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (8 resets) in 290 ms. (137 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (8 resets) in 239 ms. (166 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (8 resets) in 202 ms. (197 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (8 resets) in 158 ms. (251 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (8 resets) in 167 ms. (238 steps per ms) remains 13/13 properties
// Phase 1: matrix 29820 rows 10644 cols
[2025-06-02 00:43:45] [INFO ] Flatten gal took : 3127 ms
[2025-06-02 00:43:46] [INFO ] Flatten gal took : 1027 ms
[2025-06-02 00:43:46] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality4795072775210404558.gal : 255 ms
[2025-06-02 00:43:46] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality8445392492136795761.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/ReachabilityCardinality4795072775210404558.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality8445392492136795761.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
[2025-06-02 00:43:52] [INFO ] Computed 73 invariants in 7258 ms
[2025-06-02 00:43:52] [INFO ] State equation strengthened by 9730 read => feed constraints.
Excessive predecessor constraint size, skipping predecessor.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
Loading property file /tmp/ReachabilityCardinality8445392492136795761.prop.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/359 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 1 (OVERLAPS) 10186/10545 variables, 23/23 constraints. Problems are: Problem set: 0 solved, 13 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 10545/40464 variables, and 23 constraints, problems are : Problem set: 0 solved, 13 unsolved in 5073 ms.
Refiners :[Positive P Invariants (semi-flows): 23/71 constraints, Generalized P Invariants (flows): 0/2 constraints, State Equation: 0/10644 constraints, ReadFeed: 0/9730 constraints, PredecessorRefiner: 13/8 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 13 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/359 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 1 (OVERLAPS) 10186/10545 variables, 23/23 constraints. Problems are: Problem set: 0 solved, 13 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 00:44:02] [INFO ] Deduced a trap composed of 5 places in 956 ms of which 41 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 00:44:03] [INFO ] Deduced a trap composed of 5 places in 909 ms of which 26 ms to minimize.
SMT process timed out in 18665ms, After SMT, problems are : Problem set: 0 solved, 13 unsolved
Fused 13 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 359 out of 10644 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 10644/10644 places, 29820/29820 transitions.
Graph (complete) has 40251 edges and 10644 vertex of which 10643 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.68 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 432 transitions
Trivial Post-agglo rules discarded 432 transitions
Performed 432 trivial Post agglomeration. Transition count delta: 432
Iterating post reduction 0 with 432 rules applied. Total rules applied 433 place count 10643 transition count 29388
Reduce places removed 432 places and 0 transitions.
Performed 21 Post agglomeration using F-continuation condition.Transition count delta: 21
Iterating post reduction 1 with 453 rules applied. Total rules applied 886 place count 10211 transition count 29367
Reduce places removed 21 places and 0 transitions.
Iterating post reduction 2 with 21 rules applied. Total rules applied 907 place count 10190 transition count 29367
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 9 Pre rules applied. Total rules applied 907 place count 10190 transition count 29358
Deduced a syphon composed of 9 places in 23 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 3 with 18 rules applied. Total rules applied 925 place count 10181 transition count 29358
Performed 3762 Post agglomeration using F-continuation condition.Transition count delta: 3762
Deduced a syphon composed of 3762 places in 34 ms
Reduce places removed 3762 places and 0 transitions.
Iterating global reduction 3 with 7524 rules applied. Total rules applied 8449 place count 6419 transition count 25596
Free-agglomeration rule (complex) applied 12 times.
Iterating global reduction 3 with 12 rules applied. Total rules applied 8461 place count 6419 transition count 25584
Reduce places removed 12 places and 0 transitions.
Iterating post reduction 3 with 12 rules applied. Total rules applied 8473 place count 6407 transition count 25584
Partial Free-agglomeration rule applied 6157 times.
Drop transitions (Partial Free agglomeration) removed 6157 transitions
Iterating global reduction 4 with 6157 rules applied. Total rules applied 14630 place count 6407 transition count 25584
Partial Free-agglomeration rule applied 573 times.
Drop transitions (Partial Free agglomeration) removed 573 transitions
Iterating global reduction 4 with 573 rules applied. Total rules applied 15203 place count 6407 transition count 25584
Applied a total of 15203 rules in 14187 ms. Remains 6407 /10644 variables (removed 4237) and now considering 25584/29820 (removed 4236) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 14216 ms. Remains : 6407/10644 places, 25584/29820 transitions.
RANDOM walk for 40000 steps (74 resets) in 3932 ms. (10 steps per ms) remains 12/13 properties
FORMULA CANInsertWithFailure-PT-070-ReachabilityCardinality-2025-02 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (8 resets) in 350 ms. (113 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 414 ms. (96 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 467 ms. (85 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 156 ms. (254 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 173 ms. (229 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 215 ms. (185 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 252 ms. (158 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 220 ms. (181 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40003 steps (8 resets) in 152 ms. (261 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 263 ms. (151 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40003 steps (8 resets) in 175 ms. (227 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 155 ms. (256 steps per ms) remains 12/12 properties
Interrupted probabilistic random walk after 141145 steps, run timeout after 6001 ms. (steps per millisecond=23 ) properties seen :0 out of 12
Probabilistic random walk after 141145 steps, saw 134439 distinct states, run finished after 6011 ms. (steps per millisecond=23 ) properties seen :0
[2025-06-02 00:44:26] [INFO ] Flow matrix only has 25474 transitions (discarded 110 similar events)
// Phase 1: matrix 25474 rows 6407 cols
[2025-06-02 00:44:28] [INFO ] Computed 72 invariants in 2449 ms
[2025-06-02 00:44:28] [INFO ] State equation strengthened by 21704 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/307 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 1 (OVERLAPS) 5990/6297 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/6297 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 3 (OVERLAPS) 106/6403 variables, 53/70 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/6403 variables, 0/70 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 5 (OVERLAPS) 2/6405 variables, 2/72 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/6405 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 7 (OVERLAPS) 25474/31879 variables, 6405/6477 constraints. Problems are: Problem set: 0 solved, 12 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 31879/31881 variables, and 28181 constraints, problems are : Problem set: 0 solved, 12 unsolved in 45092 ms.
Refiners :[Positive P Invariants (semi-flows): 70/70 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 6405/6407 constraints, ReadFeed: 21704/21704 constraints, PredecessorRefiner: 12/6 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 12 unsolved
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/307 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 1 (OVERLAPS) 5990/6297 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 12 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 00:45:16] [INFO ] Deduced a trap composed of 2 places in 474 ms of which 11 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/6297 variables, 1/18 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/6297 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 4 (OVERLAPS) 106/6403 variables, 53/71 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/6403 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 6 (OVERLAPS) 2/6405 variables, 2/73 constraints. Problems are: Problem set: 0 solved, 12 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 00:45:49] [INFO ] Deduced a trap composed of 76 places in 16226 ms of which 1139 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 00:46:04] [INFO ] Deduced a trap composed of 76 places in 14949 ms of which 798 ms to minimize.
SMT process timed out in 98952ms, After SMT, problems are : Problem set: 0 solved, 12 unsolved
Fused 12 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 307 out of 6407 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 6407/6407 places, 25584/25584 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 2 place count 6407 transition count 25582
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 6405 transition count 25582
Performed 28 Post agglomeration using F-continuation condition.Transition count delta: 28
Deduced a syphon composed of 28 places in 6 ms
Reduce places removed 28 places and 0 transitions.
Iterating global reduction 2 with 56 rules applied. Total rules applied 60 place count 6377 transition count 25554
Partial Free-agglomeration rule applied 483 times.
Drop transitions (Partial Free agglomeration) removed 483 transitions
Iterating global reduction 2 with 483 rules applied. Total rules applied 543 place count 6377 transition count 25554
Applied a total of 543 rules in 4443 ms. Remains 6377 /6407 variables (removed 30) and now considering 25554/25584 (removed 30) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4444 ms. Remains : 6377/6407 places, 25554/25584 transitions.
RANDOM walk for 40000 steps (75 resets) in 2238 ms. (17 steps per ms) remains 11/12 properties
FORMULA CANInsertWithFailure-PT-070-ReachabilityCardinality-2025-07 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40003 steps (8 resets) in 364 ms. (109 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (8 resets) in 620 ms. (64 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (8 resets) in 362 ms. (110 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (8 resets) in 152 ms. (261 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (8 resets) in 212 ms. (187 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (8 resets) in 233 ms. (170 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (8 resets) in 230 ms. (173 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (8 resets) in 142 ms. (279 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (8 resets) in 225 ms. (177 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (8 resets) in 179 ms. (222 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (8 resets) in 160 ms. (248 steps per ms) remains 11/11 properties
Interrupted probabilistic random walk after 80173 steps, run timeout after 3002 ms. (steps per millisecond=26 ) properties seen :0 out of 11
Probabilistic random walk after 80173 steps, saw 76106 distinct states, run finished after 3006 ms. (steps per millisecond=26 ) properties seen :0
[2025-06-02 00:46:14] [INFO ] Flow matrix only has 25455 transitions (discarded 99 similar events)
// Phase 1: matrix 25455 rows 6377 cols
[2025-06-02 00:46:16] [INFO ] Computed 72 invariants in 2550 ms
[2025-06-02 00:46:16] [INFO ] State equation strengthened by 22501 read => feed constraints.
Starting Z3 with timeout 75.0 s and query timeout 7500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/292 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 1 (OVERLAPS) 5975/6267 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/6267 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 3 (OVERLAPS) 106/6373 variables, 53/70 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/6373 variables, 0/70 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 5 (OVERLAPS) 2/6375 variables, 2/72 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/6375 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 7 (OVERLAPS) 25455/31830 variables, 6375/6447 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/31830 variables, 22501/28948 constraints. Problems are: Problem set: 0 solved, 11 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 31830/31832 variables, and 28948 constraints, problems are : Problem set: 0 solved, 11 unsolved in 75128 ms.
Refiners :[Positive P Invariants (semi-flows): 70/70 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 6375/6377 constraints, ReadFeed: 22501/22501 constraints, PredecessorRefiner: 11/5 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 11 unsolved
Starting Z3 with timeout 75.0 s and query timeout 7500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/292 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 1 (OVERLAPS) 5975/6267 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 11 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 00:47:34] [INFO ] Deduced a trap composed of 2 places in 340 ms of which 9 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/6267 variables, 1/18 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/6267 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 4 (OVERLAPS) 106/6373 variables, 53/71 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/6373 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 6 (OVERLAPS) 2/6375 variables, 2/73 constraints. Problems are: Problem set: 0 solved, 11 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 00:48:04] [INFO ] Deduced a trap composed of 75 places in 14941 ms of which 949 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 00:48:19] [INFO ] Deduced a trap composed of 75 places in 15063 ms of which 998 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 00:48:35] [INFO ] Deduced a trap composed of 74 places in 14097 ms of which 1035 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 00:48:48] [INFO ] Deduced a trap composed of 74 places in 13064 ms of which 747 ms to minimize.
SMT process timed out in 154957ms, After SMT, problems are : Problem set: 0 solved, 11 unsolved
Fused 11 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 292 out of 6377 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 6377/6377 places, 25554/25554 transitions.
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 6 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 0 with 12 rules applied. Total rules applied 12 place count 6371 transition count 25548
Free-agglomeration rule applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 13 place count 6371 transition count 25547
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 14 place count 6370 transition count 25547
Partial Free-agglomeration rule applied 76 times.
Drop transitions (Partial Free agglomeration) removed 76 transitions
Iterating global reduction 1 with 76 rules applied. Total rules applied 90 place count 6370 transition count 25547
Applied a total of 90 rules in 5249 ms. Remains 6370 /6377 variables (removed 7) and now considering 25547/25554 (removed 7) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5249 ms. Remains : 6370/6377 places, 25547/25554 transitions.
RANDOM walk for 40000 steps (73 resets) in 1891 ms. (21 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (8 resets) in 545 ms. (73 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (8 resets) in 332 ms. (120 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (8 resets) in 334 ms. (119 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (8 resets) in 142 ms. (279 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (8 resets) in 217 ms. (183 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (8 resets) in 232 ms. (171 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (8 resets) in 222 ms. (179 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (8 resets) in 142 ms. (279 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (8 resets) in 220 ms. (181 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (8 resets) in 168 ms. (236 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (8 resets) in 144 ms. (275 steps per ms) remains 11/11 properties
Interrupted probabilistic random walk after 69405 steps, run timeout after 3002 ms. (steps per millisecond=23 ) properties seen :0 out of 11
Probabilistic random walk after 69405 steps, saw 66054 distinct states, run finished after 3002 ms. (steps per millisecond=23 ) properties seen :0
[2025-06-02 00:48:58] [INFO ] Flow matrix only has 25450 transitions (discarded 97 similar events)
// Phase 1: matrix 25450 rows 6370 cols
[2025-06-02 00:49:01] [INFO ] Computed 72 invariants in 2819 ms
[2025-06-02 00:49:01] [INFO ] State equation strengthened by 22525 read => feed constraints.
Starting Z3 with timeout 90.0 s and query timeout 9000.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/292 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 1 (OVERLAPS) 5968/6260 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/6260 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 3 (OVERLAPS) 106/6366 variables, 53/70 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/6366 variables, 0/70 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 5 (OVERLAPS) 2/6368 variables, 2/72 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/6368 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 7 (OVERLAPS) 25450/31818 variables, 6368/6440 constraints. Problems are: Problem set: 0 solved, 11 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 31818/31820 variables, and 28965 constraints, problems are : Problem set: 0 solved, 11 unsolved in 90175 ms.
Refiners :[Positive P Invariants (semi-flows): 70/70 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 6368/6370 constraints, ReadFeed: 22525/22525 constraints, PredecessorRefiner: 11/5 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 11 unsolved
Starting Z3 with timeout 90.0 s and query timeout 9000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/292 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 1 (OVERLAPS) 5968/6260 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 11 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 00:50:34] [INFO ] Deduced a trap composed of 2 places in 439 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 00:50:34] [INFO ] Deduced a trap composed of 2 places in 458 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 00:50:35] [INFO ] Deduced a trap composed of 2 places in 498 ms of which 27 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 00:50:35] [INFO ] Deduced a trap composed of 2 places in 411 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 00:50:36] [INFO ] Deduced a trap composed of 2 places in 452 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 00:50:37] [INFO ] Deduced a trap composed of 2 places in 449 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 00:50:37] [INFO ] Deduced a trap composed of 2 places in 548 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 00:50:38] [INFO ] Deduced a trap composed of 2 places in 452 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 00:50:38] [INFO ] Deduced a trap composed of 2 places in 466 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 00:50:39] [INFO ] Deduced a trap composed of 2 places in 493 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 00:50:40] [INFO ] Deduced a trap composed of 2 places in 538 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 00:50:40] [INFO ] Deduced a trap composed of 2 places in 545 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 00:50:41] [INFO ] Deduced a trap composed of 2 places in 543 ms of which 13 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/6260 variables, 13/30 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/6260 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 4 (OVERLAPS) 106/6366 variables, 53/83 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/6366 variables, 0/83 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 6 (OVERLAPS) 2/6368 variables, 2/85 constraints. Problems are: Problem set: 0 solved, 11 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 00:51:07] [INFO ] Deduced a trap composed of 75 places in 15501 ms of which 1097 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 00:51:22] [INFO ] Deduced a trap composed of 75 places in 15044 ms of which 959 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 00:51:37] [INFO ] Deduced a trap composed of 75 places in 14039 ms of which 969 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 00:51:50] [INFO ] Deduced a trap composed of 75 places in 13136 ms of which 985 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
SDD proceeding with computation,13 properties remain. new max is 4
SDD size :1 after 3
SDD proceeding with computation,13 properties remain. new max is 8
SDD size :3 after 5
SDD proceeding with computation,13 properties remain. new max is 16
SDD size :5 after 7
SDD proceeding with computation,13 properties remain. new max is 32
SDD size :7 after 9
SDD proceeding with computation,13 properties remain. new max is 64
SDD size :9 after 11
SDD proceeding with computation,13 properties remain. new max is 128
SDD size :11 after 13
SDD proceeding with computation,13 properties remain. new max is 256
SDD size :13 after 17
SDD proceeding with computation,13 properties remain. new max is 512
SDD size :17 after 23
SDD proceeding with computation,13 properties remain. new max is 1024
SDD size :23 after 33
SDD proceeding with computation,13 properties remain. new max is 2048
SDD size :33 after 51
SDD proceeding with computation,13 properties remain. new max is 4096
SDD size :51 after 87
[2025-06-02 00:52:05] [INFO ] Deduced a trap composed of 75 places in 14589 ms of which 759 ms to minimize.
SMT process timed out in 186380ms, After SMT, problems are : Problem set: 0 solved, 11 unsolved
Fused 11 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 292 out of 6370 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 6370/6370 places, 25547/25547 transitions.
Applied a total of 0 rules in 1594 ms. Remains 6370 /6370 variables (removed 0) and now considering 25547/25547 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1594 ms. Remains : 6370/6370 places, 25547/25547 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 6370/6370 places, 25547/25547 transitions.
Applied a total of 0 rules in 1358 ms. Remains 6370 /6370 variables (removed 0) and now considering 25547/25547 (removed 0) transitions.
[2025-06-02 00:52:08] [INFO ] Flow matrix only has 25450 transitions (discarded 97 similar events)
[2025-06-02 00:52:08] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
SDD proceeding with computation,13 properties remain. new max is 8192
SDD size :87 after 141
SDD proceeding with computation,13 properties remain. new max is 16384
SDD size :141 after 165
[2025-06-02 00:52:29] [INFO ] Implicit Places using invariants in 21799 ms returned []
Implicit Place search using SMT only with invariants took 21811 ms to find 0 implicit places.
Running 25477 sub problems to find dead transitions.
[2025-06-02 00:52:30] [INFO ] Flow matrix only has 25450 transitions (discarded 97 similar events)
[2025-06-02 00:52:30] [INFO ] Invariant cache hit.
[2025-06-02 00:52:30] [INFO ] State equation strengthened by 22525 read => feed constraints.
SDD proceeding with computation,13 properties remain. new max is 32768
SDD size :165 after 210
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
SDD proceeding with computation,13 properties remain. new max is 65536
SDD size :210 after 9335
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/6369 variables, 70/70 constraints. Problems are: Problem set: 0 solved, 25477 unsolved
SMT process timed out in 105899ms, After SMT, problems are : Problem set: 0 solved, 25477 unsolved
Search for dead transitions found 0 dead transitions in 106023ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 129294 ms. Remains : 6370/6370 places, 25547/25547 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 21547 edges and 6370 vertex of which 4614 / 6370 are part of one of the 2 SCC in 10 ms
Free SCC test removed 4612 places
Drop transitions (Empty/Sink Transition effects.) removed 14941 transitions
Ensure Unique test removed 4688 transitions
Reduce isomorphic transitions removed 19629 transitions.
Graph (complete) has 6634 edges and 1758 vertex of which 1571 are kept as prefixes of interest. Removing 187 places using SCC suffix rule.2 ms
Discarding 187 places :
Also discarding 55 output transitions
Drop transitions (Output transitions of discarded places.) removed 55 transitions
Drop transitions (Empty/Sink Transition effects.) removed 794 transitions
Reduce isomorphic transitions removed 794 transitions.
Performed 14 Post agglomeration using F-continuation condition.Transition count delta: 14
Iterating post reduction 0 with 808 rules applied. Total rules applied 810 place count 1571 transition count 5055
Reduce places removed 14 places and 0 transitions.
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 1 with 24 rules applied. Total rules applied 834 place count 1557 transition count 5045
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 834 place count 1557 transition count 5041
Deduced a syphon composed of 4 places in 2 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 842 place count 1553 transition count 5041
Discarding 755 places :
Symmetric choice reduction at 2 with 755 rule applications. Total rules 1597 place count 798 transition count 2879
Iterating global reduction 2 with 755 rules applied. Total rules applied 2352 place count 798 transition count 2879
Ensure Unique test removed 502 transitions
Reduce isomorphic transitions removed 502 transitions.
Iterating post reduction 2 with 502 rules applied. Total rules applied 2854 place count 798 transition count 2377
Discarding 167 places :
Symmetric choice reduction at 3 with 167 rule applications. Total rules 3021 place count 631 transition count 2043
Iterating global reduction 3 with 167 rules applied. Total rules applied 3188 place count 631 transition count 2043
Ensure Unique test removed 167 transitions
Reduce isomorphic transitions removed 167 transitions.
Iterating post reduction 3 with 167 rules applied. Total rules applied 3355 place count 631 transition count 1876
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 3357 place count 630 transition count 1875
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 4 with 4 rules applied. Total rules applied 3361 place count 628 transition count 1873
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 4 with 7 rules applied. Total rules applied 3368 place count 628 transition count 1866
Drop transitions (Redundant composition of simpler transitions.) removed 120 transitions
Redundant transition composition rules discarded 120 transitions
Iterating global reduction 5 with 120 rules applied. Total rules applied 3488 place count 628 transition count 1746
Drop transitions (Trivial Post-Agglo cleanup.) removed 40 transitions
Trivial Post-agglo rules discarded 40 transitions
Performed 40 trivial Post agglomeration. Transition count delta: 40
Iterating post reduction 5 with 40 rules applied. Total rules applied 3528 place count 628 transition count 1706
Reduce places removed 40 places and 0 transitions.
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Iterating post reduction 6 with 48 rules applied. Total rules applied 3576 place count 588 transition count 1698
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 7 with 8 rules applied. Total rules applied 3584 place count 580 transition count 1698
Discarding 2 places :
Symmetric choice reduction at 8 with 2 rule applications. Total rules 3586 place count 578 transition count 1695
Iterating global reduction 8 with 2 rules applied. Total rules applied 3588 place count 578 transition count 1695
Performed 20 Post agglomeration using F-continuation condition.Transition count delta: 20
Deduced a syphon composed of 20 places in 1 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 8 with 40 rules applied. Total rules applied 3628 place count 558 transition count 1675
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 18 transitions.
Iterating post reduction 8 with 18 rules applied. Total rules applied 3646 place count 558 transition count 1657
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 9 with 2 rules applied. Total rules applied 3648 place count 557 transition count 1657
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 9 with 2 rules applied. Total rules applied 3650 place count 557 transition count 1655
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 10 with 6 rules applied. Total rules applied 3656 place count 557 transition count 1649
Free-agglomeration rule applied 159 times with reduction of 13 identical transitions.
Iterating global reduction 10 with 159 rules applied. Total rules applied 3815 place count 557 transition count 1477
Reduce places removed 159 places and 0 transitions.
Ensure Unique test removed 242 transitions
Reduce isomorphic transitions removed 242 transitions.
Iterating post reduction 10 with 401 rules applied. Total rules applied 4216 place count 398 transition count 1235
Drop transitions (Redundant composition of simpler transitions.) removed 21 transitions
Redundant transition composition rules discarded 21 transitions
Iterating global reduction 11 with 21 rules applied. Total rules applied 4237 place count 398 transition count 1214
Free-agglomeration rule (complex) applied 14 times.
Iterating global reduction 11 with 14 rules applied. Total rules applied 4251 place count 398 transition count 1214
Reduce places removed 14 places and 0 transitions.
Ensure Unique test removed 25 transitions
Reduce isomorphic transitions removed 25 transitions.
Iterating post reduction 11 with 39 rules applied. Total rules applied 4290 place count 384 transition count 1189
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 12 with 4 rules applied. Total rules applied 4294 place count 384 transition count 1185
Partial Free-agglomeration rule applied 67 times.
Drop transitions (Partial Free agglomeration) removed 67 transitions
Iterating global reduction 12 with 67 rules applied. Total rules applied 4361 place count 384 transition count 1185
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 12 with 9 rules applied. Total rules applied 4370 place count 384 transition count 1176
Discarding 4 places :
Symmetric choice reduction at 13 with 4 rule applications. Total rules 4374 place count 380 transition count 1171
Iterating global reduction 13 with 4 rules applied. Total rules applied 4378 place count 380 transition count 1171
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 13 with 1 rules applied. Total rules applied 4379 place count 380 transition count 1170
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 14 with 1 rules applied. Total rules applied 4380 place count 380 transition count 1170
Reduce places removed 4 places and 4 transitions.
Iterating global reduction 14 with 4 rules applied. Total rules applied 4384 place count 376 transition count 1166
Applied a total of 4384 rules in 2616 ms. Remains 376 /6370 variables (removed 5994) and now considering 1166/25547 (removed 24381) transitions.
Running SMT prover for 11 properties.
// Phase 1: matrix 1166 rows 376 cols
[2025-06-02 00:54:18] [INFO ] Computed 7 invariants in 4 ms
Starting Z3 with timeout 450.0 s and query timeout 45000.0 ms
[2025-06-02 00:54:18] [INFO ] After 224ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:11
Starting Z3 with timeout 450.0 s and query timeout 45000.0 ms
[2025-06-02 00:54:19] [INFO ] [Nat]Absence check using 7 positive place invariants in 3 ms returned sat
[2025-06-02 00:54:20] [INFO ] After 1012ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :11
TRAPS : Iteration 0
[2025-06-02 00:54:21] [INFO ] After 1938ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :11
[2025-06-02 00:54:21] [INFO ] After 2689ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :11
[2025-06-02 00:54:21] [INFO ] Flatten gal took : 34 ms
[2025-06-02 00:54:21] [INFO ] Flatten gal took : 37 ms
[2025-06-02 00:54:21] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality8775065754883911379.gal : 9 ms
[2025-06-02 00:54:21] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality12335766149191755029.prop : 3 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality8775065754883911379.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality12335766149191755029.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 ...329
Loading property file /tmp/ReachabilityCardinality12335766149191755029.prop.
SDD proceeding with computation,11 properties remain. new max is 4
SDD size :1 after 12
SDD proceeding with computation,11 properties remain. new max is 8
SDD size :12 after 15
SDD proceeding with computation,11 properties remain. new max is 16
SDD size :15 after 144
SDD proceeding with computation,11 properties remain. new max is 32
SDD size :144 after 209
SDD proceeding with computation,11 properties remain. new max is 64
SDD size :209 after 627
SDD proceeding with computation,11 properties remain. new max is 128
SDD size :627 after 6041
SDD proceeding with computation,11 properties remain. new max is 256
SDD size :6041 after 35212
SDD proceeding with computation,11 properties remain. new max is 512
SDD size :35212 after 332319
SDD proceeding with computation,11 properties remain. new max is 1024
SDD size :332319 after 1.33052e+07
SDD proceeding with computation,11 properties remain. new max is 2048
SDD size :1.33052e+07 after 1.81277e+07
SDD proceeding with computation,11 properties remain. new max is 4096
SDD size :1.81277e+07 after 1.25193e+09
Detected timeout of ITS tools.
[2025-06-02 00:54:36] [INFO ] Flatten gal took : 24 ms
[2025-06-02 00:54:36] [INFO ] Applying decomposition
[2025-06-02 00:54:36] [INFO ] Flatten gal took : 23 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph4639332019247979436.txt' '-o' '/tmp/graph4639332019247979436.bin' '-w' '/tmp/graph4639332019247979436.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph4639332019247979436.bin' '-l' '-1' '-v' '-w' '/tmp/graph4639332019247979436.weights' '-q' '0' '-e' '0.001'
[2025-06-02 00:54:37] [INFO ] Decomposing Gal with order
[2025-06-02 00:54:37] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-02 00:54:37] [INFO ] Removed a total of 752 redundant transitions.
[2025-06-02 00:54:37] [INFO ] Flatten gal took : 160 ms
[2025-06-02 00:54:37] [INFO ] Fuse similar labels procedure discarded/fused a total of 209 labels/synchronizations in 31 ms.
[2025-06-02 00:54:37] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality6489507369485476880.gal : 12 ms
[2025-06-02 00:54:37] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality1874328334345774346.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality6489507369485476880.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality1874328334345774346.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
Loading property file /tmp/ReachabilityCardinality1874328334345774346.prop.
SDD proceeding with computation,11 properties remain. new max is 4
SDD size :1 after 10
SDD proceeding with computation,11 properties remain. new max is 8
SDD size :10 after 24
SDD proceeding with computation,11 properties remain. new max is 16
SDD size :24 after 60
SDD proceeding with computation,11 properties remain. new max is 32
SDD size :60 after 72
SDD proceeding with computation,11 properties remain. new max is 64
SDD size :72 after 631
SDD proceeding with computation,11 properties remain. new max is 128
SDD size :631 after 5820
SDD proceeding with computation,11 properties remain. new max is 256
SDD size :5820 after 17900
SDD proceeding with computation,11 properties remain. new max is 512
SDD size :17900 after 65280
SDD proceeding with computation,11 properties remain. new max is 1024
SDD size :65280 after 261440
SDD proceeding with computation,11 properties remain. new max is 2048
SDD size :261440 after 1.17846e+06
SDD proceeding with computation,11 properties remain. new max is 4096
SDD size :1.17846e+06 after 3.04199e+08
SDD proceeding with computation,11 properties remain. new max is 8192
SDD size :3.04199e+08 after 3.06325e+08
SDD proceeding with computation,11 properties remain. new max is 16384
SDD size :3.06325e+08 after 4.09557e+10
Detected timeout of ITS tools.
Over-approximation ignoring read arcs solved 0 properties in 36775 ms.
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
[2025-06-02 00:54:54] [INFO ] Flatten gal took : 960 ms
[2025-06-02 00:54:54] [INFO ] Applying decomposition
[2025-06-02 00:54:55] [INFO ] Flatten gal took : 1012 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph14616977736043693213.txt' '-o' '/tmp/graph14616977736043693213.bin' '-w' '/tmp/graph14616977736043693213.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph14616977736043693213.bin' '-l' '-1' '-v' '-w' '/tmp/graph14616977736043693213.weights' '-q' '0' '-e' '0.001'
[2025-06-02 00:54:56] [INFO ] Decomposing Gal with order
[2025-06-02 00:54:57] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-02 00:55:02] [INFO ] Removed a total of 16009 redundant transitions.
[2025-06-02 00:55:03] [INFO ] Flatten gal took : 3554 ms
[2025-06-02 00:55:07] [INFO ] Fuse similar labels procedure discarded/fused a total of 10797 labels/synchronizations in 2776 ms.
[2025-06-02 00:55:10] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality8345448728991678778.gal : 163 ms
[2025-06-02 00:55:10] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality13642665278041614576.prop : 6 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/ReachabilityCardinality8345448728991678778.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality13642665278041614576.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 ...329
Loading property file /tmp/ReachabilityCardinality13642665278041614576.prop.
SDD proceeding with computation,11 properties remain. new max is 4
SDD size :1 after 3
SDD proceeding with computation,11 properties remain. new max is 8
SDD size :3 after 8
SDD proceeding with computation,11 properties remain. new max is 16
SDD size :8 after 9
SDD proceeding with computation,11 properties remain. new max is 32
SDD size :9 after 22
SDD proceeding with computation,11 properties remain. new max is 64
SDD size :22 after 32
SDD proceeding with computation,11 properties remain. new max is 128
SDD size :32 after 69
SDD proceeding with computation,11 properties remain. new max is 256
SDD size :69 after 93
SDD proceeding with computation,11 properties remain. new max is 512
SDD size :93 after 97
SDD proceeding with computation,11 properties remain. new max is 1024
SDD size :97 after 109
SDD proceeding with computation,11 properties remain. new max is 2048
SDD size :109 after 119
SDD proceeding with computation,11 properties remain. new max is 4096
SDD size :119 after 138
SDD proceeding with computation,11 properties remain. new max is 8192
SDD size :138 after 321
SDD proceeding with computation,11 properties remain. new max is 16384
SDD size :321 after 13170
Detected timeout of ITS tools.
[2025-06-02 01:25:11] [INFO ] Flatten gal took : 555 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin13923882228284426402
[2025-06-02 01:25:11] [INFO ] Too many transitions (25547) to apply POR reductions. Disabling POR matrices.
[2025-06-02 01:25:11] [INFO ] Applying decomposition
[2025-06-02 01:25:11] [INFO ] Built C files in 634ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13923882228284426402
Running compilation step : cd /tmp/ltsmin13923882228284426402;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '65' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
[2025-06-02 01:25:12] [INFO ] Flatten gal took : 719 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph18371029766250237667.txt' '-o' '/tmp/graph18371029766250237667.bin' '-w' '/tmp/graph18371029766250237667.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph18371029766250237667.bin' '-l' '-1' '-v' '-w' '/tmp/graph18371029766250237667.weights' '-q' '0' '-e' '0.001'
[2025-06-02 01:25:13] [INFO ] Decomposing Gal with order
[2025-06-02 01:25:14] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-02 01:25:18] [INFO ] Removed a total of 28191 redundant transitions.
[2025-06-02 01:25:18] [INFO ] Flatten gal took : 3329 ms
[2025-06-02 01:25:23] [INFO ] Fuse similar labels procedure discarded/fused a total of 21678 labels/synchronizations in 3928 ms.
[2025-06-02 01:25:26] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality15827284928716964874.gal : 157 ms
[2025-06-02 01:25:26] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality13094849644744634822.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality15827284928716964874.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality13094849644744634822.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 ...330
Loading property file /tmp/ReachabilityCardinality13094849644744634822.prop.
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin13923882228284426402;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '65' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 65 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin13923882228284426402;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '65' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 65 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:93)
at java.base/java.lang.Thread.run(Thread.java:1583)
SDD proceeding with computation,11 properties remain. new max is 4
SDD size :1 after 3
SDD proceeding with computation,11 properties remain. new max is 8
SDD size :3 after 1338
SDD proceeding with computation,11 properties remain. new max is 16
SDD size :1338 after 1351
SDD proceeding with computation,11 properties remain. new max is 32
SDD size :1351 after 1367
SDD proceeding with computation,11 properties remain. new max is 64
SDD size :1367 after 1394
SDD proceeding with computation,11 properties remain. new max is 128
SDD size :1394 after 1429
SDD proceeding with computation,11 properties remain. new max is 256
SDD size :1429 after 1430
SDD proceeding with computation,11 properties remain. new max is 512
SDD size :1430 after 1431
SDD proceeding with computation,11 properties remain. new max is 1024
SDD size :1431 after 1494
SDD proceeding with computation,11 properties remain. new max is 2048
SDD size :1494 after 1525

BK_TIME_CONFINEMENT_REACHED

--------------------
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
+ [[ ReachabilityCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution ReachabilityCardinality -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 ReachabilityCardinality -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="CANInsertWithFailure-PT-070"
export BK_EXAMINATION="ReachabilityCardinality"
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 CANInsertWithFailure-PT-070, examination is ReachabilityCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r030-smll-174853813700310"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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