About the Execution of ITS-Tools for ShieldPPPs-PT-010B
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 16210.668 | 3600000.00 | 13850783.00 | 954.80 | ?FFFFFTFFTF??FFF | 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-165286025200444.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 ShieldPPPs-PT-010B, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r222-tall-165286025200444
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 396K
-rw-r--r-- 1 mcc users 6.6K Apr 30 03:44 CTLCardinality.txt
-rw-r--r-- 1 mcc users 69K Apr 30 03:44 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.1K Apr 30 03:44 CTLFireability.txt
-rw-r--r-- 1 mcc users 45K Apr 30 03:44 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 3.4K May 9 08:52 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K May 9 08:52 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K May 9 08:52 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 9 08:52 LTLFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 9 08:52 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K May 9 08:52 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 172K 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 ShieldPPPs-PT-010B-LTLFireability-00
FORMULA_NAME ShieldPPPs-PT-010B-LTLFireability-01
FORMULA_NAME ShieldPPPs-PT-010B-LTLFireability-02
FORMULA_NAME ShieldPPPs-PT-010B-LTLFireability-03
FORMULA_NAME ShieldPPPs-PT-010B-LTLFireability-04
FORMULA_NAME ShieldPPPs-PT-010B-LTLFireability-05
FORMULA_NAME ShieldPPPs-PT-010B-LTLFireability-06
FORMULA_NAME ShieldPPPs-PT-010B-LTLFireability-07
FORMULA_NAME ShieldPPPs-PT-010B-LTLFireability-08
FORMULA_NAME ShieldPPPs-PT-010B-LTLFireability-09
FORMULA_NAME ShieldPPPs-PT-010B-LTLFireability-10
FORMULA_NAME ShieldPPPs-PT-010B-LTLFireability-11
FORMULA_NAME ShieldPPPs-PT-010B-LTLFireability-12
FORMULA_NAME ShieldPPPs-PT-010B-LTLFireability-13
FORMULA_NAME ShieldPPPs-PT-010B-LTLFireability-14
FORMULA_NAME ShieldPPPs-PT-010B-LTLFireability-15
=== Now, execution of the tool begins
BK_START 1652987878683
Running Version 202205111006
[2022-05-19 19:17:59] [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 19:17:59] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-19 19:18:00] [INFO ] Load time of PNML (sax parser for PT used): 141 ms
[2022-05-19 19:18:00] [INFO ] Transformed 683 places.
[2022-05-19 19:18:00] [INFO ] Transformed 633 transitions.
[2022-05-19 19:18:00] [INFO ] Found NUPN structural information;
[2022-05-19 19:18:00] [INFO ] Parsed PT model containing 683 places and 633 transitions in 259 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 10 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 5 formulas.
FORMULA ShieldPPPs-PT-010B-LTLFireability-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPs-PT-010B-LTLFireability-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPs-PT-010B-LTLFireability-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPs-PT-010B-LTLFireability-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPs-PT-010B-LTLFireability-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 34 out of 683 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 683/683 places, 633/633 transitions.
Discarding 66 places :
Symmetric choice reduction at 0 with 66 rule applications. Total rules 66 place count 617 transition count 567
Iterating global reduction 0 with 66 rules applied. Total rules applied 132 place count 617 transition count 567
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 133 place count 616 transition count 566
Iterating global reduction 0 with 1 rules applied. Total rules applied 134 place count 616 transition count 566
Applied a total of 134 rules in 127 ms. Remains 616 /683 variables (removed 67) and now considering 566/633 (removed 67) transitions.
// Phase 1: matrix 566 rows 616 cols
[2022-05-19 19:18:00] [INFO ] Computed 111 place invariants in 25 ms
[2022-05-19 19:18:00] [INFO ] Implicit Places using invariants in 395 ms returned []
// Phase 1: matrix 566 rows 616 cols
[2022-05-19 19:18:00] [INFO ] Computed 111 place invariants in 3 ms
[2022-05-19 19:18:01] [INFO ] Implicit Places using invariants and state equation in 488 ms returned []
Implicit Place search using SMT with State Equation took 911 ms to find 0 implicit places.
// Phase 1: matrix 566 rows 616 cols
[2022-05-19 19:18:01] [INFO ] Computed 111 place invariants in 5 ms
[2022-05-19 19:18:01] [INFO ] Dead Transitions using invariants and state equation in 279 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 616/683 places, 566/633 transitions.
Finished structural reductions, in 1 iterations. Remains : 616/683 places, 566/633 transitions.
Support contains 34 out of 616 places after structural reductions.
[2022-05-19 19:18:01] [INFO ] Flatten gal took : 69 ms
[2022-05-19 19:18:01] [INFO ] Flatten gal took : 37 ms
[2022-05-19 19:18:01] [INFO ] Input system was already deterministic with 566 transitions.
Incomplete random walk after 10000 steps, including 6 resets, run finished after 312 ms. (steps per millisecond=32 ) properties (out of 26) seen :25
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 566 rows 616 cols
[2022-05-19 19:18:02] [INFO ] Computed 111 place invariants in 3 ms
[2022-05-19 19:18:02] [INFO ] [Real]Absence check using 111 positive place invariants in 33 ms returned sat
[2022-05-19 19:18:02] [INFO ] After 212ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2022-05-19 19:18:02] [INFO ] Deduced a trap composed of 18 places in 117 ms of which 4 ms to minimize.
[2022-05-19 19:18:02] [INFO ] Deduced a trap composed of 26 places in 99 ms of which 1 ms to minimize.
[2022-05-19 19:18:03] [INFO ] Deduced a trap composed of 28 places in 84 ms of which 1 ms to minimize.
[2022-05-19 19:18:03] [INFO ] Deduced a trap composed of 28 places in 76 ms of which 1 ms to minimize.
[2022-05-19 19:18:03] [INFO ] Deduced a trap composed of 29 places in 86 ms of which 0 ms to minimize.
[2022-05-19 19:18:03] [INFO ] Deduced a trap composed of 32 places in 96 ms of which 1 ms to minimize.
[2022-05-19 19:18:03] [INFO ] Deduced a trap composed of 21 places in 69 ms of which 1 ms to minimize.
[2022-05-19 19:18:03] [INFO ] Deduced a trap composed of 19 places in 75 ms of which 1 ms to minimize.
[2022-05-19 19:18:03] [INFO ] Deduced a trap composed of 18 places in 86 ms of which 1 ms to minimize.
[2022-05-19 19:18:03] [INFO ] Deduced a trap composed of 18 places in 76 ms of which 1 ms to minimize.
[2022-05-19 19:18:03] [INFO ] Deduced a trap composed of 20 places in 70 ms of which 0 ms to minimize.
[2022-05-19 19:18:03] [INFO ] Deduced a trap composed of 25 places in 73 ms of which 1 ms to minimize.
[2022-05-19 19:18:04] [INFO ] Deduced a trap composed of 25 places in 47 ms of which 1 ms to minimize.
[2022-05-19 19:18:04] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 13 trap constraints in 1398 ms
[2022-05-19 19:18:04] [INFO ] After 1617ms SMT Verify possible using trap constraints in real domain returned unsat :1 sat :0
[2022-05-19 19:18:04] [INFO ] After 1772ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0
Fused 1 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Successfully simplified 1 atomic propositions for a total of 11 simplifications.
FORMULA ShieldPPPs-PT-010B-LTLFireability-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 121 stabilizing places and 121 stable transitions
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((X(G(!(p1 U G(p2))))||p0))))'
Support contains 3 out of 616 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 616/616 places, 566/566 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 613 transition count 563
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 613 transition count 563
Applied a total of 6 rules in 55 ms. Remains 613 /616 variables (removed 3) and now considering 563/566 (removed 3) transitions.
// Phase 1: matrix 563 rows 613 cols
[2022-05-19 19:18:04] [INFO ] Computed 111 place invariants in 3 ms
[2022-05-19 19:18:04] [INFO ] Implicit Places using invariants in 174 ms returned []
// Phase 1: matrix 563 rows 613 cols
[2022-05-19 19:18:04] [INFO ] Computed 111 place invariants in 5 ms
[2022-05-19 19:18:05] [INFO ] Implicit Places using invariants and state equation in 424 ms returned []
Implicit Place search using SMT with State Equation took 614 ms to find 0 implicit places.
// Phase 1: matrix 563 rows 613 cols
[2022-05-19 19:18:05] [INFO ] Computed 111 place invariants in 3 ms
[2022-05-19 19:18:05] [INFO ] Dead Transitions using invariants and state equation in 274 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 613/616 places, 563/566 transitions.
Finished structural reductions, in 1 iterations. Remains : 613/616 places, 563/566 transitions.
Stuttering acceptance computed with spot in 280 ms :[(AND (NOT p0) p2), (AND (NOT p0) p2), p2, p2]
Running random walk in product with property : ShieldPPPs-PT-010B-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) p2), acceptance={} source=1 dest: 2}, { cond=(NOT p0), acceptance={} source=1 dest: 3}], [{ cond=p2, acceptance={0} source=2 dest: 2}], [{ cond=p2, acceptance={} source=3 dest: 2}, { cond=true, acceptance={} source=3 dest: 3}]], initial=0, aps=[p0:(OR (EQ s575 0) (EQ s589 0)), p2:(EQ s470 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 66 reset in 564 ms.
Product exploration explored 100000 steps with 69 reset in 477 ms.
Computed a total of 119 stabilizing places and 119 stable transitions
Computed a total of 119 stabilizing places and 119 stable transitions
Knowledge obtained : [(AND p0 (NOT p2)), (X (NOT (AND (NOT p0) p2))), (X p0), (X (X (NOT p2))), true, (X (X (NOT (AND (NOT p0) p2)))), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 267 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 139 ms :[(AND (NOT p0) p2), (AND (NOT p0) p2), p2, p2]
Incomplete random walk after 10000 steps, including 6 resets, run finished after 105 ms. (steps per millisecond=95 ) properties (out of 3) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 563 rows 613 cols
[2022-05-19 19:18:07] [INFO ] Computed 111 place invariants in 3 ms
[2022-05-19 19:18:07] [INFO ] After 81ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-19 19:18:07] [INFO ] [Nat]Absence check using 111 positive place invariants in 30 ms returned sat
[2022-05-19 19:18:07] [INFO ] After 202ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-19 19:18:07] [INFO ] Deduced a trap composed of 25 places in 110 ms of which 1 ms to minimize.
[2022-05-19 19:18:07] [INFO ] Deduced a trap composed of 22 places in 101 ms of which 0 ms to minimize.
[2022-05-19 19:18:08] [INFO ] Deduced a trap composed of 26 places in 104 ms of which 1 ms to minimize.
[2022-05-19 19:18:08] [INFO ] Deduced a trap composed of 19 places in 98 ms of which 0 ms to minimize.
[2022-05-19 19:18:08] [INFO ] Deduced a trap composed of 18 places in 97 ms of which 0 ms to minimize.
[2022-05-19 19:18:08] [INFO ] Deduced a trap composed of 24 places in 96 ms of which 0 ms to minimize.
[2022-05-19 19:18:08] [INFO ] Deduced a trap composed of 18 places in 73 ms of which 1 ms to minimize.
[2022-05-19 19:18:08] [INFO ] Deduced a trap composed of 22 places in 65 ms of which 1 ms to minimize.
[2022-05-19 19:18:08] [INFO ] Deduced a trap composed of 28 places in 67 ms of which 1 ms to minimize.
[2022-05-19 19:18:08] [INFO ] Deduced a trap composed of 23 places in 54 ms of which 0 ms to minimize.
[2022-05-19 19:18:08] [INFO ] Deduced a trap composed of 24 places in 59 ms of which 1 ms to minimize.
[2022-05-19 19:18:08] [INFO ] Deduced a trap composed of 18 places in 64 ms of which 1 ms to minimize.
[2022-05-19 19:18:09] [INFO ] Deduced a trap composed of 25 places in 58 ms of which 1 ms to minimize.
[2022-05-19 19:18:09] [INFO ] Deduced a trap composed of 22 places in 61 ms of which 0 ms to minimize.
[2022-05-19 19:18:09] [INFO ] Deduced a trap composed of 35 places in 51 ms of which 0 ms to minimize.
[2022-05-19 19:18:09] [INFO ] Deduced a trap composed of 32 places in 46 ms of which 1 ms to minimize.
[2022-05-19 19:18:09] [INFO ] Deduced a trap composed of 35 places in 41 ms of which 0 ms to minimize.
[2022-05-19 19:18:09] [INFO ] Deduced a trap composed of 30 places in 53 ms of which 0 ms to minimize.
[2022-05-19 19:18:09] [INFO ] Deduced a trap composed of 25 places in 54 ms of which 0 ms to minimize.
[2022-05-19 19:18:09] [INFO ] Deduced a trap composed of 35 places in 48 ms of which 0 ms to minimize.
[2022-05-19 19:18:09] [INFO ] Trap strengthening (SAT) tested/added 21/20 trap constraints in 1905 ms
[2022-05-19 19:18:09] [INFO ] After 2128ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 31 ms.
[2022-05-19 19:18:09] [INFO ] After 2303ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 5 ms.
Support contains 3 out of 613 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 613/613 places, 563/563 transitions.
Drop transitions removed 72 transitions
Trivial Post-agglo rules discarded 72 transitions
Performed 72 trivial Post agglomeration. Transition count delta: 72
Iterating post reduction 0 with 72 rules applied. Total rules applied 72 place count 613 transition count 491
Reduce places removed 72 places and 0 transitions.
Iterating post reduction 1 with 72 rules applied. Total rules applied 144 place count 541 transition count 491
Performed 50 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 50 Pre rules applied. Total rules applied 144 place count 541 transition count 441
Deduced a syphon composed of 50 places in 2 ms
Reduce places removed 50 places and 0 transitions.
Iterating global reduction 2 with 100 rules applied. Total rules applied 244 place count 491 transition count 441
Performed 178 Post agglomeration using F-continuation condition.Transition count delta: 178
Deduced a syphon composed of 178 places in 1 ms
Reduce places removed 178 places and 0 transitions.
Iterating global reduction 2 with 356 rules applied. Total rules applied 600 place count 313 transition count 263
Partial Free-agglomeration rule applied 87 times.
Drop transitions removed 87 transitions
Iterating global reduction 2 with 87 rules applied. Total rules applied 687 place count 313 transition count 263
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 688 place count 312 transition count 262
Applied a total of 688 rules in 97 ms. Remains 312 /613 variables (removed 301) and now considering 262/563 (removed 301) transitions.
Finished structural reductions, in 1 iterations. Remains : 312/613 places, 262/563 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 56 ms. (steps per millisecond=178 ) properties (out of 1) seen :0
Finished Best-First random walk after 686 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=343 )
Knowledge obtained : [(AND p0 (NOT p2)), (X (NOT (AND (NOT p0) p2))), (X p0), (X (X (NOT p2))), true, (X (X (NOT (AND (NOT p0) p2)))), (X (X p0))]
False Knowledge obtained : [(F (NOT p0)), (F p2), (F (AND p2 (NOT p0)))]
Knowledge based reduction with 7 factoid took 353 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 175 ms :[(AND (NOT p0) p2), (AND (NOT p0) p2), p2, p2]
Stuttering acceptance computed with spot in 155 ms :[(AND (NOT p0) p2), (AND (NOT p0) p2), p2, p2]
Support contains 3 out of 613 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 613/613 places, 563/563 transitions.
Applied a total of 0 rules in 17 ms. Remains 613 /613 variables (removed 0) and now considering 563/563 (removed 0) transitions.
// Phase 1: matrix 563 rows 613 cols
[2022-05-19 19:18:10] [INFO ] Computed 111 place invariants in 5 ms
[2022-05-19 19:18:10] [INFO ] Implicit Places using invariants in 195 ms returned []
// Phase 1: matrix 563 rows 613 cols
[2022-05-19 19:18:10] [INFO ] Computed 111 place invariants in 2 ms
[2022-05-19 19:18:11] [INFO ] Implicit Places using invariants and state equation in 443 ms returned []
Implicit Place search using SMT with State Equation took 640 ms to find 0 implicit places.
// Phase 1: matrix 563 rows 613 cols
[2022-05-19 19:18:11] [INFO ] Computed 111 place invariants in 2 ms
[2022-05-19 19:18:11] [INFO ] Dead Transitions using invariants and state equation in 260 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 613/613 places, 563/563 transitions.
Computed a total of 119 stabilizing places and 119 stable transitions
Computed a total of 119 stabilizing places and 119 stable transitions
Knowledge obtained : [(AND p0 (NOT p2)), (X (NOT (AND p2 (NOT p0)))), (X p0), (X (X (NOT p2))), true, (X (X (NOT (AND p2 (NOT p0))))), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 250 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 143 ms :[(AND (NOT p0) p2), (AND (NOT p0) p2), p2, p2]
Incomplete random walk after 10000 steps, including 6 resets, run finished after 93 ms. (steps per millisecond=107 ) properties (out of 3) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 563 rows 613 cols
[2022-05-19 19:18:11] [INFO ] Computed 111 place invariants in 7 ms
[2022-05-19 19:18:12] [INFO ] After 78ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-19 19:18:12] [INFO ] [Nat]Absence check using 111 positive place invariants in 21 ms returned sat
[2022-05-19 19:18:12] [INFO ] After 197ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-19 19:18:12] [INFO ] Deduced a trap composed of 25 places in 109 ms of which 4 ms to minimize.
[2022-05-19 19:18:12] [INFO ] Deduced a trap composed of 22 places in 109 ms of which 1 ms to minimize.
[2022-05-19 19:18:12] [INFO ] Deduced a trap composed of 26 places in 104 ms of which 0 ms to minimize.
[2022-05-19 19:18:12] [INFO ] Deduced a trap composed of 19 places in 98 ms of which 1 ms to minimize.
[2022-05-19 19:18:12] [INFO ] Deduced a trap composed of 18 places in 90 ms of which 0 ms to minimize.
[2022-05-19 19:18:13] [INFO ] Deduced a trap composed of 24 places in 90 ms of which 0 ms to minimize.
[2022-05-19 19:18:13] [INFO ] Deduced a trap composed of 18 places in 68 ms of which 0 ms to minimize.
[2022-05-19 19:18:13] [INFO ] Deduced a trap composed of 22 places in 68 ms of which 0 ms to minimize.
[2022-05-19 19:18:13] [INFO ] Deduced a trap composed of 28 places in 66 ms of which 0 ms to minimize.
[2022-05-19 19:18:13] [INFO ] Deduced a trap composed of 23 places in 55 ms of which 0 ms to minimize.
[2022-05-19 19:18:13] [INFO ] Deduced a trap composed of 24 places in 54 ms of which 1 ms to minimize.
[2022-05-19 19:18:13] [INFO ] Deduced a trap composed of 18 places in 58 ms of which 0 ms to minimize.
[2022-05-19 19:18:13] [INFO ] Deduced a trap composed of 25 places in 59 ms of which 1 ms to minimize.
[2022-05-19 19:18:13] [INFO ] Deduced a trap composed of 22 places in 63 ms of which 0 ms to minimize.
[2022-05-19 19:18:13] [INFO ] Deduced a trap composed of 35 places in 48 ms of which 1 ms to minimize.
[2022-05-19 19:18:13] [INFO ] Deduced a trap composed of 32 places in 50 ms of which 0 ms to minimize.
[2022-05-19 19:18:13] [INFO ] Deduced a trap composed of 35 places in 43 ms of which 1 ms to minimize.
[2022-05-19 19:18:14] [INFO ] Deduced a trap composed of 30 places in 49 ms of which 0 ms to minimize.
[2022-05-19 19:18:14] [INFO ] Deduced a trap composed of 25 places in 47 ms of which 1 ms to minimize.
[2022-05-19 19:18:14] [INFO ] Deduced a trap composed of 35 places in 46 ms of which 0 ms to minimize.
[2022-05-19 19:18:14] [INFO ] Trap strengthening (SAT) tested/added 21/20 trap constraints in 1850 ms
[2022-05-19 19:18:14] [INFO ] After 2070ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 23 ms.
[2022-05-19 19:18:14] [INFO ] After 2192ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 5 ms.
Support contains 3 out of 613 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 613/613 places, 563/563 transitions.
Drop transitions removed 72 transitions
Trivial Post-agglo rules discarded 72 transitions
Performed 72 trivial Post agglomeration. Transition count delta: 72
Iterating post reduction 0 with 72 rules applied. Total rules applied 72 place count 613 transition count 491
Reduce places removed 72 places and 0 transitions.
Iterating post reduction 1 with 72 rules applied. Total rules applied 144 place count 541 transition count 491
Performed 50 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 50 Pre rules applied. Total rules applied 144 place count 541 transition count 441
Deduced a syphon composed of 50 places in 1 ms
Reduce places removed 50 places and 0 transitions.
Iterating global reduction 2 with 100 rules applied. Total rules applied 244 place count 491 transition count 441
Performed 178 Post agglomeration using F-continuation condition.Transition count delta: 178
Deduced a syphon composed of 178 places in 0 ms
Reduce places removed 178 places and 0 transitions.
Iterating global reduction 2 with 356 rules applied. Total rules applied 600 place count 313 transition count 263
Partial Free-agglomeration rule applied 87 times.
Drop transitions removed 87 transitions
Iterating global reduction 2 with 87 rules applied. Total rules applied 687 place count 313 transition count 263
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 688 place count 312 transition count 262
Applied a total of 688 rules in 67 ms. Remains 312 /613 variables (removed 301) and now considering 262/563 (removed 301) transitions.
Finished structural reductions, in 1 iterations. Remains : 312/613 places, 262/563 transitions.
Finished random walk after 3690 steps, including 1 resets, run visited all 1 properties in 16 ms. (steps per millisecond=230 )
Knowledge obtained : [(AND p0 (NOT p2)), (X (NOT (AND p2 (NOT p0)))), (X p0), (X (X (NOT p2))), true, (X (X (NOT (AND p2 (NOT p0))))), (X (X p0))]
False Knowledge obtained : [(F (NOT p0)), (F p2), (F (AND p2 (NOT p0)))]
Knowledge based reduction with 7 factoid took 282 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 136 ms :[(AND (NOT p0) p2), (AND (NOT p0) p2), p2, p2]
Stuttering acceptance computed with spot in 147 ms :[(AND (NOT p0) p2), (AND (NOT p0) p2), p2, p2]
Stuttering acceptance computed with spot in 148 ms :[(AND (NOT p0) p2), (AND (NOT p0) p2), p2, p2]
Product exploration explored 100000 steps with 68 reset in 363 ms.
Product exploration explored 100000 steps with 70 reset in 410 ms.
Applying partial POR strategy [false, true, true, true]
Stuttering acceptance computed with spot in 152 ms :[(AND (NOT p0) p2), (AND (NOT p0) p2), p2, p2]
Support contains 3 out of 613 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 613/613 places, 563/563 transitions.
Performed 71 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 71 rules applied. Total rules applied 71 place count 613 transition count 563
Performed 21 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 21 Pre rules applied. Total rules applied 71 place count 613 transition count 564
Deduced a syphon composed of 92 places in 0 ms
Iterating global reduction 1 with 21 rules applied. Total rules applied 92 place count 613 transition count 564
Performed 208 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 300 places in 0 ms
Iterating global reduction 1 with 208 rules applied. Total rules applied 300 place count 613 transition count 564
Discarding 72 places :
Symmetric choice reduction at 1 with 72 rule applications. Total rules 372 place count 541 transition count 492
Deduced a syphon composed of 228 places in 1 ms
Iterating global reduction 1 with 72 rules applied. Total rules applied 444 place count 541 transition count 492
Deduced a syphon composed of 228 places in 0 ms
Applied a total of 444 rules in 117 ms. Remains 541 /613 variables (removed 72) and now considering 492/563 (removed 71) transitions.
[2022-05-19 19:18:16] [INFO ] Redundant transitions in 34 ms returned []
// Phase 1: matrix 492 rows 541 cols
[2022-05-19 19:18:16] [INFO ] Computed 111 place invariants in 6 ms
[2022-05-19 19:18:16] [INFO ] Dead Transitions using invariants and state equation in 241 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 541/613 places, 492/563 transitions.
Finished structural reductions, in 1 iterations. Remains : 541/613 places, 492/563 transitions.
Product exploration explored 100000 steps with 151 reset in 441 ms.
Product exploration explored 100000 steps with 154 reset in 454 ms.
Built C files in :
/tmp/ltsmin16133220050393499336
[2022-05-19 19:18:17] [INFO ] Built C files in 27ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16133220050393499336
Running compilation step : cd /tmp/ltsmin16133220050393499336;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 984 ms.
Running link step : cd /tmp/ltsmin16133220050393499336;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 45 ms.
Running LTSmin : cd /tmp/ltsmin16133220050393499336;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased6204806422816913698.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 3 out of 613 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 613/613 places, 563/563 transitions.
Applied a total of 0 rules in 27 ms. Remains 613 /613 variables (removed 0) and now considering 563/563 (removed 0) transitions.
// Phase 1: matrix 563 rows 613 cols
[2022-05-19 19:18:32] [INFO ] Computed 111 place invariants in 4 ms
[2022-05-19 19:18:32] [INFO ] Implicit Places using invariants in 185 ms returned []
// Phase 1: matrix 563 rows 613 cols
[2022-05-19 19:18:32] [INFO ] Computed 111 place invariants in 2 ms
[2022-05-19 19:18:33] [INFO ] Implicit Places using invariants and state equation in 438 ms returned []
Implicit Place search using SMT with State Equation took 625 ms to find 0 implicit places.
// Phase 1: matrix 563 rows 613 cols
[2022-05-19 19:18:33] [INFO ] Computed 111 place invariants in 5 ms
[2022-05-19 19:18:33] [INFO ] Dead Transitions using invariants and state equation in 280 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 613/613 places, 563/563 transitions.
Built C files in :
/tmp/ltsmin5578821301905056684
[2022-05-19 19:18:33] [INFO ] Built C files in 11ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5578821301905056684
Running compilation step : cd /tmp/ltsmin5578821301905056684;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 814 ms.
Running link step : cd /tmp/ltsmin5578821301905056684;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 32 ms.
Running LTSmin : cd /tmp/ltsmin5578821301905056684;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased8757536658036193706.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2022-05-19 19:18:48] [INFO ] Flatten gal took : 31 ms
[2022-05-19 19:18:48] [INFO ] Flatten gal took : 27 ms
[2022-05-19 19:18:48] [INFO ] Time to serialize gal into /tmp/LTL1997392326858132525.gal : 7 ms
[2022-05-19 19:18:48] [INFO ] Time to serialize properties into /tmp/LTL14651936677635833825.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/LTL1997392326858132525.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL14651936677635833825.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/LTL1997392...267
Read 1 LTL properties
Checking formula 0 : !((X(G(((X(G(!(("((p637==1)&&(p652==1))")U(G("(p519==1)"))))))||("(p637==0)"))||("(p652==0)")))))
Formula 0 simplified : !XG("(p637==0)" | "(p652==0)" | XG!("((p637==1)&&(p652==1))" U G"(p519==1)"))
Detected timeout of ITS tools.
[2022-05-19 19:19:03] [INFO ] Flatten gal took : 28 ms
[2022-05-19 19:19:03] [INFO ] Applying decomposition
[2022-05-19 19:19:03] [INFO ] Flatten gal took : 24 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/graph4878045864040054709.txt' '-o' '/tmp/graph4878045864040054709.bin' '-w' '/tmp/graph4878045864040054709.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph4878045864040054709.bin' '-l' '-1' '-v' '-w' '/tmp/graph4878045864040054709.weights' '-q' '0' '-e' '0.001'
[2022-05-19 19:19:04] [INFO ] Decomposing Gal with order
[2022-05-19 19:19:04] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-19 19:19:04] [INFO ] Removed a total of 90 redundant transitions.
[2022-05-19 19:19:04] [INFO ] Flatten gal took : 82 ms
[2022-05-19 19:19:04] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 11 ms.
[2022-05-19 19:19:04] [INFO ] Time to serialize gal into /tmp/LTL723523570781977904.gal : 12 ms
[2022-05-19 19:19:04] [INFO ] Time to serialize properties into /tmp/LTL14217330603700801837.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/LTL723523570781977904.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL14217330603700801837.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/LTL7235235...245
Read 1 LTL properties
Checking formula 0 : !((X(G(((X(G(!(("((i10.i0.i1.u225.p637==1)&&(i10.i0.i2.u230.p652==1))")U(G("(i8.i2.i1.u185.p519==1)"))))))||("(i10.i0.i1.u225.p637==0)...192
Formula 0 simplified : !XG("(i10.i0.i1.u225.p637==0)" | "(i10.i0.i2.u230.p652==0)" | XG!("((i10.i0.i1.u225.p637==1)&&(i10.i0.i2.u230.p652==1))" U G"(i8.i2....174
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin9767412892762197883
[2022-05-19 19:19:19] [INFO ] Built C files in 15ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9767412892762197883
Running compilation step : cd /tmp/ltsmin9767412892762197883;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 836 ms.
Running link step : cd /tmp/ltsmin9767412892762197883;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 37 ms.
Running LTSmin : cd /tmp/ltsmin9767412892762197883;'/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([](!((LTLAPp1==true) U []((LTLAPp2==true)))))||(LTLAPp0==true))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property ShieldPPPs-PT-010B-LTLFireability-00 finished in 90021 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G((X(X(p0))||G(((X(p1)||p2)&&X(p3))))))'
Support contains 5 out of 616 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 616/616 places, 566/566 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 613 transition count 563
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 613 transition count 563
Applied a total of 6 rules in 19 ms. Remains 613 /616 variables (removed 3) and now considering 563/566 (removed 3) transitions.
// Phase 1: matrix 563 rows 613 cols
[2022-05-19 19:19:34] [INFO ] Computed 111 place invariants in 3 ms
[2022-05-19 19:19:34] [INFO ] Implicit Places using invariants in 190 ms returned []
// Phase 1: matrix 563 rows 613 cols
[2022-05-19 19:19:34] [INFO ] Computed 111 place invariants in 1 ms
[2022-05-19 19:19:35] [INFO ] Implicit Places using invariants and state equation in 389 ms returned []
Implicit Place search using SMT with State Equation took 581 ms to find 0 implicit places.
// Phase 1: matrix 563 rows 613 cols
[2022-05-19 19:19:35] [INFO ] Computed 111 place invariants in 3 ms
[2022-05-19 19:19:35] [INFO ] Dead Transitions using invariants and state equation in 261 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 613/616 places, 563/566 transitions.
Finished structural reductions, in 1 iterations. Remains : 613/616 places, 563/566 transitions.
Stuttering acceptance computed with spot in 378 ms :[(OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p3))), (OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p3))), (AND p3 (NOT p1) (NOT p0)), (AND p3 (NOT p0)), true, (AND (NOT p0) (NOT p3)), (AND p3 (NOT p1) (NOT p0)), (OR (AND p0 (NOT p1) (NOT p2)) (AND p0 (NOT p3))), (AND p3 (NOT p1) p0)]
Running random walk in product with property : ShieldPPPs-PT-010B-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=true, acceptance={} source=0 dest: 1}, { cond=(NOT p2), acceptance={} source=0 dest: 2}], [{ cond=(NOT p3), acceptance={} source=1 dest: 3}, { cond=true, acceptance={} source=1 dest: 5}, { cond=(AND (NOT p2) p3), acceptance={} source=1 dest: 6}], [{ cond=(AND p3 (NOT p1)), acceptance={} source=2 dest: 3}], [{ cond=(AND p3 (NOT p0)), acceptance={} source=3 dest: 4}], [{ cond=true, acceptance={0} source=4 dest: 4}], [{ cond=(AND (NOT p3) (NOT p0)), acceptance={} source=5 dest: 4}, { cond=(AND p3 (NOT p0)), acceptance={} source=5 dest: 7}, { cond=(AND (NOT p2) p3 (NOT p0)), acceptance={} source=5 dest: 8}], [{ cond=(AND p3 (NOT p1) (NOT p0)), acceptance={} source=6 dest: 4}], [{ cond=(AND (NOT p3) p0), acceptance={} source=7 dest: 4}, { cond=(AND p3 p0), acceptance={} source=7 dest: 7}, { cond=(AND (NOT p2) p3 p0), acceptance={} source=7 dest: 8}], [{ cond=(AND p3 (NOT p1) p0), acceptance={} source=8 dest: 4}]], initial=0, aps=[p2:(EQ s110 1), p3:(EQ s76 1), p1:(AND (EQ s389 1) (EQ s391 1)), p0:(EQ s368 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 9 steps with 2 reset in 1 ms.
FORMULA ShieldPPPs-PT-010B-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldPPPs-PT-010B-LTLFireability-03 finished in 1272 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((G(X(p0))||X((p1 U X(p2)))||G(p1)))'
Support contains 5 out of 616 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 616/616 places, 566/566 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 612 transition count 562
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 612 transition count 562
Applied a total of 8 rules in 22 ms. Remains 612 /616 variables (removed 4) and now considering 562/566 (removed 4) transitions.
// Phase 1: matrix 562 rows 612 cols
[2022-05-19 19:19:35] [INFO ] Computed 111 place invariants in 4 ms
[2022-05-19 19:19:35] [INFO ] Implicit Places using invariants in 171 ms returned []
// Phase 1: matrix 562 rows 612 cols
[2022-05-19 19:19:35] [INFO ] Computed 111 place invariants in 2 ms
[2022-05-19 19:19:36] [INFO ] Implicit Places using invariants and state equation in 423 ms returned []
Implicit Place search using SMT with State Equation took 596 ms to find 0 implicit places.
// Phase 1: matrix 562 rows 612 cols
[2022-05-19 19:19:36] [INFO ] Computed 111 place invariants in 2 ms
[2022-05-19 19:19:36] [INFO ] Dead Transitions using invariants and state equation in 254 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 612/616 places, 562/566 transitions.
Finished structural reductions, in 1 iterations. Remains : 612/616 places, 562/566 transitions.
Stuttering acceptance computed with spot in 483 ms :[true, (AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p0) (NOT p1)), (NOT p0), (NOT p2), (NOT p2)]
Running random walk in product with property : ShieldPPPs-PT-010B-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p1), acceptance={} source=1 dest: 2}, { cond=p1, acceptance={} source=1 dest: 3}], [{ cond=(AND (NOT p1) p0), acceptance={} source=2 dest: 4}, { cond=(AND p1 p0), acceptance={} source=2 dest: 5}, { cond=(AND p1 (NOT p0)), acceptance={} source=2 dest: 9}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=2 dest: 10}], [{ cond=(AND (NOT p1) p0), acceptance={} source=3 dest: 4}, { cond=(AND p1 (NOT p0)), acceptance={} source=3 dest: 6}, { cond=(AND p1 p0), acceptance={} source=3 dest: 7}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=3 dest: 10}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=4 dest: 0}, { cond=(AND p0 (NOT p2)), acceptance={} source=4 dest: 8}], [{ cond=(AND (NOT p1) p0 (NOT p2)), acceptance={} source=5 dest: 4}, { cond=(AND p1 p0 (NOT p2)), acceptance={} source=5 dest: 5}, { cond=(AND p1 (NOT p0) (NOT p2)), acceptance={} source=5 dest: 9}, { cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={} source=5 dest: 10}], [{ cond=(AND p1 (NOT p2)), acceptance={} source=6 dest: 6}, { cond=(AND (NOT p1) (NOT p2)), acceptance={} source=6 dest: 10}], [{ cond=(AND (NOT p1) p0 (NOT p2)), acceptance={} source=7 dest: 4}, { cond=(AND p1 (NOT p0) (NOT p2)), acceptance={} source=7 dest: 6}, { cond=(AND p1 p0 (NOT p2)), acceptance={} source=7 dest: 7}, { cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={} source=7 dest: 10}], [{ cond=(NOT p0), acceptance={} source=8 dest: 0}, { cond=p0, acceptance={} source=8 dest: 8}], [{ cond=(AND p1 (NOT p2)), acceptance={0} source=9 dest: 9}, { cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=9 dest: 10}], [{ cond=(NOT p2), acceptance={} source=10 dest: 0}]], initial=1, aps=[p1:(AND (EQ s403 1) (EQ s422 1)), p0:(AND (EQ s107 1) (EQ s151 1)), p2:(AND (NOT (AND (EQ s403 1) (EQ s422 1))) (EQ s16 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA ShieldPPPs-PT-010B-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldPPPs-PT-010B-LTLFireability-05 finished in 1383 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(X(((X(p0) U p0)&&(p1 U (p1 U p2))))))'
Support contains 4 out of 616 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 616/616 places, 566/566 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 612 transition count 562
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 612 transition count 562
Applied a total of 8 rules in 34 ms. Remains 612 /616 variables (removed 4) and now considering 562/566 (removed 4) transitions.
// Phase 1: matrix 562 rows 612 cols
[2022-05-19 19:19:37] [INFO ] Computed 111 place invariants in 8 ms
[2022-05-19 19:19:37] [INFO ] Implicit Places using invariants in 174 ms returned []
// Phase 1: matrix 562 rows 612 cols
[2022-05-19 19:19:37] [INFO ] Computed 111 place invariants in 2 ms
[2022-05-19 19:19:37] [INFO ] Implicit Places using invariants and state equation in 424 ms returned []
Implicit Place search using SMT with State Equation took 600 ms to find 0 implicit places.
// Phase 1: matrix 562 rows 612 cols
[2022-05-19 19:19:37] [INFO ] Computed 111 place invariants in 3 ms
[2022-05-19 19:19:37] [INFO ] Dead Transitions using invariants and state equation in 243 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 612/616 places, 562/566 transitions.
Finished structural reductions, in 1 iterations. Remains : 612/616 places, 562/566 transitions.
Stuttering acceptance computed with spot in 161 ms :[(OR (NOT p2) (NOT p0)), (NOT p2), (NOT p0), (OR (NOT p0) (NOT p2))]
Running random walk in product with property : ShieldPPPs-PT-010B-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 3}], [{ cond=(AND (NOT p2) p1), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=1 dest: 3}], [{ cond=(AND p2 (NOT p0)), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p2) (NOT p0)), acceptance={0} source=2 dest: 3}], [{ cond=(AND (NOT p2) p1 p0), acceptance={0} source=3 dest: 1}, { cond=(AND p2 (NOT p0)), acceptance={0} source=3 dest: 2}, { cond=(OR (AND (NOT p2) (NOT p1)) (AND (NOT p2) (NOT p0))), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p2:(EQ s573 1), p1:(AND (EQ s569 1) (EQ s600 1)), p0:(EQ s552 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, null][false, false, false, false]]
Stuttering criterion allowed to conclude after 4065 steps with 5 reset in 26 ms.
FORMULA ShieldPPPs-PT-010B-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldPPPs-PT-010B-LTLFireability-07 finished in 1092 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(X((p0 U p1))))'
Support contains 2 out of 616 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 616/616 places, 566/566 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 612 transition count 562
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 612 transition count 562
Applied a total of 8 rules in 16 ms. Remains 612 /616 variables (removed 4) and now considering 562/566 (removed 4) transitions.
// Phase 1: matrix 562 rows 612 cols
[2022-05-19 19:19:38] [INFO ] Computed 111 place invariants in 4 ms
[2022-05-19 19:19:38] [INFO ] Implicit Places using invariants in 182 ms returned []
// Phase 1: matrix 562 rows 612 cols
[2022-05-19 19:19:38] [INFO ] Computed 111 place invariants in 10 ms
[2022-05-19 19:19:38] [INFO ] Implicit Places using invariants and state equation in 416 ms returned []
Implicit Place search using SMT with State Equation took 599 ms to find 0 implicit places.
// Phase 1: matrix 562 rows 612 cols
[2022-05-19 19:19:38] [INFO ] Computed 111 place invariants in 2 ms
[2022-05-19 19:19:39] [INFO ] Dead Transitions using invariants and state equation in 239 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 612/616 places, 562/566 transitions.
Finished structural reductions, in 1 iterations. Remains : 612/616 places, 562/566 transitions.
Stuttering acceptance computed with spot in 131 ms :[(NOT p1), (NOT p1), true, (NOT p1)]
Running random walk in product with property : ShieldPPPs-PT-010B-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(OR p1 p0), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p1) p0), acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=3 dest: 2}, { cond=(AND (NOT p1) p0), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p1:(EQ s530 1), p0:(EQ s77 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA ShieldPPPs-PT-010B-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldPPPs-PT-010B-LTLFireability-08 finished in 1002 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F((F(p0) U G(F((G(p1)&&p0))))))'
Support contains 2 out of 616 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 616/616 places, 566/566 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 71 transitions
Trivial Post-agglo rules discarded 71 transitions
Performed 71 trivial Post agglomeration. Transition count delta: 71
Iterating post reduction 0 with 71 rules applied. Total rules applied 71 place count 615 transition count 494
Reduce places removed 71 places and 0 transitions.
Iterating post reduction 1 with 71 rules applied. Total rules applied 142 place count 544 transition count 494
Performed 50 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 50 Pre rules applied. Total rules applied 142 place count 544 transition count 444
Deduced a syphon composed of 50 places in 0 ms
Reduce places removed 50 places and 0 transitions.
Iterating global reduction 2 with 100 rules applied. Total rules applied 242 place count 494 transition count 444
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 245 place count 491 transition count 441
Iterating global reduction 2 with 3 rules applied. Total rules applied 248 place count 491 transition count 441
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 248 place count 491 transition count 440
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 250 place count 490 transition count 440
Performed 176 Post agglomeration using F-continuation condition.Transition count delta: 176
Deduced a syphon composed of 176 places in 0 ms
Reduce places removed 176 places and 0 transitions.
Iterating global reduction 2 with 352 rules applied. Total rules applied 602 place count 314 transition count 264
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 603 place count 313 transition count 263
Applied a total of 603 rules in 53 ms. Remains 313 /616 variables (removed 303) and now considering 263/566 (removed 303) transitions.
// Phase 1: matrix 263 rows 313 cols
[2022-05-19 19:19:39] [INFO ] Computed 111 place invariants in 1 ms
[2022-05-19 19:19:39] [INFO ] Implicit Places using invariants in 122 ms returned []
// Phase 1: matrix 263 rows 313 cols
[2022-05-19 19:19:39] [INFO ] Computed 111 place invariants in 1 ms
[2022-05-19 19:19:39] [INFO ] Implicit Places using invariants and state equation in 235 ms returned []
Implicit Place search using SMT with State Equation took 360 ms to find 0 implicit places.
[2022-05-19 19:19:39] [INFO ] Redundant transitions in 3 ms returned []
// Phase 1: matrix 263 rows 313 cols
[2022-05-19 19:19:39] [INFO ] Computed 111 place invariants in 1 ms
[2022-05-19 19:19:39] [INFO ] Dead Transitions using invariants and state equation in 131 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 313/616 places, 263/566 transitions.
Finished structural reductions, in 1 iterations. Remains : 313/616 places, 263/566 transitions.
Stuttering acceptance computed with spot in 111 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0)), (NOT p1)]
Running random walk in product with property : ShieldPPPs-PT-010B-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(OR (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}], [{ cond=(OR (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}, { cond=(AND p0 p1), acceptance={} source=1 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 1}, { cond=p1, acceptance={} source=2 dest: 2}]], initial=0, aps=[p0:(EQ s19 1), p1:(NEQ s283 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Product exploration explored 100000 steps with 140 reset in 429 ms.
Product exploration explored 100000 steps with 140 reset in 448 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/313 stabilizing places and 2/263 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND p0 p1))), (X (OR (NOT p0) (NOT p1))), (X (X (NOT (AND p0 p1)))), (X (X p1)), (X (X (OR (NOT p0) (NOT p1)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 279 ms. Reduced automaton from 3 states, 6 edges and 2 AP to 3 states, 6 edges and 2 AP.
Stuttering acceptance computed with spot in 120 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0)), (NOT p1)]
Finished random walk after 489 steps, including 0 resets, run visited all 3 properties in 13 ms. (steps per millisecond=37 )
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND p0 p1))), (X (OR (NOT p0) (NOT p1))), (X (X (NOT (AND p0 p1)))), (X (X p1)), (X (X (OR (NOT p0) (NOT p1)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F (NOT (OR (NOT p0) (NOT p1)))), (F (NOT p1)), (F (AND p0 p1))]
Knowledge based reduction with 7 factoid took 344 ms. Reduced automaton from 3 states, 6 edges and 2 AP to 3 states, 6 edges and 2 AP.
Stuttering acceptance computed with spot in 124 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0)), (NOT p1)]
Stuttering acceptance computed with spot in 164 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0)), (NOT p1)]
// Phase 1: matrix 263 rows 313 cols
[2022-05-19 19:19:41] [INFO ] Computed 111 place invariants in 11 ms
[2022-05-19 19:19:41] [INFO ] [Real]Absence check using 111 positive place invariants in 30 ms returned sat
[2022-05-19 19:19:41] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-19 19:19:42] [INFO ] [Real]Absence check using state equation in 203 ms returned sat
[2022-05-19 19:19:42] [INFO ] Solution in real domain found non-integer solution.
[2022-05-19 19:19:42] [INFO ] [Nat]Absence check using 111 positive place invariants in 25 ms returned sat
[2022-05-19 19:19:42] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-19 19:19:42] [INFO ] [Nat]Absence check using state equation in 245 ms returned sat
[2022-05-19 19:19:42] [INFO ] Computed and/alt/rep : 262/529/262 causal constraints (skipped 0 transitions) in 14 ms.
[2022-05-19 19:19:44] [INFO ] Added : 261 causal constraints over 53 iterations in 2417 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 2 out of 313 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 313/313 places, 263/263 transitions.
Applied a total of 0 rules in 15 ms. Remains 313 /313 variables (removed 0) and now considering 263/263 (removed 0) transitions.
// Phase 1: matrix 263 rows 313 cols
[2022-05-19 19:19:45] [INFO ] Computed 111 place invariants in 1 ms
[2022-05-19 19:19:45] [INFO ] Implicit Places using invariants in 141 ms returned []
// Phase 1: matrix 263 rows 313 cols
[2022-05-19 19:19:45] [INFO ] Computed 111 place invariants in 2 ms
[2022-05-19 19:19:45] [INFO ] Implicit Places using invariants and state equation in 241 ms returned []
Implicit Place search using SMT with State Equation took 384 ms to find 0 implicit places.
[2022-05-19 19:19:45] [INFO ] Redundant transitions in 2 ms returned []
// Phase 1: matrix 263 rows 313 cols
[2022-05-19 19:19:45] [INFO ] Computed 111 place invariants in 1 ms
[2022-05-19 19:19:45] [INFO ] Dead Transitions using invariants and state equation in 131 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 313/313 places, 263/263 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/313 stabilizing places and 2/263 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND p0 p1))), (X (OR (NOT p0) (NOT p1))), (X (X (NOT (AND p0 p1)))), (X (X p1)), (X (X (OR (NOT p0) (NOT p1)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 222 ms. Reduced automaton from 3 states, 6 edges and 2 AP to 3 states, 6 edges and 2 AP.
Stuttering acceptance computed with spot in 112 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0)), (NOT p1)]
Finished random walk after 337 steps, including 0 resets, run visited all 3 properties in 8 ms. (steps per millisecond=42 )
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND p0 p1))), (X (OR (NOT p0) (NOT p1))), (X (X (NOT (AND p0 p1)))), (X (X p1)), (X (X (OR (NOT p0) (NOT p1)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F (NOT (OR (NOT p0) (NOT p1)))), (F (NOT p1)), (F (AND p0 p1))]
Knowledge based reduction with 7 factoid took 277 ms. Reduced automaton from 3 states, 6 edges and 2 AP to 3 states, 6 edges and 2 AP.
Stuttering acceptance computed with spot in 104 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0)), (NOT p1)]
Stuttering acceptance computed with spot in 110 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0)), (NOT p1)]
// Phase 1: matrix 263 rows 313 cols
[2022-05-19 19:19:46] [INFO ] Computed 111 place invariants in 1 ms
[2022-05-19 19:19:46] [INFO ] [Real]Absence check using 111 positive place invariants in 26 ms returned sat
[2022-05-19 19:19:46] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-19 19:19:46] [INFO ] [Real]Absence check using state equation in 216 ms returned sat
[2022-05-19 19:19:46] [INFO ] Solution in real domain found non-integer solution.
[2022-05-19 19:19:46] [INFO ] [Nat]Absence check using 111 positive place invariants in 25 ms returned sat
[2022-05-19 19:19:46] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-19 19:19:47] [INFO ] [Nat]Absence check using state equation in 246 ms returned sat
[2022-05-19 19:19:47] [INFO ] Computed and/alt/rep : 262/529/262 causal constraints (skipped 0 transitions) in 16 ms.
[2022-05-19 19:19:49] [INFO ] Added : 261 causal constraints over 53 iterations in 2428 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 122 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0)), (NOT p1)]
Product exploration explored 100000 steps with 141 reset in 379 ms.
Product exploration explored 100000 steps with 142 reset in 431 ms.
Built C files in :
/tmp/ltsmin16304241360974075174
[2022-05-19 19:19:50] [INFO ] Computing symmetric may disable matrix : 263 transitions.
[2022-05-19 19:19:50] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-19 19:19:50] [INFO ] Computing symmetric may enable matrix : 263 transitions.
[2022-05-19 19:19:50] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-19 19:19:50] [INFO ] Computing Do-Not-Accords matrix : 263 transitions.
[2022-05-19 19:19:50] [INFO ] Computation of Completed DNA matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-19 19:19:50] [INFO ] Built C files in 34ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16304241360974075174
Running compilation step : cd /tmp/ltsmin16304241360974075174;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 514 ms.
Running link step : cd /tmp/ltsmin16304241360974075174;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 32 ms.
Running LTSmin : cd /tmp/ltsmin16304241360974075174;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased14831233395499091538.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 2 out of 313 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 313/313 places, 263/263 transitions.
Applied a total of 0 rules in 12 ms. Remains 313 /313 variables (removed 0) and now considering 263/263 (removed 0) transitions.
// Phase 1: matrix 263 rows 313 cols
[2022-05-19 19:20:05] [INFO ] Computed 111 place invariants in 1 ms
[2022-05-19 19:20:05] [INFO ] Implicit Places using invariants in 137 ms returned []
// Phase 1: matrix 263 rows 313 cols
[2022-05-19 19:20:05] [INFO ] Computed 111 place invariants in 2 ms
[2022-05-19 19:20:06] [INFO ] Implicit Places using invariants and state equation in 241 ms returned []
Implicit Place search using SMT with State Equation took 379 ms to find 0 implicit places.
[2022-05-19 19:20:06] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 263 rows 313 cols
[2022-05-19 19:20:06] [INFO ] Computed 111 place invariants in 1 ms
[2022-05-19 19:20:06] [INFO ] Dead Transitions using invariants and state equation in 127 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 313/313 places, 263/263 transitions.
Built C files in :
/tmp/ltsmin3011683295807538969
[2022-05-19 19:20:06] [INFO ] Computing symmetric may disable matrix : 263 transitions.
[2022-05-19 19:20:06] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-19 19:20:06] [INFO ] Computing symmetric may enable matrix : 263 transitions.
[2022-05-19 19:20:06] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-19 19:20:06] [INFO ] Computing Do-Not-Accords matrix : 263 transitions.
[2022-05-19 19:20:06] [INFO ] Computation of Completed DNA matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-19 19:20:06] [INFO ] Built C files in 20ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3011683295807538969
Running compilation step : cd /tmp/ltsmin3011683295807538969;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 519 ms.
Running link step : cd /tmp/ltsmin3011683295807538969;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 31 ms.
Running LTSmin : cd /tmp/ltsmin3011683295807538969;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased14320317264692227463.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2022-05-19 19:20:21] [INFO ] Flatten gal took : 13 ms
[2022-05-19 19:20:21] [INFO ] Flatten gal took : 11 ms
[2022-05-19 19:20:21] [INFO ] Time to serialize gal into /tmp/LTL14394414044314603128.gal : 2 ms
[2022-05-19 19:20:21] [INFO ] Time to serialize properties into /tmp/LTL14290610241939764238.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/LTL14394414044314603128.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL14290610241939764238.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/LTL1439441...268
Read 1 LTL properties
Checking formula 0 : !((F((F("(p46==1)"))U(G(F((G("(p617!=1)"))&&("(p46==1)")))))))
Formula 0 simplified : !F(F"(p46==1)" U GF("(p46==1)" & G"(p617!=1)"))
Detected timeout of ITS tools.
[2022-05-19 19:20:36] [INFO ] Flatten gal took : 16 ms
[2022-05-19 19:20:36] [INFO ] Applying decomposition
[2022-05-19 19:20:36] [INFO ] Flatten gal took : 11 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/graph13205308131647446178.txt' '-o' '/tmp/graph13205308131647446178.bin' '-w' '/tmp/graph13205308131647446178.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph13205308131647446178.bin' '-l' '-1' '-v' '-w' '/tmp/graph13205308131647446178.weights' '-q' '0' '-e' '0.001'
[2022-05-19 19:20:36] [INFO ] Decomposing Gal with order
[2022-05-19 19:20:36] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-19 19:20:36] [INFO ] Removed a total of 61 redundant transitions.
[2022-05-19 19:20:36] [INFO ] Flatten gal took : 19 ms
[2022-05-19 19:20:36] [INFO ] Fuse similar labels procedure discarded/fused a total of 116 labels/synchronizations in 6 ms.
[2022-05-19 19:20:36] [INFO ] Time to serialize gal into /tmp/LTL6183995962074513238.gal : 2 ms
[2022-05-19 19:20:36] [INFO ] Time to serialize properties into /tmp/LTL2786625155708979938.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/LTL6183995962074513238.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL2786625155708979938.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/LTL6183995...245
Read 1 LTL properties
Checking formula 0 : !((F((F("(i0.i0.u8.p46==1)"))U(G(F((G("(i9.i2.u101.p617!=1)"))&&("(i0.i0.u8.p46==1)")))))))
Formula 0 simplified : !F(F"(i0.i0.u8.p46==1)" U GF("(i0.i0.u8.p46==1)" & G"(i9.i2.u101.p617!=1)"))
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin14606757062276016645
[2022-05-19 19:20:51] [INFO ] Built C files in 5ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14606757062276016645
Running compilation step : cd /tmp/ltsmin14606757062276016645;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 410 ms.
Running link step : cd /tmp/ltsmin14606757062276016645;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 35 ms.
Running LTSmin : cd /tmp/ltsmin14606757062276016645;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '<>((<>((LTLAPp0==true)) U [](<>(([]((LTLAPp1==true))&&(LTLAPp0==true))))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property ShieldPPPs-PT-010B-LTLFireability-11 finished in 87502 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(G(F(G(p0))))))'
Support contains 1 out of 616 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 616/616 places, 566/566 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 72 transitions
Trivial Post-agglo rules discarded 72 transitions
Performed 72 trivial Post agglomeration. Transition count delta: 72
Iterating post reduction 0 with 72 rules applied. Total rules applied 72 place count 615 transition count 493
Reduce places removed 72 places and 0 transitions.
Iterating post reduction 1 with 72 rules applied. Total rules applied 144 place count 543 transition count 493
Performed 50 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 50 Pre rules applied. Total rules applied 144 place count 543 transition count 443
Deduced a syphon composed of 50 places in 1 ms
Reduce places removed 50 places and 0 transitions.
Iterating global reduction 2 with 100 rules applied. Total rules applied 244 place count 493 transition count 443
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 248 place count 489 transition count 439
Iterating global reduction 2 with 4 rules applied. Total rules applied 252 place count 489 transition count 439
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 252 place count 489 transition count 437
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 256 place count 487 transition count 437
Performed 173 Post agglomeration using F-continuation condition.Transition count delta: 173
Deduced a syphon composed of 173 places in 0 ms
Reduce places removed 173 places and 0 transitions.
Iterating global reduction 2 with 346 rules applied. Total rules applied 602 place count 314 transition count 264
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 604 place count 312 transition count 262
Applied a total of 604 rules in 42 ms. Remains 312 /616 variables (removed 304) and now considering 262/566 (removed 304) transitions.
// Phase 1: matrix 262 rows 312 cols
[2022-05-19 19:21:06] [INFO ] Computed 111 place invariants in 1 ms
[2022-05-19 19:21:06] [INFO ] Implicit Places using invariants in 133 ms returned []
// Phase 1: matrix 262 rows 312 cols
[2022-05-19 19:21:06] [INFO ] Computed 111 place invariants in 1 ms
[2022-05-19 19:21:07] [INFO ] Implicit Places using invariants and state equation in 227 ms returned []
Implicit Place search using SMT with State Equation took 361 ms to find 0 implicit places.
[2022-05-19 19:21:07] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 262 rows 312 cols
[2022-05-19 19:21:07] [INFO ] Computed 111 place invariants in 2 ms
[2022-05-19 19:21:07] [INFO ] Dead Transitions using invariants and state equation in 121 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 312/616 places, 262/566 transitions.
Finished structural reductions, in 1 iterations. Remains : 312/616 places, 262/566 transitions.
Stuttering acceptance computed with spot in 29 ms :[(NOT p0)]
Running random walk in product with property : ShieldPPPs-PT-010B-LTLFireability-12 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 s65 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 141 reset in 374 ms.
Product exploration explored 100000 steps with 143 reset in 414 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/312 stabilizing places and 2/262 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [p0, (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X p0), (X (NOT p0)), (X (X p0)), (X (X (NOT p0)))]
Knowledge based reduction with 2 factoid took 139 ms. Reduced automaton from 1 states, 2 edges and 1 AP to 1 states, 2 edges and 1 AP.
Stuttering acceptance computed with spot in 26 ms :[(NOT p0)]
Finished random walk after 1 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=1 )
Knowledge obtained : [p0, (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X p0), (X (NOT p0)), (X (X p0)), (X (X (NOT p0))), (F (NOT p0))]
Knowledge based reduction with 2 factoid took 169 ms. Reduced automaton from 1 states, 2 edges and 1 AP to 1 states, 2 edges and 1 AP.
Stuttering acceptance computed with spot in 25 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 28 ms :[(NOT p0)]
Support contains 1 out of 312 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 312/312 places, 262/262 transitions.
Applied a total of 0 rules in 8 ms. Remains 312 /312 variables (removed 0) and now considering 262/262 (removed 0) transitions.
// Phase 1: matrix 262 rows 312 cols
[2022-05-19 19:21:08] [INFO ] Computed 111 place invariants in 2 ms
[2022-05-19 19:21:08] [INFO ] Implicit Places using invariants in 133 ms returned []
// Phase 1: matrix 262 rows 312 cols
[2022-05-19 19:21:08] [INFO ] Computed 111 place invariants in 1 ms
[2022-05-19 19:21:08] [INFO ] Implicit Places using invariants and state equation in 215 ms returned []
Implicit Place search using SMT with State Equation took 350 ms to find 0 implicit places.
[2022-05-19 19:21:08] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 262 rows 312 cols
[2022-05-19 19:21:08] [INFO ] Computed 111 place invariants in 1 ms
[2022-05-19 19:21:08] [INFO ] Dead Transitions using invariants and state equation in 130 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 312/312 places, 262/262 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/312 stabilizing places and 2/262 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [p0, (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X p0), (X (NOT p0)), (X (X p0)), (X (X (NOT p0)))]
Knowledge based reduction with 2 factoid took 125 ms. Reduced automaton from 1 states, 2 edges and 1 AP to 1 states, 2 edges and 1 AP.
Stuttering acceptance computed with spot in 26 ms :[(NOT p0)]
Finished random walk after 2 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=2 )
Knowledge obtained : [p0, (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X p0), (X (NOT p0)), (X (X p0)), (X (X (NOT p0))), (F (NOT p0))]
Knowledge based reduction with 2 factoid took 124 ms. Reduced automaton from 1 states, 2 edges and 1 AP to 1 states, 2 edges and 1 AP.
Stuttering acceptance computed with spot in 32 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 32 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 53 ms :[(NOT p0)]
Product exploration explored 100000 steps with 140 reset in 376 ms.
Product exploration explored 100000 steps with 141 reset in 412 ms.
Built C files in :
/tmp/ltsmin406465024135741401
[2022-05-19 19:21:10] [INFO ] Computing symmetric may disable matrix : 262 transitions.
[2022-05-19 19:21:10] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-19 19:21:10] [INFO ] Computing symmetric may enable matrix : 262 transitions.
[2022-05-19 19:21:10] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-19 19:21:10] [INFO ] Computing Do-Not-Accords matrix : 262 transitions.
[2022-05-19 19:21:10] [INFO ] Computation of Completed DNA matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-19 19:21:10] [INFO ] Built C files in 31ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin406465024135741401
Running compilation step : cd /tmp/ltsmin406465024135741401;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 505 ms.
Running link step : cd /tmp/ltsmin406465024135741401;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 31 ms.
Running LTSmin : cd /tmp/ltsmin406465024135741401;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased8032924813596786685.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 1 out of 312 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 312/312 places, 262/262 transitions.
Applied a total of 0 rules in 9 ms. Remains 312 /312 variables (removed 0) and now considering 262/262 (removed 0) transitions.
// Phase 1: matrix 262 rows 312 cols
[2022-05-19 19:21:25] [INFO ] Computed 111 place invariants in 2 ms
[2022-05-19 19:21:25] [INFO ] Implicit Places using invariants in 134 ms returned []
// Phase 1: matrix 262 rows 312 cols
[2022-05-19 19:21:25] [INFO ] Computed 111 place invariants in 1 ms
[2022-05-19 19:21:25] [INFO ] Implicit Places using invariants and state equation in 212 ms returned []
Implicit Place search using SMT with State Equation took 349 ms to find 0 implicit places.
[2022-05-19 19:21:25] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 262 rows 312 cols
[2022-05-19 19:21:25] [INFO ] Computed 111 place invariants in 1 ms
[2022-05-19 19:21:25] [INFO ] Dead Transitions using invariants and state equation in 120 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 312/312 places, 262/262 transitions.
Built C files in :
/tmp/ltsmin3913685519202586725
[2022-05-19 19:21:25] [INFO ] Computing symmetric may disable matrix : 262 transitions.
[2022-05-19 19:21:25] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-19 19:21:25] [INFO ] Computing symmetric may enable matrix : 262 transitions.
[2022-05-19 19:21:25] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-19 19:21:25] [INFO ] Computing Do-Not-Accords matrix : 262 transitions.
[2022-05-19 19:21:25] [INFO ] Computation of Completed DNA matrix. took 5 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-19 19:21:25] [INFO ] Built C files in 19ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3913685519202586725
Running compilation step : cd /tmp/ltsmin3913685519202586725;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 488 ms.
Running link step : cd /tmp/ltsmin3913685519202586725;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 36 ms.
Running LTSmin : cd /tmp/ltsmin3913685519202586725;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased3355723970978206405.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2022-05-19 19:21:40] [INFO ] Flatten gal took : 11 ms
[2022-05-19 19:21:40] [INFO ] Flatten gal took : 11 ms
[2022-05-19 19:21:40] [INFO ] Time to serialize gal into /tmp/LTL9584303172662907661.gal : 2 ms
[2022-05-19 19:21:40] [INFO ] Time to serialize properties into /tmp/LTL13795315015462114514.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/LTL9584303172662907661.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL13795315015462114514.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/LTL9584303...267
Read 1 LTL properties
Checking formula 0 : !((G(F(G(F(G("(p151==0)")))))))
Formula 0 simplified : !GFGFG"(p151==0)"
Detected timeout of ITS tools.
[2022-05-19 19:21:55] [INFO ] Flatten gal took : 10 ms
[2022-05-19 19:21:55] [INFO ] Applying decomposition
[2022-05-19 19:21:55] [INFO ] Flatten gal took : 10 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/graph13336102960076649619.txt' '-o' '/tmp/graph13336102960076649619.bin' '-w' '/tmp/graph13336102960076649619.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph13336102960076649619.bin' '-l' '-1' '-v' '-w' '/tmp/graph13336102960076649619.weights' '-q' '0' '-e' '0.001'
[2022-05-19 19:21:56] [INFO ] Decomposing Gal with order
[2022-05-19 19:21:56] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-19 19:21:56] [INFO ] Removed a total of 60 redundant transitions.
[2022-05-19 19:21:56] [INFO ] Flatten gal took : 18 ms
[2022-05-19 19:21:56] [INFO ] Fuse similar labels procedure discarded/fused a total of 120 labels/synchronizations in 3 ms.
[2022-05-19 19:21:56] [INFO ] Time to serialize gal into /tmp/LTL15238986693816919548.gal : 3 ms
[2022-05-19 19:21:56] [INFO ] Time to serialize properties into /tmp/LTL785923483799030183.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/LTL15238986693816919548.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL785923483799030183.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/LTL1523898...245
Read 1 LTL properties
Checking formula 0 : !((G(F(G(F(G("(i2.i0.u23.p151==0)")))))))
Formula 0 simplified : !GFGFG"(i2.i0.u23.p151==0)"
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin17075433664475841766
[2022-05-19 19:22:11] [INFO ] Built C files in 9ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17075433664475841766
Running compilation step : cd /tmp/ltsmin17075433664475841766;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 410 ms.
Running link step : cd /tmp/ltsmin17075433664475841766;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 28 ms.
Running LTSmin : cd /tmp/ltsmin17075433664475841766;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '[](<>([](<>([]((LTLAPp0==true))))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property ShieldPPPs-PT-010B-LTLFireability-12 finished in 79555 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(((p0 U p1)&&((G(X(X(p2)))||p0) U p2)))'
Support contains 3 out of 616 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 616/616 places, 566/566 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 612 transition count 562
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 612 transition count 562
Applied a total of 8 rules in 14 ms. Remains 612 /616 variables (removed 4) and now considering 562/566 (removed 4) transitions.
// Phase 1: matrix 562 rows 612 cols
[2022-05-19 19:22:26] [INFO ] Computed 111 place invariants in 3 ms
[2022-05-19 19:22:26] [INFO ] Implicit Places using invariants in 200 ms returned []
// Phase 1: matrix 562 rows 612 cols
[2022-05-19 19:22:26] [INFO ] Computed 111 place invariants in 1 ms
[2022-05-19 19:22:26] [INFO ] Implicit Places using invariants and state equation in 432 ms returned []
Implicit Place search using SMT with State Equation took 632 ms to find 0 implicit places.
// Phase 1: matrix 562 rows 612 cols
[2022-05-19 19:22:26] [INFO ] Computed 111 place invariants in 2 ms
[2022-05-19 19:22:27] [INFO ] Dead Transitions using invariants and state equation in 261 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 612/616 places, 562/566 transitions.
Finished structural reductions, in 1 iterations. Remains : 612/616 places, 562/566 transitions.
Stuttering acceptance computed with spot in 207 ms :[true, (NOT p1), (NOT p2), (NOT p2), (OR (NOT p1) (NOT p2)), (NOT p2)]
Running random walk in product with property : ShieldPPPs-PT-010B-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={0} source=1 dest: 1}], [{ cond=(AND p0 (NOT p2)), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=2 dest: 3}], [{ cond=true, acceptance={} source=3 dest: 5}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=4 dest: 0}, { cond=(AND (NOT p1) p0 p2), acceptance={0} source=4 dest: 1}, { cond=(AND p1 p0 (NOT p2)), acceptance={0} source=4 dest: 2}, { cond=(AND p1 (NOT p0) (NOT p2)), acceptance={0} source=4 dest: 3}, { cond=(AND (NOT p1) p0 (NOT p2)), acceptance={0} source=4 dest: 4}], [{ cond=(NOT p2), acceptance={} source=5 dest: 0}, { cond=p2, acceptance={} source=5 dest: 5}]], initial=4, aps=[p1:(NEQ s433 1), p0:(EQ s423 1), p2:(EQ s255 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA ShieldPPPs-PT-010B-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldPPPs-PT-010B-LTLFireability-13 finished in 1142 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(((F(X(G((p0 U p1)))) U G(p2)) U (p1 U p2)))))'
Support contains 3 out of 616 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 616/616 places, 566/566 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 71 transitions
Trivial Post-agglo rules discarded 71 transitions
Performed 71 trivial Post agglomeration. Transition count delta: 71
Iterating post reduction 0 with 71 rules applied. Total rules applied 71 place count 615 transition count 494
Reduce places removed 71 places and 0 transitions.
Iterating post reduction 1 with 71 rules applied. Total rules applied 142 place count 544 transition count 494
Performed 50 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 50 Pre rules applied. Total rules applied 142 place count 544 transition count 444
Deduced a syphon composed of 50 places in 1 ms
Reduce places removed 50 places and 0 transitions.
Iterating global reduction 2 with 100 rules applied. Total rules applied 242 place count 494 transition count 444
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 246 place count 490 transition count 440
Iterating global reduction 2 with 4 rules applied. Total rules applied 250 place count 490 transition count 440
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 250 place count 490 transition count 438
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 254 place count 488 transition count 438
Performed 172 Post agglomeration using F-continuation condition.Transition count delta: 172
Deduced a syphon composed of 172 places in 0 ms
Reduce places removed 172 places and 0 transitions.
Iterating global reduction 2 with 344 rules applied. Total rules applied 598 place count 316 transition count 266
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 600 place count 314 transition count 264
Applied a total of 600 rules in 46 ms. Remains 314 /616 variables (removed 302) and now considering 264/566 (removed 302) transitions.
// Phase 1: matrix 264 rows 314 cols
[2022-05-19 19:22:27] [INFO ] Computed 111 place invariants in 2 ms
[2022-05-19 19:22:27] [INFO ] Implicit Places using invariants in 142 ms returned []
// Phase 1: matrix 264 rows 314 cols
[2022-05-19 19:22:27] [INFO ] Computed 111 place invariants in 1 ms
[2022-05-19 19:22:27] [INFO ] Implicit Places using invariants and state equation in 213 ms returned []
Implicit Place search using SMT with State Equation took 357 ms to find 0 implicit places.
[2022-05-19 19:22:27] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 264 rows 314 cols
[2022-05-19 19:22:27] [INFO ] Computed 111 place invariants in 1 ms
[2022-05-19 19:22:27] [INFO ] Dead Transitions using invariants and state equation in 130 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 314/616 places, 264/566 transitions.
Finished structural reductions, in 1 iterations. Remains : 314/616 places, 264/566 transitions.
Stuttering acceptance computed with spot in 65 ms :[(NOT p2), (NOT p2)]
Running random walk in product with property : ShieldPPPs-PT-010B-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=(OR p2 p1), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p2) p1), acceptance={0} source=0 dest: 1}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=1 dest: 0}, { cond=(AND (NOT p2) p1), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p2:(AND (EQ s230 1) (EQ s251 1)), p1:(EQ s177 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 686 steps with 0 reset in 8 ms.
FORMULA ShieldPPPs-PT-010B-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldPPPs-PT-010B-LTLFireability-14 finished in 642 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 616 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 616/616 places, 566/566 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 71 transitions
Trivial Post-agglo rules discarded 71 transitions
Performed 71 trivial Post agglomeration. Transition count delta: 71
Iterating post reduction 0 with 71 rules applied. Total rules applied 71 place count 615 transition count 494
Reduce places removed 71 places and 0 transitions.
Iterating post reduction 1 with 71 rules applied. Total rules applied 142 place count 544 transition count 494
Performed 50 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 50 Pre rules applied. Total rules applied 142 place count 544 transition count 444
Deduced a syphon composed of 50 places in 0 ms
Reduce places removed 50 places and 0 transitions.
Iterating global reduction 2 with 100 rules applied. Total rules applied 242 place count 494 transition count 444
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 246 place count 490 transition count 440
Iterating global reduction 2 with 4 rules applied. Total rules applied 250 place count 490 transition count 440
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 250 place count 490 transition count 438
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 254 place count 488 transition count 438
Performed 174 Post agglomeration using F-continuation condition.Transition count delta: 174
Deduced a syphon composed of 174 places in 0 ms
Reduce places removed 174 places and 0 transitions.
Iterating global reduction 2 with 348 rules applied. Total rules applied 602 place count 314 transition count 264
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 604 place count 312 transition count 262
Applied a total of 604 rules in 38 ms. Remains 312 /616 variables (removed 304) and now considering 262/566 (removed 304) transitions.
// Phase 1: matrix 262 rows 312 cols
[2022-05-19 19:22:28] [INFO ] Computed 111 place invariants in 1 ms
[2022-05-19 19:22:28] [INFO ] Implicit Places using invariants in 137 ms returned []
// Phase 1: matrix 262 rows 312 cols
[2022-05-19 19:22:28] [INFO ] Computed 111 place invariants in 3 ms
[2022-05-19 19:22:28] [INFO ] Implicit Places using invariants and state equation in 217 ms returned []
Implicit Place search using SMT with State Equation took 355 ms to find 0 implicit places.
[2022-05-19 19:22:28] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 262 rows 312 cols
[2022-05-19 19:22:28] [INFO ] Computed 111 place invariants in 1 ms
[2022-05-19 19:22:28] [INFO ] Dead Transitions using invariants and state equation in 122 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 312/616 places, 262/566 transitions.
Finished structural reductions, in 1 iterations. Remains : 312/616 places, 262/566 transitions.
Stuttering acceptance computed with spot in 35 ms :[(NOT p0)]
Running random walk in product with property : ShieldPPPs-PT-010B-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (EQ s254 1) (EQ s272 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 566 steps with 0 reset in 5 ms.
FORMULA ShieldPPPs-PT-010B-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldPPPs-PT-010B-LTLFireability-15 finished in 583 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((X(G(!(p1 U G(p2))))||p0))))'
Found a SL insensitive property : ShieldPPPs-PT-010B-LTLFireability-00
Stuttering acceptance computed with spot in 148 ms :[(AND (NOT p0) p2), (AND (NOT p0) p2), p2, p2]
Support contains 3 out of 616 places. Attempting structural reductions.
Starting structural reductions in SLCL_LTL mode, iteration 0 : 616/616 places, 566/566 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 72 transitions
Trivial Post-agglo rules discarded 72 transitions
Performed 72 trivial Post agglomeration. Transition count delta: 72
Iterating post reduction 0 with 72 rules applied. Total rules applied 72 place count 615 transition count 493
Reduce places removed 72 places and 0 transitions.
Iterating post reduction 1 with 72 rules applied. Total rules applied 144 place count 543 transition count 493
Performed 50 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 50 Pre rules applied. Total rules applied 144 place count 543 transition count 443
Deduced a syphon composed of 50 places in 0 ms
Reduce places removed 50 places and 0 transitions.
Iterating global reduction 2 with 100 rules applied. Total rules applied 244 place count 493 transition count 443
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 247 place count 490 transition count 440
Iterating global reduction 2 with 3 rules applied. Total rules applied 250 place count 490 transition count 440
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 250 place count 490 transition count 438
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 254 place count 488 transition count 438
Performed 174 Post agglomeration using F-continuation condition.Transition count delta: 174
Deduced a syphon composed of 174 places in 0 ms
Reduce places removed 174 places and 0 transitions.
Iterating global reduction 2 with 348 rules applied. Total rules applied 602 place count 314 transition count 264
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 604 place count 312 transition count 262
Applied a total of 604 rules in 37 ms. Remains 312 /616 variables (removed 304) and now considering 262/566 (removed 304) transitions.
// Phase 1: matrix 262 rows 312 cols
[2022-05-19 19:22:28] [INFO ] Computed 111 place invariants in 0 ms
[2022-05-19 19:22:28] [INFO ] Implicit Places using invariants in 120 ms returned []
// Phase 1: matrix 262 rows 312 cols
[2022-05-19 19:22:28] [INFO ] Computed 111 place invariants in 1 ms
[2022-05-19 19:22:29] [INFO ] Implicit Places using invariants and state equation in 234 ms returned []
Implicit Place search using SMT with State Equation took 355 ms to find 0 implicit places.
// Phase 1: matrix 262 rows 312 cols
[2022-05-19 19:22:29] [INFO ] Computed 111 place invariants in 0 ms
[2022-05-19 19:22:29] [INFO ] Dead Transitions using invariants and state equation in 131 ms found 0 transitions.
Starting structural reductions in SLCL_LTL mode, iteration 1 : 312/616 places, 262/566 transitions.
Finished structural reductions, in 1 iterations. Remains : 312/616 places, 262/566 transitions.
Running random walk in product with property : ShieldPPPs-PT-010B-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) p2), acceptance={} source=1 dest: 2}, { cond=(NOT p0), acceptance={} source=1 dest: 3}], [{ cond=p2, acceptance={0} source=2 dest: 2}], [{ cond=p2, acceptance={} source=3 dest: 2}, { cond=true, acceptance={} source=3 dest: 3}]], initial=0, aps=[p0:(OR (EQ s291 0) (EQ s300 0)), p2:(EQ s239 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak, sl-invariant], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 157 reset in 366 ms.
Product exploration explored 100000 steps with 160 reset in 399 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 p0 (NOT p2)), (X (NOT (AND (NOT p0) p2))), (X p0), (X (X (NOT p2))), true, (X (X (NOT (AND (NOT p0) p2)))), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 329 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 133 ms :[(AND (NOT p0) p2), (AND (NOT p0) p2), p2, p2]
Incomplete random walk after 10000 steps, including 14 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 3) seen :2
Finished Best-First random walk after 6303 steps, including 1 resets, run visited all 1 properties in 11 ms. (steps per millisecond=573 )
Knowledge obtained : [(AND p0 (NOT p2)), (X (NOT (AND (NOT p0) p2))), (X p0), (X (X (NOT p2))), true, (X (X (NOT (AND (NOT p0) p2)))), (X (X p0))]
False Knowledge obtained : [(F (NOT p0)), (F p2), (F (AND p2 (NOT p0)))]
Knowledge based reduction with 7 factoid took 309 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 :[(AND (NOT p0) p2), (AND (NOT p0) p2), p2, p2]
Stuttering acceptance computed with spot in 114 ms :[(AND (NOT p0) p2), (AND (NOT p0) p2), p2, p2]
Support contains 3 out of 312 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 312/312 places, 262/262 transitions.
Applied a total of 0 rules in 5 ms. Remains 312 /312 variables (removed 0) and now considering 262/262 (removed 0) transitions.
// Phase 1: matrix 262 rows 312 cols
[2022-05-19 19:22:31] [INFO ] Computed 111 place invariants in 1 ms
[2022-05-19 19:22:31] [INFO ] Implicit Places using invariants in 193 ms returned []
// Phase 1: matrix 262 rows 312 cols
[2022-05-19 19:22:31] [INFO ] Computed 111 place invariants in 1 ms
[2022-05-19 19:22:31] [INFO ] Implicit Places using invariants and state equation in 216 ms returned []
Implicit Place search using SMT with State Equation took 411 ms to find 0 implicit places.
// Phase 1: matrix 262 rows 312 cols
[2022-05-19 19:22:31] [INFO ] Computed 111 place invariants in 2 ms
[2022-05-19 19:22:31] [INFO ] Dead Transitions using invariants and state equation in 131 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 312/312 places, 262/262 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 p0 (NOT p2)), (X (NOT (AND p2 (NOT p0)))), (X p0), (X (X (NOT p2))), true, (X (X (NOT (AND p2 (NOT p0))))), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 221 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 140 ms :[(AND (NOT p0) p2), (AND (NOT p0) p2), p2, p2]
Incomplete random walk after 10000 steps, including 14 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 3) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 262 rows 312 cols
[2022-05-19 19:22:32] [INFO ] Computed 111 place invariants in 2 ms
[2022-05-19 19:22:32] [INFO ] After 98ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-19 19:22:32] [INFO ] [Nat]Absence check using 111 positive place invariants in 12 ms returned sat
[2022-05-19 19:22:32] [INFO ] After 73ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-19 19:22:32] [INFO ] After 111ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 11 ms.
[2022-05-19 19:22:32] [INFO ] After 177ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished Parikh walk after 62 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=62 )
Parikh walk visited 1 properties in 1 ms.
Knowledge obtained : [(AND p0 (NOT p2)), (X (NOT (AND p2 (NOT p0)))), (X p0), (X (X (NOT p2))), true, (X (X (NOT (AND p2 (NOT p0))))), (X (X p0))]
False Knowledge obtained : [(F (NOT p0)), (F p2), (F (AND p2 (NOT p0)))]
Knowledge based reduction with 7 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 124 ms :[(AND (NOT p0) p2), (AND (NOT p0) p2), p2, p2]
Stuttering acceptance computed with spot in 137 ms :[(AND (NOT p0) p2), (AND (NOT p0) p2), p2, p2]
Stuttering acceptance computed with spot in 127 ms :[(AND (NOT p0) p2), (AND (NOT p0) p2), p2, p2]
Product exploration explored 100000 steps with 162 reset in 375 ms.
Product exploration explored 100000 steps with 159 reset in 420 ms.
Applying partial POR strategy [false, true, true, true]
Stuttering acceptance computed with spot in 122 ms :[(AND (NOT p0) p2), (AND (NOT p0) p2), p2, p2]
Support contains 3 out of 312 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 312/312 places, 262/262 transitions.
Applied a total of 0 rules in 11 ms. Remains 312 /312 variables (removed 0) and now considering 262/262 (removed 0) transitions.
[2022-05-19 19:22:34] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 262 rows 312 cols
[2022-05-19 19:22:34] [INFO ] Computed 111 place invariants in 1 ms
[2022-05-19 19:22:34] [INFO ] Dead Transitions using invariants and state equation in 160 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 312/312 places, 262/262 transitions.
Product exploration explored 100000 steps with 160 reset in 443 ms.
Product exploration explored 100000 steps with 160 reset in 419 ms.
Built C files in :
/tmp/ltsmin1450398760204965953
[2022-05-19 19:22:35] [INFO ] Built C files in 5ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1450398760204965953
Running compilation step : cd /tmp/ltsmin1450398760204965953;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 391 ms.
Running link step : cd /tmp/ltsmin1450398760204965953;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 25 ms.
Running LTSmin : cd /tmp/ltsmin1450398760204965953;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased14466913754098132998.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 3 out of 312 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 312/312 places, 262/262 transitions.
Applied a total of 0 rules in 7 ms. Remains 312 /312 variables (removed 0) and now considering 262/262 (removed 0) transitions.
// Phase 1: matrix 262 rows 312 cols
[2022-05-19 19:22:50] [INFO ] Computed 111 place invariants in 2 ms
[2022-05-19 19:22:50] [INFO ] Implicit Places using invariants in 136 ms returned []
// Phase 1: matrix 262 rows 312 cols
[2022-05-19 19:22:50] [INFO ] Computed 111 place invariants in 0 ms
[2022-05-19 19:22:50] [INFO ] Implicit Places using invariants and state equation in 241 ms returned []
Implicit Place search using SMT with State Equation took 380 ms to find 0 implicit places.
// Phase 1: matrix 262 rows 312 cols
[2022-05-19 19:22:50] [INFO ] Computed 111 place invariants in 0 ms
[2022-05-19 19:22:50] [INFO ] Dead Transitions using invariants and state equation in 135 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 312/312 places, 262/262 transitions.
Built C files in :
/tmp/ltsmin10074124248409301119
[2022-05-19 19:22:50] [INFO ] Built C files in 5ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10074124248409301119
Running compilation step : cd /tmp/ltsmin10074124248409301119;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 420 ms.
Running link step : cd /tmp/ltsmin10074124248409301119;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 32 ms.
Running LTSmin : cd /tmp/ltsmin10074124248409301119;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased6849396779904744935.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2022-05-19 19:23:05] [INFO ] Flatten gal took : 10 ms
[2022-05-19 19:23:05] [INFO ] Flatten gal took : 9 ms
[2022-05-19 19:23:05] [INFO ] Time to serialize gal into /tmp/LTL375864503365644609.gal : 2 ms
[2022-05-19 19:23:05] [INFO ] Time to serialize properties into /tmp/LTL13357517819262321561.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/LTL375864503365644609.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL13357517819262321561.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/LTL3758645...266
Read 1 LTL properties
Checking formula 0 : !((X(G(((X(G(!(("((p637==1)&&(p652==1))")U(G("(p519==1)"))))))||("(p637==0)"))||("(p652==0)")))))
Formula 0 simplified : !XG("(p637==0)" | "(p652==0)" | XG!("((p637==1)&&(p652==1))" U G"(p519==1)"))
Detected timeout of ITS tools.
[2022-05-19 19:23:21] [INFO ] Flatten gal took : 9 ms
[2022-05-19 19:23:21] [INFO ] Applying decomposition
[2022-05-19 19:23:21] [INFO ] Flatten gal took : 8 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/graph14527819516442220703.txt' '-o' '/tmp/graph14527819516442220703.bin' '-w' '/tmp/graph14527819516442220703.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph14527819516442220703.bin' '-l' '-1' '-v' '-w' '/tmp/graph14527819516442220703.weights' '-q' '0' '-e' '0.001'
[2022-05-19 19:23:21] [INFO ] Decomposing Gal with order
[2022-05-19 19:23:21] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-19 19:23:21] [INFO ] Removed a total of 61 redundant transitions.
[2022-05-19 19:23:21] [INFO ] Flatten gal took : 38 ms
[2022-05-19 19:23:21] [INFO ] Fuse similar labels procedure discarded/fused a total of 124 labels/synchronizations in 5 ms.
[2022-05-19 19:23:21] [INFO ] Time to serialize gal into /tmp/LTL1896287253986425843.gal : 2 ms
[2022-05-19 19:23:21] [INFO ] Time to serialize properties into /tmp/LTL559758557941103321.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/LTL1896287253986425843.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL559758557941103321.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/LTL1896287...244
Read 1 LTL properties
Checking formula 0 : !((X(G(((X(G(!(("((i9.i3.u103.p637==1)&&(i9.i1.u108.p652==1))")U(G("(i7.i2.u85.p519==1)"))))))||("(i9.i3.u103.p637==0)"))||("(i9.i1.u1...172
Formula 0 simplified : !XG("(i9.i1.u108.p652==0)" | "(i9.i3.u103.p637==0)" | XG!("((i9.i3.u103.p637==1)&&(i9.i1.u108.p652==1))" U G"(i7.i2.u85.p519==1)"))
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin9407265617622459263
[2022-05-19 19:23:36] [INFO ] Built C files in 3ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9407265617622459263
Running compilation step : cd /tmp/ltsmin9407265617622459263;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 406 ms.
Running link step : cd /tmp/ltsmin9407265617622459263;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 24 ms.
Running LTSmin : cd /tmp/ltsmin9407265617622459263;'/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([](!((LTLAPp1==true) U []((LTLAPp2==true)))))||(LTLAPp0==true))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property ShieldPPPs-PT-010B-LTLFireability-00 finished in 82681 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F((F(p0) U G(F((G(p1)&&p0))))))'
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(G(F(G(p0))))))'
[2022-05-19 19:23:51] [INFO ] Flatten gal took : 19 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin7926641556615956872
[2022-05-19 19:23:51] [INFO ] Computing symmetric may disable matrix : 566 transitions.
[2022-05-19 19:23:51] [INFO ] Applying decomposition
[2022-05-19 19:23:51] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-19 19:23:51] [INFO ] Computing symmetric may enable matrix : 566 transitions.
[2022-05-19 19:23:51] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-19 19:23:51] [INFO ] Flatten gal took : 16 ms
[2022-05-19 19:23:51] [INFO ] Computing Do-Not-Accords matrix : 566 transitions.
[2022-05-19 19:23:51] [INFO ] Computation of Completed DNA matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-19 19:23:51] [INFO ] Built C files in 41ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7926641556615956872
Running compilation step : cd /tmp/ltsmin7926641556615956872;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '240' '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'
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/graph2683838553786614686.txt' '-o' '/tmp/graph2683838553786614686.bin' '-w' '/tmp/graph2683838553786614686.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph2683838553786614686.bin' '-l' '-1' '-v' '-w' '/tmp/graph2683838553786614686.weights' '-q' '0' '-e' '0.001'
[2022-05-19 19:23:51] [INFO ] Decomposing Gal with order
[2022-05-19 19:23:51] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-19 19:23:51] [INFO ] Removed a total of 90 redundant transitions.
[2022-05-19 19:23:51] [INFO ] Flatten gal took : 32 ms
[2022-05-19 19:23:51] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 3 ms.
[2022-05-19 19:23:51] [INFO ] Time to serialize gal into /tmp/LTLFireability16094627854096238645.gal : 5 ms
[2022-05-19 19:23:51] [INFO ] Time to serialize properties into /tmp/LTLFireability1545640739871893515.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/LTLFireability16094627854096238645.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability1545640739871893515.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 3 LTL properties
Checking formula 0 : !((X(G(((X(G(!(("((i9.i0.i3.u223.p637==1)&&(i9.i0.i4.u228.p652==1))")U(G("(i7.i1.i1.u182.p519==1)"))))))||("(i9.i0.i3.u223.p637==0)"))...188
Formula 0 simplified : !XG("(i9.i0.i3.u223.p637==0)" | "(i9.i0.i4.u228.p652==0)" | XG!("((i9.i0.i3.u223.p637==1)&&(i9.i0.i4.u228.p652==1))" U G"(i7.i1.i1.u...170
Compilation finished in 1194 ms.
Running link step : cd /tmp/ltsmin7926641556615956872;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 37 ms.
Running LTSmin : cd /tmp/ltsmin7926641556615956872;'/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([](!((LTLAPp1==true) U []((LTLAPp2==true)))))||(LTLAPp0==true))))' '--buchi-type=spotba'
WARNING : LTSmin timed out (>1200 s) on command cd /tmp/ltsmin7926641556615956872;'/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([](!((LTLAPp1==true) U []((LTLAPp2==true)))))||(LTLAPp0==true))))' '--buchi-type=spotba'
Running LTSmin : cd /tmp/ltsmin7926641556615956872;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '<>((<>((LTLAPp3==true)) U [](<>(([]((LTLAPp4==true))&&(LTLAPp3==true))))))' '--buchi-type=spotba'
Detected timeout of ITS tools.
[2022-05-19 19:45:49] [INFO ] Applying decomposition
[2022-05-19 19:45:49] [INFO ] Flatten gal took : 49 ms
[2022-05-19 19:45:49] [INFO ] Decomposing Gal with order
[2022-05-19 19:45:49] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-19 19:45:49] [INFO ] Removed a total of 60 redundant transitions.
[2022-05-19 19:45:49] [INFO ] Flatten gal took : 94 ms
[2022-05-19 19:45:49] [INFO ] Fuse similar labels procedure discarded/fused a total of 120 labels/synchronizations in 20 ms.
[2022-05-19 19:45:49] [INFO ] Time to serialize gal into /tmp/LTLFireability3657258090508796246.gal : 22 ms
[2022-05-19 19:45:49] [INFO ] Time to serialize properties into /tmp/LTLFireability6614331647480829847.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/LTLFireability3657258090508796246.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability6614331647480829847.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 3 LTL properties
Checking formula 0 : !((X(G(((X(G(!(("((i1.i0.i0.i0.i0.i0.i1.u212.p637==1)&&(i1.i0.i0.i0.u217.p652==1))")U(G("(i0.i0.i1.i0.i0.i0.u175.p519==1)"))))))||("(i...227
Formula 0 simplified : !XG("(i1.i0.i0.i0.i0.i0.i1.u212.p637==0)" | "(i1.i0.i0.i0.u217.p652==0)" | XG!("((i1.i0.i0.i0.i0.i0.i1.u212.p637==1)&&(i1.i0.i0.i0.u...209
WARNING : LTSmin timed out (>1200 s) on command cd /tmp/ltsmin7926641556615956872;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '<>((<>((LTLAPp3==true)) U [](<>(([]((LTLAPp4==true))&&(LTLAPp3==true))))))' '--buchi-type=spotba'
Running LTSmin : cd /tmp/ltsmin7926641556615956872;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '[](<>([](<>([]((LTLAPp5==true))))))' '--buchi-type=spotba'
Detected timeout of ITS tools.
[2022-05-19 20:07:49] [INFO ] Flatten gal took : 249 ms
[2022-05-19 20:07:50] [INFO ] Input system was already deterministic with 566 transitions.
[2022-05-19 20:07:50] [INFO ] Transformed 616 places.
[2022-05-19 20:07:50] [INFO ] Transformed 566 transitions.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//greatspn//bin/pinvar' '/home/mcc/execution/gspn'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//greatspn//bin/RGMEDD2' '/home/mcc/execution/gspn' '-META' '-varord-only'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2022-05-19 20:07:50] [INFO ] Time to serialize gal into /tmp/LTLFireability4965296045977758865.gal : 39 ms
[2022-05-19 20:07:50] [INFO ] Time to serialize properties into /tmp/LTLFireability2958622452474644616.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/LTLFireability4965296045977758865.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability2958622452474644616.ltl' '-c' '-stutter-deadlock' '--load-order' '/home/mcc/execution/model.ord' '--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/LTLFireabi...333
Read 3 LTL properties
Successfully loaded order from file /home/mcc/execution/model.ord
Checking formula 0 : !((X(G(((X(G(!(("((p637==1)&&(p652==1))")U(G("(p519==1)"))))))||("(p637==0)"))||("(p652==0)")))))
Formula 0 simplified : !XG("(p637==0)" | "(p652==0)" | XG!("((p637==1)&&(p652==1))" U G"(p519==1)"))
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="ShieldPPPs-PT-010B"
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 ShieldPPPs-PT-010B, 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-165286025200444"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/ShieldPPPs-PT-010B.tgz
mv ShieldPPPs-PT-010B 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 ;