About the Execution of ITS-Tools for ShieldIIPs-PT-100B
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 16194.739 | 3600000.00 | 10545626.00 | 40662.00 | TFFF?FFTF??FFTF? | 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-165286024800172.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 ShieldIIPs-PT-100B, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r222-tall-165286024800172
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.9M
-rw-r--r-- 1 mcc users 6.5K Apr 29 14:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 66K Apr 29 14:58 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.3K Apr 29 14:57 CTLFireability.txt
-rw-r--r-- 1 mcc users 46K Apr 29 14:57 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:34 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K May 10 09:34 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 4.0K May 9 08:49 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K May 9 08:49 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K May 9 08:49 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 9 08:49 LTLFireability.xml
-rw-r--r-- 1 mcc users 1.7K May 9 08:49 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K May 9 08:49 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 1.7M 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 ShieldIIPs-PT-100B-LTLFireability-00
FORMULA_NAME ShieldIIPs-PT-100B-LTLFireability-01
FORMULA_NAME ShieldIIPs-PT-100B-LTLFireability-02
FORMULA_NAME ShieldIIPs-PT-100B-LTLFireability-03
FORMULA_NAME ShieldIIPs-PT-100B-LTLFireability-04
FORMULA_NAME ShieldIIPs-PT-100B-LTLFireability-05
FORMULA_NAME ShieldIIPs-PT-100B-LTLFireability-06
FORMULA_NAME ShieldIIPs-PT-100B-LTLFireability-07
FORMULA_NAME ShieldIIPs-PT-100B-LTLFireability-08
FORMULA_NAME ShieldIIPs-PT-100B-LTLFireability-09
FORMULA_NAME ShieldIIPs-PT-100B-LTLFireability-10
FORMULA_NAME ShieldIIPs-PT-100B-LTLFireability-11
FORMULA_NAME ShieldIIPs-PT-100B-LTLFireability-12
FORMULA_NAME ShieldIIPs-PT-100B-LTLFireability-13
FORMULA_NAME ShieldIIPs-PT-100B-LTLFireability-14
FORMULA_NAME ShieldIIPs-PT-100B-LTLFireability-15
=== Now, execution of the tool begins
BK_START 1652948757742
Running Version 202205111006
[2022-05-19 08:25:58] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -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-19 08:25:58] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-19 08:25:59] [INFO ] Load time of PNML (sax parser for PT used): 278 ms
[2022-05-19 08:25:59] [INFO ] Transformed 6003 places.
[2022-05-19 08:25:59] [INFO ] Transformed 5903 transitions.
[2022-05-19 08:25:59] [INFO ] Found NUPN structural information;
[2022-05-19 08:25:59] [INFO ] Parsed PT model containing 6003 places and 5903 transitions in 642 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 11 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
FORMULA ShieldIIPs-PT-100B-LTLFireability-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPs-PT-100B-LTLFireability-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPs-PT-100B-LTLFireability-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 50 out of 6003 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 6003/6003 places, 5903/5903 transitions.
Discarding 694 places :
Symmetric choice reduction at 0 with 694 rule applications. Total rules 694 place count 5309 transition count 5209
Iterating global reduction 0 with 694 rules applied. Total rules applied 1388 place count 5309 transition count 5209
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1389 place count 5308 transition count 5208
Iterating global reduction 0 with 1 rules applied. Total rules applied 1390 place count 5308 transition count 5208
Applied a total of 1390 rules in 2160 ms. Remains 5308 /6003 variables (removed 695) and now considering 5208/5903 (removed 695) transitions.
// Phase 1: matrix 5208 rows 5308 cols
[2022-05-19 08:26:02] [INFO ] Computed 901 place invariants in 70 ms
[2022-05-19 08:26:03] [INFO ] Implicit Places using invariants in 1921 ms returned []
// Phase 1: matrix 5208 rows 5308 cols
[2022-05-19 08:26:04] [INFO ] Computed 901 place invariants in 31 ms
[2022-05-19 08:26:05] [INFO ] Implicit Places using invariants and state equation in 1624 ms returned []
Implicit Place search using SMT with State Equation took 3580 ms to find 0 implicit places.
// Phase 1: matrix 5208 rows 5308 cols
[2022-05-19 08:26:05] [INFO ] Computed 901 place invariants in 22 ms
[2022-05-19 08:26:08] [INFO ] Dead Transitions using invariants and state equation in 3365 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 5308/6003 places, 5208/5903 transitions.
Finished structural reductions, in 1 iterations. Remains : 5308/6003 places, 5208/5903 transitions.
Support contains 50 out of 5308 places after structural reductions.
[2022-05-19 08:26:09] [INFO ] Flatten gal took : 379 ms
[2022-05-19 08:26:09] [INFO ] Flatten gal took : 262 ms
[2022-05-19 08:26:10] [INFO ] Input system was already deterministic with 5208 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 742 ms. (steps per millisecond=13 ) properties (out of 31) seen :7
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 24) seen :0
Running SMT prover for 24 properties.
// Phase 1: matrix 5208 rows 5308 cols
[2022-05-19 08:26:11] [INFO ] Computed 901 place invariants in 19 ms
[2022-05-19 08:26:14] [INFO ] [Real]Absence check using 901 positive place invariants in 541 ms returned sat
[2022-05-19 08:26:14] [INFO ] After 2959ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:24
[2022-05-19 08:26:16] [INFO ] [Nat]Absence check using 901 positive place invariants in 549 ms returned sat
[2022-05-19 08:26:26] [INFO ] After 8090ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :24
[2022-05-19 08:26:28] [INFO ] Deduced a trap composed of 16 places in 1888 ms of which 10 ms to minimize.
[2022-05-19 08:26:31] [INFO ] Deduced a trap composed of 20 places in 1893 ms of which 13 ms to minimize.
[2022-05-19 08:26:33] [INFO ] Deduced a trap composed of 17 places in 1975 ms of which 8 ms to minimize.
[2022-05-19 08:26:35] [INFO ] Deduced a trap composed of 26 places in 1931 ms of which 5 ms to minimize.
[2022-05-19 08:26:37] [INFO ] Deduced a trap composed of 42 places in 1857 ms of which 4 ms to minimize.
[2022-05-19 08:26:39] [INFO ] Deduced a trap composed of 27 places in 1788 ms of which 3 ms to minimize.
[2022-05-19 08:26:39] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2022-05-19 08:26:39] [INFO ] After 25074ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:24
Fused 24 Parikh solutions to 22 different solutions.
Parikh walk visited 3 properties in 6857 ms.
Support contains 37 out of 5308 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 5308/5308 places, 5208/5208 transitions.
Drop transitions removed 495 transitions
Trivial Post-agglo rules discarded 495 transitions
Performed 495 trivial Post agglomeration. Transition count delta: 495
Iterating post reduction 0 with 495 rules applied. Total rules applied 495 place count 5308 transition count 4713
Reduce places removed 495 places and 0 transitions.
Iterating post reduction 1 with 495 rules applied. Total rules applied 990 place count 4813 transition count 4713
Performed 499 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 499 Pre rules applied. Total rules applied 990 place count 4813 transition count 4214
Deduced a syphon composed of 499 places in 31 ms
Reduce places removed 499 places and 0 transitions.
Iterating global reduction 2 with 998 rules applied. Total rules applied 1988 place count 4314 transition count 4214
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 1991 place count 4311 transition count 4211
Iterating global reduction 2 with 3 rules applied. Total rules applied 1994 place count 4311 transition count 4211
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 1994 place count 4311 transition count 4210
Deduced a syphon composed of 1 places in 19 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 1996 place count 4310 transition count 4210
Performed 1783 Post agglomeration using F-continuation condition.Transition count delta: 1783
Deduced a syphon composed of 1783 places in 15 ms
Reduce places removed 1783 places and 0 transitions.
Iterating global reduction 2 with 3566 rules applied. Total rules applied 5562 place count 2527 transition count 2427
Renaming transitions due to excessive name length > 1024 char.
Partial Free-agglomeration rule applied 679 times.
Drop transitions removed 679 transitions
Iterating global reduction 2 with 679 rules applied. Total rules applied 6241 place count 2527 transition count 2427
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 6242 place count 2526 transition count 2426
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 6243 place count 2525 transition count 2426
Applied a total of 6243 rules in 2071 ms. Remains 2525 /5308 variables (removed 2783) and now considering 2426/5208 (removed 2782) transitions.
Finished structural reductions, in 1 iterations. Remains : 2525/5308 places, 2426/5208 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 531 ms. (steps per millisecond=18 ) properties (out of 21) seen :4
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=52 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=55 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=55 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=55 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=55 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=55 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=55 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=55 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=55 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=55 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=55 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=55 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=55 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=55 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=55 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 17) seen :0
Running SMT prover for 17 properties.
// Phase 1: matrix 2426 rows 2525 cols
[2022-05-19 08:26:49] [INFO ] Computed 900 place invariants in 172 ms
[2022-05-19 08:26:50] [INFO ] [Real]Absence check using 890 positive place invariants in 159 ms returned sat
[2022-05-19 08:26:50] [INFO ] [Real]Absence check using 890 positive and 10 generalized place invariants in 6 ms returned sat
[2022-05-19 08:26:50] [INFO ] After 1098ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:17
[2022-05-19 08:26:51] [INFO ] [Nat]Absence check using 890 positive place invariants in 168 ms returned sat
[2022-05-19 08:26:51] [INFO ] [Nat]Absence check using 890 positive and 10 generalized place invariants in 2 ms returned sat
[2022-05-19 08:26:54] [INFO ] After 2763ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :17
[2022-05-19 08:26:55] [INFO ] Deduced a trap composed of 5 places in 141 ms of which 1 ms to minimize.
[2022-05-19 08:26:55] [INFO ] Deduced a trap composed of 8 places in 140 ms of which 0 ms to minimize.
[2022-05-19 08:26:55] [INFO ] Deduced a trap composed of 4 places in 149 ms of which 0 ms to minimize.
[2022-05-19 08:26:55] [INFO ] Deduced a trap composed of 3 places in 137 ms of which 0 ms to minimize.
[2022-05-19 08:26:56] [INFO ] Deduced a trap composed of 5 places in 153 ms of which 0 ms to minimize.
[2022-05-19 08:26:56] [INFO ] Deduced a trap composed of 4 places in 147 ms of which 0 ms to minimize.
[2022-05-19 08:26:56] [INFO ] Deduced a trap composed of 4 places in 149 ms of which 1 ms to minimize.
[2022-05-19 08:26:56] [INFO ] Deduced a trap composed of 10 places in 152 ms of which 0 ms to minimize.
[2022-05-19 08:26:57] [INFO ] Deduced a trap composed of 9 places in 164 ms of which 1 ms to minimize.
[2022-05-19 08:26:57] [INFO ] Deduced a trap composed of 16 places in 171 ms of which 0 ms to minimize.
[2022-05-19 08:26:57] [INFO ] Deduced a trap composed of 17 places in 171 ms of which 0 ms to minimize.
[2022-05-19 08:26:57] [INFO ] Deduced a trap composed of 15 places in 164 ms of which 1 ms to minimize.
[2022-05-19 08:26:58] [INFO ] Deduced a trap composed of 11 places in 173 ms of which 1 ms to minimize.
[2022-05-19 08:26:58] [INFO ] Deduced a trap composed of 11 places in 170 ms of which 1 ms to minimize.
[2022-05-19 08:26:58] [INFO ] Deduced a trap composed of 9 places in 171 ms of which 1 ms to minimize.
[2022-05-19 08:26:58] [INFO ] Deduced a trap composed of 9 places in 165 ms of which 0 ms to minimize.
[2022-05-19 08:26:58] [INFO ] Deduced a trap composed of 9 places in 156 ms of which 1 ms to minimize.
[2022-05-19 08:26:59] [INFO ] Deduced a trap composed of 6 places in 152 ms of which 0 ms to minimize.
[2022-05-19 08:26:59] [INFO ] Deduced a trap composed of 17 places in 154 ms of which 0 ms to minimize.
[2022-05-19 08:26:59] [INFO ] Deduced a trap composed of 24 places in 148 ms of which 1 ms to minimize.
[2022-05-19 08:26:59] [INFO ] Deduced a trap composed of 17 places in 130 ms of which 0 ms to minimize.
[2022-05-19 08:27:00] [INFO ] Deduced a trap composed of 8 places in 120 ms of which 0 ms to minimize.
[2022-05-19 08:27:00] [INFO ] Deduced a trap composed of 11 places in 117 ms of which 0 ms to minimize.
[2022-05-19 08:27:00] [INFO ] Deduced a trap composed of 19 places in 116 ms of which 0 ms to minimize.
[2022-05-19 08:27:00] [INFO ] Deduced a trap composed of 18 places in 109 ms of which 0 ms to minimize.
[2022-05-19 08:27:00] [INFO ] Deduced a trap composed of 9 places in 110 ms of which 0 ms to minimize.
[2022-05-19 08:27:01] [INFO ] Deduced a trap composed of 17 places in 107 ms of which 1 ms to minimize.
[2022-05-19 08:27:01] [INFO ] Deduced a trap composed of 11 places in 96 ms of which 1 ms to minimize.
[2022-05-19 08:27:01] [INFO ] Deduced a trap composed of 7 places in 105 ms of which 1 ms to minimize.
[2022-05-19 08:27:01] [INFO ] Trap strengthening (SAT) tested/added 30/29 trap constraints in 6633 ms
[2022-05-19 08:27:02] [INFO ] Deduced a trap composed of 5 places in 114 ms of which 1 ms to minimize.
[2022-05-19 08:27:02] [INFO ] Deduced a trap composed of 6 places in 111 ms of which 1 ms to minimize.
[2022-05-19 08:27:02] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 478 ms
[2022-05-19 08:27:02] [INFO ] Deduced a trap composed of 12 places in 110 ms of which 0 ms to minimize.
[2022-05-19 08:27:03] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 281 ms
[2022-05-19 08:27:03] [INFO ] Deduced a trap composed of 18 places in 105 ms of which 0 ms to minimize.
[2022-05-19 08:27:03] [INFO ] Deduced a trap composed of 17 places in 107 ms of which 1 ms to minimize.
[2022-05-19 08:27:03] [INFO ] Deduced a trap composed of 11 places in 105 ms of which 0 ms to minimize.
[2022-05-19 08:27:04] [INFO ] Deduced a trap composed of 3 places in 195 ms of which 0 ms to minimize.
[2022-05-19 08:27:04] [INFO ] Deduced a trap composed of 19 places in 198 ms of which 1 ms to minimize.
[2022-05-19 08:27:04] [INFO ] Deduced a trap composed of 9 places in 190 ms of which 0 ms to minimize.
[2022-05-19 08:27:05] [INFO ] Deduced a trap composed of 17 places in 194 ms of which 1 ms to minimize.
[2022-05-19 08:27:05] [INFO ] Deduced a trap composed of 5 places in 196 ms of which 0 ms to minimize.
[2022-05-19 08:27:05] [INFO ] Deduced a trap composed of 17 places in 195 ms of which 1 ms to minimize.
[2022-05-19 08:27:05] [INFO ] Deduced a trap composed of 8 places in 181 ms of which 0 ms to minimize.
[2022-05-19 08:27:06] [INFO ] Deduced a trap composed of 23 places in 184 ms of which 1 ms to minimize.
[2022-05-19 08:27:06] [INFO ] Deduced a trap composed of 11 places in 186 ms of which 0 ms to minimize.
[2022-05-19 08:27:06] [INFO ] Deduced a trap composed of 17 places in 180 ms of which 0 ms to minimize.
[2022-05-19 08:27:06] [INFO ] Deduced a trap composed of 8 places in 189 ms of which 1 ms to minimize.
[2022-05-19 08:27:07] [INFO ] Deduced a trap composed of 19 places in 184 ms of which 0 ms to minimize.
[2022-05-19 08:27:07] [INFO ] Deduced a trap composed of 21 places in 190 ms of which 0 ms to minimize.
[2022-05-19 08:27:07] [INFO ] Deduced a trap composed of 16 places in 188 ms of which 0 ms to minimize.
[2022-05-19 08:27:08] [INFO ] Deduced a trap composed of 11 places in 182 ms of which 4 ms to minimize.
[2022-05-19 08:27:08] [INFO ] Deduced a trap composed of 7 places in 176 ms of which 1 ms to minimize.
[2022-05-19 08:27:08] [INFO ] Trap strengthening (SAT) tested/added 20/19 trap constraints in 5023 ms
[2022-05-19 08:27:08] [INFO ] Deduced a trap composed of 11 places in 186 ms of which 0 ms to minimize.
[2022-05-19 08:27:09] [INFO ] Deduced a trap composed of 12 places in 184 ms of which 1 ms to minimize.
[2022-05-19 08:27:09] [INFO ] Deduced a trap composed of 4 places in 172 ms of which 0 ms to minimize.
[2022-05-19 08:27:09] [INFO ] Deduced a trap composed of 10 places in 180 ms of which 1 ms to minimize.
[2022-05-19 08:27:09] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 1150 ms
[2022-05-19 08:27:10] [INFO ] Deduced a trap composed of 17 places in 189 ms of which 4 ms to minimize.
[2022-05-19 08:27:10] [INFO ] Deduced a trap composed of 11 places in 172 ms of which 0 ms to minimize.
[2022-05-19 08:27:10] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 657 ms
[2022-05-19 08:27:10] [INFO ] Deduced a trap composed of 17 places in 168 ms of which 1 ms to minimize.
[2022-05-19 08:27:11] [INFO ] Deduced a trap composed of 21 places in 171 ms of which 0 ms to minimize.
[2022-05-19 08:27:11] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 610 ms
[2022-05-19 08:27:11] [INFO ] Deduced a trap composed of 23 places in 177 ms of which 1 ms to minimize.
[2022-05-19 08:27:11] [INFO ] Deduced a trap composed of 23 places in 173 ms of which 0 ms to minimize.
[2022-05-19 08:27:12] [INFO ] Deduced a trap composed of 14 places in 168 ms of which 1 ms to minimize.
[2022-05-19 08:27:12] [INFO ] Deduced a trap composed of 8 places in 171 ms of which 0 ms to minimize.
[2022-05-19 08:27:12] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 1138 ms
[2022-05-19 08:27:12] [INFO ] After 20595ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :17
Attempting to minimize the solution found.
Minimization took 1462 ms.
[2022-05-19 08:27:14] [INFO ] After 23810ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :17
Parikh walk visited 0 properties in 1119 ms.
Support contains 31 out of 2525 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 2525/2525 places, 2426/2426 transitions.
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 2 Pre rules applied. Total rules applied 0 place count 2525 transition count 2424
Deduced a syphon composed of 2 places in 6 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 2523 transition count 2424
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 6 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 2521 transition count 2422
Partial Free-agglomeration rule applied 4 times.
Drop transitions removed 4 transitions
Iterating global reduction 0 with 4 rules applied. Total rules applied 12 place count 2521 transition count 2422
Applied a total of 12 rules in 240 ms. Remains 2521 /2525 variables (removed 4) and now considering 2422/2426 (removed 4) transitions.
Finished structural reductions, in 1 iterations. Remains : 2521/2525 places, 2422/2426 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 452 ms. (steps per millisecond=22 ) properties (out of 17) seen :2
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=58 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 15) seen :0
Running SMT prover for 15 properties.
// Phase 1: matrix 2422 rows 2521 cols
[2022-05-19 08:27:16] [INFO ] Computed 900 place invariants in 23 ms
[2022-05-19 08:27:17] [INFO ] After 747ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:15
[2022-05-19 08:27:17] [INFO ] [Nat]Absence check using 892 positive place invariants in 159 ms returned sat
[2022-05-19 08:27:17] [INFO ] [Nat]Absence check using 892 positive and 8 generalized place invariants in 2 ms returned sat
[2022-05-19 08:27:21] [INFO ] After 2548ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :15
[2022-05-19 08:27:21] [INFO ] Deduced a trap composed of 4 places in 139 ms of which 1 ms to minimize.
[2022-05-19 08:27:21] [INFO ] Deduced a trap composed of 4 places in 137 ms of which 0 ms to minimize.
[2022-05-19 08:27:21] [INFO ] Deduced a trap composed of 6 places in 150 ms of which 1 ms to minimize.
[2022-05-19 08:27:21] [INFO ] Deduced a trap composed of 4 places in 152 ms of which 0 ms to minimize.
[2022-05-19 08:27:22] [INFO ] Deduced a trap composed of 6 places in 153 ms of which 1 ms to minimize.
[2022-05-19 08:27:22] [INFO ] Deduced a trap composed of 7 places in 154 ms of which 1 ms to minimize.
[2022-05-19 08:27:22] [INFO ] Deduced a trap composed of 4 places in 143 ms of which 1 ms to minimize.
[2022-05-19 08:27:22] [INFO ] Deduced a trap composed of 13 places in 142 ms of which 1 ms to minimize.
[2022-05-19 08:27:23] [INFO ] Deduced a trap composed of 4 places in 134 ms of which 1 ms to minimize.
[2022-05-19 08:27:23] [INFO ] Deduced a trap composed of 11 places in 131 ms of which 1 ms to minimize.
[2022-05-19 08:27:23] [INFO ] Deduced a trap composed of 9 places in 150 ms of which 0 ms to minimize.
[2022-05-19 08:27:23] [INFO ] Deduced a trap composed of 8 places in 150 ms of which 1 ms to minimize.
[2022-05-19 08:27:23] [INFO ] Deduced a trap composed of 8 places in 139 ms of which 1 ms to minimize.
[2022-05-19 08:27:24] [INFO ] Deduced a trap composed of 14 places in 146 ms of which 1 ms to minimize.
[2022-05-19 08:27:24] [INFO ] Deduced a trap composed of 18 places in 124 ms of which 0 ms to minimize.
[2022-05-19 08:27:24] [INFO ] Deduced a trap composed of 13 places in 101 ms of which 1 ms to minimize.
[2022-05-19 08:27:24] [INFO ] Deduced a trap composed of 17 places in 116 ms of which 1 ms to minimize.
[2022-05-19 08:27:24] [INFO ] Deduced a trap composed of 17 places in 108 ms of which 1 ms to minimize.
[2022-05-19 08:27:25] [INFO ] Deduced a trap composed of 9 places in 94 ms of which 0 ms to minimize.
[2022-05-19 08:27:25] [INFO ] Deduced a trap composed of 7 places in 87 ms of which 1 ms to minimize.
[2022-05-19 08:27:25] [INFO ] Deduced a trap composed of 13 places in 79 ms of which 0 ms to minimize.
[2022-05-19 08:27:25] [INFO ] Deduced a trap composed of 8 places in 75 ms of which 1 ms to minimize.
[2022-05-19 08:27:25] [INFO ] Deduced a trap composed of 9 places in 82 ms of which 0 ms to minimize.
[2022-05-19 08:27:26] [INFO ] Deduced a trap composed of 8 places in 75 ms of which 0 ms to minimize.
[2022-05-19 08:27:26] [INFO ] Deduced a trap composed of 4 places in 67 ms of which 0 ms to minimize.
[2022-05-19 08:27:26] [INFO ] Trap strengthening (SAT) tested/added 26/25 trap constraints in 5266 ms
[2022-05-19 08:27:26] [INFO ] Deduced a trap composed of 5 places in 71 ms of which 1 ms to minimize.
[2022-05-19 08:27:26] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 238 ms
[2022-05-19 08:27:27] [INFO ] Deduced a trap composed of 3 places in 62 ms of which 0 ms to minimize.
[2022-05-19 08:27:27] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 231 ms
[2022-05-19 08:27:27] [INFO ] Deduced a trap composed of 11 places in 71 ms of which 0 ms to minimize.
[2022-05-19 08:27:27] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 238 ms
[2022-05-19 08:27:28] [INFO ] Deduced a trap composed of 4 places in 57 ms of which 0 ms to minimize.
[2022-05-19 08:27:28] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 232 ms
[2022-05-19 08:27:28] [INFO ] Deduced a trap composed of 15 places in 76 ms of which 0 ms to minimize.
[2022-05-19 08:27:28] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 249 ms
[2022-05-19 08:27:29] [INFO ] Deduced a trap composed of 15 places in 72 ms of which 0 ms to minimize.
[2022-05-19 08:27:29] [INFO ] Deduced a trap composed of 18 places in 63 ms of which 1 ms to minimize.
[2022-05-19 08:27:29] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 392 ms
[2022-05-19 08:27:29] [INFO ] After 10985ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :15
Attempting to minimize the solution found.
Minimization took 1351 ms.
[2022-05-19 08:27:30] [INFO ] After 13824ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :15
Parikh walk visited 0 properties in 1452 ms.
Support contains 25 out of 2521 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 2521/2521 places, 2422/2422 transitions.
Partial Free-agglomeration rule applied 4 times.
Drop transitions removed 4 transitions
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 2521 transition count 2422
Applied a total of 4 rules in 161 ms. Remains 2521 /2521 variables (removed 0) and now considering 2422/2422 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 2521/2521 places, 2422/2422 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 450 ms. (steps per millisecond=22 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 15) seen :0
Interrupted probabilistic random walk after 64130 steps, run timeout after 3003 ms. (steps per millisecond=21 ) properties seen :{}
Probabilistic random walk after 64130 steps, saw 62766 distinct states, run finished after 3005 ms. (steps per millisecond=21 ) properties seen :0
Running SMT prover for 15 properties.
// Phase 1: matrix 2422 rows 2521 cols
[2022-05-19 08:27:36] [INFO ] Computed 900 place invariants in 22 ms
[2022-05-19 08:27:37] [INFO ] After 839ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:15
[2022-05-19 08:27:37] [INFO ] [Nat]Absence check using 896 positive place invariants in 158 ms returned sat
[2022-05-19 08:27:37] [INFO ] [Nat]Absence check using 896 positive and 4 generalized place invariants in 1 ms returned sat
[2022-05-19 08:27:40] [INFO ] After 2395ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :15
[2022-05-19 08:27:41] [INFO ] Deduced a trap composed of 4 places in 148 ms of which 0 ms to minimize.
[2022-05-19 08:27:41] [INFO ] Deduced a trap composed of 4 places in 143 ms of which 0 ms to minimize.
[2022-05-19 08:27:41] [INFO ] Deduced a trap composed of 6 places in 142 ms of which 0 ms to minimize.
[2022-05-19 08:27:41] [INFO ] Deduced a trap composed of 6 places in 143 ms of which 0 ms to minimize.
[2022-05-19 08:27:42] [INFO ] Deduced a trap composed of 4 places in 131 ms of which 0 ms to minimize.
[2022-05-19 08:27:42] [INFO ] Deduced a trap composed of 4 places in 119 ms of which 1 ms to minimize.
[2022-05-19 08:27:42] [INFO ] Deduced a trap composed of 5 places in 140 ms of which 0 ms to minimize.
[2022-05-19 08:27:42] [INFO ] Deduced a trap composed of 3 places in 122 ms of which 0 ms to minimize.
[2022-05-19 08:27:42] [INFO ] Deduced a trap composed of 4 places in 136 ms of which 1 ms to minimize.
[2022-05-19 08:27:43] [INFO ] Deduced a trap composed of 11 places in 132 ms of which 1 ms to minimize.
[2022-05-19 08:27:43] [INFO ] Deduced a trap composed of 5 places in 131 ms of which 1 ms to minimize.
[2022-05-19 08:27:43] [INFO ] Deduced a trap composed of 8 places in 129 ms of which 1 ms to minimize.
[2022-05-19 08:27:43] [INFO ] Deduced a trap composed of 17 places in 116 ms of which 0 ms to minimize.
[2022-05-19 08:27:43] [INFO ] Deduced a trap composed of 8 places in 104 ms of which 0 ms to minimize.
[2022-05-19 08:27:44] [INFO ] Deduced a trap composed of 17 places in 108 ms of which 1 ms to minimize.
[2022-05-19 08:27:44] [INFO ] Deduced a trap composed of 5 places in 105 ms of which 0 ms to minimize.
[2022-05-19 08:27:44] [INFO ] Deduced a trap composed of 20 places in 101 ms of which 1 ms to minimize.
[2022-05-19 08:27:44] [INFO ] Deduced a trap composed of 8 places in 88 ms of which 1 ms to minimize.
[2022-05-19 08:27:44] [INFO ] Deduced a trap composed of 12 places in 94 ms of which 0 ms to minimize.
[2022-05-19 08:27:45] [INFO ] Deduced a trap composed of 14 places in 135 ms of which 1 ms to minimize.
[2022-05-19 08:27:45] [INFO ] Deduced a trap composed of 9 places in 133 ms of which 0 ms to minimize.
[2022-05-19 08:27:45] [INFO ] Deduced a trap composed of 12 places in 135 ms of which 1 ms to minimize.
[2022-05-19 08:27:45] [INFO ] Deduced a trap composed of 8 places in 134 ms of which 1 ms to minimize.
[2022-05-19 08:27:45] [INFO ] Deduced a trap composed of 8 places in 132 ms of which 0 ms to minimize.
[2022-05-19 08:27:46] [INFO ] Deduced a trap composed of 17 places in 113 ms of which 0 ms to minimize.
[2022-05-19 08:27:46] [INFO ] Trap strengthening (SAT) tested/added 26/25 trap constraints in 5230 ms
[2022-05-19 08:27:47] [INFO ] Deduced a trap composed of 4 places in 103 ms of which 1 ms to minimize.
[2022-05-19 08:27:47] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 262 ms
[2022-05-19 08:27:47] [INFO ] Deduced a trap composed of 23 places in 104 ms of which 0 ms to minimize.
[2022-05-19 08:27:47] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 267 ms
[2022-05-19 08:27:48] [INFO ] Deduced a trap composed of 15 places in 83 ms of which 1 ms to minimize.
[2022-05-19 08:27:48] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 254 ms
[2022-05-19 08:27:48] [INFO ] After 10292ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :15
Attempting to minimize the solution found.
Minimization took 1299 ms.
[2022-05-19 08:27:50] [INFO ] After 13172ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :15
Fused 15 Parikh solutions to 12 different solutions.
Parikh walk visited 0 properties in 1440 ms.
Support contains 25 out of 2521 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 2521/2521 places, 2422/2422 transitions.
Applied a total of 0 rules in 86 ms. Remains 2521 /2521 variables (removed 0) and now considering 2422/2422 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 2521/2521 places, 2422/2422 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 2521/2521 places, 2422/2422 transitions.
Applied a total of 0 rules in 88 ms. Remains 2521 /2521 variables (removed 0) and now considering 2422/2422 (removed 0) transitions.
// Phase 1: matrix 2422 rows 2521 cols
[2022-05-19 08:27:51] [INFO ] Computed 900 place invariants in 25 ms
[2022-05-19 08:27:53] [INFO ] Implicit Places using invariants in 1679 ms returned []
// Phase 1: matrix 2422 rows 2521 cols
[2022-05-19 08:27:53] [INFO ] Computed 900 place invariants in 20 ms
[2022-05-19 08:27:57] [INFO ] Implicit Places using invariants and state equation in 3901 ms returned []
Implicit Place search using SMT with State Equation took 5584 ms to find 0 implicit places.
[2022-05-19 08:27:57] [INFO ] Redundant transitions in 163 ms returned []
// Phase 1: matrix 2422 rows 2521 cols
[2022-05-19 08:27:57] [INFO ] Computed 900 place invariants in 27 ms
[2022-05-19 08:27:58] [INFO ] Dead Transitions using invariants and state equation in 1419 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 2521/2521 places, 2422/2422 transitions.
Computed a total of 1202 stabilizing places and 1202 stable transitions
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(p0) U !(G(X(F(p1)))&&p0))))'
Support contains 4 out of 5308 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 5308/5308 places, 5208/5208 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 5302 transition count 5202
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 5302 transition count 5202
Applied a total of 12 rules in 821 ms. Remains 5302 /5308 variables (removed 6) and now considering 5202/5208 (removed 6) transitions.
// Phase 1: matrix 5202 rows 5302 cols
[2022-05-19 08:28:00] [INFO ] Computed 901 place invariants in 26 ms
[2022-05-19 08:28:01] [INFO ] Implicit Places using invariants in 1666 ms returned []
// Phase 1: matrix 5202 rows 5302 cols
[2022-05-19 08:28:01] [INFO ] Computed 901 place invariants in 33 ms
[2022-05-19 08:28:03] [INFO ] Implicit Places using invariants and state equation in 1709 ms returned []
Implicit Place search using SMT with State Equation took 3377 ms to find 0 implicit places.
// Phase 1: matrix 5202 rows 5302 cols
[2022-05-19 08:28:03] [INFO ] Computed 901 place invariants in 23 ms
[2022-05-19 08:28:06] [INFO ] Dead Transitions using invariants and state equation in 3323 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 5302/5308 places, 5202/5208 transitions.
Finished structural reductions, in 1 iterations. Remains : 5302/5308 places, 5202/5208 transitions.
Stuttering acceptance computed with spot in 293 ms :[(AND p0 p1), (AND p0 p1), (AND (NOT p0) p1), p1]
Running random walk in product with property : ShieldIIPs-PT-100B-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 1}, { cond=(AND p0 p1), acceptance={0} source=1 dest: 1}, { cond=p0, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 3}], [{ cond=(NOT p1), acceptance={} source=3 dest: 3}, { cond=p1, acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(EQ s1602 1), p1:(AND (EQ s2983 1) (EQ s2991 1) (EQ s3012 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 3245 ms.
Product exploration explored 100000 steps with 50000 reset in 3205 ms.
Computed a total of 1199 stabilizing places and 1199 stable transitions
Computed a total of 1199 stabilizing places and 1199 stable transitions
Detected a total of 1199/5302 stabilizing places and 1199/5202 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT (AND p0 (NOT p1)))), (X (NOT p0)), (X (NOT (AND p0 p1))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT p0))), (X (X (NOT (AND p0 p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (NOT p0))
Knowledge based reduction with 8 factoid took 120 ms. Reduced automaton from 4 states, 7 edges and 2 AP to 1 states, 0 edges and 0 AP.
FORMULA ShieldIIPs-PT-100B-LTLFireability-00 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ShieldIIPs-PT-100B-LTLFireability-00 finished in 14601 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F((p0 U G(F(p0)))))'
Support contains 1 out of 5308 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 5308/5308 places, 5208/5208 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 501 transitions
Trivial Post-agglo rules discarded 501 transitions
Performed 501 trivial Post agglomeration. Transition count delta: 501
Iterating post reduction 0 with 501 rules applied. Total rules applied 501 place count 5307 transition count 4706
Reduce places removed 501 places and 0 transitions.
Iterating post reduction 1 with 501 rules applied. Total rules applied 1002 place count 4806 transition count 4706
Performed 501 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 501 Pre rules applied. Total rules applied 1002 place count 4806 transition count 4205
Deduced a syphon composed of 501 places in 20 ms
Reduce places removed 501 places and 0 transitions.
Iterating global reduction 2 with 1002 rules applied. Total rules applied 2004 place count 4305 transition count 4205
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 2009 place count 4300 transition count 4200
Iterating global reduction 2 with 5 rules applied. Total rules applied 2014 place count 4300 transition count 4200
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 2014 place count 4300 transition count 4198
Deduced a syphon composed of 2 places in 17 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 2018 place count 4298 transition count 4198
Performed 1795 Post agglomeration using F-continuation condition.Transition count delta: 1795
Deduced a syphon composed of 1795 places in 12 ms
Reduce places removed 1795 places and 0 transitions.
Iterating global reduction 2 with 3590 rules applied. Total rules applied 5608 place count 2503 transition count 2403
Renaming transitions due to excessive name length > 1024 char.
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 5610 place count 2501 transition count 2401
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 5611 place count 2500 transition count 2401
Applied a total of 5611 rules in 1313 ms. Remains 2500 /5308 variables (removed 2808) and now considering 2401/5208 (removed 2807) transitions.
// Phase 1: matrix 2401 rows 2500 cols
[2022-05-19 08:28:15] [INFO ] Computed 900 place invariants in 5 ms
[2022-05-19 08:28:16] [INFO ] Implicit Places using invariants in 1355 ms returned []
// Phase 1: matrix 2401 rows 2500 cols
[2022-05-19 08:28:16] [INFO ] Computed 900 place invariants in 7 ms
[2022-05-19 08:28:19] [INFO ] Implicit Places using invariants and state equation in 3122 ms returned []
Implicit Place search using SMT with State Equation took 4478 ms to find 0 implicit places.
[2022-05-19 08:28:20] [INFO ] Redundant transitions in 334 ms returned [2400]
Found 1 redundant transitions using SMT.
Drop transitions removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
// Phase 1: matrix 2400 rows 2500 cols
[2022-05-19 08:28:20] [INFO ] Computed 900 place invariants in 8 ms
[2022-05-19 08:28:21] [INFO ] Dead Transitions using invariants and state equation in 1474 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 2500/5308 places, 2400/5208 transitions.
Applied a total of 0 rules in 87 ms. Remains 2500 /2500 variables (removed 0) and now considering 2400/2400 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 2500/5308 places, 2400/5208 transitions.
Stuttering acceptance computed with spot in 71 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ShieldIIPs-PT-100B-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(EQ s2116 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 5082 steps with 0 reset in 83 ms.
FORMULA ShieldIIPs-PT-100B-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPs-PT-100B-LTLFireability-02 finished in 7884 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(X(X(F((X(X(p0))||X(X((F(p1)||p0)))))))))'
Support contains 2 out of 5308 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 5308/5308 places, 5208/5208 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 500 transitions
Trivial Post-agglo rules discarded 500 transitions
Performed 500 trivial Post agglomeration. Transition count delta: 500
Iterating post reduction 0 with 500 rules applied. Total rules applied 500 place count 5307 transition count 4707
Reduce places removed 500 places and 0 transitions.
Iterating post reduction 1 with 500 rules applied. Total rules applied 1000 place count 4807 transition count 4707
Performed 500 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 500 Pre rules applied. Total rules applied 1000 place count 4807 transition count 4207
Deduced a syphon composed of 500 places in 19 ms
Reduce places removed 500 places and 0 transitions.
Iterating global reduction 2 with 1000 rules applied. Total rules applied 2000 place count 4307 transition count 4207
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 2004 place count 4303 transition count 4203
Iterating global reduction 2 with 4 rules applied. Total rules applied 2008 place count 4303 transition count 4203
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 2008 place count 4303 transition count 4202
Deduced a syphon composed of 1 places in 17 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 2010 place count 4302 transition count 4202
Performed 1797 Post agglomeration using F-continuation condition.Transition count delta: 1797
Deduced a syphon composed of 1797 places in 12 ms
Reduce places removed 1797 places and 0 transitions.
Iterating global reduction 2 with 3594 rules applied. Total rules applied 5604 place count 2505 transition count 2405
Renaming transitions due to excessive name length > 1024 char.
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 5606 place count 2503 transition count 2403
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 5607 place count 2502 transition count 2403
Applied a total of 5607 rules in 1168 ms. Remains 2502 /5308 variables (removed 2806) and now considering 2403/5208 (removed 2805) transitions.
// Phase 1: matrix 2403 rows 2502 cols
[2022-05-19 08:28:22] [INFO ] Computed 900 place invariants in 9 ms
[2022-05-19 08:28:24] [INFO ] Implicit Places using invariants in 1275 ms returned []
// Phase 1: matrix 2403 rows 2502 cols
[2022-05-19 08:28:24] [INFO ] Computed 900 place invariants in 4 ms
[2022-05-19 08:28:27] [INFO ] Implicit Places using invariants and state equation in 3131 ms returned []
Implicit Place search using SMT with State Equation took 4407 ms to find 0 implicit places.
[2022-05-19 08:28:27] [INFO ] Redundant transitions in 258 ms returned [2402]
Found 1 redundant transitions using SMT.
Drop transitions removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
// Phase 1: matrix 2402 rows 2502 cols
[2022-05-19 08:28:27] [INFO ] Computed 900 place invariants in 4 ms
[2022-05-19 08:28:29] [INFO ] Dead Transitions using invariants and state equation in 1414 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 2502/5308 places, 2402/5208 transitions.
Applied a total of 0 rules in 95 ms. Remains 2502 /2502 variables (removed 0) and now considering 2402/2402 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 2502/5308 places, 2402/5208 transitions.
Stuttering acceptance computed with spot in 65 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : ShieldIIPs-PT-100B-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(EQ s774 0), p1:(EQ s844 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 19 reset in 1586 ms.
Product exploration explored 100000 steps with 19 reset in 1906 ms.
Computed a total of 2 stabilizing places and 2 stable transitions
Computed a total of 2 stabilizing places and 2 stable transitions
Detected a total of 2/2502 stabilizing places and 2/2402 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 123 ms. Reduced automaton from 2 states, 3 edges and 2 AP to 2 states, 3 edges and 2 AP.
Stuttering acceptance computed with spot in 62 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 158 ms. (steps per millisecond=63 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 107 ms. (steps per millisecond=93 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 109314 steps, run timeout after 3001 ms. (steps per millisecond=36 ) properties seen :{}
Probabilistic random walk after 109314 steps, saw 101798 distinct states, run finished after 3001 ms. (steps per millisecond=36 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 2402 rows 2502 cols
[2022-05-19 08:28:36] [INFO ] Computed 900 place invariants in 10 ms
[2022-05-19 08:28:36] [INFO ] After 260ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-19 08:28:36] [INFO ] [Nat]Absence check using 900 positive place invariants in 154 ms returned sat
[2022-05-19 08:28:38] [INFO ] After 1223ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-19 08:28:38] [INFO ] Deduced a trap composed of 8 places in 45 ms of which 1 ms to minimize.
[2022-05-19 08:28:38] [INFO ] Deduced a trap composed of 19 places in 40 ms of which 0 ms to minimize.
[2022-05-19 08:28:38] [INFO ] Deduced a trap composed of 19 places in 37 ms of which 0 ms to minimize.
[2022-05-19 08:28:38] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 452 ms
[2022-05-19 08:28:38] [INFO ] After 1738ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 90 ms.
[2022-05-19 08:28:38] [INFO ] After 2266ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 50 ms.
Support contains 2 out of 2502 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 2502/2502 places, 2402/2402 transitions.
Partial Free-agglomeration rule applied 598 times.
Drop transitions removed 598 transitions
Iterating global reduction 0 with 598 rules applied. Total rules applied 598 place count 2502 transition count 2402
Applied a total of 598 rules in 167 ms. Remains 2502 /2502 variables (removed 0) and now considering 2402/2402 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 2502/2502 places, 2402/2402 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 171 ms. (steps per millisecond=58 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 116 ms. (steps per millisecond=86 ) properties (out of 1) seen :0
Finished probabilistic random walk after 123511 steps, run visited all 1 properties in 2427 ms. (steps per millisecond=50 )
Probabilistic random walk after 123511 steps, saw 122460 distinct states, run finished after 2428 ms. (steps per millisecond=50 ) properties seen :1
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (AND (NOT p1) (NOT p0)))]
Knowledge based reduction with 4 factoid took 133 ms. Reduced automaton from 2 states, 3 edges and 2 AP to 2 states, 3 edges and 2 AP.
Stuttering acceptance computed with spot in 67 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 57 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Support contains 2 out of 2502 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2502/2502 places, 2402/2402 transitions.
Applied a total of 0 rules in 92 ms. Remains 2502 /2502 variables (removed 0) and now considering 2402/2402 (removed 0) transitions.
// Phase 1: matrix 2402 rows 2502 cols
[2022-05-19 08:28:42] [INFO ] Computed 900 place invariants in 7 ms
[2022-05-19 08:28:43] [INFO ] Implicit Places using invariants in 1403 ms returned []
// Phase 1: matrix 2402 rows 2502 cols
[2022-05-19 08:28:43] [INFO ] Computed 900 place invariants in 10 ms
[2022-05-19 08:28:46] [INFO ] Implicit Places using invariants and state equation in 3164 ms returned []
Implicit Place search using SMT with State Equation took 4570 ms to find 0 implicit places.
[2022-05-19 08:28:46] [INFO ] Redundant transitions in 266 ms returned []
// Phase 1: matrix 2402 rows 2502 cols
[2022-05-19 08:28:46] [INFO ] Computed 900 place invariants in 9 ms
[2022-05-19 08:28:48] [INFO ] Dead Transitions using invariants and state equation in 1479 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 2502/2502 places, 2402/2402 transitions.
Computed a total of 2 stabilizing places and 2 stable transitions
Computed a total of 2 stabilizing places and 2 stable transitions
Detected a total of 2/2502 stabilizing places and 2/2402 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND p1 p0), (X (NOT (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 154 ms. Reduced automaton from 2 states, 3 edges and 2 AP to 2 states, 3 edges and 2 AP.
Stuttering acceptance computed with spot in 73 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 179 ms. (steps per millisecond=55 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 118 ms. (steps per millisecond=84 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 112146 steps, run timeout after 3001 ms. (steps per millisecond=37 ) properties seen :{}
Probabilistic random walk after 112146 steps, saw 104272 distinct states, run finished after 3001 ms. (steps per millisecond=37 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 2402 rows 2502 cols
[2022-05-19 08:28:51] [INFO ] Computed 900 place invariants in 8 ms
[2022-05-19 08:28:52] [INFO ] After 234ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-19 08:28:52] [INFO ] [Nat]Absence check using 900 positive place invariants in 139 ms returned sat
[2022-05-19 08:28:53] [INFO ] After 1097ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-19 08:28:53] [INFO ] Deduced a trap composed of 8 places in 44 ms of which 1 ms to minimize.
[2022-05-19 08:28:53] [INFO ] Deduced a trap composed of 19 places in 42 ms of which 1 ms to minimize.
[2022-05-19 08:28:54] [INFO ] Deduced a trap composed of 19 places in 37 ms of which 0 ms to minimize.
[2022-05-19 08:28:54] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 436 ms
[2022-05-19 08:28:54] [INFO ] After 1594ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 83 ms.
[2022-05-19 08:28:54] [INFO ] After 2082ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 42 ms.
Support contains 2 out of 2502 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 2502/2502 places, 2402/2402 transitions.
Partial Free-agglomeration rule applied 598 times.
Drop transitions removed 598 transitions
Iterating global reduction 0 with 598 rules applied. Total rules applied 598 place count 2502 transition count 2402
Applied a total of 598 rules in 153 ms. Remains 2502 /2502 variables (removed 0) and now considering 2402/2402 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 2502/2502 places, 2402/2402 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 185 ms. (steps per millisecond=54 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 122 ms. (steps per millisecond=81 ) properties (out of 1) seen :0
Finished probabilistic random walk after 123511 steps, run visited all 1 properties in 2561 ms. (steps per millisecond=48 )
Probabilistic random walk after 123511 steps, saw 122460 distinct states, run finished after 2561 ms. (steps per millisecond=48 ) properties seen :1
Knowledge obtained : [(AND p1 p0), (X (NOT (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (AND (NOT p1) (NOT p0)))]
Knowledge based reduction with 4 factoid took 148 ms. Reduced automaton from 2 states, 3 edges and 2 AP to 2 states, 3 edges and 2 AP.
Stuttering acceptance computed with spot in 57 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 50 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 53 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Product exploration explored 100000 steps with 19 reset in 1679 ms.
Product exploration explored 100000 steps with 19 reset in 2027 ms.
Built C files in :
/tmp/ltsmin6927184201255733278
[2022-05-19 08:29:01] [INFO ] Too many transitions (2402) to apply POR reductions. Disabling POR matrices.
[2022-05-19 08:29:01] [INFO ] Built C files in 49ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6927184201255733278
Running compilation step : cd /tmp/ltsmin6927184201255733278;'/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/ltsmin6927184201255733278;'/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/ltsmin6927184201255733278;'/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 2 out of 2502 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2502/2502 places, 2402/2402 transitions.
Applied a total of 0 rules in 113 ms. Remains 2502 /2502 variables (removed 0) and now considering 2402/2402 (removed 0) transitions.
// Phase 1: matrix 2402 rows 2502 cols
[2022-05-19 08:29:04] [INFO ] Computed 900 place invariants in 17 ms
[2022-05-19 08:29:06] [INFO ] Implicit Places using invariants in 1478 ms returned []
// Phase 1: matrix 2402 rows 2502 cols
[2022-05-19 08:29:06] [INFO ] Computed 900 place invariants in 4 ms
[2022-05-19 08:29:10] [INFO ] Implicit Places using invariants and state equation in 4674 ms returned []
Implicit Place search using SMT with State Equation took 6158 ms to find 0 implicit places.
[2022-05-19 08:29:11] [INFO ] Redundant transitions in 263 ms returned []
// Phase 1: matrix 2402 rows 2502 cols
[2022-05-19 08:29:11] [INFO ] Computed 900 place invariants in 4 ms
[2022-05-19 08:29:12] [INFO ] Dead Transitions using invariants and state equation in 1462 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 2502/2502 places, 2402/2402 transitions.
Built C files in :
/tmp/ltsmin3797458270094683691
[2022-05-19 08:29:12] [INFO ] Too many transitions (2402) to apply POR reductions. Disabling POR matrices.
[2022-05-19 08:29:12] [INFO ] Built C files in 29ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3797458270094683691
Running compilation step : cd /tmp/ltsmin3797458270094683691;'/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/ltsmin3797458270094683691;'/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/ltsmin3797458270094683691;'/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-19 08:29:15] [INFO ] Flatten gal took : 114 ms
[2022-05-19 08:29:16] [INFO ] Flatten gal took : 116 ms
[2022-05-19 08:29:16] [INFO ] Time to serialize gal into /tmp/LTL13826422849238384348.gal : 20 ms
[2022-05-19 08:29:16] [INFO ] Time to serialize properties into /tmp/LTL4296982687998264702.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/LTL13826422849238384348.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL4296982687998264702.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/LTL1382642...267
Read 1 LTL properties
Checking formula 0 : !((G(X(X(F((X(X("(p1920==0)")))||(X(X((F("(p2085==0)"))||("(p1920==0)"))))))))))
Formula 0 simplified : !GXXF(XX"(p1920==0)" | XX("(p1920==0)" | F"(p2085==0)"))
Detected timeout of ITS tools.
[2022-05-19 08:29:31] [INFO ] Flatten gal took : 106 ms
[2022-05-19 08:29:31] [INFO ] Applying decomposition
[2022-05-19 08:29:31] [INFO ] Flatten gal took : 107 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/graph2215114040745921516.txt' '-o' '/tmp/graph2215114040745921516.bin' '-w' '/tmp/graph2215114040745921516.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph2215114040745921516.bin' '-l' '-1' '-v' '-w' '/tmp/graph2215114040745921516.weights' '-q' '0' '-e' '0.001'
[2022-05-19 08:29:31] [INFO ] Decomposing Gal with order
[2022-05-19 08:29:31] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-19 08:29:32] [INFO ] Removed a total of 1597 redundant transitions.
[2022-05-19 08:29:32] [INFO ] Flatten gal took : 248 ms
[2022-05-19 08:29:32] [INFO ] Fuse similar labels procedure discarded/fused a total of 1526 labels/synchronizations in 49 ms.
[2022-05-19 08:29:32] [INFO ] Time to serialize gal into /tmp/LTL14750831489739744862.gal : 30 ms
[2022-05-19 08:29:32] [INFO ] Time to serialize properties into /tmp/LTL5409714568640404.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/LTL14750831489739744862.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL5409714568640404.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/LTL1475083...243
Read 1 LTL properties
Checking formula 0 : !((G(X(X(F((X(X("(i13.i0.i2.u278.p1920==0)")))||(X(X((F("(i14.i1.i0.u305.p2085==0)"))||("(i13.i0.i2.u278.p1920==0)"))))))))))
Formula 0 simplified : !GXXF(XX"(i13.i0.i2.u278.p1920==0)" | XX("(i13.i0.i2.u278.p1920==0)" | F"(i14.i1.i0.u305.p2085==0)"))
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin7305057980979083697
[2022-05-19 08:29:47] [INFO ] Built C files in 29ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7305057980979083697
Running compilation step : cd /tmp/ltsmin7305057980979083697;'/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/ltsmin7305057980979083697;'/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/ltsmin7305057980979083697;'/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)
Treatment of property ShieldIIPs-PT-100B-LTLFireability-04 finished in 88842 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(((!X(p0) U p1)||G(G(p2))))))'
Support contains 3 out of 5308 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 5308/5308 places, 5208/5208 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 5303 transition count 5203
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 5303 transition count 5203
Applied a total of 10 rules in 839 ms. Remains 5303 /5308 variables (removed 5) and now considering 5203/5208 (removed 5) transitions.
// Phase 1: matrix 5203 rows 5303 cols
[2022-05-19 08:29:51] [INFO ] Computed 901 place invariants in 25 ms
[2022-05-19 08:29:53] [INFO ] Implicit Places using invariants in 1619 ms returned []
// Phase 1: matrix 5203 rows 5303 cols
[2022-05-19 08:29:53] [INFO ] Computed 901 place invariants in 27 ms
[2022-05-19 08:29:54] [INFO ] Implicit Places using invariants and state equation in 1699 ms returned []
Implicit Place search using SMT with State Equation took 3318 ms to find 0 implicit places.
// Phase 1: matrix 5203 rows 5303 cols
[2022-05-19 08:29:54] [INFO ] Computed 901 place invariants in 18 ms
[2022-05-19 08:29:58] [INFO ] Dead Transitions using invariants and state equation in 3481 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 5303/5308 places, 5203/5208 transitions.
Finished structural reductions, in 1 iterations. Remains : 5303/5308 places, 5203/5208 transitions.
Stuttering acceptance computed with spot in 237 ms :[true, (OR (NOT p1) p0), (AND (NOT p1) (NOT p2)), (OR (AND (NOT p1) (NOT p2)) (AND p0 (NOT p2))), (NOT p2), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : ShieldIIPs-PT-100B-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=p0, acceptance={0} source=1 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=2 dest: 1}, { cond=(AND (NOT p1) p2), acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p2) p0), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p1) (NOT p2) (NOT p0)), acceptance={} source=3 dest: 1}, { cond=(AND (NOT p1) p2 (NOT p0)), acceptance={} source=3 dest: 3}, { cond=(AND p2 p0), acceptance={} source=3 dest: 4}], [{ cond=(NOT p2), acceptance={} source=4 dest: 0}, { cond=p2, acceptance={} source=4 dest: 4}], [{ cond=true, acceptance={} source=5 dest: 6}], [{ cond=true, acceptance={} source=6 dest: 2}]], initial=5, aps=[p0:(EQ s4184 1), p1:(AND (EQ s1273 1) (EQ s1317 1)), p2:(OR (EQ s1273 0) (EQ s1317 0))], 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, null, null, null][false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 10061 steps with 0 reset in 160 ms.
FORMULA ShieldIIPs-PT-100B-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPs-PT-100B-LTLFireability-05 finished in 8094 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((!G(!p0) U F(p1)))'
Support contains 5 out of 5308 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 5308/5308 places, 5208/5208 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 499 transitions
Trivial Post-agglo rules discarded 499 transitions
Performed 499 trivial Post agglomeration. Transition count delta: 499
Iterating post reduction 0 with 499 rules applied. Total rules applied 499 place count 5307 transition count 4708
Reduce places removed 499 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 500 rules applied. Total rules applied 999 place count 4808 transition count 4707
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 1000 place count 4807 transition count 4707
Performed 500 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 500 Pre rules applied. Total rules applied 1000 place count 4807 transition count 4207
Deduced a syphon composed of 500 places in 21 ms
Reduce places removed 500 places and 0 transitions.
Iterating global reduction 3 with 1000 rules applied. Total rules applied 2000 place count 4307 transition count 4207
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 2006 place count 4301 transition count 4201
Iterating global reduction 3 with 6 rules applied. Total rules applied 2012 place count 4301 transition count 4201
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 2012 place count 4301 transition count 4199
Deduced a syphon composed of 2 places in 17 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 2016 place count 4299 transition count 4199
Performed 1793 Post agglomeration using F-continuation condition.Transition count delta: 1793
Deduced a syphon composed of 1793 places in 13 ms
Reduce places removed 1793 places and 0 transitions.
Iterating global reduction 3 with 3586 rules applied. Total rules applied 5602 place count 2506 transition count 2406
Renaming transitions due to excessive name length > 1024 char.
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 5604 place count 2504 transition count 2404
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 5605 place count 2503 transition count 2404
Applied a total of 5605 rules in 1206 ms. Remains 2503 /5308 variables (removed 2805) and now considering 2404/5208 (removed 2804) transitions.
// Phase 1: matrix 2404 rows 2503 cols
[2022-05-19 08:29:59] [INFO ] Computed 900 place invariants in 12 ms
[2022-05-19 08:30:01] [INFO ] Implicit Places using invariants in 1365 ms returned []
// Phase 1: matrix 2404 rows 2503 cols
[2022-05-19 08:30:01] [INFO ] Computed 900 place invariants in 10 ms
[2022-05-19 08:30:04] [INFO ] Implicit Places using invariants and state equation in 3288 ms returned []
Implicit Place search using SMT with State Equation took 4655 ms to find 0 implicit places.
[2022-05-19 08:30:05] [INFO ] Redundant transitions in 1011 ms returned [2403]
Found 1 redundant transitions using SMT.
Drop transitions removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
// Phase 1: matrix 2403 rows 2503 cols
[2022-05-19 08:30:05] [INFO ] Computed 900 place invariants in 5 ms
[2022-05-19 08:30:07] [INFO ] Dead Transitions using invariants and state equation in 1443 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 2503/5308 places, 2403/5208 transitions.
Applied a total of 0 rules in 81 ms. Remains 2503 /2503 variables (removed 0) and now considering 2403/2403 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 2503/5308 places, 2403/5208 transitions.
Stuttering acceptance computed with spot in 46 ms :[(NOT p1)]
Running random walk in product with property : ShieldIIPs-PT-100B-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p1:(AND (EQ s2498 1) (OR (EQ s2378 1) (AND (EQ s1736 1) (EQ s1741 1) (EQ s1752 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][true]]
Stuttering criterion allowed to conclude after 5097 steps with 1 reset in 90 ms.
FORMULA ShieldIIPs-PT-100B-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPs-PT-100B-LTLFireability-06 finished in 8579 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(X(F(G(p0))))))'
Support contains 1 out of 5308 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 5308/5308 places, 5208/5208 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 501 transitions
Trivial Post-agglo rules discarded 501 transitions
Performed 501 trivial Post agglomeration. Transition count delta: 501
Iterating post reduction 0 with 501 rules applied. Total rules applied 501 place count 5307 transition count 4706
Reduce places removed 501 places and 0 transitions.
Iterating post reduction 1 with 501 rules applied. Total rules applied 1002 place count 4806 transition count 4706
Performed 501 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 501 Pre rules applied. Total rules applied 1002 place count 4806 transition count 4205
Deduced a syphon composed of 501 places in 21 ms
Reduce places removed 501 places and 0 transitions.
Iterating global reduction 2 with 1002 rules applied. Total rules applied 2004 place count 4305 transition count 4205
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 2010 place count 4299 transition count 4199
Iterating global reduction 2 with 6 rules applied. Total rules applied 2016 place count 4299 transition count 4199
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 2016 place count 4299 transition count 4197
Deduced a syphon composed of 2 places in 18 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 2020 place count 4297 transition count 4197
Performed 1793 Post agglomeration using F-continuation condition.Transition count delta: 1793
Deduced a syphon composed of 1793 places in 13 ms
Reduce places removed 1793 places and 0 transitions.
Iterating global reduction 2 with 3586 rules applied. Total rules applied 5606 place count 2504 transition count 2404
Renaming transitions due to excessive name length > 1024 char.
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 5608 place count 2502 transition count 2402
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 5609 place count 2501 transition count 2402
Applied a total of 5609 rules in 1206 ms. Remains 2501 /5308 variables (removed 2807) and now considering 2402/5208 (removed 2806) transitions.
// Phase 1: matrix 2402 rows 2501 cols
[2022-05-19 08:30:08] [INFO ] Computed 900 place invariants in 4 ms
[2022-05-19 08:30:09] [INFO ] Implicit Places using invariants in 1411 ms returned []
// Phase 1: matrix 2402 rows 2501 cols
[2022-05-19 08:30:09] [INFO ] Computed 900 place invariants in 4 ms
[2022-05-19 08:30:15] [INFO ] Implicit Places using invariants and state equation in 5867 ms returned []
Implicit Place search using SMT with State Equation took 7292 ms to find 0 implicit places.
[2022-05-19 08:30:16] [INFO ] Redundant transitions in 274 ms returned [2401]
Found 1 redundant transitions using SMT.
Drop transitions removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
// Phase 1: matrix 2401 rows 2501 cols
[2022-05-19 08:30:16] [INFO ] Computed 900 place invariants in 4 ms
[2022-05-19 08:30:17] [INFO ] Dead Transitions using invariants and state equation in 1462 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 2501/5308 places, 2401/5208 transitions.
Applied a total of 0 rules in 81 ms. Remains 2501 /2501 variables (removed 0) and now considering 2401/2401 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 2501/5308 places, 2401/5208 transitions.
Stuttering acceptance computed with spot in 37 ms :[(NOT p0)]
Running random walk in product with property : ShieldIIPs-PT-100B-LTLFireability-08 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 s1 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 4963 steps with 0 reset in 101 ms.
FORMULA ShieldIIPs-PT-100B-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPs-PT-100B-LTLFireability-08 finished in 10521 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F((!(G(F(p0)) U G(X(p1)))||p2)))'
Support contains 7 out of 5308 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 5308/5308 places, 5208/5208 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 5303 transition count 5203
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 5303 transition count 5203
Applied a total of 10 rules in 837 ms. Remains 5303 /5308 variables (removed 5) and now considering 5203/5208 (removed 5) transitions.
// Phase 1: matrix 5203 rows 5303 cols
[2022-05-19 08:30:18] [INFO ] Computed 901 place invariants in 24 ms
[2022-05-19 08:30:20] [INFO ] Implicit Places using invariants in 1773 ms returned []
// Phase 1: matrix 5203 rows 5303 cols
[2022-05-19 08:30:20] [INFO ] Computed 901 place invariants in 24 ms
[2022-05-19 08:30:22] [INFO ] Implicit Places using invariants and state equation in 1794 ms returned []
Implicit Place search using SMT with State Equation took 3569 ms to find 0 implicit places.
// Phase 1: matrix 5203 rows 5303 cols
[2022-05-19 08:30:22] [INFO ] Computed 901 place invariants in 23 ms
[2022-05-19 08:30:25] [INFO ] Dead Transitions using invariants and state equation in 3525 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 5303/5308 places, 5203/5208 transitions.
Finished structural reductions, in 1 iterations. Remains : 5303/5308 places, 5203/5208 transitions.
Stuttering acceptance computed with spot in 409 ms :[(AND p1 (NOT p2)), (AND p1 (NOT p2)), (AND (NOT p2) p1 p0), (AND (NOT p2) p1), (AND (NOT p2) p1 p0)]
Running random walk in product with property : ShieldIIPs-PT-100B-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=(NOT p2), acceptance={} source=0 dest: 1}], [{ cond=(NOT p2), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p2) p1), acceptance={} source=1 dest: 3}], [{ cond=(NOT p2), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p2) p0 p1), acceptance={} source=2 dest: 4}], [{ cond=(AND (NOT p2) p1), acceptance={0} source=3 dest: 3}], [{ cond=(AND (NOT p2) (NOT p0) p1), acceptance={} source=4 dest: 4}, { cond=(AND (NOT p2) p0 p1), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p2:(EQ s4570 1), p1:(AND (EQ s3971 1) (EQ s3979 1) (EQ s4001 1)), p0:(AND (EQ s5223 1) (EQ s5241 1) (EQ s5248 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 8 reset in 1655 ms.
Product exploration explored 100000 steps with 10 reset in 1891 ms.
Computed a total of 1199 stabilizing places and 1199 stable transitions
Computed a total of 1199 stabilizing places and 1199 stable transitions
Knowledge obtained : [(AND (NOT p2) (NOT p1) (NOT p0)), (X (NOT p2)), (X (NOT (AND (NOT p2) p1))), (X (X (NOT p2))), (X (X (NOT (AND (NOT p2) p0 p1)))), (X (X (NOT (AND (NOT p2) p1))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 6 factoid took 233 ms. Reduced automaton from 5 states, 8 edges and 3 AP to 3 states, 5 edges and 3 AP.
Stuttering acceptance computed with spot in 124 ms :[(AND (NOT p2) p0 p1), (AND (NOT p2) p0 p1), (AND (NOT p2) p0 p1)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 266 ms. (steps per millisecond=37 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 3) 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 3) 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 3) seen :0
Interrupted probabilistic random walk after 145018 steps, run timeout after 3002 ms. (steps per millisecond=48 ) properties seen :{}
Probabilistic random walk after 145018 steps, saw 142836 distinct states, run finished after 3002 ms. (steps per millisecond=48 ) properties seen :0
Running SMT prover for 3 properties.
// Phase 1: matrix 5203 rows 5303 cols
[2022-05-19 08:30:33] [INFO ] Computed 901 place invariants in 20 ms
[2022-05-19 08:30:34] [INFO ] [Real]Absence check using 901 positive place invariants in 547 ms returned sat
[2022-05-19 08:30:35] [INFO ] After 1338ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2022-05-19 08:30:36] [INFO ] [Nat]Absence check using 901 positive place invariants in 535 ms returned sat
[2022-05-19 08:30:40] [INFO ] After 4411ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2022-05-19 08:30:42] [INFO ] Deduced a trap composed of 22 places in 1700 ms of which 3 ms to minimize.
[2022-05-19 08:30:44] [INFO ] Deduced a trap composed of 23 places in 1715 ms of which 3 ms to minimize.
[2022-05-19 08:30:46] [INFO ] Deduced a trap composed of 23 places in 1762 ms of which 3 ms to minimize.
[2022-05-19 08:30:48] [INFO ] Deduced a trap composed of 19 places in 1710 ms of which 3 ms to minimize.
[2022-05-19 08:30:50] [INFO ] Deduced a trap composed of 19 places in 1718 ms of which 3 ms to minimize.
[2022-05-19 08:30:52] [INFO ] Deduced a trap composed of 34 places in 1706 ms of which 3 ms to minimize.
[2022-05-19 08:30:54] [INFO ] Deduced a trap composed of 31 places in 1714 ms of which 3 ms to minimize.
[2022-05-19 08:30:56] [INFO ] Deduced a trap composed of 39 places in 1742 ms of which 2 ms to minimize.
[2022-05-19 08:30:57] [INFO ] Deduced a trap composed of 34 places in 1739 ms of which 3 ms to minimize.
[2022-05-19 08:30:59] [INFO ] Deduced a trap composed of 36 places in 1776 ms of which 3 ms to minimize.
[2022-05-19 08:31:04] [INFO ] Deduced a trap composed of 12 places in 4757 ms of which 4 ms to minimize.
[2022-05-19 08:31:04] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2022-05-19 08:31:04] [INFO ] After 29811ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:3
Parikh walk visited 0 properties in 629 ms.
Support contains 7 out of 5303 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 5303/5303 places, 5203/5203 transitions.
Drop transitions removed 499 transitions
Trivial Post-agglo rules discarded 499 transitions
Performed 499 trivial Post agglomeration. Transition count delta: 499
Iterating post reduction 0 with 499 rules applied. Total rules applied 499 place count 5303 transition count 4704
Reduce places removed 499 places and 0 transitions.
Iterating post reduction 1 with 499 rules applied. Total rules applied 998 place count 4804 transition count 4704
Performed 501 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 501 Pre rules applied. Total rules applied 998 place count 4804 transition count 4203
Deduced a syphon composed of 501 places in 19 ms
Reduce places removed 501 places and 0 transitions.
Iterating global reduction 2 with 1002 rules applied. Total rules applied 2000 place count 4303 transition count 4203
Performed 1799 Post agglomeration using F-continuation condition.Transition count delta: 1799
Deduced a syphon composed of 1799 places in 12 ms
Reduce places removed 1799 places and 0 transitions.
Iterating global reduction 2 with 3598 rules applied. Total rules applied 5598 place count 2504 transition count 2404
Renaming transitions due to excessive name length > 1024 char.
Partial Free-agglomeration rule applied 696 times.
Drop transitions removed 696 transitions
Iterating global reduction 2 with 696 rules applied. Total rules applied 6294 place count 2504 transition count 2404
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 6295 place count 2503 transition count 2403
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 6296 place count 2502 transition count 2403
Applied a total of 6296 rules in 968 ms. Remains 2502 /5303 variables (removed 2801) and now considering 2403/5203 (removed 2800) transitions.
Finished structural reductions, in 1 iterations. Remains : 2502/5303 places, 2403/5203 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 201 ms. (steps per millisecond=49 ) properties (out of 3) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 107 ms. (steps per millisecond=93 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 2403 rows 2502 cols
[2022-05-19 08:31:06] [INFO ] Computed 900 place invariants in 34 ms
[2022-05-19 08:31:07] [INFO ] [Real]Absence check using 899 positive place invariants in 153 ms returned sat
[2022-05-19 08:31:07] [INFO ] [Real]Absence check using 899 positive and 1 generalized place invariants in 1 ms returned sat
[2022-05-19 08:31:08] [INFO ] After 1615ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-19 08:31:08] [INFO ] [Nat]Absence check using 899 positive place invariants in 159 ms returned sat
[2022-05-19 08:31:08] [INFO ] [Nat]Absence check using 899 positive and 1 generalized place invariants in 1 ms returned sat
[2022-05-19 08:31:10] [INFO ] After 1305ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-19 08:31:10] [INFO ] Deduced a trap composed of 4 places in 104 ms of which 0 ms to minimize.
[2022-05-19 08:31:10] [INFO ] Deduced a trap composed of 4 places in 104 ms of which 1 ms to minimize.
[2022-05-19 08:31:10] [INFO ] Deduced a trap composed of 4 places in 117 ms of which 1 ms to minimize.
[2022-05-19 08:31:10] [INFO ] Deduced a trap composed of 4 places in 109 ms of which 0 ms to minimize.
[2022-05-19 08:31:11] [INFO ] Deduced a trap composed of 17 places in 95 ms of which 1 ms to minimize.
[2022-05-19 08:31:11] [INFO ] Deduced a trap composed of 8 places in 87 ms of which 0 ms to minimize.
[2022-05-19 08:31:11] [INFO ] Deduced a trap composed of 9 places in 88 ms of which 0 ms to minimize.
[2022-05-19 08:31:11] [INFO ] Deduced a trap composed of 4 places in 87 ms of which 0 ms to minimize.
[2022-05-19 08:31:11] [INFO ] Deduced a trap composed of 11 places in 83 ms of which 0 ms to minimize.
[2022-05-19 08:31:11] [INFO ] Deduced a trap composed of 8 places in 78 ms of which 1 ms to minimize.
[2022-05-19 08:31:12] [INFO ] Deduced a trap composed of 17 places in 72 ms of which 0 ms to minimize.
[2022-05-19 08:31:12] [INFO ] Deduced a trap composed of 8 places in 61 ms of which 1 ms to minimize.
[2022-05-19 08:31:12] [INFO ] Trap strengthening (SAT) tested/added 13/12 trap constraints in 2133 ms
[2022-05-19 08:31:12] [INFO ] After 3504ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 88 ms.
[2022-05-19 08:31:12] [INFO ] After 4032ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 33 ms.
Support contains 7 out of 2502 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 2502/2502 places, 2403/2403 transitions.
Applied a total of 0 rules in 77 ms. Remains 2502 /2502 variables (removed 0) and now considering 2403/2403 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 2502/2502 places, 2403/2403 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 169 ms. (steps per millisecond=59 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 110 ms. (steps per millisecond=90 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 145885 steps, run timeout after 3002 ms. (steps per millisecond=48 ) properties seen :{}
Probabilistic random walk after 145885 steps, saw 144234 distinct states, run finished after 3002 ms. (steps per millisecond=48 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 2403 rows 2502 cols
[2022-05-19 08:31:15] [INFO ] Computed 900 place invariants in 26 ms
[2022-05-19 08:31:16] [INFO ] [Real]Absence check using 899 positive place invariants in 164 ms returned sat
[2022-05-19 08:31:16] [INFO ] [Real]Absence check using 899 positive and 1 generalized place invariants in 1 ms returned sat
[2022-05-19 08:31:17] [INFO ] After 1673ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-19 08:31:17] [INFO ] [Nat]Absence check using 899 positive place invariants in 162 ms returned sat
[2022-05-19 08:31:17] [INFO ] [Nat]Absence check using 899 positive and 1 generalized place invariants in 0 ms returned sat
[2022-05-19 08:31:19] [INFO ] After 1437ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-19 08:31:19] [INFO ] Deduced a trap composed of 4 places in 104 ms of which 0 ms to minimize.
[2022-05-19 08:31:19] [INFO ] Deduced a trap composed of 4 places in 109 ms of which 0 ms to minimize.
[2022-05-19 08:31:19] [INFO ] Deduced a trap composed of 4 places in 97 ms of which 0 ms to minimize.
[2022-05-19 08:31:20] [INFO ] Deduced a trap composed of 4 places in 96 ms of which 1 ms to minimize.
[2022-05-19 08:31:20] [INFO ] Deduced a trap composed of 17 places in 92 ms of which 1 ms to minimize.
[2022-05-19 08:31:20] [INFO ] Deduced a trap composed of 8 places in 96 ms of which 1 ms to minimize.
[2022-05-19 08:31:20] [INFO ] Deduced a trap composed of 9 places in 94 ms of which 0 ms to minimize.
[2022-05-19 08:31:20] [INFO ] Deduced a trap composed of 4 places in 85 ms of which 1 ms to minimize.
[2022-05-19 08:31:21] [INFO ] Deduced a trap composed of 11 places in 82 ms of which 1 ms to minimize.
[2022-05-19 08:31:21] [INFO ] Deduced a trap composed of 8 places in 70 ms of which 1 ms to minimize.
[2022-05-19 08:31:21] [INFO ] Deduced a trap composed of 17 places in 68 ms of which 0 ms to minimize.
[2022-05-19 08:31:21] [INFO ] Deduced a trap composed of 8 places in 60 ms of which 0 ms to minimize.
[2022-05-19 08:31:21] [INFO ] Trap strengthening (SAT) tested/added 13/12 trap constraints in 2127 ms
[2022-05-19 08:31:21] [INFO ] After 3633ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 92 ms.
[2022-05-19 08:31:21] [INFO ] After 4179ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 34 ms.
Support contains 7 out of 2502 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 2502/2502 places, 2403/2403 transitions.
Applied a total of 0 rules in 71 ms. Remains 2502 /2502 variables (removed 0) and now considering 2403/2403 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 2502/2502 places, 2403/2403 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 2502/2502 places, 2403/2403 transitions.
Applied a total of 0 rules in 67 ms. Remains 2502 /2502 variables (removed 0) and now considering 2403/2403 (removed 0) transitions.
// Phase 1: matrix 2403 rows 2502 cols
[2022-05-19 08:31:21] [INFO ] Computed 900 place invariants in 25 ms
[2022-05-19 08:31:23] [INFO ] Implicit Places using invariants in 1797 ms returned []
// Phase 1: matrix 2403 rows 2502 cols
[2022-05-19 08:31:23] [INFO ] Computed 900 place invariants in 29 ms
[2022-05-19 08:31:27] [INFO ] Implicit Places using invariants and state equation in 4087 ms returned []
Implicit Place search using SMT with State Equation took 5885 ms to find 0 implicit places.
[2022-05-19 08:31:27] [INFO ] Redundant transitions in 72 ms returned []
// Phase 1: matrix 2403 rows 2502 cols
[2022-05-19 08:31:27] [INFO ] Computed 900 place invariants in 25 ms
[2022-05-19 08:31:29] [INFO ] Dead Transitions using invariants and state equation in 1500 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 2502/2502 places, 2403/2403 transitions.
Applied a total of 0 rules in 71 ms. Remains 2502 /2502 variables (removed 0) and now considering 2403/2403 (removed 0) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 2403 rows 2502 cols
[2022-05-19 08:31:29] [INFO ] Computed 900 place invariants in 26 ms
[2022-05-19 08:31:29] [INFO ] [Real]Absence check using 899 positive place invariants in 165 ms returned sat
[2022-05-19 08:31:29] [INFO ] [Real]Absence check using 899 positive and 1 generalized place invariants in 1 ms returned sat
[2022-05-19 08:31:31] [INFO ] After 1654ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-19 08:31:31] [INFO ] [Nat]Absence check using 899 positive place invariants in 158 ms returned sat
[2022-05-19 08:31:31] [INFO ] [Nat]Absence check using 899 positive and 1 generalized place invariants in 1 ms returned sat
[2022-05-19 08:31:32] [INFO ] After 1388ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-19 08:31:33] [INFO ] Deduced a trap composed of 4 places in 113 ms of which 1 ms to minimize.
[2022-05-19 08:31:33] [INFO ] Deduced a trap composed of 4 places in 106 ms of which 1 ms to minimize.
[2022-05-19 08:31:33] [INFO ] Deduced a trap composed of 4 places in 104 ms of which 0 ms to minimize.
[2022-05-19 08:31:33] [INFO ] Deduced a trap composed of 4 places in 98 ms of which 0 ms to minimize.
[2022-05-19 08:31:33] [INFO ] Deduced a trap composed of 17 places in 108 ms of which 1 ms to minimize.
[2022-05-19 08:31:34] [INFO ] Deduced a trap composed of 8 places in 103 ms of which 0 ms to minimize.
[2022-05-19 08:31:34] [INFO ] Deduced a trap composed of 9 places in 99 ms of which 0 ms to minimize.
[2022-05-19 08:31:34] [INFO ] Deduced a trap composed of 4 places in 94 ms of which 0 ms to minimize.
[2022-05-19 08:31:34] [INFO ] Deduced a trap composed of 11 places in 90 ms of which 0 ms to minimize.
[2022-05-19 08:31:34] [INFO ] Deduced a trap composed of 8 places in 67 ms of which 0 ms to minimize.
[2022-05-19 08:31:34] [INFO ] Deduced a trap composed of 17 places in 77 ms of which 1 ms to minimize.
[2022-05-19 08:31:35] [INFO ] Deduced a trap composed of 8 places in 70 ms of which 0 ms to minimize.
[2022-05-19 08:31:35] [INFO ] Trap strengthening (SAT) tested/added 13/12 trap constraints in 2204 ms
[2022-05-19 08:31:35] [INFO ] After 3659ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 88 ms.
[2022-05-19 08:31:35] [INFO ] After 4222ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [(AND (NOT p2) (NOT p1) (NOT p0)), (X (NOT p2)), (X (NOT (AND (NOT p2) p1))), (X (X (NOT p2))), (X (X (NOT (AND (NOT p2) p0 p1)))), (X (X (NOT (AND (NOT p2) p1))))]
False Knowledge obtained : [(F p2), (F (AND (NOT p0) p1 (NOT p2)))]
Knowledge based reduction with 6 factoid took 336 ms. Reduced automaton from 3 states, 5 edges and 3 AP to 3 states, 5 edges and 3 AP.
Stuttering acceptance computed with spot in 107 ms :[(AND (NOT p2) p0 p1), (AND (NOT p2) p0 p1), (AND (NOT p2) p0 p1)]
Stuttering acceptance computed with spot in 103 ms :[(AND (NOT p2) p0 p1), (AND (NOT p2) p0 p1), (AND (NOT p2) p0 p1)]
Support contains 7 out of 5303 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 5303/5303 places, 5203/5203 transitions.
Applied a total of 0 rules in 465 ms. Remains 5303 /5303 variables (removed 0) and now considering 5203/5203 (removed 0) transitions.
// Phase 1: matrix 5203 rows 5303 cols
[2022-05-19 08:31:36] [INFO ] Computed 901 place invariants in 27 ms
[2022-05-19 08:31:38] [INFO ] Implicit Places using invariants in 1789 ms returned []
// Phase 1: matrix 5203 rows 5303 cols
[2022-05-19 08:31:38] [INFO ] Computed 901 place invariants in 24 ms
[2022-05-19 08:31:39] [INFO ] Implicit Places using invariants and state equation in 1799 ms returned []
Implicit Place search using SMT with State Equation took 3591 ms to find 0 implicit places.
// Phase 1: matrix 5203 rows 5303 cols
[2022-05-19 08:31:40] [INFO ] Computed 901 place invariants in 23 ms
[2022-05-19 08:31:43] [INFO ] Dead Transitions using invariants and state equation in 3054 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 5303/5303 places, 5203/5203 transitions.
Computed a total of 1199 stabilizing places and 1199 stable transitions
Computed a total of 1199 stabilizing places and 1199 stable transitions
Knowledge obtained : [(AND (NOT p2) (NOT p0) (NOT p1)), (X (NOT p2)), (X (NOT (AND p0 p1 (NOT p2)))), (X (X (NOT p2))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X (NOT (AND p0 p1 (NOT p2)))))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 174 ms. Reduced automaton from 3 states, 5 edges and 3 AP to 3 states, 5 edges and 3 AP.
Stuttering acceptance computed with spot in 79 ms :[(AND (NOT p2) p0 p1), (AND (NOT p2) p0 p1), (AND (NOT p2) p0 p1)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 504 ms. (steps per millisecond=19 ) properties (out of 3) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 5203 rows 5303 cols
[2022-05-19 08:31:44] [INFO ] Computed 901 place invariants in 23 ms
[2022-05-19 08:31:45] [INFO ] [Real]Absence check using 901 positive place invariants in 528 ms returned sat
[2022-05-19 08:31:49] [INFO ] After 5117ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2022-05-19 08:31:50] [INFO ] [Nat]Absence check using 901 positive place invariants in 533 ms returned sat
[2022-05-19 08:31:54] [INFO ] After 4127ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2022-05-19 08:31:56] [INFO ] Deduced a trap composed of 23 places in 1737 ms of which 3 ms to minimize.
[2022-05-19 08:31:58] [INFO ] Deduced a trap composed of 27 places in 1762 ms of which 3 ms to minimize.
[2022-05-19 08:32:00] [INFO ] Deduced a trap composed of 22 places in 1683 ms of which 3 ms to minimize.
[2022-05-19 08:32:02] [INFO ] Deduced a trap composed of 19 places in 1678 ms of which 3 ms to minimize.
[2022-05-19 08:32:04] [INFO ] Deduced a trap composed of 39 places in 1683 ms of which 3 ms to minimize.
[2022-05-19 08:32:06] [INFO ] Deduced a trap composed of 34 places in 1712 ms of which 3 ms to minimize.
[2022-05-19 08:32:07] [INFO ] Deduced a trap composed of 37 places in 1693 ms of which 3 ms to minimize.
[2022-05-19 08:32:09] [INFO ] Deduced a trap composed of 31 places in 1689 ms of which 3 ms to minimize.
[2022-05-19 08:32:11] [INFO ] Deduced a trap composed of 39 places in 1657 ms of which 2 ms to minimize.
[2022-05-19 08:32:13] [INFO ] Deduced a trap composed of 53 places in 1645 ms of which 3 ms to minimize.
[2022-05-19 08:32:15] [INFO ] Deduced a trap composed of 36 places in 1599 ms of which 2 ms to minimize.
[2022-05-19 08:32:15] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2022-05-19 08:32:15] [INFO ] After 26065ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:2
Parikh walk visited 0 properties in 269 ms.
Support contains 7 out of 5303 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 5303/5303 places, 5203/5203 transitions.
Drop transitions removed 499 transitions
Trivial Post-agglo rules discarded 499 transitions
Performed 499 trivial Post agglomeration. Transition count delta: 499
Iterating post reduction 0 with 499 rules applied. Total rules applied 499 place count 5303 transition count 4704
Reduce places removed 499 places and 0 transitions.
Iterating post reduction 1 with 499 rules applied. Total rules applied 998 place count 4804 transition count 4704
Performed 501 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 501 Pre rules applied. Total rules applied 998 place count 4804 transition count 4203
Deduced a syphon composed of 501 places in 19 ms
Reduce places removed 501 places and 0 transitions.
Iterating global reduction 2 with 1002 rules applied. Total rules applied 2000 place count 4303 transition count 4203
Performed 1799 Post agglomeration using F-continuation condition.Transition count delta: 1799
Deduced a syphon composed of 1799 places in 13 ms
Reduce places removed 1799 places and 0 transitions.
Iterating global reduction 2 with 3598 rules applied. Total rules applied 5598 place count 2504 transition count 2404
Renaming transitions due to excessive name length > 1024 char.
Partial Free-agglomeration rule applied 696 times.
Drop transitions removed 696 transitions
Iterating global reduction 2 with 696 rules applied. Total rules applied 6294 place count 2504 transition count 2404
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 6295 place count 2503 transition count 2403
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 6296 place count 2502 transition count 2403
Applied a total of 6296 rules in 994 ms. Remains 2502 /5303 variables (removed 2801) and now considering 2403/5203 (removed 2800) transitions.
Finished structural reductions, in 1 iterations. Remains : 2502/5303 places, 2403/5203 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 192 ms. (steps per millisecond=52 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 119 ms. (steps per millisecond=84 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 2403 rows 2502 cols
[2022-05-19 08:32:16] [INFO ] Computed 900 place invariants in 25 ms
[2022-05-19 08:32:17] [INFO ] [Real]Absence check using 899 positive place invariants in 169 ms returned sat
[2022-05-19 08:32:17] [INFO ] [Real]Absence check using 899 positive and 1 generalized place invariants in 0 ms returned sat
[2022-05-19 08:32:18] [INFO ] After 1624ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-19 08:32:18] [INFO ] [Nat]Absence check using 899 positive place invariants in 160 ms returned sat
[2022-05-19 08:32:18] [INFO ] [Nat]Absence check using 899 positive and 1 generalized place invariants in 1 ms returned sat
[2022-05-19 08:32:20] [INFO ] After 1379ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-19 08:32:20] [INFO ] Deduced a trap composed of 4 places in 110 ms of which 1 ms to minimize.
[2022-05-19 08:32:20] [INFO ] Deduced a trap composed of 4 places in 110 ms of which 0 ms to minimize.
[2022-05-19 08:32:20] [INFO ] Deduced a trap composed of 4 places in 113 ms of which 0 ms to minimize.
[2022-05-19 08:32:21] [INFO ] Deduced a trap composed of 4 places in 105 ms of which 1 ms to minimize.
[2022-05-19 08:32:21] [INFO ] Deduced a trap composed of 17 places in 104 ms of which 0 ms to minimize.
[2022-05-19 08:32:21] [INFO ] Deduced a trap composed of 8 places in 100 ms of which 0 ms to minimize.
[2022-05-19 08:32:21] [INFO ] Deduced a trap composed of 9 places in 99 ms of which 1 ms to minimize.
[2022-05-19 08:32:21] [INFO ] Deduced a trap composed of 4 places in 86 ms of which 0 ms to minimize.
[2022-05-19 08:32:21] [INFO ] Deduced a trap composed of 11 places in 90 ms of which 0 ms to minimize.
[2022-05-19 08:32:22] [INFO ] Deduced a trap composed of 8 places in 75 ms of which 0 ms to minimize.
[2022-05-19 08:32:22] [INFO ] Deduced a trap composed of 17 places in 72 ms of which 0 ms to minimize.
[2022-05-19 08:32:22] [INFO ] Deduced a trap composed of 8 places in 70 ms of which 0 ms to minimize.
[2022-05-19 08:32:22] [INFO ] Trap strengthening (SAT) tested/added 13/12 trap constraints in 2186 ms
[2022-05-19 08:32:22] [INFO ] After 3635ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 90 ms.
[2022-05-19 08:32:22] [INFO ] After 4193ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 36 ms.
Support contains 7 out of 2502 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 2502/2502 places, 2403/2403 transitions.
Applied a total of 0 rules in 70 ms. Remains 2502 /2502 variables (removed 0) and now considering 2403/2403 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 2502/2502 places, 2403/2403 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 174 ms. (steps per millisecond=57 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 120 ms. (steps per millisecond=83 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 139925 steps, run timeout after 3002 ms. (steps per millisecond=46 ) properties seen :{}
Probabilistic random walk after 139925 steps, saw 138326 distinct states, run finished after 3002 ms. (steps per millisecond=46 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 2403 rows 2502 cols
[2022-05-19 08:32:26] [INFO ] Computed 900 place invariants in 27 ms
[2022-05-19 08:32:26] [INFO ] [Real]Absence check using 899 positive place invariants in 155 ms returned sat
[2022-05-19 08:32:26] [INFO ] [Real]Absence check using 899 positive and 1 generalized place invariants in 1 ms returned sat
[2022-05-19 08:32:27] [INFO ] After 1621ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-19 08:32:28] [INFO ] [Nat]Absence check using 899 positive place invariants in 156 ms returned sat
[2022-05-19 08:32:28] [INFO ] [Nat]Absence check using 899 positive and 1 generalized place invariants in 1 ms returned sat
[2022-05-19 08:32:29] [INFO ] After 1367ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-19 08:32:29] [INFO ] Deduced a trap composed of 4 places in 146 ms of which 1 ms to minimize.
[2022-05-19 08:32:29] [INFO ] Deduced a trap composed of 4 places in 103 ms of which 0 ms to minimize.
[2022-05-19 08:32:30] [INFO ] Deduced a trap composed of 4 places in 103 ms of which 0 ms to minimize.
[2022-05-19 08:32:30] [INFO ] Deduced a trap composed of 4 places in 96 ms of which 0 ms to minimize.
[2022-05-19 08:32:30] [INFO ] Deduced a trap composed of 17 places in 107 ms of which 0 ms to minimize.
[2022-05-19 08:32:30] [INFO ] Deduced a trap composed of 8 places in 100 ms of which 0 ms to minimize.
[2022-05-19 08:32:30] [INFO ] Deduced a trap composed of 9 places in 98 ms of which 1 ms to minimize.
[2022-05-19 08:32:31] [INFO ] Deduced a trap composed of 4 places in 90 ms of which 1 ms to minimize.
[2022-05-19 08:32:31] [INFO ] Deduced a trap composed of 11 places in 80 ms of which 0 ms to minimize.
[2022-05-19 08:32:31] [INFO ] Deduced a trap composed of 8 places in 78 ms of which 0 ms to minimize.
[2022-05-19 08:32:31] [INFO ] Deduced a trap composed of 17 places in 70 ms of which 1 ms to minimize.
[2022-05-19 08:32:31] [INFO ] Deduced a trap composed of 8 places in 55 ms of which 1 ms to minimize.
[2022-05-19 08:32:31] [INFO ] Trap strengthening (SAT) tested/added 13/12 trap constraints in 2160 ms
[2022-05-19 08:32:31] [INFO ] After 3602ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 88 ms.
[2022-05-19 08:32:31] [INFO ] After 4147ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 34 ms.
Support contains 7 out of 2502 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 2502/2502 places, 2403/2403 transitions.
Applied a total of 0 rules in 67 ms. Remains 2502 /2502 variables (removed 0) and now considering 2403/2403 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 2502/2502 places, 2403/2403 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 2502/2502 places, 2403/2403 transitions.
Applied a total of 0 rules in 67 ms. Remains 2502 /2502 variables (removed 0) and now considering 2403/2403 (removed 0) transitions.
// Phase 1: matrix 2403 rows 2502 cols
[2022-05-19 08:32:32] [INFO ] Computed 900 place invariants in 25 ms
[2022-05-19 08:32:33] [INFO ] Implicit Places using invariants in 1667 ms returned []
// Phase 1: matrix 2403 rows 2502 cols
[2022-05-19 08:32:33] [INFO ] Computed 900 place invariants in 23 ms
[2022-05-19 08:32:37] [INFO ] Implicit Places using invariants and state equation in 3890 ms returned []
Implicit Place search using SMT with State Equation took 5557 ms to find 0 implicit places.
[2022-05-19 08:32:37] [INFO ] Redundant transitions in 73 ms returned []
// Phase 1: matrix 2403 rows 2502 cols
[2022-05-19 08:32:37] [INFO ] Computed 900 place invariants in 27 ms
[2022-05-19 08:32:39] [INFO ] Dead Transitions using invariants and state equation in 1388 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 2502/2502 places, 2403/2403 transitions.
Applied a total of 0 rules in 66 ms. Remains 2502 /2502 variables (removed 0) and now considering 2403/2403 (removed 0) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 2403 rows 2502 cols
[2022-05-19 08:32:39] [INFO ] Computed 900 place invariants in 25 ms
[2022-05-19 08:32:39] [INFO ] [Real]Absence check using 899 positive place invariants in 151 ms returned sat
[2022-05-19 08:32:39] [INFO ] [Real]Absence check using 899 positive and 1 generalized place invariants in 1 ms returned sat
[2022-05-19 08:32:40] [INFO ] After 1546ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-19 08:32:41] [INFO ] [Nat]Absence check using 899 positive place invariants in 156 ms returned sat
[2022-05-19 08:32:41] [INFO ] [Nat]Absence check using 899 positive and 1 generalized place invariants in 1 ms returned sat
[2022-05-19 08:32:42] [INFO ] After 1333ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-19 08:32:42] [INFO ] Deduced a trap composed of 4 places in 98 ms of which 0 ms to minimize.
[2022-05-19 08:32:42] [INFO ] Deduced a trap composed of 4 places in 98 ms of which 1 ms to minimize.
[2022-05-19 08:32:43] [INFO ] Deduced a trap composed of 4 places in 109 ms of which 1 ms to minimize.
[2022-05-19 08:32:43] [INFO ] Deduced a trap composed of 4 places in 110 ms of which 0 ms to minimize.
[2022-05-19 08:32:43] [INFO ] Deduced a trap composed of 17 places in 118 ms of which 0 ms to minimize.
[2022-05-19 08:32:43] [INFO ] Deduced a trap composed of 8 places in 95 ms of which 1 ms to minimize.
[2022-05-19 08:32:43] [INFO ] Deduced a trap composed of 9 places in 96 ms of which 1 ms to minimize.
[2022-05-19 08:32:43] [INFO ] Deduced a trap composed of 4 places in 84 ms of which 0 ms to minimize.
[2022-05-19 08:32:44] [INFO ] Deduced a trap composed of 11 places in 81 ms of which 1 ms to minimize.
[2022-05-19 08:32:44] [INFO ] Deduced a trap composed of 8 places in 72 ms of which 0 ms to minimize.
[2022-05-19 08:32:44] [INFO ] Deduced a trap composed of 17 places in 71 ms of which 0 ms to minimize.
[2022-05-19 08:32:44] [INFO ] Deduced a trap composed of 8 places in 55 ms of which 0 ms to minimize.
[2022-05-19 08:32:44] [INFO ] Trap strengthening (SAT) tested/added 13/12 trap constraints in 2127 ms
[2022-05-19 08:32:44] [INFO ] After 3529ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 87 ms.
[2022-05-19 08:32:44] [INFO ] After 4045ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [(AND (NOT p2) (NOT p0) (NOT p1)), (X (NOT p2)), (X (NOT (AND p0 p1 (NOT p2)))), (X (X (NOT p2))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X (NOT (AND p0 p1 (NOT p2)))))]
False Knowledge obtained : [(F p2), (F (AND (NOT p0) p1 (NOT p2)))]
Knowledge based reduction with 6 factoid took 493 ms. Reduced automaton from 3 states, 5 edges and 3 AP to 3 states, 5 edges and 3 AP.
Stuttering acceptance computed with spot in 94 ms :[(AND (NOT p2) p0 p1), (AND (NOT p2) p0 p1), (AND (NOT p2) p0 p1)]
Stuttering acceptance computed with spot in 104 ms :[(AND (NOT p2) p0 p1), (AND (NOT p2) p0 p1), (AND (NOT p2) p0 p1)]
Stuttering acceptance computed with spot in 221 ms :[(AND (NOT p2) p0 p1), (AND (NOT p2) p0 p1), (AND (NOT p2) p0 p1)]
Product exploration explored 100000 steps with 8 reset in 1554 ms.
Product exploration explored 100000 steps with 9 reset in 1924 ms.
Applying partial POR strategy [false, true, true]
Stuttering acceptance computed with spot in 94 ms :[(AND (NOT p2) p0 p1), (AND (NOT p2) p0 p1), (AND (NOT p2) p0 p1)]
Support contains 7 out of 5303 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 5303/5303 places, 5203/5203 transitions.
Performed 498 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 498 rules applied. Total rules applied 498 place count 5303 transition count 5203
Performed 203 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 203 Pre rules applied. Total rules applied 498 place count 5303 transition count 5205
Deduced a syphon composed of 701 places in 22 ms
Iterating global reduction 1 with 203 rules applied. Total rules applied 701 place count 5303 transition count 5205
Performed 2098 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 2799 places in 10 ms
Iterating global reduction 1 with 2098 rules applied. Total rules applied 2799 place count 5303 transition count 5205
Renaming transitions due to excessive name length > 1024 char.
Discarding 697 places :
Symmetric choice reduction at 1 with 697 rule applications. Total rules 3496 place count 4606 transition count 4508
Deduced a syphon composed of 2102 places in 10 ms
Iterating global reduction 1 with 697 rules applied. Total rules applied 4193 place count 4606 transition count 4508
Deduced a syphon composed of 2102 places in 9 ms
Applied a total of 4193 rules in 4008 ms. Remains 4606 /5303 variables (removed 697) and now considering 4508/5203 (removed 695) transitions.
[2022-05-19 08:32:53] [INFO ] Redundant transitions in 426 ms returned [4507]
Found 1 redundant transitions using SMT.
Drop transitions removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
// Phase 1: matrix 4507 rows 4606 cols
[2022-05-19 08:32:53] [INFO ] Computed 901 place invariants in 108 ms
[2022-05-19 08:32:56] [INFO ] Dead Transitions using invariants and state equation in 2689 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 4606/5303 places, 4507/5203 transitions.
Deduced a syphon composed of 2102 places in 9 ms
Applied a total of 0 rules in 247 ms. Remains 4606 /4606 variables (removed 0) and now considering 4507/4507 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 4606/5303 places, 4507/5203 transitions.
Product exploration explored 100000 steps with 25 reset in 1693 ms.
Product exploration explored 100000 steps with 24 reset in 2004 ms.
Built C files in :
/tmp/ltsmin7093231307451901552
[2022-05-19 08:33:00] [INFO ] Built C files in 67ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7093231307451901552
Running compilation step : cd /tmp/ltsmin7093231307451901552;'/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/ltsmin7093231307451901552;'/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/ltsmin7093231307451901552;'/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 7 out of 5303 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 5303/5303 places, 5203/5203 transitions.
Applied a total of 0 rules in 404 ms. Remains 5303 /5303 variables (removed 0) and now considering 5203/5203 (removed 0) transitions.
// Phase 1: matrix 5203 rows 5303 cols
[2022-05-19 08:33:04] [INFO ] Computed 901 place invariants in 26 ms
[2022-05-19 08:33:05] [INFO ] Implicit Places using invariants in 1723 ms returned []
// Phase 1: matrix 5203 rows 5303 cols
[2022-05-19 08:33:05] [INFO ] Computed 901 place invariants in 18 ms
[2022-05-19 08:33:07] [INFO ] Implicit Places using invariants and state equation in 1714 ms returned []
Implicit Place search using SMT with State Equation took 3439 ms to find 0 implicit places.
// Phase 1: matrix 5203 rows 5303 cols
[2022-05-19 08:33:07] [INFO ] Computed 901 place invariants in 22 ms
[2022-05-19 08:33:10] [INFO ] Dead Transitions using invariants and state equation in 3298 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 5303/5303 places, 5203/5203 transitions.
Built C files in :
/tmp/ltsmin17558260049946828194
[2022-05-19 08:33:10] [INFO ] Built C files in 48ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17558260049946828194
Running compilation step : cd /tmp/ltsmin17558260049946828194;'/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/ltsmin17558260049946828194;'/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/ltsmin17558260049946828194;'/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-19 08:33:14] [INFO ] Flatten gal took : 207 ms
[2022-05-19 08:33:14] [INFO ] Flatten gal took : 181 ms
[2022-05-19 08:33:14] [INFO ] Time to serialize gal into /tmp/LTL14132026507993457035.gal : 30 ms
[2022-05-19 08:33:14] [INFO ] Time to serialize properties into /tmp/LTL15452808684956435719.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/LTL14132026507993457035.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL15452808684956435719.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/LTL1413202...268
Read 1 LTL properties
Checking formula 0 : !((F((!((G(F("(((p5908==1)&&(p5930==1))&&(p5938==1))")))U(G(X("(((p4489==1)&&(p4497==1))&&(p4525==1))")))))||("(p5170==1)"))))
Formula 0 simplified : !F("(p5170==1)" | !(GF"(((p5908==1)&&(p5930==1))&&(p5938==1))" U GX"(((p4489==1)&&(p4497==1))&&(p4525==1))"))
Detected timeout of ITS tools.
[2022-05-19 08:33:29] [INFO ] Flatten gal took : 162 ms
[2022-05-19 08:33:29] [INFO ] Applying decomposition
[2022-05-19 08:33:29] [INFO ] Flatten gal took : 168 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/graph9365916106670375985.txt' '-o' '/tmp/graph9365916106670375985.bin' '-w' '/tmp/graph9365916106670375985.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph9365916106670375985.bin' '-l' '-1' '-v' '-w' '/tmp/graph9365916106670375985.weights' '-q' '0' '-e' '0.001'
[2022-05-19 08:33:30] [INFO ] Decomposing Gal with order
[2022-05-19 08:33:30] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-19 08:33:31] [INFO ] Removed a total of 2300 redundant transitions.
[2022-05-19 08:33:31] [INFO ] Flatten gal took : 270 ms
[2022-05-19 08:33:31] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 29 ms.
[2022-05-19 08:33:31] [INFO ] Time to serialize gal into /tmp/LTL12813196211928441883.gal : 41 ms
[2022-05-19 08:33:31] [INFO ] Time to serialize properties into /tmp/LTL11879963792073551367.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/LTL12813196211928441883.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL11879963792073551367.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/LTL1281319...247
Read 1 LTL properties
Checking formula 0 : !((F((!((G(F("(((i60.i0.i6.u1967.p5908==1)&&(i60.i0.i5.u1974.p5930==1))&&(i60.i0.i6.u1976.p5938==1))")))U(G(X("(((i45.i0.i1.u1498.p448...259
Formula 0 simplified : !F("(i51.i1.i4.u1723.p5170==1)" | !(GF"(((i60.i0.i6.u1967.p5908==1)&&(i60.i0.i5.u1974.p5930==1))&&(i60.i0.i6.u1976.p5938==1))" U GX"...244
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin10611784116569082201
[2022-05-19 08:33:47] [INFO ] Built C files in 55ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10611784116569082201
Running compilation step : cd /tmp/ltsmin10611784116569082201;'/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/ltsmin10611784116569082201;'/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/ltsmin10611784116569082201;'/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)
Treatment of property ShieldIIPs-PT-100B-LTLFireability-09 finished in 212211 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((G(X(p0))&&F(p1)))'
Support contains 4 out of 5308 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 5308/5308 places, 5208/5208 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 5302 transition count 5202
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 5302 transition count 5202
Applied a total of 12 rules in 899 ms. Remains 5302 /5308 variables (removed 6) and now considering 5202/5208 (removed 6) transitions.
// Phase 1: matrix 5202 rows 5302 cols
[2022-05-19 08:33:50] [INFO ] Computed 901 place invariants in 23 ms
[2022-05-19 08:33:52] [INFO ] Implicit Places using invariants in 1636 ms returned []
// Phase 1: matrix 5202 rows 5302 cols
[2022-05-19 08:33:52] [INFO ] Computed 901 place invariants in 16 ms
[2022-05-19 08:33:54] [INFO ] Implicit Places using invariants and state equation in 1771 ms returned []
Implicit Place search using SMT with State Equation took 3412 ms to find 0 implicit places.
// Phase 1: matrix 5202 rows 5302 cols
[2022-05-19 08:33:54] [INFO ] Computed 901 place invariants in 18 ms
[2022-05-19 08:33:57] [INFO ] Dead Transitions using invariants and state equation in 3295 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 5302/5308 places, 5202/5208 transitions.
Finished structural reductions, in 1 iterations. Remains : 5302/5308 places, 5202/5208 transitions.
Stuttering acceptance computed with spot in 126 ms :[(NOT p0), true, (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : ShieldIIPs-PT-100B-LTLFireability-10 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 s3435 0) (EQ s1152 0) (EQ s4789 0)), p1:(EQ s1936 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]]
Product exploration explored 100000 steps with 8 reset in 1534 ms.
Product exploration explored 100000 steps with 8 reset in 1850 ms.
Computed a total of 1199 stabilizing places and 1199 stable transitions
Computed a total of 1199 stabilizing places and 1199 stable transitions
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT (AND p1 p0))), (X (AND (NOT p1) p0)), (X p0), true, (X (X (NOT (AND p1 p0)))), (X (X (AND (NOT p1) p0))), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 8 factoid took 287 ms. Reduced automaton from 4 states, 8 edges and 2 AP to 4 states, 7 edges and 2 AP.
Stuttering acceptance computed with spot in 104 ms :[(NOT p0), (OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0)), true]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 249 ms. (steps per millisecond=40 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 3) 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 3) seen :0
Interrupted probabilistic random walk after 114670 steps, run timeout after 3001 ms. (steps per millisecond=38 ) properties seen :{}
Probabilistic random walk after 114670 steps, saw 112831 distinct states, run finished after 3002 ms. (steps per millisecond=38 ) properties seen :0
Running SMT prover for 3 properties.
// Phase 1: matrix 5202 rows 5302 cols
[2022-05-19 08:34:05] [INFO ] Computed 901 place invariants in 20 ms
[2022-05-19 08:34:05] [INFO ] After 712ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2022-05-19 08:34:06] [INFO ] [Nat]Absence check using 901 positive place invariants in 517 ms returned sat
[2022-05-19 08:34:11] [INFO ] After 4089ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2022-05-19 08:34:13] [INFO ] Deduced a trap composed of 29 places in 1659 ms of which 3 ms to minimize.
[2022-05-19 08:34:14] [INFO ] Deduced a trap composed of 24 places in 1573 ms of which 2 ms to minimize.
[2022-05-19 08:34:16] [INFO ] Deduced a trap composed of 30 places in 1582 ms of which 3 ms to minimize.
[2022-05-19 08:34:18] [INFO ] Deduced a trap composed of 17 places in 1707 ms of which 3 ms to minimize.
[2022-05-19 08:34:20] [INFO ] Deduced a trap composed of 32 places in 1681 ms of which 3 ms to minimize.
[2022-05-19 08:34:22] [INFO ] Deduced a trap composed of 19 places in 1565 ms of which 3 ms to minimize.
[2022-05-19 08:34:23] [INFO ] Deduced a trap composed of 35 places in 1562 ms of which 2 ms to minimize.
[2022-05-19 08:34:25] [INFO ] Deduced a trap composed of 23 places in 1627 ms of which 3 ms to minimize.
[2022-05-19 08:34:27] [INFO ] Deduced a trap composed of 25 places in 1586 ms of which 2 ms to minimize.
[2022-05-19 08:34:29] [INFO ] Deduced a trap composed of 34 places in 1478 ms of which 3 ms to minimize.
[2022-05-19 08:34:30] [INFO ] Deduced a trap composed of 23 places in 1472 ms of which 3 ms to minimize.
[2022-05-19 08:34:32] [INFO ] Deduced a trap composed of 22 places in 1492 ms of which 2 ms to minimize.
[2022-05-19 08:34:32] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2022-05-19 08:34:32] [INFO ] After 26539ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:3
Parikh walk visited 0 properties in 536 ms.
Support contains 4 out of 5302 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 5302/5302 places, 5202/5202 transitions.
Drop transitions removed 501 transitions
Trivial Post-agglo rules discarded 501 transitions
Performed 501 trivial Post agglomeration. Transition count delta: 501
Iterating post reduction 0 with 501 rules applied. Total rules applied 501 place count 5302 transition count 4701
Reduce places removed 501 places and 0 transitions.
Iterating post reduction 1 with 501 rules applied. Total rules applied 1002 place count 4801 transition count 4701
Performed 501 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 501 Pre rules applied. Total rules applied 1002 place count 4801 transition count 4200
Deduced a syphon composed of 501 places in 19 ms
Reduce places removed 501 places and 0 transitions.
Iterating global reduction 2 with 1002 rules applied. Total rules applied 2004 place count 4300 transition count 4200
Performed 1793 Post agglomeration using F-continuation condition.Transition count delta: 1793
Deduced a syphon composed of 1793 places in 12 ms
Reduce places removed 1793 places and 0 transitions.
Iterating global reduction 2 with 3586 rules applied. Total rules applied 5590 place count 2507 transition count 2407
Renaming transitions due to excessive name length > 1024 char.
Partial Free-agglomeration rule applied 698 times.
Drop transitions removed 698 transitions
Iterating global reduction 2 with 698 rules applied. Total rules applied 6288 place count 2507 transition count 2407
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 6289 place count 2506 transition count 2406
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 6290 place count 2505 transition count 2406
Applied a total of 6290 rules in 934 ms. Remains 2505 /5302 variables (removed 2797) and now considering 2406/5202 (removed 2796) transitions.
Finished structural reductions, in 1 iterations. Remains : 2505/5302 places, 2406/5202 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 307 ms. (steps per millisecond=32 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 121 ms. (steps per millisecond=82 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 118 ms. (steps per millisecond=84 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 137 ms. (steps per millisecond=73 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 98421 steps, run timeout after 3001 ms. (steps per millisecond=32 ) properties seen :{1=1, 2=1}
Probabilistic random walk after 98421 steps, saw 95942 distinct states, run finished after 3001 ms. (steps per millisecond=32 ) properties seen :2
Running SMT prover for 1 properties.
// Phase 1: matrix 2406 rows 2505 cols
[2022-05-19 08:34:37] [INFO ] Computed 900 place invariants in 26 ms
[2022-05-19 08:34:37] [INFO ] After 256ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-19 08:34:38] [INFO ] [Nat]Absence check using 899 positive place invariants in 155 ms returned sat
[2022-05-19 08:34:38] [INFO ] [Nat]Absence check using 899 positive and 1 generalized place invariants in 0 ms returned sat
[2022-05-19 08:34:39] [INFO ] After 1186ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-19 08:34:39] [INFO ] Deduced a trap composed of 5 places in 116 ms of which 1 ms to minimize.
[2022-05-19 08:34:39] [INFO ] Deduced a trap composed of 5 places in 128 ms of which 0 ms to minimize.
[2022-05-19 08:34:39] [INFO ] Deduced a trap composed of 9 places in 130 ms of which 1 ms to minimize.
[2022-05-19 08:34:40] [INFO ] Deduced a trap composed of 4 places in 119 ms of which 2 ms to minimize.
[2022-05-19 08:34:40] [INFO ] Deduced a trap composed of 3 places in 111 ms of which 0 ms to minimize.
[2022-05-19 08:34:40] [INFO ] Deduced a trap composed of 5 places in 115 ms of which 0 ms to minimize.
[2022-05-19 08:34:40] [INFO ] Deduced a trap composed of 4 places in 115 ms of which 0 ms to minimize.
[2022-05-19 08:34:40] [INFO ] Deduced a trap composed of 4 places in 134 ms of which 1 ms to minimize.
[2022-05-19 08:34:41] [INFO ] Deduced a trap composed of 8 places in 120 ms of which 0 ms to minimize.
[2022-05-19 08:34:41] [INFO ] Deduced a trap composed of 4 places in 116 ms of which 0 ms to minimize.
[2022-05-19 08:34:41] [INFO ] Deduced a trap composed of 4 places in 106 ms of which 0 ms to minimize.
[2022-05-19 08:34:41] [INFO ] Deduced a trap composed of 5 places in 100 ms of which 1 ms to minimize.
[2022-05-19 08:34:41] [INFO ] Deduced a trap composed of 9 places in 91 ms of which 1 ms to minimize.
[2022-05-19 08:34:42] [INFO ] Deduced a trap composed of 24 places in 88 ms of which 1 ms to minimize.
[2022-05-19 08:34:42] [INFO ] Deduced a trap composed of 12 places in 96 ms of which 0 ms to minimize.
[2022-05-19 08:34:42] [INFO ] Deduced a trap composed of 8 places in 96 ms of which 0 ms to minimize.
[2022-05-19 08:34:42] [INFO ] Deduced a trap composed of 29 places in 97 ms of which 0 ms to minimize.
[2022-05-19 08:34:42] [INFO ] Deduced a trap composed of 17 places in 85 ms of which 1 ms to minimize.
[2022-05-19 08:34:42] [INFO ] Deduced a trap composed of 30 places in 86 ms of which 0 ms to minimize.
[2022-05-19 08:34:43] [INFO ] Deduced a trap composed of 30 places in 85 ms of which 0 ms to minimize.
[2022-05-19 08:34:43] [INFO ] Deduced a trap composed of 29 places in 80 ms of which 0 ms to minimize.
[2022-05-19 08:34:43] [INFO ] Deduced a trap composed of 8 places in 76 ms of which 0 ms to minimize.
[2022-05-19 08:34:43] [INFO ] Deduced a trap composed of 4 places in 72 ms of which 0 ms to minimize.
[2022-05-19 08:34:43] [INFO ] Trap strengthening (SAT) tested/added 24/23 trap constraints in 4279 ms
[2022-05-19 08:34:43] [INFO ] After 5531ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 84 ms.
[2022-05-19 08:34:43] [INFO ] After 6047ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 33 ms.
Support contains 3 out of 2505 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 2505/2505 places, 2406/2406 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 6 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 2504 transition count 2405
Applied a total of 2 rules in 131 ms. Remains 2504 /2505 variables (removed 1) and now considering 2405/2406 (removed 1) transitions.
Finished structural reductions, in 1 iterations. Remains : 2504/2505 places, 2405/2406 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 164 ms. (steps per millisecond=60 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 109 ms. (steps per millisecond=91 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 148688 steps, run timeout after 3003 ms. (steps per millisecond=49 ) properties seen :{}
Probabilistic random walk after 148688 steps, saw 145827 distinct states, run finished after 3004 ms. (steps per millisecond=49 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 2405 rows 2504 cols
[2022-05-19 08:34:47] [INFO ] Computed 900 place invariants in 25 ms
[2022-05-19 08:34:47] [INFO ] After 250ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-19 08:34:47] [INFO ] [Nat]Absence check using 899 positive place invariants in 153 ms returned sat
[2022-05-19 08:34:47] [INFO ] [Nat]Absence check using 899 positive and 1 generalized place invariants in 1 ms returned sat
[2022-05-19 08:34:49] [INFO ] After 1157ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-19 08:34:49] [INFO ] Deduced a trap composed of 8 places in 145 ms of which 0 ms to minimize.
[2022-05-19 08:34:49] [INFO ] Deduced a trap composed of 3 places in 144 ms of which 0 ms to minimize.
[2022-05-19 08:34:49] [INFO ] Deduced a trap composed of 4 places in 143 ms of which 1 ms to minimize.
[2022-05-19 08:34:50] [INFO ] Deduced a trap composed of 5 places in 152 ms of which 0 ms to minimize.
[2022-05-19 08:34:50] [INFO ] Deduced a trap composed of 9 places in 145 ms of which 0 ms to minimize.
[2022-05-19 08:34:50] [INFO ] Deduced a trap composed of 17 places in 144 ms of which 1 ms to minimize.
[2022-05-19 08:34:50] [INFO ] Deduced a trap composed of 8 places in 127 ms of which 1 ms to minimize.
[2022-05-19 08:34:50] [INFO ] Deduced a trap composed of 11 places in 122 ms of which 0 ms to minimize.
[2022-05-19 08:34:51] [INFO ] Deduced a trap composed of 5 places in 115 ms of which 1 ms to minimize.
[2022-05-19 08:34:51] [INFO ] Deduced a trap composed of 17 places in 119 ms of which 0 ms to minimize.
[2022-05-19 08:34:51] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 2256 ms
[2022-05-19 08:34:51] [INFO ] After 3469ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 84 ms.
[2022-05-19 08:34:51] [INFO ] After 3991ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 26 ms.
Support contains 3 out of 2504 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 2504/2504 places, 2405/2405 transitions.
Applied a total of 0 rules in 71 ms. Remains 2504 /2504 variables (removed 0) and now considering 2405/2405 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 2504/2504 places, 2405/2405 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 2504/2504 places, 2405/2405 transitions.
Applied a total of 0 rules in 77 ms. Remains 2504 /2504 variables (removed 0) and now considering 2405/2405 (removed 0) transitions.
// Phase 1: matrix 2405 rows 2504 cols
[2022-05-19 08:34:51] [INFO ] Computed 900 place invariants in 28 ms
[2022-05-19 08:34:53] [INFO ] Implicit Places using invariants in 1676 ms returned []
// Phase 1: matrix 2405 rows 2504 cols
[2022-05-19 08:34:53] [INFO ] Computed 900 place invariants in 19 ms
[2022-05-19 08:34:57] [INFO ] Implicit Places using invariants and state equation in 3687 ms returned []
Implicit Place search using SMT with State Equation took 5365 ms to find 0 implicit places.
[2022-05-19 08:34:57] [INFO ] Redundant transitions in 73 ms returned []
// Phase 1: matrix 2405 rows 2504 cols
[2022-05-19 08:34:57] [INFO ] Computed 900 place invariants in 27 ms
[2022-05-19 08:34:58] [INFO ] Dead Transitions using invariants and state equation in 1436 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 2504/2504 places, 2405/2405 transitions.
Applied a total of 0 rules in 71 ms. Remains 2504 /2504 variables (removed 0) and now considering 2405/2405 (removed 0) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 2405 rows 2504 cols
[2022-05-19 08:34:58] [INFO ] Computed 900 place invariants in 23 ms
[2022-05-19 08:34:58] [INFO ] After 252ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-19 08:34:59] [INFO ] [Nat]Absence check using 899 positive place invariants in 157 ms returned sat
[2022-05-19 08:34:59] [INFO ] [Nat]Absence check using 899 positive and 1 generalized place invariants in 1 ms returned sat
[2022-05-19 08:35:00] [INFO ] After 1161ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-19 08:35:00] [INFO ] Deduced a trap composed of 8 places in 151 ms of which 1 ms to minimize.
[2022-05-19 08:35:01] [INFO ] Deduced a trap composed of 3 places in 143 ms of which 0 ms to minimize.
[2022-05-19 08:35:01] [INFO ] Deduced a trap composed of 4 places in 142 ms of which 0 ms to minimize.
[2022-05-19 08:35:01] [INFO ] Deduced a trap composed of 5 places in 149 ms of which 0 ms to minimize.
[2022-05-19 08:35:01] [INFO ] Deduced a trap composed of 9 places in 144 ms of which 0 ms to minimize.
[2022-05-19 08:35:01] [INFO ] Deduced a trap composed of 17 places in 140 ms of which 1 ms to minimize.
[2022-05-19 08:35:02] [INFO ] Deduced a trap composed of 8 places in 129 ms of which 0 ms to minimize.
[2022-05-19 08:35:02] [INFO ] Deduced a trap composed of 11 places in 123 ms of which 1 ms to minimize.
[2022-05-19 08:35:02] [INFO ] Deduced a trap composed of 5 places in 110 ms of which 0 ms to minimize.
[2022-05-19 08:35:02] [INFO ] Deduced a trap composed of 17 places in 110 ms of which 0 ms to minimize.
[2022-05-19 08:35:02] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 2223 ms
[2022-05-19 08:35:02] [INFO ] After 3444ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 85 ms.
[2022-05-19 08:35:02] [INFO ] After 3969ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT (AND p1 p0))), (X (AND (NOT p1) p0)), (X p0), true, (X (X (NOT (AND p1 p0)))), (X (X (AND (NOT p1) p0))), (X (X p0))]
False Knowledge obtained : [(F (NOT (AND (NOT p1) p0))), (F (AND p1 p0))]
Knowledge based reduction with 8 factoid took 312 ms. Reduced automaton from 4 states, 7 edges and 2 AP to 4 states, 7 edges and 2 AP.
Stuttering acceptance computed with spot in 110 ms :[(NOT p0), (OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0)), true]
Stuttering acceptance computed with spot in 96 ms :[(NOT p0), (OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0)), true]
// Phase 1: matrix 5202 rows 5302 cols
[2022-05-19 08:35:03] [INFO ] Computed 901 place invariants in 21 ms
[2022-05-19 08:35:12] [INFO ] [Real]Absence check using 901 positive place invariants in 4306 ms returned sat
[2022-05-19 08:35:12] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-19 08:35:18] [INFO ] [Real]Absence check using state equation in 6190 ms returned unknown
Could not prove EG (NOT p1)
Support contains 4 out of 5302 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 5302/5302 places, 5202/5202 transitions.
Applied a total of 0 rules in 426 ms. Remains 5302 /5302 variables (removed 0) and now considering 5202/5202 (removed 0) transitions.
// Phase 1: matrix 5202 rows 5302 cols
[2022-05-19 08:35:18] [INFO ] Computed 901 place invariants in 24 ms
[2022-05-19 08:35:20] [INFO ] Implicit Places using invariants in 1792 ms returned []
// Phase 1: matrix 5202 rows 5302 cols
[2022-05-19 08:35:20] [INFO ] Computed 901 place invariants in 31 ms
[2022-05-19 08:35:22] [INFO ] Implicit Places using invariants and state equation in 1737 ms returned []
Implicit Place search using SMT with State Equation took 3530 ms to find 0 implicit places.
// Phase 1: matrix 5202 rows 5302 cols
[2022-05-19 08:35:22] [INFO ] Computed 901 place invariants in 15 ms
[2022-05-19 08:35:25] [INFO ] Dead Transitions using invariants and state equation in 3506 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 5302/5302 places, 5202/5202 transitions.
Computed a total of 1199 stabilizing places and 1199 stable transitions
Computed a total of 1199 stabilizing places and 1199 stable transitions
Knowledge obtained : [(AND p0 (NOT p1)), (X p0), (X (NOT (AND p1 p0))), (X (AND (NOT p1) p0)), true, (X (X (NOT (AND p1 p0)))), (X (X (AND (NOT p1) p0))), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 8 factoid took 281 ms. Reduced automaton from 4 states, 7 edges and 2 AP to 4 states, 7 edges and 2 AP.
Stuttering acceptance computed with spot in 125 ms :[(NOT p0), (OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0)), true]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 288 ms. (steps per millisecond=34 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 124930 steps, run timeout after 3002 ms. (steps per millisecond=41 ) properties seen :{}
Probabilistic random walk after 124930 steps, saw 122982 distinct states, run finished after 3002 ms. (steps per millisecond=41 ) properties seen :0
Running SMT prover for 3 properties.
// Phase 1: matrix 5202 rows 5302 cols
[2022-05-19 08:35:29] [INFO ] Computed 901 place invariants in 18 ms
[2022-05-19 08:35:30] [INFO ] After 635ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2022-05-19 08:35:31] [INFO ] [Nat]Absence check using 901 positive place invariants in 548 ms returned sat
[2022-05-19 08:35:36] [INFO ] After 4482ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2022-05-19 08:35:38] [INFO ] Deduced a trap composed of 29 places in 1641 ms of which 3 ms to minimize.
[2022-05-19 08:35:40] [INFO ] Deduced a trap composed of 24 places in 1620 ms of which 3 ms to minimize.
[2022-05-19 08:35:41] [INFO ] Deduced a trap composed of 30 places in 1625 ms of which 3 ms to minimize.
[2022-05-19 08:35:43] [INFO ] Deduced a trap composed of 17 places in 1627 ms of which 3 ms to minimize.
[2022-05-19 08:35:45] [INFO ] Deduced a trap composed of 32 places in 1612 ms of which 3 ms to minimize.
[2022-05-19 08:35:47] [INFO ] Deduced a trap composed of 19 places in 1566 ms of which 3 ms to minimize.
[2022-05-19 08:35:49] [INFO ] Deduced a trap composed of 35 places in 1591 ms of which 2 ms to minimize.
[2022-05-19 08:35:50] [INFO ] Deduced a trap composed of 23 places in 1582 ms of which 2 ms to minimize.
[2022-05-19 08:35:52] [INFO ] Deduced a trap composed of 25 places in 1576 ms of which 3 ms to minimize.
[2022-05-19 08:35:54] [INFO ] Deduced a trap composed of 34 places in 1538 ms of which 2 ms to minimize.
[2022-05-19 08:35:56] [INFO ] Deduced a trap composed of 23 places in 1516 ms of which 2 ms to minimize.
[2022-05-19 08:35:56] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2022-05-19 08:35:56] [INFO ] After 25482ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:3
Parikh walk visited 0 properties in 612 ms.
Support contains 4 out of 5302 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 5302/5302 places, 5202/5202 transitions.
Drop transitions removed 501 transitions
Trivial Post-agglo rules discarded 501 transitions
Performed 501 trivial Post agglomeration. Transition count delta: 501
Iterating post reduction 0 with 501 rules applied. Total rules applied 501 place count 5302 transition count 4701
Reduce places removed 501 places and 0 transitions.
Iterating post reduction 1 with 501 rules applied. Total rules applied 1002 place count 4801 transition count 4701
Performed 501 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 501 Pre rules applied. Total rules applied 1002 place count 4801 transition count 4200
Deduced a syphon composed of 501 places in 19 ms
Reduce places removed 501 places and 0 transitions.
Iterating global reduction 2 with 1002 rules applied. Total rules applied 2004 place count 4300 transition count 4200
Performed 1793 Post agglomeration using F-continuation condition.Transition count delta: 1793
Deduced a syphon composed of 1793 places in 12 ms
Reduce places removed 1793 places and 0 transitions.
Iterating global reduction 2 with 3586 rules applied. Total rules applied 5590 place count 2507 transition count 2407
Renaming transitions due to excessive name length > 1024 char.
Partial Free-agglomeration rule applied 698 times.
Drop transitions removed 698 transitions
Iterating global reduction 2 with 698 rules applied. Total rules applied 6288 place count 2507 transition count 2407
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 6289 place count 2506 transition count 2406
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 6290 place count 2505 transition count 2406
Applied a total of 6290 rules in 911 ms. Remains 2505 /5302 variables (removed 2797) and now considering 2406/5202 (removed 2796) transitions.
Finished structural reductions, in 1 iterations. Remains : 2505/5302 places, 2406/5202 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 332 ms. (steps per millisecond=30 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 119 ms. (steps per millisecond=84 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 114 ms. (steps per millisecond=87 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 115 ms. (steps per millisecond=86 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 93869 steps, run timeout after 3002 ms. (steps per millisecond=31 ) properties seen :{1=1, 2=1}
Probabilistic random walk after 93869 steps, saw 91424 distinct states, run finished after 3002 ms. (steps per millisecond=31 ) properties seen :2
Running SMT prover for 1 properties.
// Phase 1: matrix 2406 rows 2505 cols
[2022-05-19 08:36:01] [INFO ] Computed 900 place invariants in 28 ms
[2022-05-19 08:36:01] [INFO ] After 278ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-19 08:36:02] [INFO ] [Nat]Absence check using 899 positive place invariants in 164 ms returned sat
[2022-05-19 08:36:02] [INFO ] [Nat]Absence check using 899 positive and 1 generalized place invariants in 0 ms returned sat
[2022-05-19 08:36:03] [INFO ] After 1280ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-19 08:36:03] [INFO ] Deduced a trap composed of 5 places in 130 ms of which 0 ms to minimize.
[2022-05-19 08:36:03] [INFO ] Deduced a trap composed of 5 places in 130 ms of which 0 ms to minimize.
[2022-05-19 08:36:03] [INFO ] Deduced a trap composed of 9 places in 124 ms of which 0 ms to minimize.
[2022-05-19 08:36:04] [INFO ] Deduced a trap composed of 4 places in 117 ms of which 0 ms to minimize.
[2022-05-19 08:36:04] [INFO ] Deduced a trap composed of 3 places in 111 ms of which 0 ms to minimize.
[2022-05-19 08:36:04] [INFO ] Deduced a trap composed of 5 places in 113 ms of which 1 ms to minimize.
[2022-05-19 08:36:04] [INFO ] Deduced a trap composed of 4 places in 115 ms of which 0 ms to minimize.
[2022-05-19 08:36:04] [INFO ] Deduced a trap composed of 4 places in 121 ms of which 1 ms to minimize.
[2022-05-19 08:36:05] [INFO ] Deduced a trap composed of 8 places in 118 ms of which 0 ms to minimize.
[2022-05-19 08:36:05] [INFO ] Deduced a trap composed of 4 places in 116 ms of which 0 ms to minimize.
[2022-05-19 08:36:05] [INFO ] Deduced a trap composed of 4 places in 104 ms of which 1 ms to minimize.
[2022-05-19 08:36:05] [INFO ] Deduced a trap composed of 5 places in 101 ms of which 0 ms to minimize.
[2022-05-19 08:36:05] [INFO ] Deduced a trap composed of 9 places in 94 ms of which 0 ms to minimize.
[2022-05-19 08:36:06] [INFO ] Deduced a trap composed of 24 places in 92 ms of which 0 ms to minimize.
[2022-05-19 08:36:06] [INFO ] Deduced a trap composed of 12 places in 93 ms of which 0 ms to minimize.
[2022-05-19 08:36:06] [INFO ] Deduced a trap composed of 8 places in 98 ms of which 1 ms to minimize.
[2022-05-19 08:36:06] [INFO ] Deduced a trap composed of 29 places in 98 ms of which 0 ms to minimize.
[2022-05-19 08:36:06] [INFO ] Deduced a trap composed of 17 places in 80 ms of which 1 ms to minimize.
[2022-05-19 08:36:06] [INFO ] Deduced a trap composed of 30 places in 90 ms of which 0 ms to minimize.
[2022-05-19 08:36:07] [INFO ] Deduced a trap composed of 30 places in 84 ms of which 0 ms to minimize.
[2022-05-19 08:36:07] [INFO ] Deduced a trap composed of 29 places in 81 ms of which 0 ms to minimize.
[2022-05-19 08:36:07] [INFO ] Deduced a trap composed of 8 places in 74 ms of which 0 ms to minimize.
[2022-05-19 08:36:07] [INFO ] Deduced a trap composed of 4 places in 77 ms of which 0 ms to minimize.
[2022-05-19 08:36:07] [INFO ] Trap strengthening (SAT) tested/added 24/23 trap constraints in 4373 ms
[2022-05-19 08:36:07] [INFO ] After 5717ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 88 ms.
[2022-05-19 08:36:07] [INFO ] After 6272ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 33 ms.
Support contains 3 out of 2505 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 2505/2505 places, 2406/2406 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 6 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 2504 transition count 2405
Applied a total of 2 rules in 132 ms. Remains 2504 /2505 variables (removed 1) and now considering 2405/2406 (removed 1) transitions.
Finished structural reductions, in 1 iterations. Remains : 2504/2505 places, 2405/2406 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 168 ms. (steps per millisecond=59 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 111 ms. (steps per millisecond=90 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 147388 steps, run timeout after 3251 ms. (steps per millisecond=45 ) properties seen :{}
Probabilistic random walk after 147388 steps, saw 144534 distinct states, run finished after 3251 ms. (steps per millisecond=45 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 2405 rows 2504 cols
[2022-05-19 08:36:11] [INFO ] Computed 900 place invariants in 19 ms
[2022-05-19 08:36:11] [INFO ] After 248ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-19 08:36:12] [INFO ] [Nat]Absence check using 899 positive place invariants in 158 ms returned sat
[2022-05-19 08:36:12] [INFO ] [Nat]Absence check using 899 positive and 1 generalized place invariants in 1 ms returned sat
[2022-05-19 08:36:13] [INFO ] After 1199ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-19 08:36:13] [INFO ] Deduced a trap composed of 8 places in 163 ms of which 0 ms to minimize.
[2022-05-19 08:36:13] [INFO ] Deduced a trap composed of 3 places in 153 ms of which 1 ms to minimize.
[2022-05-19 08:36:14] [INFO ] Deduced a trap composed of 4 places in 152 ms of which 0 ms to minimize.
[2022-05-19 08:36:14] [INFO ] Deduced a trap composed of 5 places in 159 ms of which 0 ms to minimize.
[2022-05-19 08:36:14] [INFO ] Deduced a trap composed of 9 places in 156 ms of which 0 ms to minimize.
[2022-05-19 08:36:14] [INFO ] Deduced a trap composed of 17 places in 150 ms of which 1 ms to minimize.
[2022-05-19 08:36:15] [INFO ] Deduced a trap composed of 8 places in 132 ms of which 1 ms to minimize.
[2022-05-19 08:36:15] [INFO ] Deduced a trap composed of 11 places in 132 ms of which 0 ms to minimize.
[2022-05-19 08:36:15] [INFO ] Deduced a trap composed of 5 places in 121 ms of which 1 ms to minimize.
[2022-05-19 08:36:15] [INFO ] Deduced a trap composed of 17 places in 116 ms of which 1 ms to minimize.
[2022-05-19 08:36:15] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 2315 ms
[2022-05-19 08:36:15] [INFO ] After 3571ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 85 ms.
[2022-05-19 08:36:15] [INFO ] After 4093ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 45 ms.
Support contains 3 out of 2504 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 2504/2504 places, 2405/2405 transitions.
Applied a total of 0 rules in 74 ms. Remains 2504 /2504 variables (removed 0) and now considering 2405/2405 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 2504/2504 places, 2405/2405 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 2504/2504 places, 2405/2405 transitions.
Applied a total of 0 rules in 84 ms. Remains 2504 /2504 variables (removed 0) and now considering 2405/2405 (removed 0) transitions.
// Phase 1: matrix 2405 rows 2504 cols
[2022-05-19 08:36:16] [INFO ] Computed 900 place invariants in 23 ms
[2022-05-19 08:36:17] [INFO ] Implicit Places using invariants in 1730 ms returned []
// Phase 1: matrix 2405 rows 2504 cols
[2022-05-19 08:36:17] [INFO ] Computed 900 place invariants in 27 ms
[2022-05-19 08:36:21] [INFO ] Implicit Places using invariants and state equation in 4002 ms returned []
Implicit Place search using SMT with State Equation took 5734 ms to find 0 implicit places.
[2022-05-19 08:36:21] [INFO ] Redundant transitions in 74 ms returned []
// Phase 1: matrix 2405 rows 2504 cols
[2022-05-19 08:36:21] [INFO ] Computed 900 place invariants in 26 ms
[2022-05-19 08:36:23] [INFO ] Dead Transitions using invariants and state equation in 1537 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 2504/2504 places, 2405/2405 transitions.
Applied a total of 0 rules in 75 ms. Remains 2504 /2504 variables (removed 0) and now considering 2405/2405 (removed 0) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 2405 rows 2504 cols
[2022-05-19 08:36:23] [INFO ] Computed 900 place invariants in 26 ms
[2022-05-19 08:36:23] [INFO ] After 248ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-19 08:36:24] [INFO ] [Nat]Absence check using 899 positive place invariants in 160 ms returned sat
[2022-05-19 08:36:24] [INFO ] [Nat]Absence check using 899 positive and 1 generalized place invariants in 0 ms returned sat
[2022-05-19 08:36:25] [INFO ] After 1177ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-19 08:36:25] [INFO ] Deduced a trap composed of 8 places in 161 ms of which 0 ms to minimize.
[2022-05-19 08:36:25] [INFO ] Deduced a trap composed of 3 places in 141 ms of which 0 ms to minimize.
[2022-05-19 08:36:26] [INFO ] Deduced a trap composed of 4 places in 140 ms of which 1 ms to minimize.
[2022-05-19 08:36:26] [INFO ] Deduced a trap composed of 5 places in 151 ms of which 0 ms to minimize.
[2022-05-19 08:36:26] [INFO ] Deduced a trap composed of 9 places in 148 ms of which 1 ms to minimize.
[2022-05-19 08:36:26] [INFO ] Deduced a trap composed of 17 places in 141 ms of which 0 ms to minimize.
[2022-05-19 08:36:27] [INFO ] Deduced a trap composed of 8 places in 124 ms of which 1 ms to minimize.
[2022-05-19 08:36:27] [INFO ] Deduced a trap composed of 11 places in 125 ms of which 1 ms to minimize.
[2022-05-19 08:36:27] [INFO ] Deduced a trap composed of 5 places in 111 ms of which 1 ms to minimize.
[2022-05-19 08:36:27] [INFO ] Deduced a trap composed of 17 places in 113 ms of which 1 ms to minimize.
[2022-05-19 08:36:27] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 2251 ms
[2022-05-19 08:36:27] [INFO ] After 3491ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 87 ms.
[2022-05-19 08:36:27] [INFO ] After 4040ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [(AND p0 (NOT p1)), (X p0), (X (NOT (AND p1 p0))), (X (AND (NOT p1) p0)), true, (X (X (NOT (AND p1 p0)))), (X (X (AND (NOT p1) p0))), (X (X p0))]
False Knowledge obtained : [(F (NOT (AND (NOT p1) p0))), (F (AND p1 p0))]
Knowledge based reduction with 8 factoid took 460 ms. Reduced automaton from 4 states, 7 edges and 2 AP to 4 states, 7 edges and 2 AP.
Stuttering acceptance computed with spot in 109 ms :[(NOT p0), (OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0)), true]
Stuttering acceptance computed with spot in 107 ms :[(NOT p0), (OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0)), true]
// Phase 1: matrix 5202 rows 5302 cols
[2022-05-19 08:36:28] [INFO ] Computed 901 place invariants in 24 ms
[2022-05-19 08:36:38] [INFO ] [Real]Absence check using 901 positive place invariants in 4250 ms returned sat
[2022-05-19 08:36:38] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-19 08:36:43] [INFO ] [Real]Absence check using state equation in 5075 ms returned unknown
Could not prove EG (NOT p1)
Stuttering acceptance computed with spot in 95 ms :[(NOT p0), (OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0)), true]
Product exploration explored 100000 steps with 8 reset in 1524 ms.
Product exploration explored 100000 steps with 8 reset in 1821 ms.
Applying partial POR strategy [true, true, false, true]
Stuttering acceptance computed with spot in 99 ms :[(NOT p0), (OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0)), true]
Support contains 4 out of 5302 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 5302/5302 places, 5202/5202 transitions.
Performed 500 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 500 rules applied. Total rules applied 500 place count 5302 transition count 5202
Performed 201 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 201 Pre rules applied. Total rules applied 500 place count 5302 transition count 5204
Deduced a syphon composed of 701 places in 21 ms
Iterating global reduction 1 with 201 rules applied. Total rules applied 701 place count 5302 transition count 5204
Performed 2094 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 2795 places in 10 ms
Iterating global reduction 1 with 2094 rules applied. Total rules applied 2795 place count 5302 transition count 5204
Renaming transitions due to excessive name length > 1024 char.
Discarding 701 places :
Symmetric choice reduction at 1 with 701 rule applications. Total rules 3496 place count 4601 transition count 4503
Deduced a syphon composed of 2094 places in 8 ms
Iterating global reduction 1 with 701 rules applied. Total rules applied 4197 place count 4601 transition count 4503
Deduced a syphon composed of 2094 places in 8 ms
Applied a total of 4197 rules in 3338 ms. Remains 4601 /5302 variables (removed 701) and now considering 4503/5202 (removed 699) transitions.
[2022-05-19 08:36:51] [INFO ] Redundant transitions in 429 ms returned [4502]
Found 1 redundant transitions using SMT.
Drop transitions removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
// Phase 1: matrix 4502 rows 4601 cols
[2022-05-19 08:36:51] [INFO ] Computed 901 place invariants in 117 ms
[2022-05-19 08:36:53] [INFO ] Dead Transitions using invariants and state equation in 2760 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 4601/5302 places, 4502/5202 transitions.
Deduced a syphon composed of 2094 places in 8 ms
Applied a total of 0 rules in 245 ms. Remains 4601 /4601 variables (removed 0) and now considering 4502/4502 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 4601/5302 places, 4502/5202 transitions.
Product exploration explored 100000 steps with 19 reset in 1623 ms.
Product exploration explored 100000 steps with 19 reset in 2003 ms.
Built C files in :
/tmp/ltsmin14346094035846902962
[2022-05-19 08:36:57] [INFO ] Built C files in 46ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14346094035846902962
Running compilation step : cd /tmp/ltsmin14346094035846902962;'/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/ltsmin14346094035846902962;'/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/ltsmin14346094035846902962;'/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 4 out of 5302 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 5302/5302 places, 5202/5202 transitions.
Applied a total of 0 rules in 430 ms. Remains 5302 /5302 variables (removed 0) and now considering 5202/5202 (removed 0) transitions.
// Phase 1: matrix 5202 rows 5302 cols
[2022-05-19 08:37:01] [INFO ] Computed 901 place invariants in 17 ms
[2022-05-19 08:37:02] [INFO ] Implicit Places using invariants in 1742 ms returned []
// Phase 1: matrix 5202 rows 5302 cols
[2022-05-19 08:37:02] [INFO ] Computed 901 place invariants in 17 ms
[2022-05-19 08:37:04] [INFO ] Implicit Places using invariants and state equation in 1748 ms returned []
Implicit Place search using SMT with State Equation took 3491 ms to find 0 implicit places.
// Phase 1: matrix 5202 rows 5302 cols
[2022-05-19 08:37:04] [INFO ] Computed 901 place invariants in 15 ms
[2022-05-19 08:37:08] [INFO ] Dead Transitions using invariants and state equation in 3419 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 5302/5302 places, 5202/5202 transitions.
Built C files in :
/tmp/ltsmin16165207790831274083
[2022-05-19 08:37:08] [INFO ] Built C files in 68ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16165207790831274083
Running compilation step : cd /tmp/ltsmin16165207790831274083;'/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/ltsmin16165207790831274083;'/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/ltsmin16165207790831274083;'/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-19 08:37:11] [INFO ] Flatten gal took : 153 ms
[2022-05-19 08:37:11] [INFO ] Flatten gal took : 156 ms
[2022-05-19 08:37:11] [INFO ] Time to serialize gal into /tmp/LTL9010196741093742411.gal : 20 ms
[2022-05-19 08:37:11] [INFO ] Time to serialize properties into /tmp/LTL8227879916632220674.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/LTL9010196741093742411.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL8227879916632220674.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/LTL9010196...266
Read 1 LTL properties
Checking formula 0 : !(((G(X("(((p3883==0)||(p1292==0))||(p5419==0))")))&&(F("(p2181==1)"))))
Formula 0 simplified : !(GX"(((p3883==0)||(p1292==0))||(p5419==0))" & F"(p2181==1)")
Detected timeout of ITS tools.
[2022-05-19 08:37:26] [INFO ] Flatten gal took : 170 ms
[2022-05-19 08:37:26] [INFO ] Applying decomposition
[2022-05-19 08:37:27] [INFO ] Flatten gal took : 149 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/graph14583432423039318973.txt' '-o' '/tmp/graph14583432423039318973.bin' '-w' '/tmp/graph14583432423039318973.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph14583432423039318973.bin' '-l' '-1' '-v' '-w' '/tmp/graph14583432423039318973.weights' '-q' '0' '-e' '0.001'
[2022-05-19 08:37:27] [INFO ] Decomposing Gal with order
[2022-05-19 08:37:27] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-19 08:37:28] [INFO ] Removed a total of 2300 redundant transitions.
[2022-05-19 08:37:29] [INFO ] Flatten gal took : 246 ms
[2022-05-19 08:37:29] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 17 ms.
[2022-05-19 08:37:29] [INFO ] Time to serialize gal into /tmp/LTL1040772736981906966.gal : 33 ms
[2022-05-19 08:37:29] [INFO ] Time to serialize properties into /tmp/LTL11723425450159880018.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/LTL1040772736981906966.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL11723425450159880018.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/LTL1040772...246
Read 1 LTL properties
Checking formula 0 : !(((G(X("(((i40.i1.i1.u1303.p3883==0)||(i12.i0.i1.u442.p1292==0))||(i56.i0.i1.u1812.p5419==0))")))&&(F("(i21.u739.p2181==1)"))))
Formula 0 simplified : !(GX"(((i40.i1.i1.u1303.p3883==0)||(i12.i0.i1.u442.p1292==0))||(i56.i0.i1.u1812.p5419==0))" & F"(i21.u739.p2181==1)")
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin12884548783498087885
[2022-05-19 08:37:44] [INFO ] Built C files in 40ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12884548783498087885
Running compilation step : cd /tmp/ltsmin12884548783498087885;'/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/ltsmin12884548783498087885;'/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/ltsmin12884548783498087885;'/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)
Treatment of property ShieldIIPs-PT-100B-LTLFireability-10 finished in 237230 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G((X(!(p0 U p1))&&X(!(p2 U X(p3))))))'
Support contains 5 out of 5308 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 5308/5308 places, 5208/5208 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 5302 transition count 5202
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 5302 transition count 5202
Applied a total of 12 rules in 862 ms. Remains 5302 /5308 variables (removed 6) and now considering 5202/5208 (removed 6) transitions.
// Phase 1: matrix 5202 rows 5302 cols
[2022-05-19 08:37:48] [INFO ] Computed 901 place invariants in 26 ms
[2022-05-19 08:37:49] [INFO ] Implicit Places using invariants in 1662 ms returned []
// Phase 1: matrix 5202 rows 5302 cols
[2022-05-19 08:37:49] [INFO ] Computed 901 place invariants in 17 ms
[2022-05-19 08:37:51] [INFO ] Implicit Places using invariants and state equation in 1700 ms returned []
Implicit Place search using SMT with State Equation took 3364 ms to find 0 implicit places.
// Phase 1: matrix 5202 rows 5302 cols
[2022-05-19 08:37:51] [INFO ] Computed 901 place invariants in 16 ms
[2022-05-19 08:37:54] [INFO ] Dead Transitions using invariants and state equation in 3323 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 5302/5308 places, 5202/5208 transitions.
Finished structural reductions, in 1 iterations. Remains : 5302/5308 places, 5202/5208 transitions.
Stuttering acceptance computed with spot in 134 ms :[true, (OR p3 p1), (OR p3 p1), (OR p3 p1)]
Running random walk in product with property : ShieldIIPs-PT-100B-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=p1, acceptance={} source=2 dest: 0}, { cond=(NOT p1), acceptance={} source=2 dest: 3}], [{ cond=(OR p1 p3), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p1) (NOT p3)), acceptance={} source=3 dest: 3}]], initial=1, aps=[p1:(AND (EQ s2674 1) (EQ s2690 1) (EQ s2701 1)), p3:(AND (EQ s436 1) (EQ s504 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 7346 steps with 0 reset in 113 ms.
FORMULA ShieldIIPs-PT-100B-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPs-PT-100B-LTLFireability-11 finished in 7851 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(X(!((X(p0)&&G(p1)) U !p2))))'
Support contains 5 out of 5308 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 5308/5308 places, 5208/5208 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 5303 transition count 5203
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 5303 transition count 5203
Applied a total of 10 rules in 860 ms. Remains 5303 /5308 variables (removed 5) and now considering 5203/5208 (removed 5) transitions.
// Phase 1: matrix 5203 rows 5303 cols
[2022-05-19 08:37:56] [INFO ] Computed 901 place invariants in 25 ms
[2022-05-19 08:37:57] [INFO ] Implicit Places using invariants in 1661 ms returned []
// Phase 1: matrix 5203 rows 5303 cols
[2022-05-19 08:37:57] [INFO ] Computed 901 place invariants in 17 ms
[2022-05-19 08:37:59] [INFO ] Implicit Places using invariants and state equation in 1753 ms returned []
Implicit Place search using SMT with State Equation took 3414 ms to find 0 implicit places.
// Phase 1: matrix 5203 rows 5303 cols
[2022-05-19 08:37:59] [INFO ] Computed 901 place invariants in 23 ms
[2022-05-19 08:38:02] [INFO ] Dead Transitions using invariants and state equation in 3445 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 5303/5308 places, 5203/5208 transitions.
Finished structural reductions, in 1 iterations. Remains : 5303/5308 places, 5203/5208 transitions.
Stuttering acceptance computed with spot in 786 ms :[(NOT p2), (NOT p2), (AND (NOT p2) p1 p0), (AND p1 (NOT p2))]
Running random walk in product with property : ShieldIIPs-PT-100B-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p2), acceptance={0} source=1 dest: 1}, { cond=(AND p1 p2), acceptance={} source=1 dest: 2}], [{ cond=(AND p1 p2 p0), acceptance={} source=2 dest: 2}, { cond=(AND p1 (NOT p2) p0), acceptance={0} source=2 dest: 3}], [{ cond=(AND p1 p2), acceptance={} source=3 dest: 2}, { cond=(AND p1 (NOT p2)), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p2:(AND (EQ s2207 1) (EQ s2223 1) (EQ s2234 1)), p1:(EQ s3773 1), p0:(EQ s1484 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Stuttering criterion allowed to conclude after 11980 steps with 0 reset in 199 ms.
FORMULA ShieldIIPs-PT-100B-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPs-PT-100B-LTLFireability-12 finished in 8759 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((X(F((p0 U (F(p1)||!p0))))||F(p1)))'
Support contains 3 out of 5308 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 5308/5308 places, 5208/5208 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 5302 transition count 5202
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 5302 transition count 5202
Applied a total of 12 rules in 804 ms. Remains 5302 /5308 variables (removed 6) and now considering 5202/5208 (removed 6) transitions.
// Phase 1: matrix 5202 rows 5302 cols
[2022-05-19 08:38:04] [INFO ] Computed 901 place invariants in 25 ms
[2022-05-19 08:38:06] [INFO ] Implicit Places using invariants in 1718 ms returned []
// Phase 1: matrix 5202 rows 5302 cols
[2022-05-19 08:38:06] [INFO ] Computed 901 place invariants in 24 ms
[2022-05-19 08:38:08] [INFO ] Implicit Places using invariants and state equation in 1724 ms returned []
Implicit Place search using SMT with State Equation took 3442 ms to find 0 implicit places.
// Phase 1: matrix 5202 rows 5302 cols
[2022-05-19 08:38:08] [INFO ] Computed 901 place invariants in 22 ms
[2022-05-19 08:38:11] [INFO ] Dead Transitions using invariants and state equation in 3486 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 5302/5308 places, 5202/5208 transitions.
Finished structural reductions, in 1 iterations. Remains : 5302/5308 places, 5202/5208 transitions.
Stuttering acceptance computed with spot in 116 ms :[(AND (NOT p1) p0), (AND (NOT p1) p0)]
Running random walk in product with property : ShieldIIPs-PT-100B-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p1) p0), acceptance={0} source=0 dest: 0}], [{ cond=(NOT p1), acceptance={} source=1 dest: 0}]], initial=1, aps=[p1:(EQ s498 1), p0:(AND (EQ s2615 1) (EQ s2640 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 50000 reset in 3269 ms.
Product exploration explored 100000 steps with 50000 reset in 3277 ms.
Computed a total of 1199 stabilizing places and 1199 stable transitions
Computed a total of 1199 stabilizing places and 1199 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT (AND (NOT p1) p0))), (X (X (NOT (AND (NOT p1) p0))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (NOT (AND (NOT p1) p0)))
Knowledge based reduction with 3 factoid took 71 ms. Reduced automaton from 2 states, 2 edges and 2 AP to 1 states, 0 edges and 0 AP.
FORMULA ShieldIIPs-PT-100B-LTLFireability-13 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ShieldIIPs-PT-100B-LTLFireability-13 finished in 14610 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(X((p0 U (G(X(p1)) U (X((p2 U p1))&&p0))))))'
Support contains 3 out of 5308 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 5308/5308 places, 5208/5208 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 5302 transition count 5202
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 5302 transition count 5202
Applied a total of 12 rules in 843 ms. Remains 5302 /5308 variables (removed 6) and now considering 5202/5208 (removed 6) transitions.
// Phase 1: matrix 5202 rows 5302 cols
[2022-05-19 08:38:19] [INFO ] Computed 901 place invariants in 22 ms
[2022-05-19 08:38:21] [INFO ] Implicit Places using invariants in 1690 ms returned []
// Phase 1: matrix 5202 rows 5302 cols
[2022-05-19 08:38:21] [INFO ] Computed 901 place invariants in 23 ms
[2022-05-19 08:38:22] [INFO ] Implicit Places using invariants and state equation in 1713 ms returned []
Implicit Place search using SMT with State Equation took 3405 ms to find 0 implicit places.
// Phase 1: matrix 5202 rows 5302 cols
[2022-05-19 08:38:22] [INFO ] Computed 901 place invariants in 17 ms
[2022-05-19 08:38:26] [INFO ] Dead Transitions using invariants and state equation in 3503 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 5302/5308 places, 5202/5208 transitions.
Finished structural reductions, in 1 iterations. Remains : 5302/5308 places, 5202/5208 transitions.
Stuttering acceptance computed with spot in 130 ms :[(NOT p1), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0))]
Running random walk in product with property : ShieldIIPs-PT-100B-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=(OR (AND p0 (NOT p1)) (AND (NOT p1) p2)), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={0} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=p0, acceptance={0} source=2 dest: 0}, { cond=(NOT p0), acceptance={0} source=2 dest: 2}]], initial=1, aps=[p0:(EQ s2731 1), p1:(EQ s19 1), p2:(NEQ s461 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Stuttering criterion allowed to conclude after 12485 steps with 0 reset in 192 ms.
FORMULA ShieldIIPs-PT-100B-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPs-PT-100B-LTLFireability-14 finished in 8118 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(G((X((G(p1)||p0)) U !p2))))'
Support contains 4 out of 5308 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 5308/5308 places, 5208/5208 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 5302 transition count 5202
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 5302 transition count 5202
Applied a total of 12 rules in 841 ms. Remains 5302 /5308 variables (removed 6) and now considering 5202/5208 (removed 6) transitions.
// Phase 1: matrix 5202 rows 5302 cols
[2022-05-19 08:38:27] [INFO ] Computed 901 place invariants in 24 ms
[2022-05-19 08:38:29] [INFO ] Implicit Places using invariants in 1736 ms returned []
// Phase 1: matrix 5202 rows 5302 cols
[2022-05-19 08:38:29] [INFO ] Computed 901 place invariants in 23 ms
[2022-05-19 08:38:30] [INFO ] Implicit Places using invariants and state equation in 1784 ms returned []
Implicit Place search using SMT with State Equation took 3521 ms to find 0 implicit places.
// Phase 1: matrix 5202 rows 5302 cols
[2022-05-19 08:38:30] [INFO ] Computed 901 place invariants in 23 ms
[2022-05-19 08:38:34] [INFO ] Dead Transitions using invariants and state equation in 3520 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 5302/5308 places, 5202/5208 transitions.
Finished structural reductions, in 1 iterations. Remains : 5302/5308 places, 5202/5208 transitions.
Stuttering acceptance computed with spot in 250 ms :[p2, p2, (AND (NOT p1) p2), (AND (NOT p1) p2)]
Running random walk in product with property : ShieldIIPs-PT-100B-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={1} source=0 dest: 0}, { cond=p2, acceptance={0, 1} source=0 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={1} source=1 dest: 0}, { cond=p2, acceptance={0, 1} source=1 dest: 1}, { cond=(AND (NOT p0) p1), acceptance={} source=1 dest: 2}], [{ cond=(NOT p1), acceptance={1} source=2 dest: 0}, { cond=(AND p2 (NOT p1)), acceptance={0, 1} source=2 dest: 1}, { cond=p1, acceptance={} source=2 dest: 2}, { cond=(AND p2 p1), acceptance={0} source=2 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={1} source=3 dest: 0}, { cond=(AND p2 (NOT p1)), acceptance={0, 1} source=3 dest: 1}, { cond=(AND (NOT p0) p1), acceptance={} source=3 dest: 2}, { cond=(AND p2 p1), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p2:(AND (EQ s1778 1) (EQ s1800 1)), p0:(OR (EQ s392 1) (EQ s127 1)), p1:(NEQ s392 1)], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 8 reset in 1543 ms.
Product exploration explored 100000 steps with 8 reset in 1800 ms.
Computed a total of 1199 stabilizing places and 1199 stable transitions
Computed a total of 1199 stabilizing places and 1199 stable transitions
Knowledge obtained : [(AND (NOT p2) (NOT p0) p1), (X (NOT p2)), (X (AND (NOT p0) p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT p2))), true, (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p1)), (X (X (NOT (AND p2 p1)))), (X (X (NOT (AND p2 (NOT p1)))))]
False Knowledge obtained : []
Knowledge based reduction with 11 factoid took 483 ms. Reduced automaton from 4 states, 13 edges and 3 AP to 4 states, 13 edges and 3 AP.
Stuttering acceptance computed with spot in 166 ms :[p2, p2, (AND (NOT p1) p2), (AND (NOT p1) p2)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 304 ms. (steps per millisecond=32 ) 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 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 21 ms. (steps per millisecond=476 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=476 ) 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
Interrupted probabilistic random walk after 109213 steps, run timeout after 3001 ms. (steps per millisecond=36 ) properties seen :{2=1}
Probabilistic random walk after 109213 steps, saw 107461 distinct states, run finished after 3001 ms. (steps per millisecond=36 ) properties seen :1
Running SMT prover for 5 properties.
// Phase 1: matrix 5202 rows 5302 cols
[2022-05-19 08:38:42] [INFO ] Computed 901 place invariants in 16 ms
[2022-05-19 08:38:43] [INFO ] [Real]Absence check using 901 positive place invariants in 523 ms returned sat
[2022-05-19 08:38:48] [INFO ] After 4272ms SMT Verify possible using state equation in real domain returned unsat :1 sat :1 real:3
[2022-05-19 08:38:50] [INFO ] Deduced a trap composed of 22 places in 2105 ms of which 3 ms to minimize.
[2022-05-19 08:38:52] [INFO ] Deduced a trap composed of 24 places in 2022 ms of which 3 ms to minimize.
[2022-05-19 08:38:54] [INFO ] Deduced a trap composed of 16 places in 1988 ms of which 3 ms to minimize.
[2022-05-19 08:38:56] [INFO ] Deduced a trap composed of 16 places in 1938 ms of which 3 ms to minimize.
[2022-05-19 08:38:59] [INFO ] Deduced a trap composed of 21 places in 1856 ms of which 3 ms to minimize.
[2022-05-19 08:39:01] [INFO ] Deduced a trap composed of 23 places in 1976 ms of which 3 ms to minimize.
[2022-05-19 08:39:03] [INFO ] Deduced a trap composed of 24 places in 1806 ms of which 3 ms to minimize.
[2022-05-19 08:39:05] [INFO ] Deduced a trap composed of 20 places in 2006 ms of which 3 ms to minimize.
[2022-05-19 08:39:07] [INFO ] Deduced a trap composed of 26 places in 1940 ms of which 3 ms to minimize.
[2022-05-19 08:39:07] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2022-05-19 08:39:07] [INFO ] After 25175ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0
Fused 5 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 220 ms.
Support contains 3 out of 5302 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 5302/5302 places, 5202/5202 transitions.
Drop transitions removed 500 transitions
Trivial Post-agglo rules discarded 500 transitions
Performed 500 trivial Post agglomeration. Transition count delta: 500
Iterating post reduction 0 with 500 rules applied. Total rules applied 500 place count 5302 transition count 4702
Reduce places removed 500 places and 0 transitions.
Iterating post reduction 1 with 500 rules applied. Total rules applied 1000 place count 4802 transition count 4702
Performed 502 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 502 Pre rules applied. Total rules applied 1000 place count 4802 transition count 4200
Deduced a syphon composed of 502 places in 20 ms
Reduce places removed 502 places and 0 transitions.
Iterating global reduction 2 with 1004 rules applied. Total rules applied 2004 place count 4300 transition count 4200
Performed 1798 Post agglomeration using F-continuation condition.Transition count delta: 1798
Deduced a syphon composed of 1798 places in 11 ms
Reduce places removed 1798 places and 0 transitions.
Iterating global reduction 2 with 3596 rules applied. Total rules applied 5600 place count 2502 transition count 2402
Renaming transitions due to excessive name length > 1024 char.
Partial Free-agglomeration rule applied 696 times.
Drop transitions removed 696 transitions
Iterating global reduction 2 with 696 rules applied. Total rules applied 6296 place count 2502 transition count 2402
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 6297 place count 2501 transition count 2401
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 6298 place count 2500 transition count 2401
Applied a total of 6298 rules in 917 ms. Remains 2500 /5302 variables (removed 2802) and now considering 2401/5202 (removed 2801) transitions.
Finished structural reductions, in 1 iterations. Remains : 2500/5302 places, 2401/5202 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 330 ms. (steps per millisecond=30 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 122 ms. (steps per millisecond=81 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 120 ms. (steps per millisecond=83 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 119 ms. (steps per millisecond=84 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 123 ms. (steps per millisecond=81 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 122778 steps, run timeout after 3001 ms. (steps per millisecond=40 ) properties seen :{0=1, 1=1, 3=1}
Probabilistic random walk after 122778 steps, saw 121685 distinct states, run finished after 3001 ms. (steps per millisecond=40 ) properties seen :3
Running SMT prover for 1 properties.
// Phase 1: matrix 2401 rows 2500 cols
[2022-05-19 08:39:12] [INFO ] Computed 900 place invariants in 25 ms
[2022-05-19 08:39:12] [INFO ] [Real]Absence check using 898 positive place invariants in 151 ms returned sat
[2022-05-19 08:39:12] [INFO ] [Real]Absence check using 898 positive and 2 generalized place invariants in 2 ms returned sat
[2022-05-19 08:39:14] [INFO ] After 1604ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-19 08:39:14] [INFO ] [Nat]Absence check using 898 positive place invariants in 163 ms returned sat
[2022-05-19 08:39:14] [INFO ] [Nat]Absence check using 898 positive and 2 generalized place invariants in 1 ms returned sat
[2022-05-19 08:39:15] [INFO ] After 1270ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-19 08:39:16] [INFO ] Deduced a trap composed of 5 places in 118 ms of which 1 ms to minimize.
[2022-05-19 08:39:16] [INFO ] Deduced a trap composed of 4 places in 179 ms of which 1 ms to minimize.
[2022-05-19 08:39:16] [INFO ] Deduced a trap composed of 8 places in 155 ms of which 1 ms to minimize.
[2022-05-19 08:39:16] [INFO ] Deduced a trap composed of 8 places in 140 ms of which 0 ms to minimize.
[2022-05-19 08:39:17] [INFO ] Deduced a trap composed of 9 places in 133 ms of which 1 ms to minimize.
[2022-05-19 08:39:17] [INFO ] Deduced a trap composed of 17 places in 119 ms of which 1 ms to minimize.
[2022-05-19 08:39:17] [INFO ] Deduced a trap composed of 18 places in 113 ms of which 0 ms to minimize.
[2022-05-19 08:39:17] [INFO ] Deduced a trap composed of 11 places in 110 ms of which 1 ms to minimize.
[2022-05-19 08:39:17] [INFO ] Deduced a trap composed of 17 places in 101 ms of which 0 ms to minimize.
[2022-05-19 08:39:17] [INFO ] Deduced a trap composed of 8 places in 104 ms of which 0 ms to minimize.
[2022-05-19 08:39:18] [INFO ] Deduced a trap composed of 17 places in 99 ms of which 0 ms to minimize.
[2022-05-19 08:39:18] [INFO ] Deduced a trap composed of 17 places in 107 ms of which 0 ms to minimize.
[2022-05-19 08:39:18] [INFO ] Deduced a trap composed of 24 places in 97 ms of which 0 ms to minimize.
[2022-05-19 08:39:18] [INFO ] Deduced a trap composed of 17 places in 96 ms of which 1 ms to minimize.
[2022-05-19 08:39:18] [INFO ] Deduced a trap composed of 11 places in 86 ms of which 0 ms to minimize.
[2022-05-19 08:39:19] [INFO ] Deduced a trap composed of 17 places in 86 ms of which 1 ms to minimize.
[2022-05-19 08:39:19] [INFO ] Deduced a trap composed of 4 places in 86 ms of which 0 ms to minimize.
[2022-05-19 08:39:19] [INFO ] Deduced a trap composed of 17 places in 78 ms of which 1 ms to minimize.
[2022-05-19 08:39:19] [INFO ] Deduced a trap composed of 23 places in 90 ms of which 1 ms to minimize.
[2022-05-19 08:39:19] [INFO ] Deduced a trap composed of 11 places in 77 ms of which 0 ms to minimize.
[2022-05-19 08:39:19] [INFO ] Trap strengthening (SAT) tested/added 21/20 trap constraints in 3942 ms
[2022-05-19 08:39:19] [INFO ] After 5273ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 94 ms.
[2022-05-19 08:39:19] [INFO ] After 5837ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 29 ms.
Support contains 3 out of 2500 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 2500/2500 places, 2401/2401 transitions.
Applied a total of 0 rules in 69 ms. Remains 2500 /2500 variables (removed 0) and now considering 2401/2401 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 2500/2500 places, 2401/2401 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 167 ms. (steps per millisecond=59 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 107 ms. (steps per millisecond=93 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 159447 steps, run timeout after 3003 ms. (steps per millisecond=53 ) properties seen :{}
Probabilistic random walk after 159447 steps, saw 158142 distinct states, run finished after 3003 ms. (steps per millisecond=53 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 2401 rows 2500 cols
[2022-05-19 08:39:23] [INFO ] Computed 900 place invariants in 24 ms
[2022-05-19 08:39:23] [INFO ] [Real]Absence check using 898 positive place invariants in 143 ms returned sat
[2022-05-19 08:39:23] [INFO ] [Real]Absence check using 898 positive and 2 generalized place invariants in 0 ms returned sat
[2022-05-19 08:39:24] [INFO ] After 1598ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-19 08:39:25] [INFO ] [Nat]Absence check using 898 positive place invariants in 150 ms returned sat
[2022-05-19 08:39:25] [INFO ] [Nat]Absence check using 898 positive and 2 generalized place invariants in 0 ms returned sat
[2022-05-19 08:39:26] [INFO ] After 1201ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-19 08:39:26] [INFO ] Deduced a trap composed of 5 places in 138 ms of which 0 ms to minimize.
[2022-05-19 08:39:27] [INFO ] Deduced a trap composed of 4 places in 180 ms of which 1 ms to minimize.
[2022-05-19 08:39:27] [INFO ] Deduced a trap composed of 8 places in 172 ms of which 1 ms to minimize.
[2022-05-19 08:39:27] [INFO ] Deduced a trap composed of 8 places in 136 ms of which 1 ms to minimize.
[2022-05-19 08:39:27] [INFO ] Deduced a trap composed of 9 places in 129 ms of which 1 ms to minimize.
[2022-05-19 08:39:27] [INFO ] Deduced a trap composed of 17 places in 127 ms of which 1 ms to minimize.
[2022-05-19 08:39:28] [INFO ] Deduced a trap composed of 18 places in 111 ms of which 0 ms to minimize.
[2022-05-19 08:39:28] [INFO ] Deduced a trap composed of 11 places in 114 ms of which 1 ms to minimize.
[2022-05-19 08:39:28] [INFO ] Deduced a trap composed of 17 places in 103 ms of which 0 ms to minimize.
[2022-05-19 08:39:28] [INFO ] Deduced a trap composed of 8 places in 107 ms of which 1 ms to minimize.
[2022-05-19 08:39:28] [INFO ] Deduced a trap composed of 17 places in 103 ms of which 0 ms to minimize.
[2022-05-19 08:39:29] [INFO ] Deduced a trap composed of 17 places in 120 ms of which 1 ms to minimize.
[2022-05-19 08:39:29] [INFO ] Deduced a trap composed of 24 places in 98 ms of which 1 ms to minimize.
[2022-05-19 08:39:29] [INFO ] Deduced a trap composed of 17 places in 98 ms of which 0 ms to minimize.
[2022-05-19 08:39:29] [INFO ] Deduced a trap composed of 11 places in 89 ms of which 0 ms to minimize.
[2022-05-19 08:39:29] [INFO ] Deduced a trap composed of 17 places in 93 ms of which 0 ms to minimize.
[2022-05-19 08:39:29] [INFO ] Deduced a trap composed of 4 places in 82 ms of which 1 ms to minimize.
[2022-05-19 08:39:30] [INFO ] Deduced a trap composed of 17 places in 83 ms of which 1 ms to minimize.
[2022-05-19 08:39:30] [INFO ] Deduced a trap composed of 23 places in 90 ms of which 1 ms to minimize.
[2022-05-19 08:39:30] [INFO ] Deduced a trap composed of 11 places in 77 ms of which 1 ms to minimize.
[2022-05-19 08:39:30] [INFO ] Trap strengthening (SAT) tested/added 21/20 trap constraints in 3921 ms
[2022-05-19 08:39:30] [INFO ] After 5181ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 90 ms.
[2022-05-19 08:39:30] [INFO ] After 5694ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 29 ms.
Support contains 3 out of 2500 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 2500/2500 places, 2401/2401 transitions.
Applied a total of 0 rules in 86 ms. Remains 2500 /2500 variables (removed 0) and now considering 2401/2401 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 2500/2500 places, 2401/2401 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 2500/2500 places, 2401/2401 transitions.
Applied a total of 0 rules in 70 ms. Remains 2500 /2500 variables (removed 0) and now considering 2401/2401 (removed 0) transitions.
// Phase 1: matrix 2401 rows 2500 cols
[2022-05-19 08:39:30] [INFO ] Computed 900 place invariants in 18 ms
[2022-05-19 08:39:32] [INFO ] Implicit Places using invariants in 1723 ms returned []
// Phase 1: matrix 2401 rows 2500 cols
[2022-05-19 08:39:32] [INFO ] Computed 900 place invariants in 34 ms
[2022-05-19 08:39:36] [INFO ] Implicit Places using invariants and state equation in 3945 ms returned []
Implicit Place search using SMT with State Equation took 5670 ms to find 0 implicit places.
[2022-05-19 08:39:36] [INFO ] Redundant transitions in 68 ms returned []
// Phase 1: matrix 2401 rows 2500 cols
[2022-05-19 08:39:36] [INFO ] Computed 900 place invariants in 24 ms
[2022-05-19 08:39:38] [INFO ] Dead Transitions using invariants and state equation in 1395 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 2500/2500 places, 2401/2401 transitions.
Applied a total of 0 rules in 69 ms. Remains 2500 /2500 variables (removed 0) and now considering 2401/2401 (removed 0) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 2401 rows 2500 cols
[2022-05-19 08:39:38] [INFO ] Computed 900 place invariants in 22 ms
[2022-05-19 08:39:38] [INFO ] [Real]Absence check using 898 positive place invariants in 153 ms returned sat
[2022-05-19 08:39:38] [INFO ] [Real]Absence check using 898 positive and 2 generalized place invariants in 1 ms returned sat
[2022-05-19 08:39:39] [INFO ] After 1649ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-19 08:39:40] [INFO ] [Nat]Absence check using 898 positive place invariants in 156 ms returned sat
[2022-05-19 08:39:40] [INFO ] [Nat]Absence check using 898 positive and 2 generalized place invariants in 1 ms returned sat
[2022-05-19 08:39:41] [INFO ] After 1210ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-19 08:39:41] [INFO ] Deduced a trap composed of 5 places in 124 ms of which 1 ms to minimize.
[2022-05-19 08:39:41] [INFO ] Deduced a trap composed of 4 places in 175 ms of which 0 ms to minimize.
[2022-05-19 08:39:42] [INFO ] Deduced a trap composed of 8 places in 148 ms of which 0 ms to minimize.
[2022-05-19 08:39:42] [INFO ] Deduced a trap composed of 8 places in 132 ms of which 0 ms to minimize.
[2022-05-19 08:39:42] [INFO ] Deduced a trap composed of 9 places in 136 ms of which 0 ms to minimize.
[2022-05-19 08:39:42] [INFO ] Deduced a trap composed of 17 places in 129 ms of which 0 ms to minimize.
[2022-05-19 08:39:42] [INFO ] Deduced a trap composed of 18 places in 112 ms of which 1 ms to minimize.
[2022-05-19 08:39:43] [INFO ] Deduced a trap composed of 11 places in 125 ms of which 0 ms to minimize.
[2022-05-19 08:39:43] [INFO ] Deduced a trap composed of 17 places in 109 ms of which 0 ms to minimize.
[2022-05-19 08:39:43] [INFO ] Deduced a trap composed of 8 places in 109 ms of which 0 ms to minimize.
[2022-05-19 08:39:43] [INFO ] Deduced a trap composed of 17 places in 101 ms of which 0 ms to minimize.
[2022-05-19 08:39:43] [INFO ] Deduced a trap composed of 17 places in 102 ms of which 0 ms to minimize.
[2022-05-19 08:39:44] [INFO ] Deduced a trap composed of 24 places in 99 ms of which 1 ms to minimize.
[2022-05-19 08:39:44] [INFO ] Deduced a trap composed of 17 places in 95 ms of which 0 ms to minimize.
[2022-05-19 08:39:44] [INFO ] Deduced a trap composed of 11 places in 91 ms of which 0 ms to minimize.
[2022-05-19 08:39:44] [INFO ] Deduced a trap composed of 17 places in 89 ms of which 0 ms to minimize.
[2022-05-19 08:39:44] [INFO ] Deduced a trap composed of 4 places in 78 ms of which 1 ms to minimize.
[2022-05-19 08:39:44] [INFO ] Deduced a trap composed of 17 places in 82 ms of which 0 ms to minimize.
[2022-05-19 08:39:45] [INFO ] Deduced a trap composed of 23 places in 88 ms of which 0 ms to minimize.
[2022-05-19 08:39:45] [INFO ] Deduced a trap composed of 11 places in 78 ms of which 0 ms to minimize.
[2022-05-19 08:39:45] [INFO ] Trap strengthening (SAT) tested/added 21/20 trap constraints in 3879 ms
[2022-05-19 08:39:45] [INFO ] After 5145ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 89 ms.
[2022-05-19 08:39:45] [INFO ] After 5678ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p2) (NOT p0) p1), (X (NOT p2)), (X (AND (NOT p0) p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT p2))), true, (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p1)), (X (X (NOT (AND p2 p1)))), (X (X (NOT (AND p2 (NOT p1))))), (G (NOT (AND (NOT p0) (NOT p1))))]
False Knowledge obtained : [(F (NOT p1)), (F (AND p1 p2)), (F p2), (F (NOT (AND (NOT p0) p1)))]
Knowledge based reduction with 12 factoid took 504 ms. Reduced automaton from 4 states, 13 edges and 3 AP to 4 states, 11 edges and 3 AP.
Stuttering acceptance computed with spot in 137 ms :[p2, p2, (AND (NOT p1) p2), (AND (NOT p1) p2)]
Stuttering acceptance computed with spot in 260 ms :[p2, p2, (AND (NOT p1) p2), (AND (NOT p1) p2)]
Support contains 4 out of 5302 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 5302/5302 places, 5202/5202 transitions.
Applied a total of 0 rules in 418 ms. Remains 5302 /5302 variables (removed 0) and now considering 5202/5202 (removed 0) transitions.
// Phase 1: matrix 5202 rows 5302 cols
[2022-05-19 08:39:46] [INFO ] Computed 901 place invariants in 24 ms
[2022-05-19 08:39:48] [INFO ] Implicit Places using invariants in 1625 ms returned []
// Phase 1: matrix 5202 rows 5302 cols
[2022-05-19 08:39:48] [INFO ] Computed 901 place invariants in 17 ms
[2022-05-19 08:39:50] [INFO ] Implicit Places using invariants and state equation in 1659 ms returned []
Implicit Place search using SMT with State Equation took 3285 ms to find 0 implicit places.
// Phase 1: matrix 5202 rows 5302 cols
[2022-05-19 08:39:50] [INFO ] Computed 901 place invariants in 16 ms
[2022-05-19 08:39:53] [INFO ] Dead Transitions using invariants and state equation in 3249 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 5302/5302 places, 5202/5202 transitions.
Computed a total of 1199 stabilizing places and 1199 stable transitions
Computed a total of 1199 stabilizing places and 1199 stable transitions
Knowledge obtained : [(AND (NOT p2) (NOT p0) p1), (X (NOT p2)), (X (NOT p0)), (X (X (NOT p2))), (X (X (NOT p0))), (X (X p1)), (X (X (NOT (AND p2 p1)))), (X (X (NOT (AND p2 (NOT p1)))))]
False Knowledge obtained : []
Knowledge based reduction with 8 factoid took 338 ms. Reduced automaton from 4 states, 11 edges and 3 AP to 4 states, 11 edges and 3 AP.
Stuttering acceptance computed with spot in 120 ms :[p2, p2, (AND (NOT p1) p2), (AND (NOT p1) p2)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 289 ms. (steps per millisecond=34 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 5) 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 5) 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 5) 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 5) seen :0
Interrupted probabilistic random walk after 113099 steps, run timeout after 3002 ms. (steps per millisecond=37 ) properties seen :{1=1}
Probabilistic random walk after 113099 steps, saw 111276 distinct states, run finished after 3002 ms. (steps per millisecond=37 ) properties seen :1
Running SMT prover for 4 properties.
// Phase 1: matrix 5202 rows 5302 cols
[2022-05-19 08:39:57] [INFO ] Computed 901 place invariants in 24 ms
[2022-05-19 08:39:58] [INFO ] [Real]Absence check using 901 positive place invariants in 531 ms returned sat
[2022-05-19 08:40:03] [INFO ] After 4200ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1 real:3
[2022-05-19 08:40:05] [INFO ] Deduced a trap composed of 22 places in 2113 ms of which 3 ms to minimize.
[2022-05-19 08:40:07] [INFO ] Deduced a trap composed of 24 places in 2049 ms of which 3 ms to minimize.
[2022-05-19 08:40:09] [INFO ] Deduced a trap composed of 16 places in 1962 ms of which 3 ms to minimize.
[2022-05-19 08:40:11] [INFO ] Deduced a trap composed of 16 places in 1885 ms of which 3 ms to minimize.
[2022-05-19 08:40:14] [INFO ] Deduced a trap composed of 21 places in 1957 ms of which 3 ms to minimize.
[2022-05-19 08:40:16] [INFO ] Deduced a trap composed of 23 places in 1928 ms of which 3 ms to minimize.
[2022-05-19 08:40:18] [INFO ] Deduced a trap composed of 24 places in 1913 ms of which 3 ms to minimize.
[2022-05-19 08:40:20] [INFO ] Deduced a trap composed of 20 places in 1855 ms of which 3 ms to minimize.
[2022-05-19 08:40:22] [INFO ] Deduced a trap composed of 26 places in 1920 ms of which 3 ms to minimize.
[2022-05-19 08:40:27] [INFO ] Deduced a trap composed of 16 places in 4945 ms of which 4 ms to minimize.
[2022-05-19 08:40:27] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2022-05-19 08:40:27] [INFO ] After 29960ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0
Fused 4 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 213 ms.
Support contains 3 out of 5302 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 5302/5302 places, 5202/5202 transitions.
Drop transitions removed 500 transitions
Trivial Post-agglo rules discarded 500 transitions
Performed 500 trivial Post agglomeration. Transition count delta: 500
Iterating post reduction 0 with 500 rules applied. Total rules applied 500 place count 5302 transition count 4702
Reduce places removed 500 places and 0 transitions.
Iterating post reduction 1 with 500 rules applied. Total rules applied 1000 place count 4802 transition count 4702
Performed 502 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 502 Pre rules applied. Total rules applied 1000 place count 4802 transition count 4200
Deduced a syphon composed of 502 places in 19 ms
Reduce places removed 502 places and 0 transitions.
Iterating global reduction 2 with 1004 rules applied. Total rules applied 2004 place count 4300 transition count 4200
Performed 1798 Post agglomeration using F-continuation condition.Transition count delta: 1798
Deduced a syphon composed of 1798 places in 12 ms
Reduce places removed 1798 places and 0 transitions.
Iterating global reduction 2 with 3596 rules applied. Total rules applied 5600 place count 2502 transition count 2402
Renaming transitions due to excessive name length > 1024 char.
Partial Free-agglomeration rule applied 696 times.
Drop transitions removed 696 transitions
Iterating global reduction 2 with 696 rules applied. Total rules applied 6296 place count 2502 transition count 2402
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 6297 place count 2501 transition count 2401
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 6298 place count 2500 transition count 2401
Applied a total of 6298 rules in 1005 ms. Remains 2500 /5302 variables (removed 2802) and now considering 2401/5202 (removed 2801) transitions.
Finished structural reductions, in 1 iterations. Remains : 2500/5302 places, 2401/5202 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 349 ms. (steps per millisecond=28 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 120 ms. (steps per millisecond=83 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 118 ms. (steps per millisecond=84 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 119 ms. (steps per millisecond=84 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 125 ms. (steps per millisecond=80 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 118792 steps, run timeout after 3002 ms. (steps per millisecond=39 ) properties seen :{0=1, 1=1, 3=1}
Probabilistic random walk after 118792 steps, saw 117730 distinct states, run finished after 3002 ms. (steps per millisecond=39 ) properties seen :3
Running SMT prover for 1 properties.
// Phase 1: matrix 2401 rows 2500 cols
[2022-05-19 08:40:32] [INFO ] Computed 900 place invariants in 26 ms
[2022-05-19 08:40:32] [INFO ] [Real]Absence check using 898 positive place invariants in 150 ms returned sat
[2022-05-19 08:40:32] [INFO ] [Real]Absence check using 898 positive and 2 generalized place invariants in 1 ms returned sat
[2022-05-19 08:40:34] [INFO ] After 1603ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-19 08:40:34] [INFO ] [Nat]Absence check using 898 positive place invariants in 157 ms returned sat
[2022-05-19 08:40:34] [INFO ] [Nat]Absence check using 898 positive and 2 generalized place invariants in 0 ms returned sat
[2022-05-19 08:40:35] [INFO ] After 1244ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-19 08:40:35] [INFO ] Deduced a trap composed of 5 places in 128 ms of which 0 ms to minimize.
[2022-05-19 08:40:36] [INFO ] Deduced a trap composed of 4 places in 191 ms of which 1 ms to minimize.
[2022-05-19 08:40:36] [INFO ] Deduced a trap composed of 8 places in 149 ms of which 0 ms to minimize.
[2022-05-19 08:40:36] [INFO ] Deduced a trap composed of 8 places in 131 ms of which 0 ms to minimize.
[2022-05-19 08:40:36] [INFO ] Deduced a trap composed of 9 places in 149 ms of which 1 ms to minimize.
[2022-05-19 08:40:37] [INFO ] Deduced a trap composed of 17 places in 130 ms of which 0 ms to minimize.
[2022-05-19 08:40:37] [INFO ] Deduced a trap composed of 18 places in 117 ms of which 1 ms to minimize.
[2022-05-19 08:40:37] [INFO ] Deduced a trap composed of 11 places in 112 ms of which 1 ms to minimize.
[2022-05-19 08:40:37] [INFO ] Deduced a trap composed of 17 places in 99 ms of which 1 ms to minimize.
[2022-05-19 08:40:37] [INFO ] Deduced a trap composed of 8 places in 119 ms of which 0 ms to minimize.
[2022-05-19 08:40:38] [INFO ] Deduced a trap composed of 17 places in 115 ms of which 0 ms to minimize.
[2022-05-19 08:40:38] [INFO ] Deduced a trap composed of 17 places in 115 ms of which 1 ms to minimize.
[2022-05-19 08:40:38] [INFO ] Deduced a trap composed of 24 places in 114 ms of which 0 ms to minimize.
[2022-05-19 08:40:38] [INFO ] Deduced a trap composed of 17 places in 94 ms of which 0 ms to minimize.
[2022-05-19 08:40:38] [INFO ] Deduced a trap composed of 11 places in 92 ms of which 0 ms to minimize.
[2022-05-19 08:40:39] [INFO ] Deduced a trap composed of 17 places in 103 ms of which 1 ms to minimize.
[2022-05-19 08:40:39] [INFO ] Deduced a trap composed of 4 places in 85 ms of which 0 ms to minimize.
[2022-05-19 08:40:39] [INFO ] Deduced a trap composed of 17 places in 75 ms of which 0 ms to minimize.
[2022-05-19 08:40:39] [INFO ] Deduced a trap composed of 23 places in 97 ms of which 1 ms to minimize.
[2022-05-19 08:40:39] [INFO ] Deduced a trap composed of 11 places in 76 ms of which 1 ms to minimize.
[2022-05-19 08:40:39] [INFO ] Trap strengthening (SAT) tested/added 21/20 trap constraints in 4026 ms
[2022-05-19 08:40:39] [INFO ] After 5339ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 89 ms.
[2022-05-19 08:40:39] [INFO ] After 5890ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 28 ms.
Support contains 3 out of 2500 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 2500/2500 places, 2401/2401 transitions.
Applied a total of 0 rules in 67 ms. Remains 2500 /2500 variables (removed 0) and now considering 2401/2401 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 2500/2500 places, 2401/2401 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 164 ms. (steps per millisecond=60 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 106 ms. (steps per millisecond=94 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 159046 steps, run timeout after 3001 ms. (steps per millisecond=52 ) properties seen :{}
Probabilistic random walk after 159046 steps, saw 157743 distinct states, run finished after 3001 ms. (steps per millisecond=52 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 2401 rows 2500 cols
[2022-05-19 08:40:43] [INFO ] Computed 900 place invariants in 23 ms
[2022-05-19 08:40:43] [INFO ] [Real]Absence check using 898 positive place invariants in 152 ms returned sat
[2022-05-19 08:40:43] [INFO ] [Real]Absence check using 898 positive and 2 generalized place invariants in 0 ms returned sat
[2022-05-19 08:40:44] [INFO ] After 1624ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-19 08:40:45] [INFO ] [Nat]Absence check using 898 positive place invariants in 152 ms returned sat
[2022-05-19 08:40:45] [INFO ] [Nat]Absence check using 898 positive and 2 generalized place invariants in 1 ms returned sat
[2022-05-19 08:40:46] [INFO ] After 1188ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-19 08:40:46] [INFO ] Deduced a trap composed of 5 places in 138 ms of which 1 ms to minimize.
[2022-05-19 08:40:47] [INFO ] Deduced a trap composed of 4 places in 194 ms of which 0 ms to minimize.
[2022-05-19 08:40:47] [INFO ] Deduced a trap composed of 8 places in 153 ms of which 1 ms to minimize.
[2022-05-19 08:40:47] [INFO ] Deduced a trap composed of 8 places in 134 ms of which 0 ms to minimize.
[2022-05-19 08:40:47] [INFO ] Deduced a trap composed of 9 places in 134 ms of which 1 ms to minimize.
[2022-05-19 08:40:47] [INFO ] Deduced a trap composed of 17 places in 137 ms of which 0 ms to minimize.
[2022-05-19 08:40:48] [INFO ] Deduced a trap composed of 18 places in 114 ms of which 0 ms to minimize.
[2022-05-19 08:40:48] [INFO ] Deduced a trap composed of 11 places in 106 ms of which 1 ms to minimize.
[2022-05-19 08:40:48] [INFO ] Deduced a trap composed of 17 places in 106 ms of which 0 ms to minimize.
[2022-05-19 08:40:48] [INFO ] Deduced a trap composed of 8 places in 100 ms of which 1 ms to minimize.
[2022-05-19 08:40:48] [INFO ] Deduced a trap composed of 17 places in 104 ms of which 1 ms to minimize.
[2022-05-19 08:40:49] [INFO ] Deduced a trap composed of 17 places in 117 ms of which 0 ms to minimize.
[2022-05-19 08:40:49] [INFO ] Deduced a trap composed of 24 places in 104 ms of which 1 ms to minimize.
[2022-05-19 08:40:49] [INFO ] Deduced a trap composed of 17 places in 89 ms of which 0 ms to minimize.
[2022-05-19 08:40:49] [INFO ] Deduced a trap composed of 11 places in 97 ms of which 1 ms to minimize.
[2022-05-19 08:40:49] [INFO ] Deduced a trap composed of 17 places in 98 ms of which 0 ms to minimize.
[2022-05-19 08:40:49] [INFO ] Deduced a trap composed of 4 places in 90 ms of which 1 ms to minimize.
[2022-05-19 08:40:50] [INFO ] Deduced a trap composed of 17 places in 84 ms of which 0 ms to minimize.
[2022-05-19 08:40:50] [INFO ] Deduced a trap composed of 23 places in 90 ms of which 1 ms to minimize.
[2022-05-19 08:40:50] [INFO ] Deduced a trap composed of 11 places in 80 ms of which 0 ms to minimize.
[2022-05-19 08:40:50] [INFO ] Trap strengthening (SAT) tested/added 21/20 trap constraints in 3970 ms
[2022-05-19 08:40:50] [INFO ] After 5229ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 89 ms.
[2022-05-19 08:40:50] [INFO ] After 5753ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 31 ms.
Support contains 3 out of 2500 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 2500/2500 places, 2401/2401 transitions.
Applied a total of 0 rules in 75 ms. Remains 2500 /2500 variables (removed 0) and now considering 2401/2401 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 2500/2500 places, 2401/2401 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 2500/2500 places, 2401/2401 transitions.
Applied a total of 0 rules in 79 ms. Remains 2500 /2500 variables (removed 0) and now considering 2401/2401 (removed 0) transitions.
// Phase 1: matrix 2401 rows 2500 cols
[2022-05-19 08:40:50] [INFO ] Computed 900 place invariants in 24 ms
[2022-05-19 08:40:52] [INFO ] Implicit Places using invariants in 1736 ms returned []
// Phase 1: matrix 2401 rows 2500 cols
[2022-05-19 08:40:52] [INFO ] Computed 900 place invariants in 19 ms
[2022-05-19 08:40:56] [INFO ] Implicit Places using invariants and state equation in 3820 ms returned []
Implicit Place search using SMT with State Equation took 5559 ms to find 0 implicit places.
[2022-05-19 08:40:56] [INFO ] Redundant transitions in 73 ms returned []
// Phase 1: matrix 2401 rows 2500 cols
[2022-05-19 08:40:56] [INFO ] Computed 900 place invariants in 23 ms
[2022-05-19 08:40:57] [INFO ] Dead Transitions using invariants and state equation in 1379 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 2500/2500 places, 2401/2401 transitions.
Applied a total of 0 rules in 68 ms. Remains 2500 /2500 variables (removed 0) and now considering 2401/2401 (removed 0) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 2401 rows 2500 cols
[2022-05-19 08:40:58] [INFO ] Computed 900 place invariants in 23 ms
[2022-05-19 08:40:58] [INFO ] [Real]Absence check using 898 positive place invariants in 154 ms returned sat
[2022-05-19 08:40:58] [INFO ] [Real]Absence check using 898 positive and 2 generalized place invariants in 0 ms returned sat
[2022-05-19 08:40:59] [INFO ] After 1587ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-19 08:40:59] [INFO ] [Nat]Absence check using 898 positive place invariants in 150 ms returned sat
[2022-05-19 08:40:59] [INFO ] [Nat]Absence check using 898 positive and 2 generalized place invariants in 0 ms returned sat
[2022-05-19 08:41:01] [INFO ] After 1149ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-19 08:41:01] [INFO ] Deduced a trap composed of 5 places in 117 ms of which 1 ms to minimize.
[2022-05-19 08:41:01] [INFO ] Deduced a trap composed of 4 places in 177 ms of which 1 ms to minimize.
[2022-05-19 08:41:01] [INFO ] Deduced a trap composed of 8 places in 153 ms of which 1 ms to minimize.
[2022-05-19 08:41:02] [INFO ] Deduced a trap composed of 8 places in 135 ms of which 0 ms to minimize.
[2022-05-19 08:41:02] [INFO ] Deduced a trap composed of 9 places in 135 ms of which 0 ms to minimize.
[2022-05-19 08:41:02] [INFO ] Deduced a trap composed of 17 places in 125 ms of which 1 ms to minimize.
[2022-05-19 08:41:02] [INFO ] Deduced a trap composed of 18 places in 114 ms of which 0 ms to minimize.
[2022-05-19 08:41:02] [INFO ] Deduced a trap composed of 11 places in 109 ms of which 1 ms to minimize.
[2022-05-19 08:41:03] [INFO ] Deduced a trap composed of 17 places in 106 ms of which 0 ms to minimize.
[2022-05-19 08:41:03] [INFO ] Deduced a trap composed of 8 places in 101 ms of which 1 ms to minimize.
[2022-05-19 08:41:03] [INFO ] Deduced a trap composed of 17 places in 118 ms of which 1 ms to minimize.
[2022-05-19 08:41:03] [INFO ] Deduced a trap composed of 17 places in 105 ms of which 0 ms to minimize.
[2022-05-19 08:41:03] [INFO ] Deduced a trap composed of 24 places in 103 ms of which 1 ms to minimize.
[2022-05-19 08:41:03] [INFO ] Deduced a trap composed of 17 places in 83 ms of which 0 ms to minimize.
[2022-05-19 08:41:04] [INFO ] Deduced a trap composed of 11 places in 88 ms of which 1 ms to minimize.
[2022-05-19 08:41:04] [INFO ] Deduced a trap composed of 17 places in 81 ms of which 0 ms to minimize.
[2022-05-19 08:41:04] [INFO ] Deduced a trap composed of 4 places in 82 ms of which 1 ms to minimize.
[2022-05-19 08:41:04] [INFO ] Deduced a trap composed of 17 places in 74 ms of which 1 ms to minimize.
[2022-05-19 08:41:04] [INFO ] Deduced a trap composed of 23 places in 87 ms of which 1 ms to minimize.
[2022-05-19 08:41:04] [INFO ] Deduced a trap composed of 11 places in 76 ms of which 0 ms to minimize.
[2022-05-19 08:41:05] [INFO ] Trap strengthening (SAT) tested/added 21/20 trap constraints in 3860 ms
[2022-05-19 08:41:05] [INFO ] After 5069ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 92 ms.
[2022-05-19 08:41:05] [INFO ] After 5603ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [(AND (NOT p2) (NOT p0) p1), (X (NOT p2)), (X (NOT p0)), (X (X (NOT p2))), (X (X (NOT p0))), (X (X p1)), (X (X (NOT (AND p2 p1)))), (X (X (NOT (AND p2 (NOT p1)))))]
False Knowledge obtained : [(F (AND p1 p2)), (F p2), (F (NOT p1)), (F p0)]
Knowledge based reduction with 8 factoid took 389 ms. Reduced automaton from 4 states, 11 edges and 3 AP to 4 states, 11 edges and 3 AP.
Stuttering acceptance computed with spot in 135 ms :[p2, p2, (AND (NOT p1) p2), (AND (NOT p1) p2)]
Stuttering acceptance computed with spot in 126 ms :[p2, p2, (AND (NOT p1) p2), (AND (NOT p1) p2)]
Stuttering acceptance computed with spot in 121 ms :[p2, p2, (AND (NOT p1) p2), (AND (NOT p1) p2)]
Product exploration explored 100000 steps with 8 reset in 1525 ms.
Product exploration explored 100000 steps with 8 reset in 1828 ms.
Built C files in :
/tmp/ltsmin15790273497263134501
[2022-05-19 08:41:09] [INFO ] Built C files in 32ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15790273497263134501
Running compilation step : cd /tmp/ltsmin15790273497263134501;'/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/ltsmin15790273497263134501;'/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/ltsmin15790273497263134501;'/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 4 out of 5302 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 5302/5302 places, 5202/5202 transitions.
Applied a total of 0 rules in 429 ms. Remains 5302 /5302 variables (removed 0) and now considering 5202/5202 (removed 0) transitions.
// Phase 1: matrix 5202 rows 5302 cols
[2022-05-19 08:41:12] [INFO ] Computed 901 place invariants in 16 ms
[2022-05-19 08:41:14] [INFO ] Implicit Places using invariants in 1605 ms returned []
// Phase 1: matrix 5202 rows 5302 cols
[2022-05-19 08:41:14] [INFO ] Computed 901 place invariants in 17 ms
[2022-05-19 08:41:16] [INFO ] Implicit Places using invariants and state equation in 1720 ms returned []
Implicit Place search using SMT with State Equation took 3328 ms to find 0 implicit places.
// Phase 1: matrix 5202 rows 5302 cols
[2022-05-19 08:41:16] [INFO ] Computed 901 place invariants in 16 ms
[2022-05-19 08:41:19] [INFO ] Dead Transitions using invariants and state equation in 3420 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 5302/5302 places, 5202/5202 transitions.
Built C files in :
/tmp/ltsmin17797268252579057806
[2022-05-19 08:41:19] [INFO ] Built C files in 38ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17797268252579057806
Running compilation step : cd /tmp/ltsmin17797268252579057806;'/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/ltsmin17797268252579057806;'/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/ltsmin17797268252579057806;'/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-19 08:41:23] [INFO ] Flatten gal took : 155 ms
[2022-05-19 08:41:23] [INFO ] Flatten gal took : 170 ms
[2022-05-19 08:41:23] [INFO ] Time to serialize gal into /tmp/LTL12316598527099469543.gal : 15 ms
[2022-05-19 08:41:23] [INFO ] Time to serialize properties into /tmp/LTL5347515657312786486.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/LTL12316598527099469543.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL5347515657312786486.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/LTL1231659...267
Read 1 LTL properties
Checking formula 0 : !((F(G((X(((G("(p428!=1)"))||("(p428==1)"))||("(p127==1)")))U(!("((p2002==1)&&(p2027==1))"))))))
Formula 0 simplified : !FG(X("(p127==1)" | "(p428==1)" | G"(p428!=1)") U !"((p2002==1)&&(p2027==1))")
Detected timeout of ITS tools.
[2022-05-19 08:41:38] [INFO ] Flatten gal took : 146 ms
[2022-05-19 08:41:38] [INFO ] Applying decomposition
[2022-05-19 08:41:38] [INFO ] Flatten gal took : 150 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/graph9434323518587367067.txt' '-o' '/tmp/graph9434323518587367067.bin' '-w' '/tmp/graph9434323518587367067.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph9434323518587367067.bin' '-l' '-1' '-v' '-w' '/tmp/graph9434323518587367067.weights' '-q' '0' '-e' '0.001'
[2022-05-19 08:41:38] [INFO ] Decomposing Gal with order
[2022-05-19 08:41:39] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-19 08:41:40] [INFO ] Removed a total of 2300 redundant transitions.
[2022-05-19 08:41:40] [INFO ] Flatten gal took : 241 ms
[2022-05-19 08:41:40] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 16 ms.
[2022-05-19 08:41:40] [INFO ] Time to serialize gal into /tmp/LTL9354075925991449611.gal : 37 ms
[2022-05-19 08:41:40] [INFO ] Time to serialize properties into /tmp/LTL17505813212254598726.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/LTL9354075925991449611.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL17505813212254598726.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/LTL9354075...246
Read 1 LTL properties
Checking formula 0 : !((F(G((X(((G("(i3.i0.i5.u155.p428!=1)"))||("(i3.i0.i5.u155.p428==1)"))||("(i0.u56.p127==1)")))U(!("((i19.i0.i2.u681.p2002==1)&&(i19.i...182
Formula 0 simplified : !FG(X("(i0.u56.p127==1)" | "(i3.i0.i5.u155.p428==1)" | G"(i3.i0.i5.u155.p428!=1)") U !"((i19.i0.i2.u681.p2002==1)&&(i19.i0.i1.u689.p...166
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin2438302548190442701
[2022-05-19 08:41:55] [INFO ] Built C files in 37ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2438302548190442701
Running compilation step : cd /tmp/ltsmin2438302548190442701;'/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/ltsmin2438302548190442701;'/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/ltsmin2438302548190442701;'/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)
Treatment of property ShieldIIPs-PT-100B-LTLFireability-15 finished in 211852 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(X(X(F((X(X(p0))||X(X((F(p1)||p0)))))))))'
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F((!(G(F(p0)) U G(X(p1)))||p2)))'
Found a CL insensitive property : ShieldIIPs-PT-100B-LTLFireability-09
Stuttering acceptance computed with spot in 191 ms :[(AND p1 (NOT p2)), (AND p1 (NOT p2)), (AND (NOT p2) p1 p0), (AND (NOT p2) p1), (AND (NOT p2) p1 p0)]
Support contains 7 out of 5308 places. Attempting structural reductions.
Starting structural reductions in SLCL_LTL mode, iteration 0 : 5308/5308 places, 5208/5208 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 499 transitions
Trivial Post-agglo rules discarded 499 transitions
Performed 499 trivial Post agglomeration. Transition count delta: 499
Iterating post reduction 0 with 499 rules applied. Total rules applied 499 place count 5307 transition count 4708
Reduce places removed 499 places and 0 transitions.
Iterating post reduction 1 with 499 rules applied. Total rules applied 998 place count 4808 transition count 4708
Performed 501 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 501 Pre rules applied. Total rules applied 998 place count 4808 transition count 4207
Deduced a syphon composed of 501 places in 19 ms
Reduce places removed 501 places and 0 transitions.
Iterating global reduction 2 with 1002 rules applied. Total rules applied 2000 place count 4307 transition count 4207
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 2005 place count 4302 transition count 4202
Iterating global reduction 2 with 5 rules applied. Total rules applied 2010 place count 4302 transition count 4202
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 2010 place count 4302 transition count 4200
Deduced a syphon composed of 2 places in 19 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 2014 place count 4300 transition count 4200
Performed 1795 Post agglomeration using F-continuation condition.Transition count delta: 1795
Deduced a syphon composed of 1795 places in 12 ms
Reduce places removed 1795 places and 0 transitions.
Iterating global reduction 2 with 3590 rules applied. Total rules applied 5604 place count 2505 transition count 2405
Renaming transitions due to excessive name length > 1024 char.
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 5606 place count 2503 transition count 2403
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 5607 place count 2502 transition count 2403
Applied a total of 5607 rules in 1211 ms. Remains 2502 /5308 variables (removed 2806) and now considering 2403/5208 (removed 2805) transitions.
// Phase 1: matrix 2403 rows 2502 cols
[2022-05-19 08:42:00] [INFO ] Computed 900 place invariants in 8 ms
[2022-05-19 08:42:01] [INFO ] Implicit Places using invariants in 1454 ms returned []
// Phase 1: matrix 2403 rows 2502 cols
[2022-05-19 08:42:01] [INFO ] Computed 900 place invariants in 4 ms
[2022-05-19 08:42:04] [INFO ] Implicit Places using invariants and state equation in 3118 ms returned []
Implicit Place search using SMT with State Equation took 4573 ms to find 0 implicit places.
// Phase 1: matrix 2403 rows 2502 cols
[2022-05-19 08:42:04] [INFO ] Computed 900 place invariants in 3 ms
[2022-05-19 08:42:05] [INFO ] Dead Transitions using invariants and state equation in 1344 ms found 0 transitions.
Starting structural reductions in SLCL_LTL mode, iteration 1 : 2502/5308 places, 2403/5208 transitions.
Finished structural reductions, in 1 iterations. Remains : 2502/5308 places, 2403/5208 transitions.
Running random walk in product with property : ShieldIIPs-PT-100B-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=(NOT p2), acceptance={} source=0 dest: 1}], [{ cond=(NOT p2), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p2) p1), acceptance={} source=1 dest: 3}], [{ cond=(NOT p2), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p2) p0 p1), acceptance={} source=2 dest: 4}], [{ cond=(AND (NOT p2) p1), acceptance={0} source=3 dest: 3}], [{ cond=(AND (NOT p2) (NOT p0) p1), acceptance={} source=4 dest: 4}, { cond=(AND (NOT p2) p0 p1), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p2:(EQ s2151 1), p1:(AND (EQ s1860 1) (EQ s1865 1) (EQ s1877 1)), p0:(AND (EQ s2464 1) (EQ s2475 1) (EQ s2478 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, cl-invariant], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 26 reset in 1541 ms.
Product exploration explored 100000 steps with 23 reset in 1898 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 : [(AND (NOT p2) (NOT p1) (NOT p0)), (X (NOT p2)), (X (NOT (AND (NOT p2) p1))), (X (X (NOT p2))), (X (X (NOT (AND (NOT p2) p0 p1)))), (X (X (NOT (AND (NOT p2) p1))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 6 factoid took 247 ms. Reduced automaton from 5 states, 8 edges and 3 AP to 3 states, 5 edges and 3 AP.
Stuttering acceptance computed with spot in 94 ms :[(AND (NOT p2) p0 p1), (AND (NOT p2) p0 p1), (AND (NOT p2) p0 p1)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 169 ms. (steps per millisecond=59 ) properties (out of 3) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 107 ms. (steps per millisecond=93 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 2403 rows 2502 cols
[2022-05-19 08:42:10] [INFO ] Computed 900 place invariants in 9 ms
[2022-05-19 08:42:10] [INFO ] [Real]Absence check using 900 positive place invariants in 168 ms returned sat
[2022-05-19 08:42:11] [INFO ] After 1713ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-19 08:42:12] [INFO ] [Nat]Absence check using 900 positive place invariants in 158 ms returned sat
[2022-05-19 08:42:13] [INFO ] After 1190ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-19 08:42:13] [INFO ] After 1343ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 83 ms.
[2022-05-19 08:42:13] [INFO ] After 1868ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 38 ms.
Support contains 7 out of 2502 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 2502/2502 places, 2403/2403 transitions.
Partial Free-agglomeration rule applied 596 times.
Drop transitions removed 596 transitions
Iterating global reduction 0 with 596 rules applied. Total rules applied 596 place count 2502 transition count 2403
Applied a total of 596 rules in 143 ms. Remains 2502 /2502 variables (removed 0) and now considering 2403/2403 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 2502/2502 places, 2403/2403 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 200 ms. (steps per millisecond=50 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 109 ms. (steps per millisecond=91 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 162281 steps, run timeout after 3003 ms. (steps per millisecond=54 ) properties seen :{}
Probabilistic random walk after 162281 steps, saw 160592 distinct states, run finished after 3005 ms. (steps per millisecond=54 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 2403 rows 2502 cols
[2022-05-19 08:42:17] [INFO ] Computed 900 place invariants in 17 ms
[2022-05-19 08:42:17] [INFO ] [Real]Absence check using 900 positive place invariants in 153 ms returned sat
[2022-05-19 08:42:18] [INFO ] After 1574ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-19 08:42:19] [INFO ] [Nat]Absence check using 900 positive place invariants in 158 ms returned sat
[2022-05-19 08:42:20] [INFO ] After 1161ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-19 08:42:20] [INFO ] Deduced a trap composed of 14 places in 73 ms of which 0 ms to minimize.
[2022-05-19 08:42:20] [INFO ] Deduced a trap composed of 8 places in 63 ms of which 0 ms to minimize.
[2022-05-19 08:42:20] [INFO ] Deduced a trap composed of 9 places in 55 ms of which 0 ms to minimize.
[2022-05-19 08:42:20] [INFO ] Deduced a trap composed of 17 places in 61 ms of which 0 ms to minimize.
[2022-05-19 08:42:21] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 648 ms
[2022-05-19 08:42:21] [INFO ] After 1875ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 86 ms.
[2022-05-19 08:42:21] [INFO ] After 2401ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 25 ms.
Support contains 7 out of 2502 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 2502/2502 places, 2403/2403 transitions.
Applied a total of 0 rules in 70 ms. Remains 2502 /2502 variables (removed 0) and now considering 2403/2403 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 2502/2502 places, 2403/2403 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 2502/2502 places, 2403/2403 transitions.
Applied a total of 0 rules in 70 ms. Remains 2502 /2502 variables (removed 0) and now considering 2403/2403 (removed 0) transitions.
// Phase 1: matrix 2403 rows 2502 cols
[2022-05-19 08:42:21] [INFO ] Computed 900 place invariants in 23 ms
[2022-05-19 08:42:23] [INFO ] Implicit Places using invariants in 1688 ms returned []
// Phase 1: matrix 2403 rows 2502 cols
[2022-05-19 08:42:23] [INFO ] Computed 900 place invariants in 17 ms
[2022-05-19 08:42:27] [INFO ] Implicit Places using invariants and state equation in 3989 ms returned []
Implicit Place search using SMT with State Equation took 5681 ms to find 0 implicit places.
[2022-05-19 08:42:27] [INFO ] Redundant transitions in 75 ms returned []
// Phase 1: matrix 2403 rows 2502 cols
[2022-05-19 08:42:27] [INFO ] Computed 900 place invariants in 23 ms
[2022-05-19 08:42:28] [INFO ] Dead Transitions using invariants and state equation in 1560 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 2502/2502 places, 2403/2403 transitions.
Applied a total of 0 rules in 71 ms. Remains 2502 /2502 variables (removed 0) and now considering 2403/2403 (removed 0) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 2403 rows 2502 cols
[2022-05-19 08:42:28] [INFO ] Computed 900 place invariants in 26 ms
[2022-05-19 08:42:29] [INFO ] [Real]Absence check using 900 positive place invariants in 154 ms returned sat
[2022-05-19 08:42:30] [INFO ] After 1595ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-19 08:42:30] [INFO ] [Nat]Absence check using 900 positive place invariants in 156 ms returned sat
[2022-05-19 08:42:31] [INFO ] After 1173ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-19 08:42:32] [INFO ] Deduced a trap composed of 14 places in 72 ms of which 0 ms to minimize.
[2022-05-19 08:42:32] [INFO ] Deduced a trap composed of 8 places in 65 ms of which 1 ms to minimize.
[2022-05-19 08:42:32] [INFO ] Deduced a trap composed of 9 places in 51 ms of which 0 ms to minimize.
[2022-05-19 08:42:32] [INFO ] Deduced a trap composed of 17 places in 51 ms of which 0 ms to minimize.
[2022-05-19 08:42:32] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 631 ms
[2022-05-19 08:42:32] [INFO ] After 1870ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 81 ms.
[2022-05-19 08:42:32] [INFO ] After 2392ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [(AND (NOT p2) (NOT p1) (NOT p0)), (X (NOT p2)), (X (NOT (AND (NOT p2) p1))), (X (X (NOT p2))), (X (X (NOT (AND (NOT p2) p0 p1)))), (X (X (NOT (AND (NOT p2) p1))))]
False Knowledge obtained : [(F p2), (F (AND (NOT p0) p1 (NOT p2)))]
Knowledge based reduction with 6 factoid took 256 ms. Reduced automaton from 3 states, 5 edges and 3 AP to 3 states, 5 edges and 3 AP.
Stuttering acceptance computed with spot in 82 ms :[(AND (NOT p2) p0 p1), (AND (NOT p2) p0 p1), (AND (NOT p2) p0 p1)]
Stuttering acceptance computed with spot in 118 ms :[(AND (NOT p2) p0 p1), (AND (NOT p2) p0 p1), (AND (NOT p2) p0 p1)]
Support contains 7 out of 2502 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2502/2502 places, 2403/2403 transitions.
Applied a total of 0 rules in 69 ms. Remains 2502 /2502 variables (removed 0) and now considering 2403/2403 (removed 0) transitions.
// Phase 1: matrix 2403 rows 2502 cols
[2022-05-19 08:42:33] [INFO ] Computed 900 place invariants in 9 ms
[2022-05-19 08:42:34] [INFO ] Implicit Places using invariants in 1383 ms returned []
// Phase 1: matrix 2403 rows 2502 cols
[2022-05-19 08:42:34] [INFO ] Computed 900 place invariants in 10 ms
[2022-05-19 08:42:37] [INFO ] Implicit Places using invariants and state equation in 3292 ms returned []
Implicit Place search using SMT with State Equation took 4678 ms to find 0 implicit places.
// Phase 1: matrix 2403 rows 2502 cols
[2022-05-19 08:42:37] [INFO ] Computed 900 place invariants in 3 ms
[2022-05-19 08:42:39] [INFO ] Dead Transitions using invariants and state equation in 1454 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 2502/2502 places, 2403/2403 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 : [(AND (NOT p2) (NOT p0) (NOT p1)), (X (NOT p2)), (X (NOT (AND p0 p1 (NOT p2)))), (X (X (NOT p2))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X (NOT (AND p0 p1 (NOT p2)))))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 213 ms. Reduced automaton from 3 states, 5 edges and 3 AP to 3 states, 5 edges and 3 AP.
Stuttering acceptance computed with spot in 106 ms :[(AND (NOT p2) p0 p1), (AND (NOT p2) p0 p1), (AND (NOT p2) p0 p1)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 275 ms. (steps per millisecond=36 ) properties (out of 3) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 112 ms. (steps per millisecond=89 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 114 ms. (steps per millisecond=87 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 2403 rows 2502 cols
[2022-05-19 08:42:40] [INFO ] Computed 900 place invariants in 10 ms
[2022-05-19 08:42:40] [INFO ] [Real]Absence check using 900 positive place invariants in 153 ms returned sat
[2022-05-19 08:42:41] [INFO ] After 1633ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2022-05-19 08:42:42] [INFO ] [Nat]Absence check using 900 positive place invariants in 155 ms returned sat
[2022-05-19 08:42:43] [INFO ] After 1275ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2022-05-19 08:42:43] [INFO ] Deduced a trap composed of 17 places in 53 ms of which 0 ms to minimize.
[2022-05-19 08:42:44] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 220 ms
[2022-05-19 08:42:44] [INFO ] Deduced a trap composed of 9 places in 49 ms of which 1 ms to minimize.
[2022-05-19 08:42:44] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 214 ms
[2022-05-19 08:42:44] [INFO ] After 1841ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 171 ms.
[2022-05-19 08:42:44] [INFO ] After 2557ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 1 properties in 102 ms.
Support contains 7 out of 2502 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 2502/2502 places, 2403/2403 transitions.
Partial Free-agglomeration rule applied 596 times.
Drop transitions removed 596 transitions
Iterating global reduction 0 with 596 rules applied. Total rules applied 596 place count 2502 transition count 2403
Applied a total of 596 rules in 152 ms. Remains 2502 /2502 variables (removed 0) and now considering 2403/2403 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 2502/2502 places, 2403/2403 transitions.
Finished random walk after 8183 steps, including 2 resets, run visited all 1 properties in 158 ms. (steps per millisecond=51 )
Knowledge obtained : [(AND (NOT p2) (NOT p0) (NOT p1)), (X (NOT p2)), (X (NOT (AND p0 p1 (NOT p2)))), (X (X (NOT p2))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X (NOT (AND p0 p1 (NOT p2)))))]
False Knowledge obtained : [(F p2), (F (AND (NOT p0) p1 (NOT p2))), (F (AND p0 p1 (NOT p2)))]
Knowledge based reduction with 6 factoid took 301 ms. Reduced automaton from 3 states, 5 edges and 3 AP to 3 states, 5 edges and 3 AP.
Stuttering acceptance computed with spot in 104 ms :[(AND (NOT p2) p0 p1), (AND (NOT p2) p0 p1), (AND (NOT p2) p0 p1)]
Stuttering acceptance computed with spot in 111 ms :[(AND (NOT p2) p0 p1), (AND (NOT p2) p0 p1), (AND (NOT p2) p0 p1)]
Stuttering acceptance computed with spot in 108 ms :[(AND (NOT p2) p0 p1), (AND (NOT p2) p0 p1), (AND (NOT p2) p0 p1)]
Product exploration explored 100000 steps with 26 reset in 1723 ms.
Product exploration explored 100000 steps with 25 reset in 1926 ms.
Applying partial POR strategy [false, true, true]
Stuttering acceptance computed with spot in 130 ms :[(AND (NOT p2) p0 p1), (AND (NOT p2) p0 p1), (AND (NOT p2) p0 p1)]
Support contains 7 out of 2502 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2502/2502 places, 2403/2403 transitions.
Applied a total of 0 rules in 81 ms. Remains 2502 /2502 variables (removed 0) and now considering 2403/2403 (removed 0) transitions.
[2022-05-19 08:42:49] [INFO ] Redundant transitions in 264 ms returned [2402]
Found 1 redundant transitions using SMT.
Drop transitions removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
// Phase 1: matrix 2402 rows 2502 cols
[2022-05-19 08:42:49] [INFO ] Computed 900 place invariants in 5 ms
[2022-05-19 08:42:51] [INFO ] Dead Transitions using invariants and state equation in 1474 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 2502/2502 places, 2402/2403 transitions.
Applied a total of 0 rules in 75 ms. Remains 2502 /2502 variables (removed 0) and now considering 2402/2402 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 2502/2502 places, 2402/2403 transitions.
Product exploration explored 100000 steps with 26 reset in 1543 ms.
Product exploration explored 100000 steps with 23 reset in 1924 ms.
Built C files in :
/tmp/ltsmin10475644943797576041
[2022-05-19 08:42:54] [INFO ] Built C files in 18ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10475644943797576041
Running compilation step : cd /tmp/ltsmin10475644943797576041;'/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/ltsmin10475644943797576041;'/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/ltsmin10475644943797576041;'/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 7 out of 2502 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2502/2502 places, 2403/2403 transitions.
Applied a total of 0 rules in 71 ms. Remains 2502 /2502 variables (removed 0) and now considering 2403/2403 (removed 0) transitions.
// Phase 1: matrix 2403 rows 2502 cols
[2022-05-19 08:42:57] [INFO ] Computed 900 place invariants in 9 ms
[2022-05-19 08:42:59] [INFO ] Implicit Places using invariants in 1370 ms returned []
// Phase 1: matrix 2403 rows 2502 cols
[2022-05-19 08:42:59] [INFO ] Computed 900 place invariants in 4 ms
[2022-05-19 08:43:02] [INFO ] Implicit Places using invariants and state equation in 3225 ms returned []
Implicit Place search using SMT with State Equation took 4598 ms to find 0 implicit places.
// Phase 1: matrix 2403 rows 2502 cols
[2022-05-19 08:43:02] [INFO ] Computed 900 place invariants in 11 ms
[2022-05-19 08:43:04] [INFO ] Dead Transitions using invariants and state equation in 1453 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 2502/2502 places, 2403/2403 transitions.
Built C files in :
/tmp/ltsmin7195306079507410023
[2022-05-19 08:43:04] [INFO ] Built C files in 15ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7195306079507410023
Running compilation step : cd /tmp/ltsmin7195306079507410023;'/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/ltsmin7195306079507410023;'/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/ltsmin7195306079507410023;'/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-19 08:43:07] [INFO ] Flatten gal took : 95 ms
[2022-05-19 08:43:07] [INFO ] Flatten gal took : 97 ms
[2022-05-19 08:43:07] [INFO ] Time to serialize gal into /tmp/LTL8973854152421596509.gal : 8 ms
[2022-05-19 08:43:07] [INFO ] Time to serialize properties into /tmp/LTL10351172241059278039.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/LTL8973854152421596509.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL10351172241059278039.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/LTL8973854...267
Read 1 LTL properties
Checking formula 0 : !((F((!((G(F("(((p5908==1)&&(p5930==1))&&(p5938==1))")))U(G(X("(((p4489==1)&&(p4497==1))&&(p4525==1))")))))||("(p5170==1)"))))
Formula 0 simplified : !F("(p5170==1)" | !(GF"(((p5908==1)&&(p5930==1))&&(p5938==1))" U GX"(((p4489==1)&&(p4497==1))&&(p4525==1))"))
Detected timeout of ITS tools.
[2022-05-19 08:43:22] [INFO ] Flatten gal took : 86 ms
[2022-05-19 08:43:22] [INFO ] Applying decomposition
[2022-05-19 08:43:22] [INFO ] Flatten gal took : 86 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/graph12198759847507780118.txt' '-o' '/tmp/graph12198759847507780118.bin' '-w' '/tmp/graph12198759847507780118.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph12198759847507780118.bin' '-l' '-1' '-v' '-w' '/tmp/graph12198759847507780118.weights' '-q' '0' '-e' '0.001'
[2022-05-19 08:43:22] [INFO ] Decomposing Gal with order
[2022-05-19 08:43:22] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-19 08:43:23] [INFO ] Removed a total of 1602 redundant transitions.
[2022-05-19 08:43:23] [INFO ] Flatten gal took : 127 ms
[2022-05-19 08:43:23] [INFO ] Fuse similar labels procedure discarded/fused a total of 1532 labels/synchronizations in 22 ms.
[2022-05-19 08:43:23] [INFO ] Time to serialize gal into /tmp/LTL18142981675100197588.gal : 12 ms
[2022-05-19 08:43:23] [INFO ] Time to serialize properties into /tmp/LTL18230984193988363084.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/LTL18142981675100197588.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL18230984193988363084.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/LTL1814298...247
Read 1 LTL properties
Checking formula 0 : !((F((!((G(F("(((i42.i1.i0.u888.p5908==1)&&(i42.i1.i0.u892.p5930==1))&&(i42.i1.i1.u893.p5938==1))")))U(G(X("(((i31.i2.i2.u670.p4489==1...252
Formula 0 simplified : !F("(i36.i1.i1.u775.p5170==1)" | !(GF"(((i42.i1.i0.u888.p5908==1)&&(i42.i1.i0.u892.p5930==1))&&(i42.i1.i1.u893.p5938==1))" U GX"(((i...237
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin983683610807781506
[2022-05-19 08:43:38] [INFO ] Built C files in 22ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin983683610807781506
Running compilation step : cd /tmp/ltsmin983683610807781506;'/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/ltsmin983683610807781506;'/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/ltsmin983683610807781506;'/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)
Treatment of property ShieldIIPs-PT-100B-LTLFireability-09 finished in 102658 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((G(X(p0))&&F(p1)))'
Found a SL insensitive property : ShieldIIPs-PT-100B-LTLFireability-10
Stuttering acceptance computed with spot in 101 ms :[(NOT p0), true, (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1))]
Support contains 4 out of 5308 places. Attempting structural reductions.
Starting structural reductions in SLCL_LTL mode, iteration 0 : 5308/5308 places, 5208/5208 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 501 transitions
Trivial Post-agglo rules discarded 501 transitions
Performed 501 trivial Post agglomeration. Transition count delta: 501
Iterating post reduction 0 with 501 rules applied. Total rules applied 501 place count 5307 transition count 4706
Reduce places removed 501 places and 0 transitions.
Iterating post reduction 1 with 501 rules applied. Total rules applied 1002 place count 4806 transition count 4706
Performed 501 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 501 Pre rules applied. Total rules applied 1002 place count 4806 transition count 4205
Deduced a syphon composed of 501 places in 22 ms
Reduce places removed 501 places and 0 transitions.
Iterating global reduction 2 with 1002 rules applied. Total rules applied 2004 place count 4305 transition count 4205
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 2010 place count 4299 transition count 4199
Iterating global reduction 2 with 6 rules applied. Total rules applied 2016 place count 4299 transition count 4199
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 2016 place count 4299 transition count 4197
Deduced a syphon composed of 2 places in 20 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 2020 place count 4297 transition count 4197
Performed 1789 Post agglomeration using F-continuation condition.Transition count delta: 1789
Deduced a syphon composed of 1789 places in 12 ms
Reduce places removed 1789 places and 0 transitions.
Iterating global reduction 2 with 3578 rules applied. Total rules applied 5598 place count 2508 transition count 2408
Renaming transitions due to excessive name length > 1024 char.
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 5600 place count 2506 transition count 2406
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 5601 place count 2505 transition count 2406
Applied a total of 5601 rules in 1309 ms. Remains 2505 /5308 variables (removed 2803) and now considering 2406/5208 (removed 2802) transitions.
// Phase 1: matrix 2406 rows 2505 cols
[2022-05-19 08:43:42] [INFO ] Computed 900 place invariants in 7 ms
[2022-05-19 08:43:43] [INFO ] Implicit Places using invariants in 1278 ms returned []
// Phase 1: matrix 2406 rows 2505 cols
[2022-05-19 08:43:44] [INFO ] Computed 900 place invariants in 4 ms
[2022-05-19 08:43:47] [INFO ] Implicit Places using invariants and state equation in 3216 ms returned []
Implicit Place search using SMT with State Equation took 4495 ms to find 0 implicit places.
// Phase 1: matrix 2406 rows 2505 cols
[2022-05-19 08:43:47] [INFO ] Computed 900 place invariants in 8 ms
[2022-05-19 08:43:48] [INFO ] Dead Transitions using invariants and state equation in 1427 ms found 0 transitions.
Starting structural reductions in SLCL_LTL mode, iteration 1 : 2505/5308 places, 2406/5208 transitions.
Finished structural reductions, in 1 iterations. Remains : 2505/5308 places, 2406/5208 transitions.
Running random walk in product with property : ShieldIIPs-PT-100B-LTLFireability-10 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 s1605 0) (EQ s503 0) (EQ s2257 0)), p1:(EQ s881 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, sl-invariant], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 19 reset in 1561 ms.
Product exploration explored 100000 steps with 19 reset in 1929 ms.
Computed a total of 4 stabilizing places and 4 stable transitions
Computed a total of 4 stabilizing places and 4 stable transitions
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT (AND p1 p0))), (X (AND (NOT p1) p0)), (X p0), true, (X (X (NOT (AND p1 p0)))), (X (X (AND (NOT p1) p0))), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 8 factoid took 220 ms. Reduced automaton from 4 states, 8 edges and 2 AP to 4 states, 7 edges and 2 AP.
Stuttering acceptance computed with spot in 108 ms :[(NOT p0), (OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0)), true]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 186 ms. (steps per millisecond=53 ) properties (out of 3) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 111 ms. (steps per millisecond=90 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 2406 rows 2505 cols
[2022-05-19 08:43:52] [INFO ] Computed 900 place invariants in 10 ms
[2022-05-19 08:43:53] [INFO ] After 234ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-19 08:43:53] [INFO ] [Nat]Absence check using 900 positive place invariants in 151 ms returned sat
[2022-05-19 08:43:54] [INFO ] After 1405ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-19 08:43:55] [INFO ] Deduced a trap composed of 3 places in 65 ms of which 0 ms to minimize.
[2022-05-19 08:43:55] [INFO ] Deduced a trap composed of 7 places in 71 ms of which 1 ms to minimize.
[2022-05-19 08:43:55] [INFO ] Deduced a trap composed of 8 places in 63 ms of which 0 ms to minimize.
[2022-05-19 08:43:55] [INFO ] Deduced a trap composed of 5 places in 51 ms of which 0 ms to minimize.
[2022-05-19 08:43:55] [INFO ] Deduced a trap composed of 7 places in 47 ms of which 0 ms to minimize.
[2022-05-19 08:43:55] [INFO ] Deduced a trap composed of 8 places in 44 ms of which 0 ms to minimize.
[2022-05-19 08:43:55] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 916 ms
[2022-05-19 08:43:55] [INFO ] After 2380ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 87 ms.
[2022-05-19 08:43:55] [INFO ] After 2902ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 55 ms.
Support contains 3 out of 2505 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 2505/2505 places, 2406/2406 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 12 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 2504 transition count 2405
Partial Free-agglomeration rule applied 600 times.
Drop transitions removed 600 transitions
Iterating global reduction 0 with 600 rules applied. Total rules applied 602 place count 2504 transition count 2405
Applied a total of 602 rules in 216 ms. Remains 2504 /2505 variables (removed 1) and now considering 2405/2406 (removed 1) transitions.
Finished structural reductions, in 1 iterations. Remains : 2504/2505 places, 2405/2406 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 186 ms. (steps per millisecond=53 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 121 ms. (steps per millisecond=82 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 156854 steps, run timeout after 3003 ms. (steps per millisecond=52 ) properties seen :{}
Probabilistic random walk after 156854 steps, saw 155025 distinct states, run finished after 3004 ms. (steps per millisecond=52 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 2405 rows 2504 cols
[2022-05-19 08:43:59] [INFO ] Computed 900 place invariants in 24 ms
[2022-05-19 08:43:59] [INFO ] After 251ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-19 08:44:00] [INFO ] [Nat]Absence check using 900 positive place invariants in 152 ms returned sat
[2022-05-19 08:44:01] [INFO ] After 1165ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-19 08:44:01] [INFO ] Deduced a trap composed of 5 places in 78 ms of which 0 ms to minimize.
[2022-05-19 08:44:01] [INFO ] Deduced a trap composed of 18 places in 86 ms of which 0 ms to minimize.
[2022-05-19 08:44:01] [INFO ] Deduced a trap composed of 8 places in 65 ms of which 0 ms to minimize.
[2022-05-19 08:44:01] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 540 ms
[2022-05-19 08:44:02] [INFO ] After 1766ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 84 ms.
[2022-05-19 08:44:02] [INFO ] After 2278ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 31 ms.
Support contains 3 out of 2504 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 2504/2504 places, 2405/2405 transitions.
Applied a total of 0 rules in 73 ms. Remains 2504 /2504 variables (removed 0) and now considering 2405/2405 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 2504/2504 places, 2405/2405 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 2504/2504 places, 2405/2405 transitions.
Applied a total of 0 rules in 96 ms. Remains 2504 /2504 variables (removed 0) and now considering 2405/2405 (removed 0) transitions.
// Phase 1: matrix 2405 rows 2504 cols
[2022-05-19 08:44:02] [INFO ] Computed 900 place invariants in 24 ms
[2022-05-19 08:44:04] [INFO ] Implicit Places using invariants in 1702 ms returned []
// Phase 1: matrix 2405 rows 2504 cols
[2022-05-19 08:44:04] [INFO ] Computed 900 place invariants in 17 ms
[2022-05-19 08:44:07] [INFO ] Implicit Places using invariants and state equation in 3815 ms returned []
Implicit Place search using SMT with State Equation took 5517 ms to find 0 implicit places.
[2022-05-19 08:44:07] [INFO ] Redundant transitions in 71 ms returned []
// Phase 1: matrix 2405 rows 2504 cols
[2022-05-19 08:44:07] [INFO ] Computed 900 place invariants in 24 ms
[2022-05-19 08:44:09] [INFO ] Dead Transitions using invariants and state equation in 1429 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 2504/2504 places, 2405/2405 transitions.
Applied a total of 0 rules in 71 ms. Remains 2504 /2504 variables (removed 0) and now considering 2405/2405 (removed 0) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 2405 rows 2504 cols
[2022-05-19 08:44:09] [INFO ] Computed 900 place invariants in 24 ms
[2022-05-19 08:44:09] [INFO ] After 249ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-19 08:44:10] [INFO ] [Nat]Absence check using 900 positive place invariants in 154 ms returned sat
[2022-05-19 08:44:11] [INFO ] After 1178ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-19 08:44:11] [INFO ] Deduced a trap composed of 5 places in 85 ms of which 1 ms to minimize.
[2022-05-19 08:44:11] [INFO ] Deduced a trap composed of 18 places in 84 ms of which 1 ms to minimize.
[2022-05-19 08:44:11] [INFO ] Deduced a trap composed of 8 places in 68 ms of which 0 ms to minimize.
[2022-05-19 08:44:11] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 557 ms
[2022-05-19 08:44:11] [INFO ] After 1797ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 82 ms.
[2022-05-19 08:44:12] [INFO ] After 2313ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT (AND p1 p0))), (X (AND (NOT p1) p0)), (X p0), true, (X (X (NOT (AND p1 p0)))), (X (X (AND (NOT p1) p0))), (X (X p0))]
False Knowledge obtained : [(F (NOT (AND (NOT p1) p0))), (F (AND p1 p0))]
Knowledge based reduction with 8 factoid took 327 ms. Reduced automaton from 4 states, 7 edges and 2 AP to 4 states, 7 edges and 2 AP.
Stuttering acceptance computed with spot in 106 ms :[(NOT p0), (OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0)), true]
Stuttering acceptance computed with spot in 110 ms :[(NOT p0), (OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0)), true]
// Phase 1: matrix 2406 rows 2505 cols
[2022-05-19 08:44:12] [INFO ] Computed 900 place invariants in 8 ms
[2022-05-19 08:44:16] [INFO ] [Real]Absence check using 900 positive place invariants in 933 ms returned sat
[2022-05-19 08:44:16] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-19 08:44:27] [INFO ] [Real]Absence check using state equation in 11579 ms returned unknown
Could not prove EG (NOT p1)
Support contains 4 out of 2505 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2505/2505 places, 2406/2406 transitions.
Applied a total of 0 rules in 60 ms. Remains 2505 /2505 variables (removed 0) and now considering 2406/2406 (removed 0) transitions.
// Phase 1: matrix 2406 rows 2505 cols
[2022-05-19 08:44:27] [INFO ] Computed 900 place invariants in 10 ms
[2022-05-19 08:44:28] [INFO ] Implicit Places using invariants in 1287 ms returned []
// Phase 1: matrix 2406 rows 2505 cols
[2022-05-19 08:44:28] [INFO ] Computed 900 place invariants in 4 ms
[2022-05-19 08:44:32] [INFO ] Implicit Places using invariants and state equation in 3188 ms returned []
Implicit Place search using SMT with State Equation took 4484 ms to find 0 implicit places.
// Phase 1: matrix 2406 rows 2505 cols
[2022-05-19 08:44:32] [INFO ] Computed 900 place invariants in 10 ms
[2022-05-19 08:44:33] [INFO ] Dead Transitions using invariants and state equation in 1342 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 2505/2505 places, 2406/2406 transitions.
Computed a total of 4 stabilizing places and 4 stable transitions
Computed a total of 4 stabilizing places and 4 stable transitions
Knowledge obtained : [(AND p0 (NOT p1)), (X p0), (X (NOT (AND p1 p0))), (X (AND (NOT p1) p0)), true, (X (X (NOT (AND p1 p0)))), (X (X (AND (NOT p1) p0))), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 8 factoid took 271 ms. Reduced automaton from 4 states, 7 edges and 2 AP to 4 states, 7 edges and 2 AP.
Stuttering acceptance computed with spot in 85 ms :[(NOT p0), (OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0)), true]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 212 ms. (steps per millisecond=47 ) properties (out of 3) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 117 ms. (steps per millisecond=85 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 2406 rows 2505 cols
[2022-05-19 08:44:34] [INFO ] Computed 900 place invariants in 10 ms
[2022-05-19 08:44:34] [INFO ] After 247ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-19 08:44:34] [INFO ] [Nat]Absence check using 900 positive place invariants in 157 ms returned sat
[2022-05-19 08:44:36] [INFO ] After 1424ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-19 08:44:36] [INFO ] Deduced a trap composed of 3 places in 68 ms of which 1 ms to minimize.
[2022-05-19 08:44:36] [INFO ] Deduced a trap composed of 7 places in 65 ms of which 1 ms to minimize.
[2022-05-19 08:44:36] [INFO ] Deduced a trap composed of 8 places in 62 ms of which 0 ms to minimize.
[2022-05-19 08:44:36] [INFO ] Deduced a trap composed of 5 places in 47 ms of which 0 ms to minimize.
[2022-05-19 08:44:37] [INFO ] Deduced a trap composed of 7 places in 39 ms of which 0 ms to minimize.
[2022-05-19 08:44:37] [INFO ] Deduced a trap composed of 8 places in 45 ms of which 0 ms to minimize.
[2022-05-19 08:44:37] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 908 ms
[2022-05-19 08:44:37] [INFO ] After 2389ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 79 ms.
[2022-05-19 08:44:37] [INFO ] After 2918ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 47 ms.
Support contains 3 out of 2505 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 2505/2505 places, 2406/2406 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 10 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 2504 transition count 2405
Partial Free-agglomeration rule applied 600 times.
Drop transitions removed 600 transitions
Iterating global reduction 0 with 600 rules applied. Total rules applied 602 place count 2504 transition count 2405
Applied a total of 602 rules in 208 ms. Remains 2504 /2505 variables (removed 1) and now considering 2405/2406 (removed 1) transitions.
Finished structural reductions, in 1 iterations. Remains : 2504/2505 places, 2405/2406 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 181 ms. (steps per millisecond=55 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 111 ms. (steps per millisecond=90 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 150633 steps, run timeout after 3004 ms. (steps per millisecond=50 ) properties seen :{}
Probabilistic random walk after 150633 steps, saw 148835 distinct states, run finished after 3004 ms. (steps per millisecond=50 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 2405 rows 2504 cols
[2022-05-19 08:44:40] [INFO ] Computed 900 place invariants in 26 ms
[2022-05-19 08:44:41] [INFO ] After 236ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-19 08:44:41] [INFO ] [Nat]Absence check using 900 positive place invariants in 151 ms returned sat
[2022-05-19 08:44:42] [INFO ] After 1165ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-19 08:44:43] [INFO ] Deduced a trap composed of 5 places in 94 ms of which 0 ms to minimize.
[2022-05-19 08:44:43] [INFO ] Deduced a trap composed of 18 places in 89 ms of which 0 ms to minimize.
[2022-05-19 08:44:43] [INFO ] Deduced a trap composed of 8 places in 74 ms of which 0 ms to minimize.
[2022-05-19 08:44:43] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 577 ms
[2022-05-19 08:44:43] [INFO ] After 1799ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 83 ms.
[2022-05-19 08:44:43] [INFO ] After 2315ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 43 ms.
Support contains 3 out of 2504 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 2504/2504 places, 2405/2405 transitions.
Applied a total of 0 rules in 73 ms. Remains 2504 /2504 variables (removed 0) and now considering 2405/2405 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 2504/2504 places, 2405/2405 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 2504/2504 places, 2405/2405 transitions.
Applied a total of 0 rules in 92 ms. Remains 2504 /2504 variables (removed 0) and now considering 2405/2405 (removed 0) transitions.
// Phase 1: matrix 2405 rows 2504 cols
[2022-05-19 08:44:43] [INFO ] Computed 900 place invariants in 25 ms
[2022-05-19 08:44:45] [INFO ] Implicit Places using invariants in 1739 ms returned []
// Phase 1: matrix 2405 rows 2504 cols
[2022-05-19 08:44:45] [INFO ] Computed 900 place invariants in 18 ms
[2022-05-19 08:44:49] [INFO ] Implicit Places using invariants and state equation in 3792 ms returned []
Implicit Place search using SMT with State Equation took 5531 ms to find 0 implicit places.
[2022-05-19 08:44:49] [INFO ] Redundant transitions in 77 ms returned []
// Phase 1: matrix 2405 rows 2504 cols
[2022-05-19 08:44:49] [INFO ] Computed 900 place invariants in 25 ms
[2022-05-19 08:44:50] [INFO ] Dead Transitions using invariants and state equation in 1504 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 2504/2504 places, 2405/2405 transitions.
Applied a total of 0 rules in 72 ms. Remains 2504 /2504 variables (removed 0) and now considering 2405/2405 (removed 0) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 2405 rows 2504 cols
[2022-05-19 08:44:50] [INFO ] Computed 900 place invariants in 22 ms
[2022-05-19 08:44:51] [INFO ] After 262ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-19 08:44:51] [INFO ] [Nat]Absence check using 900 positive place invariants in 157 ms returned sat
[2022-05-19 08:44:52] [INFO ] After 1208ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-19 08:44:53] [INFO ] Deduced a trap composed of 5 places in 89 ms of which 0 ms to minimize.
[2022-05-19 08:44:53] [INFO ] Deduced a trap composed of 18 places in 86 ms of which 0 ms to minimize.
[2022-05-19 08:44:53] [INFO ] Deduced a trap composed of 8 places in 71 ms of which 0 ms to minimize.
[2022-05-19 08:44:53] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 563 ms
[2022-05-19 08:44:53] [INFO ] After 1834ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 91 ms.
[2022-05-19 08:44:53] [INFO ] After 2395ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [(AND p0 (NOT p1)), (X p0), (X (NOT (AND p1 p0))), (X (AND (NOT p1) p0)), true, (X (X (NOT (AND p1 p0)))), (X (X (AND (NOT p1) p0))), (X (X p0))]
False Knowledge obtained : [(F (NOT (AND (NOT p1) p0))), (F (AND p1 p0))]
Knowledge based reduction with 8 factoid took 258 ms. Reduced automaton from 4 states, 7 edges and 2 AP to 4 states, 7 edges and 2 AP.
Stuttering acceptance computed with spot in 118 ms :[(NOT p0), (OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0)), true]
Stuttering acceptance computed with spot in 329 ms :[(NOT p0), (OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0)), true]
// Phase 1: matrix 2406 rows 2505 cols
[2022-05-19 08:44:54] [INFO ] Computed 900 place invariants in 6 ms
[2022-05-19 08:44:57] [INFO ] [Real]Absence check using 900 positive place invariants in 965 ms returned sat
[2022-05-19 08:44:57] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-19 08:45:09] [INFO ] [Real]Absence check using state equation in 11530 ms returned unknown
Could not prove EG (NOT p1)
Stuttering acceptance computed with spot in 422 ms :[(NOT p0), (OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0)), true]
Product exploration explored 100000 steps with 19 reset in 1571 ms.
Product exploration explored 100000 steps with 19 reset in 1936 ms.
Applying partial POR strategy [true, true, false, true]
Stuttering acceptance computed with spot in 123 ms :[(NOT p0), (OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0)), true]
Support contains 4 out of 2505 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2505/2505 places, 2406/2406 transitions.
Applied a total of 0 rules in 77 ms. Remains 2505 /2505 variables (removed 0) and now considering 2406/2406 (removed 0) transitions.
[2022-05-19 08:45:13] [INFO ] Redundant transitions in 266 ms returned [2405]
Found 1 redundant transitions using SMT.
Drop transitions removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
// Phase 1: matrix 2405 rows 2505 cols
[2022-05-19 08:45:13] [INFO ] Computed 900 place invariants in 4 ms
[2022-05-19 08:45:15] [INFO ] Dead Transitions using invariants and state equation in 1410 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 2505/2505 places, 2405/2406 transitions.
Applied a total of 0 rules in 74 ms. Remains 2505 /2505 variables (removed 0) and now considering 2405/2405 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 2505/2505 places, 2405/2406 transitions.
Product exploration explored 100000 steps with 19 reset in 1585 ms.
Product exploration explored 100000 steps with 19 reset in 1932 ms.
Built C files in :
/tmp/ltsmin15444680671464219076
[2022-05-19 08:45:18] [INFO ] Built C files in 24ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15444680671464219076
Running compilation step : cd /tmp/ltsmin15444680671464219076;'/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/ltsmin15444680671464219076;'/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/ltsmin15444680671464219076;'/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 4 out of 2505 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2505/2505 places, 2406/2406 transitions.
Applied a total of 0 rules in 67 ms. Remains 2505 /2505 variables (removed 0) and now considering 2406/2406 (removed 0) transitions.
// Phase 1: matrix 2406 rows 2505 cols
[2022-05-19 08:45:22] [INFO ] Computed 900 place invariants in 27 ms
[2022-05-19 08:45:23] [INFO ] Implicit Places using invariants in 1361 ms returned []
// Phase 1: matrix 2406 rows 2505 cols
[2022-05-19 08:45:23] [INFO ] Computed 900 place invariants in 4 ms
[2022-05-19 08:45:26] [INFO ] Implicit Places using invariants and state equation in 3153 ms returned []
Implicit Place search using SMT with State Equation took 4516 ms to find 0 implicit places.
// Phase 1: matrix 2406 rows 2505 cols
[2022-05-19 08:45:26] [INFO ] Computed 900 place invariants in 7 ms
[2022-05-19 08:45:28] [INFO ] Dead Transitions using invariants and state equation in 1471 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 2505/2505 places, 2406/2406 transitions.
Built C files in :
/tmp/ltsmin12360501258733851622
[2022-05-19 08:45:28] [INFO ] Built C files in 15ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12360501258733851622
Running compilation step : cd /tmp/ltsmin12360501258733851622;'/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/ltsmin12360501258733851622;'/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/ltsmin12360501258733851622;'/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-19 08:45:31] [INFO ] Flatten gal took : 86 ms
[2022-05-19 08:45:31] [INFO ] Flatten gal took : 86 ms
[2022-05-19 08:45:31] [INFO ] Time to serialize gal into /tmp/LTL5172659290803385471.gal : 6 ms
[2022-05-19 08:45:31] [INFO ] Time to serialize properties into /tmp/LTL1186461840888314654.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/LTL5172659290803385471.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL1186461840888314654.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/LTL5172659...266
Read 1 LTL properties
Checking formula 0 : !(((G(X("(((p3883==0)||(p1292==0))||(p5419==0))")))&&(F("(p2181==1)"))))
Formula 0 simplified : !(GX"(((p3883==0)||(p1292==0))||(p5419==0))" & F"(p2181==1)")
Detected timeout of ITS tools.
[2022-05-19 08:45:46] [INFO ] Flatten gal took : 96 ms
[2022-05-19 08:45:46] [INFO ] Applying decomposition
[2022-05-19 08:45:46] [INFO ] Flatten gal took : 92 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/graph17018614195397436012.txt' '-o' '/tmp/graph17018614195397436012.bin' '-w' '/tmp/graph17018614195397436012.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph17018614195397436012.bin' '-l' '-1' '-v' '-w' '/tmp/graph17018614195397436012.weights' '-q' '0' '-e' '0.001'
[2022-05-19 08:45:46] [INFO ] Decomposing Gal with order
[2022-05-19 08:45:46] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-19 08:45:47] [INFO ] Removed a total of 1598 redundant transitions.
[2022-05-19 08:45:47] [INFO ] Flatten gal took : 147 ms
[2022-05-19 08:45:47] [INFO ] Fuse similar labels procedure discarded/fused a total of 1526 labels/synchronizations in 28 ms.
[2022-05-19 08:45:47] [INFO ] Time to serialize gal into /tmp/LTL1236211302453749240.gal : 17 ms
[2022-05-19 08:45:47] [INFO ] Time to serialize properties into /tmp/LTL13109172033460401611.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/LTL1236211302453749240.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL13109172033460401611.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/LTL1236211...246
Read 1 LTL properties
Checking formula 0 : !(((G(X("(((i28.u578.p3883==0)||(i9.i1.i1.u181.p1292==0))||(i40.i0.i1.u812.p5419==0))")))&&(F("(i16.i0.i1.u318.p2181==1)"))))
Formula 0 simplified : !(GX"(((i28.u578.p3883==0)||(i9.i1.i1.u181.p1292==0))||(i40.i0.i1.u812.p5419==0))" & F"(i16.i0.i1.u318.p2181==1)")
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin17828158440672031568
[2022-05-19 08:46:02] [INFO ] Built C files in 20ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17828158440672031568
Running compilation step : cd /tmp/ltsmin17828158440672031568;'/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/ltsmin17828158440672031568;'/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/ltsmin17828158440672031568;'/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)
Treatment of property ShieldIIPs-PT-100B-LTLFireability-10 finished in 144077 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(G((X((G(p1)||p0)) U !p2))))'
Found a SL insensitive property : ShieldIIPs-PT-100B-LTLFireability-15
Stuttering acceptance computed with spot in 163 ms :[p2, p2, (AND (NOT p1) p2), (AND (NOT p1) p2)]
Support contains 4 out of 5308 places. Attempting structural reductions.
Starting structural reductions in SLCL_LTL mode, iteration 0 : 5308/5308 places, 5208/5208 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 500 transitions
Trivial Post-agglo rules discarded 500 transitions
Performed 500 trivial Post agglomeration. Transition count delta: 500
Iterating post reduction 0 with 500 rules applied. Total rules applied 500 place count 5307 transition count 4707
Reduce places removed 500 places and 0 transitions.
Iterating post reduction 1 with 500 rules applied. Total rules applied 1000 place count 4807 transition count 4707
Performed 502 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 502 Pre rules applied. Total rules applied 1000 place count 4807 transition count 4205
Deduced a syphon composed of 502 places in 19 ms
Reduce places removed 502 places and 0 transitions.
Iterating global reduction 2 with 1004 rules applied. Total rules applied 2004 place count 4305 transition count 4205
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 2010 place count 4299 transition count 4199
Iterating global reduction 2 with 6 rules applied. Total rules applied 2016 place count 4299 transition count 4199
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 2016 place count 4299 transition count 4197
Deduced a syphon composed of 2 places in 18 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 2020 place count 4297 transition count 4197
Performed 1792 Post agglomeration using F-continuation condition.Transition count delta: 1792
Deduced a syphon composed of 1792 places in 12 ms
Reduce places removed 1792 places and 0 transitions.
Iterating global reduction 2 with 3584 rules applied. Total rules applied 5604 place count 2505 transition count 2405
Renaming transitions due to excessive name length > 1024 char.
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 5606 place count 2503 transition count 2403
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 5607 place count 2502 transition count 2403
Applied a total of 5607 rules in 1251 ms. Remains 2502 /5308 variables (removed 2806) and now considering 2403/5208 (removed 2805) transitions.
// Phase 1: matrix 2403 rows 2502 cols
[2022-05-19 08:46:06] [INFO ] Computed 900 place invariants in 7 ms
[2022-05-19 08:46:08] [INFO ] Implicit Places using invariants in 1282 ms returned []
// Phase 1: matrix 2403 rows 2502 cols
[2022-05-19 08:46:08] [INFO ] Computed 900 place invariants in 4 ms
[2022-05-19 08:46:11] [INFO ] Implicit Places using invariants and state equation in 3140 ms returned []
Implicit Place search using SMT with State Equation took 4425 ms to find 0 implicit places.
// Phase 1: matrix 2403 rows 2502 cols
[2022-05-19 08:46:11] [INFO ] Computed 900 place invariants in 3 ms
[2022-05-19 08:46:12] [INFO ] Dead Transitions using invariants and state equation in 1326 ms found 0 transitions.
Starting structural reductions in SLCL_LTL mode, iteration 1 : 2502/5308 places, 2403/5208 transitions.
Finished structural reductions, in 1 iterations. Remains : 2502/5308 places, 2403/5208 transitions.
Running random walk in product with property : ShieldIIPs-PT-100B-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={1} source=0 dest: 0}, { cond=p2, acceptance={0, 1} source=0 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={1} source=1 dest: 0}, { cond=p2, acceptance={0, 1} source=1 dest: 1}, { cond=(AND (NOT p0) p1), acceptance={} source=1 dest: 2}], [{ cond=(NOT p1), acceptance={1} source=2 dest: 0}, { cond=(AND p2 (NOT p1)), acceptance={0, 1} source=2 dest: 1}, { cond=p1, acceptance={} source=2 dest: 2}, { cond=(AND p2 p1), acceptance={0} source=2 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={1} source=3 dest: 0}, { cond=(AND p2 (NOT p1)), acceptance={0, 1} source=3 dest: 1}, { cond=(AND (NOT p0) p1), acceptance={} source=3 dest: 2}, { cond=(AND p2 p1), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p2:(AND (EQ s807 1) (EQ s821 1)), p0:(OR (EQ s143 1) (EQ s14 1)), p1:(NEQ s143 1)], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, sl-invariant], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 19 reset in 1552 ms.
Product exploration explored 100000 steps with 19 reset in 1914 ms.
Computed a total of 3 stabilizing places and 3 stable transitions
Computed a total of 3 stabilizing places and 3 stable transitions
Knowledge obtained : [(AND (NOT p2) (NOT p0) p1), (X (NOT p2)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT p2))), true, (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p1)), (X (X (NOT (AND p2 p1)))), (X (X (NOT (AND p2 (NOT p1)))))]
False Knowledge obtained : [(X (AND (NOT p0) p1)), (X (NOT (AND (NOT p0) p1))), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1))))]
Knowledge based reduction with 9 factoid took 442 ms. Reduced automaton from 4 states, 13 edges and 3 AP to 4 states, 13 edges and 3 AP.
Stuttering acceptance computed with spot in 138 ms :[p2, p2, (AND (NOT p1) p2), (AND (NOT p1) p2)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 319 ms. (steps per millisecond=31 ) properties (out of 6) seen :3
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 117 ms. (steps per millisecond=85 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 115 ms. (steps per millisecond=86 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 114 ms. (steps per millisecond=87 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
// Phase 1: matrix 2403 rows 2502 cols
[2022-05-19 08:46:17] [INFO ] Computed 900 place invariants in 6 ms
[2022-05-19 08:46:17] [INFO ] [Real]Absence check using 900 positive place invariants in 162 ms returned sat
[2022-05-19 08:46:19] [INFO ] After 1839ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:2
[2022-05-19 08:46:19] [INFO ] [Nat]Absence check using 900 positive place invariants in 151 ms returned sat
[2022-05-19 08:46:20] [INFO ] After 1213ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :2
[2022-05-19 08:46:21] [INFO ] Deduced a trap composed of 8 places in 77 ms of which 0 ms to minimize.
[2022-05-19 08:46:21] [INFO ] Deduced a trap composed of 9 places in 68 ms of which 1 ms to minimize.
[2022-05-19 08:46:21] [INFO ] Deduced a trap composed of 17 places in 62 ms of which 0 ms to minimize.
[2022-05-19 08:46:21] [INFO ] Deduced a trap composed of 17 places in 57 ms of which 0 ms to minimize.
[2022-05-19 08:46:21] [INFO ] Deduced a trap composed of 9 places in 52 ms of which 1 ms to minimize.
[2022-05-19 08:46:21] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 776 ms
[2022-05-19 08:46:21] [INFO ] After 2183ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :2
Attempting to minimize the solution found.
Minimization took 159 ms.
[2022-05-19 08:46:22] [INFO ] After 2846ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :2
Fused 3 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 105 ms.
Support contains 3 out of 2502 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 2502/2502 places, 2403/2403 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 11 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 2501 transition count 2402
Partial Free-agglomeration rule applied 598 times.
Drop transitions removed 598 transitions
Iterating global reduction 0 with 598 rules applied. Total rules applied 600 place count 2501 transition count 2402
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 0 with 1 rules applied. Total rules applied 601 place count 2500 transition count 2401
Applied a total of 601 rules in 290 ms. Remains 2500 /2502 variables (removed 2) and now considering 2401/2403 (removed 2) transitions.
Finished structural reductions, in 1 iterations. Remains : 2500/2502 places, 2401/2403 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 231 ms. (steps per millisecond=43 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 120 ms. (steps per millisecond=83 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 116 ms. (steps per millisecond=86 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 138894 steps, run timeout after 3003 ms. (steps per millisecond=46 ) properties seen :{0=1}
Probabilistic random walk after 138894 steps, saw 137702 distinct states, run finished after 3004 ms. (steps per millisecond=46 ) properties seen :1
Running SMT prover for 1 properties.
// Phase 1: matrix 2401 rows 2500 cols
[2022-05-19 08:46:25] [INFO ] Computed 900 place invariants in 23 ms
[2022-05-19 08:46:26] [INFO ] [Real]Absence check using 900 positive place invariants in 156 ms returned sat
[2022-05-19 08:46:27] [INFO ] After 1636ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-19 08:46:27] [INFO ] [Nat]Absence check using 900 positive place invariants in 160 ms returned sat
[2022-05-19 08:46:29] [INFO ] After 1267ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-19 08:46:29] [INFO ] Deduced a trap composed of 18 places in 105 ms of which 0 ms to minimize.
[2022-05-19 08:46:29] [INFO ] Deduced a trap composed of 18 places in 103 ms of which 1 ms to minimize.
[2022-05-19 08:46:29] [INFO ] Deduced a trap composed of 8 places in 104 ms of which 0 ms to minimize.
[2022-05-19 08:46:30] [INFO ] Deduced a trap composed of 29 places in 101 ms of which 1 ms to minimize.
[2022-05-19 08:46:30] [INFO ] Deduced a trap composed of 17 places in 95 ms of which 0 ms to minimize.
[2022-05-19 08:46:30] [INFO ] Deduced a trap composed of 17 places in 96 ms of which 0 ms to minimize.
[2022-05-19 08:46:30] [INFO ] Deduced a trap composed of 17 places in 93 ms of which 0 ms to minimize.
[2022-05-19 08:46:30] [INFO ] Deduced a trap composed of 17 places in 92 ms of which 1 ms to minimize.
[2022-05-19 08:46:30] [INFO ] Deduced a trap composed of 18 places in 92 ms of which 1 ms to minimize.
[2022-05-19 08:46:31] [INFO ] Deduced a trap composed of 23 places in 91 ms of which 0 ms to minimize.
[2022-05-19 08:46:31] [INFO ] Deduced a trap composed of 17 places in 83 ms of which 0 ms to minimize.
[2022-05-19 08:46:31] [INFO ] Deduced a trap composed of 29 places in 82 ms of which 0 ms to minimize.
[2022-05-19 08:46:31] [INFO ] Deduced a trap composed of 17 places in 72 ms of which 0 ms to minimize.
[2022-05-19 08:46:31] [INFO ] Deduced a trap composed of 17 places in 78 ms of which 1 ms to minimize.
[2022-05-19 08:46:31] [INFO ] Deduced a trap composed of 17 places in 75 ms of which 0 ms to minimize.
[2022-05-19 08:46:31] [INFO ] Trap strengthening (SAT) tested/added 16/15 trap constraints in 2606 ms
[2022-05-19 08:46:31] [INFO ] After 3933ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 81 ms.
[2022-05-19 08:46:32] [INFO ] After 4476ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 26 ms.
Support contains 3 out of 2500 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 2500/2500 places, 2401/2401 transitions.
Applied a total of 0 rules in 70 ms. Remains 2500 /2500 variables (removed 0) and now considering 2401/2401 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 2500/2500 places, 2401/2401 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 180 ms. (steps per millisecond=55 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 114 ms. (steps per millisecond=87 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 151152 steps, run timeout after 3004 ms. (steps per millisecond=50 ) properties seen :{}
Probabilistic random walk after 151152 steps, saw 149893 distinct states, run finished after 3005 ms. (steps per millisecond=50 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 2401 rows 2500 cols
[2022-05-19 08:46:35] [INFO ] Computed 900 place invariants in 24 ms
[2022-05-19 08:46:35] [INFO ] [Real]Absence check using 900 positive place invariants in 151 ms returned sat
[2022-05-19 08:46:37] [INFO ] After 1610ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-19 08:46:37] [INFO ] [Nat]Absence check using 900 positive place invariants in 160 ms returned sat
[2022-05-19 08:46:38] [INFO ] After 1291ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-19 08:46:39] [INFO ] Deduced a trap composed of 18 places in 113 ms of which 1 ms to minimize.
[2022-05-19 08:46:39] [INFO ] Deduced a trap composed of 18 places in 106 ms of which 1 ms to minimize.
[2022-05-19 08:46:39] [INFO ] Deduced a trap composed of 8 places in 104 ms of which 1 ms to minimize.
[2022-05-19 08:46:39] [INFO ] Deduced a trap composed of 29 places in 97 ms of which 1 ms to minimize.
[2022-05-19 08:46:39] [INFO ] Deduced a trap composed of 17 places in 98 ms of which 0 ms to minimize.
[2022-05-19 08:46:39] [INFO ] Deduced a trap composed of 17 places in 100 ms of which 0 ms to minimize.
[2022-05-19 08:46:40] [INFO ] Deduced a trap composed of 17 places in 95 ms of which 1 ms to minimize.
[2022-05-19 08:46:40] [INFO ] Deduced a trap composed of 17 places in 102 ms of which 0 ms to minimize.
[2022-05-19 08:46:40] [INFO ] Deduced a trap composed of 18 places in 97 ms of which 0 ms to minimize.
[2022-05-19 08:46:40] [INFO ] Deduced a trap composed of 23 places in 93 ms of which 0 ms to minimize.
[2022-05-19 08:46:40] [INFO ] Deduced a trap composed of 17 places in 81 ms of which 1 ms to minimize.
[2022-05-19 08:46:40] [INFO ] Deduced a trap composed of 29 places in 87 ms of which 1 ms to minimize.
[2022-05-19 08:46:41] [INFO ] Deduced a trap composed of 17 places in 77 ms of which 0 ms to minimize.
[2022-05-19 08:46:41] [INFO ] Deduced a trap composed of 17 places in 77 ms of which 0 ms to minimize.
[2022-05-19 08:46:41] [INFO ] Deduced a trap composed of 17 places in 75 ms of which 0 ms to minimize.
[2022-05-19 08:46:41] [INFO ] Trap strengthening (SAT) tested/added 16/15 trap constraints in 2690 ms
[2022-05-19 08:46:41] [INFO ] After 4042ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 84 ms.
[2022-05-19 08:46:41] [INFO ] After 4597ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 28 ms.
Support contains 3 out of 2500 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 2500/2500 places, 2401/2401 transitions.
Applied a total of 0 rules in 80 ms. Remains 2500 /2500 variables (removed 0) and now considering 2401/2401 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 2500/2500 places, 2401/2401 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 2500/2500 places, 2401/2401 transitions.
Applied a total of 0 rules in 73 ms. Remains 2500 /2500 variables (removed 0) and now considering 2401/2401 (removed 0) transitions.
// Phase 1: matrix 2401 rows 2500 cols
[2022-05-19 08:46:41] [INFO ] Computed 900 place invariants in 25 ms
[2022-05-19 08:46:43] [INFO ] Implicit Places using invariants in 1740 ms returned []
// Phase 1: matrix 2401 rows 2500 cols
[2022-05-19 08:46:43] [INFO ] Computed 900 place invariants in 17 ms
[2022-05-19 08:46:47] [INFO ] Implicit Places using invariants and state equation in 3983 ms returned []
Implicit Place search using SMT with State Equation took 5727 ms to find 0 implicit places.
[2022-05-19 08:46:47] [INFO ] Redundant transitions in 76 ms returned []
// Phase 1: matrix 2401 rows 2500 cols
[2022-05-19 08:46:47] [INFO ] Computed 900 place invariants in 23 ms
[2022-05-19 08:46:49] [INFO ] Dead Transitions using invariants and state equation in 1505 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 2500/2500 places, 2401/2401 transitions.
Applied a total of 0 rules in 85 ms. Remains 2500 /2500 variables (removed 0) and now considering 2401/2401 (removed 0) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 2401 rows 2500 cols
[2022-05-19 08:46:49] [INFO ] Computed 900 place invariants in 24 ms
[2022-05-19 08:46:49] [INFO ] [Real]Absence check using 900 positive place invariants in 157 ms returned sat
[2022-05-19 08:46:50] [INFO ] After 1651ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-19 08:46:51] [INFO ] [Nat]Absence check using 900 positive place invariants in 155 ms returned sat
[2022-05-19 08:46:52] [INFO ] After 1290ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-19 08:46:52] [INFO ] Deduced a trap composed of 18 places in 118 ms of which 1 ms to minimize.
[2022-05-19 08:46:53] [INFO ] Deduced a trap composed of 18 places in 107 ms of which 0 ms to minimize.
[2022-05-19 08:46:53] [INFO ] Deduced a trap composed of 8 places in 99 ms of which 0 ms to minimize.
[2022-05-19 08:46:53] [INFO ] Deduced a trap composed of 29 places in 96 ms of which 0 ms to minimize.
[2022-05-19 08:46:53] [INFO ] Deduced a trap composed of 17 places in 95 ms of which 0 ms to minimize.
[2022-05-19 08:46:53] [INFO ] Deduced a trap composed of 17 places in 98 ms of which 1 ms to minimize.
[2022-05-19 08:46:53] [INFO ] Deduced a trap composed of 17 places in 102 ms of which 1 ms to minimize.
[2022-05-19 08:46:54] [INFO ] Deduced a trap composed of 17 places in 104 ms of which 1 ms to minimize.
[2022-05-19 08:46:54] [INFO ] Deduced a trap composed of 18 places in 104 ms of which 1 ms to minimize.
[2022-05-19 08:46:54] [INFO ] Deduced a trap composed of 23 places in 101 ms of which 0 ms to minimize.
[2022-05-19 08:46:54] [INFO ] Deduced a trap composed of 17 places in 89 ms of which 0 ms to minimize.
[2022-05-19 08:46:54] [INFO ] Deduced a trap composed of 29 places in 91 ms of which 1 ms to minimize.
[2022-05-19 08:46:54] [INFO ] Deduced a trap composed of 17 places in 83 ms of which 0 ms to minimize.
[2022-05-19 08:46:55] [INFO ] Deduced a trap composed of 17 places in 83 ms of which 1 ms to minimize.
[2022-05-19 08:46:55] [INFO ] Deduced a trap composed of 17 places in 84 ms of which 1 ms to minimize.
[2022-05-19 08:46:55] [INFO ] Trap strengthening (SAT) tested/added 16/15 trap constraints in 2707 ms
[2022-05-19 08:46:55] [INFO ] After 4057ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 79 ms.
[2022-05-19 08:46:55] [INFO ] After 4601ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p2) (NOT p0) p1), (X (NOT p2)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT p2))), true, (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p1)), (X (X (NOT (AND p2 p1)))), (X (X (NOT (AND p2 (NOT p1))))), (G (NOT (AND (NOT p0) (NOT p1))))]
False Knowledge obtained : [(X (AND (NOT p0) p1)), (X (NOT (AND (NOT p0) p1))), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1)))), (F (NOT p1)), (F (AND p1 p2)), (F p2), (F (NOT (AND (NOT p0) p1)))]
Knowledge based reduction with 10 factoid took 816 ms. Reduced automaton from 4 states, 13 edges and 3 AP to 4 states, 11 edges and 3 AP.
Stuttering acceptance computed with spot in 147 ms :[p2, p2, (AND (NOT p1) p2), (AND (NOT p1) p2)]
Stuttering acceptance computed with spot in 124 ms :[p2, p2, (AND (NOT p1) p2), (AND (NOT p1) p2)]
Support contains 4 out of 2502 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2502/2502 places, 2403/2403 transitions.
Applied a total of 0 rules in 70 ms. Remains 2502 /2502 variables (removed 0) and now considering 2403/2403 (removed 0) transitions.
// Phase 1: matrix 2403 rows 2502 cols
[2022-05-19 08:46:56] [INFO ] Computed 900 place invariants in 11 ms
[2022-05-19 08:46:58] [INFO ] Implicit Places using invariants in 1353 ms returned []
// Phase 1: matrix 2403 rows 2502 cols
[2022-05-19 08:46:58] [INFO ] Computed 900 place invariants in 6 ms
[2022-05-19 08:47:01] [INFO ] Implicit Places using invariants and state equation in 3298 ms returned []
Implicit Place search using SMT with State Equation took 4652 ms to find 0 implicit places.
// Phase 1: matrix 2403 rows 2502 cols
[2022-05-19 08:47:01] [INFO ] Computed 900 place invariants in 8 ms
[2022-05-19 08:47:02] [INFO ] Dead Transitions using invariants and state equation in 1421 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 2502/2502 places, 2403/2403 transitions.
Computed a total of 3 stabilizing places and 3 stable transitions
Computed a total of 3 stabilizing places and 3 stable transitions
Knowledge obtained : [(AND (NOT p2) (NOT p0) p1), (X (NOT p2)), (X (X (NOT p2))), (X (X p1)), (X (X (NOT (AND p2 p1)))), (X (X (NOT (AND p2 (NOT p1)))))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 6 factoid took 307 ms. Reduced automaton from 4 states, 11 edges and 3 AP to 4 states, 11 edges and 3 AP.
Stuttering acceptance computed with spot in 118 ms :[p2, p2, (AND (NOT p1) p2), (AND (NOT p1) p2)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 278 ms. (steps per millisecond=35 ) properties (out of 5) seen :3
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 126 ms. (steps per millisecond=79 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 115 ms. (steps per millisecond=86 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 2403 rows 2502 cols
[2022-05-19 08:47:03] [INFO ] Computed 900 place invariants in 11 ms
[2022-05-19 08:47:04] [INFO ] [Real]Absence check using 900 positive place invariants in 150 ms returned sat
[2022-05-19 08:47:05] [INFO ] After 1648ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2022-05-19 08:47:05] [INFO ] [Nat]Absence check using 900 positive place invariants in 156 ms returned sat
[2022-05-19 08:47:07] [INFO ] After 1143ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2022-05-19 08:47:07] [INFO ] Deduced a trap composed of 8 places in 65 ms of which 1 ms to minimize.
[2022-05-19 08:47:07] [INFO ] Deduced a trap composed of 9 places in 64 ms of which 0 ms to minimize.
[2022-05-19 08:47:07] [INFO ] Deduced a trap composed of 17 places in 55 ms of which 0 ms to minimize.
[2022-05-19 08:47:07] [INFO ] Deduced a trap composed of 17 places in 60 ms of which 1 ms to minimize.
[2022-05-19 08:47:07] [INFO ] Deduced a trap composed of 9 places in 46 ms of which 0 ms to minimize.
[2022-05-19 08:47:07] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 739 ms
[2022-05-19 08:47:08] [INFO ] After 2086ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 161 ms.
[2022-05-19 08:47:08] [INFO ] After 2757ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 120 ms.
Support contains 3 out of 2502 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 2502/2502 places, 2403/2403 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 11 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 2501 transition count 2402
Partial Free-agglomeration rule applied 598 times.
Drop transitions removed 598 transitions
Iterating global reduction 0 with 598 rules applied. Total rules applied 600 place count 2501 transition count 2402
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 0 with 1 rules applied. Total rules applied 601 place count 2500 transition count 2401
Applied a total of 601 rules in 289 ms. Remains 2500 /2502 variables (removed 2) and now considering 2401/2403 (removed 2) transitions.
Finished structural reductions, in 1 iterations. Remains : 2500/2502 places, 2401/2403 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 262 ms. (steps per millisecond=38 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 113 ms. (steps per millisecond=88 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 114 ms. (steps per millisecond=87 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 130149 steps, run timeout after 3001 ms. (steps per millisecond=43 ) properties seen :{0=1}
Probabilistic random walk after 130149 steps, saw 129010 distinct states, run finished after 3001 ms. (steps per millisecond=43 ) properties seen :1
Running SMT prover for 1 properties.
// Phase 1: matrix 2401 rows 2500 cols
[2022-05-19 08:47:12] [INFO ] Computed 900 place invariants in 25 ms
[2022-05-19 08:47:12] [INFO ] [Real]Absence check using 900 positive place invariants in 140 ms returned sat
[2022-05-19 08:47:13] [INFO ] After 1462ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-19 08:47:14] [INFO ] [Nat]Absence check using 900 positive place invariants in 141 ms returned sat
[2022-05-19 08:47:15] [INFO ] After 1216ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-19 08:47:15] [INFO ] Deduced a trap composed of 18 places in 92 ms of which 0 ms to minimize.
[2022-05-19 08:47:15] [INFO ] Deduced a trap composed of 18 places in 99 ms of which 1 ms to minimize.
[2022-05-19 08:47:15] [INFO ] Deduced a trap composed of 8 places in 96 ms of which 0 ms to minimize.
[2022-05-19 08:47:15] [INFO ] Deduced a trap composed of 29 places in 90 ms of which 0 ms to minimize.
[2022-05-19 08:47:16] [INFO ] Deduced a trap composed of 17 places in 85 ms of which 1 ms to minimize.
[2022-05-19 08:47:16] [INFO ] Deduced a trap composed of 17 places in 86 ms of which 0 ms to minimize.
[2022-05-19 08:47:16] [INFO ] Deduced a trap composed of 17 places in 87 ms of which 1 ms to minimize.
[2022-05-19 08:47:16] [INFO ] Deduced a trap composed of 17 places in 94 ms of which 1 ms to minimize.
[2022-05-19 08:47:16] [INFO ] Deduced a trap composed of 18 places in 89 ms of which 1 ms to minimize.
[2022-05-19 08:47:16] [INFO ] Deduced a trap composed of 23 places in 85 ms of which 0 ms to minimize.
[2022-05-19 08:47:17] [INFO ] Deduced a trap composed of 17 places in 79 ms of which 1 ms to minimize.
[2022-05-19 08:47:17] [INFO ] Deduced a trap composed of 29 places in 78 ms of which 0 ms to minimize.
[2022-05-19 08:47:17] [INFO ] Deduced a trap composed of 17 places in 66 ms of which 0 ms to minimize.
[2022-05-19 08:47:17] [INFO ] Deduced a trap composed of 17 places in 73 ms of which 1 ms to minimize.
[2022-05-19 08:47:17] [INFO ] Deduced a trap composed of 17 places in 73 ms of which 0 ms to minimize.
[2022-05-19 08:47:17] [INFO ] Trap strengthening (SAT) tested/added 16/15 trap constraints in 2515 ms
[2022-05-19 08:47:17] [INFO ] After 3790ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 83 ms.
[2022-05-19 08:47:17] [INFO ] After 4287ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 24 ms.
Support contains 3 out of 2500 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 2500/2500 places, 2401/2401 transitions.
Applied a total of 0 rules in 69 ms. Remains 2500 /2500 variables (removed 0) and now considering 2401/2401 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 2500/2500 places, 2401/2401 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 169 ms. (steps per millisecond=59 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 111 ms. (steps per millisecond=90 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 151354 steps, run timeout after 3002 ms. (steps per millisecond=50 ) properties seen :{}
Probabilistic random walk after 151354 steps, saw 150094 distinct states, run finished after 3002 ms. (steps per millisecond=50 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 2401 rows 2500 cols
[2022-05-19 08:47:21] [INFO ] Computed 900 place invariants in 24 ms
[2022-05-19 08:47:21] [INFO ] [Real]Absence check using 900 positive place invariants in 147 ms returned sat
[2022-05-19 08:47:22] [INFO ] After 1541ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-19 08:47:23] [INFO ] [Nat]Absence check using 900 positive place invariants in 153 ms returned sat
[2022-05-19 08:47:24] [INFO ] After 1232ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-19 08:47:24] [INFO ] Deduced a trap composed of 18 places in 101 ms of which 0 ms to minimize.
[2022-05-19 08:47:24] [INFO ] Deduced a trap composed of 18 places in 94 ms of which 0 ms to minimize.
[2022-05-19 08:47:25] [INFO ] Deduced a trap composed of 8 places in 95 ms of which 1 ms to minimize.
[2022-05-19 08:47:25] [INFO ] Deduced a trap composed of 29 places in 96 ms of which 1 ms to minimize.
[2022-05-19 08:47:25] [INFO ] Deduced a trap composed of 17 places in 91 ms of which 1 ms to minimize.
[2022-05-19 08:47:25] [INFO ] Deduced a trap composed of 17 places in 108 ms of which 0 ms to minimize.
[2022-05-19 08:47:25] [INFO ] Deduced a trap composed of 17 places in 94 ms of which 1 ms to minimize.
[2022-05-19 08:47:25] [INFO ] Deduced a trap composed of 17 places in 89 ms of which 0 ms to minimize.
[2022-05-19 08:47:26] [INFO ] Deduced a trap composed of 18 places in 130 ms of which 1 ms to minimize.
[2022-05-19 08:47:26] [INFO ] Deduced a trap composed of 23 places in 152 ms of which 0 ms to minimize.
[2022-05-19 08:47:26] [INFO ] Deduced a trap composed of 17 places in 89 ms of which 0 ms to minimize.
[2022-05-19 08:47:26] [INFO ] Deduced a trap composed of 29 places in 88 ms of which 1 ms to minimize.
[2022-05-19 08:47:26] [INFO ] Deduced a trap composed of 17 places in 67 ms of which 0 ms to minimize.
[2022-05-19 08:47:26] [INFO ] Deduced a trap composed of 17 places in 73 ms of which 0 ms to minimize.
[2022-05-19 08:47:27] [INFO ] Deduced a trap composed of 17 places in 75 ms of which 0 ms to minimize.
[2022-05-19 08:47:27] [INFO ] Trap strengthening (SAT) tested/added 16/15 trap constraints in 2659 ms
[2022-05-19 08:47:27] [INFO ] After 3945ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 79 ms.
[2022-05-19 08:47:27] [INFO ] After 4457ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 24 ms.
Support contains 3 out of 2500 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 2500/2500 places, 2401/2401 transitions.
Applied a total of 0 rules in 69 ms. Remains 2500 /2500 variables (removed 0) and now considering 2401/2401 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 2500/2500 places, 2401/2401 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 2500/2500 places, 2401/2401 transitions.
Applied a total of 0 rules in 68 ms. Remains 2500 /2500 variables (removed 0) and now considering 2401/2401 (removed 0) transitions.
// Phase 1: matrix 2401 rows 2500 cols
[2022-05-19 08:47:27] [INFO ] Computed 900 place invariants in 24 ms
[2022-05-19 08:47:29] [INFO ] Implicit Places using invariants in 1658 ms returned []
// Phase 1: matrix 2401 rows 2500 cols
[2022-05-19 08:47:29] [INFO ] Computed 900 place invariants in 16 ms
[2022-05-19 08:47:32] [INFO ] Implicit Places using invariants and state equation in 3680 ms returned []
Implicit Place search using SMT with State Equation took 5347 ms to find 0 implicit places.
[2022-05-19 08:47:32] [INFO ] Redundant transitions in 76 ms returned []
// Phase 1: matrix 2401 rows 2500 cols
[2022-05-19 08:47:32] [INFO ] Computed 900 place invariants in 22 ms
[2022-05-19 08:47:34] [INFO ] Dead Transitions using invariants and state equation in 1596 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 2500/2500 places, 2401/2401 transitions.
Applied a total of 0 rules in 90 ms. Remains 2500 /2500 variables (removed 0) and now considering 2401/2401 (removed 0) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 2401 rows 2500 cols
[2022-05-19 08:47:34] [INFO ] Computed 900 place invariants in 17 ms
[2022-05-19 08:47:35] [INFO ] [Real]Absence check using 900 positive place invariants in 139 ms returned sat
[2022-05-19 08:47:36] [INFO ] After 1531ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-19 08:47:36] [INFO ] [Nat]Absence check using 900 positive place invariants in 148 ms returned sat
[2022-05-19 08:47:37] [INFO ] After 1232ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-19 08:47:37] [INFO ] Deduced a trap composed of 18 places in 99 ms of which 0 ms to minimize.
[2022-05-19 08:47:38] [INFO ] Deduced a trap composed of 18 places in 101 ms of which 0 ms to minimize.
[2022-05-19 08:47:38] [INFO ] Deduced a trap composed of 8 places in 97 ms of which 0 ms to minimize.
[2022-05-19 08:47:38] [INFO ] Deduced a trap composed of 29 places in 94 ms of which 0 ms to minimize.
[2022-05-19 08:47:38] [INFO ] Deduced a trap composed of 17 places in 90 ms of which 0 ms to minimize.
[2022-05-19 08:47:38] [INFO ] Deduced a trap composed of 17 places in 94 ms of which 0 ms to minimize.
[2022-05-19 08:47:39] [INFO ] Deduced a trap composed of 17 places in 84 ms of which 0 ms to minimize.
[2022-05-19 08:47:39] [INFO ] Deduced a trap composed of 17 places in 101 ms of which 0 ms to minimize.
[2022-05-19 08:47:39] [INFO ] Deduced a trap composed of 18 places in 94 ms of which 0 ms to minimize.
[2022-05-19 08:47:39] [INFO ] Deduced a trap composed of 23 places in 91 ms of which 1 ms to minimize.
[2022-05-19 08:47:39] [INFO ] Deduced a trap composed of 17 places in 82 ms of which 1 ms to minimize.
[2022-05-19 08:47:39] [INFO ] Deduced a trap composed of 29 places in 84 ms of which 0 ms to minimize.
[2022-05-19 08:47:40] [INFO ] Deduced a trap composed of 17 places in 76 ms of which 1 ms to minimize.
[2022-05-19 08:47:40] [INFO ] Deduced a trap composed of 17 places in 77 ms of which 0 ms to minimize.
[2022-05-19 08:47:40] [INFO ] Deduced a trap composed of 17 places in 76 ms of which 1 ms to minimize.
[2022-05-19 08:47:40] [INFO ] Trap strengthening (SAT) tested/added 16/15 trap constraints in 2590 ms
[2022-05-19 08:47:40] [INFO ] After 3881ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 82 ms.
[2022-05-19 08:47:40] [INFO ] After 4391ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [(AND (NOT p2) (NOT p0) p1), (X (NOT p2)), (X (X (NOT p2))), (X (X p1)), (X (X (NOT (AND p2 p1)))), (X (X (NOT (AND p2 (NOT p1)))))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0)), (F (AND p1 p2)), (F p2), (F (NOT p1)), (F p0)]
Knowledge based reduction with 6 factoid took 361 ms. Reduced automaton from 4 states, 11 edges and 3 AP to 4 states, 11 edges and 3 AP.
Stuttering acceptance computed with spot in 114 ms :[p2, p2, (AND (NOT p1) p2), (AND (NOT p1) p2)]
Stuttering acceptance computed with spot in 147 ms :[p2, p2, (AND (NOT p1) p2), (AND (NOT p1) p2)]
Stuttering acceptance computed with spot in 156 ms :[p2, p2, (AND (NOT p1) p2), (AND (NOT p1) p2)]
Product exploration explored 100000 steps with 19 reset in 1579 ms.
Product exploration explored 100000 steps with 19 reset in 1962 ms.
Built C files in :
/tmp/ltsmin12978006432104891780
[2022-05-19 08:47:45] [INFO ] Built C files in 14ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12978006432104891780
Running compilation step : cd /tmp/ltsmin12978006432104891780;'/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/ltsmin12978006432104891780;'/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/ltsmin12978006432104891780;'/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 4 out of 2502 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2502/2502 places, 2403/2403 transitions.
Applied a total of 0 rules in 61 ms. Remains 2502 /2502 variables (removed 0) and now considering 2403/2403 (removed 0) transitions.
// Phase 1: matrix 2403 rows 2502 cols
[2022-05-19 08:47:48] [INFO ] Computed 900 place invariants in 11 ms
[2022-05-19 08:47:49] [INFO ] Implicit Places using invariants in 1248 ms returned []
// Phase 1: matrix 2403 rows 2502 cols
[2022-05-19 08:47:49] [INFO ] Computed 900 place invariants in 3 ms
[2022-05-19 08:47:52] [INFO ] Implicit Places using invariants and state equation in 3015 ms returned []
Implicit Place search using SMT with State Equation took 4268 ms to find 0 implicit places.
// Phase 1: matrix 2403 rows 2502 cols
[2022-05-19 08:47:52] [INFO ] Computed 900 place invariants in 3 ms
[2022-05-19 08:47:53] [INFO ] Dead Transitions using invariants and state equation in 1397 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 2502/2502 places, 2403/2403 transitions.
Built C files in :
/tmp/ltsmin3756655970729370384
[2022-05-19 08:47:53] [INFO ] Built C files in 23ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3756655970729370384
Running compilation step : cd /tmp/ltsmin3756655970729370384;'/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/ltsmin3756655970729370384;'/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/ltsmin3756655970729370384;'/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-19 08:47:56] [INFO ] Flatten gal took : 92 ms
[2022-05-19 08:47:57] [INFO ] Flatten gal took : 91 ms
[2022-05-19 08:47:57] [INFO ] Time to serialize gal into /tmp/LTL8026342356890638653.gal : 8 ms
[2022-05-19 08:47:57] [INFO ] Time to serialize properties into /tmp/LTL1612240680488052253.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/LTL8026342356890638653.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL1612240680488052253.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/LTL8026342...266
Read 1 LTL properties
Checking formula 0 : !((F(G((X(((G("(p428!=1)"))||("(p428==1)"))||("(p127==1)")))U(!("((p2002==1)&&(p2027==1))"))))))
Formula 0 simplified : !FG(X("(p127==1)" | "(p428==1)" | G"(p428!=1)") U !"((p2002==1)&&(p2027==1))")
Detected timeout of ITS tools.
[2022-05-19 08:48:12] [INFO ] Flatten gal took : 90 ms
[2022-05-19 08:48:12] [INFO ] Applying decomposition
[2022-05-19 08:48:12] [INFO ] Flatten gal took : 94 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/graph10895276867093964742.txt' '-o' '/tmp/graph10895276867093964742.bin' '-w' '/tmp/graph10895276867093964742.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph10895276867093964742.bin' '-l' '-1' '-v' '-w' '/tmp/graph10895276867093964742.weights' '-q' '0' '-e' '0.001'
[2022-05-19 08:48:12] [INFO ] Decomposing Gal with order
[2022-05-19 08:48:12] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-19 08:48:12] [INFO ] Removed a total of 1599 redundant transitions.
[2022-05-19 08:48:12] [INFO ] Flatten gal took : 124 ms
[2022-05-19 08:48:12] [INFO ] Fuse similar labels procedure discarded/fused a total of 1556 labels/synchronizations in 16 ms.
[2022-05-19 08:48:12] [INFO ] Time to serialize gal into /tmp/LTL17423996456514019050.gal : 14 ms
[2022-05-19 08:48:12] [INFO ] Time to serialize properties into /tmp/LTL7048874513642116421.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/LTL17423996456514019050.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL7048874513642116421.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/LTL1742399...246
Read 1 LTL properties
Checking formula 0 : !((F(G((X(((G("(i2.i0.i0.u52.p428!=1)"))||("(i2.i0.i0.u52.p428==1)"))||("(i0.u6.p127==1)")))U(!("((i14.i1.i1.u291.p2002==1)&&(i14.i1.i...179
Formula 0 simplified : !FG(X("(i0.u6.p127==1)" | "(i2.i0.i0.u52.p428==1)" | G"(i2.i0.i0.u52.p428!=1)") U !"((i14.i1.i1.u291.p2002==1)&&(i14.i1.i1.u296.p202...163
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin12516496464987088442
[2022-05-19 08:48:27] [INFO ] Built C files in 21ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12516496464987088442
Running compilation step : cd /tmp/ltsmin12516496464987088442;'/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/ltsmin12516496464987088442;'/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/ltsmin12516496464987088442;'/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)
Treatment of property ShieldIIPs-PT-100B-LTLFireability-15 finished in 145621 ms.
[2022-05-19 08:48:31] [INFO ] Flatten gal took : 144 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin9585457205926122156
[2022-05-19 08:48:31] [INFO ] Too many transitions (5208) to apply POR reductions. Disabling POR matrices.
[2022-05-19 08:48:31] [INFO ] Built C files in 32ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9585457205926122156
Running compilation step : cd /tmp/ltsmin9585457205926122156;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '180' '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-19 08:48:31] [INFO ] Applying decomposition
[2022-05-19 08:48:31] [INFO ] Flatten gal took : 144 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/graph1532767766863186295.txt' '-o' '/tmp/graph1532767766863186295.bin' '-w' '/tmp/graph1532767766863186295.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph1532767766863186295.bin' '-l' '-1' '-v' '-w' '/tmp/graph1532767766863186295.weights' '-q' '0' '-e' '0.001'
[2022-05-19 08:48:31] [INFO ] Decomposing Gal with order
[2022-05-19 08:48:31] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-19 08:48:32] [INFO ] Removed a total of 2300 redundant transitions.
[2022-05-19 08:48:33] [INFO ] Flatten gal took : 262 ms
[2022-05-19 08:48:33] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 14 ms.
[2022-05-19 08:48:33] [INFO ] Time to serialize gal into /tmp/LTLFireability14555308854692405734.gal : 109 ms
[2022-05-19 08:48:33] [INFO ] Time to serialize properties into /tmp/LTLFireability553291800981562785.ltl : 3 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/LTLFireability14555308854692405734.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability553291800981562785.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/LTLFireabi...267
Read 4 LTL properties
Checking formula 0 : !((G(X(X(F((X(X("(i20.u647.p1920==0)")))||(X(X((F("(i22.i0.i1.u702.p2085==0)"))||("(i20.u647.p1920==0)"))))))))))
Formula 0 simplified : !GXXF(XX"(i20.u647.p1920==0)" | XX("(i20.u647.p1920==0)" | F"(i22.i0.i1.u702.p2085==0)"))
Compilation finished in 18582 ms.
Running link step : cd /tmp/ltsmin9585457205926122156;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 65 ms.
Running LTSmin : cd /tmp/ltsmin9585457205926122156;'/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' '[](X(X(<>((X(X((LTLAPp0==true)))||X(X((<>((LTLAPp1==true))||(LTLAPp0==true)))))))))' '--buchi-type=spotba'
WARNING : LTSmin timed out (>900 s) on command cd /tmp/ltsmin9585457205926122156;'/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' '[](X(X(<>((X(X((LTLAPp0==true)))||X(X((<>((LTLAPp1==true))||(LTLAPp0==true)))))))))' '--buchi-type=spotba'
Running LTSmin : cd /tmp/ltsmin9585457205926122156;'/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' '<>((!([](<>((LTLAPp2==true))) U [](X((LTLAPp3==true))))||(LTLAPp4==true)))' '--buchi-type=spotba'
Detected timeout of ITS tools.
[2022-05-19 09:16:06] [INFO ] Applying decomposition
[2022-05-19 09:16:08] [INFO ] Flatten gal took : 1922 ms
[2022-05-19 09:16:09] [INFO ] Decomposing Gal with order
[2022-05-19 09:16:24] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-19 09:16:27] [INFO ] Removed a total of 1600 redundant transitions.
[2022-05-19 09:16:27] [INFO ] Flatten gal took : 664 ms
[2022-05-19 09:16:29] [INFO ] Fuse similar labels procedure discarded/fused a total of 2000 labels/synchronizations in 169 ms.
[2022-05-19 09:16:29] [INFO ] Time to serialize gal into /tmp/LTLFireability1701950935470787775.gal : 59 ms
[2022-05-19 09:16:29] [INFO ] Time to serialize properties into /tmp/LTLFireability11643660910163619957.ltl : 9 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/LTLFireability1701950935470787775.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability11643660910163619957.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/LTLFireabi...268
Read 4 LTL properties
Checking formula 0 : !((G(X(X(F((X(X("(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.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0...749
Formula 0 simplified : !GXXF(XX"(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.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0...727
WARNING : LTSmin timed out (>900 s) on command cd /tmp/ltsmin9585457205926122156;'/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' '<>((!([](<>((LTLAPp2==true))) U [](X((LTLAPp3==true))))||(LTLAPp4==true)))' '--buchi-type=spotba'
Running LTSmin : cd /tmp/ltsmin9585457205926122156;'/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' '([](X((LTLAPp5==true)))&&<>((LTLAPp6==true)))' '--buchi-type=spotba'
BK_TIME_CONFINEMENT_REACHED
--------------------
content from stderr:
+ export LANG=C
+ LANG=C
+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -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 LTLFireability -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="ShieldIIPs-PT-100B"
export BK_EXAMINATION="LTLFireability"
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 ShieldIIPs-PT-100B, examination is LTLFireability"
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-165286024800172"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/ShieldIIPs-PT-100B.tgz
mv ShieldIIPs-PT-100B execution
cd execution
if [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "UpperBounds" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] || [ "LTLFireability" = "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 [ "LTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLFireability" != "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 "LTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLFireability.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 [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLFireability"
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 ;