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.r356-tall-171683760800295.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 ShieldIIPt-PT-030A, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r356-tall-171683760800295
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 596K
-rw-r--r-- 1 mcc users 6.2K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 65K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.1K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 44K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.4K Apr 23 07:52 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Apr 23 07:52 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Apr 23 07:52 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 23 07:52 LTLFireability.xml
-rw-r--r-- 1 mcc users 15K Apr 12 22:53 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 158K Apr 12 22:53 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 5.1K Apr 12 22:29 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 36K Apr 12 22:29 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 23 07:52 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 23 07:52 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 5 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 159K May 18 16:43 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 ShieldIIPt-PT-030A-ReachabilityFireability-2024-00
FORMULA_NAME ShieldIIPt-PT-030A-ReachabilityFireability-2024-01
FORMULA_NAME ShieldIIPt-PT-030A-ReachabilityFireability-2024-02
FORMULA_NAME ShieldIIPt-PT-030A-ReachabilityFireability-2024-03
FORMULA_NAME ShieldIIPt-PT-030A-ReachabilityFireability-2024-04
FORMULA_NAME ShieldIIPt-PT-030A-ReachabilityFireability-2024-05
FORMULA_NAME ShieldIIPt-PT-030A-ReachabilityFireability-2024-06
FORMULA_NAME ShieldIIPt-PT-030A-ReachabilityFireability-2024-07
FORMULA_NAME ShieldIIPt-PT-030A-ReachabilityFireability-2024-08
FORMULA_NAME ShieldIIPt-PT-030A-ReachabilityFireability-2024-09
FORMULA_NAME ShieldIIPt-PT-030A-ReachabilityFireability-2024-10
FORMULA_NAME ShieldIIPt-PT-030A-ReachabilityFireability-2024-11
FORMULA_NAME ShieldIIPt-PT-030A-ReachabilityFireability-2024-12
FORMULA_NAME ShieldIIPt-PT-030A-ReachabilityFireability-2024-13
FORMULA_NAME ShieldIIPt-PT-030A-ReachabilityFireability-2024-14
FORMULA_NAME ShieldIIPt-PT-030A-ReachabilityFireability-2024-15

=== Now, execution of the tool begins

BK_START 1716935476241

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=ReachabilityFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ShieldIIPt-PT-030A
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
ReachabilityFireability PT
Running Version 202405141337
[2024-05-28 22:31:17] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-28 22:31:17] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-28 22:31:17] [INFO ] Load time of PNML (sax parser for PT used): 107 ms
[2024-05-28 22:31:17] [INFO ] Transformed 573 places.
[2024-05-28 22:31:17] [INFO ] Transformed 423 transitions.
[2024-05-28 22:31:17] [INFO ] Found NUPN structural information;
[2024-05-28 22:31:17] [INFO ] Parsed PT model containing 573 places and 423 transitions and 1806 arcs in 215 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 18 ms.
Working with output stream class java.io.PrintStream
Ensure Unique test removed 1 transitions
Reduce redundant transitions removed 1 transitions.
[2024-05-28 22:31:18] [INFO ] Flatten gal took : 279 ms
[2024-05-28 22:31:18] [INFO ] Flatten gal took : 142 ms
[2024-05-28 22:31:18] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality12576008670151787243.gal : 51 ms
[2024-05-28 22:31:18] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality12494023225047940287.prop : 3 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality12576008670151787243.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality12494023225047940287.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.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...330
RANDOM walk for 40000 steps (8 resets) in 3123 ms. (12 steps per ms) remains 10/16 properties
FORMULA ShieldIIPt-PT-030A-ReachabilityFireability-2024-14 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPt-PT-030A-ReachabilityFireability-2024-13 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPt-PT-030A-ReachabilityFireability-2024-08 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPt-PT-030A-ReachabilityFireability-2024-06 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPt-PT-030A-ReachabilityFireability-2024-03 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPt-PT-030A-ReachabilityFireability-2024-01 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Loading property file /tmp/ReachabilityCardinality12494023225047940287.prop.
BEST_FIRST walk for 40003 steps (8 resets) in 474 ms. (84 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 275 ms. (144 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 307 ms. (129 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40001 steps (8 resets) in 1005 ms. (39 steps per ms) remains 10/10 properties
SDD proceeding with computation,16 properties remain. new max is 4
SDD size :2 after 3
SDD proceeding with computation,16 properties remain. new max is 8
SDD size :4 after 12
Reachability property ShieldIIPt-PT-030A-ReachabilityFireability-2024-14 is true.
SDD proceeding with computation,15 properties remain. new max is 8
SDD size :12 after 25
SDD proceeding with computation,15 properties remain. new max is 16
SDD size :25 after 39
SDD proceeding with computation,15 properties remain. new max is 32
SDD size :39 after 64
Reachability property ShieldIIPt-PT-030A-ReachabilityFireability-2024-12 is true.
FORMULA ShieldIIPt-PT-030A-ReachabilityFireability-2024-12 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING
Invariant property ShieldIIPt-PT-030A-ReachabilityFireability-2024-10 does not hold.
FORMULA ShieldIIPt-PT-030A-ReachabilityFireability-2024-10 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING
Reachability property ShieldIIPt-PT-030A-ReachabilityFireability-2024-09 is true.
FORMULA ShieldIIPt-PT-030A-ReachabilityFireability-2024-09 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING
SDD proceeding with computation,12 properties remain. new max is 32
SDD size :64 after 114
SDD proceeding with computation,12 properties remain. new max is 64
SDD size :114 after 252
SDD proceeding with computation,12 properties remain. new max is 128
SDD size :252 after 7150
SDD proceeding with computation,12 properties remain. new max is 256
SDD size :7150 after 77689
BEST_FIRST walk for 40004 steps (8 resets) in 589 ms. (67 steps per ms) remains 10/10 properties
SDD proceeding with computation,12 properties remain. new max is 512
SDD size :77689 after 9.83041e+06
BEST_FIRST walk for 40004 steps (8 resets) in 435 ms. (91 steps per ms) remains 10/10 properties
SDD proceeding with computation,12 properties remain. new max is 1024
SDD size :9.83041e+06 after 1.25745e+13
BEST_FIRST walk for 40004 steps (8 resets) in 283 ms. (140 steps per ms) remains 10/10 properties
Reachability property ShieldIIPt-PT-030A-ReachabilityFireability-2024-08 is true.
Invariant property ShieldIIPt-PT-030A-ReachabilityFireability-2024-07 does not hold.
FORMULA ShieldIIPt-PT-030A-ReachabilityFireability-2024-07 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING
BEST_FIRST walk for 40004 steps (8 resets) in 349 ms. (114 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 220 ms. (181 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 231 ms. (172 steps per ms) remains 10/10 properties
// Phase 1: matrix 422 rows 573 cols
[2024-05-28 22:31:20] [INFO ] Computed 271 invariants in 30 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/127 variables, 127/127 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/127 variables, 0/127 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (OVERLAPS) 121/248 variables, 116/243 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/248 variables, 121/364 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/248 variables, 0/364 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (OVERLAPS) 325/573 variables, 155/519 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/573 variables, 325/844 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/573 variables, 0/844 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (OVERLAPS) 422/995 variables, 573/1417 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/995 variables, 0/1417 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (OVERLAPS) 0/995 variables, 0/1417 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 995/995 variables, and 1417 constraints, problems are : Problem set: 0 solved, 6 unsolved in 814 ms.
Refiners :[Domain max(s): 573/573 constraints, Positive P Invariants (semi-flows): 271/271 constraints, State Equation: 573/573 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/127 variables, 127/127 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/127 variables, 0/127 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (OVERLAPS) 121/248 variables, 116/243 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/248 variables, 121/364 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/248 variables, 0/364 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (OVERLAPS) 325/573 variables, 155/519 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/573 variables, 325/844 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/573 variables, 0/844 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (OVERLAPS) 422/995 variables, 573/1417 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/995 variables, 6/1423 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/995 variables, 0/1423 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 11 (OVERLAPS) 0/995 variables, 0/1423 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 995/995 variables, and 1423 constraints, problems are : Problem set: 0 solved, 6 unsolved in 1649 ms.
Refiners :[Domain max(s): 573/573 constraints, Positive P Invariants (semi-flows): 271/271 constraints, State Equation: 573/573 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
After SMT, in 2583ms problems are : Problem set: 0 solved, 6 unsolved
Fused 6 Parikh solutions to 5 different solutions.
Parikh walk visited 0 properties in 12684 ms.
Support contains 127 out of 573 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 573/573 places, 422/422 transitions.
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 0 with 2 rules applied. Total rules applied 2 place count 572 transition count 421
Partial Free-agglomeration rule applied 34 times.
Drop transitions (Partial Free agglomeration) removed 34 transitions
Iterating global reduction 0 with 34 rules applied. Total rules applied 36 place count 572 transition count 421
Applied a total of 36 rules in 103 ms. Remains 572 /573 variables (removed 1) and now considering 421/422 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 115 ms. Remains : 572/573 places, 421/422 transitions.
RANDOM walk for 40000 steps (8 resets) in 904 ms. (44 steps per ms) remains 3/6 properties
FORMULA ShieldIIPt-PT-030A-ReachabilityFireability-2024-15 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPt-PT-030A-ReachabilityFireability-2024-04 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPt-PT-030A-ReachabilityFireability-2024-02 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (8 resets) in 276 ms. (144 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40002 steps (8 resets) in 365 ms. (109 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 272 ms. (146 steps per ms) remains 3/3 properties
// Phase 1: matrix 421 rows 572 cols
[2024-05-28 22:31:36] [INFO ] Computed 271 invariants in 6 ms
[2024-05-28 22:31:36] [INFO ] State equation strengthened by 15 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/120 variables, 120/120 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/120 variables, 0/120 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (OVERLAPS) 112/232 variables, 109/229 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/232 variables, 112/341 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/232 variables, 0/341 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 340/572 variables, 162/503 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/572 variables, 340/843 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/572 variables, 0/843 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 421/993 variables, 572/1415 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/993 variables, 15/1430 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/993 variables, 0/1430 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 0/993 variables, 0/1430 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 993/993 variables, and 1430 constraints, problems are : Problem set: 0 solved, 3 unsolved in 469 ms.
Refiners :[Domain max(s): 572/572 constraints, Positive P Invariants (semi-flows): 271/271 constraints, State Equation: 572/572 constraints, ReadFeed: 15/15 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/120 variables, 120/120 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/120 variables, 0/120 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (OVERLAPS) 112/232 variables, 109/229 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/232 variables, 112/341 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/232 variables, 0/341 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 340/572 variables, 162/503 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/572 variables, 340/843 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/572 variables, 0/843 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 421/993 variables, 572/1415 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/993 variables, 15/1430 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/993 variables, 3/1433 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/993 variables, 0/1433 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (OVERLAPS) 0/993 variables, 0/1433 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 993/993 variables, and 1433 constraints, problems are : Problem set: 0 solved, 3 unsolved in 1188 ms.
Refiners :[Domain max(s): 572/572 constraints, Positive P Invariants (semi-flows): 271/271 constraints, State Equation: 572/572 constraints, ReadFeed: 15/15 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
After SMT, in 1716ms problems are : Problem set: 0 solved, 3 unsolved
Parikh walk visited 0 properties in 4256 ms.
Support contains 120 out of 572 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 572/572 places, 421/421 transitions.
Partial Free-agglomeration rule applied 5 times.
Drop transitions (Partial Free agglomeration) removed 5 transitions
Iterating global reduction 0 with 5 rules applied. Total rules applied 5 place count 572 transition count 421
Applied a total of 5 rules in 45 ms. Remains 572 /572 variables (removed 0) and now considering 421/421 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 45 ms. Remains : 572/572 places, 421/421 transitions.
RANDOM walk for 40000 steps (8 resets) in 435 ms. (91 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 279 ms. (142 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 328 ms. (121 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (8 resets) in 265 ms. (150 steps per ms) remains 3/3 properties
Interrupted probabilistic random walk after 417843 steps, run timeout after 3001 ms. (steps per millisecond=139 ) properties seen :2 out of 3
Probabilistic random walk after 417843 steps, saw 407720 distinct states, run finished after 3004 ms. (steps per millisecond=139 ) properties seen :2
FORMULA ShieldIIPt-PT-030A-ReachabilityFireability-2024-05 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA ShieldIIPt-PT-030A-ReachabilityFireability-2024-00 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
// Phase 1: matrix 421 rows 572 cols
[2024-05-28 22:31:45] [INFO ] Computed 271 invariants in 10 ms
[2024-05-28 22:31:45] [INFO ] State equation strengthened by 17 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/41 variables, 41/41 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/41 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 45/86 variables, 40/81 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/86 variables, 45/126 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/86 variables, 0/126 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 486/572 variables, 231/357 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/572 variables, 486/843 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/572 variables, 0/843 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 421/993 variables, 572/1415 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/993 variables, 17/1432 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/993 variables, 0/1432 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 0/993 variables, 0/1432 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 993/993 variables, and 1432 constraints, problems are : Problem set: 0 solved, 1 unsolved in 290 ms.
Refiners :[Domain max(s): 572/572 constraints, Positive P Invariants (semi-flows): 271/271 constraints, State Equation: 572/572 constraints, ReadFeed: 17/17 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/41 variables, 41/41 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/41 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 45/86 variables, 40/81 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/86 variables, 45/126 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/86 variables, 0/126 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 486/572 variables, 231/357 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/572 variables, 486/843 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/572 variables, 0/843 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 421/993 variables, 572/1415 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/993 variables, 17/1432 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/993 variables, 1/1433 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/993 variables, 0/1433 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 0/993 variables, 0/1433 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 993/993 variables, and 1433 constraints, problems are : Problem set: 0 solved, 1 unsolved in 551 ms.
Refiners :[Domain max(s): 572/572 constraints, Positive P Invariants (semi-flows): 271/271 constraints, State Equation: 572/572 constraints, ReadFeed: 17/17 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 864ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 694 ms.
Support contains 41 out of 572 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 572/572 places, 421/421 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 572 transition count 420
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 571 transition count 420
Partial Free-agglomeration rule applied 12 times.
Drop transitions (Partial Free agglomeration) removed 12 transitions
Iterating global reduction 0 with 12 rules applied. Total rules applied 14 place count 571 transition count 420
Applied a total of 14 rules in 49 ms. Remains 571 /572 variables (removed 1) and now considering 420/421 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 49 ms. Remains : 571/572 places, 420/421 transitions.
RANDOM walk for 40000 steps (8 resets) in 854 ms. (46 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 345 ms. (115 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 411971 steps, run timeout after 3013 ms. (steps per millisecond=136 ) properties seen :0 out of 1
Probabilistic random walk after 411971 steps, saw 398899 distinct states, run finished after 3015 ms. (steps per millisecond=136 ) properties seen :0
// Phase 1: matrix 420 rows 571 cols
[2024-05-28 22:31:50] [INFO ] Computed 271 invariants in 10 ms
[2024-05-28 22:31:50] [INFO ] State equation strengthened by 26 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/41 variables, 41/41 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/41 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 45/86 variables, 40/81 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/86 variables, 45/126 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/86 variables, 0/126 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 485/571 variables, 231/357 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/571 variables, 485/842 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/571 variables, 0/842 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 420/991 variables, 571/1413 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/991 variables, 26/1439 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/991 variables, 0/1439 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 0/991 variables, 0/1439 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 991/991 variables, and 1439 constraints, problems are : Problem set: 0 solved, 1 unsolved in 326 ms.
Refiners :[Domain max(s): 571/571 constraints, Positive P Invariants (semi-flows): 271/271 constraints, State Equation: 571/571 constraints, ReadFeed: 26/26 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/41 variables, 41/41 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/41 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 45/86 variables, 40/81 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/86 variables, 45/126 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/86 variables, 0/126 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 485/571 variables, 231/357 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/571 variables, 485/842 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/571 variables, 0/842 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 420/991 variables, 571/1413 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/991 variables, 26/1439 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/991 variables, 1/1440 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/991 variables, 0/1440 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 0/991 variables, 0/1440 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 991/991 variables, and 1440 constraints, problems are : Problem set: 0 solved, 1 unsolved in 451 ms.
Refiners :[Domain max(s): 571/571 constraints, Positive P Invariants (semi-flows): 271/271 constraints, State Equation: 571/571 constraints, ReadFeed: 26/26 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 810ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 721 ms.
Support contains 41 out of 571 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 571/571 places, 420/420 transitions.
Applied a total of 0 rules in 39 ms. Remains 571 /571 variables (removed 0) and now considering 420/420 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 39 ms. Remains : 571/571 places, 420/420 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 571/571 places, 420/420 transitions.
Applied a total of 0 rules in 20 ms. Remains 571 /571 variables (removed 0) and now considering 420/420 (removed 0) transitions.
[2024-05-28 22:31:52] [INFO ] Invariant cache hit.
[2024-05-28 22:31:52] [INFO ] Implicit Places using invariants in 347 ms returned [563, 564]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 359 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 569/571 places, 420/420 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 569 transition count 419
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 568 transition count 419
Applied a total of 2 rules in 23 ms. Remains 568 /569 variables (removed 1) and now considering 419/420 (removed 1) transitions.
// Phase 1: matrix 419 rows 568 cols
[2024-05-28 22:31:52] [INFO ] Computed 269 invariants in 20 ms
[2024-05-28 22:31:52] [INFO ] Implicit Places using invariants in 316 ms returned [557]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 317 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 567/571 places, 419/420 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 566 transition count 418
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 566 transition count 418
Applied a total of 2 rules in 22 ms. Remains 566 /567 variables (removed 1) and now considering 418/419 (removed 1) transitions.
// Phase 1: matrix 418 rows 566 cols
[2024-05-28 22:31:52] [INFO ] Computed 268 invariants in 2 ms
[2024-05-28 22:31:53] [INFO ] Implicit Places using invariants in 258 ms returned []
[2024-05-28 22:31:53] [INFO ] Invariant cache hit.
[2024-05-28 22:31:53] [INFO ] State equation strengthened by 23 read => feed constraints.
[2024-05-28 22:31:53] [INFO ] Implicit Places using invariants and state equation in 618 ms returned []
Implicit Place search using SMT with State Equation took 883 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 3 : 566/571 places, 418/420 transitions.
Finished structural reductions in REACHABILITY mode , in 3 iterations and 1625 ms. Remains : 566/571 places, 418/420 transitions.
RANDOM walk for 40000 steps (8 resets) in 385 ms. (103 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 270 ms. (147 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 465821 steps, run timeout after 3001 ms. (steps per millisecond=155 ) properties seen :0 out of 1
Probabilistic random walk after 465821 steps, saw 450230 distinct states, run finished after 3001 ms. (steps per millisecond=155 ) properties seen :0
[2024-05-28 22:31:56] [INFO ] Invariant cache hit.
[2024-05-28 22:31:56] [INFO ] State equation strengthened by 23 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/41 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 45/86 variables, 40/40 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/86 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 480/566 variables, 228/268 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/566 variables, 0/268 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 418/984 variables, 566/834 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/984 variables, 23/857 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/984 variables, 0/857 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 0/984 variables, 0/857 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 984/984 variables, and 857 constraints, problems are : Problem set: 0 solved, 1 unsolved in 270 ms.
Refiners :[Positive P Invariants (semi-flows): 268/268 constraints, State Equation: 566/566 constraints, ReadFeed: 23/23 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/41 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 45/86 variables, 40/40 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/86 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 480/566 variables, 228/268 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/566 variables, 0/268 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 418/984 variables, 566/834 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/984 variables, 23/857 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/984 variables, 1/858 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/984 variables, 0/858 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 0/984 variables, 0/858 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 984/984 variables, and 858 constraints, problems are : Problem set: 0 solved, 1 unsolved in 456 ms.
Refiners :[Positive P Invariants (semi-flows): 268/268 constraints, State Equation: 566/566 constraints, ReadFeed: 23/23 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 736ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 668 ms.
Support contains 41 out of 566 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 566/566 places, 418/418 transitions.
Applied a total of 0 rules in 24 ms. Remains 566 /566 variables (removed 0) and now considering 418/418 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 24 ms. Remains : 566/566 places, 418/418 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 566/566 places, 418/418 transitions.
Applied a total of 0 rules in 16 ms. Remains 566 /566 variables (removed 0) and now considering 418/418 (removed 0) transitions.
[2024-05-28 22:31:58] [INFO ] Invariant cache hit.
[2024-05-28 22:31:58] [INFO ] Implicit Places using invariants in 233 ms returned []
[2024-05-28 22:31:58] [INFO ] Invariant cache hit.
[2024-05-28 22:31:58] [INFO ] State equation strengthened by 23 read => feed constraints.
[2024-05-28 22:31:59] [INFO ] Implicit Places using invariants and state equation in 547 ms returned []
Implicit Place search using SMT with State Equation took 790 ms to find 0 implicit places.
[2024-05-28 22:31:59] [INFO ] Redundant transitions in 21 ms returned []
Running 417 sub problems to find dead transitions.
[2024-05-28 22:31:59] [INFO ] Invariant cache hit.
[2024-05-28 22:31:59] [INFO ] State equation strengthened by 23 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/565 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 417 unsolved
At refinement iteration 1 (OVERLAPS) 1/566 variables, 268/268 constraints. Problems are: Problem set: 0 solved, 417 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/566 variables, 0/268 constraints. Problems are: Problem set: 0 solved, 417 unsolved
At refinement iteration 3 (OVERLAPS) 418/984 variables, 566/834 constraints. Problems are: Problem set: 0 solved, 417 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/984 variables, 23/857 constraints. Problems are: Problem set: 0 solved, 417 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/984 variables, 0/857 constraints. Problems are: Problem set: 0 solved, 417 unsolved
At refinement iteration 6 (OVERLAPS) 0/984 variables, 0/857 constraints. Problems are: Problem set: 0 solved, 417 unsolved
No progress, stopping.
After SMT solving in domain Real declared 984/984 variables, and 857 constraints, problems are : Problem set: 0 solved, 417 unsolved in 30034 ms.
Refiners :[Positive P Invariants (semi-flows): 268/268 constraints, State Equation: 566/566 constraints, ReadFeed: 23/23 constraints, PredecessorRefiner: 417/417 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 417 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/565 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 417 unsolved
At refinement iteration 1 (OVERLAPS) 1/566 variables, 268/268 constraints. Problems are: Problem set: 0 solved, 417 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/566 variables, 0/268 constraints. Problems are: Problem set: 0 solved, 417 unsolved
At refinement iteration 3 (OVERLAPS) 418/984 variables, 566/834 constraints. Problems are: Problem set: 0 solved, 417 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/984 variables, 23/857 constraints. Problems are: Problem set: 0 solved, 417 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/984 variables, 417/1274 constraints. Problems are: Problem set: 0 solved, 417 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/984 variables, 0/1274 constraints. Problems are: Problem set: 0 solved, 417 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 984/984 variables, and 1274 constraints, problems are : Problem set: 0 solved, 417 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 268/268 constraints, State Equation: 566/566 constraints, ReadFeed: 23/23 constraints, PredecessorRefiner: 417/417 constraints, Known Traps: 0/0 constraints]
After SMT, in 60171ms problems are : Problem set: 0 solved, 417 unsolved
Search for dead transitions found 0 dead transitions in 60176ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 61012 ms. Remains : 566/566 places, 418/418 transitions.
Attempting over-approximation, by ignoring read arcs.
Partial Free-agglomeration rule applied 22 times.
Drop transitions (Partial Free agglomeration) removed 22 transitions
Iterating global reduction 0 with 22 rules applied. Total rules applied 22 place count 566 transition count 418
Drop transitions (Redundant composition of simpler transitions.) removed 22 transitions
Redundant transition composition rules discarded 22 transitions
Iterating global reduction 0 with 22 rules applied. Total rules applied 44 place count 566 transition count 396
Applied a total of 44 rules in 56 ms. Remains 566 /566 variables (removed 0) and now considering 396/418 (removed 22) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 396 rows 566 cols
[2024-05-28 22:32:59] [INFO ] Computed 268 invariants in 2 ms
[2024-05-28 22:32:59] [INFO ] After 98ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-28 22:32:59] [INFO ] [Nat]Absence check using 268 positive place invariants in 34 ms returned sat
[2024-05-28 22:32:59] [INFO ] After 209ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-05-28 22:32:59] [INFO ] After 314ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-05-28 22:33:00] [INFO ] After 500ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
[2024-05-28 22:33:00] [INFO ] Flatten gal took : 43 ms
[2024-05-28 22:33:00] [INFO ] Flatten gal took : 33 ms
[2024-05-28 22:33:00] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality13062878814859844640.gal : 6 ms
[2024-05-28 22:33:00] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality12891450436674799139.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.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality13062878814859844640.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality12891450436674799139.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.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...330
Loading property file /tmp/ReachabilityCardinality12891450436674799139.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :3 after 6
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :6 after 14
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :14 after 27
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :27 after 53
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :53 after 102
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :102 after 888
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :888 after 18480
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :18480 after 287789
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :287789 after 1.24864e+08
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :1.24864e+08 after 2.78732e+11
SDD proceeding with computation,1 properties remain. new max is 4096
SDD size :2.78732e+11 after 3.68826e+19
SDD proceeding with computation,1 properties remain. new max is 8192
SDD size :3.68826e+19 after 9.70881e+27
SDD proceeding with computation,1 properties remain. new max is 16384
SDD size :9.70881e+27 after 1.04248e+42
SDD proceeding with computation,1 properties remain. new max is 32768
SDD size :1.04248e+42 after 4.58366e+61
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst,3.06499e+83,13.2844,393848,2,1486,20,1.49631e+06,7,0,2717,2.87173e+06,0
Total reachable state count : 3.06499108173177771663441882643455806513e+83

Verifying 1 reachability properties.
Reachability property ShieldIIPt-PT-030A-ReachabilityFireability-2024-11 is true.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
ShieldIIPt-PT-030A-ReachabilityFireability-2024-11,3.78947e+77,13.3229,393848,2,10978,20,1.49631e+06,7,0,2785,2.87173e+06,0
Over-approximation ignoring read arcs solved 0 properties in 14137 ms.
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
[2024-05-28 22:33:13] [INFO ] Flatten gal took : 32 ms
[2024-05-28 22:33:13] [INFO ] Applying decomposition
[2024-05-28 22:33:13] [INFO ] Flatten gal took : 29 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph4748640003417160198.txt' '-o' '/tmp/graph4748640003417160198.bin' '-w' '/tmp/graph4748640003417160198.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph4748640003417160198.bin' '-l' '-1' '-v' '-w' '/tmp/graph4748640003417160198.weights' '-q' '0' '-e' '0.001'
[2024-05-28 22:33:13] [INFO ] Decomposing Gal with order
[2024-05-28 22:33:13] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-28 22:33:13] [INFO ] Removed a total of 90 redundant transitions.
[2024-05-28 22:33:13] [INFO ] Flatten gal took : 72 ms
[2024-05-28 22:33:13] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 22 ms.
[2024-05-28 22:33:13] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality3841167615444923901.gal : 12 ms
[2024-05-28 22:33:13] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality14244003814872139798.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.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality3841167615444923901.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality14244003814872139798.prop' '--nowitness'

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 ...308
Loading property file /tmp/ReachabilityCardinality14244003814872139798.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1281 after 1281
Reachability property ShieldIIPt-PT-030A-ReachabilityFireability-2024-11 is true.
FORMULA ShieldIIPt-PT-030A-ReachabilityFireability-2024-11 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING USE_NUPN
Found states matching all0 target predicate
Will report total states built up to this point. Computation was interrupted after 5 fixpoint passes
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst\_mod\_flat,3.06499e+84,0.358421,16308,144,15,24703,199,630,47715,31,721,0
Total reachable state count : 3.064991081731777716581762680600279471781e+84

Verifying 1 reachability properties.
Reachability property ShieldIIPt-PT-030A-ReachabilityFireability-2024-11 is true.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
ShieldIIPt-PT-030A-ReachabilityFireability-2024-11,5.98631e+78,0.362697,16572,114,18,24703,199,832,47715,42,721,0
All properties solved without resorting to model-checking.
Total runtime 116937 ms.

BK_STOP 1716935594387

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

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ ReachabilityFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution ReachabilityFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ 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 ReachabilityFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="ShieldIIPt-PT-030A"
export BK_EXAMINATION="ReachabilityFireability"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool itstools"
echo " Input is ShieldIIPt-PT-030A, examination is ReachabilityFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r356-tall-171683760800295"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/ShieldIIPt-PT-030A.tgz
mv ShieldIIPt-PT-030A execution
cd execution
if [ "ReachabilityFireability" = "ReachabilityDeadlock" ] || [ "ReachabilityFireability" = "UpperBounds" ] || [ "ReachabilityFireability" = "QuasiLiveness" ] || [ "ReachabilityFireability" = "StableMarking" ] || [ "ReachabilityFireability" = "Liveness" ] || [ "ReachabilityFireability" = "OneSafe" ] || [ "ReachabilityFireability" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "ReachabilityFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "ReachabilityFireability" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "ReachabilityFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property ReachabilityFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "ReachabilityFireability.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' ReachabilityFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "ReachabilityFireability" = "ReachabilityDeadlock" ] || [ "ReachabilityFireability" = "QuasiLiveness" ] || [ "ReachabilityFireability" = "StableMarking" ] || [ "ReachabilityFireability" = "Liveness" ] || [ "ReachabilityFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME ReachabilityFireability"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;