About the Execution of ITS-Tools for ShieldPPPt-PT-050B
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
10654.344 | 3600000.00 | 8645387.00 | 8657.00 | FTTTFFTFTT?FTTT? | 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.r222-tall-165286025600686.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 ShieldPPPt-PT-050B, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r222-tall-165286025600686
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.4M
-rw-r--r-- 1 mcc users 7.7K Apr 29 13:38 CTLCardinality.txt
-rw-r--r-- 1 mcc users 82K Apr 29 13:38 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.3K Apr 29 13:38 CTLFireability.txt
-rw-r--r-- 1 mcc users 61K Apr 29 13:38 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:34 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K May 10 09:34 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.5K May 9 08:56 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K May 9 08:56 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K May 9 08:56 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K May 9 08:56 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.6K Apr 29 13:39 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 84K Apr 29 13:39 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Apr 29 13:38 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 94K Apr 29 13:38 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K May 9 08:56 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K May 9 08:56 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 10 09:34 equiv_col
-rw-r--r-- 1 mcc users 5 May 10 09:34 instance
-rw-r--r-- 1 mcc users 6 May 10 09:34 iscolored
-rw-r--r-- 1 mcc users 955K May 10 09:34 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 ShieldPPPt-PT-050B-ReachabilityCardinality-00
FORMULA_NAME ShieldPPPt-PT-050B-ReachabilityCardinality-01
FORMULA_NAME ShieldPPPt-PT-050B-ReachabilityCardinality-02
FORMULA_NAME ShieldPPPt-PT-050B-ReachabilityCardinality-03
FORMULA_NAME ShieldPPPt-PT-050B-ReachabilityCardinality-04
FORMULA_NAME ShieldPPPt-PT-050B-ReachabilityCardinality-05
FORMULA_NAME ShieldPPPt-PT-050B-ReachabilityCardinality-06
FORMULA_NAME ShieldPPPt-PT-050B-ReachabilityCardinality-07
FORMULA_NAME ShieldPPPt-PT-050B-ReachabilityCardinality-08
FORMULA_NAME ShieldPPPt-PT-050B-ReachabilityCardinality-09
FORMULA_NAME ShieldPPPt-PT-050B-ReachabilityCardinality-10
FORMULA_NAME ShieldPPPt-PT-050B-ReachabilityCardinality-11
FORMULA_NAME ShieldPPPt-PT-050B-ReachabilityCardinality-12
FORMULA_NAME ShieldPPPt-PT-050B-ReachabilityCardinality-13
FORMULA_NAME ShieldPPPt-PT-050B-ReachabilityCardinality-14
FORMULA_NAME ShieldPPPt-PT-050B-ReachabilityCardinality-15
=== Now, execution of the tool begins
BK_START 1654276992758
Running Version 202205111006
[2022-06-03 17:23:13] [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-03 17:23:14] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-06-03 17:23:14] [INFO ] Load time of PNML (sax parser for PT used): 215 ms
[2022-06-03 17:23:14] [INFO ] Transformed 3903 places.
[2022-06-03 17:23:14] [INFO ] Transformed 3553 transitions.
[2022-06-03 17:23:14] [INFO ] Found NUPN structural information;
[2022-06-03 17:23:14] [INFO ] Parsed PT model containing 3903 places and 3553 transitions in 496 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 18 ms.
Working with output stream class java.io.PrintStream
FORMULA ShieldPPPt-PT-050B-ReachabilityCardinality-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPt-PT-050B-ReachabilityCardinality-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 2 resets, run finished after 667 ms. (steps per millisecond=14 ) properties (out of 14) seen :2
FORMULA ShieldPPPt-PT-050B-ReachabilityCardinality-14 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPt-PT-050B-ReachabilityCardinality-13 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 12) seen :0
Running SMT prover for 12 properties.
// Phase 1: matrix 3553 rows 3903 cols
[2022-06-03 17:23:15] [INFO ] Computed 551 place invariants in 53 ms
[2022-06-03 17:23:17] [INFO ] After 1554ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:12
[2022-06-03 17:23:18] [INFO ] [Nat]Absence check using 551 positive place invariants in 263 ms returned sat
[2022-06-03 17:23:22] [INFO ] After 2913ms SMT Verify possible using state equation in natural domain returned unsat :5 sat :7
[2022-06-03 17:23:23] [INFO ] Deduced a trap composed of 23 places in 1224 ms of which 17 ms to minimize.
[2022-06-03 17:23:24] [INFO ] Deduced a trap composed of 25 places in 1371 ms of which 7 ms to minimize.
[2022-06-03 17:23:26] [INFO ] Deduced a trap composed of 22 places in 1182 ms of which 6 ms to minimize.
[2022-06-03 17:23:27] [INFO ] Deduced a trap composed of 22 places in 1185 ms of which 3 ms to minimize.
[2022-06-03 17:23:28] [INFO ] Deduced a trap composed of 40 places in 1229 ms of which 6 ms to minimize.
[2022-06-03 17:23:30] [INFO ] Deduced a trap composed of 21 places in 1198 ms of which 5 ms to minimize.
[2022-06-03 17:23:31] [INFO ] Deduced a trap composed of 48 places in 1162 ms of which 2 ms to minimize.
[2022-06-03 17:23:32] [INFO ] Deduced a trap composed of 41 places in 1165 ms of which 3 ms to minimize.
[2022-06-03 17:23:34] [INFO ] Deduced a trap composed of 48 places in 1157 ms of which 3 ms to minimize.
[2022-06-03 17:23:35] [INFO ] Deduced a trap composed of 51 places in 1107 ms of which 2 ms to minimize.
[2022-06-03 17:23:36] [INFO ] Deduced a trap composed of 23 places in 1117 ms of which 2 ms to minimize.
[2022-06-03 17:23:37] [INFO ] Deduced a trap composed of 23 places in 1106 ms of which 3 ms to minimize.
[2022-06-03 17:23:39] [INFO ] Deduced a trap composed of 19 places in 1099 ms of which 2 ms to minimize.
[2022-06-03 17:23:40] [INFO ] Deduced a trap composed of 20 places in 1085 ms of which 2 ms to minimize.
[2022-06-03 17:23:41] [INFO ] Deduced a trap composed of 37 places in 1053 ms of which 3 ms to minimize.
[2022-06-03 17:23:42] [INFO ] Deduced a trap composed of 27 places in 1080 ms of which 3 ms to minimize.
[2022-06-03 17:23:42] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2022-06-03 17:23:42] [INFO ] After 25234ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:12
FORMULA ShieldPPPt-PT-050B-ReachabilityCardinality-12 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA ShieldPPPt-PT-050B-ReachabilityCardinality-06 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA ShieldPPPt-PT-050B-ReachabilityCardinality-03 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA ShieldPPPt-PT-050B-ReachabilityCardinality-02 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA ShieldPPPt-PT-050B-ReachabilityCardinality-01 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 12 Parikh solutions to 6 different solutions.
FORMULA ShieldPPPt-PT-050B-ReachabilityCardinality-04 FALSE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Parikh walk visited 1 properties in 36422 ms.
Support contains 11 out of 3903 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 3903/3903 places, 3553/3553 transitions.
Drop transitions removed 946 transitions
Trivial Post-agglo rules discarded 946 transitions
Performed 946 trivial Post agglomeration. Transition count delta: 946
Iterating post reduction 0 with 946 rules applied. Total rules applied 946 place count 3903 transition count 2607
Reduce places removed 946 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 948 rules applied. Total rules applied 1894 place count 2957 transition count 2605
Reduce places removed 1 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 2 with 4 rules applied. Total rules applied 1898 place count 2956 transition count 2602
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 1901 place count 2953 transition count 2602
Performed 200 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 200 Pre rules applied. Total rules applied 1901 place count 2953 transition count 2402
Deduced a syphon composed of 200 places in 6 ms
Reduce places removed 200 places and 0 transitions.
Iterating global reduction 4 with 400 rules applied. Total rules applied 2301 place count 2753 transition count 2402
Discarding 347 places :
Symmetric choice reduction at 4 with 347 rule applications. Total rules 2648 place count 2406 transition count 2055
Iterating global reduction 4 with 347 rules applied. Total rules applied 2995 place count 2406 transition count 2055
Performed 148 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 148 Pre rules applied. Total rules applied 2995 place count 2406 transition count 1907
Deduced a syphon composed of 148 places in 14 ms
Reduce places removed 148 places and 0 transitions.
Iterating global reduction 4 with 296 rules applied. Total rules applied 3291 place count 2258 transition count 1907
Performed 848 Post agglomeration using F-continuation condition.Transition count delta: 848
Deduced a syphon composed of 848 places in 3 ms
Reduce places removed 848 places and 0 transitions.
Iterating global reduction 4 with 1696 rules applied. Total rules applied 4987 place count 1410 transition count 1059
Renaming transitions due to excessive name length > 1024 char.
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 101 places in 2 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 4 with 202 rules applied. Total rules applied 5189 place count 1309 transition count 1059
Performed 46 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 46 places in 4 ms
Reduce places removed 46 places and 0 transitions.
Iterating global reduction 4 with 92 rules applied. Total rules applied 5281 place count 1263 transition count 1059
Free-agglomeration rule applied 1 times.
Iterating global reduction 4 with 1 rules applied. Total rules applied 5282 place count 1263 transition count 1058
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 5283 place count 1262 transition count 1058
Partial Free-agglomeration rule applied 147 times.
Drop transitions removed 147 transitions
Iterating global reduction 5 with 147 rules applied. Total rules applied 5430 place count 1262 transition count 1058
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 5431 place count 1261 transition count 1057
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 5432 place count 1260 transition count 1057
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 2 Pre rules applied. Total rules applied 5432 place count 1260 transition count 1055
Deduced a syphon composed of 2 places in 2 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 6 with 4 rules applied. Total rules applied 5436 place count 1258 transition count 1055
Applied a total of 5436 rules in 1482 ms. Remains 1258 /3903 variables (removed 2645) and now considering 1055/3553 (removed 2498) transitions.
Finished structural reductions, in 1 iterations. Remains : 1258/3903 places, 1055/3553 transitions.
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 14536 ms. (steps per millisecond=68 ) properties (out of 6) seen :4
FORMULA ShieldPPPt-PT-050B-ReachabilityCardinality-09 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPt-PT-050B-ReachabilityCardinality-08 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPt-PT-050B-ReachabilityCardinality-07 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPt-PT-050B-ReachabilityCardinality-05 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Interrupted Best-First random walk after 822841 steps, including 2 resets, run timeout after 5001 ms. (steps per millisecond=164 ) properties seen 0
Interrupted Best-First random walk after 828756 steps, including 2 resets, run timeout after 5001 ms. (steps per millisecond=165 ) properties seen 0
Running SMT prover for 2 properties.
// Phase 1: matrix 1055 rows 1258 cols
[2022-06-03 17:24:45] [INFO ] Computed 550 place invariants in 9 ms
[2022-06-03 17:24:45] [INFO ] After 179ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2022-06-03 17:24:45] [INFO ] [Nat]Absence check using 550 positive place invariants in 87 ms returned sat
[2022-06-03 17:24:46] [INFO ] After 482ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2022-06-03 17:24:46] [INFO ] State equation strengthened by 4 read => feed constraints.
[2022-06-03 17:24:46] [INFO ] After 86ms SMT Verify possible using 4 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2022-06-03 17:24:46] [INFO ] After 229ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 87 ms.
[2022-06-03 17:24:46] [INFO ] After 1086ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 1510 ms.
Support contains 3 out of 1258 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 1258/1258 places, 1055/1055 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 1258 transition count 1053
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 1256 transition count 1053
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 4 place count 1256 transition count 1052
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 6 place count 1255 transition count 1052
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 2 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 12 place count 1252 transition count 1049
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 14 place count 1251 transition count 1049
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 15 place count 1250 transition count 1048
Applied a total of 15 rules in 294 ms. Remains 1250 /1258 variables (removed 8) and now considering 1048/1055 (removed 7) transitions.
Finished structural reductions, in 1 iterations. Remains : 1250/1258 places, 1048/1055 transitions.
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 12642 ms. (steps per millisecond=79 ) properties (out of 2) seen :0
Interrupted Best-First random walk after 837273 steps, including 2 resets, run timeout after 5001 ms. (steps per millisecond=167 ) properties seen 0
Interrupted Best-First random walk after 826919 steps, including 2 resets, run timeout after 5001 ms. (steps per millisecond=165 ) properties seen 0
Interrupted probabilistic random walk after 3100338 steps, run timeout after 66001 ms. (steps per millisecond=46 ) properties seen :{}
Probabilistic random walk after 3100338 steps, saw 2519886 distinct states, run finished after 66002 ms. (steps per millisecond=46 ) properties seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 1048 rows 1250 cols
[2022-06-03 17:26:16] [INFO ] Computed 550 place invariants in 10 ms
[2022-06-03 17:26:17] [INFO ] After 167ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2022-06-03 17:26:17] [INFO ] [Nat]Absence check using 550 positive place invariants in 79 ms returned sat
[2022-06-03 17:26:17] [INFO ] After 459ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2022-06-03 17:26:17] [INFO ] State equation strengthened by 2 read => feed constraints.
[2022-06-03 17:26:17] [INFO ] After 81ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2022-06-03 17:26:18] [INFO ] After 228ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 85 ms.
[2022-06-03 17:26:18] [INFO ] After 1047ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 1289 ms.
Support contains 3 out of 1250 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 1250/1250 places, 1048/1048 transitions.
Applied a total of 0 rules in 29 ms. Remains 1250 /1250 variables (removed 0) and now considering 1048/1048 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 1250/1250 places, 1048/1048 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 1250/1250 places, 1048/1048 transitions.
Applied a total of 0 rules in 29 ms. Remains 1250 /1250 variables (removed 0) and now considering 1048/1048 (removed 0) transitions.
// Phase 1: matrix 1048 rows 1250 cols
[2022-06-03 17:26:19] [INFO ] Computed 550 place invariants in 8 ms
[2022-06-03 17:26:20] [INFO ] Implicit Places using invariants in 722 ms returned [1233, 1237]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 724 ms to find 2 implicit places.
Starting structural reductions in SAFETY mode, iteration 1 : 1248/1250 places, 1048/1048 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 1246 transition count 1046
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 1246 transition count 1046
Applied a total of 4 rules in 52 ms. Remains 1246 /1248 variables (removed 2) and now considering 1046/1048 (removed 2) transitions.
// Phase 1: matrix 1046 rows 1246 cols
[2022-06-03 17:26:20] [INFO ] Computed 548 place invariants in 6 ms
[2022-06-03 17:26:20] [INFO ] Implicit Places using invariants in 698 ms returned []
// Phase 1: matrix 1046 rows 1246 cols
[2022-06-03 17:26:20] [INFO ] Computed 548 place invariants in 4 ms
[2022-06-03 17:26:22] [INFO ] Implicit Places using invariants and state equation in 1387 ms returned []
Implicit Place search using SMT with State Equation took 2089 ms to find 0 implicit places.
Starting structural reductions in SAFETY mode, iteration 2 : 1246/1250 places, 1046/1048 transitions.
Finished structural reductions, in 2 iterations. Remains : 1246/1250 places, 1046/1048 transitions.
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 13880 ms. (steps per millisecond=72 ) properties (out of 2) seen :0
Interrupted Best-First random walk after 807262 steps, including 2 resets, run timeout after 5001 ms. (steps per millisecond=161 ) properties seen 0
Interrupted Best-First random walk after 826437 steps, including 2 resets, run timeout after 5001 ms. (steps per millisecond=165 ) properties seen 0
Interrupted probabilistic random walk after 3351623 steps, run timeout after 69001 ms. (steps per millisecond=48 ) properties seen :{}
Probabilistic random walk after 3351623 steps, saw 2708065 distinct states, run finished after 69001 ms. (steps per millisecond=48 ) properties seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 1046 rows 1246 cols
[2022-06-03 17:27:55] [INFO ] Computed 548 place invariants in 6 ms
[2022-06-03 17:27:55] [INFO ] After 166ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2022-06-03 17:27:55] [INFO ] [Nat]Absence check using 548 positive place invariants in 87 ms returned sat
[2022-06-03 17:27:56] [INFO ] After 554ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2022-06-03 17:27:56] [INFO ] After 727ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 88 ms.
[2022-06-03 17:27:56] [INFO ] After 1118ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 1339 ms.
Support contains 3 out of 1246 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 1246/1246 places, 1046/1046 transitions.
Applied a total of 0 rules in 31 ms. Remains 1246 /1246 variables (removed 0) and now considering 1046/1046 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 1246/1246 places, 1046/1046 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 1246/1246 places, 1046/1046 transitions.
Applied a total of 0 rules in 28 ms. Remains 1246 /1246 variables (removed 0) and now considering 1046/1046 (removed 0) transitions.
// Phase 1: matrix 1046 rows 1246 cols
[2022-06-03 17:27:57] [INFO ] Computed 548 place invariants in 8 ms
[2022-06-03 17:27:58] [INFO ] Implicit Places using invariants in 682 ms returned []
// Phase 1: matrix 1046 rows 1246 cols
[2022-06-03 17:27:58] [INFO ] Computed 548 place invariants in 2 ms
[2022-06-03 17:27:59] [INFO ] Implicit Places using invariants and state equation in 1386 ms returned []
Implicit Place search using SMT with State Equation took 2071 ms to find 0 implicit places.
[2022-06-03 17:28:00] [INFO ] Redundant transitions in 71 ms returned []
// Phase 1: matrix 1046 rows 1246 cols
[2022-06-03 17:28:00] [INFO ] Computed 548 place invariants in 4 ms
[2022-06-03 17:28:00] [INFO ] Dead Transitions using invariants and state equation in 544 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 1246/1246 places, 1046/1046 transitions.
Incomplete random walk after 100000 steps, including 2 resets, run finished after 1872 ms. (steps per millisecond=53 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
// Phase 1: matrix 1046 rows 1246 cols
[2022-06-03 17:28:02] [INFO ] Computed 548 place invariants in 2 ms
[2022-06-03 17:28:02] [INFO ] After 178ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2022-06-03 17:28:02] [INFO ] [Nat]Absence check using 548 positive place invariants in 94 ms returned sat
[2022-06-03 17:28:03] [INFO ] After 511ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2022-06-03 17:28:03] [INFO ] Deduced a trap composed of 5 places in 95 ms of which 3 ms to minimize.
[2022-06-03 17:28:03] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 181 ms
[2022-06-03 17:28:03] [INFO ] After 880ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 130 ms.
[2022-06-03 17:28:04] [INFO ] After 1353ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 12709 ms. (steps per millisecond=78 ) properties (out of 2) seen :0
Interrupted Best-First random walk after 818717 steps, including 2 resets, run timeout after 5001 ms. (steps per millisecond=163 ) properties seen 0
Interrupted Best-First random walk after 827483 steps, including 2 resets, run timeout after 5001 ms. (steps per millisecond=165 ) properties seen 0
Interrupted probabilistic random walk after 3302668 steps, run timeout after 66797 ms. (steps per millisecond=49 ) properties seen :{}
Probabilistic random walk after 3302668 steps, saw 2668519 distinct states, run finished after 66798 ms. (steps per millisecond=49 ) properties seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 1046 rows 1246 cols
[2022-06-03 17:29:33] [INFO ] Computed 548 place invariants in 4 ms
[2022-06-03 17:29:33] [INFO ] After 169ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2022-06-03 17:29:33] [INFO ] [Nat]Absence check using 548 positive place invariants in 83 ms returned sat
[2022-06-03 17:29:34] [INFO ] After 482ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2022-06-03 17:29:34] [INFO ] After 640ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 84 ms.
[2022-06-03 17:29:34] [INFO ] After 1008ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 1125 ms.
Support contains 3 out of 1246 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 1246/1246 places, 1046/1046 transitions.
Applied a total of 0 rules in 28 ms. Remains 1246 /1246 variables (removed 0) and now considering 1046/1046 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 1246/1246 places, 1046/1046 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 1246/1246 places, 1046/1046 transitions.
Applied a total of 0 rules in 27 ms. Remains 1246 /1246 variables (removed 0) and now considering 1046/1046 (removed 0) transitions.
// Phase 1: matrix 1046 rows 1246 cols
[2022-06-03 17:29:35] [INFO ] Computed 548 place invariants in 4 ms
[2022-06-03 17:29:36] [INFO ] Implicit Places using invariants in 710 ms returned []
// Phase 1: matrix 1046 rows 1246 cols
[2022-06-03 17:29:36] [INFO ] Computed 548 place invariants in 7 ms
[2022-06-03 17:29:37] [INFO ] Implicit Places using invariants and state equation in 1304 ms returned []
Implicit Place search using SMT with State Equation took 2015 ms to find 0 implicit places.
[2022-06-03 17:29:37] [INFO ] Redundant transitions in 39 ms returned []
// Phase 1: matrix 1046 rows 1246 cols
[2022-06-03 17:29:37] [INFO ] Computed 548 place invariants in 5 ms
[2022-06-03 17:29:38] [INFO ] Dead Transitions using invariants and state equation in 566 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 1246/1246 places, 1046/1046 transitions.
Incomplete random walk after 100000 steps, including 2 resets, run finished after 2089 ms. (steps per millisecond=47 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
// Phase 1: matrix 1046 rows 1246 cols
[2022-06-03 17:29:40] [INFO ] Computed 548 place invariants in 3 ms
[2022-06-03 17:29:40] [INFO ] After 176ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2022-06-03 17:29:41] [INFO ] [Nat]Absence check using 548 positive place invariants in 81 ms returned sat
[2022-06-03 17:29:41] [INFO ] After 510ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2022-06-03 17:29:41] [INFO ] Deduced a trap composed of 5 places in 93 ms of which 1 ms to minimize.
[2022-06-03 17:29:41] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 174 ms
[2022-06-03 17:29:42] [INFO ] After 861ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 133 ms.
[2022-06-03 17:29:42] [INFO ] After 1312ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Incomplete random walk after 10000 steps, including 2 resets, run finished after 75 ms. (steps per millisecond=133 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 189026 steps, run timeout after 3001 ms. (steps per millisecond=62 ) properties seen :{}
Probabilistic random walk after 189026 steps, saw 156800 distinct states, run finished after 3001 ms. (steps per millisecond=62 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 1046 rows 1246 cols
[2022-06-03 17:29:45] [INFO ] Computed 548 place invariants in 7 ms
[2022-06-03 17:29:45] [INFO ] After 136ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-06-03 17:29:45] [INFO ] [Nat]Absence check using 548 positive place invariants in 80 ms returned sat
[2022-06-03 17:29:46] [INFO ] After 427ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-06-03 17:29:46] [INFO ] After 500ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 48 ms.
[2022-06-03 17:29:46] [INFO ] After 787ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 8 ms.
Support contains 1 out of 1246 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 1246/1246 places, 1046/1046 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 1246 transition count 1045
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 1245 transition count 1045
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 1244 transition count 1044
Applied a total of 4 rules in 56 ms. Remains 1244 /1246 variables (removed 2) and now considering 1044/1046 (removed 2) transitions.
Finished structural reductions, in 1 iterations. Remains : 1244/1246 places, 1044/1046 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 77 ms. (steps per millisecond=129 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 185826 steps, run timeout after 3001 ms. (steps per millisecond=61 ) properties seen :{}
Probabilistic random walk after 185826 steps, saw 154203 distinct states, run finished after 3001 ms. (steps per millisecond=61 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 1044 rows 1244 cols
[2022-06-03 17:29:49] [INFO ] Computed 548 place invariants in 10 ms
[2022-06-03 17:29:49] [INFO ] After 137ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-06-03 17:29:49] [INFO ] [Nat]Absence check using 548 positive place invariants in 91 ms returned sat
[2022-06-03 17:29:50] [INFO ] After 425ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-06-03 17:29:50] [INFO ] After 496ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 42 ms.
[2022-06-03 17:29:50] [INFO ] After 782ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 8 ms.
Support contains 1 out of 1244 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 1244/1244 places, 1044/1044 transitions.
Applied a total of 0 rules in 28 ms. Remains 1244 /1244 variables (removed 0) and now considering 1044/1044 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 1244/1244 places, 1044/1044 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 1244/1244 places, 1044/1044 transitions.
Applied a total of 0 rules in 27 ms. Remains 1244 /1244 variables (removed 0) and now considering 1044/1044 (removed 0) transitions.
// Phase 1: matrix 1044 rows 1244 cols
[2022-06-03 17:29:50] [INFO ] Computed 548 place invariants in 3 ms
[2022-06-03 17:29:51] [INFO ] Implicit Places using invariants in 644 ms returned []
// Phase 1: matrix 1044 rows 1244 cols
[2022-06-03 17:29:51] [INFO ] Computed 548 place invariants in 2 ms
[2022-06-03 17:29:52] [INFO ] Implicit Places using invariants and state equation in 1351 ms returned []
Implicit Place search using SMT with State Equation took 1997 ms to find 0 implicit places.
[2022-06-03 17:29:52] [INFO ] Redundant transitions in 13 ms returned []
// Phase 1: matrix 1044 rows 1244 cols
[2022-06-03 17:29:52] [INFO ] Computed 548 place invariants in 2 ms
[2022-06-03 17:29:52] [INFO ] Dead Transitions using invariants and state equation in 553 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 1244/1244 places, 1044/1044 transitions.
Partial Free-agglomeration rule applied 293 times.
Drop transitions removed 293 transitions
Iterating global reduction 0 with 293 rules applied. Total rules applied 293 place count 1244 transition count 1044
Applied a total of 293 rules in 62 ms. Remains 1244 /1244 variables (removed 0) and now considering 1044/1044 (removed 0) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 1044 rows 1244 cols
[2022-06-03 17:29:53] [INFO ] Computed 548 place invariants in 3 ms
[2022-06-03 17:29:53] [INFO ] After 134ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-06-03 17:29:53] [INFO ] [Nat]Absence check using 548 positive place invariants in 77 ms returned sat
[2022-06-03 17:29:53] [INFO ] After 411ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-06-03 17:29:53] [INFO ] State equation strengthened by 286 read => feed constraints.
[2022-06-03 17:29:53] [INFO ] After 163ms SMT Verify possible using 286 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-06-03 17:29:54] [INFO ] Deduced a trap composed of 8 places in 283 ms of which 1 ms to minimize.
[2022-06-03 17:29:54] [INFO ] Deduced a trap composed of 5 places in 255 ms of which 1 ms to minimize.
[2022-06-03 17:29:54] [INFO ] Deduced a trap composed of 5 places in 254 ms of which 1 ms to minimize.
[2022-06-03 17:29:55] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 1034 ms
[2022-06-03 17:29:55] [INFO ] After 1259ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 70 ms.
[2022-06-03 17:29:55] [INFO ] After 1969ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
[2022-06-03 17:29:55] [INFO ] Flatten gal took : 146 ms
[2022-06-03 17:29:55] [INFO ] Flatten gal took : 93 ms
[2022-06-03 17:29:55] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality2719782660404183357.gal : 24 ms
[2022-06-03 17:29:55] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality16942178340683818466.prop : 1 ms
Invoking ITS tools like this :cd /tmp/redAtoms12453042801823985120;'/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/ReachabilityCardinality2719782660404183357.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality16942178340683818466.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/ReachabilityCardinality16942178340683818466.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 5
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :5 after 10
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :10 after 19
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :19 after 36
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 33 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,69,0.629432,14768,2,2114,10,6154,6,0,5878,1616,0
Total reachable state count : 69
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,16,0.632184,15024,2,1443,10,6154,7,0,5881,1616,0
Incomplete random walk after 10000 steps, including 2 resets, run finished after 76 ms. (steps per millisecond=131 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 189264 steps, run timeout after 3001 ms. (steps per millisecond=63 ) properties seen :{}
Probabilistic random walk after 189264 steps, saw 156976 distinct states, run finished after 3001 ms. (steps per millisecond=63 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 1046 rows 1246 cols
[2022-06-03 17:29:59] [INFO ] Computed 548 place invariants in 5 ms
[2022-06-03 17:29:59] [INFO ] [Real]Absence check using 548 positive place invariants in 99 ms returned sat
[2022-06-03 17:30:00] [INFO ] After 437ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2022-06-03 17:30:00] [INFO ] After 522ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 43 ms.
[2022-06-03 17:30:00] [INFO ] After 873ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 8 ms.
Support contains 1 out of 1246 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 1246/1246 places, 1046/1046 transitions.
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 0 with 4 rules applied. Total rules applied 4 place count 1244 transition count 1044
Applied a total of 4 rules in 48 ms. Remains 1244 /1246 variables (removed 2) and now considering 1044/1046 (removed 2) transitions.
Finished structural reductions, in 1 iterations. Remains : 1244/1246 places, 1044/1046 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 75 ms. (steps per millisecond=133 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 185186 steps, run timeout after 3001 ms. (steps per millisecond=61 ) properties seen :{}
Probabilistic random walk after 185186 steps, saw 153863 distinct states, run finished after 3001 ms. (steps per millisecond=61 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 1044 rows 1244 cols
[2022-06-03 17:30:03] [INFO ] Computed 548 place invariants in 5 ms
[2022-06-03 17:30:03] [INFO ] [Real]Absence check using 548 positive place invariants in 81 ms returned sat
[2022-06-03 17:30:04] [INFO ] After 429ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2022-06-03 17:30:04] [INFO ] Deduced a trap composed of 6 places in 104 ms of which 0 ms to minimize.
[2022-06-03 17:30:04] [INFO ] Deduced a trap composed of 6 places in 97 ms of which 1 ms to minimize.
[2022-06-03 17:30:04] [INFO ] Deduced a trap composed of 6 places in 96 ms of which 3 ms to minimize.
[2022-06-03 17:30:04] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 484 ms
[2022-06-03 17:30:04] [INFO ] After 946ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:1
[2022-06-03 17:30:04] [INFO ] After 1182ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-06-03 17:30:04] [INFO ] [Nat]Absence check using 548 positive place invariants in 87 ms returned sat
[2022-06-03 17:30:05] [INFO ] After 452ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-06-03 17:30:05] [INFO ] Deduced a trap composed of 6 places in 92 ms of which 0 ms to minimize.
[2022-06-03 17:30:05] [INFO ] Deduced a trap composed of 6 places in 86 ms of which 1 ms to minimize.
[2022-06-03 17:30:05] [INFO ] Deduced a trap composed of 6 places in 97 ms of which 0 ms to minimize.
[2022-06-03 17:30:05] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 452 ms
[2022-06-03 17:30:05] [INFO ] After 936ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 47 ms.
[2022-06-03 17:30:05] [INFO ] After 1235ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 9 ms.
Support contains 1 out of 1244 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 1244/1244 places, 1044/1044 transitions.
Applied a total of 0 rules in 26 ms. Remains 1244 /1244 variables (removed 0) and now considering 1044/1044 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 1244/1244 places, 1044/1044 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 1244/1244 places, 1044/1044 transitions.
Applied a total of 0 rules in 26 ms. Remains 1244 /1244 variables (removed 0) and now considering 1044/1044 (removed 0) transitions.
// Phase 1: matrix 1044 rows 1244 cols
[2022-06-03 17:30:05] [INFO ] Computed 548 place invariants in 3 ms
[2022-06-03 17:30:06] [INFO ] Implicit Places using invariants in 724 ms returned []
// Phase 1: matrix 1044 rows 1244 cols
[2022-06-03 17:30:06] [INFO ] Computed 548 place invariants in 2 ms
[2022-06-03 17:30:08] [INFO ] Implicit Places using invariants and state equation in 1379 ms returned []
Implicit Place search using SMT with State Equation took 2104 ms to find 0 implicit places.
[2022-06-03 17:30:08] [INFO ] Redundant transitions in 17 ms returned []
// Phase 1: matrix 1044 rows 1244 cols
[2022-06-03 17:30:08] [INFO ] Computed 548 place invariants in 4 ms
[2022-06-03 17:30:08] [INFO ] Dead Transitions using invariants and state equation in 553 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 1244/1244 places, 1044/1044 transitions.
Partial Free-agglomeration rule applied 294 times.
Drop transitions removed 294 transitions
Iterating global reduction 0 with 294 rules applied. Total rules applied 294 place count 1244 transition count 1044
Applied a total of 294 rules in 58 ms. Remains 1244 /1244 variables (removed 0) and now considering 1044/1044 (removed 0) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 1044 rows 1244 cols
[2022-06-03 17:30:08] [INFO ] Computed 548 place invariants in 4 ms
[2022-06-03 17:30:08] [INFO ] [Real]Absence check using 548 positive place invariants in 82 ms returned sat
[2022-06-03 17:30:09] [INFO ] After 682ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-06-03 17:30:09] [INFO ] [Nat]Absence check using 548 positive place invariants in 91 ms returned sat
[2022-06-03 17:30:10] [INFO ] After 427ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-06-03 17:30:10] [INFO ] State equation strengthened by 288 read => feed constraints.
[2022-06-03 17:30:10] [INFO ] After 122ms SMT Verify possible using 288 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-06-03 17:30:10] [INFO ] Deduced a trap composed of 5 places in 254 ms of which 1 ms to minimize.
[2022-06-03 17:30:10] [INFO ] Deduced a trap composed of 5 places in 257 ms of which 2 ms to minimize.
[2022-06-03 17:30:11] [INFO ] Deduced a trap composed of 5 places in 245 ms of which 1 ms to minimize.
[2022-06-03 17:30:11] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 984 ms
[2022-06-03 17:30:11] [INFO ] After 1164ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 66 ms.
[2022-06-03 17:30:11] [INFO ] After 1906ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
[2022-06-03 17:30:11] [INFO ] Flatten gal took : 84 ms
[2022-06-03 17:30:11] [INFO ] Flatten gal took : 60 ms
[2022-06-03 17:30:11] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality3517345168982392434.gal : 10 ms
[2022-06-03 17:30:11] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality14560389161573839355.prop : 2 ms
Invoking ITS tools like this :cd /tmp/redAtoms12453042801823985120;'/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/ReachabilityCardinality3517345168982392434.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality14560389161573839355.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/ReachabilityCardinality14560389161573839355.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 5
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :5 after 10
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :10 after 19
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :19 after 36
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :36 after 69
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :69 after 114
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :114 after 640
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :640 after 33565
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :33565 after 936952
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :936952 after 7.86597e+07
SDD proceeding with computation,1 properties remain. new max is 4096
SDD size :7.86597e+07 after 5.37725e+08
SDD proceeding with computation,1 properties remain. new max is 8192
SDD size :5.37725e+08 after 1.0238e+12
SDD proceeding with computation,1 properties remain. new max is 16384
SDD size :1.0238e+12 after 9.56495e+14
SDD proceeding with computation,1 properties remain. new max is 32768
SDD size :9.56495e+14 after 8.80112e+18
SDD proceeding with computation,1 properties remain. new max is 65536
SDD size :8.80112e+18 after 7.09318e+22
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 65537 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,6.64554e+29,13.3603,297368,2,43548,21,771970,6,0,5878,2.40976e+06,0
Total reachable state count : 664554057792870474402431500288
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,7.82663e+23,13.3843,297368,2,5168,21,771970,7,0,5881,2.40976e+06,0
Incomplete random walk after 10000 steps, including 2 resets, run finished after 79 ms. (steps per millisecond=126 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 181938 steps, run timeout after 3001 ms. (steps per millisecond=60 ) properties seen :{}
Probabilistic random walk after 181938 steps, saw 151047 distinct states, run finished after 3002 ms. (steps per millisecond=60 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 1046 rows 1246 cols
[2022-06-03 17:30:28] [INFO ] Computed 548 place invariants in 15 ms
[2022-06-03 17:30:28] [INFO ] [Real]Absence check using 548 positive place invariants in 83 ms returned sat
[2022-06-03 17:30:28] [INFO ] After 684ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-06-03 17:30:29] [INFO ] [Nat]Absence check using 548 positive place invariants in 85 ms returned sat
[2022-06-03 17:30:29] [INFO ] After 448ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-06-03 17:30:29] [INFO ] Deduced a trap composed of 5 places in 98 ms of which 0 ms to minimize.
[2022-06-03 17:30:29] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 187 ms
[2022-06-03 17:30:29] [INFO ] After 673ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 46 ms.
[2022-06-03 17:30:29] [INFO ] After 970ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 9 ms.
Support contains 1 out of 1246 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 1246/1246 places, 1046/1046 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 1246 transition count 1045
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 1245 transition count 1045
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 1244 transition count 1044
Applied a total of 4 rules in 61 ms. Remains 1244 /1246 variables (removed 2) and now considering 1044/1046 (removed 2) transitions.
Finished structural reductions, in 1 iterations. Remains : 1244/1246 places, 1044/1046 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 78 ms. (steps per millisecond=128 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 184455 steps, run timeout after 3001 ms. (steps per millisecond=61 ) properties seen :{}
Probabilistic random walk after 184455 steps, saw 153114 distinct states, run finished after 3001 ms. (steps per millisecond=61 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 1044 rows 1244 cols
[2022-06-03 17:30:32] [INFO ] Computed 548 place invariants in 3 ms
[2022-06-03 17:30:33] [INFO ] [Real]Absence check using 548 positive place invariants in 86 ms returned sat
[2022-06-03 17:30:33] [INFO ] After 717ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-06-03 17:30:33] [INFO ] [Nat]Absence check using 548 positive place invariants in 86 ms returned sat
[2022-06-03 17:30:34] [INFO ] After 432ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-06-03 17:30:34] [INFO ] After 505ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 47 ms.
[2022-06-03 17:30:34] [INFO ] After 800ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 7 ms.
Support contains 1 out of 1244 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 1244/1244 places, 1044/1044 transitions.
Applied a total of 0 rules in 25 ms. Remains 1244 /1244 variables (removed 0) and now considering 1044/1044 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 1244/1244 places, 1044/1044 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 1244/1244 places, 1044/1044 transitions.
Applied a total of 0 rules in 25 ms. Remains 1244 /1244 variables (removed 0) and now considering 1044/1044 (removed 0) transitions.
// Phase 1: matrix 1044 rows 1244 cols
[2022-06-03 17:30:34] [INFO ] Computed 548 place invariants in 5 ms
[2022-06-03 17:30:35] [INFO ] Implicit Places using invariants in 714 ms returned []
// Phase 1: matrix 1044 rows 1244 cols
[2022-06-03 17:30:35] [INFO ] Computed 548 place invariants in 4 ms
[2022-06-03 17:30:36] [INFO ] Implicit Places using invariants and state equation in 1399 ms returned []
Implicit Place search using SMT with State Equation took 2116 ms to find 0 implicit places.
[2022-06-03 17:30:36] [INFO ] Redundant transitions in 15 ms returned []
// Phase 1: matrix 1044 rows 1244 cols
[2022-06-03 17:30:36] [INFO ] Computed 548 place invariants in 2 ms
[2022-06-03 17:30:37] [INFO ] Dead Transitions using invariants and state equation in 599 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 1244/1244 places, 1044/1044 transitions.
Partial Free-agglomeration rule applied 293 times.
Drop transitions removed 293 transitions
Iterating global reduction 0 with 293 rules applied. Total rules applied 293 place count 1244 transition count 1044
Applied a total of 293 rules in 56 ms. Remains 1244 /1244 variables (removed 0) and now considering 1044/1044 (removed 0) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 1044 rows 1244 cols
[2022-06-03 17:30:37] [INFO ] Computed 548 place invariants in 4 ms
[2022-06-03 17:30:37] [INFO ] [Real]Absence check using 548 positive place invariants in 79 ms returned sat
[2022-06-03 17:30:38] [INFO ] After 427ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2022-06-03 17:30:38] [INFO ] State equation strengthened by 286 read => feed constraints.
[2022-06-03 17:30:38] [INFO ] After 96ms SMT Verify possible using 286 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2022-06-03 17:30:38] [INFO ] After 758ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-06-03 17:30:38] [INFO ] [Nat]Absence check using 548 positive place invariants in 81 ms returned sat
[2022-06-03 17:30:38] [INFO ] After 434ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-06-03 17:30:38] [INFO ] After 128ms SMT Verify possible using 286 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-06-03 17:30:39] [INFO ] Deduced a trap composed of 5 places in 230 ms of which 1 ms to minimize.
[2022-06-03 17:30:39] [INFO ] Deduced a trap composed of 7 places in 234 ms of which 1 ms to minimize.
[2022-06-03 17:30:39] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 656 ms
[2022-06-03 17:30:39] [INFO ] After 850ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 73 ms.
[2022-06-03 17:30:39] [INFO ] After 1590ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
[2022-06-03 17:30:39] [INFO ] Flatten gal took : 54 ms
[2022-06-03 17:30:39] [INFO ] Flatten gal took : 50 ms
[2022-06-03 17:30:39] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality8669803066275425462.gal : 11 ms
[2022-06-03 17:30:39] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality8532364388803727753.prop : 0 ms
Invoking ITS tools like this :cd /tmp/redAtoms12453042801823985120;'/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/ReachabilityCardinality8669803066275425462.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality8532364388803727753.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/ReachabilityCardinality8532364388803727753.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 5
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :5 after 10
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :10 after 19
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :19 after 36
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :36 after 69
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :69 after 114
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :114 after 640
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :640 after 14612
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :14612 after 1.03535e+06
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :1.03535e+06 after 7.93722e+07
SDD proceeding with computation,1 properties remain. new max is 4096
SDD size :7.93722e+07 after 5.3694e+08
SDD proceeding with computation,1 properties remain. new max is 8192
SDD size :5.3694e+08 after 1.02265e+12
SDD proceeding with computation,1 properties remain. new max is 16384
SDD size :1.02265e+12 after 9.56494e+14
SDD proceeding with computation,1 properties remain. new max is 32768
SDD size :9.56494e+14 after 8.80114e+18
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 32769 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.03573e+23,7.50305,157188,2,26470,20,428420,6,0,5878,1.19636e+06,0
Total reachable state count : 103573081184520763957248
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,5.47834e+20,7.52418,157188,2,14572,20,428420,7,0,5881,1.19636e+06,0
Partial Free-agglomeration rule applied 292 times.
Drop transitions removed 292 transitions
Iterating global reduction 0 with 292 rules applied. Total rules applied 292 place count 1246 transition count 1046
Applied a total of 292 rules in 60 ms. Remains 1246 /1246 variables (removed 0) and now considering 1046/1046 (removed 0) transitions.
Running SMT prover for 2 properties.
// Phase 1: matrix 1046 rows 1246 cols
[2022-06-03 17:30:47] [INFO ] Computed 548 place invariants in 9 ms
[2022-06-03 17:30:47] [INFO ] After 173ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2022-06-03 17:30:47] [INFO ] [Nat]Absence check using 548 positive place invariants in 89 ms returned sat
[2022-06-03 17:30:48] [INFO ] After 494ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2022-06-03 17:30:48] [INFO ] State equation strengthened by 284 read => feed constraints.
[2022-06-03 17:30:48] [INFO ] After 285ms SMT Verify possible using 284 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2022-06-03 17:30:49] [INFO ] Deduced a trap composed of 5 places in 236 ms of which 0 ms to minimize.
[2022-06-03 17:30:49] [INFO ] Deduced a trap composed of 6 places in 238 ms of which 0 ms to minimize.
[2022-06-03 17:30:49] [INFO ] Deduced a trap composed of 5 places in 220 ms of which 1 ms to minimize.
[2022-06-03 17:30:49] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 950 ms
[2022-06-03 17:30:49] [INFO ] After 1457ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 200 ms.
[2022-06-03 17:30:50] [INFO ] After 2455ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
[2022-06-03 17:30:50] [INFO ] Flatten gal took : 47 ms
[2022-06-03 17:30:50] [INFO ] Flatten gal took : 50 ms
[2022-06-03 17:30:50] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality18217032007754569492.gal : 5 ms
[2022-06-03 17:30:50] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality8389649544899695007.prop : 5 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/ReachabilityCardinality18217032007754569492.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality8389649544899695007.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/ReachabilityCardinality8389649544899695007.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
Invariant property ShieldPPPt-PT-050B-ReachabilityCardinality-10 does not hold.
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :36 after 69
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :69 after 102
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :102 after 212
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :212 after 1372
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :1372 after 15377
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :15377 after 953747
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :953747 after 7.92923e+07
SDD proceeding with computation,1 properties remain. new max is 4096
SDD size :7.92923e+07 after 4.14217e+08
SDD proceeding with computation,1 properties remain. new max is 8192
SDD size :4.14217e+08 after 1.02259e+12
SDD proceeding with computation,1 properties remain. new max is 16384
SDD size :1.02259e+12 after 9.21523e+14
SDD proceeding with computation,1 properties remain. new max is 32768
SDD size :9.21523e+14 after 8.80114e+18
Reachability property ShieldPPPt-PT-050B-ReachabilityCardinality-15 is true.
Found states matching all0 target predicate
Will report total states built up to this point. Computation was interrupted after 32769 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.02472e+23,6.99512,157428,2,26152,22,430271,6,0,5888,1.19721e+06,0
Total reachable state count : 102472391012622582153216
Verifying 2 reachability properties.
Invariant property ShieldPPPt-PT-050B-ReachabilityCardinality-10 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
ShieldPPPt-PT-050B-ReachabilityCardinality-10,1,7.00072,157428,2,1247,22,430271,7,0,5894,1.19721e+06,0
Reachability property ShieldPPPt-PT-050B-ReachabilityCardinality-15 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
ShieldPPPt-PT-050B-ReachabilityCardinality-15,5.47386e+20,7.00577,157428,2,4567,22,430271,8,0,5896,1.19721e+06,0
[2022-06-03 17:30:57] [INFO ] Flatten gal took : 45 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin3323972486512574712
[2022-06-03 17:30:57] [INFO ] Computing symmetric may disable matrix : 1046 transitions.
[2022-06-03 17:30:57] [INFO ] Computation of Complete disable matrix. took 13 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-06-03 17:30:57] [INFO ] Applying decomposition
[2022-06-03 17:30:57] [INFO ] Computing symmetric may enable matrix : 1046 transitions.
[2022-06-03 17:30:57] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-06-03 17:30:57] [INFO ] Flatten gal took : 61 ms
[2022-06-03 17:30:57] [INFO ] Flatten gal took : 170 ms
[2022-06-03 17:30:57] [INFO ] Computing Do-Not-Accords matrix : 1046 transitions.
[2022-06-03 17:30:57] [INFO ] Computation of Completed DNA matrix. took 70 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-06-03 17:30:57] [INFO ] Built C files in 394ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3323972486512574712
Running compilation step : cd /tmp/ltsmin3323972486512574712;'/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'
Compilation finished in 3605 ms.
Running link step : cd /tmp/ltsmin3323972486512574712;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 64 ms.
Running LTSmin : cd /tmp/ltsmin3323972486512574712;'/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' 'ShieldPPPtPT050BReachabilityCardinality10==true'
pins2lts-mc-linux64, 0.000: Registering PINS so language module
pins2lts-mc-linux64( 0/ 8), 0.002: Loading model from ./gal.so
pins2lts-mc-linux64( 0/ 8), 0.002: library has no initializer
pins2lts-mc-linux64( 0/ 8), 0.002: loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.003: library has no initializer
pins2lts-mc-linux64( 2/ 8), 0.004: library has no initializer
pins2lts-mc-linux64( 2/ 8), 0.004: loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.004: library has no initializer
pins2lts-mc-linux64( 3/ 8), 0.004: loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.004: library has no initializer
pins2lts-mc-linux64( 4/ 8), 0.005: loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.004: loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.008: library has no initializer
pins2lts-mc-linux64( 1/ 8), 0.008: loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.008: library has no initializer
pins2lts-mc-linux64( 5/ 8), 0.008: loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.008: library has no initializer
pins2lts-mc-linux64( 7/ 8), 0.008: loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.069: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.069: Initializing POR dependencies: labels 1048, guards 1046
pins2lts-mc-linux64( 4/ 8), 0.070: completed loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.074: completed loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.077: completed loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.080: completed loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.082: completed loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.090: completed loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.106: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 13.446: Forcing use of the an ignoring proviso (closed-set)
pins2lts-mc-linux64( 0/ 8), 13.550: "ShieldPPPtPT050BReachabilityCardinality10==true" is not a file, parsing as formula...
pins2lts-mc-linux64( 0/ 8), 13.550: There are 1048 state labels and 1 edge labels
pins2lts-mc-linux64( 0/ 8), 13.550: State length is 1246, there are 1046 groups
pins2lts-mc-linux64( 0/ 8), 13.550: Running bfs using 8 cores
pins2lts-mc-linux64( 0/ 8), 13.550: Using a non-indexing tree table with 2^27 elements
pins2lts-mc-linux64( 0/ 8), 13.550: Successor permutation: none
pins2lts-mc-linux64( 0/ 8), 13.550: Visible groups: 0 / 1046, labels: 1 / 1048
pins2lts-mc-linux64( 0/ 8), 13.551: POR cycle proviso: closed-set
pins2lts-mc-linux64( 0/ 8), 13.551: Global bits: 0, count bits: 0, local bits: 0
pins2lts-mc-linux64( 6/ 8), 13.549: "ShieldPPPtPT050BReachabilityCardinality10==true" is not a file, parsing as formula...
pins2lts-mc-linux64( 1/ 8), 13.550: "ShieldPPPtPT050BReachabilityCardinality10==true" is not a file, parsing as formula...
pins2lts-mc-linux64( 4/ 8), 13.550: "ShieldPPPtPT050BReachabilityCardinality10==true" is not a file, parsing as formula...
pins2lts-mc-linux64( 2/ 8), 13.550: "ShieldPPPtPT050BReachabilityCardinality10==true" is not a file, parsing as formula...
pins2lts-mc-linux64( 5/ 8), 13.551: "ShieldPPPtPT050BReachabilityCardinality10==true" is not a file, parsing as formula...
pins2lts-mc-linux64( 3/ 8), 13.551: "ShieldPPPtPT050BReachabilityCardinality10==true" is not a file, parsing as formula...
pins2lts-mc-linux64( 7/ 8), 13.551: "ShieldPPPtPT050BReachabilityCardinality10==true" is not a file, parsing as formula...
pins2lts-mc-linux64( 0/ 8), 13.669: ~8 levels ~960 states ~2584 transitions
pins2lts-mc-linux64( 0/ 8), 13.793: ~10 levels ~1920 states ~6176 transitions
pins2lts-mc-linux64( 0/ 8), 14.028: ~11 levels ~3840 states ~14232 transitions
pins2lts-mc-linux64( 0/ 8), 14.476: ~12 levels ~7680 states ~31224 transitions
pins2lts-mc-linux64( 0/ 8), 15.427: ~13 levels ~15360 states ~73248 transitions
pins2lts-mc-linux64( 0/ 8), 17.143: ~14 levels ~30720 states ~158072 transitions
pins2lts-mc-linux64( 0/ 8), 20.651: ~15 levels ~61440 states ~345448 transitions
pins2lts-mc-linux64( 0/ 8), 27.319: ~16 levels ~122880 states ~725616 transitions
pins2lts-mc-linux64( 0/ 8), 41.280: ~18 levels ~245760 states ~1560976 transitions
pins2lts-mc-linux64( 0/ 8), 68.312: ~19 levels ~491520 states ~3275840 transitions
pins2lts-mc-linux64( 0/ 8), 119.357: ~20 levels ~983040 states ~6807032 transitions
pins2lts-mc-linux64( 0/ 8), 232.515: ~21 levels ~1966080 states ~14616056 transitions
pins2lts-mc-linux64( 0/ 8), 443.075: ~22 levels ~3932160 states ~30178336 transitions
pins2lts-mc-linux64( 0/ 8), 834.141: Error: tree leafs table full! Change -s/--ratio.
pins2lts-mc-linux64( 0/ 8), 834.301:
pins2lts-mc-linux64( 0/ 8), 834.301: mean standard work distribution: 13.5% (states) 18.3% (transitions)
pins2lts-mc-linux64( 0/ 8), 834.301:
pins2lts-mc-linux64( 0/ 8), 834.301: Explored 5350090 states 40462941 transitions, fanout: 7.563
pins2lts-mc-linux64( 0/ 8), 834.301: Total exploration time 820.740 sec (820.590 sec minimum, 820.644 sec on average)
pins2lts-mc-linux64( 0/ 8), 834.302: States per second: 6519, Transitions per second: 49301
pins2lts-mc-linux64( 0/ 8), 834.302: Ignoring proviso: 3196119
pins2lts-mc-linux64( 0/ 8), 834.302:
pins2lts-mc-linux64( 0/ 8), 834.302: Queue width: 8B, total height: 5393074, memory: 41.15MB
pins2lts-mc-linux64( 0/ 8), 834.302: Tree memory: 338.0MB, 33.0 B/state, compr.: 0.7%
pins2lts-mc-linux64( 0/ 8), 834.302: Tree fill ratio (roots/leafs): 8.0%/99.0%
pins2lts-mc-linux64( 0/ 8), 834.302: Stored 1071 string chucks using 0MB
pins2lts-mc-linux64( 0/ 8), 834.302: Total memory used for chunk indexing: 0MB
pins2lts-mc-linux64( 0/ 8), 834.302: Est. total memory use: 379.1MB (~1065.1MB paged-in)
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin3323972486512574712;'/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' 'ShieldPPPtPT050BReachabilityCardinality10==true'
255
java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin3323972486512574712;'/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' 'ShieldPPPtPT050BReachabilityCardinality10==true'
255
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner.checkProperty(LTSminRunner.java:242)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.checkProperties(LTSminRunner.java:177)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:115)
at java.base/java.lang.Thread.run(Thread.java:829)
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="ShieldPPPt-PT-050B"
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 ShieldPPPt-PT-050B, 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 r222-tall-165286025600686"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/ShieldPPPt-PT-050B.tgz
mv ShieldPPPt-PT-050B 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 ;