Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2023-input.r490-tall-167912709701231.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
...............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool marciexred
Input is Vasy2003-PT-none, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r490-tall-167912709701231
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 692K
-rw-r--r-- 1 mcc users 6.5K Feb 25 14:33 CTLCardinality.txt
-rw-r--r-- 1 mcc users 72K Feb 25 14:33 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.1K Feb 25 14:25 CTLFireability.txt
-rw-r--r-- 1 mcc users 59K Feb 25 14:25 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:41 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.4K Jan 29 11:41 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.3K Feb 25 17:26 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Feb 25 17:26 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Feb 25 17:26 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 17:26 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Feb 25 14:38 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 131K Feb 25 14:38 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 10K Feb 25 14:35 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 90K Feb 25 14:35 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 17:26 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Feb 25 17:26 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 207K Mar 5 18:23 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 Vasy2003-PT-none-ReachabilityFireability-00
FORMULA_NAME Vasy2003-PT-none-ReachabilityFireability-01
FORMULA_NAME Vasy2003-PT-none-ReachabilityFireability-02
FORMULA_NAME Vasy2003-PT-none-ReachabilityFireability-03
FORMULA_NAME Vasy2003-PT-none-ReachabilityFireability-04
FORMULA_NAME Vasy2003-PT-none-ReachabilityFireability-05
FORMULA_NAME Vasy2003-PT-none-ReachabilityFireability-06
FORMULA_NAME Vasy2003-PT-none-ReachabilityFireability-07
FORMULA_NAME Vasy2003-PT-none-ReachabilityFireability-08
FORMULA_NAME Vasy2003-PT-none-ReachabilityFireability-09
FORMULA_NAME Vasy2003-PT-none-ReachabilityFireability-10
FORMULA_NAME Vasy2003-PT-none-ReachabilityFireability-11
FORMULA_NAME Vasy2003-PT-none-ReachabilityFireability-12
FORMULA_NAME Vasy2003-PT-none-ReachabilityFireability-13
FORMULA_NAME Vasy2003-PT-none-ReachabilityFireability-14
FORMULA_NAME Vasy2003-PT-none-ReachabilityFireability-15

=== Now, execution of the tool begins

BK_START 1679400900990

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=marciexred
BK_EXAMINATION=ReachabilityFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=Vasy2003-PT-none
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-21 12:15:02] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -timeout, 360, -rebuildPNML]
[2023-03-21 12:15:02] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-21 12:15:02] [INFO ] Load time of PNML (sax parser for PT used): 70 ms
[2023-03-21 12:15:02] [INFO ] Transformed 485 places.
[2023-03-21 12:15:02] [INFO ] Transformed 776 transitions.
[2023-03-21 12:15:02] [INFO ] Found NUPN structural information;
[2023-03-21 12:15:02] [INFO ] Parsed PT model containing 485 places and 776 transitions and 2809 arcs in 145 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 11 ms.
Working with output stream class java.io.PrintStream
Ensure Unique test removed 24 transitions
Reduce redundant transitions removed 24 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 446 ms. (steps per millisecond=22 ) properties (out of 16) seen :6
FORMULA Vasy2003-PT-none-ReachabilityFireability-13 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Vasy2003-PT-none-ReachabilityFireability-10 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Vasy2003-PT-none-ReachabilityFireability-07 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Vasy2003-PT-none-ReachabilityFireability-05 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Vasy2003-PT-none-ReachabilityFireability-04 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Vasy2003-PT-none-ReachabilityFireability-00 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 10) seen :1
FORMULA Vasy2003-PT-none-ReachabilityFireability-15 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 57 ms. (steps per millisecond=175 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 9) seen :0
Running SMT prover for 9 properties.
[2023-03-21 12:15:03] [INFO ] Flow matrix only has 696 transitions (discarded 56 similar events)
// Phase 1: matrix 696 rows 485 cols
[2023-03-21 12:15:03] [INFO ] Computed 66 place invariants in 37 ms
[2023-03-21 12:15:04] [INFO ] [Real]Absence check using 59 positive place invariants in 13 ms returned sat
[2023-03-21 12:15:04] [INFO ] [Real]Absence check using 59 positive and 7 generalized place invariants in 18 ms returned sat
[2023-03-21 12:15:04] [INFO ] After 392ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:9
[2023-03-21 12:15:04] [INFO ] [Nat]Absence check using 59 positive place invariants in 36 ms returned sat
[2023-03-21 12:15:04] [INFO ] [Nat]Absence check using 59 positive and 7 generalized place invariants in 5 ms returned sat
[2023-03-21 12:15:05] [INFO ] After 982ms SMT Verify possible using state equation in natural domain returned unsat :2 sat :7
[2023-03-21 12:15:05] [INFO ] State equation strengthened by 73 read => feed constraints.
[2023-03-21 12:15:06] [INFO ] After 1153ms SMT Verify possible using 73 Read/Feed constraints in natural domain returned unsat :2 sat :7
[2023-03-21 12:15:06] [INFO ] Deduced a trap composed of 127 places in 226 ms of which 6 ms to minimize.
[2023-03-21 12:15:07] [INFO ] Deduced a trap composed of 124 places in 205 ms of which 1 ms to minimize.
[2023-03-21 12:15:07] [INFO ] Deduced a trap composed of 131 places in 130 ms of which 2 ms to minimize.
[2023-03-21 12:15:07] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 693 ms
[2023-03-21 12:15:09] [INFO ] After 3480ms SMT Verify possible using trap constraints in natural domain returned unsat :2 sat :7
Attempting to minimize the solution found.
Minimization took 1232 ms.
[2023-03-21 12:15:10] [INFO ] After 6241ms SMT Verify possible using all constraints in natural domain returned unsat :2 sat :7
FORMULA Vasy2003-PT-none-ReachabilityFireability-11 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA Vasy2003-PT-none-ReachabilityFireability-03 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 9 Parikh solutions to 7 different solutions.
Parikh walk visited 0 properties in 27 ms.
Support contains 86 out of 485 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 485/485 places, 752/752 transitions.
Graph (complete) has 1559 edges and 485 vertex of which 483 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.3 ms
Discarding 2 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Drop transitions removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 0 with 7 rules applied. Total rules applied 8 place count 483 transition count 744
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 9 Pre rules applied. Total rules applied 8 place count 483 transition count 735
Deduced a syphon composed of 9 places in 3 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 1 with 18 rules applied. Total rules applied 26 place count 474 transition count 735
Discarding 131 places :
Symmetric choice reduction at 1 with 131 rule applications. Total rules 157 place count 343 transition count 604
Ensure Unique test removed 1 places
Iterating global reduction 1 with 132 rules applied. Total rules applied 289 place count 342 transition count 604
Ensure Unique test removed 37 transitions
Reduce isomorphic transitions removed 37 transitions.
Iterating post reduction 1 with 37 rules applied. Total rules applied 326 place count 342 transition count 567
Discarding 60 places :
Symmetric choice reduction at 2 with 60 rule applications. Total rules 386 place count 282 transition count 495
Iterating global reduction 2 with 60 rules applied. Total rules applied 446 place count 282 transition count 495
Ensure Unique test removed 44 transitions
Reduce isomorphic transitions removed 44 transitions.
Iterating post reduction 2 with 44 rules applied. Total rules applied 490 place count 282 transition count 451
Discarding 19 places :
Symmetric choice reduction at 3 with 19 rule applications. Total rules 509 place count 263 transition count 421
Iterating global reduction 3 with 19 rules applied. Total rules applied 528 place count 263 transition count 421
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 3 with 10 rules applied. Total rules applied 538 place count 263 transition count 411
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 541 place count 260 transition count 406
Iterating global reduction 4 with 3 rules applied. Total rules applied 544 place count 260 transition count 406
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 545 place count 260 transition count 405
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 5 with 12 rules applied. Total rules applied 557 place count 254 transition count 399
Graph (complete) has 866 edges and 254 vertex of which 242 are kept as prefixes of interest. Removing 12 places using SCC suffix rule.1 ms
Discarding 12 places :
Also discarding 3 output transitions
Drop transitions removed 3 transitions
Iterating post reduction 5 with 1 rules applied. Total rules applied 558 place count 242 transition count 396
Drop transitions removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 6 with 6 rules applied. Total rules applied 564 place count 242 transition count 390
Discarding 3 places :
Symmetric choice reduction at 7 with 3 rule applications. Total rules 567 place count 239 transition count 386
Iterating global reduction 7 with 3 rules applied. Total rules applied 570 place count 239 transition count 386
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 7 with 2 rules applied. Total rules applied 572 place count 239 transition count 384
Discarding 2 places :
Symmetric choice reduction at 8 with 2 rule applications. Total rules 574 place count 237 transition count 381
Iterating global reduction 8 with 2 rules applied. Total rules applied 576 place count 237 transition count 381
Drop transitions removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 8 with 8 rules applied. Total rules applied 584 place count 237 transition count 373
Applied a total of 584 rules in 139 ms. Remains 237 /485 variables (removed 248) and now considering 373/752 (removed 379) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 140 ms. Remains : 237/485 places, 373/752 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 195 ms. (steps per millisecond=51 ) properties (out of 7) seen :1
FORMULA Vasy2003-PT-none-ReachabilityFireability-01 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 6) seen :0
Running SMT prover for 6 properties.
[2023-03-21 12:15:10] [INFO ] Flow matrix only has 342 transitions (discarded 31 similar events)
// Phase 1: matrix 342 rows 237 cols
[2023-03-21 12:15:10] [INFO ] Computed 58 place invariants in 4 ms
[2023-03-21 12:15:11] [INFO ] [Real]Absence check using 52 positive place invariants in 8 ms returned sat
[2023-03-21 12:15:11] [INFO ] [Real]Absence check using 52 positive and 6 generalized place invariants in 5 ms returned sat
[2023-03-21 12:15:11] [INFO ] After 183ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2023-03-21 12:15:11] [INFO ] [Nat]Absence check using 52 positive place invariants in 59 ms returned sat
[2023-03-21 12:15:11] [INFO ] [Nat]Absence check using 52 positive and 6 generalized place invariants in 4 ms returned sat
[2023-03-21 12:15:11] [INFO ] After 405ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2023-03-21 12:15:11] [INFO ] State equation strengthened by 49 read => feed constraints.
[2023-03-21 12:15:11] [INFO ] After 368ms SMT Verify possible using 49 Read/Feed constraints in natural domain returned unsat :0 sat :6
[2023-03-21 12:15:12] [INFO ] After 733ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :6
Attempting to minimize the solution found.
Minimization took 364 ms.
[2023-03-21 12:15:12] [INFO ] After 1690ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :6
Parikh walk visited 0 properties in 32 ms.
Support contains 85 out of 237 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 237/237 places, 373/373 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 236 transition count 372
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 236 transition count 372
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 235 transition count 370
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 235 transition count 370
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 5 place count 235 transition count 369
Applied a total of 5 rules in 18 ms. Remains 235 /237 variables (removed 2) and now considering 369/373 (removed 4) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 18 ms. Remains : 235/237 places, 369/373 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 174 ms. (steps per millisecond=57 ) properties (out of 6) seen :1
FORMULA Vasy2003-PT-none-ReachabilityFireability-08 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 5) seen :0
Running SMT prover for 5 properties.
[2023-03-21 12:15:13] [INFO ] Flow matrix only has 338 transitions (discarded 31 similar events)
// Phase 1: matrix 338 rows 235 cols
[2023-03-21 12:15:13] [INFO ] Computed 58 place invariants in 3 ms
[2023-03-21 12:15:13] [INFO ] [Real]Absence check using 52 positive place invariants in 8 ms returned sat
[2023-03-21 12:15:13] [INFO ] [Real]Absence check using 52 positive and 6 generalized place invariants in 4 ms returned sat
[2023-03-21 12:15:13] [INFO ] After 78ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2023-03-21 12:15:13] [INFO ] [Nat]Absence check using 52 positive place invariants in 8 ms returned sat
[2023-03-21 12:15:13] [INFO ] [Nat]Absence check using 52 positive and 6 generalized place invariants in 4 ms returned sat
[2023-03-21 12:15:13] [INFO ] After 335ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2023-03-21 12:15:13] [INFO ] State equation strengthened by 49 read => feed constraints.
[2023-03-21 12:15:13] [INFO ] After 257ms SMT Verify possible using 49 Read/Feed constraints in natural domain returned unsat :0 sat :5
[2023-03-21 12:15:14] [INFO ] After 584ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
Attempting to minimize the solution found.
Minimization took 264 ms.
[2023-03-21 12:15:14] [INFO ] After 1284ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
Parikh walk visited 0 properties in 50 ms.
Support contains 78 out of 235 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 235/235 places, 369/369 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 230 transition count 362
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 230 transition count 362
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 12 place count 230 transition count 360
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 15 place count 227 transition count 355
Iterating global reduction 1 with 3 rules applied. Total rules applied 18 place count 227 transition count 355
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 20 place count 227 transition count 353
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 21 place count 226 transition count 352
Iterating global reduction 2 with 1 rules applied. Total rules applied 22 place count 226 transition count 352
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 2 with 2 rules applied. Total rules applied 24 place count 225 transition count 351
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 25 place count 224 transition count 350
Iterating global reduction 2 with 1 rules applied. Total rules applied 26 place count 224 transition count 350
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 27 place count 223 transition count 349
Iterating global reduction 2 with 1 rules applied. Total rules applied 28 place count 223 transition count 349
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 32 place count 223 transition count 345
Applied a total of 32 rules in 36 ms. Remains 223 /235 variables (removed 12) and now considering 345/369 (removed 24) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 36 ms. Remains : 223/235 places, 345/369 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 235 ms. (steps per millisecond=42 ) properties (out of 5) seen :1
FORMULA Vasy2003-PT-none-ReachabilityFireability-02 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 4) seen :0
Running SMT prover for 4 properties.
[2023-03-21 12:15:14] [INFO ] Flow matrix only has 315 transitions (discarded 30 similar events)
// Phase 1: matrix 315 rows 223 cols
[2023-03-21 12:15:14] [INFO ] Computed 58 place invariants in 3 ms
[2023-03-21 12:15:15] [INFO ] After 72ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-21 12:15:15] [INFO ] [Nat]Absence check using 52 positive place invariants in 6 ms returned sat
[2023-03-21 12:15:15] [INFO ] [Nat]Absence check using 52 positive and 6 generalized place invariants in 12 ms returned sat
[2023-03-21 12:15:15] [INFO ] After 306ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-21 12:15:15] [INFO ] State equation strengthened by 48 read => feed constraints.
[2023-03-21 12:15:15] [INFO ] After 230ms SMT Verify possible using 48 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2023-03-21 12:15:15] [INFO ] After 501ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 297 ms.
[2023-03-21 12:15:16] [INFO ] After 1214ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Parikh walk visited 0 properties in 39 ms.
Support contains 77 out of 223 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 223/223 places, 345/345 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 222 transition count 343
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 222 transition count 343
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 3 place count 222 transition count 342
Applied a total of 3 rules in 11 ms. Remains 222 /223 variables (removed 1) and now considering 342/345 (removed 3) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 11 ms. Remains : 222/223 places, 342/345 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 205 ms. (steps per millisecond=48 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 375863 steps, run timeout after 3001 ms. (steps per millisecond=125 ) properties seen :{}
Probabilistic random walk after 375863 steps, saw 307177 distinct states, run finished after 3002 ms. (steps per millisecond=125 ) properties seen :0
Running SMT prover for 4 properties.
[2023-03-21 12:15:19] [INFO ] Flow matrix only has 313 transitions (discarded 29 similar events)
// Phase 1: matrix 313 rows 222 cols
[2023-03-21 12:15:19] [INFO ] Computed 58 place invariants in 6 ms
[2023-03-21 12:15:19] [INFO ] After 127ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-21 12:15:19] [INFO ] [Nat]Absence check using 51 positive place invariants in 6 ms returned sat
[2023-03-21 12:15:19] [INFO ] [Nat]Absence check using 51 positive and 7 generalized place invariants in 12 ms returned sat
[2023-03-21 12:15:20] [INFO ] After 289ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-21 12:15:20] [INFO ] State equation strengthened by 47 read => feed constraints.
[2023-03-21 12:15:20] [INFO ] After 292ms SMT Verify possible using 47 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2023-03-21 12:15:20] [INFO ] Deduced a trap composed of 53 places in 49 ms of which 1 ms to minimize.
[2023-03-21 12:15:20] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 82 ms
[2023-03-21 12:15:20] [INFO ] After 668ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 249 ms.
[2023-03-21 12:15:21] [INFO ] After 1353ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Parikh walk visited 0 properties in 41 ms.
Support contains 77 out of 222 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 222/222 places, 342/342 transitions.
Applied a total of 0 rules in 7 ms. Remains 222 /222 variables (removed 0) and now considering 342/342 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7 ms. Remains : 222/222 places, 342/342 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 222/222 places, 342/342 transitions.
Applied a total of 0 rules in 7 ms. Remains 222 /222 variables (removed 0) and now considering 342/342 (removed 0) transitions.
[2023-03-21 12:15:21] [INFO ] Flow matrix only has 313 transitions (discarded 29 similar events)
[2023-03-21 12:15:21] [INFO ] Invariant cache hit.
[2023-03-21 12:15:21] [INFO ] Implicit Places using invariants in 113 ms returned [76, 81, 83, 85, 86, 88]
Discarding 6 places :
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Implicit Place search using SMT only with invariants took 127 ms to find 6 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 216/222 places, 340/342 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 216 transition count 338
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 214 transition count 338
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 4 place count 214 transition count 335
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 10 place count 211 transition count 335
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 12 place count 209 transition count 333
Iterating global reduction 2 with 2 rules applied. Total rules applied 14 place count 209 transition count 333
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 16 place count 208 transition count 334
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 17 place count 208 transition count 333
Drop transitions removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 3 with 3 rules applied. Total rules applied 20 place count 208 transition count 330
Applied a total of 20 rules in 42 ms. Remains 208 /216 variables (removed 8) and now considering 330/340 (removed 10) transitions.
[2023-03-21 12:15:21] [INFO ] Flow matrix only has 305 transitions (discarded 25 similar events)
// Phase 1: matrix 305 rows 208 cols
[2023-03-21 12:15:21] [INFO ] Computed 50 place invariants in 4 ms
[2023-03-21 12:15:21] [INFO ] Implicit Places using invariants in 225 ms returned [49, 74]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 229 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 206/222 places, 330/342 transitions.
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 6 Pre rules applied. Total rules applied 0 place count 206 transition count 324
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 0 with 12 rules applied. Total rules applied 12 place count 200 transition count 324
Drop transitions removed 5 transitions
Redundant transition composition rules discarded 5 transitions
Iterating global reduction 0 with 5 rules applied. Total rules applied 17 place count 200 transition count 319
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 200 transition count 319
Applied a total of 18 rules in 23 ms. Remains 200 /206 variables (removed 6) and now considering 319/330 (removed 11) transitions.
[2023-03-21 12:15:21] [INFO ] Flow matrix only has 299 transitions (discarded 20 similar events)
// Phase 1: matrix 299 rows 200 cols
[2023-03-21 12:15:21] [INFO ] Computed 48 place invariants in 4 ms
[2023-03-21 12:15:21] [INFO ] Implicit Places using invariants in 134 ms returned [61, 62, 63, 64]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 137 ms to find 4 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 3 : 196/222 places, 319/342 transitions.
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 4 Pre rules applied. Total rules applied 0 place count 196 transition count 315
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 0 with 8 rules applied. Total rules applied 8 place count 192 transition count 315
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 11 place count 189 transition count 312
Iterating global reduction 0 with 3 rules applied. Total rules applied 14 place count 189 transition count 312
Applied a total of 14 rules in 27 ms. Remains 189 /196 variables (removed 7) and now considering 312/319 (removed 7) transitions.
[2023-03-21 12:15:21] [INFO ] Flow matrix only has 292 transitions (discarded 20 similar events)
// Phase 1: matrix 292 rows 189 cols
[2023-03-21 12:15:21] [INFO ] Computed 41 place invariants in 2 ms
[2023-03-21 12:15:21] [INFO ] Implicit Places using invariants in 71 ms returned [11]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 73 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 4 : 188/222 places, 312/342 transitions.
Applied a total of 0 rules in 18 ms. Remains 188 /188 variables (removed 0) and now considering 312/312 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 5 iterations and 693 ms. Remains : 188/222 places, 312/342 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 110 ms. (steps per millisecond=90 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 498625 steps, run timeout after 3001 ms. (steps per millisecond=166 ) properties seen :{1=1}
Probabilistic random walk after 498625 steps, saw 377043 distinct states, run finished after 3001 ms. (steps per millisecond=166 ) properties seen :1
FORMULA Vasy2003-PT-none-ReachabilityFireability-09 FALSE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
Running SMT prover for 3 properties.
[2023-03-21 12:15:25] [INFO ] Flow matrix only has 292 transitions (discarded 20 similar events)
// Phase 1: matrix 292 rows 188 cols
[2023-03-21 12:15:25] [INFO ] Computed 40 place invariants in 2 ms
[2023-03-21 12:15:25] [INFO ] After 181ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-21 12:15:25] [INFO ] [Nat]Absence check using 36 positive place invariants in 10 ms returned sat
[2023-03-21 12:15:25] [INFO ] [Nat]Absence check using 36 positive and 4 generalized place invariants in 5 ms returned sat
[2023-03-21 12:15:25] [INFO ] After 184ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-21 12:15:25] [INFO ] State equation strengthened by 35 read => feed constraints.
[2023-03-21 12:15:25] [INFO ] After 118ms SMT Verify possible using 35 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-03-21 12:15:25] [INFO ] After 250ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 114 ms.
[2023-03-21 12:15:25] [INFO ] After 614ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 1 ms.
Support contains 40 out of 188 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 188/188 places, 312/312 transitions.
Graph (trivial) has 17 edges and 188 vertex of which 4 / 188 are part of one of the 2 SCC in 4 ms
Free SCC test removed 2 places
Drop transitions removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Graph (complete) has 642 edges and 186 vertex of which 182 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.0 ms
Discarding 4 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 0 with 3 rules applied. Total rules applied 5 place count 182 transition count 304
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 6 place count 181 transition count 304
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 6 place count 181 transition count 302
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 10 place count 179 transition count 302
Discarding 16 places :
Symmetric choice reduction at 2 with 16 rule applications. Total rules 26 place count 163 transition count 278
Iterating global reduction 2 with 16 rules applied. Total rules applied 42 place count 163 transition count 278
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 2 with 9 rules applied. Total rules applied 51 place count 163 transition count 269
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 57 place count 157 transition count 261
Iterating global reduction 3 with 6 rules applied. Total rules applied 63 place count 157 transition count 261
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 3 with 6 rules applied. Total rules applied 69 place count 157 transition count 255
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 4 with 8 rules applied. Total rules applied 77 place count 153 transition count 251
Graph (complete) has 525 edges and 153 vertex of which 137 are kept as prefixes of interest. Removing 16 places using SCC suffix rule.0 ms
Discarding 16 places :
Also discarding 4 output transitions
Drop transitions removed 4 transitions
Iterating post reduction 4 with 1 rules applied. Total rules applied 78 place count 137 transition count 247
Drop transitions removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 5 with 8 rules applied. Total rules applied 86 place count 137 transition count 239
Discarding 3 places :
Symmetric choice reduction at 6 with 3 rule applications. Total rules 89 place count 134 transition count 235
Iterating global reduction 6 with 3 rules applied. Total rules applied 92 place count 134 transition count 235
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 6 with 3 rules applied. Total rules applied 95 place count 134 transition count 232
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 97 place count 132 transition count 229
Iterating global reduction 7 with 2 rules applied. Total rules applied 99 place count 132 transition count 229
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 7 with 3 rules applied. Total rules applied 102 place count 132 transition count 226
Drop transitions removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 8 with 4 rules applied. Total rules applied 106 place count 132 transition count 222
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 8 with 2 Pre rules applied. Total rules applied 106 place count 132 transition count 220
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 8 with 4 rules applied. Total rules applied 110 place count 130 transition count 220
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 8 with 2 rules applied. Total rules applied 112 place count 130 transition count 218
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 8 with 2 rules applied. Total rules applied 114 place count 128 transition count 218
Applied a total of 114 rules in 30 ms. Remains 128 /188 variables (removed 60) and now considering 218/312 (removed 94) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 31 ms. Remains : 128/188 places, 218/312 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 130 ms. (steps per millisecond=76 ) properties (out of 3) seen :1
FORMULA Vasy2003-PT-none-ReachabilityFireability-14 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2023-03-21 12:15:26] [INFO ] Flow matrix only has 202 transitions (discarded 16 similar events)
// Phase 1: matrix 202 rows 128 cols
[2023-03-21 12:15:26] [INFO ] Computed 30 place invariants in 1 ms
[2023-03-21 12:15:26] [INFO ] After 43ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-21 12:15:26] [INFO ] [Nat]Absence check using 26 positive place invariants in 3 ms returned sat
[2023-03-21 12:15:26] [INFO ] [Nat]Absence check using 26 positive and 4 generalized place invariants in 4 ms returned sat
[2023-03-21 12:15:26] [INFO ] After 107ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-21 12:15:26] [INFO ] State equation strengthened by 29 read => feed constraints.
[2023-03-21 12:15:26] [INFO ] After 79ms SMT Verify possible using 29 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-21 12:15:26] [INFO ] After 186ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 92 ms.
[2023-03-21 12:15:26] [INFO ] After 456ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 0 ms.
Support contains 39 out of 128 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 128/128 places, 218/218 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 127 transition count 217
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 127 transition count 217
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 4 place count 127 transition count 215
Applied a total of 4 rules in 13 ms. Remains 127 /128 variables (removed 1) and now considering 215/218 (removed 3) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 15 ms. Remains : 127/128 places, 215/218 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 62 ms. (steps per millisecond=161 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 1168609 steps, run timeout after 3001 ms. (steps per millisecond=389 ) properties seen :{1=1}
Probabilistic random walk after 1168609 steps, saw 693851 distinct states, run finished after 3002 ms. (steps per millisecond=389 ) properties seen :1
FORMULA Vasy2003-PT-none-ReachabilityFireability-12 FALSE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
Running SMT prover for 1 properties.
[2023-03-21 12:15:29] [INFO ] Flow matrix only has 199 transitions (discarded 16 similar events)
// Phase 1: matrix 199 rows 127 cols
[2023-03-21 12:15:29] [INFO ] Computed 30 place invariants in 2 ms
[2023-03-21 12:15:29] [INFO ] After 48ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-21 12:15:29] [INFO ] [Nat]Absence check using 25 positive place invariants in 53 ms returned sat
[2023-03-21 12:15:29] [INFO ] [Nat]Absence check using 25 positive and 5 generalized place invariants in 3 ms returned sat
[2023-03-21 12:15:30] [INFO ] After 96ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-21 12:15:30] [INFO ] State equation strengthened by 29 read => feed constraints.
[2023-03-21 12:15:30] [INFO ] After 24ms SMT Verify possible using 29 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-21 12:15:30] [INFO ] After 54ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 24 ms.
[2023-03-21 12:15:30] [INFO ] After 357ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 0 ms.
Support contains 10 out of 127 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 127/127 places, 215/215 transitions.
Graph (trivial) has 12 edges and 127 vertex of which 2 / 127 are part of one of the 1 SCC in 0 ms
Free SCC test removed 1 places
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Graph (complete) has 445 edges and 126 vertex of which 117 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.0 ms
Discarding 9 places :
Also discarding 12 output transitions
Drop transitions removed 12 transitions
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 3 place count 117 transition count 200
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 4 place count 116 transition count 200
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 15 place count 105 transition count 185
Iterating global reduction 2 with 11 rules applied. Total rules applied 26 place count 105 transition count 185
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 2 with 8 rules applied. Total rules applied 34 place count 105 transition count 177
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 35 place count 104 transition count 177
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 39 place count 100 transition count 169
Iterating global reduction 4 with 4 rules applied. Total rules applied 43 place count 100 transition count 169
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 4 with 5 rules applied. Total rules applied 48 place count 100 transition count 164
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 49 place count 99 transition count 158
Iterating global reduction 5 with 1 rules applied. Total rules applied 50 place count 99 transition count 158
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 51 place count 99 transition count 157
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 6 with 4 rules applied. Total rules applied 55 place count 97 transition count 155
Discarding 4 places :
Symmetric choice reduction at 6 with 4 rule applications. Total rules 59 place count 93 transition count 149
Iterating global reduction 6 with 4 rules applied. Total rules applied 63 place count 93 transition count 149
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 6 with 3 rules applied. Total rules applied 66 place count 93 transition count 146
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 68 place count 91 transition count 143
Iterating global reduction 7 with 2 rules applied. Total rules applied 70 place count 91 transition count 143
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 7 with 3 rules applied. Total rules applied 73 place count 91 transition count 140
Free-agglomeration rule applied 2 times.
Iterating global reduction 8 with 2 rules applied. Total rules applied 75 place count 91 transition count 138
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 8 with 2 rules applied. Total rules applied 77 place count 89 transition count 138
Applied a total of 77 rules in 22 ms. Remains 89 /127 variables (removed 38) and now considering 138/215 (removed 77) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 23 ms. Remains : 89/127 places, 138/215 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 1) seen :0
Finished probabilistic random walk after 1425979 steps, run visited all 1 properties in 2062 ms. (steps per millisecond=691 )
Probabilistic random walk after 1425979 steps, saw 631251 distinct states, run finished after 2062 ms. (steps per millisecond=691 ) properties seen :1
FORMULA Vasy2003-PT-none-ReachabilityFireability-06 FALSE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
All properties solved without resorting to model-checking.
Total runtime 29873 ms.
timeout --kill-after=10s --signal=SIGINT 1m for testing only

Marcie built on Linux at 2019-11-18.
A model checker for Generalized Stochastic Petri nets

authors: Alex Tovchigrechko (IDD package and CTL model checking)

Martin Schwarick (Symbolic numerical analysis and CSL model checking)

Christian Rohr (Simulative and approximative numerical model checking)

marcie@informatik.tu-cottbus.de

called as: /home/mcc/BenchKit/bin//../reducer/bin//../../marcie/bin/marcie --net-file=model.pnml --mcc-file=ReachabilityFireability.xml --memory=6 --mcc-mode

parse successfull
net created successfully

Net: Vasy2003_PT_none
(NrP: 485 NrTr: 776 NrArc: 2809)

parse formulas
formulas created successfully
place and transition orderings generation:0m 0.025sec

net check time: 0m 0.000sec

init dd package: 0m 2.721sec


RS generation: 0m15.359sec


-> reachability set: #nodes 4065 (4.1e+03) #states 9,794,739,147,610,899,087,361 (21)



starting MCC model checker
--------------------------

checking: EF [IS_FIREABLE [t449]]
normalized: E [true U IS_FIREABLE [t449]]

-> the formula is TRUE

FORMULA Vasy2003-PT-none-ReachabilityFireability-01 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 6.584sec

checking: EF [IS_FIREABLE [t98]]
normalized: E [true U IS_FIREABLE [t98]]

-> the formula is TRUE

FORMULA Vasy2003-PT-none-ReachabilityFireability-02 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 3.613sec

checking: EF [IS_FIREABLE [t385]]
normalized: E [true U IS_FIREABLE [t385]]

-> the formula is TRUE

FORMULA Vasy2003-PT-none-ReachabilityFireability-14 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 4.723sec

checking: AG [[~ [IS_FIREABLE [t314]] | IS_FIREABLE [t343]]]
normalized: ~ [E [true U ~ [[~ [IS_FIREABLE [t314]] | IS_FIREABLE [t343]]]]]

-> the formula is FALSE

FORMULA Vasy2003-PT-none-ReachabilityFireability-04 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 1.625sec

checking: AG [~ [[IS_FIREABLE [t245] & ~ [[[[IS_FIREABLE [t304] & [~ [IS_FIREABLE [t362]] | ~ [IS_FIREABLE [t627]]]] & IS_FIREABLE [t249]] | IS_FIREABLE [t101]]]]]]
normalized: ~ [E [true U [~ [[[[[~ [IS_FIREABLE [t362]] | ~ [IS_FIREABLE [t627]]] & IS_FIREABLE [t304]] & IS_FIREABLE [t249]] | IS_FIREABLE [t101]]] & IS_FIREABLE [t245]]]]

-> the formula is FALSE

FORMULA Vasy2003-PT-none-ReachabilityFireability-06 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 4.281sec

checking: AG [~ [[IS_FIREABLE [t153] & ~ [[[IS_FIREABLE [t626] & [~ [[[IS_FIREABLE [t461] & IS_FIREABLE [t545]] & IS_FIREABLE [t512]]] | [~ [[IS_FIREABLE [t207] | IS_FIREABLE [t324]]] & [[IS_FIREABLE [t147] | IS_FIREABLE [t322]] | IS_FIREABLE [t664]]]]] & IS_FIREABLE [t241]]]]]]
normalized: ~ [E [true U [~ [[[[[[[IS_FIREABLE [t147] | IS_FIREABLE [t322]] | IS_FIREABLE [t664]] & ~ [[IS_FIREABLE [t207] | IS_FIREABLE [t324]]]] | ~ [[[IS_FIREABLE [t461] & IS_FIREABLE [t545]] & IS_FIREABLE [t512]]]] & IS_FIREABLE [t626]] & IS_FIREABLE [t241]]] & IS_FIREABLE [t153]]]]

-> the formula is FALSE

FORMULA Vasy2003-PT-none-ReachabilityFireability-08 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 2.079sec

checking: EF [[[[[[IS_FIREABLE [t617] | [IS_FIREABLE [t502] & [~ [IS_FIREABLE [t16]] & ~ [[IS_FIREABLE [t530] | IS_FIREABLE [t392]]]]]] & IS_FIREABLE [t319]] & [IS_FIREABLE [t131] & ~ [[[IS_FIREABLE [t747] & IS_FIREABLE [t330]] | ~ [IS_FIREABLE [t187]]]]]] | IS_FIREABLE [t116]] | IS_FIREABLE [t596]]]
normalized: E [true U [[[[~ [[~ [IS_FIREABLE [t187]] | [IS_FIREABLE [t747] & IS_FIREABLE [t330]]]] & IS_FIREABLE [t131]] & [[[[~ [[IS_FIREABLE [t530] | IS_FIREABLE [t392]]] & ~ [IS_FIREABLE [t16]]] & IS_FIREABLE [t502]] | IS_FIREABLE [t617]] & IS_FIREABLE [t319]]] | IS_FIREABLE [t116]] | IS_FIREABLE [t596]]]

-> the formula is TRUE

FORMULA Vasy2003-PT-none-ReachabilityFireability-10 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 3.876sec

checking: AG [[~ [[IS_FIREABLE [t348] & IS_FIREABLE [t683]]] | [IS_FIREABLE [t325] & [IS_FIREABLE [t80] | [IS_FIREABLE [t542] | [[IS_FIREABLE [t194] & [IS_FIREABLE [t364] & IS_FIREABLE [t594]]] | [[[IS_FIREABLE [t708] & [IS_FIREABLE [t543] & IS_FIREABLE [t210]]] | [~ [IS_FIREABLE [t677]] | ~ [IS_FIREABLE [t460]]]] | [~ [[IS_FIREABLE [t351] | IS_FIREABLE [t243]]] & IS_FIREABLE [t438]]]]]]]]]
normalized: ~ [E [true U ~ [[[[[[[[~ [[IS_FIREABLE [t351] | IS_FIREABLE [t243]]] & IS_FIREABLE [t438]] | [[~ [IS_FIREABLE [t460]] | ~ [IS_FIREABLE [t677]]] | [[IS_FIREABLE [t543] & IS_FIREABLE [t210]] & IS_FIREABLE [t708]]]] | [[IS_FIREABLE [t364] & IS_FIREABLE [t594]] & IS_FIREABLE [t194]]] | IS_FIREABLE [t542]] | IS_FIREABLE [t80]] & IS_FIREABLE [t325]] | ~ [[IS_FIREABLE [t348] & IS_FIREABLE [t683]]]]]]]

-> the formula is TRUE

FORMULA Vasy2003-PT-none-ReachabilityFireability-03 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.009sec

checking: EF [[[IS_FIREABLE [t554] & [IS_FIREABLE [t48] | IS_FIREABLE [t641]]] | ~ [[IS_FIREABLE [t438] | [[[[~ [[IS_FIREABLE [t104] | IS_FIREABLE [t732]]] | IS_FIREABLE [t720]] | [[[IS_FIREABLE [t518] & IS_FIREABLE [t532]] & [IS_FIREABLE [t90] | IS_FIREABLE [t570]]] & [~ [IS_FIREABLE [t345]] | ~ [IS_FIREABLE [t473]]]]] | IS_FIREABLE [t523]] & [~ [IS_FIREABLE [t136]] | ~ [[[[IS_FIREABLE [t549] | IS_FIREABLE [t698]] | [IS_FIREABLE [t295] & IS_FIREABLE [t414]]] & [IS_FIREABLE [t84] | [IS_FIREABLE [t423] & IS_FIREABLE [t312]]]]]]]]]]]
normalized: E [true U [~ [[[[~ [[[[IS_FIREABLE [t423] & IS_FIREABLE [t312]] | IS_FIREABLE [t84]] & [[IS_FIREABLE [t295] & IS_FIREABLE [t414]] | [IS_FIREABLE [t549] | IS_FIREABLE [t698]]]]] | ~ [IS_FIREABLE [t136]]] & [[[[~ [IS_FIREABLE [t473]] | ~ [IS_FIREABLE [t345]]] & [[IS_FIREABLE [t90] | IS_FIREABLE [t570]] & [IS_FIREABLE [t518] & IS_FIREABLE [t532]]]] | [~ [[IS_FIREABLE [t104] | IS_FIREABLE [t732]]] | IS_FIREABLE [t720]]] | IS_FIREABLE [t523]]] | IS_FIREABLE [t438]]] | [[IS_FIREABLE [t48] | IS_FIREABLE [t641]] & IS_FIREABLE [t554]]]]

-> the formula is TRUE

FORMULA Vasy2003-PT-none-ReachabilityFireability-13 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 1.155sec

checking: AG [~ [[[[[~ [[IS_FIREABLE [t511] | IS_FIREABLE [t387]]] | ~ [[IS_FIREABLE [t655] | IS_FIREABLE [t133]]]] | ~ [[IS_FIREABLE [t664] | [~ [IS_FIREABLE [t737]] & [IS_FIREABLE [t179] & IS_FIREABLE [t375]]]]]] & [[[[~ [IS_FIREABLE [t581]] | ~ [IS_FIREABLE [t745]]] | IS_FIREABLE [t725]] & [IS_FIREABLE [t102] & ~ [IS_FIREABLE [t652]]]] & [~ [[IS_FIREABLE [t291] | IS_FIREABLE [t26]]] | IS_FIREABLE [t511]]]] & [[~ [[IS_FIREABLE [t614] | ~ [IS_FIREABLE [t63]]]] | ~ [[[IS_FIREABLE [t6] & IS_FIREABLE [t672]] & [IS_FIREABLE [t275] | IS_FIREABLE [t643]]]]] & ~ [[IS_FIREABLE [t726] & IS_FIREABLE [t257]]]]]]]
normalized: ~ [E [true U [[~ [[IS_FIREABLE [t726] & IS_FIREABLE [t257]]] & [~ [[[IS_FIREABLE [t275] | IS_FIREABLE [t643]] & [IS_FIREABLE [t6] & IS_FIREABLE [t672]]]] | ~ [[~ [IS_FIREABLE [t63]] | IS_FIREABLE [t614]]]]] & [[[~ [[IS_FIREABLE [t291] | IS_FIREABLE [t26]]] | IS_FIREABLE [t511]] & [[~ [IS_FIREABLE [t652]] & IS_FIREABLE [t102]] & [[~ [IS_FIREABLE [t745]] | ~ [IS_FIREABLE [t581]]] | IS_FIREABLE [t725]]]] & [~ [[[[IS_FIREABLE [t179] & IS_FIREABLE [t375]] & ~ [IS_FIREABLE [t737]]] | IS_FIREABLE [t664]]] | [~ [[IS_FIREABLE [t655] | IS_FIREABLE [t133]]] | ~ [[IS_FIREABLE [t511] | IS_FIREABLE [t387]]]]]]]]]

-> the formula is FALSE

FORMULA Vasy2003-PT-none-ReachabilityFireability-05 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 2.160sec

checking: AG [[~ [[~ [[~ [IS_FIREABLE [t152]] & [[IS_FIREABLE [t467] | [~ [IS_FIREABLE [t227]] | IS_FIREABLE [t163]]] | IS_FIREABLE [t113]]]] & ~ [IS_FIREABLE [t112]]]] | [~ [[~ [[[IS_FIREABLE [t365] & IS_FIREABLE [t206]] & [IS_FIREABLE [t512] & [[IS_FIREABLE [t454] & IS_FIREABLE [t423]] | [IS_FIREABLE [t53] & IS_FIREABLE [t113]]]]]] & [[~ [IS_FIREABLE [t469]] | ~ [IS_FIREABLE [t116]]] | [[[[IS_FIREABLE [t570] | IS_FIREABLE [t773]] | IS_FIREABLE [t673]] & IS_FIREABLE [t569]] | [[[IS_FIREABLE [t261] & IS_FIREABLE [t530]] | ~ [IS_FIREABLE [t272]]] & ~ [[IS_FIREABLE [t13] & IS_FIREABLE [t83]]]]]]]] | [IS_FIREABLE [t463] | [IS_FIREABLE [t420] | ~ [[IS_FIREABLE [t71] & ~ [IS_FIREABLE [t375]]]]]]]]]
normalized: ~ [E [true U ~ [[[[[~ [[~ [IS_FIREABLE [t375]] & IS_FIREABLE [t71]]] | IS_FIREABLE [t420]] | IS_FIREABLE [t463]] | ~ [[[[[~ [[IS_FIREABLE [t13] & IS_FIREABLE [t83]]] & [~ [IS_FIREABLE [t272]] | [IS_FIREABLE [t261] & IS_FIREABLE [t530]]]] | [[[IS_FIREABLE [t570] | IS_FIREABLE [t773]] | IS_FIREABLE [t673]] & IS_FIREABLE [t569]]] | [~ [IS_FIREABLE [t116]] | ~ [IS_FIREABLE [t469]]]] & ~ [[[[[IS_FIREABLE [t53] & IS_FIREABLE [t113]] | [IS_FIREABLE [t454] & IS_FIREABLE [t423]]] & IS_FIREABLE [t512]] & [IS_FIREABLE [t365] & IS_FIREABLE [t206]]]]]]] | ~ [[~ [IS_FIREABLE [t112]] & ~ [[[[[~ [IS_FIREABLE [t227]] | IS_FIREABLE [t163]] | IS_FIREABLE [t467]] | IS_FIREABLE [t113]] & ~ [IS_FIREABLE [t152]]]]]]]]]]

-> the formula is FALSE

FORMULA Vasy2003-PT-none-ReachabilityFireability-12 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 2.528sec

checking: AG [[[~ [IS_FIREABLE [t260]] & ~ [[~ [[[[IS_FIREABLE [t397] & IS_FIREABLE [t409]] & [IS_FIREABLE [t559] | IS_FIREABLE [t624]]] | [~ [IS_FIREABLE [t265]] & [IS_FIREABLE [t459] & IS_FIREABLE [t561]]]]] & ~ [IS_FIREABLE [t738]]]]] | [[[[~ [IS_FIREABLE [t35]] & [[~ [IS_FIREABLE [t632]] | IS_FIREABLE [t254]] & ~ [IS_FIREABLE [t75]]]] | [[[[[IS_FIREABLE [t654] & IS_FIREABLE [t738]] | [IS_FIREABLE [t747] & IS_FIREABLE [t483]]] & IS_FIREABLE [t29]] & [[~ [IS_FIREABLE [t170]] | IS_FIREABLE [t660]] | IS_FIREABLE [t386]]] & ~ [[~ [IS_FIREABLE [t274]] & IS_FIREABLE [t395]]]]] & [[~ [IS_FIREABLE [t457]] | IS_FIREABLE [t723]] & ~ [[IS_FIREABLE [t436] | IS_FIREABLE [t288]]]]] | ~ [[IS_FIREABLE [t519] | [~ [IS_FIREABLE [t762]] & IS_FIREABLE [t151]]]]]]]
normalized: ~ [E [true U ~ [[[~ [[[~ [IS_FIREABLE [t762]] & IS_FIREABLE [t151]] | IS_FIREABLE [t519]]] | [[~ [[IS_FIREABLE [t436] | IS_FIREABLE [t288]]] & [~ [IS_FIREABLE [t457]] | IS_FIREABLE [t723]]] & [[~ [[~ [IS_FIREABLE [t274]] & IS_FIREABLE [t395]]] & [[[~ [IS_FIREABLE [t170]] | IS_FIREABLE [t660]] | IS_FIREABLE [t386]] & [[[IS_FIREABLE [t747] & IS_FIREABLE [t483]] | [IS_FIREABLE [t654] & IS_FIREABLE [t738]]] & IS_FIREABLE [t29]]]] | [[~ [IS_FIREABLE [t75]] & [~ [IS_FIREABLE [t632]] | IS_FIREABLE [t254]]] & ~ [IS_FIREABLE [t35]]]]]] | [~ [[~ [IS_FIREABLE [t738]] & ~ [[[[IS_FIREABLE [t459] & IS_FIREABLE [t561]] & ~ [IS_FIREABLE [t265]]] | [[IS_FIREABLE [t559] | IS_FIREABLE [t624]] & [IS_FIREABLE [t397] & IS_FIREABLE [t409]]]]]]] & ~ [IS_FIREABLE [t260]]]]]]]

-> the formula is FALSE

FORMULA Vasy2003-PT-none-ReachabilityFireability-00 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 2.513sec

checking: EF [[[IS_FIREABLE [t533] & ~ [[[~ [IS_FIREABLE [t217]] | ~ [[IS_FIREABLE [t568] & IS_FIREABLE [t532]]]] & IS_FIREABLE [t498]]]] | [[~ [[IS_FIREABLE [t699] | ~ [IS_FIREABLE [t628]]]] & [[IS_FIREABLE [t493] | IS_FIREABLE [t59]] & IS_FIREABLE [t26]]] & ~ [[~ [[[[IS_FIREABLE [t375] | IS_FIREABLE [t757]] & IS_FIREABLE [t735]] & [[[IS_FIREABLE [t194] | IS_FIREABLE [t361]] | ~ [IS_FIREABLE [t105]]] | [IS_FIREABLE [t615] | [IS_FIREABLE [t507] | IS_FIREABLE [t48]]]]]] | [[[~ [IS_FIREABLE [t483]] & [IS_FIREABLE [t436] & ~ [IS_FIREABLE [t761]]]] | [~ [[IS_FIREABLE [t130] & IS_FIREABLE [t167]]] | IS_FIREABLE [t68]]] | [IS_FIREABLE [t685] & [~ [IS_FIREABLE [t304]] | [~ [IS_FIREABLE [t511]] & [IS_FIREABLE [t121] | IS_FIREABLE [t566]]]]]]]]]]]
normalized: E [true U [[~ [[[[[[[IS_FIREABLE [t121] | IS_FIREABLE [t566]] & ~ [IS_FIREABLE [t511]]] | ~ [IS_FIREABLE [t304]]] & IS_FIREABLE [t685]] | [[~ [[IS_FIREABLE [t130] & IS_FIREABLE [t167]]] | IS_FIREABLE [t68]] | [[~ [IS_FIREABLE [t761]] & IS_FIREABLE [t436]] & ~ [IS_FIREABLE [t483]]]]] | ~ [[[[[IS_FIREABLE [t507] | IS_FIREABLE [t48]] | IS_FIREABLE [t615]] | [~ [IS_FIREABLE [t105]] | [IS_FIREABLE [t194] | IS_FIREABLE [t361]]]] & [[IS_FIREABLE [t375] | IS_FIREABLE [t757]] & IS_FIREABLE [t735]]]]]] & [[[IS_FIREABLE [t493] | IS_FIREABLE [t59]] & IS_FIREABLE [t26]] & ~ [[~ [IS_FIREABLE [t628]] | IS_FIREABLE [t699]]]]] | [~ [[[~ [[IS_FIREABLE [t568] & IS_FIREABLE [t532]]] | ~ [IS_FIREABLE [t217]]] & IS_FIREABLE [t498]]] & IS_FIREABLE [t533]]]]

-> the formula is TRUE

FORMULA Vasy2003-PT-none-ReachabilityFireability-07 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.470sec

checking: AG [[[[[IS_FIREABLE [t207] | [[IS_FIREABLE [t554] & IS_FIREABLE [t589]] & [[[[IS_FIREABLE [t680] & IS_FIREABLE [t336]] & IS_FIREABLE [t232]] & IS_FIREABLE [t422]] | ~ [[IS_FIREABLE [t715] | IS_FIREABLE [t564]]]]]] & [~ [[[[IS_FIREABLE [t556] & [IS_FIREABLE [t136] & IS_FIREABLE [t594]]] & IS_FIREABLE [t202]] | [[[IS_FIREABLE [t283] | IS_FIREABLE [t635]] & [IS_FIREABLE [t588] & IS_FIREABLE [t532]]] & ~ [[IS_FIREABLE [t67] & IS_FIREABLE [t452]]]]]] | [~ [[[[IS_FIREABLE [t740] | IS_FIREABLE [t519]] | IS_FIREABLE [t641]] | [~ [IS_FIREABLE [t427]] | [IS_FIREABLE [t641] & IS_FIREABLE [t723]]]]] | [~ [[[IS_FIREABLE [t564] & IS_FIREABLE [t540]] | [IS_FIREABLE [t296] | IS_FIREABLE [t43]]]] | IS_FIREABLE [t580]]]]] & IS_FIREABLE [t24]] | [~ [[IS_FIREABLE [t558] | [IS_FIREABLE [t458] & IS_FIREABLE [t320]]]] & [IS_FIREABLE [t616] | ~ [IS_FIREABLE [t649]]]]]]
normalized: ~ [E [true U ~ [[[[~ [IS_FIREABLE [t649]] | IS_FIREABLE [t616]] & ~ [[[IS_FIREABLE [t458] & IS_FIREABLE [t320]] | IS_FIREABLE [t558]]]] | [[[[[~ [[[IS_FIREABLE [t296] | IS_FIREABLE [t43]] | [IS_FIREABLE [t564] & IS_FIREABLE [t540]]]] | IS_FIREABLE [t580]] | ~ [[[[IS_FIREABLE [t641] & IS_FIREABLE [t723]] | ~ [IS_FIREABLE [t427]]] | [[IS_FIREABLE [t740] | IS_FIREABLE [t519]] | IS_FIREABLE [t641]]]]] | ~ [[[~ [[IS_FIREABLE [t67] & IS_FIREABLE [t452]]] & [[IS_FIREABLE [t588] & IS_FIREABLE [t532]] & [IS_FIREABLE [t283] | IS_FIREABLE [t635]]]] | [[[IS_FIREABLE [t136] & IS_FIREABLE [t594]] & IS_FIREABLE [t556]] & IS_FIREABLE [t202]]]]] & [[[~ [[IS_FIREABLE [t715] | IS_FIREABLE [t564]]] | [[[IS_FIREABLE [t680] & IS_FIREABLE [t336]] & IS_FIREABLE [t232]] & IS_FIREABLE [t422]]] & [IS_FIREABLE [t554] & IS_FIREABLE [t589]]] | IS_FIREABLE [t207]]] & IS_FIREABLE [t24]]]]]]

-> the formula is FALSE

FORMULA Vasy2003-PT-none-ReachabilityFireability-15 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 2.270sec

checking: EF [[[[[IS_FIREABLE [t401] | [[[IS_FIREABLE [t417] & ~ [[IS_FIREABLE [t549] & IS_FIREABLE [t628]]]] & [[IS_FIREABLE [t327] & [IS_FIREABLE [t496] | IS_FIREABLE [t514]]] & ~ [[IS_FIREABLE [t699] | IS_FIREABLE [t142]]]]] & IS_FIREABLE [t398]]] & [~ [[[IS_FIREABLE [t655] | IS_FIREABLE [t563]] & [IS_FIREABLE [t465] | IS_FIREABLE [t588]]]] & IS_FIREABLE [t624]]] & [[~ [[~ [[[IS_FIREABLE [t408] | IS_FIREABLE [t285]] & IS_FIREABLE [t253]]] & ~ [[IS_FIREABLE [t581] | IS_FIREABLE [t749]]]]] & ~ [[[[IS_FIREABLE [t721] & [IS_FIREABLE [t308] & IS_FIREABLE [t6]]] & [[IS_FIREABLE [t5] | IS_FIREABLE [t9]] | [IS_FIREABLE [t550] | IS_FIREABLE [t462]]]] | [[~ [IS_FIREABLE [t664]] & ~ [IS_FIREABLE [t122]]] | IS_FIREABLE [t571]]]]] & [~ [[[[[IS_FIREABLE [t74] & IS_FIREABLE [t666]] & ~ [IS_FIREABLE [t325]]] & IS_FIREABLE [t279]] | ~ [[~ [IS_FIREABLE [t238]] & [IS_FIREABLE [t622] & IS_FIREABLE [t647]]]]]] | IS_FIREABLE [t680]]]] & IS_FIREABLE [t290]]]
normalized: E [true U [[[[~ [[~ [[[IS_FIREABLE [t622] & IS_FIREABLE [t647]] & ~ [IS_FIREABLE [t238]]]] | [[~ [IS_FIREABLE [t325]] & [IS_FIREABLE [t74] & IS_FIREABLE [t666]]] & IS_FIREABLE [t279]]]] | IS_FIREABLE [t680]] & [~ [[[[~ [IS_FIREABLE [t122]] & ~ [IS_FIREABLE [t664]]] | IS_FIREABLE [t571]] | [[[IS_FIREABLE [t550] | IS_FIREABLE [t462]] | [IS_FIREABLE [t5] | IS_FIREABLE [t9]]] & [[IS_FIREABLE [t308] & IS_FIREABLE [t6]] & IS_FIREABLE [t721]]]]] & ~ [[~ [[IS_FIREABLE [t581] | IS_FIREABLE [t749]]] & ~ [[[IS_FIREABLE [t408] | IS_FIREABLE [t285]] & IS_FIREABLE [t253]]]]]]] & [[~ [[[IS_FIREABLE [t465] | IS_FIREABLE [t588]] & [IS_FIREABLE [t655] | IS_FIREABLE [t563]]]] & IS_FIREABLE [t624]] & [[[[~ [[IS_FIREABLE [t699] | IS_FIREABLE [t142]]] & [[IS_FIREABLE [t496] | IS_FIREABLE [t514]] & IS_FIREABLE [t327]]] & [~ [[IS_FIREABLE [t549] & IS_FIREABLE [t628]]] & IS_FIREABLE [t417]]] & IS_FIREABLE [t398]] | IS_FIREABLE [t401]]]] & IS_FIREABLE [t290]]]

-> the formula is FALSE

FORMULA Vasy2003-PT-none-ReachabilityFireability-11 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.017sec

checking: AG [[[~ [[[[~ [IS_FIREABLE [t469]] | [IS_FIREABLE [t371] | IS_FIREABLE [t365]]] & [[~ [IS_FIREABLE [t86]] & [IS_FIREABLE [t114] & [IS_FIREABLE [t206] | IS_FIREABLE [t423]]]] & [~ [IS_FIREABLE [t179]] & IS_FIREABLE [t257]]]] & ~ [[[[[IS_FIREABLE [t331] & IS_FIREABLE [t108]] & IS_FIREABLE [t612]] | ~ [[IS_FIREABLE [t603] | IS_FIREABLE [t563]]]] | [[IS_FIREABLE [t447] | IS_FIREABLE [t157]] & IS_FIREABLE [t653]]]]]] & [~ [IS_FIREABLE [t297]] | ~ [[[[IS_FIREABLE [t45] & [[IS_FIREABLE [t601] & IS_FIREABLE [t43]] | [IS_FIREABLE [t50] & IS_FIREABLE [t558]]]] | [[IS_FIREABLE [t486] & [IS_FIREABLE [t553] | IS_FIREABLE [t383]]] | IS_FIREABLE [t79]]] | [[~ [IS_FIREABLE [t127]] | [~ [IS_FIREABLE [t176]] & ~ [IS_FIREABLE [t263]]]] & [IS_FIREABLE [t742] | IS_FIREABLE [t496]]]]]]] & [[[IS_FIREABLE [t94] | ~ [[IS_FIREABLE [t744] & [[IS_FIREABLE [t769] & ~ [IS_FIREABLE [t452]]] | ~ [[IS_FIREABLE [t378] & IS_FIREABLE [t563]]]]]]] | [~ [IS_FIREABLE [t295]] & [IS_FIREABLE [t469] | [IS_FIREABLE [t523] | ~ [IS_FIREABLE [t573]]]]]] | ~ [IS_FIREABLE [t432]]]]]
normalized: ~ [E [true U ~ [[[~ [IS_FIREABLE [t432]] | [[[[~ [IS_FIREABLE [t573]] | IS_FIREABLE [t523]] | IS_FIREABLE [t469]] & ~ [IS_FIREABLE [t295]]] | [~ [[[~ [[IS_FIREABLE [t378] & IS_FIREABLE [t563]]] | [~ [IS_FIREABLE [t452]] & IS_FIREABLE [t769]]] & IS_FIREABLE [t744]]] | IS_FIREABLE [t94]]]] & [[~ [[[[IS_FIREABLE [t742] | IS_FIREABLE [t496]] & [[~ [IS_FIREABLE [t263]] & ~ [IS_FIREABLE [t176]]] | ~ [IS_FIREABLE [t127]]]] | [[[[IS_FIREABLE [t553] | IS_FIREABLE [t383]] & IS_FIREABLE [t486]] | IS_FIREABLE [t79]] | [[[IS_FIREABLE [t50] & IS_FIREABLE [t558]] | [IS_FIREABLE [t601] & IS_FIREABLE [t43]]] & IS_FIREABLE [t45]]]]] | ~ [IS_FIREABLE [t297]]] & ~ [[~ [[[[IS_FIREABLE [t447] | IS_FIREABLE [t157]] & IS_FIREABLE [t653]] | [~ [[IS_FIREABLE [t603] | IS_FIREABLE [t563]]] | [[IS_FIREABLE [t331] & IS_FIREABLE [t108]] & IS_FIREABLE [t612]]]]] & [[[~ [IS_FIREABLE [t179]] & IS_FIREABLE [t257]] & [[[IS_FIREABLE [t206] | IS_FIREABLE [t423]] & IS_FIREABLE [t114]] & ~ [IS_FIREABLE [t86]]]] & [[IS_FIREABLE [t371] | IS_FIREABLE [t365]] | ~ [IS_FIREABLE [t469]]]]]]]]]]]

-> the formula is FALSE

FORMULA Vasy2003-PT-none-ReachabilityFireability-09 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 1.760sec

totally nodes used: 8905228 (8.9e+06)
number of garbage collections: 0
fire ops cache: hits/miss/sum: 41330029 252112780 293442809
used/not used/entry size/cache size: 65671281 1437583 16 1024MB
basic ops cache: hits/miss/sum: 2129584 7433563 9563147
used/not used/entry size/cache size: 9127354 7649862 12 192MB
unary ops cache: hits/miss/sum: 0 0 0
used/not used/entry size/cache size: 0 16777216 8 128MB
abstract ops cache: hits/miss/sum: 0 0 0
used/not used/entry size/cache size: 0 16777216 12 192MB
state nr cache: hits/miss/sum: 1068 4065 5133
used/not used/entry size/cache size: 4063 8384545 32 256MB
max state cache: hits/miss/sum: 0 0 0
used/not used/entry size/cache size: 0 8388608 32 256MB
uniqueHash elements/entry size/size: 67108864 4 256MB
0 60379155
1 5047760
2 1280447
3 324028
4 65069
5 10505
6 1622
7 268
8 9
9 1
>= 10 0

Total processing time: 0m59.920sec


BK_STOP 1679400993202

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

+ 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//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination ReachabilityFireability -timeout 360 -rebuildPNML
check for maximal unmarked siphon
ok
check for constant places
ok
check if there are places and transitions
ok
check if there are transitions without pre-places
ok
check if at least one transition is enabled in m0
ok
check if there are transitions that can never fire
ok


initing FirstDep: 0m 0.003sec

3835 3730 5117 4620
iterations count:459254 (591), effective:6720 (8)

initing FirstDep: 0m 0.002sec

4060
iterations count:142002 (182), effective:1496 (1)
4060
iterations count:142485 (183), effective:1498 (1)
4183
iterations count:142085 (183), effective:1508 (1)
4172
iterations count:128963 (166), effective:1263 (1)
4061
iterations count:141864 (182), effective:1496 (1)
4060
iterations count:142130 (183), effective:1508 (1)
4397
iterations count:128900 (166), effective:1262 (1)

iterations count:5512 (7), effective:120 (0)
4183
iterations count:142682 (183), effective:1499 (1)
4117
iterations count:173751 (223), effective:2122 (2)
4060
iterations count:142083 (183), effective:1528 (1)

iterations count:3984 (5), effective:55 (0)
4060
iterations count:142578 (183), effective:1507 (1)
4060
iterations count:142087 (183), effective:1506 (1)

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="Vasy2003-PT-none"
export BK_EXAMINATION="ReachabilityFireability"
export BK_TOOL="marciexred"
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-5348"
echo " Executing tool marciexred"
echo " Input is Vasy2003-PT-none, 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 r490-tall-167912709701231"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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