About the Execution of ITS-Tools for ShieldIIPt-PT-010B
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
16225.336 | 1900548.00 | 3749644.00 | 149641.50 | FTFTFFTFFFFFFFFF | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fkordon/mcc2023-input.r389-oct2-167903713300270.qcow2', fmt=qcow2 cluster_size=65536 extended_l2=off compression_type=zlib size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 backing_fmt=qcow2 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
...................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool itstools
Input is ShieldIIPt-PT-010B, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r389-oct2-167903713300270
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 664K
-rw-r--r-- 1 mcc users 7.3K Feb 25 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 86K Feb 25 16:58 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.7K Feb 25 16:57 CTLFireability.txt
-rw-r--r-- 1 mcc users 54K Feb 25 16:57 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:41 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K Jan 29 11:41 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.6K Feb 25 16:56 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Feb 25 16:56 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Feb 25 16:56 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Feb 25 16:56 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Feb 25 16:58 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 145K Feb 25 16:58 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.3K Feb 25 16:58 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 71K Feb 25 16:58 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 16:56 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 16:56 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 167K Mar 5 18:23 model.pnml
--------------------
content from stdout:
=== Data for post analysis generated by BenchKit (invocation template)
The expected result is a vector of booleans
BOOL_VECTOR
here is the order used to build the result vector(from text file)
FORMULA_NAME ShieldIIPt-PT-010B-ReachabilityCardinality-00
FORMULA_NAME ShieldIIPt-PT-010B-ReachabilityCardinality-01
FORMULA_NAME ShieldIIPt-PT-010B-ReachabilityCardinality-02
FORMULA_NAME ShieldIIPt-PT-010B-ReachabilityCardinality-03
FORMULA_NAME ShieldIIPt-PT-010B-ReachabilityCardinality-04
FORMULA_NAME ShieldIIPt-PT-010B-ReachabilityCardinality-05
FORMULA_NAME ShieldIIPt-PT-010B-ReachabilityCardinality-06
FORMULA_NAME ShieldIIPt-PT-010B-ReachabilityCardinality-07
FORMULA_NAME ShieldIIPt-PT-010B-ReachabilityCardinality-08
FORMULA_NAME ShieldIIPt-PT-010B-ReachabilityCardinality-09
FORMULA_NAME ShieldIIPt-PT-010B-ReachabilityCardinality-10
FORMULA_NAME ShieldIIPt-PT-010B-ReachabilityCardinality-11
FORMULA_NAME ShieldIIPt-PT-010B-ReachabilityCardinality-12
FORMULA_NAME ShieldIIPt-PT-010B-ReachabilityCardinality-13
FORMULA_NAME ShieldIIPt-PT-010B-ReachabilityCardinality-14
FORMULA_NAME ShieldIIPt-PT-010B-ReachabilityCardinality-15
=== Now, execution of the tool begins
BK_START 1679186194002
bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=ReachabilityCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ShieldIIPt-PT-010B
Not applying reductions.
Model is PT
ReachabilityCardinality PT
Running Version 202303021504
[2023-03-19 00:36:36] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2023-03-19 00:36:36] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-19 00:36:36] [INFO ] Load time of PNML (sax parser for PT used): 86 ms
[2023-03-19 00:36:36] [INFO ] Transformed 703 places.
[2023-03-19 00:36:36] [INFO ] Transformed 653 transitions.
[2023-03-19 00:36:36] [INFO ] Found NUPN structural information;
[2023-03-19 00:36:36] [INFO ] Parsed PT model containing 703 places and 653 transitions and 1626 arcs in 162 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 14 ms.
Working with output stream class java.io.PrintStream
FORMULA ShieldIIPt-PT-010B-ReachabilityCardinality-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPt-PT-010B-ReachabilityCardinality-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2023-03-19 00:36:37] [INFO ] Flatten gal took : 71 ms
[2023-03-19 00:36:37] [INFO ] Flatten gal took : 42 ms
[2023-03-19 00:36:37] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality8085923949473762012.gal : 38 ms
[2023-03-19 00:36:37] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality14819608120589971740.prop : 3 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality8085923949473762012.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality14819608120589971740.prop' '--nowitness' '--gen-order' 'FOLLOW'
its-reach command run as :
Incomplete random walk after 10000 steps, including 2 resets, run finished after 540 ms. (steps per millisecond=18 ) properties (out of 14) seen :8
FORMULA ShieldIIPt-PT-010B-ReachabilityCardinality-12 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPt-PT-010B-ReachabilityCardinality-10 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPt-PT-010B-ReachabilityCardinality-09 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPt-PT-010B-ReachabilityCardinality-07 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPt-PT-010B-ReachabilityCardinality-06 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPt-PT-010B-ReachabilityCardinality-04 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPt-PT-010B-ReachabilityCardinality-02 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPt-PT-010B-ReachabilityCardinality-00 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...329
Loading property file /tmp/ReachabilityCardinality14819608120589971740.prop.
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 55 ms. (steps per millisecond=181 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 57 ms. (steps per millisecond=175 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 6) seen :0
SDD proceeding with computation,14 properties remain. new max is 4
SDD size :1 after 5
SDD proceeding with computation,14 properties remain. new max is 8
SDD size :5 after 10
SDD proceeding with computation,14 properties remain. new max is 16
SDD size :10 after 12
SDD proceeding with computation,14 properties remain. new max is 32
SDD size :12 after 19
Invariant property ShieldIIPt-PT-010B-ReachabilityCardinality-04 does not hold.
SDD proceeding with computation,13 properties remain. new max is 32
SDD size :19 after 289
SDD proceeding with computation,13 properties remain. new max is 64
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 6) seen :0
SDD size :289 after 1677
SDD proceeding with computation,13 properties remain. new max is 128
SDD size :1677 after 1.38945e+06
SDD proceeding with computation,13 properties remain. new max is 256
SDD size :1.38945e+06 after 2.19908e+10
SDD proceeding with computation,13 properties remain. new max is 512
SDD size :2.19908e+10 after 2.67597e+18
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 6) seen :0
Running SMT prover for 6 properties.
// Phase 1: matrix 653 rows 703 cols
[2023-03-19 00:36:37] [INFO ] Computed 91 place invariants in 18 ms
[2023-03-19 00:36:38] [INFO ] After 412ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2023-03-19 00:36:38] [INFO ] [Nat]Absence check using 91 positive place invariants in 23 ms returned sat
[2023-03-19 00:36:39] [INFO ] After 723ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :5
[2023-03-19 00:36:39] [INFO ] Deduced a trap composed of 23 places in 240 ms of which 9 ms to minimize.
[2023-03-19 00:36:39] [INFO ] Deduced a trap composed of 25 places in 144 ms of which 1 ms to minimize.
[2023-03-19 00:36:40] [INFO ] Deduced a trap composed of 27 places in 190 ms of which 0 ms to minimize.
[2023-03-19 00:36:40] [INFO ] Deduced a trap composed of 43 places in 98 ms of which 0 ms to minimize.
[2023-03-19 00:36:40] [INFO ] Deduced a trap composed of 26 places in 94 ms of which 1 ms to minimize.
[2023-03-19 00:36:40] [INFO ] Deduced a trap composed of 31 places in 94 ms of which 1 ms to minimize.
[2023-03-19 00:36:40] [INFO ] Deduced a trap composed of 24 places in 87 ms of which 0 ms to minimize.
[2023-03-19 00:36:40] [INFO ] Deduced a trap composed of 21 places in 139 ms of which 1 ms to minimize.
[2023-03-19 00:36:40] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 1354 ms
[2023-03-19 00:36:41] [INFO ] Deduced a trap composed of 25 places in 241 ms of which 0 ms to minimize.
[2023-03-19 00:36:41] [INFO ] Deduced a trap composed of 33 places in 357 ms of which 1 ms to minimize.
[2023-03-19 00:36:41] [INFO ] Deduced a trap composed of 20 places in 118 ms of which 1 ms to minimize.
[2023-03-19 00:36:41] [INFO ] Deduced a trap composed of 29 places in 90 ms of which 1 ms to minimize.
[2023-03-19 00:36:42] [INFO ] Deduced a trap composed of 23 places in 91 ms of which 1 ms to minimize.
[2023-03-19 00:36:42] [INFO ] Deduced a trap composed of 35 places in 85 ms of which 1 ms to minimize.
[2023-03-19 00:36:42] [INFO ] Deduced a trap composed of 26 places in 80 ms of which 1 ms to minimize.
[2023-03-19 00:36:42] [INFO ] Deduced a trap composed of 17 places in 87 ms of which 1 ms to minimize.
[2023-03-19 00:36:42] [INFO ] Deduced a trap composed of 31 places in 85 ms of which 0 ms to minimize.
[2023-03-19 00:36:42] [INFO ] Deduced a trap composed of 18 places in 72 ms of which 1 ms to minimize.
[2023-03-19 00:36:42] [INFO ] Deduced a trap composed of 21 places in 78 ms of which 1 ms to minimize.
[2023-03-19 00:36:42] [INFO ] Deduced a trap composed of 23 places in 73 ms of which 0 ms to minimize.
[2023-03-19 00:36:42] [INFO ] Deduced a trap composed of 23 places in 82 ms of which 1 ms to minimize.
[2023-03-19 00:36:42] [INFO ] Trap strengthening (SAT) tested/added 14/13 trap constraints in 1986 ms
[2023-03-19 00:36:43] [INFO ] Deduced a trap composed of 24 places in 105 ms of which 0 ms to minimize.
[2023-03-19 00:36:43] [INFO ] Deduced a trap composed of 27 places in 100 ms of which 1 ms to minimize.
[2023-03-19 00:36:43] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 288 ms
[2023-03-19 00:36:43] [INFO ] Deduced a trap composed of 23 places in 133 ms of which 0 ms to minimize.
[2023-03-19 00:36:43] [INFO ] Deduced a trap composed of 25 places in 92 ms of which 0 ms to minimize.
[2023-03-19 00:36:43] [INFO ] Deduced a trap composed of 20 places in 105 ms of which 0 ms to minimize.
[2023-03-19 00:36:43] [INFO ] Deduced a trap composed of 31 places in 102 ms of which 1 ms to minimize.
[2023-03-19 00:36:44] [INFO ] Deduced a trap composed of 24 places in 157 ms of which 1 ms to minimize.
[2023-03-19 00:36:44] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 802 ms
[2023-03-19 00:36:44] [INFO ] Deduced a trap composed of 25 places in 620 ms of which 1 ms to minimize.
[2023-03-19 00:36:45] [INFO ] Deduced a trap composed of 33 places in 192 ms of which 0 ms to minimize.
[2023-03-19 00:36:45] [INFO ] Deduced a trap composed of 25 places in 181 ms of which 1 ms to minimize.
[2023-03-19 00:36:45] [INFO ] Deduced a trap composed of 17 places in 305 ms of which 3 ms to minimize.
[2023-03-19 00:36:45] [INFO ] Deduced a trap composed of 21 places in 223 ms of which 0 ms to minimize.
[2023-03-19 00:36:46] [INFO ] Deduced a trap composed of 15 places in 132 ms of which 5 ms to minimize.
[2023-03-19 00:36:46] [INFO ] Deduced a trap composed of 28 places in 211 ms of which 4 ms to minimize.
[2023-03-19 00:36:46] [INFO ] Deduced a trap composed of 24 places in 232 ms of which 1 ms to minimize.
[2023-03-19 00:36:46] [INFO ] Deduced a trap composed of 21 places in 141 ms of which 0 ms to minimize.
[2023-03-19 00:36:47] [INFO ] Deduced a trap composed of 24 places in 120 ms of which 1 ms to minimize.
[2023-03-19 00:36:47] [INFO ] Deduced a trap composed of 26 places in 108 ms of which 0 ms to minimize.
[2023-03-19 00:36:47] [INFO ] Trap strengthening (SAT) tested/added 12/11 trap constraints in 2878 ms
[2023-03-19 00:36:47] [INFO ] After 8478ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :5
Attempting to minimize the solution found.
Minimization took 297 ms.
[2023-03-19 00:36:47] [INFO ] After 9077ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :5
FORMULA ShieldIIPt-PT-010B-ReachabilityCardinality-14 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 6 Parikh solutions to 5 different solutions.
Parikh walk visited 0 properties in 99 ms.
Support contains 103 out of 703 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 703/703 places, 653/653 transitions.
Drop transitions removed 100 transitions
Trivial Post-agglo rules discarded 100 transitions
Performed 100 trivial Post agglomeration. Transition count delta: 100
Iterating post reduction 0 with 100 rules applied. Total rules applied 100 place count 703 transition count 553
Reduce places removed 100 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 102 rules applied. Total rules applied 202 place count 603 transition count 551
Reduce places removed 1 places and 0 transitions.
Performed 16 Post agglomeration using F-continuation condition.Transition count delta: 16
Iterating post reduction 2 with 17 rules applied. Total rules applied 219 place count 602 transition count 535
Reduce places removed 16 places and 0 transitions.
Iterating post reduction 3 with 16 rules applied. Total rules applied 235 place count 586 transition count 535
Performed 49 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 49 Pre rules applied. Total rules applied 235 place count 586 transition count 486
Deduced a syphon composed of 49 places in 1 ms
Reduce places removed 49 places and 0 transitions.
Iterating global reduction 4 with 98 rules applied. Total rules applied 333 place count 537 transition count 486
Discarding 52 places :
Symmetric choice reduction at 4 with 52 rule applications. Total rules 385 place count 485 transition count 434
Iterating global reduction 4 with 52 rules applied. Total rules applied 437 place count 485 transition count 434
Performed 19 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 19 Pre rules applied. Total rules applied 437 place count 485 transition count 415
Deduced a syphon composed of 19 places in 1 ms
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 4 with 38 rules applied. Total rules applied 475 place count 466 transition count 415
Performed 126 Post agglomeration using F-continuation condition.Transition count delta: 126
Deduced a syphon composed of 126 places in 0 ms
Reduce places removed 126 places and 0 transitions.
Iterating global reduction 4 with 252 rules applied. Total rules applied 727 place count 340 transition count 289
Performed 16 Post agglomeration using F-continuation condition.Transition count delta: -4
Deduced a syphon composed of 16 places in 1 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 4 with 32 rules applied. Total rules applied 759 place count 324 transition count 293
Free-agglomeration rule applied 5 times.
Iterating global reduction 4 with 5 rules applied. Total rules applied 764 place count 324 transition count 288
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 4 with 5 rules applied. Total rules applied 769 place count 319 transition count 288
Partial Free-agglomeration rule applied 5 times.
Drop transitions removed 5 transitions
Iterating global reduction 5 with 5 rules applied. Total rules applied 774 place count 319 transition count 288
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 775 place count 318 transition count 287
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 777 place count 316 transition count 287
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 1 Pre rules applied. Total rules applied 777 place count 316 transition count 286
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 779 place count 315 transition count 286
Applied a total of 779 rules in 167 ms. Remains 315 /703 variables (removed 388) and now considering 286/653 (removed 367) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 167 ms. Remains : 315/703 places, 286/653 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 234 ms. (steps per millisecond=42 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 5) seen :1
FORMULA ShieldIIPt-PT-010B-ReachabilityCardinality-01 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 4) seen :1
FORMULA ShieldIIPt-PT-010B-ReachabilityCardinality-05 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
// Phase 1: matrix 286 rows 315 cols
[2023-03-19 00:36:48] [INFO ] Computed 89 place invariants in 2 ms
[2023-03-19 00:36:48] [INFO ] After 85ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-19 00:36:48] [INFO ] [Nat]Absence check using 89 positive place invariants in 16 ms returned sat
[2023-03-19 00:36:48] [INFO ] After 227ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-19 00:36:48] [INFO ] State equation strengthened by 21 read => feed constraints.
[2023-03-19 00:36:48] [INFO ] After 141ms SMT Verify possible using 21 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-03-19 00:36:48] [INFO ] Deduced a trap composed of 14 places in 140 ms of which 0 ms to minimize.
[2023-03-19 00:36:49] [INFO ] Deduced a trap composed of 5 places in 166 ms of which 1 ms to minimize.
[2023-03-19 00:36:49] [INFO ] Deduced a trap composed of 8 places in 102 ms of which 2 ms to minimize.
[2023-03-19 00:36:49] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 475 ms
[2023-03-19 00:36:49] [INFO ] Deduced a trap composed of 9 places in 50 ms of which 0 ms to minimize.
[2023-03-19 00:36:49] [INFO ] Deduced a trap composed of 9 places in 42 ms of which 1 ms to minimize.
[2023-03-19 00:36:49] [INFO ] Deduced a trap composed of 7 places in 131 ms of which 0 ms to minimize.
[2023-03-19 00:36:49] [INFO ] Deduced a trap composed of 4 places in 266 ms of which 0 ms to minimize.
[2023-03-19 00:36:50] [INFO ] Deduced a trap composed of 13 places in 276 ms of which 0 ms to minimize.
[2023-03-19 00:36:50] [INFO ] Deduced a trap composed of 10 places in 118 ms of which 0 ms to minimize.
[2023-03-19 00:36:50] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 1010 ms
[2023-03-19 00:36:50] [INFO ] Deduced a trap composed of 7 places in 248 ms of which 0 ms to minimize.
[2023-03-19 00:36:50] [INFO ] Deduced a trap composed of 4 places in 75 ms of which 1 ms to minimize.
[2023-03-19 00:36:50] [INFO ] Deduced a trap composed of 8 places in 46 ms of which 0 ms to minimize.
[2023-03-19 00:36:51] [INFO ] Deduced a trap composed of 8 places in 79 ms of which 1 ms to minimize.
[2023-03-19 00:36:51] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 588 ms
[2023-03-19 00:36:51] [INFO ] After 2411ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 202 ms.
[2023-03-19 00:36:51] [INFO ] After 2948ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 58 ms.
Support contains 55 out of 315 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 315/315 places, 286/286 transitions.
Drop transitions removed 13 transitions
Trivial Post-agglo rules discarded 13 transitions
Performed 13 trivial Post agglomeration. Transition count delta: 13
Iterating post reduction 0 with 13 rules applied. Total rules applied 13 place count 315 transition count 273
Reduce places removed 13 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 15 rules applied. Total rules applied 28 place count 302 transition count 271
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 30 place count 300 transition count 271
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 8 Pre rules applied. Total rules applied 30 place count 300 transition count 263
Deduced a syphon composed of 8 places in 1 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 3 with 16 rules applied. Total rules applied 46 place count 292 transition count 263
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 49 place count 289 transition count 260
Iterating global reduction 3 with 3 rules applied. Total rules applied 52 place count 289 transition count 260
Performed 23 Post agglomeration using F-continuation condition.Transition count delta: 23
Deduced a syphon composed of 23 places in 0 ms
Reduce places removed 23 places and 0 transitions.
Iterating global reduction 3 with 46 rules applied. Total rules applied 98 place count 266 transition count 237
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 3 with 12 rules applied. Total rules applied 110 place count 260 transition count 239
Partial Free-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 3 with 2 rules applied. Total rules applied 112 place count 260 transition count 239
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 114 place count 258 transition count 237
Applied a total of 114 rules in 40 ms. Remains 258 /315 variables (removed 57) and now considering 237/286 (removed 49) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 40 ms. Remains : 258/315 places, 237/286 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 141 ms. (steps per millisecond=70 ) properties (out of 3) seen :1
FORMULA ShieldIIPt-PT-010B-ReachabilityCardinality-13 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 237 rows 258 cols
[2023-03-19 00:36:51] [INFO ] Computed 89 place invariants in 1 ms
[2023-03-19 00:36:51] [INFO ] After 60ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-19 00:36:51] [INFO ] [Nat]Absence check using 89 positive place invariants in 10 ms returned sat
[2023-03-19 00:36:51] [INFO ] After 122ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-19 00:36:51] [INFO ] State equation strengthened by 30 read => feed constraints.
[2023-03-19 00:36:52] [INFO ] After 132ms SMT Verify possible using 30 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-19 00:36:52] [INFO ] Deduced a trap composed of 5 places in 70 ms of which 1 ms to minimize.
[2023-03-19 00:36:52] [INFO ] Deduced a trap composed of 3 places in 92 ms of which 1 ms to minimize.
[2023-03-19 00:36:52] [INFO ] Deduced a trap composed of 3 places in 83 ms of which 0 ms to minimize.
[2023-03-19 00:36:52] [INFO ] Deduced a trap composed of 5 places in 95 ms of which 1 ms to minimize.
[2023-03-19 00:36:52] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 436 ms
[2023-03-19 00:36:52] [INFO ] After 712ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 105 ms.
[2023-03-19 00:36:52] [INFO ] After 1024ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 21 ms.
Support contains 54 out of 258 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 258/258 places, 237/237 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 257 transition count 236
Applied a total of 2 rules in 51 ms. Remains 257 /258 variables (removed 1) and now considering 236/237 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 51 ms. Remains : 257/258 places, 236/237 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 124 ms. (steps per millisecond=80 ) properties (out of 2) 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 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 342527 steps, run timeout after 3001 ms. (steps per millisecond=114 ) properties seen :{}
Probabilistic random walk after 342527 steps, saw 187240 distinct states, run finished after 3004 ms. (steps per millisecond=114 ) properties seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 236 rows 257 cols
[2023-03-19 00:36:55] [INFO ] Computed 89 place invariants in 2 ms
[2023-03-19 00:36:56] [INFO ] After 116ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-19 00:36:56] [INFO ] [Nat]Absence check using 89 positive place invariants in 13 ms returned sat
[2023-03-19 00:36:56] [INFO ] After 130ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-19 00:36:56] [INFO ] State equation strengthened by 30 read => feed constraints.
[2023-03-19 00:36:56] [INFO ] After 120ms SMT Verify possible using 30 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-19 00:36:56] [INFO ] Deduced a trap composed of 3 places in 90 ms of which 1 ms to minimize.
[2023-03-19 00:36:56] [INFO ] Deduced a trap composed of 11 places in 61 ms of which 0 ms to minimize.
[2023-03-19 00:36:56] [INFO ] Deduced a trap composed of 5 places in 97 ms of which 1 ms to minimize.
[2023-03-19 00:36:56] [INFO ] Deduced a trap composed of 9 places in 48 ms of which 0 ms to minimize.
[2023-03-19 00:36:56] [INFO ] Deduced a trap composed of 7 places in 47 ms of which 1 ms to minimize.
[2023-03-19 00:36:56] [INFO ] Deduced a trap composed of 5 places in 41 ms of which 0 ms to minimize.
[2023-03-19 00:36:56] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 478 ms
[2023-03-19 00:36:57] [INFO ] Deduced a trap composed of 6 places in 32 ms of which 0 ms to minimize.
[2023-03-19 00:36:57] [INFO ] Deduced a trap composed of 5 places in 35 ms of which 1 ms to minimize.
[2023-03-19 00:36:57] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 96 ms
[2023-03-19 00:36:57] [INFO ] After 799ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 139 ms.
[2023-03-19 00:36:57] [INFO ] After 1167ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 19 ms.
Support contains 54 out of 257 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 257/257 places, 236/236 transitions.
Applied a total of 0 rules in 7 ms. Remains 257 /257 variables (removed 0) and now considering 236/236 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8 ms. Remains : 257/257 places, 236/236 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 257/257 places, 236/236 transitions.
Applied a total of 0 rules in 7 ms. Remains 257 /257 variables (removed 0) and now considering 236/236 (removed 0) transitions.
[2023-03-19 00:36:57] [INFO ] Invariant cache hit.
[2023-03-19 00:36:57] [INFO ] Implicit Places using invariants in 124 ms returned [238]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 126 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 256/257 places, 236/236 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 255 transition count 235
Applied a total of 2 rules in 8 ms. Remains 255 /256 variables (removed 1) and now considering 235/236 (removed 1) transitions.
// Phase 1: matrix 235 rows 255 cols
[2023-03-19 00:36:57] [INFO ] Computed 88 place invariants in 1 ms
[2023-03-19 00:36:57] [INFO ] Implicit Places using invariants in 125 ms returned []
[2023-03-19 00:36:57] [INFO ] Invariant cache hit.
[2023-03-19 00:36:57] [INFO ] State equation strengthened by 30 read => feed constraints.
[2023-03-19 00:36:58] [INFO ] Implicit Places using invariants and state equation in 735 ms returned []
Implicit Place search using SMT with State Equation took 865 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 255/257 places, 235/236 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 1006 ms. Remains : 255/257 places, 235/236 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 146 ms. (steps per millisecond=68 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 354779 steps, run timeout after 3001 ms. (steps per millisecond=118 ) properties seen :{}
Probabilistic random walk after 354779 steps, saw 190827 distinct states, run finished after 3001 ms. (steps per millisecond=118 ) properties seen :0
Running SMT prover for 2 properties.
[2023-03-19 00:37:01] [INFO ] Invariant cache hit.
[2023-03-19 00:37:01] [INFO ] After 61ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-19 00:37:01] [INFO ] [Nat]Absence check using 88 positive place invariants in 11 ms returned sat
[2023-03-19 00:37:01] [INFO ] After 294ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-19 00:37:02] [INFO ] State equation strengthened by 30 read => feed constraints.
[2023-03-19 00:37:02] [INFO ] After 135ms SMT Verify possible using 30 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-19 00:37:02] [INFO ] Deduced a trap composed of 5 places in 105 ms of which 1 ms to minimize.
[2023-03-19 00:37:02] [INFO ] Deduced a trap composed of 7 places in 456 ms of which 1 ms to minimize.
[2023-03-19 00:37:02] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 601 ms
[2023-03-19 00:37:02] [INFO ] Deduced a trap composed of 5 places in 62 ms of which 1 ms to minimize.
[2023-03-19 00:37:02] [INFO ] Deduced a trap composed of 4 places in 58 ms of which 0 ms to minimize.
[2023-03-19 00:37:03] [INFO ] Deduced a trap composed of 5 places in 104 ms of which 1 ms to minimize.
[2023-03-19 00:37:03] [INFO ] Deduced a trap composed of 5 places in 96 ms of which 0 ms to minimize.
[2023-03-19 00:37:03] [INFO ] Deduced a trap composed of 3 places in 119 ms of which 1 ms to minimize.
[2023-03-19 00:37:03] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 540 ms
[2023-03-19 00:37:03] [INFO ] After 1380ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 179 ms.
[2023-03-19 00:37:03] [INFO ] After 1954ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 44 ms.
Support contains 54 out of 255 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 255/255 places, 235/235 transitions.
Applied a total of 0 rules in 6 ms. Remains 255 /255 variables (removed 0) and now considering 235/235 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6 ms. Remains : 255/255 places, 235/235 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 255/255 places, 235/235 transitions.
Applied a total of 0 rules in 5 ms. Remains 255 /255 variables (removed 0) and now considering 235/235 (removed 0) transitions.
[2023-03-19 00:37:03] [INFO ] Invariant cache hit.
[2023-03-19 00:37:03] [INFO ] Implicit Places using invariants in 260 ms returned []
[2023-03-19 00:37:03] [INFO ] Invariant cache hit.
[2023-03-19 00:37:04] [INFO ] State equation strengthened by 30 read => feed constraints.
[2023-03-19 00:37:04] [INFO ] Implicit Places using invariants and state equation in 315 ms returned []
Implicit Place search using SMT with State Equation took 578 ms to find 0 implicit places.
[2023-03-19 00:37:04] [INFO ] Redundant transitions in 15 ms returned []
[2023-03-19 00:37:04] [INFO ] Invariant cache hit.
[2023-03-19 00:37:04] [INFO ] Dead Transitions using invariants and state equation in 190 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 808 ms. Remains : 255/255 places, 235/235 transitions.
Partial Free-agglomeration rule applied 17 times.
Drop transitions removed 17 transitions
Iterating global reduction 0 with 17 rules applied. Total rules applied 17 place count 255 transition count 235
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 255 transition count 234
Applied a total of 18 rules in 18 ms. Remains 255 /255 variables (removed 0) and now considering 234/235 (removed 1) transitions.
Running SMT prover for 2 properties.
// Phase 1: matrix 234 rows 255 cols
[2023-03-19 00:37:04] [INFO ] Computed 88 place invariants in 1 ms
[2023-03-19 00:37:04] [INFO ] After 79ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-19 00:37:04] [INFO ] [Nat]Absence check using 88 positive place invariants in 26 ms returned sat
[2023-03-19 00:37:04] [INFO ] After 235ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-19 00:37:04] [INFO ] State equation strengthened by 11 read => feed constraints.
[2023-03-19 00:37:05] [INFO ] After 106ms SMT Verify possible using 11 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-19 00:37:05] [INFO ] Deduced a trap composed of 7 places in 55 ms of which 1 ms to minimize.
[2023-03-19 00:37:05] [INFO ] Deduced a trap composed of 3 places in 51 ms of which 0 ms to minimize.
[2023-03-19 00:37:05] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 142 ms
[2023-03-19 00:37:05] [INFO ] Deduced a trap composed of 8 places in 78 ms of which 0 ms to minimize.
[2023-03-19 00:37:05] [INFO ] Deduced a trap composed of 6 places in 38 ms of which 0 ms to minimize.
[2023-03-19 00:37:05] [INFO ] Deduced a trap composed of 6 places in 33 ms of which 1 ms to minimize.
[2023-03-19 00:37:05] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 211 ms
[2023-03-19 00:37:05] [INFO ] After 578ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 108 ms.
[2023-03-19 00:37:05] [INFO ] After 1092ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
[2023-03-19 00:37:05] [INFO ] Flatten gal took : 38 ms
[2023-03-19 00:37:05] [INFO ] Flatten gal took : 24 ms
[2023-03-19 00:37:05] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality13958194458810803018.gal : 4 ms
[2023-03-19 00:37:05] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality6896969043260637553.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality13958194458810803018.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality6896969043260637553.prop' '--nowitness' '--gen-order' 'FOLLOW'
its-reach command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...329
Loading property file /tmp/ReachabilityCardinality6896969043260637553.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 2
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :2 after 5
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :5 after 20
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :20 after 60
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :60 after 1800
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :1800 after 234000
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :234000 after 4.15821e+07
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :4.15821e+07 after 4.16515e+07
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :4.16515e+07 after 4.23995e+07
SDD proceeding with computation,2 properties remain. new max is 2048
SDD size :4.23995e+07 after 5.05063e+09
SDD proceeding with computation,2 properties remain. new max is 4096
SDD size :5.05063e+09 after 1.03779e+10
Detected timeout of ITS tools.
[2023-03-19 00:37:20] [INFO ] Flatten gal took : 14 ms
[2023-03-19 00:37:20] [INFO ] Applying decomposition
[2023-03-19 00:37:20] [INFO ] Flatten gal took : 12 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/convert-linux64' '-i' '/tmp/graph8995452237305701989.txt' '-o' '/tmp/graph8995452237305701989.bin' '-w' '/tmp/graph8995452237305701989.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph8995452237305701989.bin' '-l' '-1' '-v' '-w' '/tmp/graph8995452237305701989.weights' '-q' '0' '-e' '0.001'
[2023-03-19 00:37:21] [INFO ] Decomposing Gal with order
[2023-03-19 00:37:21] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-19 00:37:21] [INFO ] Removed a total of 95 redundant transitions.
[2023-03-19 00:37:21] [INFO ] Flatten gal took : 116 ms
[2023-03-19 00:37:21] [INFO ] Fuse similar labels procedure discarded/fused a total of 14 labels/synchronizations in 11 ms.
[2023-03-19 00:37:21] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality7504160020603239956.gal : 5 ms
[2023-03-19 00:37:21] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality4542768522029827688.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality7504160020603239956.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality4542768522029827688.prop' '--nowitness'
its-reach command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...307
Loading property file /tmp/ReachabilityCardinality4542768522029827688.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 5
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :5 after 120
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :120 after 1800
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :1800 after 468000
Reachability property ShieldIIPt-PT-010B-ReachabilityCardinality-15 is true.
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :4.04352e+08 after 6.15438e+13
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :6.15438e+13 after 7.22183e+13
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :7.22183e+13 after 8.13509e+15
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :8.13509e+15 after 1.8704e+16
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :1.8704e+16 after 4.51563e+18
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst\_mod\_flat,2.79132e+33,14.9413,381248,1008,173,581792,18001,760,2.3655e+06,136,123638,0
Total reachable state count : 2791315444337645769798794193403904
Verifying 2 reachability properties.
Reachability property ShieldIIPt-PT-010B-ReachabilityCardinality-08 does not hold.
No reachable states exhibit your property : ShieldIIPt-PT-010B-ReachabilityCardinality-08
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
ShieldIIPt-PT-010B-ReachabilityCardinality-08,0,14.9726,381248,1,0,581792,18001,791,2.3655e+06,142,123638,1307
Reachability property ShieldIIPt-PT-010B-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
ShieldIIPt-PT-010B-ReachabilityCardinality-15,8.33606e+17,14.9937,381248,153,53,581792,18001,927,2.3655e+06,151,123638,3380
FORMULA ShieldIIPt-PT-010B-ReachabilityCardinality-08 FALSE TECHNIQUES OVER_APPROXIMATION
ITS runner failed with exception null
java.lang.InterruptedException
at java.base/java.lang.Object.wait(Native Method)
at java.base/java.lang.Thread.join(Thread.java:1304)
at java.base/java.lang.Thread.join(Thread.java:1372)
at fr.lip6.move.gal.application.runner.AbstractRunner.join(AbstractRunner.java:27)
at fr.lip6.move.gal.application.runner.its.ITSRunner.join(ITSRunner.java:177)
at fr.lip6.move.gal.application.solver.global.GlobalPropertySolver.verifyWithSDD(GlobalPropertySolver.java:675)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.lambda$2(ReachabilitySolver.java:63)
at java.base/java.lang.Thread.run(Thread.java:833)
[2023-03-19 00:37:36] [INFO ] Flatten gal took : 25 ms
[2023-03-19 00:37:36] [INFO ] Applying decomposition
[2023-03-19 00:37:36] [INFO ] Flatten gal took : 25 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/convert-linux64' '-i' '/tmp/graph13923670526542228533.txt' '-o' '/tmp/graph13923670526542228533.bin' '-w' '/tmp/graph13923670526542228533.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph13923670526542228533.bin' '-l' '-1' '-v' '-w' '/tmp/graph13923670526542228533.weights' '-q' '0' '-e' '0.001'
[2023-03-19 00:37:36] [INFO ] Decomposing Gal with order
[2023-03-19 00:37:36] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-19 00:37:36] [INFO ] Removed a total of 60 redundant transitions.
[2023-03-19 00:37:36] [INFO ] Flatten gal took : 78 ms
[2023-03-19 00:37:36] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 3 ms.
[2023-03-19 00:37:36] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality14458319641375637786.gal : 8 ms
[2023-03-19 00:37:36] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality17478868691538364342.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality14458319641375637786.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality17478868691538364342.prop' '--nowitness'
its-reach command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...309
Loading property file /tmp/ReachabilityCardinality17478868691538364342.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 1
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :1 after 79531
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :79531 after 1.07903e+10
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :1.07903e+10 after 4.34202e+10
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :4.01195e+30 after 4.26246e+30
Detected timeout of ITS tools.
Detected timeout of ITS tools.
[2023-03-19 01:07:40] [INFO ] Flatten gal took : 591 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin13311729299419556904
[2023-03-19 01:07:41] [INFO ] Applying decomposition
[2023-03-19 01:07:41] [INFO ] Flatten gal took : 183 ms
[2023-03-19 01:07:41] [INFO ] Computing symmetric may disable matrix : 235 transitions.
[2023-03-19 01:07:41] [INFO ] Computation of Complete disable matrix. took 14 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-19 01:07:41] [INFO ] Computing symmetric may enable matrix : 235 transitions.
[2023-03-19 01:07:41] [INFO ] Computation of Complete enable matrix. took 5 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-19 01:07:42] [INFO ] Computing Do-Not-Accords matrix : 235 transitions.
[2023-03-19 01:07:42] [INFO ] Computation of Completed DNA matrix. took 6 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-19 01:07:42] [INFO ] Built C files in 702ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13311729299419556904
Running compilation step : cd /tmp/ltsmin13311729299419556904;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '720' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/convert-linux64' '-i' '/tmp/graph15500985931625205714.txt' '-o' '/tmp/graph15500985931625205714.bin' '-w' '/tmp/graph15500985931625205714.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph15500985931625205714.bin' '-l' '-1' '-v' '-w' '/tmp/graph15500985931625205714.weights' '-q' '0' '-e' '0.001'
[2023-03-19 01:07:42] [INFO ] Decomposing Gal with order
[2023-03-19 01:07:42] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-19 01:07:43] [INFO ] Removed a total of 110 redundant transitions.
[2023-03-19 01:07:43] [INFO ] Flatten gal took : 223 ms
Compilation finished in 1092 ms.
Running link step : cd /tmp/ltsmin13311729299419556904;'gcc' '-shared' '-o' 'gal.so' 'model.o'
[2023-03-19 01:07:43] [INFO ] Fuse similar labels procedure discarded/fused a total of 66 labels/synchronizations in 91 ms.
Link finished in 68 ms.
Running LTSmin : cd /tmp/ltsmin13311729299419556904;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '-i' 'ShieldIIPtPT010BReachabilityCardinality15==true'
[2023-03-19 01:07:43] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality13633320193738183408.gal : 37 ms
[2023-03-19 01:07:43] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality11581363134803142575.prop : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality13633320193738183408.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality11581363134803142575.prop' '--nowitness'
its-reach command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...309
Loading property file /tmp/ReachabilityCardinality11581363134803142575.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 10
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :10 after 60
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :60 after 60
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :60 after 1080
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :1080 after 234000
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :3.63168e+08 after 1.69696e+13
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :1.69696e+13 after 1.41995e+29
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst\_mod\_flat,2.01797e+33,13.4849,254792,928,153,408246,1127,782,1.66177e+06,136,10710,0
Total reachable state count : 2017967897968725376767112972861440
Verifying 1 reachability properties.
Reachability property ShieldIIPt-PT-010B-ReachabilityCardinality-15 does not hold.
FORMULA ShieldIIPt-PT-010B-ReachabilityCardinality-15 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING USE_NUPN
No reachable states exhibit your property : ShieldIIPt-PT-010B-ReachabilityCardinality-15
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
ShieldIIPt-PT-010B-ReachabilityCardinality-15,0,13.5085,254792,1,0,408246,1127,821,1.66177e+06,146,10710,392
ITS tools runner thread asked to quit. Dying gracefully.
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Total runtime 1896427 ms.
BK_STOP 1679188094550
--------------------
content from stderr:
+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ ReachabilityCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution ReachabilityCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination ReachabilityCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
Sequence of Actions to be Executed by the VM
This is useful if one wants to reexecute the tool in the VM from the submitted image disk.
set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="ShieldIIPt-PT-010B"
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-5348"
echo " Executing tool itstools"
echo " Input is ShieldIIPt-PT-010B, 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 r389-oct2-167903713300270"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/ShieldIIPt-PT-010B.tgz
mv ShieldIIPt-PT-010B 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 ;