About the Execution of ITS-Tools for BridgeAndVehicles-PT-V50P50N20
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 9057.531 | 3600000.00 | 13278177.00 | 826.10 | FTFT?FT?FFFFTTTT | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fkordon/mcc2022-input.r024-tall-165251918300262.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2022-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
....................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itstools
Input is BridgeAndVehicles-PT-V50P50N20, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r024-tall-165251918300262
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 7.7M
-rw-r--r-- 1 mcc users 16K Apr 29 23:50 CTLCardinality.txt
-rw-r--r-- 1 mcc users 101K Apr 29 23:50 CTLCardinality.xml
-rw-r--r-- 1 mcc users 127K Apr 29 23:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 503K Apr 29 23:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:33 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.4K May 10 09:33 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 5.9K May 9 07:08 LTLCardinality.txt
-rw-r--r-- 1 mcc users 30K May 9 07:08 LTLCardinality.xml
-rw-r--r-- 1 mcc users 173K May 9 07:08 LTLFireability.txt
-rw-r--r-- 1 mcc users 509K May 9 07:08 LTLFireability.xml
-rw-r--r-- 1 mcc users 39K Apr 30 00:20 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 207K Apr 30 00:20 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 852K Apr 30 00:16 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 3.2M Apr 30 00:16 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 3.3K May 9 07:08 UpperBounds.txt
-rw-r--r-- 1 mcc users 7.2K May 9 07:08 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 10 09:33 equiv_col
-rw-r--r-- 1 mcc users 10 May 10 09:33 instance
-rw-r--r-- 1 mcc users 6 May 10 09:33 iscolored
-rw-r--r-- 1 mcc users 2.0M May 10 09:33 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 BridgeAndVehicles-PT-V50P50N20-ReachabilityCardinality-00
FORMULA_NAME BridgeAndVehicles-PT-V50P50N20-ReachabilityCardinality-01
FORMULA_NAME BridgeAndVehicles-PT-V50P50N20-ReachabilityCardinality-02
FORMULA_NAME BridgeAndVehicles-PT-V50P50N20-ReachabilityCardinality-03
FORMULA_NAME BridgeAndVehicles-PT-V50P50N20-ReachabilityCardinality-04
FORMULA_NAME BridgeAndVehicles-PT-V50P50N20-ReachabilityCardinality-05
FORMULA_NAME BridgeAndVehicles-PT-V50P50N20-ReachabilityCardinality-06
FORMULA_NAME BridgeAndVehicles-PT-V50P50N20-ReachabilityCardinality-07
FORMULA_NAME BridgeAndVehicles-PT-V50P50N20-ReachabilityCardinality-08
FORMULA_NAME BridgeAndVehicles-PT-V50P50N20-ReachabilityCardinality-09
FORMULA_NAME BridgeAndVehicles-PT-V50P50N20-ReachabilityCardinality-10
FORMULA_NAME BridgeAndVehicles-PT-V50P50N20-ReachabilityCardinality-11
FORMULA_NAME BridgeAndVehicles-PT-V50P50N20-ReachabilityCardinality-12
FORMULA_NAME BridgeAndVehicles-PT-V50P50N20-ReachabilityCardinality-13
FORMULA_NAME BridgeAndVehicles-PT-V50P50N20-ReachabilityCardinality-14
FORMULA_NAME BridgeAndVehicles-PT-V50P50N20-ReachabilityCardinality-15
=== Now, execution of the tool begins
BK_START 1654195254686
Running Version 202205111006
[2022-06-02 18:40:56] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2022-06-02 18:40:56] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-06-02 18:40:56] [INFO ] Load time of PNML (sax parser for PT used): 224 ms
[2022-06-02 18:40:56] [INFO ] Transformed 138 places.
[2022-06-02 18:40:56] [INFO ] Transformed 2348 transitions.
[2022-06-02 18:40:56] [INFO ] Parsed PT model containing 138 places and 2348 transitions in 361 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 24 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 10000 steps, including 23 resets, run finished after 677 ms. (steps per millisecond=14 ) properties (out of 16) seen :4
FORMULA BridgeAndVehicles-PT-V50P50N20-ReachabilityCardinality-11 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BridgeAndVehicles-PT-V50P50N20-ReachabilityCardinality-08 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BridgeAndVehicles-PT-V50P50N20-ReachabilityCardinality-05 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BridgeAndVehicles-PT-V50P50N20-ReachabilityCardinality-00 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 9 resets, run finished after 155 ms. (steps per millisecond=64 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 152 ms. (steps per millisecond=65 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 8 resets, run finished after 127 ms. (steps per millisecond=78 ) properties (out of 12) seen :1
FORMULA BridgeAndVehicles-PT-V50P50N20-ReachabilityCardinality-12 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10000 steps, including 8 resets, run finished after 113 ms. (steps per millisecond=88 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10000 steps, including 8 resets, run finished after 171 ms. (steps per millisecond=58 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 8 resets, run finished after 85 ms. (steps per millisecond=117 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10000 steps, including 7 resets, run finished after 96 ms. (steps per millisecond=104 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 6 resets, run finished after 92 ms. (steps per millisecond=108 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 7 resets, run finished after 106 ms. (steps per millisecond=94 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10000 steps, including 8 resets, run finished after 120 ms. (steps per millisecond=83 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 7 resets, run finished after 105 ms. (steps per millisecond=95 ) properties (out of 11) seen :0
Running SMT prover for 11 properties.
[2022-06-02 18:40:58] [INFO ] Flow matrix only has 290 transitions (discarded 2058 similar events)
// Phase 1: matrix 290 rows 138 cols
[2022-06-02 18:40:58] [INFO ] Computed 7 place invariants in 20 ms
[2022-06-02 18:40:59] [INFO ] [Real]Absence check using 7 positive place invariants in 4 ms returned sat
[2022-06-02 18:40:59] [INFO ] After 247ms SMT Verify possible using all constraints in real domain returned unsat :2 sat :0 real:9
[2022-06-02 18:40:59] [INFO ] [Nat]Absence check using 7 positive place invariants in 3 ms returned sat
[2022-06-02 18:40:59] [INFO ] After 388ms SMT Verify possible using state equation in natural domain returned unsat :8 sat :3
[2022-06-02 18:40:59] [INFO ] State equation strengthened by 42 read => feed constraints.
[2022-06-02 18:41:00] [INFO ] After 462ms SMT Verify possible using 42 Read/Feed constraints in natural domain returned unsat :8 sat :3
[2022-06-02 18:41:00] [INFO ] After 1298ms SMT Verify possible using trap constraints in natural domain returned unsat :8 sat :3
Attempting to minimize the solution found.
Minimization took 468 ms.
[2022-06-02 18:41:01] [INFO ] After 2299ms SMT Verify possible using all constraints in natural domain returned unsat :8 sat :3
FORMULA BridgeAndVehicles-PT-V50P50N20-ReachabilityCardinality-15 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA BridgeAndVehicles-PT-V50P50N20-ReachabilityCardinality-14 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA BridgeAndVehicles-PT-V50P50N20-ReachabilityCardinality-13 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA BridgeAndVehicles-PT-V50P50N20-ReachabilityCardinality-10 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA BridgeAndVehicles-PT-V50P50N20-ReachabilityCardinality-09 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA BridgeAndVehicles-PT-V50P50N20-ReachabilityCardinality-06 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA BridgeAndVehicles-PT-V50P50N20-ReachabilityCardinality-02 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA BridgeAndVehicles-PT-V50P50N20-ReachabilityCardinality-01 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 11 Parikh solutions to 3 different solutions.
Parikh walk visited 0 properties in 1579 ms.
Support contains 15 out of 138 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 138/138 places, 2348/2348 transitions.
Applied a total of 0 rules in 344 ms. Remains 138 /138 variables (removed 0) and now considering 2348/2348 (removed 0) transitions.
[2022-06-02 18:41:03] [INFO ] Flow matrix only has 290 transitions (discarded 2058 similar events)
// Phase 1: matrix 290 rows 138 cols
[2022-06-02 18:41:03] [INFO ] Computed 7 place invariants in 7 ms
[2022-06-02 18:41:04] [INFO ] Dead Transitions using invariants and state equation in 780 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 138/138 places, 2348/2348 transitions.
Incomplete random walk after 1000000 steps, including 2316 resets, run finished after 18482 ms. (steps per millisecond=54 ) properties (out of 3) seen :0
Interrupted Best-First random walk after 722046 steps, including 584 resets, run timeout after 5001 ms. (steps per millisecond=144 ) properties seen 0
Interrupted Best-First random walk after 796219 steps, including 692 resets, run timeout after 5001 ms. (steps per millisecond=159 ) properties seen 0
Interrupted Best-First random walk after 788029 steps, including 670 resets, run timeout after 5001 ms. (steps per millisecond=157 ) properties seen 0
Interrupted probabilistic random walk after 6858795 steps, run timeout after 99001 ms. (steps per millisecond=69 ) properties seen :{}
Probabilistic random walk after 6858795 steps, saw 1741639 distinct states, run finished after 99004 ms. (steps per millisecond=69 ) properties seen :0
Running SMT prover for 3 properties.
[2022-06-02 18:43:16] [INFO ] Flow matrix only has 290 transitions (discarded 2058 similar events)
// Phase 1: matrix 290 rows 138 cols
[2022-06-02 18:43:16] [INFO ] Computed 7 place invariants in 10 ms
[2022-06-02 18:43:16] [INFO ] [Real]Absence check using 7 positive place invariants in 2 ms returned sat
[2022-06-02 18:43:16] [INFO ] After 56ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2022-06-02 18:43:16] [INFO ] [Nat]Absence check using 7 positive place invariants in 1 ms returned sat
[2022-06-02 18:43:17] [INFO ] After 273ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2022-06-02 18:43:17] [INFO ] State equation strengthened by 42 read => feed constraints.
[2022-06-02 18:43:17] [INFO ] After 309ms SMT Verify possible using 42 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2022-06-02 18:43:18] [INFO ] After 934ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 425 ms.
[2022-06-02 18:43:18] [INFO ] After 1703ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 1864 ms.
Support contains 15 out of 138 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 138/138 places, 2348/2348 transitions.
Applied a total of 0 rules in 216 ms. Remains 138 /138 variables (removed 0) and now considering 2348/2348 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 138/138 places, 2348/2348 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 138/138 places, 2348/2348 transitions.
Applied a total of 0 rules in 259 ms. Remains 138 /138 variables (removed 0) and now considering 2348/2348 (removed 0) transitions.
[2022-06-02 18:43:20] [INFO ] Flow matrix only has 290 transitions (discarded 2058 similar events)
// Phase 1: matrix 290 rows 138 cols
[2022-06-02 18:43:20] [INFO ] Computed 7 place invariants in 10 ms
[2022-06-02 18:43:21] [INFO ] Implicit Places using invariants in 316 ms returned []
[2022-06-02 18:43:21] [INFO ] Flow matrix only has 290 transitions (discarded 2058 similar events)
// Phase 1: matrix 290 rows 138 cols
[2022-06-02 18:43:21] [INFO ] Computed 7 place invariants in 6 ms
[2022-06-02 18:43:21] [INFO ] State equation strengthened by 42 read => feed constraints.
[2022-06-02 18:43:22] [INFO ] Implicit Places using invariants and state equation in 1272 ms returned []
Implicit Place search using SMT with State Equation took 1593 ms to find 0 implicit places.
[2022-06-02 18:43:22] [INFO ] Redundant transitions in 157 ms returned []
[2022-06-02 18:43:22] [INFO ] Flow matrix only has 290 transitions (discarded 2058 similar events)
// Phase 1: matrix 290 rows 138 cols
[2022-06-02 18:43:22] [INFO ] Computed 7 place invariants in 6 ms
[2022-06-02 18:43:23] [INFO ] Dead Transitions using invariants and state equation in 718 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 138/138 places, 2348/2348 transitions.
Incomplete random walk after 1000000 steps, including 2316 resets, run finished after 18139 ms. (steps per millisecond=55 ) properties (out of 3) seen :0
Interrupted Best-First random walk after 886125 steps, including 717 resets, run timeout after 5001 ms. (steps per millisecond=177 ) properties seen 1
FORMULA BridgeAndVehicles-PT-V50P50N20-ReachabilityCardinality-03 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 1000001 steps, including 869 resets, run finished after 4194 ms. (steps per millisecond=238 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 1000001 steps, including 850 resets, run finished after 4206 ms. (steps per millisecond=237 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2022-06-02 18:43:54] [INFO ] Flow matrix only has 290 transitions (discarded 2058 similar events)
// Phase 1: matrix 290 rows 138 cols
[2022-06-02 18:43:54] [INFO ] Computed 7 place invariants in 2 ms
[2022-06-02 18:43:54] [INFO ] After 47ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2022-06-02 18:43:54] [INFO ] [Nat]Absence check using 7 positive place invariants in 2 ms returned sat
[2022-06-02 18:43:55] [INFO ] After 180ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2022-06-02 18:43:55] [INFO ] State equation strengthened by 42 read => feed constraints.
[2022-06-02 18:43:55] [INFO ] After 209ms SMT Verify possible using 42 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2022-06-02 18:43:55] [INFO ] Deduced a trap composed of 5 places in 216 ms of which 2 ms to minimize.
[2022-06-02 18:43:55] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 264 ms
[2022-06-02 18:43:55] [INFO ] After 630ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 185 ms.
[2022-06-02 18:43:55] [INFO ] After 1061ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 1034 ms.
Support contains 7 out of 138 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 138/138 places, 2348/2348 transitions.
Graph (complete) has 1302 edges and 138 vertex of which 136 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.10 ms
Discarding 2 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 208 ms. Remains 136 /138 variables (removed 2) and now considering 2348/2348 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 136/138 places, 2348/2348 transitions.
Incomplete random walk after 1000000 steps, including 2316 resets, run finished after 14172 ms. (steps per millisecond=70 ) properties (out of 2) seen :0
Interrupted Best-First random walk after 993509 steps, including 863 resets, run timeout after 5001 ms. (steps per millisecond=198 ) properties seen 0
Incomplete Best-First random walk after 1000001 steps, including 853 resets, run finished after 4462 ms. (steps per millisecond=224 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 5496216 steps, run timeout after 69001 ms. (steps per millisecond=79 ) properties seen :{}
Probabilistic random walk after 5496216 steps, saw 1428550 distinct states, run finished after 69002 ms. (steps per millisecond=79 ) properties seen :0
Running SMT prover for 2 properties.
[2022-06-02 18:45:29] [INFO ] Flow matrix only has 290 transitions (discarded 2058 similar events)
// Phase 1: matrix 290 rows 136 cols
[2022-06-02 18:45:29] [INFO ] Computed 5 place invariants in 2 ms
[2022-06-02 18:45:29] [INFO ] After 43ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2022-06-02 18:45:29] [INFO ] [Nat]Absence check using 5 positive place invariants in 2 ms returned sat
[2022-06-02 18:45:30] [INFO ] After 163ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2022-06-02 18:45:30] [INFO ] State equation strengthened by 42 read => feed constraints.
[2022-06-02 18:45:30] [INFO ] After 196ms SMT Verify possible using 42 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2022-06-02 18:45:30] [INFO ] After 381ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 256 ms.
[2022-06-02 18:45:30] [INFO ] After 858ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 783 ms.
Support contains 7 out of 136 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 136/136 places, 2348/2348 transitions.
Applied a total of 0 rules in 206 ms. Remains 136 /136 variables (removed 0) and now considering 2348/2348 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 136/136 places, 2348/2348 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 136/136 places, 2348/2348 transitions.
Applied a total of 0 rules in 188 ms. Remains 136 /136 variables (removed 0) and now considering 2348/2348 (removed 0) transitions.
[2022-06-02 18:45:31] [INFO ] Flow matrix only has 290 transitions (discarded 2058 similar events)
// Phase 1: matrix 290 rows 136 cols
[2022-06-02 18:45:31] [INFO ] Computed 5 place invariants in 2 ms
[2022-06-02 18:45:32] [INFO ] Implicit Places using invariants in 280 ms returned []
[2022-06-02 18:45:32] [INFO ] Flow matrix only has 290 transitions (discarded 2058 similar events)
// Phase 1: matrix 290 rows 136 cols
[2022-06-02 18:45:32] [INFO ] Computed 5 place invariants in 1 ms
[2022-06-02 18:45:32] [INFO ] State equation strengthened by 42 read => feed constraints.
[2022-06-02 18:45:33] [INFO ] Implicit Places using invariants and state equation in 1232 ms returned [52, 108]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 1528 ms to find 2 implicit places.
Starting structural reductions in SAFETY mode, iteration 1 : 134/136 places, 2348/2348 transitions.
Applied a total of 0 rules in 196 ms. Remains 134 /134 variables (removed 0) and now considering 2348/2348 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 134/136 places, 2348/2348 transitions.
Incomplete random walk after 1000000 steps, including 2316 resets, run finished after 11371 ms. (steps per millisecond=87 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 1000006 steps, including 869 resets, run finished after 3698 ms. (steps per millisecond=270 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 1000001 steps, including 849 resets, run finished after 3921 ms. (steps per millisecond=255 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 4277335 steps, run timeout after 54001 ms. (steps per millisecond=79 ) properties seen :{}
Probabilistic random walk after 4277335 steps, saw 1126411 distinct states, run finished after 54001 ms. (steps per millisecond=79 ) properties seen :0
Running SMT prover for 2 properties.
[2022-06-02 18:46:46] [INFO ] Flow matrix only has 290 transitions (discarded 2058 similar events)
// Phase 1: matrix 290 rows 134 cols
[2022-06-02 18:46:46] [INFO ] Computed 5 place invariants in 4 ms
[2022-06-02 18:46:46] [INFO ] After 63ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2022-06-02 18:46:46] [INFO ] [Nat]Absence check using 5 positive place invariants in 3 ms returned sat
[2022-06-02 18:46:47] [INFO ] After 289ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2022-06-02 18:46:47] [INFO ] State equation strengthened by 42 read => feed constraints.
[2022-06-02 18:46:47] [INFO ] After 406ms SMT Verify possible using 42 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2022-06-02 18:46:48] [INFO ] After 1003ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 445 ms.
[2022-06-02 18:46:48] [INFO ] After 1813ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 597 ms.
Support contains 7 out of 134 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 134/134 places, 2348/2348 transitions.
Applied a total of 0 rules in 187 ms. Remains 134 /134 variables (removed 0) and now considering 2348/2348 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 134/134 places, 2348/2348 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 134/134 places, 2348/2348 transitions.
Applied a total of 0 rules in 194 ms. Remains 134 /134 variables (removed 0) and now considering 2348/2348 (removed 0) transitions.
[2022-06-02 18:46:49] [INFO ] Flow matrix only has 290 transitions (discarded 2058 similar events)
// Phase 1: matrix 290 rows 134 cols
[2022-06-02 18:46:49] [INFO ] Computed 5 place invariants in 4 ms
[2022-06-02 18:46:49] [INFO ] Implicit Places using invariants in 328 ms returned []
[2022-06-02 18:46:49] [INFO ] Flow matrix only has 290 transitions (discarded 2058 similar events)
// Phase 1: matrix 290 rows 134 cols
[2022-06-02 18:46:49] [INFO ] Computed 5 place invariants in 2 ms
[2022-06-02 18:46:50] [INFO ] State equation strengthened by 42 read => feed constraints.
[2022-06-02 18:46:50] [INFO ] Implicit Places using invariants and state equation in 811 ms returned []
Implicit Place search using SMT with State Equation took 1153 ms to find 0 implicit places.
[2022-06-02 18:46:50] [INFO ] Redundant transitions in 128 ms returned []
[2022-06-02 18:46:50] [INFO ] Flow matrix only has 290 transitions (discarded 2058 similar events)
// Phase 1: matrix 290 rows 134 cols
[2022-06-02 18:46:50] [INFO ] Computed 5 place invariants in 3 ms
[2022-06-02 18:46:51] [INFO ] Dead Transitions using invariants and state equation in 698 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 134/134 places, 2348/2348 transitions.
Incomplete random walk after 100000 steps, including 231 resets, run finished after 2514 ms. (steps per millisecond=39 ) properties (out of 6) seen :2
Running SMT prover for 4 properties.
[2022-06-02 18:46:54] [INFO ] Flow matrix only has 290 transitions (discarded 2058 similar events)
// Phase 1: matrix 290 rows 134 cols
[2022-06-02 18:46:54] [INFO ] Computed 5 place invariants in 1 ms
[2022-06-02 18:46:54] [INFO ] [Real]Absence check using 5 positive place invariants in 3 ms returned sat
[2022-06-02 18:46:54] [INFO ] After 54ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2022-06-02 18:46:54] [INFO ] [Nat]Absence check using 5 positive place invariants in 2 ms returned sat
[2022-06-02 18:46:54] [INFO ] After 288ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2022-06-02 18:46:54] [INFO ] State equation strengthened by 42 read => feed constraints.
[2022-06-02 18:46:54] [INFO ] After 188ms SMT Verify possible using 42 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2022-06-02 18:46:54] [INFO ] After 437ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 262 ms.
[2022-06-02 18:46:55] [INFO ] After 1062ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Incomplete random walk after 10000 steps, including 23 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 8 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 268140 steps, run timeout after 3001 ms. (steps per millisecond=89 ) properties seen :{}
Probabilistic random walk after 268140 steps, saw 71770 distinct states, run finished after 3001 ms. (steps per millisecond=89 ) properties seen :0
Running SMT prover for 1 properties.
[2022-06-02 18:46:58] [INFO ] Flow matrix only has 290 transitions (discarded 2058 similar events)
// Phase 1: matrix 290 rows 134 cols
[2022-06-02 18:46:58] [INFO ] Computed 5 place invariants in 4 ms
[2022-06-02 18:46:58] [INFO ] [Real]Absence check using 5 positive place invariants in 2 ms returned sat
[2022-06-02 18:46:58] [INFO ] After 155ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-06-02 18:46:58] [INFO ] [Nat]Absence check using 5 positive place invariants in 2 ms returned sat
[2022-06-02 18:46:58] [INFO ] After 101ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-06-02 18:46:58] [INFO ] State equation strengthened by 42 read => feed constraints.
[2022-06-02 18:46:58] [INFO ] After 51ms SMT Verify possible using 42 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-06-02 18:46:58] [INFO ] After 108ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 57 ms.
[2022-06-02 18:46:58] [INFO ] After 321ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 4 ms.
Support contains 3 out of 134 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 134/134 places, 2348/2348 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 133 transition count 2347
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 133 transition count 2347
Applied a total of 2 rules in 269 ms. Remains 133 /134 variables (removed 1) and now considering 2347/2348 (removed 1) transitions.
[2022-06-02 18:46:59] [INFO ] Flow matrix only has 289 transitions (discarded 2058 similar events)
// Phase 1: matrix 289 rows 133 cols
[2022-06-02 18:46:59] [INFO ] Computed 5 place invariants in 2 ms
[2022-06-02 18:47:00] [INFO ] Dead Transitions using invariants and state equation in 1090 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 133/134 places, 2347/2348 transitions.
Incomplete random walk after 10000 steps, including 23 resets, run finished after 68 ms. (steps per millisecond=147 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 8 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 269431 steps, run timeout after 3001 ms. (steps per millisecond=89 ) properties seen :{}
Probabilistic random walk after 269431 steps, saw 72127 distinct states, run finished after 3001 ms. (steps per millisecond=89 ) properties seen :0
Running SMT prover for 1 properties.
[2022-06-02 18:47:03] [INFO ] Flow matrix only has 289 transitions (discarded 2058 similar events)
// Phase 1: matrix 289 rows 133 cols
[2022-06-02 18:47:03] [INFO ] Computed 5 place invariants in 4 ms
[2022-06-02 18:47:03] [INFO ] [Real]Absence check using 5 positive place invariants in 4 ms returned sat
[2022-06-02 18:47:03] [INFO ] After 134ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-06-02 18:47:03] [INFO ] [Nat]Absence check using 5 positive place invariants in 4 ms returned sat
[2022-06-02 18:47:03] [INFO ] After 101ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-06-02 18:47:03] [INFO ] State equation strengthened by 42 read => feed constraints.
[2022-06-02 18:47:03] [INFO ] After 73ms SMT Verify possible using 42 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-06-02 18:47:03] [INFO ] After 270ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 68 ms.
[2022-06-02 18:47:03] [INFO ] After 490ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 9 ms.
Support contains 3 out of 133 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 133/133 places, 2347/2347 transitions.
Applied a total of 0 rules in 219 ms. Remains 133 /133 variables (removed 0) and now considering 2347/2347 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 133/133 places, 2347/2347 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 133/133 places, 2347/2347 transitions.
Applied a total of 0 rules in 208 ms. Remains 133 /133 variables (removed 0) and now considering 2347/2347 (removed 0) transitions.
[2022-06-02 18:47:04] [INFO ] Flow matrix only has 289 transitions (discarded 2058 similar events)
// Phase 1: matrix 289 rows 133 cols
[2022-06-02 18:47:04] [INFO ] Computed 5 place invariants in 3 ms
[2022-06-02 18:47:04] [INFO ] Implicit Places using invariants in 375 ms returned []
[2022-06-02 18:47:04] [INFO ] Flow matrix only has 289 transitions (discarded 2058 similar events)
// Phase 1: matrix 289 rows 133 cols
[2022-06-02 18:47:04] [INFO ] Computed 5 place invariants in 4 ms
[2022-06-02 18:47:04] [INFO ] State equation strengthened by 42 read => feed constraints.
[2022-06-02 18:47:05] [INFO ] Implicit Places using invariants and state equation in 958 ms returned []
Implicit Place search using SMT with State Equation took 1336 ms to find 0 implicit places.
[2022-06-02 18:47:05] [INFO ] Redundant transitions in 53 ms returned []
[2022-06-02 18:47:05] [INFO ] Flow matrix only has 289 transitions (discarded 2058 similar events)
// Phase 1: matrix 289 rows 133 cols
[2022-06-02 18:47:05] [INFO ] Computed 5 place invariants in 4 ms
[2022-06-02 18:47:06] [INFO ] Dead Transitions using invariants and state equation in 748 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 133/133 places, 2347/2347 transitions.
Ensure Unique test removed 2058 transitions
Reduce isomorphic transitions removed 2058 transitions.
Iterating post reduction 0 with 2058 rules applied. Total rules applied 2058 place count 133 transition count 289
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 1 with 2 rules applied. Total rules applied 2060 place count 133 transition count 287
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 2062 place count 131 transition count 287
Partial Free-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 2 with 2 rules applied. Total rules applied 2064 place count 131 transition count 287
Applied a total of 2064 rules in 23 ms. Remains 131 /133 variables (removed 2) and now considering 287/2347 (removed 2060) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 287 rows 131 cols
[2022-06-02 18:47:06] [INFO ] Computed 5 place invariants in 3 ms
[2022-06-02 18:47:06] [INFO ] [Real]Absence check using 5 positive place invariants in 2 ms returned sat
[2022-06-02 18:47:06] [INFO ] After 149ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-06-02 18:47:06] [INFO ] [Nat]Absence check using 5 positive place invariants in 2 ms returned sat
[2022-06-02 18:47:06] [INFO ] After 98ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-06-02 18:47:06] [INFO ] State equation strengthened by 2 read => feed constraints.
[2022-06-02 18:47:06] [INFO ] After 33ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-06-02 18:47:06] [INFO ] After 75ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 32 ms.
[2022-06-02 18:47:06] [INFO ] After 241ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
[2022-06-02 18:47:07] [INFO ] Flatten gal took : 74 ms
[2022-06-02 18:47:07] [INFO ] Flatten gal took : 28 ms
[2022-06-02 18:47:07] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality10584307040378231086.gal : 14 ms
[2022-06-02 18:47:07] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality14026233563629878755.prop : 1 ms
Invoking ITS tools like this :cd /tmp/redAtoms1490706916067114097;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality10584307040378231086.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality14026233563629878755.prop' '--nowitness' '--gen-order' 'FOLLOW'
its-reach command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp...321
Loading property file /tmp/ReachabilityCardinality14026233563629878755.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 3
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :3 after 12
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :12 after 30
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :30 after 64
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :64 after 84
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :84 after 840
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :840 after 7056
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :7056 after 47040
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :47040 after 341040
Invariant property AtomicProp does not hold.
Found states matching all0 target predicate
Will report total states built up to this point. Computation was interrupted after 1025 fixpoint passes
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst,3.97412e+06,0.801533,21272,2,8107,15,68047,6,0,818,28392,0
Total reachable state count : 3974124
Verifying 1 reachability properties.
Invariant property AtomicProp does not hold.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
AtomicProp,21,0.806959,21272,2,154,15,68047,7,0,969,28392,0
Finished random walk after 159 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=79 )
Incomplete random walk after 10000 steps, including 23 resets, run finished after 72 ms. (steps per millisecond=138 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10013 steps, including 8 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 270018 steps, run timeout after 3001 ms. (steps per millisecond=89 ) properties seen :{}
Probabilistic random walk after 270018 steps, saw 72266 distinct states, run finished after 3001 ms. (steps per millisecond=89 ) properties seen :0
Running SMT prover for 1 properties.
[2022-06-02 18:47:11] [INFO ] Flow matrix only has 290 transitions (discarded 2058 similar events)
// Phase 1: matrix 290 rows 134 cols
[2022-06-02 18:47:11] [INFO ] Computed 5 place invariants in 2 ms
[2022-06-02 18:47:11] [INFO ] [Real]Absence check using 5 positive place invariants in 11 ms returned sat
[2022-06-02 18:47:11] [INFO ] After 145ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-06-02 18:47:11] [INFO ] [Nat]Absence check using 5 positive place invariants in 1 ms returned sat
[2022-06-02 18:47:11] [INFO ] After 120ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-06-02 18:47:11] [INFO ] State equation strengthened by 42 read => feed constraints.
[2022-06-02 18:47:11] [INFO ] After 112ms SMT Verify possible using 42 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-06-02 18:47:11] [INFO ] After 217ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 54 ms.
[2022-06-02 18:47:11] [INFO ] After 440ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 2 ms.
Support contains 1 out of 134 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 134/134 places, 2348/2348 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 133 transition count 2347
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 133 transition count 2347
Applied a total of 2 rules in 221 ms. Remains 133 /134 variables (removed 1) and now considering 2347/2348 (removed 1) transitions.
[2022-06-02 18:47:12] [INFO ] Flow matrix only has 289 transitions (discarded 2058 similar events)
// Phase 1: matrix 289 rows 133 cols
[2022-06-02 18:47:12] [INFO ] Computed 5 place invariants in 2 ms
[2022-06-02 18:47:12] [INFO ] Dead Transitions using invariants and state equation in 759 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 133/134 places, 2347/2348 transitions.
Incomplete random walk after 10000 steps, including 23 resets, run finished after 69 ms. (steps per millisecond=144 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 8 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 267634 steps, run timeout after 3001 ms. (steps per millisecond=89 ) properties seen :{}
Probabilistic random walk after 267634 steps, saw 71649 distinct states, run finished after 3001 ms. (steps per millisecond=89 ) properties seen :0
Running SMT prover for 1 properties.
[2022-06-02 18:47:15] [INFO ] Flow matrix only has 289 transitions (discarded 2058 similar events)
// Phase 1: matrix 289 rows 133 cols
[2022-06-02 18:47:15] [INFO ] Computed 5 place invariants in 4 ms
[2022-06-02 18:47:15] [INFO ] [Real]Absence check using 5 positive place invariants in 2 ms returned sat
[2022-06-02 18:47:16] [INFO ] After 131ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-06-02 18:47:16] [INFO ] [Nat]Absence check using 5 positive place invariants in 1 ms returned sat
[2022-06-02 18:47:16] [INFO ] After 101ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-06-02 18:47:16] [INFO ] State equation strengthened by 42 read => feed constraints.
[2022-06-02 18:47:16] [INFO ] After 136ms SMT Verify possible using 42 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-06-02 18:47:16] [INFO ] After 193ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 55 ms.
[2022-06-02 18:47:16] [INFO ] After 400ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 3 ms.
Support contains 1 out of 133 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 133/133 places, 2347/2347 transitions.
Applied a total of 0 rules in 208 ms. Remains 133 /133 variables (removed 0) and now considering 2347/2347 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 133/133 places, 2347/2347 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 133/133 places, 2347/2347 transitions.
Applied a total of 0 rules in 207 ms. Remains 133 /133 variables (removed 0) and now considering 2347/2347 (removed 0) transitions.
[2022-06-02 18:47:16] [INFO ] Flow matrix only has 289 transitions (discarded 2058 similar events)
// Phase 1: matrix 289 rows 133 cols
[2022-06-02 18:47:16] [INFO ] Computed 5 place invariants in 4 ms
[2022-06-02 18:47:17] [INFO ] Implicit Places using invariants in 371 ms returned []
[2022-06-02 18:47:17] [INFO ] Flow matrix only has 289 transitions (discarded 2058 similar events)
// Phase 1: matrix 289 rows 133 cols
[2022-06-02 18:47:17] [INFO ] Computed 5 place invariants in 1 ms
[2022-06-02 18:47:17] [INFO ] State equation strengthened by 42 read => feed constraints.
[2022-06-02 18:47:18] [INFO ] Implicit Places using invariants and state equation in 895 ms returned []
Implicit Place search using SMT with State Equation took 1274 ms to find 0 implicit places.
[2022-06-02 18:47:18] [INFO ] Redundant transitions in 55 ms returned []
[2022-06-02 18:47:18] [INFO ] Flow matrix only has 289 transitions (discarded 2058 similar events)
// Phase 1: matrix 289 rows 133 cols
[2022-06-02 18:47:18] [INFO ] Computed 5 place invariants in 3 ms
[2022-06-02 18:47:18] [INFO ] Dead Transitions using invariants and state equation in 726 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 133/133 places, 2347/2347 transitions.
Ensure Unique test removed 2058 transitions
Reduce isomorphic transitions removed 2058 transitions.
Iterating post reduction 0 with 2058 rules applied. Total rules applied 2058 place count 133 transition count 289
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 1 with 4 rules applied. Total rules applied 2062 place count 131 transition count 287
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 1 with 2 rules applied. Total rules applied 2064 place count 131 transition count 285
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 2066 place count 129 transition count 285
Applied a total of 2066 rules in 23 ms. Remains 129 /133 variables (removed 4) and now considering 285/2347 (removed 2062) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 285 rows 129 cols
[2022-06-02 18:47:18] [INFO ] Computed 5 place invariants in 1 ms
[2022-06-02 18:47:18] [INFO ] [Real]Absence check using 5 positive place invariants in 2 ms returned sat
[2022-06-02 18:47:18] [INFO ] After 36ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-06-02 18:47:19] [INFO ] [Nat]Absence check using 5 positive place invariants in 1 ms returned sat
[2022-06-02 18:47:19] [INFO ] After 82ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-06-02 18:47:19] [INFO ] State equation strengthened by 2 read => feed constraints.
[2022-06-02 18:47:19] [INFO ] After 24ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-06-02 18:47:19] [INFO ] After 59ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 23 ms.
[2022-06-02 18:47:19] [INFO ] After 203ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
[2022-06-02 18:47:19] [INFO ] Flatten gal took : 23 ms
[2022-06-02 18:47:19] [INFO ] Flatten gal took : 21 ms
[2022-06-02 18:47:19] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality16025848103352157105.gal : 5 ms
[2022-06-02 18:47:19] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality1469970969760716164.prop : 0 ms
Invoking ITS tools like this :cd /tmp/redAtoms1490706916067114097;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality16025848103352157105.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality1469970969760716164.prop' '--nowitness' '--gen-order' 'FOLLOW'
its-reach command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp...320
Loading property file /tmp/ReachabilityCardinality1469970969760716164.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 8
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :8 after 18
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :18 after 36
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :36 after 70
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :70 after 82
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :82 after 820
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :820 after 6888
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :6888 after 45920
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :45920 after 332920
Invariant property AtomicProp does not hold.
Found states matching all0 target predicate
Will report total states built up to this point. Computation was interrupted after 1025 fixpoint passes
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst,3.92509e+06,0.701394,20076,2,7947,15,63416,6,0,808,26169,0
Total reachable state count : 3925094
Verifying 1 reachability properties.
Invariant property AtomicProp does not hold.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
AtomicProp,246,0.703513,20076,2,203,15,63416,7,0,811,26169,0
Incomplete random walk after 10000 steps, including 23 resets, run finished after 70 ms. (steps per millisecond=142 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 8 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 263116 steps, run timeout after 3001 ms. (steps per millisecond=87 ) properties seen :{}
Probabilistic random walk after 263116 steps, saw 70482 distinct states, run finished after 3001 ms. (steps per millisecond=87 ) properties seen :0
Running SMT prover for 1 properties.
[2022-06-02 18:47:23] [INFO ] Flow matrix only has 290 transitions (discarded 2058 similar events)
// Phase 1: matrix 290 rows 134 cols
[2022-06-02 18:47:23] [INFO ] Computed 5 place invariants in 4 ms
[2022-06-02 18:47:23] [INFO ] After 42ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-06-02 18:47:23] [INFO ] [Nat]Absence check using 5 positive place invariants in 2 ms returned sat
[2022-06-02 18:47:23] [INFO ] After 234ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-06-02 18:47:23] [INFO ] State equation strengthened by 42 read => feed constraints.
[2022-06-02 18:47:26] [INFO ] After 2724ms SMT Verify possible using 42 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-06-02 18:47:26] [INFO ] After 2862ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 75 ms.
[2022-06-02 18:47:26] [INFO ] After 3221ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 2 ms.
Support contains 3 out of 134 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 134/134 places, 2348/2348 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 133 transition count 2347
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 133 transition count 2347
Applied a total of 2 rules in 236 ms. Remains 133 /134 variables (removed 1) and now considering 2347/2348 (removed 1) transitions.
[2022-06-02 18:47:26] [INFO ] Flow matrix only has 289 transitions (discarded 2058 similar events)
// Phase 1: matrix 289 rows 133 cols
[2022-06-02 18:47:26] [INFO ] Computed 5 place invariants in 4 ms
[2022-06-02 18:47:27] [INFO ] Dead Transitions using invariants and state equation in 725 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 133/134 places, 2347/2348 transitions.
Incomplete random walk after 10000 steps, including 23 resets, run finished after 68 ms. (steps per millisecond=147 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 8 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 264396 steps, run timeout after 3001 ms. (steps per millisecond=88 ) properties seen :{}
Probabilistic random walk after 264396 steps, saw 70830 distinct states, run finished after 3001 ms. (steps per millisecond=88 ) properties seen :0
Running SMT prover for 1 properties.
[2022-06-02 18:47:30] [INFO ] Flow matrix only has 289 transitions (discarded 2058 similar events)
// Phase 1: matrix 289 rows 133 cols
[2022-06-02 18:47:30] [INFO ] Computed 5 place invariants in 4 ms
[2022-06-02 18:47:30] [INFO ] After 39ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-06-02 18:47:30] [INFO ] [Nat]Absence check using 5 positive place invariants in 1 ms returned sat
[2022-06-02 18:47:31] [INFO ] After 627ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-06-02 18:47:31] [INFO ] State equation strengthened by 42 read => feed constraints.
[2022-06-02 18:47:31] [INFO ] After 398ms SMT Verify possible using 42 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-06-02 18:47:32] [INFO ] After 1458ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 123 ms.
[2022-06-02 18:47:32] [INFO ] After 2263ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 6 ms.
Support contains 3 out of 133 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 133/133 places, 2347/2347 transitions.
Applied a total of 0 rules in 193 ms. Remains 133 /133 variables (removed 0) and now considering 2347/2347 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 133/133 places, 2347/2347 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 133/133 places, 2347/2347 transitions.
Applied a total of 0 rules in 193 ms. Remains 133 /133 variables (removed 0) and now considering 2347/2347 (removed 0) transitions.
[2022-06-02 18:47:33] [INFO ] Flow matrix only has 289 transitions (discarded 2058 similar events)
// Phase 1: matrix 289 rows 133 cols
[2022-06-02 18:47:33] [INFO ] Computed 5 place invariants in 4 ms
[2022-06-02 18:47:33] [INFO ] Implicit Places using invariants in 333 ms returned []
[2022-06-02 18:47:33] [INFO ] Flow matrix only has 289 transitions (discarded 2058 similar events)
// Phase 1: matrix 289 rows 133 cols
[2022-06-02 18:47:33] [INFO ] Computed 5 place invariants in 5 ms
[2022-06-02 18:47:33] [INFO ] State equation strengthened by 42 read => feed constraints.
[2022-06-02 18:47:34] [INFO ] Implicit Places using invariants and state equation in 879 ms returned []
Implicit Place search using SMT with State Equation took 1215 ms to find 0 implicit places.
[2022-06-02 18:47:34] [INFO ] Redundant transitions in 55 ms returned []
[2022-06-02 18:47:34] [INFO ] Flow matrix only has 289 transitions (discarded 2058 similar events)
// Phase 1: matrix 289 rows 133 cols
[2022-06-02 18:47:34] [INFO ] Computed 5 place invariants in 2 ms
[2022-06-02 18:47:35] [INFO ] Dead Transitions using invariants and state equation in 722 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 133/133 places, 2347/2347 transitions.
Ensure Unique test removed 2058 transitions
Reduce isomorphic transitions removed 2058 transitions.
Iterating post reduction 0 with 2058 rules applied. Total rules applied 2058 place count 133 transition count 289
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 1 with 4 rules applied. Total rules applied 2062 place count 131 transition count 287
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 1 with 2 rules applied. Total rules applied 2064 place count 131 transition count 285
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 2066 place count 129 transition count 285
Applied a total of 2066 rules in 17 ms. Remains 129 /133 variables (removed 4) and now considering 285/2347 (removed 2062) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 285 rows 129 cols
[2022-06-02 18:47:35] [INFO ] Computed 5 place invariants in 3 ms
[2022-06-02 18:47:35] [INFO ] After 32ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-06-02 18:47:35] [INFO ] [Nat]Absence check using 5 positive place invariants in 1 ms returned sat
[2022-06-02 18:47:35] [INFO ] After 249ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-06-02 18:47:35] [INFO ] State equation strengthened by 2 read => feed constraints.
[2022-06-02 18:47:37] [INFO ] After 1557ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-06-02 18:47:37] [INFO ] After 1662ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 39 ms.
[2022-06-02 18:47:37] [INFO ] After 1987ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
[2022-06-02 18:47:37] [INFO ] Flatten gal took : 23 ms
[2022-06-02 18:47:37] [INFO ] Flatten gal took : 20 ms
[2022-06-02 18:47:37] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality1042561502374415207.gal : 2 ms
[2022-06-02 18:47:37] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality7587309495165862908.prop : 0 ms
Invoking ITS tools like this :cd /tmp/redAtoms1490706916067114097;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality1042561502374415207.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality7587309495165862908.prop' '--nowitness' '--gen-order' 'FOLLOW'
its-reach command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp...319
Loading property file /tmp/ReachabilityCardinality7587309495165862908.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 8
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :8 after 18
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :18 after 36
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :36 after 70
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :70 after 82
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :82 after 820
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :820 after 6888
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :6888 after 45920
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :45920 after 332920
Invariant property AtomicProp does not hold.
Found states matching all0 target predicate
Will report total states built up to this point. Computation was interrupted after 1025 fixpoint passes
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst,3.92509e+06,0.610899,20344,2,7947,15,63449,6,0,808,26168,0
Total reachable state count : 3925094
Verifying 1 reachability properties.
Invariant property AtomicProp does not hold.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
AtomicProp,20,0.612166,20344,2,150,15,63449,7,0,813,26168,0
Incomplete random walk after 10000 steps, including 23 resets, run finished after 67 ms. (steps per millisecond=149 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 7 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 263659 steps, run timeout after 3001 ms. (steps per millisecond=87 ) properties seen :{}
Probabilistic random walk after 263659 steps, saw 70611 distinct states, run finished after 3001 ms. (steps per millisecond=87 ) properties seen :0
Running SMT prover for 1 properties.
[2022-06-02 18:47:40] [INFO ] Flow matrix only has 290 transitions (discarded 2058 similar events)
// Phase 1: matrix 290 rows 134 cols
[2022-06-02 18:47:40] [INFO ] Computed 5 place invariants in 3 ms
[2022-06-02 18:47:41] [INFO ] [Real]Absence check using 5 positive place invariants in 1 ms returned sat
[2022-06-02 18:47:41] [INFO ] After 149ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-06-02 18:47:41] [INFO ] [Nat]Absence check using 5 positive place invariants in 2 ms returned sat
[2022-06-02 18:47:41] [INFO ] After 88ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-06-02 18:47:41] [INFO ] State equation strengthened by 42 read => feed constraints.
[2022-06-02 18:47:41] [INFO ] After 49ms SMT Verify possible using 42 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-06-02 18:47:41] [INFO ] After 83ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 16 ms.
[2022-06-02 18:47:41] [INFO ] After 249ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 3 ms.
Support contains 1 out of 134 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 134/134 places, 2348/2348 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 133 transition count 2347
Applied a total of 2 rules in 218 ms. Remains 133 /134 variables (removed 1) and now considering 2347/2348 (removed 1) transitions.
[2022-06-02 18:47:41] [INFO ] Flow matrix only has 289 transitions (discarded 2058 similar events)
// Phase 1: matrix 289 rows 133 cols
[2022-06-02 18:47:41] [INFO ] Computed 5 place invariants in 2 ms
[2022-06-02 18:47:42] [INFO ] Dead Transitions using invariants and state equation in 710 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 133/134 places, 2347/2348 transitions.
Incomplete random walk after 10000 steps, including 26 resets, run finished after 72 ms. (steps per millisecond=138 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 9 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 245788 steps, run timeout after 3001 ms. (steps per millisecond=81 ) properties seen :{}
Probabilistic random walk after 245788 steps, saw 70696 distinct states, run finished after 3001 ms. (steps per millisecond=81 ) properties seen :0
Running SMT prover for 1 properties.
[2022-06-02 18:47:45] [INFO ] Flow matrix only has 289 transitions (discarded 2058 similar events)
// Phase 1: matrix 289 rows 133 cols
[2022-06-02 18:47:45] [INFO ] Computed 5 place invariants in 3 ms
[2022-06-02 18:47:45] [INFO ] [Real]Absence check using 5 positive place invariants in 1 ms returned sat
[2022-06-02 18:47:45] [INFO ] After 114ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-06-02 18:47:45] [INFO ] [Nat]Absence check using 5 positive place invariants in 2 ms returned sat
[2022-06-02 18:47:45] [INFO ] After 78ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-06-02 18:47:45] [INFO ] State equation strengthened by 42 read => feed constraints.
[2022-06-02 18:47:45] [INFO ] After 76ms SMT Verify possible using 42 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-06-02 18:47:45] [INFO ] After 131ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 16 ms.
[2022-06-02 18:47:45] [INFO ] After 279ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 5 ms.
Support contains 1 out of 133 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 133/133 places, 2347/2347 transitions.
Applied a total of 0 rules in 203 ms. Remains 133 /133 variables (removed 0) and now considering 2347/2347 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 133/133 places, 2347/2347 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 133/133 places, 2347/2347 transitions.
Applied a total of 0 rules in 196 ms. Remains 133 /133 variables (removed 0) and now considering 2347/2347 (removed 0) transitions.
[2022-06-02 18:47:46] [INFO ] Flow matrix only has 289 transitions (discarded 2058 similar events)
// Phase 1: matrix 289 rows 133 cols
[2022-06-02 18:47:46] [INFO ] Computed 5 place invariants in 1 ms
[2022-06-02 18:47:46] [INFO ] Implicit Places using invariants in 352 ms returned []
[2022-06-02 18:47:46] [INFO ] Flow matrix only has 289 transitions (discarded 2058 similar events)
// Phase 1: matrix 289 rows 133 cols
[2022-06-02 18:47:46] [INFO ] Computed 5 place invariants in 1 ms
[2022-06-02 18:47:46] [INFO ] State equation strengthened by 42 read => feed constraints.
[2022-06-02 18:47:47] [INFO ] Implicit Places using invariants and state equation in 1024 ms returned []
Implicit Place search using SMT with State Equation took 1378 ms to find 0 implicit places.
[2022-06-02 18:47:47] [INFO ] Redundant transitions in 54 ms returned []
[2022-06-02 18:47:47] [INFO ] Flow matrix only has 289 transitions (discarded 2058 similar events)
// Phase 1: matrix 289 rows 133 cols
[2022-06-02 18:47:47] [INFO ] Computed 5 place invariants in 1 ms
[2022-06-02 18:47:48] [INFO ] Dead Transitions using invariants and state equation in 662 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 133/133 places, 2347/2347 transitions.
Ensure Unique test removed 2058 transitions
Reduce isomorphic transitions removed 2058 transitions.
Iterating post reduction 0 with 2058 rules applied. Total rules applied 2058 place count 133 transition count 289
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 1 with 4 rules applied. Total rules applied 2062 place count 131 transition count 287
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 1 with 2 rules applied. Total rules applied 2064 place count 131 transition count 285
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 2066 place count 129 transition count 285
Applied a total of 2066 rules in 12 ms. Remains 129 /133 variables (removed 4) and now considering 285/2347 (removed 2062) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 285 rows 129 cols
[2022-06-02 18:47:48] [INFO ] Computed 5 place invariants in 1 ms
[2022-06-02 18:47:48] [INFO ] [Real]Absence check using 5 positive place invariants in 1 ms returned sat
[2022-06-02 18:47:48] [INFO ] After 115ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-06-02 18:47:48] [INFO ] [Nat]Absence check using 5 positive place invariants in 2 ms returned sat
[2022-06-02 18:47:48] [INFO ] After 74ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-06-02 18:47:48] [INFO ] State equation strengthened by 2 read => feed constraints.
[2022-06-02 18:47:48] [INFO ] After 12ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-06-02 18:47:48] [INFO ] After 31ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 18 ms.
[2022-06-02 18:47:48] [INFO ] After 169ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
[2022-06-02 18:47:48] [INFO ] Flatten gal took : 27 ms
[2022-06-02 18:47:48] [INFO ] Flatten gal took : 26 ms
[2022-06-02 18:47:48] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality17549579532218037841.gal : 2 ms
[2022-06-02 18:47:48] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality4464350086356374818.prop : 0 ms
Invoking ITS tools like this :cd /tmp/redAtoms1490706916067114097;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality17549579532218037841.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality4464350086356374818.prop' '--nowitness' '--gen-order' 'FOLLOW'
its-reach command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp...320
Loading property file /tmp/ReachabilityCardinality4464350086356374818.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 2
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :2 after 10
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :10 after 18
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :18 after 26
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :26 after 40
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :40 after 58
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :58 after 203
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :203 after 17220
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :217300 after 244019
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :244019 after 267414
SDD proceeding with computation,1 properties remain. new max is 4096
SDD size :760550 after 977850
SDD proceeding with computation,1 properties remain. new max is 8192
SDD size :9.1266e+08 after 9.16571e+08
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst,2.54513e+09,1.19225,32604,2,13392,20,147339,7,0,809,79068,0
Total reachable state count : 2545126250
Verifying 1 reachability properties.
Invariant property AtomicProp does not hold.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
AtomicProp,105206,1.19399,32604,2,1726,20,147339,7,0,811,79068,0
Finished random walk after 180 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=90 )
Ensure Unique test removed 2058 transitions
Reduce isomorphic transitions removed 2058 transitions.
Iterating post reduction 0 with 2058 rules applied. Total rules applied 2058 place count 134 transition count 290
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 1 with 1 rules applied. Total rules applied 2059 place count 134 transition count 289
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2060 place count 133 transition count 289
Applied a total of 2060 rules in 10 ms. Remains 133 /134 variables (removed 1) and now considering 289/2348 (removed 2059) transitions.
Running SMT prover for 2 properties.
// Phase 1: matrix 289 rows 133 cols
[2022-06-02 18:47:49] [INFO ] Computed 5 place invariants in 2 ms
[2022-06-02 18:47:50] [INFO ] After 47ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2022-06-02 18:47:50] [INFO ] [Nat]Absence check using 5 positive place invariants in 2 ms returned sat
[2022-06-02 18:47:50] [INFO ] After 249ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2022-06-02 18:47:50] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-06-02 18:47:50] [INFO ] After 102ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2022-06-02 18:47:50] [INFO ] After 188ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 116 ms.
[2022-06-02 18:47:50] [INFO ] After 591ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
[2022-06-02 18:47:50] [INFO ] Flatten gal took : 20 ms
[2022-06-02 18:47:50] [INFO ] Flatten gal took : 19 ms
[2022-06-02 18:47:50] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality13149751267439716946.gal : 2 ms
[2022-06-02 18:47:50] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality1089473543186105958.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality13149751267439716946.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality1089473543186105958.prop' '--nowitness' '--gen-order' 'FOLLOW'
its-reach command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp...320
Loading property file /tmp/ReachabilityCardinality1089473543186105958.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 4
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :4 after 15
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :15 after 29
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :29 after 55
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :55 after 105
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :105 after 369
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :369 after 2480
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :2480 after 35464
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :35464 after 322400
SDD proceeding with computation,2 properties remain. new max is 2048
SDD size :322400 after 2.65608e+06
Invariant property BridgeAndVehicles-PT-V50P50N20-ReachabilityCardinality-07 does not hold.
Reachability property BridgeAndVehicles-PT-V50P50N20-ReachabilityCardinality-04 is true.
Found states matching all0 target predicate
Will report total states built up to this point. Computation was interrupted after 2049 fixpoint passes
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst,1.04429e+07,1.33412,28792,2,10122,17,92222,6,0,825,46343,0
Total reachable state count : 10442908
Verifying 2 reachability properties.
Reachability property BridgeAndVehicles-PT-V50P50N20-ReachabilityCardinality-04 is true.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
BridgeAndVehicles-PT-V50P50N20-ReachabilityCardinality-04,124,1.55154,28792,2,289,17,92222,7,0,991,46343,0
Invariant property BridgeAndVehicles-PT-V50P50N20-ReachabilityCardinality-07 does not hold.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
BridgeAndVehicles-PT-V50P50N20-ReachabilityCardinality-07,20,1.55275,28792,2,156,17,92222,8,0,1001,46343,0
[2022-06-02 18:47:52] [INFO ] Flatten gal took : 105 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin2278717505418871550
[2022-06-02 18:47:52] [INFO ] Too many transitions (2348) to apply POR reductions. Disabling POR matrices.
[2022-06-02 18:47:52] [INFO ] Built C files in 86ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2278717505418871550
[2022-06-02 18:47:52] [INFO ] Applying decomposition
[2022-06-02 18:47:52] [INFO ] Flatten gal took : 125 ms
Running compilation step : cd /tmp/ltsmin2278717505418871550;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '360' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
[2022-06-02 18:47:52] [INFO ] Flatten gal took : 102 ms
[2022-06-02 18:47:52] [INFO ] Input system was already deterministic with 2348 transitions.
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph2640763890361369033.txt' '-o' '/tmp/graph2640763890361369033.bin' '-w' '/tmp/graph2640763890361369033.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph2640763890361369033.bin' '-l' '-1' '-v' '-w' '/tmp/graph2640763890361369033.weights' '-q' '0' '-e' '0.001'
[2022-06-02 18:47:53] [INFO ] Decomposing Gal with order
[2022-06-02 18:47:53] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-06-02 18:47:54] [INFO ] Ran tautology test, simplified 0 / 2 in 1396 ms.
[2022-06-02 18:47:54] [INFO ] BMC solution for property BridgeAndVehicles-PT-V50P50N20-ReachabilityCardinality-04(UNSAT) depth K=0 took 27 ms
[2022-06-02 18:47:54] [INFO ] BMC solution for property BridgeAndVehicles-PT-V50P50N20-ReachabilityCardinality-07(UNSAT) depth K=0 took 1 ms
[2022-06-02 18:47:54] [INFO ] BMC solution for property BridgeAndVehicles-PT-V50P50N20-ReachabilityCardinality-04(UNSAT) depth K=1 took 14 ms
[2022-06-02 18:47:54] [INFO ] BMC solution for property BridgeAndVehicles-PT-V50P50N20-ReachabilityCardinality-07(UNSAT) depth K=1 took 1 ms
[2022-06-02 18:47:54] [INFO ] BMC solution for property BridgeAndVehicles-PT-V50P50N20-ReachabilityCardinality-04(UNSAT) depth K=2 took 80 ms
[2022-06-02 18:47:54] [INFO ] BMC solution for property BridgeAndVehicles-PT-V50P50N20-ReachabilityCardinality-07(UNSAT) depth K=2 took 281 ms
[2022-06-02 18:47:54] [INFO ] BMC solution for property BridgeAndVehicles-PT-V50P50N20-ReachabilityCardinality-04(UNSAT) depth K=3 took 397 ms
Presburger conditions satisfied. Using coverability to approximate state space in K-Induction.
Normalized transition count is 290 out of 2348 initially.
// Phase 1: matrix 290 rows 134 cols
[2022-06-02 18:47:55] [INFO ] Computed 5 place invariants in 3 ms
[2022-06-02 18:47:55] [INFO ] Computed 5 place invariants in 3 ms
[2022-06-02 18:47:55] [INFO ] BMC solution for property BridgeAndVehicles-PT-V50P50N20-ReachabilityCardinality-07(UNSAT) depth K=3 took 801 ms
[2022-06-02 18:47:55] [INFO ] Proved 134 variables to be positive in 720 ms
[2022-06-02 18:47:55] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesBridgeAndVehicles-PT-V50P50N20-ReachabilityCardinality-04
[2022-06-02 18:47:55] [INFO ] KInduction solution for property BridgeAndVehicles-PT-V50P50N20-ReachabilityCardinality-04(SAT) depth K=0 took 16 ms
[2022-06-02 18:47:55] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesBridgeAndVehicles-PT-V50P50N20-ReachabilityCardinality-07
[2022-06-02 18:47:55] [INFO ] KInduction solution for property BridgeAndVehicles-PT-V50P50N20-ReachabilityCardinality-07(SAT) depth K=0 took 7 ms
[2022-06-02 18:47:56] [INFO ] Removed a total of 4478 redundant transitions.
[2022-06-02 18:47:56] [INFO ] Flatten gal took : 2797 ms
[2022-06-02 18:47:57] [INFO ] Fuse similar labels procedure discarded/fused a total of 2576 labels/synchronizations in 401 ms.
[2022-06-02 18:47:57] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality3614102348211258390.gal : 20 ms
[2022-06-02 18:47:57] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality9215868016646076332.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality3614102348211258390.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality9215868016646076332.prop' '--nowitness' '--gen-order' 'FOLLOW'
its-reach command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp...319
Loading property file /tmp/ReachabilityCardinality9215868016646076332.prop.
[2022-06-02 18:47:57] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesBridgeAndVehicles-PT-V50P50N20-ReachabilityCardinality-04
[2022-06-02 18:47:57] [INFO ] KInduction solution for property BridgeAndVehicles-PT-V50P50N20-ReachabilityCardinality-04(SAT) depth K=1 took 1723 ms
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 5
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :5 after 10
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :10 after 19
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :19 after 36
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :36 after 67
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :67 after 1256
[2022-06-02 18:47:58] [INFO ] BMC solution for property BridgeAndVehicles-PT-V50P50N20-ReachabilityCardinality-04(UNSAT) depth K=4 took 2647 ms
Compilation finished in 7420 ms.
Running link step : cd /tmp/ltsmin2278717505418871550;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 49 ms.
Running LTSmin : cd /tmp/ltsmin2278717505418871550;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '-i' 'BridgeAndVehiclesPTV50P50N20ReachabilityCardinality04==true'
[2022-06-02 18:48:02] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesBridgeAndVehicles-PT-V50P50N20-ReachabilityCardinality-07
[2022-06-02 18:48:02] [INFO ] KInduction solution for property BridgeAndVehicles-PT-V50P50N20-ReachabilityCardinality-07(SAT) depth K=1 took 5276 ms
[2022-06-02 18:48:10] [INFO ] BMC solution for property BridgeAndVehicles-PT-V50P50N20-ReachabilityCardinality-07(UNSAT) depth K=4 took 11643 ms
[2022-06-02 18:48:13] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesBridgeAndVehicles-PT-V50P50N20-ReachabilityCardinality-04
[2022-06-02 18:48:13] [INFO ] KInduction solution for property BridgeAndVehicles-PT-V50P50N20-ReachabilityCardinality-04(SAT) depth K=2 took 10533 ms
[2022-06-02 18:48:32] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesBridgeAndVehicles-PT-V50P50N20-ReachabilityCardinality-07
[2022-06-02 18:48:32] [INFO ] KInduction solution for property BridgeAndVehicles-PT-V50P50N20-ReachabilityCardinality-07(SAT) depth K=2 took 19326 ms
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :1256 after 20656
[2022-06-02 18:48:50] [INFO ] BMC solution for property BridgeAndVehicles-PT-V50P50N20-ReachabilityCardinality-04(UNSAT) depth K=5 took 40799 ms
[2022-06-02 18:49:28] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesBridgeAndVehicles-PT-V50P50N20-ReachabilityCardinality-04
[2022-06-02 18:49:28] [INFO ] KInduction solution for property BridgeAndVehicles-PT-V50P50N20-ReachabilityCardinality-04(SAT) depth K=3 took 55771 ms
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :52512 after 62660
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :62660 after 68394
[2022-06-02 18:49:45] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesBridgeAndVehicles-PT-V50P50N20-ReachabilityCardinality-07
[2022-06-02 18:49:45] [INFO ] KInduction solution for property BridgeAndVehicles-PT-V50P50N20-ReachabilityCardinality-07(SAT) depth K=3 took 16909 ms
[2022-06-02 18:49:59] [INFO ] BMC solution for property BridgeAndVehicles-PT-V50P50N20-ReachabilityCardinality-07(UNSAT) depth K=5 took 68255 ms
[2022-06-02 18:50:37] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesBridgeAndVehicles-PT-V50P50N20-ReachabilityCardinality-04
[2022-06-02 18:50:37] [INFO ] KInduction solution for property BridgeAndVehicles-PT-V50P50N20-ReachabilityCardinality-04(SAT) depth K=4 took 51516 ms
[2022-06-02 18:51:16] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesBridgeAndVehicles-PT-V50P50N20-ReachabilityCardinality-07
[2022-06-02 18:51:16] [INFO ] KInduction solution for property BridgeAndVehicles-PT-V50P50N20-ReachabilityCardinality-07(SAT) depth K=4 took 39382 ms
[2022-06-02 18:51:42] [INFO ] BMC solution for property BridgeAndVehicles-PT-V50P50N20-ReachabilityCardinality-04(UNSAT) depth K=6 took 103037 ms
SDD proceeding with computation,2 properties remain. new max is 2048
SDD size :810364 after 1.17124e+06
[2022-06-02 18:53:23] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesBridgeAndVehicles-PT-V50P50N20-ReachabilityCardinality-04
[2022-06-02 18:53:23] [INFO ] KInduction solution for property BridgeAndVehicles-PT-V50P50N20-ReachabilityCardinality-04(SAT) depth K=5 took 127125 ms
[2022-06-02 18:54:13] [INFO ] BMC solution for property BridgeAndVehicles-PT-V50P50N20-ReachabilityCardinality-07(UNSAT) depth K=6 took 151296 ms
SDD proceeding with computation,2 properties remain. new max is 4096
SDD size :2.1973e+07 after 2.24979e+07
[2022-06-02 18:57:22] [INFO ] BMC solution for property BridgeAndVehicles-PT-V50P50N20-ReachabilityCardinality-04(UNSAT) depth K=7 took 188504 ms
[2022-06-02 18:58:24] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesBridgeAndVehicles-PT-V50P50N20-ReachabilityCardinality-07
[2022-06-02 18:58:24] [INFO ] KInduction solution for property BridgeAndVehicles-PT-V50P50N20-ReachabilityCardinality-07(SAT) depth K=5 took 301395 ms
[2022-06-02 19:01:24] [INFO ] BMC solution for property BridgeAndVehicles-PT-V50P50N20-ReachabilityCardinality-07(UNSAT) depth K=7 took 242653 ms
SDD proceeding with computation,2 properties remain. new max is 8192
SDD size :1.2919e+08 after 1.30123e+08
[2022-06-02 19:05:00] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesBridgeAndVehicles-PT-V50P50N20-ReachabilityCardinality-04
[2022-06-02 19:05:00] [INFO ] KInduction solution for property BridgeAndVehicles-PT-V50P50N20-ReachabilityCardinality-04(SAT) depth K=6 took 395622 ms
[2022-06-02 19:08:15] [INFO ] BMC solution for property BridgeAndVehicles-PT-V50P50N20-ReachabilityCardinality-04(UNSAT) depth K=8 took 410481 ms
Detected timeout of ITS tools.
[2022-06-02 19:10:16] [INFO ] Flatten gal took : 274 ms
[2022-06-02 19:10:16] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality17683456311128377127.gal : 34 ms
[2022-06-02 19:10:16] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality7786071626729555296.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality17683456311128377127.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality7786071626729555296.prop' '--nowitness' '--gen-order' 'FOLLOW'
its-reach command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp...320
Loading property file /tmp/ReachabilityCardinality7786071626729555296.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 5
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :5 after 20
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :20 after 47
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :47 after 98
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :98 after 2432
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :2432 after 12867
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :12867 after 12931
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :12931 after 13058
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :13058 after 13312
SDD proceeding with computation,2 properties remain. new max is 2048
SDD size :13312 after 13820
[2022-06-02 19:13:20] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesBridgeAndVehicles-PT-V50P50N20-ReachabilityCardinality-07
[2022-06-02 19:13:20] [INFO ] KInduction solution for property BridgeAndVehicles-PT-V50P50N20-ReachabilityCardinality-07(SAT) depth K=6 took 499899 ms
SDD proceeding with computation,2 properties remain. new max is 4096
SDD size :13820 after 14835
[2022-06-02 19:13:51] [INFO ] BMC solution for property BridgeAndVehicles-PT-V50P50N20-ReachabilityCardinality-07(UNSAT) depth K=8 took 336635 ms
SDD proceeding with computation,2 properties remain. new max is 8192
SDD size :14835 after 18110
WARNING : LTSmin timed out (>1800 s) on command cd /tmp/ltsmin2278717505418871550;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '-i' 'BridgeAndVehiclesPTV50P50N20ReachabilityCardinality04==true'
Running LTSmin : cd /tmp/ltsmin2278717505418871550;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '-i' 'BridgeAndVehiclesPTV50P50N20ReachabilityCardinality07==true'
SDD proceeding with computation,2 properties remain. new max is 16384
SDD size :18110 after 33051
[2022-06-02 19:21:54] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesBridgeAndVehicles-PT-V50P50N20-ReachabilityCardinality-04
[2022-06-02 19:21:54] [INFO ] KInduction solution for property BridgeAndVehicles-PT-V50P50N20-ReachabilityCardinality-04(SAT) depth K=7 took 513703 ms
[2022-06-02 19:22:22] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesBridgeAndVehicles-PT-V50P50N20-ReachabilityCardinality-07
[2022-06-02 19:22:22] [INFO ] KInduction solution for property BridgeAndVehicles-PT-V50P50N20-ReachabilityCardinality-07(SAT) depth K=7 took 27993 ms
[2022-06-02 19:24:17] [INFO ] BMC solution for property BridgeAndVehicles-PT-V50P50N20-ReachabilityCardinality-04(UNSAT) depth K=9 took 625655 ms
[2022-06-02 19:32:13] [INFO ] BMC solution for property BridgeAndVehicles-PT-V50P50N20-ReachabilityCardinality-07(UNSAT) depth K=9 took 475690 ms
[2022-06-02 19:32:31] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesBridgeAndVehicles-PT-V50P50N20-ReachabilityCardinality-04
[2022-06-02 19:32:31] [INFO ] KInduction solution for property BridgeAndVehicles-PT-V50P50N20-ReachabilityCardinality-04(SAT) depth K=8 took 609496 ms
Detected timeout of ITS tools.
[2022-06-02 19:32:35] [INFO ] Flatten gal took : 287 ms
[2022-06-02 19:32:35] [INFO ] Input system was already deterministic with 2348 transitions.
[2022-06-02 19:32:35] [INFO ] Transformed 134 places.
[2022-06-02 19:32:35] [INFO ] Transformed 2348 transitions.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//greatspn//bin/pinvar' '/home/mcc/execution/gspn'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//greatspn//bin/RGMEDD2' '/home/mcc/execution/gspn' '-META' '-varord-only'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2022-06-02 19:32:35] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality12621693975614879064.gal : 51 ms
[2022-06-02 19:32:35] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality15974850127359777856.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality12621693975614879064.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality15974850127359777856.prop' '--nowitness' '--load-order' '/home/mcc/execution/model.ord' '--gen-order' 'FOLLOW'
its-reach command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp...366
Successfully loaded order from file /home/mcc/execution/model.ord
Loading property file /tmp/ReachabilityCardinality15974850127359777856.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 5
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :5 after 10
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :10 after 19
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :19 after 36
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :36 after 51
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :51 after 2601
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :5202 after 18051
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :18051 after 33136
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :33136 after 69868
SDD proceeding with computation,2 properties remain. new max is 2048
SDD size :69868 after 182356
[2022-06-02 19:33:43] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesBridgeAndVehicles-PT-V50P50N20-ReachabilityCardinality-07
[2022-06-02 19:33:43] [INFO ] KInduction solution for property BridgeAndVehicles-PT-V50P50N20-ReachabilityCardinality-07(SAT) depth K=8 took 71557 ms
SDD proceeding with computation,2 properties remain. new max is 4096
SDD size :182356 after 641932
BK_TIME_CONFINEMENT_REACHED
--------------------
content from stderr:
+ export LANG=C
+ LANG=C
+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ ReachabilityCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution ReachabilityCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ export PYTHONPATH=/usr/lib/python3.9/site-packages/
+ PYTHONPATH=/usr/lib/python3.9/site-packages/
+ export LD_LIBRARY_PATH=/usr/local/lib:
+ LD_LIBRARY_PATH=/usr/local/lib:
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202205111006.jar
+ VERSION=202205111006
+ echo 'Running Version 202205111006'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data @none -pnfolder /home/mcc/execution -examination ReachabilityCardinality -spotpath /home/mcc/BenchKit/bin//..//ltlfilt -z3path /home/mcc/BenchKit/bin//..//z3/bin/z3 -yices2path /home/mcc/BenchKit/bin//..//yices/bin/yices -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=@none -Xss128m -Xms40m -Xmx8192m
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="BridgeAndVehicles-PT-V50P50N20"
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-4028"
echo " Executing tool itstools"
echo " Input is BridgeAndVehicles-PT-V50P50N20, 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 r024-tall-165251918300262"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/BridgeAndVehicles-PT-V50P50N20.tgz
mv BridgeAndVehicles-PT-V50P50N20 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 '
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 ;