fond
Model Checking Contest 2025
15th edition, Paris, France, June 24, 2025
Execution of r030-smll-174853813600278
Last Updated
June 24, 2025

About the Execution of ITS-Tools for CANInsertWithFailure-PT-030

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
0.000 3600000.00 0.00 0.00 ???TTF?T?TFT?TT? normal

Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 6.0M
-rw-r--r-- 1 mcc users 12K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 100K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.9K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 60K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.5K 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.9K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.9K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 64K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.8K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 54K 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 5.6M 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-030-ReachabilityCardinality-2023-05
FORMULA_NAME CANInsertWithFailure-PT-030-ReachabilityCardinality-2023-07
FORMULA_NAME CANInsertWithFailure-PT-030-ReachabilityCardinality-2023-08
FORMULA_NAME CANInsertWithFailure-PT-030-ReachabilityCardinality-2025-00
FORMULA_NAME CANInsertWithFailure-PT-030-ReachabilityCardinality-2025-01
FORMULA_NAME CANInsertWithFailure-PT-030-ReachabilityCardinality-2025-02
FORMULA_NAME CANInsertWithFailure-PT-030-ReachabilityCardinality-2025-03
FORMULA_NAME CANInsertWithFailure-PT-030-ReachabilityCardinality-2025-04
FORMULA_NAME CANInsertWithFailure-PT-030-ReachabilityCardinality-2025-06
FORMULA_NAME CANInsertWithFailure-PT-030-ReachabilityCardinality-2025-09
FORMULA_NAME CANInsertWithFailure-PT-030-ReachabilityCardinality-2025-10
FORMULA_NAME CANInsertWithFailure-PT-030-ReachabilityCardinality-2025-11
FORMULA_NAME CANInsertWithFailure-PT-030-ReachabilityCardinality-2025-12
FORMULA_NAME CANInsertWithFailure-PT-030-ReachabilityCardinality-2025-13
FORMULA_NAME CANInsertWithFailure-PT-030-ReachabilityCardinality-2025-14
FORMULA_NAME CANInsertWithFailure-PT-030-ReachabilityCardinality-2025-15

=== Now, execution of the tool begins

BK_START 1748768298948

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-030
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
ReachabilityCardinality PT
Running Version 202505121319
[2025-06-01 08:58:21] [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-01 08:58:21] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-01 08:58:22] [INFO ] Load time of PNML (sax parser for PT used): 702 ms
[2025-06-01 08:58:22] [INFO ] Transformed 2164 places.
[2025-06-01 08:58:22] [INFO ] Transformed 5580 transitions.
[2025-06-01 08:58:22] [INFO ] Parsed PT model containing 2164 places and 5580 transitions and 15000 arcs in 963 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 25 ms.
Working with output stream class java.io.PrintStream
RANDOM walk for 40000 steps (55 resets) in 3404 ms. (11 steps per ms) remains 7/16 properties
FORMULA CANInsertWithFailure-PT-030-ReachabilityCardinality-2025-14 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANInsertWithFailure-PT-030-ReachabilityCardinality-2025-13 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANInsertWithFailure-PT-030-ReachabilityCardinality-2025-11 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANInsertWithFailure-PT-030-ReachabilityCardinality-2025-10 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANInsertWithFailure-PT-030-ReachabilityCardinality-2025-09 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANInsertWithFailure-PT-030-ReachabilityCardinality-2025-04 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANInsertWithFailure-PT-030-ReachabilityCardinality-2025-02 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANInsertWithFailure-PT-030-ReachabilityCardinality-2025-01 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANInsertWithFailure-PT-030-ReachabilityCardinality-2025-00 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (8 resets) in 232 ms. (171 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 166 ms. (239 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 433 ms. (92 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 136 ms. (292 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 91 ms. (434 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 356 ms. (112 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 293 ms. (136 steps per ms) remains 7/7 properties
// Phase 1: matrix 5580 rows 2164 cols
[2025-06-01 08:58:24] [INFO ] Flatten gal took : 1033 ms
[2025-06-01 08:58:24] [INFO ] Computed 33 invariants in 468 ms
[2025-06-01 08:58:24] [INFO ] State equation strengthened by 1770 read => feed constraints.
Excessive predecessor constraint size, skipping predecessor.
[2025-06-01 08:58:25] [INFO ] Flatten gal took : 435 ms
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-01 08:58:25] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality13122693102746830494.gal : 175 ms
[2025-06-01 08:58:25] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality12400868698152490396.prop : 4 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/ReachabilityCardinality13122693102746830494.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality12400868698152490396.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
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/77 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (OVERLAPS) 2040/2117 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 7 unsolved
Loading property file /tmp/ReachabilityCardinality12400868698152490396.prop.
At refinement iteration 2 (INCLUDED_ONLY) 0/2117 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (OVERLAPS) 42/2159 variables, 21/30 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/2159 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (OVERLAPS) 2/2161 variables, 2/32 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/2161 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 7 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 7741/7744 variables, and 2193 constraints, problems are : Problem set: 0 solved, 7 unsolved in 5068 ms.
Refiners :[Positive P Invariants (semi-flows): 30/31 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 2161/2164 constraints, ReadFeed: 0/1770 constraints, PredecessorRefiner: 7/6 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 7 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/77 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (OVERLAPS) 2040/2117 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 7 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 08:58:31] [INFO ] Deduced a trap composed of 5 places in 297 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 08:58:31] [INFO ] Deduced a trap composed of 5 places in 296 ms of which 15 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/2117 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/2117 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (OVERLAPS) 42/2159 variables, 21/32 constraints. Problems are: Problem set: 0 solved, 7 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 08:58:34] [INFO ] Deduced a trap composed of 5 places in 1023 ms of which 35 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 08:58:35] [INFO ] Deduced a trap composed of 5 places in 973 ms of which 37 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2159/7744 variables, and 34 constraints, problems are : Problem set: 0 solved, 7 unsolved in 5011 ms.
Refiners :[Positive P Invariants (semi-flows): 30/31 constraints, Generalized P Invariants (flows): 0/2 constraints, State Equation: 0/2164 constraints, ReadFeed: 0/1770 constraints, PredecessorRefiner: 1/6 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 10819ms problems are : Problem set: 0 solved, 7 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 77 out of 2164 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2164/2164 places, 5580/5580 transitions.
Graph (complete) has 7651 edges and 2164 vertex of which 2163 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.17 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 190 transitions
Trivial Post-agglo rules discarded 190 transitions
Performed 190 trivial Post agglomeration. Transition count delta: 190
Iterating post reduction 0 with 190 rules applied. Total rules applied 191 place count 2163 transition count 5390
Reduce places removed 190 places and 0 transitions.
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Iterating post reduction 1 with 196 rules applied. Total rules applied 387 place count 1973 transition count 5384
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 393 place count 1967 transition count 5384
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 4 Pre rules applied. Total rules applied 393 place count 1967 transition count 5380
Deduced a syphon composed of 4 places in 5 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 401 place count 1963 transition count 5380
Performed 756 Post agglomeration using F-continuation condition.Transition count delta: 756
Deduced a syphon composed of 756 places in 12 ms
Reduce places removed 756 places and 0 transitions.
Iterating global reduction 3 with 1512 rules applied. Total rules applied 1913 place count 1207 transition count 4624
Drop transitions (Redundant composition of simpler transitions.) removed 706 transitions
Redundant transition composition rules discarded 706 transitions
Iterating global reduction 3 with 706 rules applied. Total rules applied 2619 place count 1207 transition count 3918
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 3 with 2 rules applied. Total rules applied 2621 place count 1207 transition count 3916
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 2623 place count 1205 transition count 3916
Partial Free-agglomeration rule applied 1059 times.
Drop transitions (Partial Free agglomeration) removed 1059 transitions
Iterating global reduction 4 with 1059 rules applied. Total rules applied 3682 place count 1205 transition count 3916
Partial Free-agglomeration rule applied 98 times.
Drop transitions (Partial Free agglomeration) removed 98 transitions
Iterating global reduction 4 with 98 rules applied. Total rules applied 3780 place count 1205 transition count 3916
Applied a total of 3780 rules in 2126 ms. Remains 1205 /2164 variables (removed 959) and now considering 3916/5580 (removed 1664) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2140 ms. Remains : 1205/2164 places, 3916/5580 transitions.
RANDOM walk for 40000 steps (225 resets) in 1341 ms. (29 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 165 ms. (240 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 124 ms. (320 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 188 ms. (211 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 122 ms. (325 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 173 ms. (229 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 185 ms. (215 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (8 resets) in 268 ms. (148 steps per ms) remains 7/7 properties
SDD proceeding with computation,7 properties remain. new max is 4
SDD size :1 after 3
SDD proceeding with computation,7 properties remain. new max is 8
SDD size :3 after 5
SDD proceeding with computation,7 properties remain. new max is 16
SDD size :5 after 7
SDD proceeding with computation,7 properties remain. new max is 32
SDD size :7 after 9
SDD proceeding with computation,7 properties remain. new max is 64
SDD size :9 after 11
SDD proceeding with computation,7 properties remain. new max is 128
SDD size :11 after 15
SDD proceeding with computation,7 properties remain. new max is 256
SDD size :15 after 21
SDD proceeding with computation,7 properties remain. new max is 512
SDD size :21 after 31
SDD proceeding with computation,7 properties remain. new max is 1024
SDD size :31 after 61
SDD proceeding with computation,7 properties remain. new max is 2048
SDD size :61 after 78
SDD proceeding with computation,7 properties remain. new max is 4096
SDD size :78 after 136
SDD proceeding with computation,7 properties remain. new max is 8192
SDD size :136 after 1849
Interrupted probabilistic random walk after 101954 steps, run timeout after 3001 ms. (steps per millisecond=33 ) properties seen :0 out of 7
Probabilistic random walk after 101954 steps, saw 23508 distinct states, run finished after 3010 ms. (steps per millisecond=33 ) properties seen :0
// Phase 1: matrix 3916 rows 1205 cols
[2025-06-01 08:58:41] [INFO ] Computed 32 invariants in 144 ms
SDD proceeding with computation,7 properties remain. new max is 16384
SDD size :1849 after 2527
[2025-06-01 08:58:41] [INFO ] State equation strengthened by 3330 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/77 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (OVERLAPS) 1082/1159 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1159 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (OVERLAPS) 42/1201 variables, 21/30 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1201 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (OVERLAPS) 2/1203 variables, 2/32 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1203 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 7 unsolved
SDD proceeding with computation,7 properties remain. new max is 32768
At refinement iteration 7 (OVERLAPS) 3916/5119 variables, 1203/1235 constraints. Problems are: Problem set: 0 solved, 7 unsolved
SDD size :2527 after 46492
At refinement iteration 8 (INCLUDED_ONLY) 0/5119 variables, 3330/4565 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/5119 variables, 0/4565 constraints. Problems are: Problem set: 0 solved, 7 unsolved
SDD proceeding with computation,7 properties remain. new max is 65536
SDD size :46492 after 51091
At refinement iteration 10 (OVERLAPS) 2/5121 variables, 2/4567 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/5121 variables, 0/4567 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 12 (OVERLAPS) 0/5121 variables, 0/4567 constraints. Problems are: Problem set: 0 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Real declared 5121/5121 variables, and 4567 constraints, problems are : Problem set: 0 solved, 7 unsolved in 8553 ms.
Refiners :[Positive P Invariants (semi-flows): 30/30 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 1205/1205 constraints, ReadFeed: 3330/3330 constraints, PredecessorRefiner: 7/4 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 7 unsolved
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/77 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (OVERLAPS) 1082/1159 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 7 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 08:58:50] [INFO ] Deduced a trap composed of 2 places in 104 ms of which 5 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/1159 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1159 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (OVERLAPS) 42/1201 variables, 21/31 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1201 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 6 (OVERLAPS) 2/1203 variables, 2/33 constraints. Problems are: Problem set: 0 solved, 7 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 08:58:52] [INFO ] Deduced a trap composed of 34 places in 1158 ms of which 82 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 08:58:53] [INFO ] Deduced a trap composed of 35 places in 1102 ms of which 84 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 08:58:54] [INFO ] Deduced a trap composed of 35 places in 1002 ms of which 88 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 08:58:56] [INFO ] Deduced a trap composed of 35 places in 1423 ms of which 83 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 08:58:57] [INFO ] Deduced a trap composed of 36 places in 1289 ms of which 86 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 08:58:58] [INFO ] Deduced a trap composed of 36 places in 1114 ms of which 79 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 08:58:59] [INFO ] Deduced a trap composed of 36 places in 1217 ms of which 82 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 08:59:00] [INFO ] Deduced a trap composed of 36 places in 911 ms of which 69 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 08:59:01] [INFO ] Deduced a trap composed of 36 places in 860 ms of which 66 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 08:59:02] [INFO ] Deduced a trap composed of 36 places in 839 ms of which 67 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
SDD proceeding with computation,7 properties remain. new max is 131072
SDD size :51091 after 778336
[2025-06-01 08:59:03] [INFO ] Deduced a trap composed of 36 places in 855 ms of which 68 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 08:59:04] [INFO ] Deduced a trap composed of 36 places in 767 ms of which 61 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 08:59:05] [INFO ] Deduced a trap composed of 36 places in 767 ms of which 62 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 08:59:05] [INFO ] Deduced a trap composed of 36 places in 754 ms of which 60 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 08:59:06] [INFO ] Deduced a trap composed of 36 places in 892 ms of which 83 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 08:59:07] [INFO ] Deduced a trap composed of 36 places in 722 ms of which 52 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 08:59:08] [INFO ] Deduced a trap composed of 36 places in 575 ms of which 49 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 08:59:08] [INFO ] Deduced a trap composed of 36 places in 530 ms of which 46 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 08:59:09] [INFO ] Deduced a trap composed of 36 places in 557 ms of which 62 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 08:59:09] [INFO ] Deduced a trap composed of 36 places in 455 ms of which 37 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/1203 variables, 20/53 constraints. Problems are: Problem set: 0 solved, 7 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 08:59:11] [INFO ] Deduced a trap composed of 35 places in 1307 ms of which 84 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 08:59:12] [INFO ] Deduced a trap composed of 36 places in 1114 ms of which 85 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 08:59:13] [INFO ] Deduced a trap composed of 36 places in 1081 ms of which 79 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 08:59:14] [INFO ] Deduced a trap composed of 36 places in 1135 ms of which 91 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 08:59:15] [INFO ] Deduced a trap composed of 36 places in 931 ms of which 84 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
SDD proceeding with computation,7 properties remain. new max is 262144
SDD size :778336 after 812985
[2025-06-01 08:59:16] [INFO ] Deduced a trap composed of 36 places in 925 ms of which 79 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 08:59:17] [INFO ] Deduced a trap composed of 36 places in 1066 ms of which 73 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 08:59:18] [INFO ] Deduced a trap composed of 36 places in 781 ms of which 65 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 08:59:19] [INFO ] Deduced a trap composed of 36 places in 858 ms of which 62 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 08:59:19] [INFO ] Deduced a trap composed of 36 places in 704 ms of which 66 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 08:59:20] [INFO ] Deduced a trap composed of 36 places in 734 ms of which 90 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 08:59:21] [INFO ] Deduced a trap composed of 36 places in 545 ms of which 56 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 08:59:21] [INFO ] Deduced a trap composed of 36 places in 739 ms of which 56 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 08:59:22] [INFO ] Deduced a trap composed of 36 places in 550 ms of which 58 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 08:59:23] [INFO ] Deduced a trap composed of 36 places in 458 ms of which 49 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 08:59:23] [INFO ] Deduced a trap composed of 36 places in 453 ms of which 43 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 08:59:23] [INFO ] Deduced a trap composed of 36 places in 415 ms of which 44 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 08:59:24] [INFO ] Deduced a trap composed of 36 places in 372 ms of which 38 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 08:59:24] [INFO ] Deduced a trap composed of 36 places in 333 ms of which 35 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 08:59:25] [INFO ] Deduced a trap composed of 37 places in 363 ms of which 49 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/1203 variables, 20/73 constraints. Problems are: Problem set: 0 solved, 7 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 08:59:25] [INFO ] Deduced a trap composed of 36 places in 500 ms of which 45 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 08:59:26] [INFO ] Deduced a trap composed of 36 places in 342 ms of which 40 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 08:59:26] [INFO ] Deduced a trap composed of 36 places in 419 ms of which 61 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 08:59:26] [INFO ] Deduced a trap composed of 36 places in 418 ms of which 36 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 08:59:27] [INFO ] Deduced a trap composed of 37 places in 354 ms of which 33 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 08:59:27] [INFO ] Deduced a trap composed of 37 places in 347 ms of which 35 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 08:59:27] [INFO ] Deduced a trap composed of 38 places in 87 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 08:59:29] [INFO ] Deduced a trap composed of 35 places in 1228 ms of which 79 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 08:59:30] [INFO ] Deduced a trap composed of 34 places in 1079 ms of which 97 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 08:59:31] [INFO ] Deduced a trap composed of 35 places in 922 ms of which 71 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 08:59:32] [INFO ] Deduced a trap composed of 35 places in 1058 ms of which 70 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 08:59:33] [INFO ] Deduced a trap composed of 35 places in 867 ms of which 73 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 08:59:34] [INFO ] Deduced a trap composed of 35 places in 830 ms of which 67 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 08:59:34] [INFO ] Deduced a trap composed of 35 places in 848 ms of which 71 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 08:59:35] [INFO ] Deduced a trap composed of 35 places in 881 ms of which 70 ms to minimize.
SMT process timed out in 54659ms, After SMT, problems are : Problem set: 0 solved, 7 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 77 out of 1205 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1205/1205 places, 3916/3916 transitions.
Applied a total of 0 rules in 114 ms. Remains 1205 /1205 variables (removed 0) and now considering 3916/3916 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 116 ms. Remains : 1205/1205 places, 3916/3916 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1205/1205 places, 3916/3916 transitions.
Applied a total of 0 rules in 113 ms. Remains 1205 /1205 variables (removed 0) and now considering 3916/3916 (removed 0) transitions.
[2025-06-01 08:59:36] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 08:59:37] [INFO ] Implicit Places using invariants in 1871 ms returned []
[2025-06-01 08:59:37] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 08:59:39] [INFO ] State equation strengthened by 3330 read => feed constraints.
[2025-06-01 09:00:09] [INFO ] Performed 867/1205 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2025-06-01 09:00:20] [INFO ] Implicit Places using invariants and state equation in 42379 ms returned []
Implicit Place search using SMT with State Equation took 44269 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-01 09:00:20] [INFO ] Redundant transitions in 369 ms returned []
Running 3886 sub problems to find dead transitions.
[2025-06-01 09:00:20] [INFO ] Invariant cache hit.
[2025-06-01 09:00:20] [INFO ] State equation strengthened by 3330 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
SDD proceeding with computation,7 properties remain. new max is 524288
SDD size :812985 after 9.32992e+06
At refinement iteration 0 (INCLUDED_ONLY) 0/1204 variables, 30/30 constraints. Problems are: Problem set: 0 solved, 3886 unsolved
SMT process timed out in 33429ms, After SMT, problems are : Problem set: 0 solved, 3886 unsolved
Search for dead transitions found 0 dead transitions in 33457ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 78257 ms. Remains : 1205/1205 places, 3916/3916 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 3078 edges and 1205 vertex of which 728 / 1205 are part of one of the 2 SCC in 7 ms
Free SCC test removed 726 places
Drop transitions (Empty/Sink Transition effects.) removed 1778 transitions
Ensure Unique test removed 779 transitions
Reduce isomorphic transitions removed 2557 transitions.
Graph (complete) has 1594 edges and 479 vertex of which 403 are kept as prefixes of interest. Removing 76 places using SCC suffix rule.1 ms
Discarding 76 places :
Also discarding 21 output transitions
Drop transitions (Output transitions of discarded places.) removed 21 transitions
Drop transitions (Empty/Sink Transition effects.) removed 233 transitions
Reduce isomorphic transitions removed 233 transitions.
Iterating post reduction 0 with 233 rules applied. Total rules applied 235 place count 403 transition count 1105
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 2 Pre rules applied. Total rules applied 235 place count 403 transition count 1103
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 1 with 4 rules applied. Total rules applied 239 place count 401 transition count 1103
Discarding 176 places :
Symmetric choice reduction at 1 with 176 rule applications. Total rules 415 place count 225 transition count 731
Iterating global reduction 1 with 176 rules applied. Total rules applied 591 place count 225 transition count 731
Ensure Unique test removed 134 transitions
Reduce isomorphic transitions removed 134 transitions.
Iterating post reduction 1 with 134 rules applied. Total rules applied 725 place count 225 transition count 597
Discarding 16 places :
Symmetric choice reduction at 2 with 16 rule applications. Total rules 741 place count 209 transition count 565
Iterating global reduction 2 with 16 rules applied. Total rules applied 757 place count 209 transition count 565
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Iterating post reduction 2 with 16 rules applied. Total rules applied 773 place count 209 transition count 549
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 777 place count 207 transition count 547
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 3 with 2 rules applied. Total rules applied 779 place count 206 transition count 546
Drop transitions (Redundant composition of simpler transitions.) removed 33 transitions
Redundant transition composition rules discarded 33 transitions
Iterating global reduction 3 with 33 rules applied. Total rules applied 812 place count 206 transition count 513
Drop transitions (Trivial Post-Agglo cleanup.) removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 3 with 7 rules applied. Total rules applied 819 place count 206 transition count 506
Reduce places removed 7 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 4 with 9 rules applied. Total rules applied 828 place count 199 transition count 504
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 830 place count 197 transition count 504
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 831 place count 196 transition count 503
Iterating global reduction 6 with 1 rules applied. Total rules applied 832 place count 196 transition count 503
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 6 with 2 rules applied. Total rules applied 834 place count 195 transition count 502
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 6 with 1 rules applied. Total rules applied 835 place count 195 transition count 501
Free-agglomeration rule applied 46 times.
Iterating global reduction 6 with 46 rules applied. Total rules applied 881 place count 195 transition count 455
Reduce places removed 46 places and 0 transitions.
Ensure Unique test removed 38 transitions
Reduce isomorphic transitions removed 38 transitions.
Iterating post reduction 6 with 84 rules applied. Total rules applied 965 place count 149 transition count 417
Drop transitions (Redundant composition of simpler transitions.) removed 11 transitions
Redundant transition composition rules discarded 11 transitions
Iterating global reduction 7 with 11 rules applied. Total rules applied 976 place count 149 transition count 406
Free-agglomeration rule (complex) applied 4 times.
Iterating global reduction 7 with 4 rules applied. Total rules applied 980 place count 149 transition count 406
Reduce places removed 4 places and 0 transitions.
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 7 with 11 rules applied. Total rules applied 991 place count 145 transition count 399
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 8 with 1 rules applied. Total rules applied 992 place count 145 transition count 398
Partial Free-agglomeration rule applied 41 times.
Drop transitions (Partial Free agglomeration) removed 41 transitions
Iterating global reduction 8 with 41 rules applied. Total rules applied 1033 place count 145 transition count 398
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 1034 place count 145 transition count 397
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 9 with 1 rules applied. Total rules applied 1035 place count 145 transition count 397
Reduce places removed 5 places and 5 transitions.
Iterating global reduction 9 with 5 rules applied. Total rules applied 1040 place count 140 transition count 392
Applied a total of 1040 rules in 555 ms. Remains 140 /1205 variables (removed 1065) and now considering 392/3916 (removed 3524) transitions.
Running SMT prover for 7 properties.
// Phase 1: matrix 392 rows 140 cols
[2025-06-01 09:00:54] [INFO ] Computed 6 invariants in 2 ms
Starting Z3 with timeout 450.0 s and query timeout 45000.0 ms
[2025-06-01 09:00:54] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2025-06-01 09:00:54] [INFO ] After 93ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:7
Starting Z3 with timeout 450.0 s and query timeout 45000.0 ms
[2025-06-01 09:00:54] [INFO ] [Nat]Absence check using 6 positive place invariants in 1 ms returned sat
[2025-06-01 09:00:55] [INFO ] After 214ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :7
TRAPS : Iteration 0
[2025-06-01 09:00:55] [INFO ] After 411ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :7
[2025-06-01 09:00:55] [INFO ] After 629ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :7
[2025-06-01 09:00:55] [INFO ] Flatten gal took : 20 ms
[2025-06-01 09:00:55] [INFO ] Flatten gal took : 18 ms
[2025-06-01 09:00:55] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality5508375574003699297.gal : 4 ms
[2025-06-01 09:00:55] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality17861676377963372719.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality5508375574003699297.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality17861676377963372719.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/ReachabilityCardinality17861676377963372719.prop.
SDD proceeding with computation,7 properties remain. new max is 4
SDD size :1 after 6
SDD proceeding with computation,7 properties remain. new max is 8
SDD size :6 after 10
SDD proceeding with computation,7 properties remain. new max is 16
SDD size :10 after 34
SDD proceeding with computation,7 properties remain. new max is 32
SDD size :34 after 139
SDD proceeding with computation,7 properties remain. new max is 64
SDD size :139 after 167
SDD proceeding with computation,7 properties remain. new max is 128
SDD size :167 after 783
SDD proceeding with computation,7 properties remain. new max is 256
SDD size :783 after 21066
SDD proceeding with computation,7 properties remain. new max is 512
SDD size :21066 after 47725
SDD proceeding with computation,7 properties remain. new max is 1024
SDD size :47725 after 709538
SDD proceeding with computation,7 properties remain. new max is 2048
SDD size :709538 after 8.51784e+07
SDD proceeding with computation,7 properties remain. new max is 4096
SDD size :8.51784e+07 after 1.00941e+08
Invariant property CANInsertWithFailure-PT-030-ReachabilityCardinality-2023-07 does not hold.
SDD proceeding with computation,6 properties remain. new max is 4096
SDD size :1.00941e+08 after 1.60697e+10
Detected timeout of ITS tools.
[2025-06-01 09:01:10] [INFO ] Flatten gal took : 17 ms
[2025-06-01 09:01:10] [INFO ] Applying decomposition
[2025-06-01 09:01:10] [INFO ] Flatten gal took : 16 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/graph13506760964032347022.txt' '-o' '/tmp/graph13506760964032347022.bin' '-w' '/tmp/graph13506760964032347022.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph13506760964032347022.bin' '-l' '-1' '-v' '-w' '/tmp/graph13506760964032347022.weights' '-q' '0' '-e' '0.001'
[2025-06-01 09:01:10] [INFO ] Decomposing Gal with order
[2025-06-01 09:01:11] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-01 09:01:11] [INFO ] Removed a total of 246 redundant transitions.
[2025-06-01 09:01:11] [INFO ] Flatten gal took : 92 ms
[2025-06-01 09:01:11] [INFO ] Fuse similar labels procedure discarded/fused a total of 37 labels/synchronizations in 18 ms.
[2025-06-01 09:01:11] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality8908775017818595991.gal : 6 ms
[2025-06-01 09:01:11] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality4803621424869626919.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/ReachabilityCardinality8908775017818595991.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality4803621424869626919.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/ReachabilityCardinality4803621424869626919.prop.
SDD proceeding with computation,6 properties remain. new max is 4
SDD size :1 after 5
SDD proceeding with computation,6 properties remain. new max is 8
SDD size :5 after 18
SDD proceeding with computation,6 properties remain. new max is 16
SDD size :18 after 108
SDD proceeding with computation,6 properties remain. new max is 32
SDD size :108 after 319
SDD proceeding with computation,6 properties remain. new max is 64
SDD size :319 after 486
SDD proceeding with computation,6 properties remain. new max is 128
SDD size :486 after 1086
SDD proceeding with computation,6 properties remain. new max is 256
SDD size :1086 after 9132
SDD proceeding with computation,6 properties remain. new max is 512
SDD size :9132 after 55174
SDD proceeding with computation,6 properties remain. new max is 1024
SDD size :55174 after 280668
SDD proceeding with computation,6 properties remain. new max is 2048
SDD size :280668 after 1.71746e+06
Detected timeout of ITS tools.
Over-approximation ignoring read arcs solved 0 properties in 32089 ms.
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
[2025-06-01 09:01:26] [INFO ] Flatten gal took : 287 ms
[2025-06-01 09:01:26] [INFO ] Applying decomposition
[2025-06-01 09:01:26] [INFO ] Flatten gal took : 195 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/graph1548198617517636201.txt' '-o' '/tmp/graph1548198617517636201.bin' '-w' '/tmp/graph1548198617517636201.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph1548198617517636201.bin' '-l' '-1' '-v' '-w' '/tmp/graph1548198617517636201.weights' '-q' '0' '-e' '0.001'
[2025-06-01 09:01:27] [INFO ] Decomposing Gal with order
[2025-06-01 09:01:27] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-01 09:01:28] [INFO ] Removed a total of 2976 redundant transitions.
[2025-06-01 09:01:28] [INFO ] Flatten gal took : 566 ms
[2025-06-01 09:01:28] [INFO ] Fuse similar labels procedure discarded/fused a total of 1744 labels/synchronizations in 314 ms.
[2025-06-01 09:01:29] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality2492638322554641265.gal : 42 ms
[2025-06-01 09:01:29] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality16440761369537599229.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/ReachabilityCardinality2492638322554641265.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality16440761369537599229.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/ReachabilityCardinality16440761369537599229.prop.
SDD proceeding with computation,7 properties remain. new max is 4
SDD size :1 after 4
SDD proceeding with computation,7 properties remain. new max is 8
SDD size :4 after 8
SDD proceeding with computation,7 properties remain. new max is 16
SDD size :8 after 16
SDD proceeding with computation,7 properties remain. new max is 32
SDD size :16 after 27
SDD proceeding with computation,7 properties remain. new max is 64
SDD size :27 after 41
SDD proceeding with computation,7 properties remain. new max is 128
SDD size :41 after 45
SDD proceeding with computation,7 properties remain. new max is 256
SDD size :45 after 51
SDD proceeding with computation,7 properties remain. new max is 512
SDD size :51 after 70
SDD proceeding with computation,7 properties remain. new max is 1024
SDD size :70 after 91
SDD proceeding with computation,7 properties remain. new max is 2048
SDD size :91 after 1806
SDD proceeding with computation,7 properties remain. new max is 4096
SDD size :1806 after 2136
SDD proceeding with computation,7 properties remain. new max is 8192
SDD size :2136 after 2668
SDD proceeding with computation,7 properties remain. new max is 16384
SDD size :2668 after 53766
SDD proceeding with computation,7 properties remain. new max is 32768
SDD size :53766 after 63344
SDD proceeding with computation,7 properties remain. new max is 65536
SDD size :63344 after 70796
SDD proceeding with computation,7 properties remain. new max is 131072
SDD size :70796 after 1.07834e+06
SDD proceeding with computation,7 properties remain. new max is 262144
SDD size :1.07834e+06 after 1.2273e+06
SDD proceeding with computation,7 properties remain. new max is 524288
SDD size :1.2273e+06 after 1.48746e+07
SDD proceeding with computation,7 properties remain. new max is 1048576
SDD size :1.48746e+07 after 1.60132e+07
SDD proceeding with computation,7 properties remain. new max is 2097152
SDD size :1.60132e+07 after 1.66936e+07
SDD proceeding with computation,7 properties remain. new max is 4194304
SDD size :1.66936e+07 after 1.65315e+08
Detected timeout of ITS tools.
[2025-06-01 09:31:47] [INFO ] Flatten gal took : 14803 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin8493600757264407064
[2025-06-01 09:31:49] [INFO ] Too many transitions (3916) to apply POR reductions. Disabling POR matrices.
[2025-06-01 09:31:49] [INFO ] Applying decomposition
[2025-06-01 09:31:50] [INFO ] Built C files in 886ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8493600757264407064
Running compilation step : cd /tmp/ltsmin8493600757264407064;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '102' '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-01 09:31:50] [INFO ] Flatten gal took : 1030 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/graph2885531181807414767.txt' '-o' '/tmp/graph2885531181807414767.bin' '-w' '/tmp/graph2885531181807414767.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph2885531181807414767.bin' '-l' '-1' '-v' '-w' '/tmp/graph2885531181807414767.weights' '-q' '0' '-e' '0.001'
[2025-06-01 09:31:51] [INFO ] Decomposing Gal with order
[2025-06-01 09:31:51] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-01 09:31:52] [INFO ] Removed a total of 3280 redundant transitions.
[2025-06-01 09:31:52] [INFO ] Flatten gal took : 423 ms
[2025-06-01 09:31:52] [INFO ] Fuse similar labels procedure discarded/fused a total of 1651 labels/synchronizations in 147 ms.
[2025-06-01 09:31:52] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality5180011977281869398.gal : 25 ms
[2025-06-01 09:31:52] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality177496175410057096.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/ReachabilityCardinality5180011977281869398.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality177496175410057096.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 ...327
Loading property file /tmp/ReachabilityCardinality177496175410057096.prop.
SDD proceeding with computation,7 properties remain. new max is 4
SDD size :1 after 259
SDD proceeding with computation,7 properties remain. new max is 8
SDD size :259 after 260
SDD proceeding with computation,7 properties remain. new max is 16
SDD size :260 after 263
SDD proceeding with computation,7 properties remain. new max is 32
SDD size :263 after 267
SDD proceeding with computation,7 properties remain. new max is 64
SDD size :267 after 269
SDD proceeding with computation,7 properties remain. new max is 128
SDD size :269 after 270
SDD proceeding with computation,7 properties remain. new max is 256
SDD size :270 after 279
SDD proceeding with computation,7 properties remain. new max is 512
SDD size :279 after 314
SDD proceeding with computation,7 properties remain. new max is 1024
SDD size :314 after 363
Compilation finished in 18668 ms.
Running link step : cd /tmp/ltsmin8493600757264407064;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 90 ms.
Running LTSmin : cd /tmp/ltsmin8493600757264407064;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '-i' 'CANInsertWithFailurePT030ReachabilityCardinality202503==true'
SDD proceeding with computation,7 properties remain. new max is 2048
SDD size :363 after 445
SDD proceeding with computation,7 properties remain. new max is 4096
SDD size :445 after 681
WARNING : LTSmin timed out (>73 s) on command cd /tmp/ltsmin8493600757264407064;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '-i' 'CANInsertWithFailurePT030ReachabilityCardinality202503==true'
Running LTSmin : cd /tmp/ltsmin8493600757264407064;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '-i' 'CANInsertWithFailurePT030ReachabilityCardinality202305==true'
SDD proceeding with computation,7 properties remain. new max is 8192
SDD size :681 after 14907
WARNING : LTSmin timed out (>73 s) on command cd /tmp/ltsmin8493600757264407064;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '-i' 'CANInsertWithFailurePT030ReachabilityCardinality202305==true'
Running LTSmin : cd /tmp/ltsmin8493600757264407064;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '-i' 'CANInsertWithFailurePT030ReachabilityCardinality202506==true'
WARNING : LTSmin timed out (>73 s) on command cd /tmp/ltsmin8493600757264407064;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '-i' 'CANInsertWithFailurePT030ReachabilityCardinality202506==true'
Running LTSmin : cd /tmp/ltsmin8493600757264407064;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '-i' 'CANInsertWithFailurePT030ReachabilityCardinality202307==true'
SDD proceeding with computation,7 properties remain. new max is 16384
SDD size :14907 after 19102
WARNING : LTSmin timed out (>73 s) on command cd /tmp/ltsmin8493600757264407064;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '-i' 'CANInsertWithFailurePT030ReachabilityCardinality202307==true'
Running LTSmin : cd /tmp/ltsmin8493600757264407064;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '-i' 'CANInsertWithFailurePT030ReachabilityCardinality202308==true'
WARNING : LTSmin timed out (>73 s) on command cd /tmp/ltsmin8493600757264407064;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '-i' 'CANInsertWithFailurePT030ReachabilityCardinality202308==true'
Running LTSmin : cd /tmp/ltsmin8493600757264407064;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '-i' 'CANInsertWithFailurePT030ReachabilityCardinality202512==true'
WARNING : LTSmin timed out (>73 s) on command cd /tmp/ltsmin8493600757264407064;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '-i' 'CANInsertWithFailurePT030ReachabilityCardinality202512==true'
Running LTSmin : cd /tmp/ltsmin8493600757264407064;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '-i' 'CANInsertWithFailurePT030ReachabilityCardinality202515==true'
WARNING : LTSmin timed out (>73 s) on command cd /tmp/ltsmin8493600757264407064;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '-i' 'CANInsertWithFailurePT030ReachabilityCardinality202515==true'
Retrying LTSmin with larger timeout 4112 s
Running LTSmin : cd /tmp/ltsmin8493600757264407064;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '-i' 'CANInsertWithFailurePT030ReachabilityCardinality202503==true'
SDD proceeding with computation,7 properties remain. new max is 32768
SDD size :19102 after 355540
WARNING : LTSmin timed out (>587 s) on command cd /tmp/ltsmin8493600757264407064;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '-i' 'CANInsertWithFailurePT030ReachabilityCardinality202503==true'
Running LTSmin : cd /tmp/ltsmin8493600757264407064;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '-i' 'CANInsertWithFailurePT030ReachabilityCardinality202305==true'

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-030"
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-030, 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-174853813600278"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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