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 |
| 16210.815 | 1612925.00 | 5631906.00 | 3756.20 | FFFFFTFFFTFFFTTF | 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-165286025600683.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 LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r222-tall-165286025600683
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.2M
-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 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-LTLCardinality-00
FORMULA_NAME ShieldPPPt-PT-050B-LTLCardinality-01
FORMULA_NAME ShieldPPPt-PT-050B-LTLCardinality-02
FORMULA_NAME ShieldPPPt-PT-050B-LTLCardinality-03
FORMULA_NAME ShieldPPPt-PT-050B-LTLCardinality-04
FORMULA_NAME ShieldPPPt-PT-050B-LTLCardinality-05
FORMULA_NAME ShieldPPPt-PT-050B-LTLCardinality-06
FORMULA_NAME ShieldPPPt-PT-050B-LTLCardinality-07
FORMULA_NAME ShieldPPPt-PT-050B-LTLCardinality-08
FORMULA_NAME ShieldPPPt-PT-050B-LTLCardinality-09
FORMULA_NAME ShieldPPPt-PT-050B-LTLCardinality-10
FORMULA_NAME ShieldPPPt-PT-050B-LTLCardinality-11
FORMULA_NAME ShieldPPPt-PT-050B-LTLCardinality-12
FORMULA_NAME ShieldPPPt-PT-050B-LTLCardinality-13
FORMULA_NAME ShieldPPPt-PT-050B-LTLCardinality-14
FORMULA_NAME ShieldPPPt-PT-050B-LTLCardinality-15
=== Now, execution of the tool begins
BK_START 1653033017453
Running Version 202205111006
[2022-05-20 07:50:18] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -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-05-20 07:50:18] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-20 07:50:18] [INFO ] Load time of PNML (sax parser for PT used): 199 ms
[2022-05-20 07:50:18] [INFO ] Transformed 3903 places.
[2022-05-20 07:50:19] [INFO ] Transformed 3553 transitions.
[2022-05-20 07:50:19] [INFO ] Found NUPN structural information;
[2022-05-20 07:50:19] [INFO ] Parsed PT model containing 3903 places and 3553 transitions in 452 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 10 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 1 formulas.
FORMULA ShieldPPPt-PT-050B-LTLCardinality-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPt-PT-050B-LTLCardinality-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPt-PT-050B-LTLCardinality-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPt-PT-050B-LTLCardinality-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPt-PT-050B-LTLCardinality-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 34 out of 3903 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3903/3903 places, 3553/3553 transitions.
Discarding 545 places :
Symmetric choice reduction at 0 with 545 rule applications. Total rules 545 place count 3358 transition count 3008
Iterating global reduction 0 with 545 rules applied. Total rules applied 1090 place count 3358 transition count 3008
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1091 place count 3357 transition count 3007
Iterating global reduction 0 with 1 rules applied. Total rules applied 1092 place count 3357 transition count 3007
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1093 place count 3356 transition count 3006
Iterating global reduction 0 with 1 rules applied. Total rules applied 1094 place count 3356 transition count 3006
Applied a total of 1094 rules in 1432 ms. Remains 3356 /3903 variables (removed 547) and now considering 3006/3553 (removed 547) transitions.
// Phase 1: matrix 3006 rows 3356 cols
[2022-05-20 07:50:20] [INFO ] Computed 551 place invariants in 42 ms
[2022-05-20 07:50:21] [INFO ] Implicit Places using invariants in 1087 ms returned []
// Phase 1: matrix 3006 rows 3356 cols
[2022-05-20 07:50:21] [INFO ] Computed 551 place invariants in 15 ms
[2022-05-20 07:50:25] [INFO ] Implicit Places using invariants and state equation in 3379 ms returned []
Implicit Place search using SMT with State Equation took 4493 ms to find 0 implicit places.
// Phase 1: matrix 3006 rows 3356 cols
[2022-05-20 07:50:25] [INFO ] Computed 551 place invariants in 17 ms
[2022-05-20 07:50:26] [INFO ] Dead Transitions using invariants and state equation in 1446 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 3356/3903 places, 3006/3553 transitions.
Finished structural reductions, in 1 iterations. Remains : 3356/3903 places, 3006/3553 transitions.
Support contains 34 out of 3356 places after structural reductions.
[2022-05-20 07:50:27] [INFO ] Flatten gal took : 199 ms
[2022-05-20 07:50:27] [INFO ] Flatten gal took : 129 ms
[2022-05-20 07:50:27] [INFO ] Input system was already deterministic with 3006 transitions.
Support contains 30 out of 3356 places (down from 34) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 462 ms. (steps per millisecond=21 ) properties (out of 17) seen :11
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 6) 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 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 6) seen :0
Running SMT prover for 6 properties.
// Phase 1: matrix 3006 rows 3356 cols
[2022-05-20 07:50:28] [INFO ] Computed 551 place invariants in 15 ms
[2022-05-20 07:50:28] [INFO ] After 635ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2022-05-20 07:50:29] [INFO ] [Nat]Absence check using 551 positive place invariants in 214 ms returned sat
[2022-05-20 07:50:32] [INFO ] After 2090ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2022-05-20 07:50:33] [INFO ] Deduced a trap composed of 18 places in 763 ms of which 8 ms to minimize.
[2022-05-20 07:50:33] [INFO ] Deduced a trap composed of 17 places in 720 ms of which 8 ms to minimize.
[2022-05-20 07:50:34] [INFO ] Deduced a trap composed of 17 places in 704 ms of which 2 ms to minimize.
[2022-05-20 07:50:35] [INFO ] Deduced a trap composed of 19 places in 691 ms of which 2 ms to minimize.
[2022-05-20 07:50:36] [INFO ] Deduced a trap composed of 23 places in 688 ms of which 6 ms to minimize.
[2022-05-20 07:50:37] [INFO ] Deduced a trap composed of 16 places in 692 ms of which 2 ms to minimize.
[2022-05-20 07:50:37] [INFO ] Deduced a trap composed of 16 places in 652 ms of which 2 ms to minimize.
[2022-05-20 07:50:38] [INFO ] Deduced a trap composed of 22 places in 664 ms of which 2 ms to minimize.
[2022-05-20 07:50:39] [INFO ] Deduced a trap composed of 24 places in 659 ms of which 1 ms to minimize.
[2022-05-20 07:50:40] [INFO ] Deduced a trap composed of 19 places in 641 ms of which 2 ms to minimize.
[2022-05-20 07:50:40] [INFO ] Deduced a trap composed of 26 places in 632 ms of which 2 ms to minimize.
[2022-05-20 07:50:41] [INFO ] Deduced a trap composed of 25 places in 636 ms of which 2 ms to minimize.
[2022-05-20 07:50:42] [INFO ] Deduced a trap composed of 27 places in 592 ms of which 2 ms to minimize.
[2022-05-20 07:50:42] [INFO ] Deduced a trap composed of 26 places in 585 ms of which 1 ms to minimize.
[2022-05-20 07:50:43] [INFO ] Deduced a trap composed of 23 places in 590 ms of which 2 ms to minimize.
[2022-05-20 07:50:44] [INFO ] Deduced a trap composed of 28 places in 565 ms of which 1 ms to minimize.
[2022-05-20 07:50:44] [INFO ] Deduced a trap composed of 25 places in 571 ms of which 1 ms to minimize.
[2022-05-20 07:50:45] [INFO ] Deduced a trap composed of 20 places in 544 ms of which 1 ms to minimize.
[2022-05-20 07:50:46] [INFO ] Deduced a trap composed of 19 places in 527 ms of which 2 ms to minimize.
[2022-05-20 07:50:46] [INFO ] Deduced a trap composed of 30 places in 519 ms of which 1 ms to minimize.
[2022-05-20 07:50:47] [INFO ] Deduced a trap composed of 29 places in 518 ms of which 2 ms to minimize.
[2022-05-20 07:50:48] [INFO ] Deduced a trap composed of 29 places in 534 ms of which 1 ms to minimize.
[2022-05-20 07:50:48] [INFO ] Deduced a trap composed of 30 places in 494 ms of which 2 ms to minimize.
[2022-05-20 07:50:49] [INFO ] Deduced a trap composed of 35 places in 494 ms of which 2 ms to minimize.
[2022-05-20 07:50:49] [INFO ] Deduced a trap composed of 31 places in 493 ms of which 1 ms to minimize.
[2022-05-20 07:50:50] [INFO ] Deduced a trap composed of 33 places in 487 ms of which 1 ms to minimize.
[2022-05-20 07:50:51] [INFO ] Deduced a trap composed of 29 places in 474 ms of which 2 ms to minimize.
[2022-05-20 07:50:51] [INFO ] Deduced a trap composed of 31 places in 451 ms of which 1 ms to minimize.
[2022-05-20 07:50:52] [INFO ] Deduced a trap composed of 48 places in 435 ms of which 2 ms to minimize.
[2022-05-20 07:50:52] [INFO ] Deduced a trap composed of 51 places in 440 ms of which 2 ms to minimize.
[2022-05-20 07:50:53] [INFO ] Deduced a trap composed of 57 places in 435 ms of which 1 ms to minimize.
[2022-05-20 07:50:53] [INFO ] Deduced a trap composed of 48 places in 427 ms of which 1 ms to minimize.
[2022-05-20 07:50:54] [INFO ] Deduced a trap composed of 40 places in 434 ms of which 1 ms to minimize.
[2022-05-20 07:50:54] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2022-05-20 07:50:54] [INFO ] After 25395ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:6
Parikh walk visited 0 properties in 687 ms.
Support contains 11 out of 3356 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 3356/3356 places, 3006/3006 transitions.
Drop transitions removed 693 transitions
Trivial Post-agglo rules discarded 693 transitions
Performed 693 trivial Post agglomeration. Transition count delta: 693
Iterating post reduction 0 with 693 rules applied. Total rules applied 693 place count 3356 transition count 2313
Reduce places removed 693 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 694 rules applied. Total rules applied 1387 place count 2663 transition count 2312
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 1388 place count 2662 transition count 2312
Performed 397 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 397 Pre rules applied. Total rules applied 1388 place count 2662 transition count 1915
Deduced a syphon composed of 397 places in 3 ms
Reduce places removed 397 places and 0 transitions.
Iterating global reduction 3 with 794 rules applied. Total rules applied 2182 place count 2265 transition count 1915
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 2183 place count 2264 transition count 1914
Iterating global reduction 3 with 1 rules applied. Total rules applied 2184 place count 2264 transition count 1914
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 2184 place count 2264 transition count 1913
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 2186 place count 2263 transition count 1913
Performed 852 Post agglomeration using F-continuation condition.Transition count delta: 852
Deduced a syphon composed of 852 places in 2 ms
Reduce places removed 852 places and 0 transitions.
Iterating global reduction 3 with 1704 rules applied. Total rules applied 3890 place count 1411 transition count 1061
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 3891 place count 1411 transition count 1060
Renaming transitions due to excessive name length > 1024 char.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 3893 place count 1410 transition count 1059
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 4095 place count 1309 transition count 1059
Performed 45 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 45 places in 4 ms
Reduce places removed 45 places and 0 transitions.
Iterating global reduction 4 with 90 rules applied. Total rules applied 4185 place count 1264 transition count 1059
Free-agglomeration rule applied 1 times.
Iterating global reduction 4 with 1 rules applied. Total rules applied 4186 place count 1264 transition count 1058
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 4187 place count 1263 transition count 1058
Partial Free-agglomeration rule applied 149 times.
Drop transitions removed 149 transitions
Iterating global reduction 5 with 149 rules applied. Total rules applied 4336 place count 1263 transition count 1058
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 4337 place count 1262 transition count 1057
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 4338 place count 1261 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 4338 place count 1261 transition count 1055
Deduced a syphon composed of 2 places in 5 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 6 with 4 rules applied. Total rules applied 4342 place count 1259 transition count 1055
Applied a total of 4342 rules in 800 ms. Remains 1259 /3356 variables (removed 2097) and now considering 1055/3006 (removed 1951) transitions.
Finished structural reductions, in 1 iterations. Remains : 1259/3356 places, 1055/3006 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 285 ms. (steps per millisecond=35 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 83 ms. (steps per millisecond=120 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 79 ms. (steps per millisecond=126 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 80 ms. (steps per millisecond=125 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 83 ms. (steps per millisecond=120 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 88 ms. (steps per millisecond=113 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 76 ms. (steps per millisecond=131 ) properties (out of 6) seen :0
Interrupted probabilistic random walk after 104208 steps, run timeout after 3001 ms. (steps per millisecond=34 ) properties seen :{}
Probabilistic random walk after 104208 steps, saw 82686 distinct states, run finished after 3002 ms. (steps per millisecond=34 ) properties seen :0
Running SMT prover for 6 properties.
// Phase 1: matrix 1055 rows 1259 cols
[2022-05-20 07:50:59] [INFO ] Computed 550 place invariants in 5 ms
[2022-05-20 07:50:59] [INFO ] After 243ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2022-05-20 07:51:00] [INFO ] [Nat]Absence check using 550 positive place invariants in 88 ms returned sat
[2022-05-20 07:51:00] [INFO ] After 618ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2022-05-20 07:51:00] [INFO ] State equation strengthened by 2 read => feed constraints.
[2022-05-20 07:51:01] [INFO ] After 253ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :6
[2022-05-20 07:51:01] [INFO ] After 694ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :6
Attempting to minimize the solution found.
Minimization took 234 ms.
[2022-05-20 07:51:01] [INFO ] After 1962ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :6
Fused 6 Parikh solutions to 4 different solutions.
Parikh walk visited 0 properties in 118 ms.
Support contains 11 out of 1259 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 1259/1259 places, 1055/1055 transitions.
Applied a total of 0 rules in 37 ms. Remains 1259 /1259 variables (removed 0) and now considering 1055/1055 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 1259/1259 places, 1055/1055 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 1259/1259 places, 1055/1055 transitions.
Applied a total of 0 rules in 36 ms. Remains 1259 /1259 variables (removed 0) and now considering 1055/1055 (removed 0) transitions.
// Phase 1: matrix 1055 rows 1259 cols
[2022-05-20 07:51:02] [INFO ] Computed 550 place invariants in 3 ms
[2022-05-20 07:51:02] [INFO ] Implicit Places using invariants in 607 ms returned [1242, 1246]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 611 ms to find 2 implicit places.
Starting structural reductions in SAFETY mode, iteration 1 : 1257/1259 places, 1055/1055 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 1255 transition count 1053
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 1255 transition count 1053
Applied a total of 4 rules in 52 ms. Remains 1255 /1257 variables (removed 2) and now considering 1053/1055 (removed 2) transitions.
// Phase 1: matrix 1053 rows 1255 cols
[2022-05-20 07:51:02] [INFO ] Computed 548 place invariants in 4 ms
[2022-05-20 07:51:03] [INFO ] Implicit Places using invariants in 605 ms returned []
// Phase 1: matrix 1053 rows 1255 cols
[2022-05-20 07:51:03] [INFO ] Computed 548 place invariants in 2 ms
[2022-05-20 07:51:04] [INFO ] Implicit Places using invariants and state equation in 1304 ms returned []
Implicit Place search using SMT with State Equation took 1912 ms to find 0 implicit places.
Starting structural reductions in SAFETY mode, iteration 2 : 1255/1259 places, 1053/1055 transitions.
Finished structural reductions, in 2 iterations. Remains : 1255/1259 places, 1053/1055 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 282 ms. (steps per millisecond=35 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 80 ms. (steps per millisecond=125 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 79 ms. (steps per millisecond=126 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 79 ms. (steps per millisecond=126 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 76 ms. (steps per millisecond=131 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 70 ms. (steps per millisecond=142 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 70 ms. (steps per millisecond=142 ) properties (out of 6) seen :0
Interrupted probabilistic random walk after 100875 steps, run timeout after 3001 ms. (steps per millisecond=33 ) properties seen :{}
Probabilistic random walk after 100875 steps, saw 80478 distinct states, run finished after 3001 ms. (steps per millisecond=33 ) properties seen :0
Running SMT prover for 6 properties.
// Phase 1: matrix 1053 rows 1255 cols
[2022-05-20 07:51:08] [INFO ] Computed 548 place invariants in 5 ms
[2022-05-20 07:51:08] [INFO ] After 228ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2022-05-20 07:51:08] [INFO ] [Nat]Absence check using 548 positive place invariants in 79 ms returned sat
[2022-05-20 07:51:09] [INFO ] After 612ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2022-05-20 07:51:09] [INFO ] Deduced a trap composed of 5 places in 86 ms of which 0 ms to minimize.
[2022-05-20 07:51:09] [INFO ] Deduced a trap composed of 6 places in 87 ms of which 1 ms to minimize.
[2022-05-20 07:51:09] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 294 ms
[2022-05-20 07:51:10] [INFO ] After 1287ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :6
Attempting to minimize the solution found.
Minimization took 247 ms.
[2022-05-20 07:51:10] [INFO ] After 1939ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :6
Fused 6 Parikh solutions to 5 different solutions.
Parikh walk visited 0 properties in 113 ms.
Support contains 11 out of 1255 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 1255/1255 places, 1053/1053 transitions.
Applied a total of 0 rules in 27 ms. Remains 1255 /1255 variables (removed 0) and now considering 1053/1053 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 1255/1255 places, 1053/1053 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 1255/1255 places, 1053/1053 transitions.
Applied a total of 0 rules in 26 ms. Remains 1255 /1255 variables (removed 0) and now considering 1053/1053 (removed 0) transitions.
// Phase 1: matrix 1053 rows 1255 cols
[2022-05-20 07:51:10] [INFO ] Computed 548 place invariants in 6 ms
[2022-05-20 07:51:11] [INFO ] Implicit Places using invariants in 606 ms returned []
// Phase 1: matrix 1053 rows 1255 cols
[2022-05-20 07:51:11] [INFO ] Computed 548 place invariants in 6 ms
[2022-05-20 07:51:12] [INFO ] Implicit Places using invariants and state equation in 1286 ms returned []
Implicit Place search using SMT with State Equation took 1895 ms to find 0 implicit places.
[2022-05-20 07:51:12] [INFO ] Redundant transitions in 82 ms returned []
// Phase 1: matrix 1053 rows 1255 cols
[2022-05-20 07:51:12] [INFO ] Computed 548 place invariants in 4 ms
[2022-05-20 07:51:13] [INFO ] Dead Transitions using invariants and state equation in 515 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 1255/1255 places, 1053/1053 transitions.
Partial Free-agglomeration rule applied 285 times.
Drop transitions removed 285 transitions
Iterating global reduction 0 with 285 rules applied. Total rules applied 285 place count 1255 transition count 1053
Applied a total of 285 rules in 60 ms. Remains 1255 /1255 variables (removed 0) and now considering 1053/1053 (removed 0) transitions.
Running SMT prover for 6 properties.
// Phase 1: matrix 1053 rows 1255 cols
[2022-05-20 07:51:13] [INFO ] Computed 548 place invariants in 7 ms
[2022-05-20 07:51:13] [INFO ] After 221ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2022-05-20 07:51:13] [INFO ] [Nat]Absence check using 548 positive place invariants in 76 ms returned sat
[2022-05-20 07:51:14] [INFO ] After 621ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2022-05-20 07:51:14] [INFO ] State equation strengthened by 280 read => feed constraints.
[2022-05-20 07:51:15] [INFO ] After 729ms SMT Verify possible using 280 Read/Feed constraints in natural domain returned unsat :0 sat :6
[2022-05-20 07:51:15] [INFO ] Deduced a trap composed of 5 places in 191 ms of which 1 ms to minimize.
[2022-05-20 07:51:15] [INFO ] Deduced a trap composed of 5 places in 187 ms of which 0 ms to minimize.
[2022-05-20 07:51:16] [INFO ] Deduced a trap composed of 5 places in 190 ms of which 2 ms to minimize.
[2022-05-20 07:51:16] [INFO ] Deduced a trap composed of 4 places in 187 ms of which 1 ms to minimize.
[2022-05-20 07:51:16] [INFO ] Deduced a trap composed of 5 places in 183 ms of which 1 ms to minimize.
[2022-05-20 07:51:16] [INFO ] Deduced a trap composed of 5 places in 185 ms of which 1 ms to minimize.
[2022-05-20 07:51:16] [INFO ] Deduced a trap composed of 7 places in 184 ms of which 1 ms to minimize.
[2022-05-20 07:51:17] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 1741 ms
[2022-05-20 07:51:17] [INFO ] Deduced a trap composed of 6 places in 194 ms of which 1 ms to minimize.
[2022-05-20 07:51:17] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 300 ms
[2022-05-20 07:51:17] [INFO ] Deduced a trap composed of 5 places in 180 ms of which 1 ms to minimize.
[2022-05-20 07:51:18] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 276 ms
[2022-05-20 07:51:18] [INFO ] After 3483ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :6
Attempting to minimize the solution found.
Minimization took 380 ms.
[2022-05-20 07:51:18] [INFO ] After 4900ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :6
[2022-05-20 07:51:18] [INFO ] Flatten gal took : 46 ms
[2022-05-20 07:51:18] [INFO ] Flatten gal took : 43 ms
[2022-05-20 07:51:18] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality15151807245945901702.gal : 25 ms
[2022-05-20 07:51:18] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality342953494409189089.prop : 0 ms
Invoking ITS tools like this :cd /tmp/redAtoms13139880249627871392;'/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/ReachabilityCardinality15151807245945901702.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality342953494409189089.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/ReachabilityCardinality342953494409189089.prop.
SDD proceeding with computation,6 properties remain. new max is 4
SDD size :1 after 5
SDD proceeding with computation,6 properties remain. new max is 8
SDD size :5 after 10
SDD proceeding with computation,6 properties remain. new max is 16
SDD size :10 after 20
SDD proceeding with computation,6 properties remain. new max is 32
SDD size :20 after 37
SDD proceeding with computation,6 properties remain. new max is 64
SDD size :37 after 71
SDD proceeding with computation,6 properties remain. new max is 128
SDD size :71 after 122
SDD proceeding with computation,6 properties remain. new max is 256
SDD size :122 after 867
SDD proceeding with computation,6 properties remain. new max is 512
SDD size :867 after 88899
SDD proceeding with computation,6 properties remain. new max is 1024
SDD size :88899 after 2.39544e+06
SDD proceeding with computation,6 properties remain. new max is 2048
SDD size :2.39544e+06 after 2.50593e+08
SDD proceeding with computation,6 properties remain. new max is 4096
SDD size :2.50593e+08 after 1.75543e+09
SDD proceeding with computation,6 properties remain. new max is 8192
SDD size :1.75543e+09 after 5.69525e+12
SDD proceeding with computation,6 properties remain. new max is 16384
SDD size :5.69525e+12 after 9.16253e+15
SDD proceeding with computation,6 properties remain. new max is 32768
SDD size :9.16253e+15 after 2.64403e+19
SDD proceeding with computation,6 properties remain. new max is 65536
SDD size :2.64403e+19 after 1.68437e+24
Reachability property AtomicPropp11 is true.
Reachability property AtomicPropp10 is true.
SDD proceeding with computation,4 properties remain. new max is 65536
SDD size :1.68437e+24 after 4.36078e+30
Detected timeout of ITS tools.
[2022-05-20 07:51:33] [INFO ] Flatten gal took : 41 ms
[2022-05-20 07:51:33] [INFO ] Applying decomposition
[2022-05-20 07:51:33] [INFO ] Flatten gal took : 40 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph11771336120630319305.txt' '-o' '/tmp/graph11771336120630319305.bin' '-w' '/tmp/graph11771336120630319305.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph11771336120630319305.bin' '-l' '-1' '-v' '-w' '/tmp/graph11771336120630319305.weights' '-q' '0' '-e' '0.001'
[2022-05-20 07:51:33] [INFO ] Decomposing Gal with order
[2022-05-20 07:51:33] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-20 07:51:34] [INFO ] Removed a total of 264 redundant transitions.
[2022-05-20 07:51:34] [INFO ] Flatten gal took : 108 ms
[2022-05-20 07:51:34] [INFO ] Fuse similar labels procedure discarded/fused a total of 188 labels/synchronizations in 18 ms.
[2022-05-20 07:51:34] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality12437076442187732708.gal : 12 ms
[2022-05-20 07:51:34] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality6852132751443414707.prop : 0 ms
Invoking ITS tools like this :cd /tmp/redAtoms13139880249627871392;'/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/ReachabilityCardinality12437076442187732708.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality6852132751443414707.prop' '--nowitness'
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...299
Loading property file /tmp/ReachabilityCardinality6852132751443414707.prop.
SDD proceeding with computation,4 properties remain. new max is 4
SDD size :1 after 1
SDD proceeding with computation,4 properties remain. new max is 8
SDD size :1 after 1
SDD proceeding with computation,4 properties remain. new max is 16
SDD size :1 after 1
SDD proceeding with computation,4 properties remain. new max is 32
SDD size :1 after 1
SDD proceeding with computation,4 properties remain. new max is 64
SDD size :1 after 1
SDD proceeding with computation,4 properties remain. new max is 128
SDD size :1 after 1
SDD proceeding with computation,4 properties remain. new max is 256
SDD size :1 after 1
Reachability property AtomicPropp16 is true.
Reachability property AtomicPropp14 is true.
Reachability property AtomicPropp9 is true.
Reachability property AtomicPropp7 is true.
Found states matching all0 target predicate
Will report total states built up to this point. Computation was interrupted after 257 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\_mod\_flat,9.77256e+72,11.7717,319600,7830,223,536155,1298,1382,1.75258e+06,137,24446,0
Total reachable state count : 9.772557395704440748313214135752769415422e+72
Verifying 4 reachability properties.
Reachability property AtomicPropp7 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
AtomicPropp7,6.9804e+71,11.8223,319600,5090,209,536155,1298,1392,1.75258e+06,142,24446,0
Reachability property AtomicPropp9 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
AtomicPropp9,2.49938e+70,11.829,319600,4975,208,536155,1298,1395,1.75258e+06,144,24446,0
Reachability property AtomicPropp14 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
AtomicPropp14,7.29684e+70,11.8357,319600,4293,207,536155,1298,1404,1.75258e+06,146,24446,0
Reachability property AtomicPropp16 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
AtomicPropp16,9.95612e+56,11.8392,319600,1689,166,536155,1298,1411,1.75258e+06,148,24446,0
ITS tools runner thread asked to quit. Dying gracefully.
FORMULA ShieldPPPt-PT-050B-LTLCardinality-01 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 798 stabilizing places and 798 stable transitions
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 2 out of 3356 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3356/3356 places, 3006/3006 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 3351 transition count 3001
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 3351 transition count 3001
Applied a total of 10 rules in 422 ms. Remains 3351 /3356 variables (removed 5) and now considering 3001/3006 (removed 5) transitions.
// Phase 1: matrix 3001 rows 3351 cols
[2022-05-20 07:51:46] [INFO ] Computed 551 place invariants in 15 ms
[2022-05-20 07:51:47] [INFO ] Implicit Places using invariants in 1117 ms returned []
// Phase 1: matrix 3001 rows 3351 cols
[2022-05-20 07:51:47] [INFO ] Computed 551 place invariants in 17 ms
[2022-05-20 07:51:51] [INFO ] Implicit Places using invariants and state equation in 3194 ms returned []
Implicit Place search using SMT with State Equation took 4314 ms to find 0 implicit places.
// Phase 1: matrix 3001 rows 3351 cols
[2022-05-20 07:51:51] [INFO ] Computed 551 place invariants in 16 ms
[2022-05-20 07:51:53] [INFO ] Dead Transitions using invariants and state equation in 2052 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 3351/3356 places, 3001/3006 transitions.
Finished structural reductions, in 1 iterations. Remains : 3351/3356 places, 3001/3006 transitions.
Stuttering acceptance computed with spot in 195 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ShieldPPPt-PT-050B-LTLCardinality-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (NEQ s2829 0) (NEQ s2417 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 671 reset in 441 ms.
Product exploration explored 100000 steps with 689 reset in 391 ms.
Computed a total of 798 stabilizing places and 798 stable transitions
Computed a total of 798 stabilizing places and 798 stable transitions
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 111 ms. Reduced automaton from 2 states, 2 edges and 1 AP to 1 states, 1 edges and 1 AP.
Stuttering acceptance computed with spot in 31 ms :[(NOT p0)]
Finished random walk after 159 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=79 )
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 614 ms. Reduced automaton from 1 states, 1 edges and 1 AP to 1 states, 1 edges and 1 AP.
Stuttering acceptance computed with spot in 26 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 26 ms :[(NOT p0)]
// Phase 1: matrix 3001 rows 3351 cols
[2022-05-20 07:51:55] [INFO ] Computed 551 place invariants in 15 ms
[2022-05-20 07:51:58] [INFO ] [Real]Absence check using 551 positive place invariants in 1219 ms returned sat
[2022-05-20 07:51:58] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-20 07:52:10] [INFO ] [Real]Absence check using state equation in 11800 ms returned unknown
Could not prove EG (NOT p0)
Support contains 2 out of 3351 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 3351/3351 places, 3001/3001 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 698 transitions
Trivial Post-agglo rules discarded 698 transitions
Performed 698 trivial Post agglomeration. Transition count delta: 698
Iterating post reduction 0 with 698 rules applied. Total rules applied 698 place count 3350 transition count 2302
Reduce places removed 698 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 699 rules applied. Total rules applied 1397 place count 2652 transition count 2301
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 1398 place count 2651 transition count 2301
Performed 400 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 400 Pre rules applied. Total rules applied 1398 place count 2651 transition count 1901
Deduced a syphon composed of 400 places in 2 ms
Reduce places removed 400 places and 0 transitions.
Iterating global reduction 3 with 800 rules applied. Total rules applied 2198 place count 2251 transition count 1901
Performed 846 Post agglomeration using F-continuation condition.Transition count delta: 846
Deduced a syphon composed of 846 places in 1 ms
Reduce places removed 846 places and 0 transitions.
Iterating global reduction 3 with 1692 rules applied. Total rules applied 3890 place count 1405 transition count 1055
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 3891 place count 1405 transition count 1054
Renaming transitions due to excessive name length > 1024 char.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 3893 place count 1404 transition count 1053
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 101 places in 1 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 4 with 202 rules applied. Total rules applied 4095 place count 1303 transition count 1053
Performed 47 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 47 places in 1 ms
Reduce places removed 47 places and 0 transitions.
Iterating global reduction 4 with 94 rules applied. Total rules applied 4189 place count 1256 transition count 1053
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 4191 place count 1254 transition count 1051
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 4192 place count 1253 transition count 1051
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 2 Pre rules applied. Total rules applied 4192 place count 1253 transition count 1049
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 4196 place count 1251 transition count 1049
Applied a total of 4196 rules in 475 ms. Remains 1251 /3351 variables (removed 2100) and now considering 1049/3001 (removed 1952) transitions.
// Phase 1: matrix 1049 rows 1251 cols
[2022-05-20 07:52:10] [INFO ] Computed 550 place invariants in 4 ms
[2022-05-20 07:52:11] [INFO ] Implicit Places using invariants in 617 ms returned [1234, 1238]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 619 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 1249/3351 places, 1049/3001 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 1247 transition count 1047
Applied a total of 4 rules in 46 ms. Remains 1247 /1249 variables (removed 2) and now considering 1047/1049 (removed 2) transitions.
// Phase 1: matrix 1047 rows 1247 cols
[2022-05-20 07:52:11] [INFO ] Computed 548 place invariants in 1 ms
[2022-05-20 07:52:11] [INFO ] Implicit Places using invariants in 583 ms returned []
// Phase 1: matrix 1047 rows 1247 cols
[2022-05-20 07:52:11] [INFO ] Computed 548 place invariants in 2 ms
[2022-05-20 07:52:12] [INFO ] State equation strengthened by 3 read => feed constraints.
[2022-05-20 07:52:13] [INFO ] Implicit Places using invariants and state equation in 1265 ms returned []
Implicit Place search using SMT with State Equation took 1851 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 1247/3351 places, 1047/3001 transitions.
Finished structural reductions, in 2 iterations. Remains : 1247/3351 places, 1047/3001 transitions.
Computed a total of 2 stabilizing places and 2 stable transitions
Computed a total of 2 stabilizing places and 2 stable transitions
Knowledge obtained : [(NOT p0)]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 1 factoid took 120 ms. Reduced automaton from 1 states, 1 edges and 1 AP to 1 states, 1 edges and 1 AP.
Stuttering acceptance computed with spot in 25 ms :[(NOT p0)]
Finished random walk after 6 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=6 )
Knowledge obtained : [(NOT p0)]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0)), (F p0)]
Knowledge based reduction with 1 factoid took 126 ms. Reduced automaton from 1 states, 1 edges and 1 AP to 1 states, 1 edges and 1 AP.
Stuttering acceptance computed with spot in 38 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 26 ms :[(NOT p0)]
// Phase 1: matrix 1047 rows 1247 cols
[2022-05-20 07:52:13] [INFO ] Computed 548 place invariants in 6 ms
[2022-05-20 07:52:14] [INFO ] [Real]Absence check using 548 positive place invariants in 389 ms returned sat
[2022-05-20 07:52:14] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-20 07:52:17] [INFO ] [Real]Absence check using state equation in 2457 ms returned sat
[2022-05-20 07:52:17] [INFO ] Solution in real domain found non-integer solution.
[2022-05-20 07:52:18] [INFO ] [Nat]Absence check using 548 positive place invariants in 403 ms returned sat
[2022-05-20 07:52:18] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-20 07:52:21] [INFO ] [Nat]Absence check using state equation in 2312 ms returned sat
[2022-05-20 07:52:21] [INFO ] State equation strengthened by 3 read => feed constraints.
[2022-05-20 07:52:21] [INFO ] [Nat]Added 3 Read/Feed constraints in 11 ms returned sat
[2022-05-20 07:52:21] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 1 ms to minimize.
[2022-05-20 07:52:21] [INFO ] Deduced a trap composed of 9 places in 33 ms of which 0 ms to minimize.
[2022-05-20 07:52:21] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 222 ms
[2022-05-20 07:52:21] [INFO ] Computed and/alt/rep : 1042/1654/1042 causal constraints (skipped 0 transitions) in 49 ms.
[2022-05-20 07:52:32] [INFO ] Deduced a trap composed of 2 places in 503 ms of which 1 ms to minimize.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:242)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1257)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1179)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:925)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testEGap(DeadlockTester.java:521)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.computeEGknowledge(LTLPropertySolver.java:686)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:652)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:356)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:322)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:78)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:686)
at fr.lip6.move.gal.application.Application.start(Application.java:174)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:43)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:401)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:62)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:566)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2022-05-20 07:52:32] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression EG (NOT p0)
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 27 ms :[(NOT p0)]
Product exploration explored 100000 steps with 19339 reset in 944 ms.
Stack based approach found an accepted trace after 84 steps with 17 reset with depth 3 and stack size 3 in 1 ms.
FORMULA ShieldPPPt-PT-050B-LTLCardinality-00 FALSE TECHNIQUES STACK_TEST
Treatment of property ShieldPPPt-PT-050B-LTLCardinality-00 finished in 47551 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G(p0))))'
Support contains 2 out of 3356 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3356/3356 places, 3006/3006 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 3351 transition count 3001
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 3351 transition count 3001
Applied a total of 10 rules in 420 ms. Remains 3351 /3356 variables (removed 5) and now considering 3001/3006 (removed 5) transitions.
// Phase 1: matrix 3001 rows 3351 cols
[2022-05-20 07:52:34] [INFO ] Computed 551 place invariants in 15 ms
[2022-05-20 07:52:35] [INFO ] Implicit Places using invariants in 1086 ms returned []
// Phase 1: matrix 3001 rows 3351 cols
[2022-05-20 07:52:35] [INFO ] Computed 551 place invariants in 9 ms
[2022-05-20 07:52:38] [INFO ] Implicit Places using invariants and state equation in 3226 ms returned []
Implicit Place search using SMT with State Equation took 4313 ms to find 0 implicit places.
// Phase 1: matrix 3001 rows 3351 cols
[2022-05-20 07:52:38] [INFO ] Computed 551 place invariants in 15 ms
[2022-05-20 07:52:40] [INFO ] Dead Transitions using invariants and state equation in 2026 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 3351/3356 places, 3001/3006 transitions.
Finished structural reductions, in 1 iterations. Remains : 3351/3356 places, 3001/3006 transitions.
Stuttering acceptance computed with spot in 112 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : ShieldPPPt-PT-050B-LTLCardinality-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}]], initial=3, aps=[p0:(AND (EQ s2570 0) (EQ s2948 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA ShieldPPPt-PT-050B-LTLCardinality-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldPPPt-PT-050B-LTLCardinality-03 finished in 6920 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((X(G(p0))&&F(p1)))'
Support contains 3 out of 3356 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3356/3356 places, 3006/3006 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 3351 transition count 3001
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 3351 transition count 3001
Applied a total of 10 rules in 415 ms. Remains 3351 /3356 variables (removed 5) and now considering 3001/3006 (removed 5) transitions.
// Phase 1: matrix 3001 rows 3351 cols
[2022-05-20 07:52:41] [INFO ] Computed 551 place invariants in 17 ms
[2022-05-20 07:52:42] [INFO ] Implicit Places using invariants in 1087 ms returned []
// Phase 1: matrix 3001 rows 3351 cols
[2022-05-20 07:52:42] [INFO ] Computed 551 place invariants in 8 ms
[2022-05-20 07:52:45] [INFO ] Implicit Places using invariants and state equation in 3100 ms returned []
Implicit Place search using SMT with State Equation took 4189 ms to find 0 implicit places.
// Phase 1: matrix 3001 rows 3351 cols
[2022-05-20 07:52:45] [INFO ] Computed 551 place invariants in 15 ms
[2022-05-20 07:52:47] [INFO ] Dead Transitions using invariants and state equation in 1989 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 3351/3356 places, 3001/3006 transitions.
Finished structural reductions, in 1 iterations. Remains : 3351/3356 places, 3001/3006 transitions.
Stuttering acceptance computed with spot in 136 ms :[(NOT p0), true, (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : ShieldPPPt-PT-050B-LTLCardinality-04 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=p1, acceptance={} source=2 dest: 0}, { cond=(NOT p1), acceptance={} source=2 dest: 3}], [{ cond=(AND p1 p0), acceptance={0} source=3 dest: 0}, { cond=(NOT p0), acceptance={0} source=3 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={0} source=3 dest: 3}]], initial=2, aps=[p0:(OR (EQ s2683 0) (EQ s2860 1)), p1:(EQ s1259 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 241 steps with 0 reset in 3 ms.
FORMULA ShieldPPPt-PT-050B-LTLCardinality-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldPPPt-PT-050B-LTLCardinality-04 finished in 6769 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(p1)||G(X(p2))||p0)))'
Support contains 4 out of 3356 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3356/3356 places, 3006/3006 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 3352 transition count 3002
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 3352 transition count 3002
Applied a total of 8 rules in 413 ms. Remains 3352 /3356 variables (removed 4) and now considering 3002/3006 (removed 4) transitions.
// Phase 1: matrix 3002 rows 3352 cols
[2022-05-20 07:52:48] [INFO ] Computed 551 place invariants in 16 ms
[2022-05-20 07:52:49] [INFO ] Implicit Places using invariants in 1091 ms returned []
// Phase 1: matrix 3002 rows 3352 cols
[2022-05-20 07:52:49] [INFO ] Computed 551 place invariants in 9 ms
[2022-05-20 07:52:52] [INFO ] Implicit Places using invariants and state equation in 3266 ms returned []
Implicit Place search using SMT with State Equation took 4361 ms to find 0 implicit places.
// Phase 1: matrix 3002 rows 3352 cols
[2022-05-20 07:52:52] [INFO ] Computed 551 place invariants in 8 ms
[2022-05-20 07:52:54] [INFO ] Dead Transitions using invariants and state equation in 2017 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 3352/3356 places, 3002/3006 transitions.
Finished structural reductions, in 1 iterations. Remains : 3352/3356 places, 3002/3006 transitions.
Stuttering acceptance computed with spot in 207 ms :[(NOT p1), (AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : ShieldPPPt-PT-050B-LTLCardinality-05 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p1) p2), acceptance={} source=3 dest: 3}]], initial=1, aps=[p1:(OR (EQ s1762 0) (EQ s3054 1)), p0:(OR (EQ s2015 0) (EQ s1326 1)), p2:(OR (EQ s2015 0) (EQ s1326 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 1792 ms.
Product exploration explored 100000 steps with 50000 reset in 1796 ms.
Computed a total of 798 stabilizing places and 798 stable transitions
Computed a total of 798 stabilizing places and 798 stable transitions
Knowledge obtained : [(AND p1 p0 p2), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p1) p2)))), (X (X (NOT (AND (NOT p1) (NOT p2)))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (NOT (AND (NOT p0) (NOT p1))))
Knowledge based reduction with 4 factoid took 99 ms. Reduced automaton from 4 states, 5 edges and 3 AP to 1 states, 0 edges and 0 AP.
FORMULA ShieldPPPt-PT-050B-LTLCardinality-05 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ShieldPPPt-PT-050B-LTLCardinality-05 finished in 10749 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(G(p0))))'
Support contains 1 out of 3356 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 3356/3356 places, 3006/3006 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 697 transitions
Trivial Post-agglo rules discarded 697 transitions
Performed 697 trivial Post agglomeration. Transition count delta: 697
Iterating post reduction 0 with 697 rules applied. Total rules applied 697 place count 3355 transition count 2308
Reduce places removed 697 places and 0 transitions.
Iterating post reduction 1 with 697 rules applied. Total rules applied 1394 place count 2658 transition count 2308
Performed 398 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 398 Pre rules applied. Total rules applied 1394 place count 2658 transition count 1910
Deduced a syphon composed of 398 places in 3 ms
Reduce places removed 398 places and 0 transitions.
Iterating global reduction 2 with 796 rules applied. Total rules applied 2190 place count 2260 transition count 1910
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 2194 place count 2256 transition count 1906
Iterating global reduction 2 with 4 rules applied. Total rules applied 2198 place count 2256 transition count 1906
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 2198 place count 2256 transition count 1902
Deduced a syphon composed of 4 places in 3 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 2206 place count 2252 transition count 1902
Performed 849 Post agglomeration using F-continuation condition.Transition count delta: 849
Deduced a syphon composed of 849 places in 1 ms
Reduce places removed 849 places and 0 transitions.
Iterating global reduction 2 with 1698 rules applied. Total rules applied 3904 place count 1403 transition count 1053
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 3905 place count 1403 transition count 1052
Renaming transitions due to excessive name length > 1024 char.
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 3 with 2 rules applied. Total rules applied 3907 place count 1402 transition count 1051
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 101 places in 1 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 3 with 202 rules applied. Total rules applied 4109 place count 1301 transition count 1051
Performed 48 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 48 places in 1 ms
Reduce places removed 48 places and 0 transitions.
Iterating global reduction 3 with 96 rules applied. Total rules applied 4205 place count 1253 transition count 1051
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 4207 place count 1251 transition count 1049
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 4208 place count 1250 transition count 1049
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 4208 place count 1250 transition count 1047
Deduced a syphon composed of 2 places in 2 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 4212 place count 1248 transition count 1047
Applied a total of 4212 rules in 518 ms. Remains 1248 /3356 variables (removed 2108) and now considering 1047/3006 (removed 1959) transitions.
// Phase 1: matrix 1047 rows 1248 cols
[2022-05-20 07:52:58] [INFO ] Computed 550 place invariants in 3 ms
[2022-05-20 07:52:59] [INFO ] Implicit Places using invariants in 613 ms returned [1231, 1235]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 614 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 1246/3356 places, 1047/3006 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 1045
Applied a total of 4 rules in 44 ms. Remains 1244 /1246 variables (removed 2) and now considering 1045/1047 (removed 2) transitions.
// Phase 1: matrix 1045 rows 1244 cols
[2022-05-20 07:52:59] [INFO ] Computed 548 place invariants in 1 ms
[2022-05-20 07:53:00] [INFO ] Implicit Places using invariants in 597 ms returned []
// Phase 1: matrix 1045 rows 1244 cols
[2022-05-20 07:53:00] [INFO ] Computed 548 place invariants in 4 ms
[2022-05-20 07:53:01] [INFO ] Implicit Places using invariants and state equation in 1252 ms returned []
Implicit Place search using SMT with State Equation took 1851 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 1244/3356 places, 1045/3006 transitions.
Finished structural reductions, in 2 iterations. Remains : 1244/3356 places, 1045/3006 transitions.
Stuttering acceptance computed with spot in 37 ms :[(NOT p0)]
Running random walk in product with property : ShieldPPPt-PT-050B-LTLCardinality-06 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(EQ s576 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 0 reset in 755 ms.
Product exploration explored 100000 steps with 0 reset in 1003 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 92 ms. Reduced automaton from 1 states, 2 edges and 1 AP to 1 states, 2 edges and 1 AP.
Stuttering acceptance computed with spot in 28 ms :[(NOT p0)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 82 ms. (steps per millisecond=121 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 63 ms. (steps per millisecond=158 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 199390 steps, run timeout after 3001 ms. (steps per millisecond=66 ) properties seen :{}
Probabilistic random walk after 199390 steps, saw 143804 distinct states, run finished after 3001 ms. (steps per millisecond=66 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 1045 rows 1244 cols
[2022-05-20 07:53:06] [INFO ] Computed 548 place invariants in 5 ms
[2022-05-20 07:53:06] [INFO ] After 130ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-20 07:53:06] [INFO ] [Nat]Absence check using 548 positive place invariants in 76 ms returned sat
[2022-05-20 07:53:07] [INFO ] After 392ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-20 07:53:07] [INFO ] After 480ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 43 ms.
[2022-05-20 07:53:07] [INFO ] After 748ms 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, 1045/1045 transitions.
Applied a total of 0 rules in 24 ms. Remains 1244 /1244 variables (removed 0) and now considering 1045/1045 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 1244/1244 places, 1045/1045 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 87 ms. (steps per millisecond=114 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 55 ms. (steps per millisecond=181 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 204521 steps, run timeout after 3001 ms. (steps per millisecond=68 ) properties seen :{}
Probabilistic random walk after 204521 steps, saw 147396 distinct states, run finished after 3001 ms. (steps per millisecond=68 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 1045 rows 1244 cols
[2022-05-20 07:53:10] [INFO ] Computed 548 place invariants in 2 ms
[2022-05-20 07:53:10] [INFO ] After 130ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-20 07:53:10] [INFO ] [Nat]Absence check using 548 positive place invariants in 76 ms returned sat
[2022-05-20 07:53:11] [INFO ] After 399ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-20 07:53:11] [INFO ] After 468ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 40 ms.
[2022-05-20 07:53:11] [INFO ] After 723ms 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, 1045/1045 transitions.
Applied a total of 0 rules in 31 ms. Remains 1244 /1244 variables (removed 0) and now considering 1045/1045 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 1244/1244 places, 1045/1045 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 1244/1244 places, 1045/1045 transitions.
Applied a total of 0 rules in 37 ms. Remains 1244 /1244 variables (removed 0) and now considering 1045/1045 (removed 0) transitions.
// Phase 1: matrix 1045 rows 1244 cols
[2022-05-20 07:53:11] [INFO ] Computed 548 place invariants in 2 ms
[2022-05-20 07:53:12] [INFO ] Implicit Places using invariants in 603 ms returned []
// Phase 1: matrix 1045 rows 1244 cols
[2022-05-20 07:53:12] [INFO ] Computed 548 place invariants in 1 ms
[2022-05-20 07:53:13] [INFO ] Implicit Places using invariants and state equation in 1260 ms returned []
Implicit Place search using SMT with State Equation took 1865 ms to find 0 implicit places.
[2022-05-20 07:53:13] [INFO ] Redundant transitions in 17 ms returned []
// Phase 1: matrix 1045 rows 1244 cols
[2022-05-20 07:53:13] [INFO ] Computed 548 place invariants in 3 ms
[2022-05-20 07:53:13] [INFO ] Dead Transitions using invariants and state equation in 508 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 1244/1244 places, 1045/1045 transitions.
Partial Free-agglomeration rule applied 296 times.
Drop transitions removed 296 transitions
Iterating global reduction 0 with 296 rules applied. Total rules applied 296 place count 1244 transition count 1045
Applied a total of 296 rules in 59 ms. Remains 1244 /1244 variables (removed 0) and now considering 1045/1045 (removed 0) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 1045 rows 1244 cols
[2022-05-20 07:53:13] [INFO ] Computed 548 place invariants in 4 ms
[2022-05-20 07:53:14] [INFO ] After 131ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-20 07:53:14] [INFO ] [Nat]Absence check using 548 positive place invariants in 79 ms returned sat
[2022-05-20 07:53:14] [INFO ] After 392ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-20 07:53:14] [INFO ] After 461ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 40 ms.
[2022-05-20 07:53:14] [INFO ] After 714ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
[2022-05-20 07:53:14] [INFO ] Flatten gal took : 52 ms
[2022-05-20 07:53:14] [INFO ] Flatten gal took : 34 ms
[2022-05-20 07:53:14] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality11832185200469974561.gal : 5 ms
[2022-05-20 07:53:14] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality16636782053872541982.prop : 1 ms
Invoking ITS tools like this :cd /tmp/redAtoms16407558997080433799;'/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/ReachabilityCardinality11832185200469974561.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality16636782053872541982.prop' '--nowitness' '--gen-order' 'FOLLOW'
its-reach command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp...321
Loading property file /tmp/ReachabilityCardinality16636782053872541982.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 158
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :158 after 4613
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :4613 after 36227
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :36227 after 6.33609e+06
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :6.33609e+06 after 1.25026e+14
SDD proceeding with computation,1 properties remain. new max is 4096
SDD size :1.25026e+14 after 1.19118e+30
SDD proceeding with computation,1 properties remain. new max is 8192
SDD size :1.19118e+30 after 8.24634e+60
Reachability property apf0 is true.
Found states matching all0 target predicate
Will report total states built up to this point. Computation was interrupted after 8193 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,2.12507e+122,1.21028,34232,2,4700,18,121272,6,0,6024,144084,0
Total reachable state count : 2.125065590228564156115050689571146464118e+122
Verifying 1 reachability properties.
Reachability property apf0 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
apf0,7.03687e+81,1.21348,34232,2,1990,18,121272,7,0,6027,144084,0
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 79 ms. Reduced automaton from 1 states, 2 edges and 1 AP to 1 states, 2 edges and 1 AP.
Stuttering acceptance computed with spot in 25 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 33 ms :[(NOT p0)]
Support contains 1 out of 1244 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1244/1244 places, 1045/1045 transitions.
Applied a total of 0 rules in 28 ms. Remains 1244 /1244 variables (removed 0) and now considering 1045/1045 (removed 0) transitions.
// Phase 1: matrix 1045 rows 1244 cols
[2022-05-20 07:53:16] [INFO ] Computed 548 place invariants in 4 ms
[2022-05-20 07:53:16] [INFO ] Implicit Places using invariants in 603 ms returned []
// Phase 1: matrix 1045 rows 1244 cols
[2022-05-20 07:53:16] [INFO ] Computed 548 place invariants in 4 ms
[2022-05-20 07:53:18] [INFO ] Implicit Places using invariants and state equation in 1188 ms returned []
Implicit Place search using SMT with State Equation took 1794 ms to find 0 implicit places.
[2022-05-20 07:53:18] [INFO ] Redundant transitions in 9 ms returned []
// Phase 1: matrix 1045 rows 1244 cols
[2022-05-20 07:53:18] [INFO ] Computed 548 place invariants in 1 ms
[2022-05-20 07:53:18] [INFO ] Dead Transitions using invariants and state equation in 525 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 1244/1244 places, 1045/1045 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 85 ms. Reduced automaton from 1 states, 2 edges and 1 AP to 1 states, 2 edges and 1 AP.
Stuttering acceptance computed with spot in 23 ms :[(NOT p0)]
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 55 ms. (steps per millisecond=181 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 206012 steps, run timeout after 3001 ms. (steps per millisecond=68 ) properties seen :{}
Probabilistic random walk after 206012 steps, saw 148379 distinct states, run finished after 3001 ms. (steps per millisecond=68 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 1045 rows 1244 cols
[2022-05-20 07:53:21] [INFO ] Computed 548 place invariants in 2 ms
[2022-05-20 07:53:22] [INFO ] After 125ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-20 07:53:22] [INFO ] [Nat]Absence check using 548 positive place invariants in 76 ms returned sat
[2022-05-20 07:53:22] [INFO ] After 423ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-20 07:53:22] [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 40 ms.
[2022-05-20 07:53:22] [INFO ] After 759ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 6 ms.
Support contains 1 out of 1244 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 1244/1244 places, 1045/1045 transitions.
Applied a total of 0 rules in 24 ms. Remains 1244 /1244 variables (removed 0) and now considering 1045/1045 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 1244/1244 places, 1045/1045 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 54 ms. (steps per millisecond=185 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 204674 steps, run timeout after 3001 ms. (steps per millisecond=68 ) properties seen :{}
Probabilistic random walk after 204674 steps, saw 147474 distinct states, run finished after 3002 ms. (steps per millisecond=68 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 1045 rows 1244 cols
[2022-05-20 07:53:25] [INFO ] Computed 548 place invariants in 1 ms
[2022-05-20 07:53:26] [INFO ] After 124ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-20 07:53:26] [INFO ] [Nat]Absence check using 548 positive place invariants in 76 ms returned sat
[2022-05-20 07:53:26] [INFO ] After 412ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-20 07:53:26] [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 50 ms.
[2022-05-20 07:53:26] [INFO ] After 772ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 6 ms.
Support contains 1 out of 1244 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 1244/1244 places, 1045/1045 transitions.
Applied a total of 0 rules in 34 ms. Remains 1244 /1244 variables (removed 0) and now considering 1045/1045 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 1244/1244 places, 1045/1045 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 1244/1244 places, 1045/1045 transitions.
Applied a total of 0 rules in 22 ms. Remains 1244 /1244 variables (removed 0) and now considering 1045/1045 (removed 0) transitions.
// Phase 1: matrix 1045 rows 1244 cols
[2022-05-20 07:53:26] [INFO ] Computed 548 place invariants in 4 ms
[2022-05-20 07:53:27] [INFO ] Implicit Places using invariants in 598 ms returned []
// Phase 1: matrix 1045 rows 1244 cols
[2022-05-20 07:53:27] [INFO ] Computed 548 place invariants in 1 ms
[2022-05-20 07:53:28] [INFO ] Implicit Places using invariants and state equation in 1243 ms returned []
Implicit Place search using SMT with State Equation took 1844 ms to find 0 implicit places.
[2022-05-20 07:53:28] [INFO ] Redundant transitions in 11 ms returned []
// Phase 1: matrix 1045 rows 1244 cols
[2022-05-20 07:53:28] [INFO ] Computed 548 place invariants in 2 ms
[2022-05-20 07:53:29] [INFO ] Dead Transitions using invariants and state equation in 505 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 1244/1244 places, 1045/1045 transitions.
Partial Free-agglomeration rule applied 296 times.
Drop transitions removed 296 transitions
Iterating global reduction 0 with 296 rules applied. Total rules applied 296 place count 1244 transition count 1045
Applied a total of 296 rules in 52 ms. Remains 1244 /1244 variables (removed 0) and now considering 1045/1045 (removed 0) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 1045 rows 1244 cols
[2022-05-20 07:53:29] [INFO ] Computed 548 place invariants in 3 ms
[2022-05-20 07:53:29] [INFO ] After 130ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-20 07:53:29] [INFO ] [Nat]Absence check using 548 positive place invariants in 75 ms returned sat
[2022-05-20 07:53:30] [INFO ] After 402ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-20 07:53:30] [INFO ] After 483ms 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-05-20 07:53:30] [INFO ] After 749ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
[2022-05-20 07:53:30] [INFO ] Flatten gal took : 42 ms
[2022-05-20 07:53:30] [INFO ] Flatten gal took : 33 ms
[2022-05-20 07:53:30] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality7700465607025891688.gal : 4 ms
[2022-05-20 07:53:30] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality5405362360333006386.prop : 0 ms
Invoking ITS tools like this :cd /tmp/redAtoms4188479126383347446;'/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/ReachabilityCardinality7700465607025891688.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality5405362360333006386.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/ReachabilityCardinality5405362360333006386.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 158
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :158 after 4613
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :4613 after 36227
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :36227 after 6.33609e+06
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :6.33609e+06 after 1.25026e+14
SDD proceeding with computation,1 properties remain. new max is 4096
SDD size :1.25026e+14 after 1.19118e+30
SDD proceeding with computation,1 properties remain. new max is 8192
SDD size :1.19118e+30 after 8.24634e+60
Reachability property apf0 is true.
Found states matching all0 target predicate
Will report total states built up to this point. Computation was interrupted after 8193 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,2.12507e+122,1.17983,34232,2,4700,18,121272,6,0,6024,144084,0
Total reachable state count : 2.125065590228564156115050689571146464118e+122
Verifying 1 reachability properties.
Reachability property apf0 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
apf0,7.03687e+81,1.18317,34232,2,1990,18,121272,7,0,6027,144084,0
ITS tools runner thread asked to quit. Dying gracefully.
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 85 ms. Reduced automaton from 1 states, 2 edges and 1 AP to 1 states, 2 edges and 1 AP.
Stuttering acceptance computed with spot in 25 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 33 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 36 ms :[(NOT p0)]
Product exploration explored 100000 steps with 0 reset in 750 ms.
Product exploration explored 100000 steps with 0 reset in 951 ms.
Built C files in :
/tmp/ltsmin2000021097882888962
[2022-05-20 07:53:33] [INFO ] Computing symmetric may disable matrix : 1045 transitions.
[2022-05-20 07:53:33] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-20 07:53:33] [INFO ] Computing symmetric may enable matrix : 1045 transitions.
[2022-05-20 07:53:33] [INFO ] Computation of Complete enable matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-20 07:53:33] [INFO ] Computing Do-Not-Accords matrix : 1045 transitions.
[2022-05-20 07:53:33] [INFO ] Computation of Completed DNA matrix. took 32 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-20 07:53:33] [INFO ] Built C files in 184ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2000021097882888962
Running compilation step : cd /tmp/ltsmin2000021097882888962;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' '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'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin2000021097882888962;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' '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' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin2000021097882888962;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' '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' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:829)
Support contains 1 out of 1244 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1244/1244 places, 1045/1045 transitions.
Applied a total of 0 rules in 27 ms. Remains 1244 /1244 variables (removed 0) and now considering 1045/1045 (removed 0) transitions.
// Phase 1: matrix 1045 rows 1244 cols
[2022-05-20 07:53:36] [INFO ] Computed 548 place invariants in 4 ms
[2022-05-20 07:53:37] [INFO ] Implicit Places using invariants in 605 ms returned []
// Phase 1: matrix 1045 rows 1244 cols
[2022-05-20 07:53:37] [INFO ] Computed 548 place invariants in 3 ms
[2022-05-20 07:53:38] [INFO ] Implicit Places using invariants and state equation in 1261 ms returned []
Implicit Place search using SMT with State Equation took 1867 ms to find 0 implicit places.
[2022-05-20 07:53:38] [INFO ] Redundant transitions in 13 ms returned []
// Phase 1: matrix 1045 rows 1244 cols
[2022-05-20 07:53:38] [INFO ] Computed 548 place invariants in 1 ms
[2022-05-20 07:53:39] [INFO ] Dead Transitions using invariants and state equation in 519 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 1244/1244 places, 1045/1045 transitions.
Built C files in :
/tmp/ltsmin8311828506535536673
[2022-05-20 07:53:39] [INFO ] Computing symmetric may disable matrix : 1045 transitions.
[2022-05-20 07:53:39] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-20 07:53:39] [INFO ] Computing symmetric may enable matrix : 1045 transitions.
[2022-05-20 07:53:39] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-20 07:53:39] [INFO ] Computing Do-Not-Accords matrix : 1045 transitions.
[2022-05-20 07:53:39] [INFO ] Computation of Completed DNA matrix. took 27 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-20 07:53:39] [INFO ] Built C files in 147ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8311828506535536673
Running compilation step : cd /tmp/ltsmin8311828506535536673;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' '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'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin8311828506535536673;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' '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' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin8311828506535536673;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' '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' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:829)
[2022-05-20 07:53:42] [INFO ] Flatten gal took : 28 ms
[2022-05-20 07:53:42] [INFO ] Flatten gal took : 29 ms
[2022-05-20 07:53:42] [INFO ] Time to serialize gal into /tmp/LTL4805991657279418556.gal : 4 ms
[2022-05-20 07:53:42] [INFO ] Time to serialize properties into /tmp/LTL9772477000936519301.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL4805991657279418556.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL9772477000936519301.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL4805991...266
Read 1 LTL properties
Checking formula 0 : !((G(F(G("(p1817==0)")))))
Formula 0 simplified : !GFG"(p1817==0)"
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Computing Next relation with stutter on 3.73747e+82 deadlock states
Detected timeout of ITS tools.
[2022-05-20 07:53:57] [INFO ] Flatten gal took : 31 ms
[2022-05-20 07:53:57] [INFO ] Applying decomposition
[2022-05-20 07:53:57] [INFO ] Flatten gal took : 27 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph12178660913831727823.txt' '-o' '/tmp/graph12178660913831727823.bin' '-w' '/tmp/graph12178660913831727823.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph12178660913831727823.bin' '-l' '-1' '-v' '-w' '/tmp/graph12178660913831727823.weights' '-q' '0' '-e' '0.001'
[2022-05-20 07:53:57] [INFO ] Decomposing Gal with order
[2022-05-20 07:53:57] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-20 07:53:57] [INFO ] Removed a total of 303 redundant transitions.
[2022-05-20 07:53:57] [INFO ] Flatten gal took : 58 ms
[2022-05-20 07:53:57] [INFO ] Fuse similar labels procedure discarded/fused a total of 296 labels/synchronizations in 10 ms.
[2022-05-20 07:53:57] [INFO ] Time to serialize gal into /tmp/LTL2854658510119508304.gal : 12 ms
[2022-05-20 07:53:57] [INFO ] Time to serialize properties into /tmp/LTL12425904715043807841.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL2854658510119508304.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL12425904715043807841.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL2854658...246
Read 1 LTL properties
Checking formula 0 : !((G(F(G("(i14.u185.p1817==0)")))))
Formula 0 simplified : !GFG"(i14.u185.p1817==0)"
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Computing Next relation with stutter on 3.73747e+82 deadlock states
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin6033267803202373018
[2022-05-20 07:54:12] [INFO ] Built C files in 17ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6033267803202373018
Running compilation step : cd /tmp/ltsmin6033267803202373018;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' '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 1827 ms.
Running link step : cd /tmp/ltsmin6033267803202373018;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 49 ms.
Running LTSmin : cd /tmp/ltsmin6033267803202373018;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '[](<>([]((LTLAPp0==true))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property ShieldPPPt-PT-050B-LTLCardinality-06 finished in 89522 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 2 out of 3356 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3356/3356 places, 3006/3006 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 3351 transition count 3001
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 3351 transition count 3001
Applied a total of 10 rules in 418 ms. Remains 3351 /3356 variables (removed 5) and now considering 3001/3006 (removed 5) transitions.
// Phase 1: matrix 3001 rows 3351 cols
[2022-05-20 07:54:28] [INFO ] Computed 551 place invariants in 16 ms
[2022-05-20 07:54:29] [INFO ] Implicit Places using invariants in 1108 ms returned []
// Phase 1: matrix 3001 rows 3351 cols
[2022-05-20 07:54:29] [INFO ] Computed 551 place invariants in 8 ms
[2022-05-20 07:54:32] [INFO ] Implicit Places using invariants and state equation in 3227 ms returned []
Implicit Place search using SMT with State Equation took 4337 ms to find 0 implicit places.
// Phase 1: matrix 3001 rows 3351 cols
[2022-05-20 07:54:32] [INFO ] Computed 551 place invariants in 11 ms
[2022-05-20 07:54:34] [INFO ] Dead Transitions using invariants and state equation in 2057 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 3351/3356 places, 3001/3006 transitions.
Finished structural reductions, in 1 iterations. Remains : 3351/3356 places, 3001/3006 transitions.
Stuttering acceptance computed with spot in 78 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : ShieldPPPt-PT-050B-LTLCardinality-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(AND (EQ s3244 0) (EQ s602 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA ShieldPPPt-PT-050B-LTLCardinality-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldPPPt-PT-050B-LTLCardinality-08 finished in 6932 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 3356 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 3356/3356 places, 3006/3006 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 697 transitions
Trivial Post-agglo rules discarded 697 transitions
Performed 697 trivial Post agglomeration. Transition count delta: 697
Iterating post reduction 0 with 697 rules applied. Total rules applied 697 place count 3355 transition count 2308
Reduce places removed 697 places and 0 transitions.
Iterating post reduction 1 with 697 rules applied. Total rules applied 1394 place count 2658 transition count 2308
Performed 398 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 398 Pre rules applied. Total rules applied 1394 place count 2658 transition count 1910
Deduced a syphon composed of 398 places in 2 ms
Reduce places removed 398 places and 0 transitions.
Iterating global reduction 2 with 796 rules applied. Total rules applied 2190 place count 2260 transition count 1910
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 2194 place count 2256 transition count 1906
Iterating global reduction 2 with 4 rules applied. Total rules applied 2198 place count 2256 transition count 1906
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 2198 place count 2256 transition count 1902
Deduced a syphon composed of 4 places in 3 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 2206 place count 2252 transition count 1902
Performed 849 Post agglomeration using F-continuation condition.Transition count delta: 849
Deduced a syphon composed of 849 places in 1 ms
Reduce places removed 849 places and 0 transitions.
Iterating global reduction 2 with 1698 rules applied. Total rules applied 3904 place count 1403 transition count 1053
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 3905 place count 1403 transition count 1052
Renaming transitions due to excessive name length > 1024 char.
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 3 with 2 rules applied. Total rules applied 3907 place count 1402 transition count 1051
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 101 places in 1 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 3 with 202 rules applied. Total rules applied 4109 place count 1301 transition count 1051
Performed 47 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 47 places in 2 ms
Reduce places removed 47 places and 0 transitions.
Iterating global reduction 3 with 94 rules applied. Total rules applied 4203 place count 1254 transition count 1051
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 4205 place count 1252 transition count 1049
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 4206 place count 1251 transition count 1049
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 4206 place count 1251 transition count 1047
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 4210 place count 1249 transition count 1047
Applied a total of 4210 rules in 488 ms. Remains 1249 /3356 variables (removed 2107) and now considering 1047/3006 (removed 1959) transitions.
// Phase 1: matrix 1047 rows 1249 cols
[2022-05-20 07:54:35] [INFO ] Computed 550 place invariants in 3 ms
[2022-05-20 07:54:35] [INFO ] Implicit Places using invariants in 610 ms returned [1232, 1236]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 611 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 1247/3356 places, 1047/3006 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 1245 transition count 1045
Applied a total of 4 rules in 42 ms. Remains 1245 /1247 variables (removed 2) and now considering 1045/1047 (removed 2) transitions.
// Phase 1: matrix 1045 rows 1245 cols
[2022-05-20 07:54:35] [INFO ] Computed 548 place invariants in 3 ms
[2022-05-20 07:54:36] [INFO ] Implicit Places using invariants in 597 ms returned []
// Phase 1: matrix 1045 rows 1245 cols
[2022-05-20 07:54:36] [INFO ] Computed 548 place invariants in 2 ms
[2022-05-20 07:54:37] [INFO ] Implicit Places using invariants and state equation in 1275 ms returned []
Implicit Place search using SMT with State Equation took 1872 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 1245/3356 places, 1045/3006 transitions.
Finished structural reductions, in 2 iterations. Remains : 1245/3356 places, 1045/3006 transitions.
Stuttering acceptance computed with spot in 35 ms :[(NOT p0)]
Running random walk in product with property : ShieldPPPt-PT-050B-LTLCardinality-11 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (NEQ s180 0) (NEQ s49 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 0 reset in 733 ms.
Stack based approach found an accepted trace after 554 steps with 0 reset with depth 555 and stack size 555 in 5 ms.
FORMULA ShieldPPPt-PT-050B-LTLCardinality-11 FALSE TECHNIQUES STACK_TEST
Treatment of property ShieldPPPt-PT-050B-LTLCardinality-11 finished in 3807 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 2 out of 3356 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3356/3356 places, 3006/3006 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 3351 transition count 3001
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 3351 transition count 3001
Applied a total of 10 rules in 411 ms. Remains 3351 /3356 variables (removed 5) and now considering 3001/3006 (removed 5) transitions.
// Phase 1: matrix 3001 rows 3351 cols
[2022-05-20 07:54:39] [INFO ] Computed 551 place invariants in 15 ms
[2022-05-20 07:54:40] [INFO ] Implicit Places using invariants in 1166 ms returned []
// Phase 1: matrix 3001 rows 3351 cols
[2022-05-20 07:54:40] [INFO ] Computed 551 place invariants in 8 ms
[2022-05-20 07:54:43] [INFO ] Implicit Places using invariants and state equation in 3354 ms returned []
Implicit Place search using SMT with State Equation took 4522 ms to find 0 implicit places.
// Phase 1: matrix 3001 rows 3351 cols
[2022-05-20 07:54:43] [INFO ] Computed 551 place invariants in 16 ms
[2022-05-20 07:54:45] [INFO ] Dead Transitions using invariants and state equation in 2111 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 3351/3356 places, 3001/3006 transitions.
Finished structural reductions, in 1 iterations. Remains : 3351/3356 places, 3001/3006 transitions.
Stuttering acceptance computed with spot in 71 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : ShieldPPPt-PT-050B-LTLCardinality-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(OR (EQ s2315 0) (EQ s206 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 434 steps with 0 reset in 5 ms.
FORMULA ShieldPPPt-PT-050B-LTLCardinality-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldPPPt-PT-050B-LTLCardinality-12 finished in 7156 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((X(p0)||X(((G(p0)||p1) U p0))))'
Support contains 4 out of 3356 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3356/3356 places, 3006/3006 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 3353 transition count 3003
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 3353 transition count 3003
Applied a total of 6 rules in 416 ms. Remains 3353 /3356 variables (removed 3) and now considering 3003/3006 (removed 3) transitions.
// Phase 1: matrix 3003 rows 3353 cols
[2022-05-20 07:54:46] [INFO ] Computed 551 place invariants in 11 ms
[2022-05-20 07:54:47] [INFO ] Implicit Places using invariants in 1123 ms returned []
// Phase 1: matrix 3003 rows 3353 cols
[2022-05-20 07:54:47] [INFO ] Computed 551 place invariants in 9 ms
[2022-05-20 07:54:50] [INFO ] Implicit Places using invariants and state equation in 3411 ms returned []
Implicit Place search using SMT with State Equation took 4535 ms to find 0 implicit places.
// Phase 1: matrix 3003 rows 3353 cols
[2022-05-20 07:54:50] [INFO ] Computed 551 place invariants in 7 ms
[2022-05-20 07:54:52] [INFO ] Dead Transitions using invariants and state equation in 2086 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 3353/3356 places, 3003/3006 transitions.
Finished structural reductions, in 1 iterations. Remains : 3353/3356 places, 3003/3006 transitions.
Stuttering acceptance computed with spot in 81 ms :[(NOT p0), (NOT p0), true]
Running random walk in product with property : ShieldPPPt-PT-050B-LTLCardinality-13 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p0) p1), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={0} source=2 dest: 2}]], initial=1, aps=[p0:(OR (EQ s2150 0) (EQ s1637 1)), p1:(OR (EQ s895 0) (EQ s2024 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 1823 ms.
Product exploration explored 100000 steps with 50000 reset in 1815 ms.
Computed a total of 798 stabilizing places and 798 stable transitions
Computed a total of 798 stabilizing places and 798 stable transitions
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND (NOT p0) (NOT p1)))), true, (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (NOT (AND (NOT p0) (NOT p1))))
Knowledge based reduction with 6 factoid took 85 ms. Reduced automaton from 3 states, 4 edges and 2 AP to 1 states, 0 edges and 0 AP.
FORMULA ShieldPPPt-PT-050B-LTLCardinality-13 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ShieldPPPt-PT-050B-LTLCardinality-13 finished in 10902 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((p0 U !p1))'
Support contains 4 out of 3356 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 3356/3356 places, 3006/3006 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 696 transitions
Trivial Post-agglo rules discarded 696 transitions
Performed 696 trivial Post agglomeration. Transition count delta: 696
Iterating post reduction 0 with 696 rules applied. Total rules applied 696 place count 3355 transition count 2309
Reduce places removed 696 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 697 rules applied. Total rules applied 1393 place count 2659 transition count 2308
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 1394 place count 2658 transition count 2308
Performed 396 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 396 Pre rules applied. Total rules applied 1394 place count 2658 transition count 1912
Deduced a syphon composed of 396 places in 3 ms
Reduce places removed 396 places and 0 transitions.
Iterating global reduction 3 with 792 rules applied. Total rules applied 2186 place count 2262 transition count 1912
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 2189 place count 2259 transition count 1909
Iterating global reduction 3 with 3 rules applied. Total rules applied 2192 place count 2259 transition count 1909
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 2192 place count 2259 transition count 1906
Deduced a syphon composed of 3 places in 2 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 2198 place count 2256 transition count 1906
Performed 850 Post agglomeration using F-continuation condition.Transition count delta: 850
Deduced a syphon composed of 850 places in 1 ms
Reduce places removed 850 places and 0 transitions.
Iterating global reduction 3 with 1700 rules applied. Total rules applied 3898 place count 1406 transition count 1056
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 3899 place count 1406 transition count 1055
Renaming transitions due to excessive name length > 1024 char.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 3901 place count 1405 transition count 1054
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 101 places in 1 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 4 with 202 rules applied. Total rules applied 4103 place count 1304 transition count 1054
Performed 47 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 47 places in 2 ms
Reduce places removed 47 places and 0 transitions.
Iterating global reduction 4 with 94 rules applied. Total rules applied 4197 place count 1257 transition count 1054
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 4199 place count 1255 transition count 1052
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 4200 place count 1254 transition count 1052
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 2 Pre rules applied. Total rules applied 4200 place count 1254 transition count 1050
Deduced a syphon composed of 2 places in 2 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 4204 place count 1252 transition count 1050
Applied a total of 4204 rules in 509 ms. Remains 1252 /3356 variables (removed 2104) and now considering 1050/3006 (removed 1956) transitions.
// Phase 1: matrix 1050 rows 1252 cols
[2022-05-20 07:54:57] [INFO ] Computed 550 place invariants in 3 ms
[2022-05-20 07:54:57] [INFO ] Implicit Places using invariants in 608 ms returned [1235, 1239]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 609 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 1250/3356 places, 1050/3006 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 1248 transition count 1048
Applied a total of 4 rules in 52 ms. Remains 1248 /1250 variables (removed 2) and now considering 1048/1050 (removed 2) transitions.
// Phase 1: matrix 1048 rows 1248 cols
[2022-05-20 07:54:57] [INFO ] Computed 548 place invariants in 1 ms
[2022-05-20 07:54:58] [INFO ] Implicit Places using invariants in 598 ms returned []
// Phase 1: matrix 1048 rows 1248 cols
[2022-05-20 07:54:58] [INFO ] Computed 548 place invariants in 1 ms
[2022-05-20 07:54:59] [INFO ] Implicit Places using invariants and state equation in 1256 ms returned []
Implicit Place search using SMT with State Equation took 1855 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 1248/3356 places, 1048/3006 transitions.
Finished structural reductions, in 2 iterations. Remains : 1248/3356 places, 1048/3006 transitions.
Stuttering acceptance computed with spot in 44 ms :[true, p1]
Running random walk in product with property : ShieldPPPt-PT-050B-LTLCardinality-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(AND p1 (NOT p0)), acceptance={0} source=1 dest: 0}, { cond=(AND p1 p0), acceptance={0} source=1 dest: 1}]], initial=1, aps=[p1:(OR (EQ s246 0) (EQ s28 1)), p0:(OR (EQ s1131 0) (EQ s426 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA ShieldPPPt-PT-050B-LTLCardinality-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldPPPt-PT-050B-LTLCardinality-15 finished in 3083 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(G(p0))))'
[2022-05-20 07:54:59] [INFO ] Flatten gal took : 69 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin7199020789624608357
[2022-05-20 07:54:59] [INFO ] Too many transitions (3006) to apply POR reductions. Disabling POR matrices.
[2022-05-20 07:55:00] [INFO ] Applying decomposition
[2022-05-20 07:55:00] [INFO ] Built C files in 37ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7199020789624608357
Running compilation step : cd /tmp/ltsmin7199020789624608357;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '720' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
[2022-05-20 07:55:00] [INFO ] Flatten gal took : 68 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph6375729667493871688.txt' '-o' '/tmp/graph6375729667493871688.bin' '-w' '/tmp/graph6375729667493871688.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph6375729667493871688.bin' '-l' '-1' '-v' '-w' '/tmp/graph6375729667493871688.weights' '-q' '0' '-e' '0.001'
[2022-05-20 07:55:00] [INFO ] Decomposing Gal with order
[2022-05-20 07:55:00] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-20 07:55:00] [INFO ] Removed a total of 499 redundant transitions.
[2022-05-20 07:55:00] [INFO ] Flatten gal took : 128 ms
[2022-05-20 07:55:00] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 21 ms.
[2022-05-20 07:55:00] [INFO ] Time to serialize gal into /tmp/LTLCardinality17453031452264122056.gal : 20 ms
[2022-05-20 07:55:00] [INFO ] Time to serialize properties into /tmp/LTLCardinality9470661751873214389.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLCardinality17453031452264122056.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality9470661751873214389.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTLCardina...268
Read 1 LTL properties
Checking formula 0 : !((G(F(G("(i23.i1.i3.u569.p1817==0)")))))
Formula 0 simplified : !GFG"(i23.i1.i3.u569.p1817==0)"
Compilation finished in 6975 ms.
Running link step : cd /tmp/ltsmin7199020789624608357;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 47 ms.
Running LTSmin : cd /tmp/ltsmin7199020789624608357;'/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' '--ltl' '[](<>([]((LTLAPp0==true))))' '--buchi-type=spotba'
Detected timeout of ITS tools.
[2022-05-20 08:16:35] [INFO ] Applying decomposition
[2022-05-20 08:16:35] [INFO ] Flatten gal took : 374 ms
[2022-05-20 08:16:35] [INFO ] Decomposing Gal with order
[2022-05-20 08:16:36] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-20 08:16:37] [INFO ] Removed a total of 147 redundant transitions.
[2022-05-20 08:16:38] [INFO ] Flatten gal took : 998 ms
[2022-05-20 08:16:40] [INFO ] Fuse similar labels procedure discarded/fused a total of 590 labels/synchronizations in 734 ms.
[2022-05-20 08:16:40] [INFO ] Time to serialize gal into /tmp/LTLCardinality17553730710869745011.gal : 197 ms
[2022-05-20 08:16:40] [INFO ] Time to serialize properties into /tmp/LTLCardinality12688057474625069256.ltl : 2 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-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLCardinality17553730710869745011.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality12688057474625069256.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTLCardina...269
Read 1 LTL properties
Checking formula 0 : !((G(F(G("(i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i1.u533.p1817==0)")))))
Formula 0 simplified : !GFG"(i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i1.u533.p1817==0)"
LTSmin run took 1322877 ms.
FORMULA ShieldPPPt-PT-050B-LTLCardinality-06 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
ITS tools runner thread asked to quit. Dying gracefully.
Total runtime 1611478 ms.
BK_STOP 1653034630378
--------------------
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
+ [[ LTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution LTLCardinality -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 LTLCardinality -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="LTLCardinality"
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 LTLCardinality"
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-165286025600683"
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 [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "UpperBounds" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] || [ "LTLCardinality" = "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 [ "LTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLCardinality" != "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 "LTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLCardinality.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 [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLCardinality"
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 ;