Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/data/fkordon/mcc2024-input.r180-tall-171640602500030.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
..........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool itstools
Input is FlexibleBarrier-PT-06b, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r180-tall-171640602500030
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 600K
-rw-r--r-- 1 mcc users 6.9K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 72K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.3K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 48K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:42 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K May 18 16:42 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.4K Apr 22 14:44 LTLCardinality.txt
-rw-r--r-- 1 mcc users 21K Apr 22 14:44 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K May 19 07:17 LTLFireability.txt
-rw-r--r-- 1 mcc users 20K May 19 18:20 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Apr 13 08:26 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 109K Apr 13 08:26 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Apr 13 08:26 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 95K Apr 13 08:26 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 22 14:44 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 22 14:44 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 4 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 141K May 18 16:42 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1716416195226

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=ReachabilityCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=FlexibleBarrier-PT-06b
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
ReachabilityCardinality PT
Running Version 202405141337
[2024-05-22 22:16:36] [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]
[2024-05-22 22:16:36] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-22 22:16:36] [INFO ] Load time of PNML (sax parser for PT used): 95 ms
[2024-05-22 22:16:36] [INFO ] Transformed 542 places.
[2024-05-22 22:16:36] [INFO ] Transformed 621 transitions.
[2024-05-22 22:16:36] [INFO ] Found NUPN structural information;
[2024-05-22 22:16:36] [INFO ] Parsed PT model containing 542 places and 621 transitions and 1533 arcs in 194 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 18 ms.
Working with output stream class java.io.PrintStream
FORMULA FlexibleBarrier-PT-06b-ReachabilityCardinality-2024-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FlexibleBarrier-PT-06b-ReachabilityCardinality-2024-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FlexibleBarrier-PT-06b-ReachabilityCardinality-2024-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FlexibleBarrier-PT-06b-ReachabilityCardinality-2024-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FlexibleBarrier-PT-06b-ReachabilityCardinality-2024-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FlexibleBarrier-PT-06b-ReachabilityCardinality-2024-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-22 22:16:37] [INFO ] Flatten gal took : 199 ms
RANDOM walk for 40000 steps (771 resets) in 1840 ms. (21 steps per ms) remains 7/10 properties
FORMULA FlexibleBarrier-PT-06b-ReachabilityCardinality-2024-10 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FlexibleBarrier-PT-06b-ReachabilityCardinality-2024-08 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FlexibleBarrier-PT-06b-ReachabilityCardinality-2024-03 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
[2024-05-22 22:16:37] [INFO ] Flatten gal took : 88 ms
[2024-05-22 22:16:37] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality5430654540570966554.gal : 45 ms
[2024-05-22 22:16:37] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality4999488061917776788.prop : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality5430654540570966554.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality4999488061917776788.prop' '--nowitness' '--gen-order' 'FOLLOW'
BEST_FIRST walk for 40004 steps (114 resets) in 366 ms. (109 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (116 resets) in 313 ms. (127 steps per ms) remains 6/7 properties
FORMULA FlexibleBarrier-PT-06b-ReachabilityCardinality-2024-12 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...328
BEST_FIRST walk for 40004 steps (123 resets) in 441 ms. (90 steps per ms) remains 6/6 properties
Loading property file /tmp/ReachabilityCardinality4999488061917776788.prop.
BEST_FIRST walk for 40004 steps (111 resets) in 195 ms. (204 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (109 resets) in 78 ms. (506 steps per ms) remains 5/6 properties
FORMULA FlexibleBarrier-PT-06b-ReachabilityCardinality-2024-13 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
SDD proceeding with computation,7 properties remain. new max is 4
SDD size :1 after 5
SDD proceeding with computation,7 properties remain. new max is 8
SDD size :5 after 10
SDD proceeding with computation,7 properties remain. new max is 16
SDD size :10 after 26
SDD proceeding with computation,7 properties remain. new max is 32
SDD size :26 after 406
SDD proceeding with computation,7 properties remain. new max is 64
SDD size :406 after 8025
SDD proceeding with computation,7 properties remain. new max is 128
SDD size :8025 after 3.20842e+06
BEST_FIRST walk for 40003 steps (113 resets) in 701 ms. (56 steps per ms) remains 4/5 properties
FORMULA FlexibleBarrier-PT-06b-ReachabilityCardinality-2024-04 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
// Phase 1: matrix 621 rows 542 cols
[2024-05-22 22:16:38] [INFO ] Computed 8 invariants in 17 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/85 variables, 85/85 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/85 variables, 0/85 constraints. Problems are: Problem set: 0 solved, 4 unsolved
Problem FlexibleBarrier-PT-06b-ReachabilityCardinality-2024-07 is UNSAT
FORMULA FlexibleBarrier-PT-06b-ReachabilityCardinality-2024-07 FALSE TECHNIQUES SMT_REFINEMENT
At refinement iteration 2 (OVERLAPS) 457/542 variables, 8/93 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/542 variables, 457/550 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/542 variables, 0/550 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 621/1163 variables, 542/1092 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1163 variables, 0/1092 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 0/1163 variables, 0/1092 constraints. Problems are: Problem set: 1 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1163/1163 variables, and 1092 constraints, problems are : Problem set: 1 solved, 3 unsolved in 733 ms.
Refiners :[Domain max(s): 542/542 constraints, Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 542/542 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/60 variables, 60/60 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/60 variables, 0/60 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 2 (OVERLAPS) 482/542 variables, 8/68 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/542 variables, 482/550 constraints. Problems are: Problem set: 1 solved, 3 unsolved
[2024-05-22 22:16:39] [INFO ] Deduced a trap composed of 195 places in 303 ms of which 43 ms to minimize.
[2024-05-22 22:16:39] [INFO ] Deduced a trap composed of 190 places in 383 ms of which 6 ms to minimize.
[2024-05-22 22:16:40] [INFO ] Deduced a trap composed of 193 places in 287 ms of which 3 ms to minimize.
[2024-05-22 22:16:40] [INFO ] Deduced a trap composed of 131 places in 205 ms of which 12 ms to minimize.
[2024-05-22 22:16:40] [INFO ] Deduced a trap composed of 160 places in 174 ms of which 3 ms to minimize.
[2024-05-22 22:16:40] [INFO ] Deduced a trap composed of 190 places in 113 ms of which 2 ms to minimize.
[2024-05-22 22:16:40] [INFO ] Deduced a trap composed of 119 places in 102 ms of which 4 ms to minimize.
[2024-05-22 22:16:41] [INFO ] Deduced a trap composed of 158 places in 195 ms of which 3 ms to minimize.
[2024-05-22 22:16:41] [INFO ] Deduced a trap composed of 161 places in 377 ms of which 3 ms to minimize.
[2024-05-22 22:16:41] [INFO ] Deduced a trap composed of 191 places in 150 ms of which 3 ms to minimize.
[2024-05-22 22:16:42] [INFO ] Deduced a trap composed of 161 places in 671 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/542 variables, 11/561 constraints. Problems are: Problem set: 1 solved, 3 unsolved
[2024-05-22 22:16:42] [INFO ] Deduced a trap composed of 165 places in 199 ms of which 5 ms to minimize.
[2024-05-22 22:16:43] [INFO ] Deduced a trap composed of 167 places in 571 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/542 variables, 2/563 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/542 variables, 0/563 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 621/1163 variables, 542/1105 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1163 variables, 3/1108 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1163 variables, 0/1108 constraints. Problems are: Problem set: 1 solved, 3 unsolved
[2024-05-22 22:16:43] [INFO ] Deduced a trap composed of 18 places in 241 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1163/1163 variables, and 1109 constraints, problems are : Problem set: 1 solved, 3 unsolved in 5014 ms.
Refiners :[Domain max(s): 542/542 constraints, Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 542/542 constraints, PredecessorRefiner: 3/4 constraints, Known Traps: 14/14 constraints]
After SMT, in 5846ms problems are : Problem set: 1 solved, 3 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 60 out of 542 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 542/542 places, 621/621 transitions.
Graph (trivial) has 402 edges and 542 vertex of which 18 / 542 are part of one of the 3 SCC in 3 ms
Free SCC test removed 15 places
Drop transitions (Empty/Sink Transition effects.) removed 18 transitions
Reduce isomorphic transitions removed 18 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 105 transitions
Trivial Post-agglo rules discarded 105 transitions
Performed 105 trivial Post agglomeration. Transition count delta: 105
Iterating post reduction 0 with 105 rules applied. Total rules applied 106 place count 527 transition count 498
Reduce places removed 105 places and 0 transitions.
Performed 16 Post agglomeration using F-continuation condition.Transition count delta: 16
Iterating post reduction 1 with 121 rules applied. Total rules applied 227 place count 422 transition count 482
Reduce places removed 16 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 17 rules applied. Total rules applied 244 place count 406 transition count 481
Performed 24 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 24 Pre rules applied. Total rules applied 244 place count 406 transition count 457
Deduced a syphon composed of 24 places in 2 ms
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 3 with 48 rules applied. Total rules applied 292 place count 382 transition count 457
Discarding 132 places :
Symmetric choice reduction at 3 with 132 rule applications. Total rules 424 place count 250 transition count 325
Iterating global reduction 3 with 132 rules applied. Total rules applied 556 place count 250 transition count 325
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 556 place count 250 transition count 324
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 558 place count 249 transition count 324
Discarding 12 places :
Symmetric choice reduction at 3 with 12 rule applications. Total rules 570 place count 237 transition count 312
Iterating global reduction 3 with 12 rules applied. Total rules applied 582 place count 237 transition count 312
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 3 with 7 rules applied. Total rules applied 589 place count 237 transition count 305
Performed 35 Post agglomeration using F-continuation condition.Transition count delta: 35
Deduced a syphon composed of 35 places in 0 ms
Reduce places removed 35 places and 0 transitions.
Iterating global reduction 4 with 70 rules applied. Total rules applied 659 place count 202 transition count 270
Drop transitions (Empty/Sink Transition effects.) removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 4 with 4 rules applied. Total rules applied 663 place count 202 transition count 266
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 666 place count 199 transition count 263
Iterating global reduction 5 with 3 rules applied. Total rules applied 669 place count 199 transition count 263
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -17
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 5 with 8 rules applied. Total rules applied 677 place count 195 transition count 280
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 5 with 3 rules applied. Total rules applied 680 place count 195 transition count 277
Free-agglomeration rule applied 67 times.
Iterating global reduction 5 with 67 rules applied. Total rules applied 747 place count 195 transition count 210
Reduce places removed 67 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 5 with 72 rules applied. Total rules applied 819 place count 128 transition count 205
Drop transitions (Redundant composition of simpler transitions.) removed 9 transitions
Redundant transition composition rules discarded 9 transitions
Iterating global reduction 6 with 9 rules applied. Total rules applied 828 place count 128 transition count 196
Partial Free-agglomeration rule applied 6 times.
Drop transitions (Partial Free agglomeration) removed 6 transitions
Iterating global reduction 6 with 6 rules applied. Total rules applied 834 place count 128 transition count 196
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 6 with 1 rules applied. Total rules applied 835 place count 128 transition count 196
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 836 place count 127 transition count 195
Applied a total of 836 rules in 210 ms. Remains 127 /542 variables (removed 415) and now considering 195/621 (removed 426) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 229 ms. Remains : 127/542 places, 195/621 transitions.
RANDOM walk for 40000 steps (774 resets) in 357 ms. (111 steps per ms) remains 1/3 properties
FORMULA FlexibleBarrier-PT-06b-ReachabilityCardinality-2024-14 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FlexibleBarrier-PT-06b-ReachabilityCardinality-2024-11 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (125 resets) in 86 ms. (459 steps per ms) remains 1/1 properties
[2024-05-22 22:16:44] [INFO ] Flow matrix only has 194 transitions (discarded 1 similar events)
// Phase 1: matrix 194 rows 127 cols
[2024-05-22 22:16:44] [INFO ] Computed 8 invariants in 1 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/28 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 80/108 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/108 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 164/272 variables, 108/115 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/272 variables, 0/115 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 28/300 variables, 9/124 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/300 variables, 0/124 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 10/310 variables, 1/125 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/310 variables, 0/125 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 11/321 variables, 10/135 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/321 variables, 0/135 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 0/321 variables, 0/135 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 321/321 variables, and 135 constraints, problems are : Problem set: 0 solved, 1 unsolved in 144 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 127/127 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/28 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 80/108 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-22 22:16:44] [INFO ] Deduced a trap composed of 24 places in 59 ms of which 0 ms to minimize.
[2024-05-22 22:16:44] [INFO ] Deduced a trap composed of 28 places in 93 ms of which 1 ms to minimize.
[2024-05-22 22:16:44] [INFO ] Deduced a trap composed of 23 places in 46 ms of which 6 ms to minimize.
[2024-05-22 22:16:44] [INFO ] Deduced a trap composed of 22 places in 34 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/108 variables, 4/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/108 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 164/272 variables, 108/119 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/272 variables, 0/119 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 28/300 variables, 9/128 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/300 variables, 1/129 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/300 variables, 0/129 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 10/310 variables, 1/130 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/310 variables, 0/130 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 11/321 variables, 10/140 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/321 variables, 0/140 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 0/321 variables, 0/140 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 321/321 variables, and 140 constraints, problems are : Problem set: 0 solved, 1 unsolved in 500 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 127/127 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 4/4 constraints]
After SMT, in 654ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 65 steps, including 1 resets, run visited all 1 properties in 2 ms. (steps per millisecond=32 )
FORMULA FlexibleBarrier-PT-06b-ReachabilityCardinality-2024-02 FALSE TECHNIQUES PARIKH_WALK
Parikh walk visited 1 properties in 12 ms.
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
All properties solved without resorting to model-checking.
Total runtime 8591 ms.

BK_STOP 1716416205037

--------------------
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
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination 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="FlexibleBarrier-PT-06b"
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-5568"
echo " Executing tool itstools"
echo " Input is FlexibleBarrier-PT-06b, 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 r180-tall-171640602500030"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/FlexibleBarrier-PT-06b.tgz
mv FlexibleBarrier-PT-06b 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.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property ReachabilityCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -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 ;