fond
Model Checking Contest 2024
14th edition, Geneva, Switzerland, June 25, 2024
Execution of r444-smll-171701111200286
Last Updated
July 7, 2024

About the Execution of ITS-Tools for Vasy2003-PT-none

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
1239.604 20058.00 58750.00 255.10 TFTFTFFTTFTTTFTF normal

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.r444-smll-171701111200286.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 Vasy2003-PT-none, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r444-smll-171701111200286
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 712K
-rw-r--r-- 1 mcc users 8.0K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 93K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.3K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 63K 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.4K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.7K Apr 23 08:04 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Apr 23 08:04 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Apr 23 08:04 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K Apr 23 08:04 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Apr 12 08:02 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 125K Apr 12 08:02 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.6K Apr 12 07:56 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 87K Apr 12 07:56 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 23 08:04 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Apr 23 08:04 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 207K 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 Vasy2003-PT-none-ReachabilityCardinality-2024-00
FORMULA_NAME Vasy2003-PT-none-ReachabilityCardinality-2024-01
FORMULA_NAME Vasy2003-PT-none-ReachabilityCardinality-2024-02
FORMULA_NAME Vasy2003-PT-none-ReachabilityCardinality-2024-03
FORMULA_NAME Vasy2003-PT-none-ReachabilityCardinality-2024-04
FORMULA_NAME Vasy2003-PT-none-ReachabilityCardinality-2024-05
FORMULA_NAME Vasy2003-PT-none-ReachabilityCardinality-2024-06
FORMULA_NAME Vasy2003-PT-none-ReachabilityCardinality-2024-07
FORMULA_NAME Vasy2003-PT-none-ReachabilityCardinality-2024-08
FORMULA_NAME Vasy2003-PT-none-ReachabilityCardinality-2024-09
FORMULA_NAME Vasy2003-PT-none-ReachabilityCardinality-2024-10
FORMULA_NAME Vasy2003-PT-none-ReachabilityCardinality-2024-11
FORMULA_NAME Vasy2003-PT-none-ReachabilityCardinality-2024-12
FORMULA_NAME Vasy2003-PT-none-ReachabilityCardinality-2024-13
FORMULA_NAME Vasy2003-PT-none-ReachabilityCardinality-2024-14
FORMULA_NAME Vasy2003-PT-none-ReachabilityCardinality-2024-15

=== Now, execution of the tool begins

BK_START 1717139565169

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=ReachabilityCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=Vasy2003-PT-none
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
ReachabilityCardinality PT
Running Version 202405141337
[2024-05-31 07:12:47] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-31 07:12:47] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-31 07:12:48] [INFO ] Load time of PNML (sax parser for PT used): 262 ms
[2024-05-31 07:12:48] [INFO ] Transformed 485 places.
[2024-05-31 07:12:48] [INFO ] Transformed 776 transitions.
[2024-05-31 07:12:48] [INFO ] Found NUPN structural information;
[2024-05-31 07:12:48] [INFO ] Parsed PT model containing 485 places and 776 transitions and 2809 arcs in 509 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 49 ms.
Working with output stream class java.io.PrintStream
Ensure Unique test removed 24 transitions
Reduce redundant transitions removed 24 transitions.
FORMULA Vasy2003-PT-none-ReachabilityCardinality-2024-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Vasy2003-PT-none-ReachabilityCardinality-2024-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Vasy2003-PT-none-ReachabilityCardinality-2024-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Vasy2003-PT-none-ReachabilityCardinality-2024-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Vasy2003-PT-none-ReachabilityCardinality-2024-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Vasy2003-PT-none-ReachabilityCardinality-2024-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 40000 steps (8 resets) in 2663 ms. (15 steps per ms) remains 8/10 properties
FORMULA Vasy2003-PT-none-ReachabilityCardinality-2024-09 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Vasy2003-PT-none-ReachabilityCardinality-2024-04 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40003 steps (8 resets) in 676 ms. (59 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 263 ms. (151 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (8 resets) in 438 ms. (91 steps per ms) remains 8/8 properties
[2024-05-31 07:12:49] [INFO ] Flatten gal took : 460 ms
BEST_FIRST walk for 40004 steps (8 resets) in 566 ms. (70 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 445 ms. (89 steps per ms) remains 8/8 properties
[2024-05-31 07:12:50] [INFO ] Flatten gal took : 273 ms
BEST_FIRST walk for 40003 steps (8 resets) in 527 ms. (75 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 156 ms. (254 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 276 ms. (144 steps per ms) remains 8/8 properties
[2024-05-31 07:12:50] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality3163478259230350715.gal : 132 ms
[2024-05-31 07:12:50] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality14014395549714980686.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/ReachabilityCardinality3163478259230350715.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality14014395549714980686.prop' '--nowitness' '--gen-order' 'FOLLOW'
[2024-05-31 07:12:50] [INFO ] Flow matrix only has 696 transitions (discarded 56 similar events)

// Phase 1: matrix 696 rows 485 cols
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 ...329
[2024-05-31 07:12:50] [INFO ] Computed 66 invariants in 40 ms
[2024-05-31 07:12:50] [INFO ] State equation strengthened by 73 read => feed constraints.
Loading property file /tmp/ReachabilityCardinality14014395549714980686.prop.
SDD proceeding with computation,8 properties remain. new max is 4
SDD size :1 after 11
SDD proceeding with computation,8 properties remain. new max is 8
SDD size :11 after 15
SDD proceeding with computation,8 properties remain. new max is 16
SDD size :15 after 131
SDD proceeding with computation,8 properties remain. new max is 32
SDD size :131 after 197
SDD proceeding with computation,8 properties remain. new max is 64
SDD size :197 after 1161
SDD proceeding with computation,8 properties remain. new max is 128
SDD size :1161 after 5081
All remaining problems are real, not stopping.
SDD proceeding with computation,8 properties remain. new max is 256
At refinement iteration 0 (INCLUDED_ONLY) 0/113 variables, 113/113 constraints. Problems are: Problem set: 0 solved, 8 unsolved
SDD size :5081 after 30075
At refinement iteration 1 (INCLUDED_ONLY) 0/113 variables, 3/116 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/113 variables, 0/116 constraints. Problems are: Problem set: 0 solved, 8 unsolved
SDD proceeding with computation,8 properties remain. new max is 512
SDD size :30075 after 460801
Problem Vasy2003-PT-none-ReachabilityCardinality-2024-05 is UNSAT
FORMULA Vasy2003-PT-none-ReachabilityCardinality-2024-05 FALSE TECHNIQUES SMT_REFINEMENT
Problem Vasy2003-PT-none-ReachabilityCardinality-2024-15 is UNSAT
FORMULA Vasy2003-PT-none-ReachabilityCardinality-2024-15 FALSE TECHNIQUES SMT_REFINEMENT
At refinement iteration 3 (OVERLAPS) 363/476 variables, 56/172 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/476 variables, 363/535 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/476 variables, 3/538 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/476 variables, 0/538 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 9/485 variables, 4/542 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/485 variables, 9/551 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/485 variables, 0/551 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 10 (OVERLAPS) 695/1180 variables, 485/1036 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1180 variables, 72/1108 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1180 variables, 0/1108 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 13 (OVERLAPS) 1/1181 variables, 1/1109 constraints. Problems are: Problem set: 2 solved, 6 unsolved
SDD proceeding with computation,8 properties remain. new max is 1024
SDD size :460801 after 1.35252e+09
At refinement iteration 14 (INCLUDED_ONLY) 0/1181 variables, 0/1109 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 15 (OVERLAPS) 0/1181 variables, 0/1109 constraints. Problems are: Problem set: 2 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1181/1181 variables, and 1109 constraints, problems are : Problem set: 2 solved, 6 unsolved in 2064 ms.
Refiners :[Domain max(s): 485/485 constraints, Positive P Invariants (semi-flows): 59/59 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 485/485 constraints, ReadFeed: 73/73 constraints, PredecessorRefiner: 8/8 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 2 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/82 variables, 82/82 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/82 variables, 1/83 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/82 variables, 0/83 constraints. Problems are: Problem set: 2 solved, 6 unsolved
Problem Vasy2003-PT-none-ReachabilityCardinality-2024-00 is UNSAT
FORMULA Vasy2003-PT-none-ReachabilityCardinality-2024-00 TRUE TECHNIQUES SMT_REFINEMENT
At refinement iteration 3 (OVERLAPS) 394/476 variables, 58/141 constraints. Problems are: Problem set: 3 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/476 variables, 394/535 constraints. Problems are: Problem set: 3 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/476 variables, 3/538 constraints. Problems are: Problem set: 3 solved, 5 unsolved
[2024-05-31 07:12:53] [INFO ] Deduced a trap composed of 124 places in 351 ms of which 78 ms to minimize.
[2024-05-31 07:12:53] [INFO ] Deduced a trap composed of 132 places in 269 ms of which 5 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/476 variables, 2/540 constraints. Problems are: Problem set: 3 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/476 variables, 0/540 constraints. Problems are: Problem set: 3 solved, 5 unsolved
At refinement iteration 8 (OVERLAPS) 9/485 variables, 4/544 constraints. Problems are: Problem set: 3 solved, 5 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/485 variables, 9/553 constraints. Problems are: Problem set: 3 solved, 5 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/485 variables, 0/553 constraints. Problems are: Problem set: 3 solved, 5 unsolved
At refinement iteration 11 (OVERLAPS) 695/1180 variables, 485/1038 constraints. Problems are: Problem set: 3 solved, 5 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1180 variables, 72/1110 constraints. Problems are: Problem set: 3 solved, 5 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1180 variables, 5/1115 constraints. Problems are: Problem set: 3 solved, 5 unsolved
SDD proceeding with computation,8 properties remain. new max is 2048
SDD size :1.35252e+09 after 8.65332e+09
[2024-05-31 07:12:54] [INFO ] Deduced a trap composed of 128 places in 195 ms of which 4 ms to minimize.
[2024-05-31 07:12:55] [INFO ] Deduced a trap composed of 222 places in 224 ms of which 4 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/1180 variables, 2/1117 constraints. Problems are: Problem set: 3 solved, 5 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1180 variables, 0/1117 constraints. Problems are: Problem set: 3 solved, 5 unsolved
At refinement iteration 16 (OVERLAPS) 1/1181 variables, 1/1118 constraints. Problems are: Problem set: 3 solved, 5 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1181 variables, 0/1118 constraints. Problems are: Problem set: 3 solved, 5 unsolved
At refinement iteration 18 (OVERLAPS) 0/1181 variables, 0/1118 constraints. Problems are: Problem set: 3 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1181/1181 variables, and 1118 constraints, problems are : Problem set: 3 solved, 5 unsolved in 4986 ms.
Refiners :[Domain max(s): 485/485 constraints, Positive P Invariants (semi-flows): 59/59 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 485/485 constraints, ReadFeed: 73/73 constraints, PredecessorRefiner: 5/8 constraints, Known Traps: 4/4 constraints]
After SMT, in 7312ms problems are : Problem set: 3 solved, 5 unsolved
FORMULA Vasy2003-PT-none-ReachabilityCardinality-2024-13 FALSE TECHNIQUES PARIKH_WALK
FORMULA Vasy2003-PT-none-ReachabilityCardinality-2024-01 FALSE TECHNIQUES PARIKH_WALK
FORMULA Vasy2003-PT-none-ReachabilityCardinality-2024-10 TRUE TECHNIQUES PARIKH_WALK
Parikh walk visited 3 properties in 1834 ms.
Support contains 45 out of 485 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 485/485 places, 752/752 transitions.
Graph (trivial) has 137 edges and 485 vertex of which 2 / 485 are part of one of the 1 SCC in 4 ms
Free SCC test removed 1 places
Drop transitions (Empty/Sink Transition effects.) removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Graph (complete) has 1557 edges and 484 vertex of which 482 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.4 ms
Discarding 2 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Drop transitions (Empty/Sink Transition effects.) removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 4 rules applied. Total rules applied 6 place count 482 transition count 741
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 7 place count 481 transition count 741
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 9 Pre rules applied. Total rules applied 7 place count 481 transition count 732
Deduced a syphon composed of 9 places in 4 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 2 with 18 rules applied. Total rules applied 25 place count 472 transition count 732
Discarding 129 places :
Symmetric choice reduction at 2 with 129 rule applications. Total rules 154 place count 343 transition count 603
Iterating global reduction 2 with 129 rules applied. Total rules applied 283 place count 343 transition count 603
Ensure Unique test removed 36 transitions
Reduce isomorphic transitions removed 36 transitions.
Iterating post reduction 2 with 36 rules applied. Total rules applied 319 place count 343 transition count 567
Discarding 67 places :
Symmetric choice reduction at 3 with 67 rule applications. Total rules 386 place count 276 transition count 483
Iterating global reduction 3 with 67 rules applied. Total rules applied 453 place count 276 transition count 483
Ensure Unique test removed 46 transitions
Reduce isomorphic transitions removed 46 transitions.
Iterating post reduction 3 with 46 rules applied. Total rules applied 499 place count 276 transition count 437
Discarding 32 places :
Symmetric choice reduction at 4 with 32 rule applications. Total rules 531 place count 244 transition count 384
Iterating global reduction 4 with 32 rules applied. Total rules applied 563 place count 244 transition count 384
Ensure Unique test removed 22 transitions
Reduce isomorphic transitions removed 22 transitions.
Iterating post reduction 4 with 22 rules applied. Total rules applied 585 place count 244 transition count 362
Discarding 8 places :
Symmetric choice reduction at 5 with 8 rule applications. Total rules 593 place count 236 transition count 349
Iterating global reduction 5 with 8 rules applied. Total rules applied 601 place count 236 transition count 349
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 5 with 4 rules applied. Total rules applied 605 place count 236 transition count 345
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Deduced a syphon composed of 10 places in 1 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 6 with 20 rules applied. Total rules applied 625 place count 226 transition count 335
Graph (complete) has 750 edges and 226 vertex of which 202 are kept as prefixes of interest. Removing 24 places using SCC suffix rule.2 ms
Discarding 24 places :
Also discarding 6 output transitions
Drop transitions (Output transitions of discarded places.) removed 6 transitions
Iterating post reduction 6 with 1 rules applied. Total rules applied 626 place count 202 transition count 329
Drop transitions (Empty/Sink Transition effects.) removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 7 with 12 rules applied. Total rules applied 638 place count 202 transition count 317
Discarding 3 places :
Symmetric choice reduction at 8 with 3 rule applications. Total rules 641 place count 199 transition count 313
Iterating global reduction 8 with 3 rules applied. Total rules applied 644 place count 199 transition count 313
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 8 with 2 rules applied. Total rules applied 646 place count 199 transition count 311
Discarding 2 places :
Symmetric choice reduction at 9 with 2 rule applications. Total rules 648 place count 197 transition count 308
Iterating global reduction 9 with 2 rules applied. Total rules applied 650 place count 197 transition count 308
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 9 with 3 rules applied. Total rules applied 653 place count 197 transition count 305
Drop transitions (Redundant composition of simpler transitions.) removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 10 with 8 rules applied. Total rules applied 661 place count 197 transition count 297
Free-agglomeration rule applied 2 times.
Iterating global reduction 10 with 2 rules applied. Total rules applied 663 place count 197 transition count 295
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 10 with 2 rules applied. Total rules applied 665 place count 195 transition count 295
Applied a total of 665 rules in 264 ms. Remains 195 /485 variables (removed 290) and now considering 295/752 (removed 457) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 279 ms. Remains : 195/485 places, 295/752 transitions.
RANDOM walk for 40000 steps (8 resets) in 628 ms. (63 steps per ms) remains 1/2 properties
FORMULA Vasy2003-PT-none-ReachabilityCardinality-2024-11 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (8 resets) in 151 ms. (263 steps per ms) remains 1/1 properties
[2024-05-31 07:12:59] [INFO ] Flow matrix only has 270 transitions (discarded 25 similar events)
// Phase 1: matrix 270 rows 195 cols
[2024-05-31 07:12:59] [INFO ] Computed 53 invariants in 4 ms
[2024-05-31 07:12:59] [INFO ] State equation strengthened by 47 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/18 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 5/23 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/23 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 90/113 variables, 42/45 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/113 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 82/195 variables, 8/53 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/195 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 270/465 variables, 195/248 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/465 variables, 47/295 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/465 variables, 0/295 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 0/465 variables, 0/295 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 465/465 variables, and 295 constraints, problems are : Problem set: 0 solved, 1 unsolved in 303 ms.
Refiners :[Positive P Invariants (semi-flows): 45/45 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 195/195 constraints, ReadFeed: 47/47 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/18 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 5/23 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/23 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 90/113 variables, 42/45 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/113 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 82/195 variables, 8/53 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/195 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 1 unsolved
SDD proceeding with computation,8 properties remain. new max is 4096
At refinement iteration 7 (OVERLAPS) 270/465 variables, 195/248 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/465 variables, 47/295 constraints. Problems are: Problem set: 0 solved, 1 unsolved
SDD size :8.65332e+09 after 2.70462e+10
At refinement iteration 9 (INCLUDED_ONLY) 0/465 variables, 1/296 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/465 variables, 0/296 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 0/465 variables, 0/296 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 465/465 variables, and 296 constraints, problems are : Problem set: 0 solved, 1 unsolved in 308 ms.
Refiners :[Positive P Invariants (semi-flows): 45/45 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 195/195 constraints, ReadFeed: 47/47 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 629ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 33 ms.
Support contains 18 out of 195 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 195/195 places, 295/295 transitions.
Graph (complete) has 659 edges and 195 vertex of which 179 are kept as prefixes of interest. Removing 16 places using SCC suffix rule.2 ms
Discarding 16 places :
Also discarding 4 output transitions
Drop transitions (Output transitions of discarded places.) removed 4 transitions
Drop transitions (Empty/Sink Transition effects.) removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 9 rules applied. Total rules applied 10 place count 179 transition count 282
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 11 place count 178 transition count 282
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 11 place count 178 transition count 281
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 13 place count 177 transition count 281
Discarding 14 places :
Symmetric choice reduction at 2 with 14 rule applications. Total rules 27 place count 163 transition count 263
Ensure Unique test removed 1 places
Iterating global reduction 2 with 15 rules applied. Total rules applied 42 place count 162 transition count 263
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 2 with 7 rules applied. Total rules applied 49 place count 162 transition count 256
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 55 place count 156 transition count 249
Iterating global reduction 3 with 6 rules applied. Total rules applied 61 place count 156 transition count 249
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 64 place count 156 transition count 246
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 67 place count 153 transition count 240
Iterating global reduction 4 with 3 rules applied. Total rules applied 70 place count 153 transition count 240
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 71 place count 153 transition count 239
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 5 with 6 rules applied. Total rules applied 77 place count 150 transition count 236
Discarding 4 places :
Symmetric choice reduction at 5 with 4 rule applications. Total rules 81 place count 146 transition count 230
Iterating global reduction 5 with 4 rules applied. Total rules applied 85 place count 146 transition count 230
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 5 with 5 rules applied. Total rules applied 90 place count 146 transition count 225
Discarding 2 places :
Symmetric choice reduction at 6 with 2 rule applications. Total rules 92 place count 144 transition count 222
Iterating global reduction 6 with 2 rules applied. Total rules applied 94 place count 144 transition count 222
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 6 with 3 rules applied. Total rules applied 97 place count 144 transition count 219
Applied a total of 97 rules in 47 ms. Remains 144 /195 variables (removed 51) and now considering 219/295 (removed 76) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 48 ms. Remains : 144/195 places, 219/295 transitions.
RANDOM walk for 40000 steps (8 resets) in 225 ms. (176 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 111 ms. (357 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1139455 steps, run timeout after 3010 ms. (steps per millisecond=378 ) properties seen :0 out of 1
Probabilistic random walk after 1139455 steps, saw 842138 distinct states, run finished after 3016 ms. (steps per millisecond=377 ) properties seen :0
[2024-05-31 07:13:03] [INFO ] Flow matrix only has 195 transitions (discarded 24 similar events)
// Phase 1: matrix 195 rows 144 cols
[2024-05-31 07:13:03] [INFO ] Computed 44 invariants in 2 ms
[2024-05-31 07:13:03] [INFO ] State equation strengthened by 39 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/18 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 9/27 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/27 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 67/94 variables, 33/37 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/94 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 50/144 variables, 7/44 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/144 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 195/339 variables, 144/188 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/339 variables, 39/227 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/339 variables, 0/227 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 0/339 variables, 0/227 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 339/339 variables, and 227 constraints, problems are : Problem set: 0 solved, 1 unsolved in 211 ms.
Refiners :[Positive P Invariants (semi-flows): 37/37 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 144/144 constraints, ReadFeed: 39/39 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/18 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 9/27 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/27 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 67/94 variables, 33/37 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/94 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 50/144 variables, 7/44 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/144 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 195/339 variables, 144/188 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/339 variables, 39/227 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/339 variables, 1/228 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/339 variables, 0/228 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 0/339 variables, 0/228 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 339/339 variables, and 228 constraints, problems are : Problem set: 0 solved, 1 unsolved in 221 ms.
Refiners :[Positive P Invariants (semi-flows): 37/37 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 144/144 constraints, ReadFeed: 39/39 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 444ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 15 ms.
Support contains 18 out of 144 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 144/144 places, 219/219 transitions.
Applied a total of 0 rules in 7 ms. Remains 144 /144 variables (removed 0) and now considering 219/219 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7 ms. Remains : 144/144 places, 219/219 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 144/144 places, 219/219 transitions.
Applied a total of 0 rules in 6 ms. Remains 144 /144 variables (removed 0) and now considering 219/219 (removed 0) transitions.
[2024-05-31 07:13:04] [INFO ] Flow matrix only has 195 transitions (discarded 24 similar events)
[2024-05-31 07:13:04] [INFO ] Invariant cache hit.
[2024-05-31 07:13:04] [INFO ] Implicit Places using invariants in 174 ms returned [45, 47, 49, 51, 52, 53, 54, 55, 56, 126, 131]
Discarding 11 places :
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Implicit Place search using SMT only with invariants took 183 ms to find 11 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 133/144 places, 215/219 transitions.
Graph (trivial) has 16 edges and 133 vertex of which 4 / 133 are part of one of the 2 SCC in 1 ms
Free SCC test removed 2 places
Drop transitions (Empty/Sink Transition effects.) removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 0 with 6 rules applied. Total rules applied 7 place count 131 transition count 205
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 13 place count 125 transition count 205
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 5 Pre rules applied. Total rules applied 13 place count 125 transition count 200
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 23 place count 120 transition count 200
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 26 place count 117 transition count 197
Iterating global reduction 2 with 3 rules applied. Total rules applied 29 place count 117 transition count 197
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 2 with 4 rules applied. Total rules applied 33 place count 115 transition count 195
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -3
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 37 place count 113 transition count 198
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 39 place count 113 transition count 196
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 3 with 3 rules applied. Total rules applied 42 place count 113 transition count 193
Applied a total of 42 rules in 28 ms. Remains 113 /133 variables (removed 20) and now considering 193/215 (removed 22) transitions.
[2024-05-31 07:13:04] [INFO ] Flow matrix only has 172 transitions (discarded 21 similar events)
// Phase 1: matrix 172 rows 113 cols
[2024-05-31 07:13:04] [INFO ] Computed 30 invariants in 2 ms
[2024-05-31 07:13:04] [INFO ] Implicit Places using invariants in 152 ms returned [31, 36, 37, 38, 39, 40, 100]
Discarding 7 places :
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Implicit Place search using SMT only with invariants took 157 ms to find 7 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 106/144 places, 187/219 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 106 transition count 183
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 8 place count 102 transition count 183
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 9 Pre rules applied. Total rules applied 8 place count 102 transition count 174
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 2 with 18 rules applied. Total rules applied 26 place count 93 transition count 174
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 27 place count 92 transition count 173
Iterating global reduction 2 with 1 rules applied. Total rules applied 28 place count 92 transition count 173
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 32 place count 90 transition count 171
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 2 with 10 rules applied. Total rules applied 42 place count 90 transition count 161
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 43 place count 89 transition count 159
Iterating global reduction 3 with 1 rules applied. Total rules applied 44 place count 89 transition count 159
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 3 with 5 rules applied. Total rules applied 49 place count 89 transition count 154
Drop transitions (Redundant composition of simpler transitions.) removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 4 with 8 rules applied. Total rules applied 57 place count 89 transition count 146
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 59 place count 88 transition count 145
Drop transitions (Empty/Sink Transition effects.) removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Graph (complete) has 279 edges and 88 vertex of which 86 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Discarding 2 places :
Also discarding 0 output transitions
Iterating post reduction 4 with 4 rules applied. Total rules applied 63 place count 86 transition count 142
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 65 place count 86 transition count 140
Free-agglomeration rule applied 2 times.
Iterating global reduction 6 with 2 rules applied. Total rules applied 67 place count 86 transition count 138
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 6 with 2 rules applied. Total rules applied 69 place count 84 transition count 138
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 7 with 1 rules applied. Total rules applied 70 place count 84 transition count 140
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 71 place count 83 transition count 140
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 8 with 2 rules applied. Total rules applied 73 place count 83 transition count 138
Applied a total of 73 rules in 47 ms. Remains 83 /106 variables (removed 23) and now considering 138/187 (removed 49) transitions.
[2024-05-31 07:13:04] [INFO ] Flow matrix only has 124 transitions (discarded 14 similar events)
// Phase 1: matrix 124 rows 83 cols
[2024-05-31 07:13:04] [INFO ] Computed 22 invariants in 1 ms
[2024-05-31 07:13:04] [INFO ] Implicit Places using invariants in 95 ms returned [5, 22, 27, 28]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 96 ms to find 4 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 3 : 79/144 places, 138/219 transitions.
Graph (trivial) has 9 edges and 79 vertex of which 4 / 79 are part of one of the 2 SCC in 0 ms
Free SCC test removed 2 places
Drop transitions (Empty/Sink Transition effects.) removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 1 place count 77 transition count 133
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 3 place count 76 transition count 133
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 4 place count 76 transition count 132
Applied a total of 4 rules in 8 ms. Remains 76 /79 variables (removed 3) and now considering 132/138 (removed 6) transitions.
[2024-05-31 07:13:04] [INFO ] Flow matrix only has 118 transitions (discarded 14 similar events)
// Phase 1: matrix 118 rows 76 cols
[2024-05-31 07:13:04] [INFO ] Computed 18 invariants in 2 ms
[2024-05-31 07:13:04] [INFO ] Implicit Places using invariants in 98 ms returned [7, 17]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 99 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 4 : 74/144 places, 132/219 transitions.
Free-agglomeration rule applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 74 transition count 131
Reduce places removed 1 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 3 place count 73 transition count 130
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 1 with 1 rules applied. Total rules applied 4 place count 73 transition count 130
Applied a total of 4 rules in 17 ms. Remains 73 /74 variables (removed 1) and now considering 130/132 (removed 2) transitions.
[2024-05-31 07:13:04] [INFO ] Flow matrix only has 116 transitions (discarded 14 similar events)
// Phase 1: matrix 116 rows 73 cols
[2024-05-31 07:13:04] [INFO ] Computed 16 invariants in 2 ms
[2024-05-31 07:13:04] [INFO ] Implicit Places using invariants in 82 ms returned []
[2024-05-31 07:13:04] [INFO ] Flow matrix only has 116 transitions (discarded 14 similar events)
[2024-05-31 07:13:04] [INFO ] Invariant cache hit.
[2024-05-31 07:13:05] [INFO ] State equation strengthened by 19 read => feed constraints.
[2024-05-31 07:13:05] [INFO ] Implicit Places using invariants and state equation in 116 ms returned []
Implicit Place search using SMT with State Equation took 201 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 5 : 73/144 places, 130/219 transitions.
Finished structural reductions in REACHABILITY mode , in 5 iterations and 844 ms. Remains : 73/144 places, 130/219 transitions.
RANDOM walk for 14701 steps (3 resets) in 74 ms. (196 steps per ms) remains 0/1 properties
FORMULA Vasy2003-PT-none-ReachabilityCardinality-2024-06 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
All properties solved without resorting to model-checking.
Total runtime 17499 ms.

BK_STOP 1717139585227

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

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ ReachabilityCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution ReachabilityCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination ReachabilityCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

Sequence of Actions to be Executed by the VM

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

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool itstools"
echo " Input is Vasy2003-PT-none, examination is ReachabilityCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r444-smll-171701111200286"
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 [ "ReachabilityCardinality" = "ReachabilityDeadlock" ] || [ "ReachabilityCardinality" = "UpperBounds" ] || [ "ReachabilityCardinality" = "QuasiLiveness" ] || [ "ReachabilityCardinality" = "StableMarking" ] || [ "ReachabilityCardinality" = "Liveness" ] || [ "ReachabilityCardinality" = "OneSafe" ] || [ "ReachabilityCardinality" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

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