fond
Model Checking Contest 2023
13th edition, Paris, France, April 26, 2023 (at TOOLympics II)
Execution of r389-oct2-167903713700588
Last Updated
May 14, 2023

About the Execution of ITS-Tools for ShieldPPPt-PT-004B

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
16213.800 3600000.00 4555843.00 12163.40 ?FFFFFFFFFTFFFFF normal

Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/data/fkordon/mcc2023-input.r389-oct2-167903713700588.qcow2', fmt=qcow2 cluster_size=65536 extended_l2=off compression_type=zlib size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 backing_fmt=qcow2 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.........................
=====================================================================
Generated by BenchKit 2-5348
Executing tool itstools
Input is ShieldPPPt-PT-004B, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r389-oct2-167903713700588
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 508K
-rw-r--r-- 1 mcc users 6.2K Feb 25 20:49 CTLCardinality.txt
-rw-r--r-- 1 mcc users 63K Feb 25 20:49 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.7K Feb 25 20:48 CTLFireability.txt
-rw-r--r-- 1 mcc users 66K Feb 25 20:48 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:41 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K Jan 29 11:41 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.4K Feb 25 17:00 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Feb 25 17:00 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Feb 25 17:00 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Feb 25 17:00 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.8K Feb 25 20:50 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 89K Feb 25 20:50 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.6K Feb 25 20:49 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 76K Feb 25 20:49 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 17:00 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 17:00 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 74K Mar 5 18:23 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME ShieldPPPt-PT-004B-LTLFireability-00
FORMULA_NAME ShieldPPPt-PT-004B-LTLFireability-01
FORMULA_NAME ShieldPPPt-PT-004B-LTLFireability-02
FORMULA_NAME ShieldPPPt-PT-004B-LTLFireability-03
FORMULA_NAME ShieldPPPt-PT-004B-LTLFireability-04
FORMULA_NAME ShieldPPPt-PT-004B-LTLFireability-05
FORMULA_NAME ShieldPPPt-PT-004B-LTLFireability-06
FORMULA_NAME ShieldPPPt-PT-004B-LTLFireability-07
FORMULA_NAME ShieldPPPt-PT-004B-LTLFireability-08
FORMULA_NAME ShieldPPPt-PT-004B-LTLFireability-09
FORMULA_NAME ShieldPPPt-PT-004B-LTLFireability-10
FORMULA_NAME ShieldPPPt-PT-004B-LTLFireability-11
FORMULA_NAME ShieldPPPt-PT-004B-LTLFireability-12
FORMULA_NAME ShieldPPPt-PT-004B-LTLFireability-13
FORMULA_NAME ShieldPPPt-PT-004B-LTLFireability-14
FORMULA_NAME ShieldPPPt-PT-004B-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1679214535414

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ShieldPPPt-PT-004B
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202303021504
[2023-03-19 08:28:57] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2023-03-19 08:28:58] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-19 08:28:58] [INFO ] Load time of PNML (sax parser for PT used): 60 ms
[2023-03-19 08:28:58] [INFO ] Transformed 315 places.
[2023-03-19 08:28:58] [INFO ] Transformed 287 transitions.
[2023-03-19 08:28:58] [INFO ] Found NUPN structural information;
[2023-03-19 08:28:58] [INFO ] Parsed PT model containing 315 places and 287 transitions and 718 arcs in 128 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 6 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
FORMULA ShieldPPPt-PT-004B-LTLFireability-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPt-PT-004B-LTLFireability-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPt-PT-004B-LTLFireability-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 36 out of 315 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 315/315 places, 287/287 transitions.
Discarding 33 places :
Symmetric choice reduction at 0 with 33 rule applications. Total rules 33 place count 282 transition count 254
Iterating global reduction 0 with 33 rules applied. Total rules applied 66 place count 282 transition count 254
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 67 place count 281 transition count 253
Iterating global reduction 0 with 1 rules applied. Total rules applied 68 place count 281 transition count 253
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 69 place count 280 transition count 252
Iterating global reduction 0 with 1 rules applied. Total rules applied 70 place count 280 transition count 252
Applied a total of 70 rules in 86 ms. Remains 280 /315 variables (removed 35) and now considering 252/287 (removed 35) transitions.
// Phase 1: matrix 252 rows 280 cols
[2023-03-19 08:28:58] [INFO ] Computed 45 place invariants in 9 ms
[2023-03-19 08:28:58] [INFO ] Implicit Places using invariants in 507 ms returned []
[2023-03-19 08:28:58] [INFO ] Invariant cache hit.
[2023-03-19 08:28:59] [INFO ] Implicit Places using invariants and state equation in 397 ms returned []
Implicit Place search using SMT with State Equation took 960 ms to find 0 implicit places.
[2023-03-19 08:28:59] [INFO ] Invariant cache hit.
[2023-03-19 08:28:59] [INFO ] Dead Transitions using invariants and state equation in 274 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 280/315 places, 252/287 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1324 ms. Remains : 280/315 places, 252/287 transitions.
Support contains 36 out of 280 places after structural reductions.
[2023-03-19 08:28:59] [INFO ] Flatten gal took : 42 ms
[2023-03-19 08:28:59] [INFO ] Flatten gal took : 17 ms
[2023-03-19 08:28:59] [INFO ] Input system was already deterministic with 252 transitions.
Finished random walk after 1033 steps, including 0 resets, run visited all 33 properties in 108 ms. (steps per millisecond=9 )
Computed a total of 65 stabilizing places and 65 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(((X((F(p0)&&X(p1)))&&G((p1||F(!p0))))||G((F(p0)&&X(p1))))))'
Support contains 2 out of 280 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 280/280 places, 252/252 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 269 transition count 241
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 269 transition count 241
Applied a total of 22 rules in 14 ms. Remains 269 /280 variables (removed 11) and now considering 241/252 (removed 11) transitions.
// Phase 1: matrix 241 rows 269 cols
[2023-03-19 08:29:00] [INFO ] Computed 45 place invariants in 7 ms
[2023-03-19 08:29:01] [INFO ] Implicit Places using invariants in 170 ms returned []
[2023-03-19 08:29:01] [INFO ] Invariant cache hit.
[2023-03-19 08:29:01] [INFO ] Implicit Places using invariants and state equation in 254 ms returned []
Implicit Place search using SMT with State Equation took 428 ms to find 0 implicit places.
[2023-03-19 08:29:01] [INFO ] Invariant cache hit.
[2023-03-19 08:29:01] [INFO ] Dead Transitions using invariants and state equation in 135 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 269/280 places, 241/252 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 591 ms. Remains : 269/280 places, 241/252 transitions.
Stuttering acceptance computed with spot in 678 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), (AND (NOT p1) p0), (AND (NOT p1) p0), (NOT p0), (NOT p1)]
Running random walk in product with property : ShieldPPPt-PT-004B-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}, { cond=(AND (NOT p1) p0), acceptance={} source=0 dest: 3}], [{ cond=(NOT p0), acceptance={} source=1 dest: 4}, { cond=true, acceptance={} source=1 dest: 5}], [{ cond=true, acceptance={} source=2 dest: 2}, { cond=(AND (NOT p1) p0), acceptance={} source=2 dest: 3}], [{ cond=(AND p1 p0), acceptance={} source=3 dest: 3}, { cond=(AND (NOT p1) p0), acceptance={0} source=3 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=4 dest: 4}], [{ cond=(NOT p1), acceptance={} source=5 dest: 2}, { cond=(AND (NOT p1) p0), acceptance={} source=5 dest: 3}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=5 dest: 4}, { cond=(NOT p1), acceptance={0} source=5 dest: 5}]], initial=0, aps=[p1:(NEQ s16 1), p0:(EQ s211 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 6 reset in 468 ms.
Product exploration explored 100000 steps with 2 reset in 514 ms.
Computed a total of 62 stabilizing places and 62 stable transitions
Computed a total of 62 stabilizing places and 62 stable transitions
Detected a total of 62/269 stabilizing places and 62/241 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND p1 (NOT p0)), (X (NOT (AND (NOT p1) p0))), (X (NOT p0)), (X (NOT (AND p1 p0))), true, (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT p0))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X p1)), (X (X (NOT (AND p1 p0)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 11 factoid took 740 ms. Reduced automaton from 6 states, 14 edges and 2 AP (stutter sensitive) to 4 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 242 ms :[(OR (NOT p0) (NOT p1)), (AND (NOT p1) p0), (AND (NOT p1) p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 46 ms. (steps per millisecond=217 ) 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.
[2023-03-19 08:29:04] [INFO ] Invariant cache hit.
[2023-03-19 08:29:04] [INFO ] [Real]Absence check using 45 positive place invariants in 25 ms returned sat
[2023-03-19 08:29:04] [INFO ] After 88ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-19 08:29:04] [INFO ] Deduced a trap composed of 18 places in 95 ms of which 24 ms to minimize.
[2023-03-19 08:29:04] [INFO ] Deduced a trap composed of 18 places in 40 ms of which 0 ms to minimize.
[2023-03-19 08:29:04] [INFO ] Deduced a trap composed of 17 places in 43 ms of which 2 ms to minimize.
[2023-03-19 08:29:04] [INFO ] Deduced a trap composed of 17 places in 71 ms of which 1 ms to minimize.
[2023-03-19 08:29:04] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 323 ms
[2023-03-19 08:29:04] [INFO ] After 419ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-19 08:29:04] [INFO ] After 536ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-19 08:29:04] [INFO ] [Nat]Absence check using 45 positive place invariants in 9 ms returned sat
[2023-03-19 08:29:04] [INFO ] After 79ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-19 08:29:04] [INFO ] Deduced a trap composed of 18 places in 39 ms of which 1 ms to minimize.
[2023-03-19 08:29:04] [INFO ] Deduced a trap composed of 18 places in 38 ms of which 0 ms to minimize.
[2023-03-19 08:29:05] [INFO ] Deduced a trap composed of 17 places in 32 ms of which 0 ms to minimize.
[2023-03-19 08:29:05] [INFO ] Deduced a trap composed of 17 places in 29 ms of which 1 ms to minimize.
[2023-03-19 08:29:05] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 181 ms
[2023-03-19 08:29:05] [INFO ] After 268ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 9 ms.
[2023-03-19 08:29:05] [INFO ] After 358ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished Parikh walk after 155 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=77 )
Parikh walk visited 1 properties in 2 ms.
Knowledge obtained : [(AND p1 (NOT p0)), (X (NOT (AND (NOT p1) p0))), (X (NOT p0)), (X (NOT (AND p1 p0))), true, (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT p0))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X p1)), (X (X (NOT (AND p1 p0)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (AND (NOT p1) p0)), (F p0), (F (AND p1 p0))]
Knowledge based reduction with 11 factoid took 694 ms. Reduced automaton from 4 states, 7 edges and 2 AP (stutter sensitive) to 4 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 233 ms :[(OR (NOT p0) (NOT p1)), (AND (NOT p1) p0), (AND (NOT p1) p0), (NOT p0)]
Stuttering acceptance computed with spot in 251 ms :[(OR (NOT p0) (NOT p1)), (AND (NOT p1) p0), (AND (NOT p1) p0), (NOT p0)]
[2023-03-19 08:29:06] [INFO ] Invariant cache hit.
[2023-03-19 08:29:06] [INFO ] [Real]Absence check using 45 positive place invariants in 14 ms returned sat
[2023-03-19 08:29:06] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-19 08:29:06] [INFO ] [Real]Absence check using state equation in 156 ms returned sat
[2023-03-19 08:29:06] [INFO ] Solution in real domain found non-integer solution.
[2023-03-19 08:29:06] [INFO ] [Nat]Absence check using 45 positive place invariants in 29 ms returned sat
[2023-03-19 08:29:06] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-19 08:29:07] [INFO ] [Nat]Absence check using state equation in 196 ms returned sat
[2023-03-19 08:29:07] [INFO ] Deduced a trap composed of 17 places in 93 ms of which 6 ms to minimize.
[2023-03-19 08:29:07] [INFO ] Deduced a trap composed of 20 places in 67 ms of which 1 ms to minimize.
[2023-03-19 08:29:07] [INFO ] Deduced a trap composed of 12 places in 50 ms of which 1 ms to minimize.
[2023-03-19 08:29:07] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 299 ms
[2023-03-19 08:29:07] [INFO ] Computed and/alt/rep : 240/357/240 causal constraints (skipped 0 transitions) in 34 ms.
[2023-03-19 08:29:08] [INFO ] Added : 205 causal constraints over 41 iterations in 1500 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 2 out of 269 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 269/269 places, 241/241 transitions.
Applied a total of 0 rules in 10 ms. Remains 269 /269 variables (removed 0) and now considering 241/241 (removed 0) transitions.
[2023-03-19 08:29:08] [INFO ] Invariant cache hit.
[2023-03-19 08:29:09] [INFO ] Implicit Places using invariants in 199 ms returned []
[2023-03-19 08:29:09] [INFO ] Invariant cache hit.
[2023-03-19 08:29:09] [INFO ] Implicit Places using invariants and state equation in 884 ms returned []
Implicit Place search using SMT with State Equation took 1100 ms to find 0 implicit places.
[2023-03-19 08:29:09] [INFO ] Invariant cache hit.
[2023-03-19 08:29:10] [INFO ] Dead Transitions using invariants and state equation in 166 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1277 ms. Remains : 269/269 places, 241/241 transitions.
Computed a total of 62 stabilizing places and 62 stable transitions
Computed a total of 62 stabilizing places and 62 stable transitions
Detected a total of 62/269 stabilizing places and 62/241 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND p1 (NOT p0)), (X (NOT (AND (NOT p1) p0))), (X (NOT p0)), true, (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT p0))), (X (X (NOT (AND p1 p0)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 8 factoid took 649 ms. Reduced automaton from 4 states, 7 edges and 2 AP (stutter sensitive) to 4 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 264 ms :[(OR (NOT p0) (NOT p1)), (AND (NOT p1) p0), (AND (NOT p1) p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 3) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-19 08:29:11] [INFO ] Invariant cache hit.
[2023-03-19 08:29:11] [INFO ] [Real]Absence check using 45 positive place invariants in 12 ms returned sat
[2023-03-19 08:29:11] [INFO ] After 86ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-19 08:29:11] [INFO ] Deduced a trap composed of 18 places in 62 ms of which 0 ms to minimize.
[2023-03-19 08:29:11] [INFO ] Deduced a trap composed of 18 places in 39 ms of which 0 ms to minimize.
[2023-03-19 08:29:11] [INFO ] Deduced a trap composed of 17 places in 70 ms of which 1 ms to minimize.
[2023-03-19 08:29:11] [INFO ] Deduced a trap composed of 17 places in 48 ms of which 1 ms to minimize.
[2023-03-19 08:29:11] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 288 ms
[2023-03-19 08:29:11] [INFO ] After 391ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-19 08:29:11] [INFO ] After 516ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-19 08:29:11] [INFO ] [Nat]Absence check using 45 positive place invariants in 9 ms returned sat
[2023-03-19 08:29:11] [INFO ] After 149ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-19 08:29:12] [INFO ] Deduced a trap composed of 18 places in 291 ms of which 1 ms to minimize.
[2023-03-19 08:29:12] [INFO ] Deduced a trap composed of 18 places in 195 ms of which 0 ms to minimize.
[2023-03-19 08:29:12] [INFO ] Deduced a trap composed of 17 places in 33 ms of which 0 ms to minimize.
[2023-03-19 08:29:12] [INFO ] Deduced a trap composed of 17 places in 39 ms of which 0 ms to minimize.
[2023-03-19 08:29:12] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 628 ms
[2023-03-19 08:29:12] [INFO ] After 785ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 25 ms.
[2023-03-19 08:29:12] [INFO ] After 924ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished Parikh walk after 166 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=83 )
Parikh walk visited 1 properties in 1 ms.
Knowledge obtained : [(AND p1 (NOT p0)), (X (NOT (AND (NOT p1) p0))), (X (NOT p0)), true, (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT p0))), (X (X (NOT (AND p1 p0)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (AND (NOT p1) p0)), (F p0), (F (AND p1 p0))]
Knowledge based reduction with 8 factoid took 540 ms. Reduced automaton from 4 states, 7 edges and 2 AP (stutter sensitive) to 4 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 227 ms :[(OR (NOT p0) (NOT p1)), (AND (NOT p1) p0), (AND (NOT p1) p0), (NOT p0)]
Stuttering acceptance computed with spot in 186 ms :[(OR (NOT p0) (NOT p1)), (AND (NOT p1) p0), (AND (NOT p1) p0), (NOT p0)]
[2023-03-19 08:29:13] [INFO ] Invariant cache hit.
[2023-03-19 08:29:13] [INFO ] [Real]Absence check using 45 positive place invariants in 13 ms returned sat
[2023-03-19 08:29:13] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-19 08:29:13] [INFO ] [Real]Absence check using state equation in 231 ms returned sat
[2023-03-19 08:29:13] [INFO ] Solution in real domain found non-integer solution.
[2023-03-19 08:29:14] [INFO ] [Nat]Absence check using 45 positive place invariants in 12 ms returned sat
[2023-03-19 08:29:14] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-19 08:29:14] [INFO ] [Nat]Absence check using state equation in 233 ms returned sat
[2023-03-19 08:29:14] [INFO ] Deduced a trap composed of 17 places in 69 ms of which 3 ms to minimize.
[2023-03-19 08:29:14] [INFO ] Deduced a trap composed of 20 places in 92 ms of which 13 ms to minimize.
[2023-03-19 08:29:14] [INFO ] Deduced a trap composed of 12 places in 49 ms of which 1 ms to minimize.
[2023-03-19 08:29:14] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 262 ms
[2023-03-19 08:29:14] [INFO ] Computed and/alt/rep : 240/357/240 causal constraints (skipped 0 transitions) in 24 ms.
[2023-03-19 08:29:16] [INFO ] Added : 205 causal constraints over 41 iterations in 1485 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 279 ms :[(OR (NOT p0) (NOT p1)), (AND (NOT p1) p0), (AND (NOT p1) p0), (NOT p0)]
Product exploration explored 100000 steps with 0 reset in 317 ms.
Product exploration explored 100000 steps with 0 reset in 341 ms.
Applying partial POR strategy [false, true, true, true]
Stuttering acceptance computed with spot in 266 ms :[(OR (NOT p0) (NOT p1)), (AND (NOT p1) p0), (AND (NOT p1) p0), (NOT p0)]
Support contains 2 out of 269 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 269/269 places, 241/241 transitions.
Performed 56 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 56 rules applied. Total rules applied 56 place count 269 transition count 241
Performed 20 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 20 Pre rules applied. Total rules applied 56 place count 269 transition count 257
Deduced a syphon composed of 76 places in 1 ms
Iterating global reduction 1 with 20 rules applied. Total rules applied 76 place count 269 transition count 257
Performed 73 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 149 places in 1 ms
Iterating global reduction 1 with 73 rules applied. Total rules applied 149 place count 269 transition count 257
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 150 place count 269 transition count 256
Discarding 30 places :
Symmetric choice reduction at 2 with 30 rule applications. Total rules 180 place count 239 transition count 226
Deduced a syphon composed of 119 places in 1 ms
Iterating global reduction 2 with 30 rules applied. Total rules applied 210 place count 239 transition count 226
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 120 places in 0 ms
Iterating global reduction 2 with 1 rules applied. Total rules applied 211 place count 239 transition count 226
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 213 place count 237 transition count 224
Deduced a syphon composed of 118 places in 0 ms
Iterating global reduction 2 with 2 rules applied. Total rules applied 215 place count 237 transition count 224
Performed 15 Post agglomeration using F-continuation condition.Transition count delta: -63
Deduced a syphon composed of 133 places in 1 ms
Iterating global reduction 2 with 15 rules applied. Total rules applied 230 place count 237 transition count 287
Discarding 15 places :
Symmetric choice reduction at 2 with 15 rule applications. Total rules 245 place count 222 transition count 257
Deduced a syphon composed of 118 places in 0 ms
Iterating global reduction 2 with 15 rules applied. Total rules applied 260 place count 222 transition count 257
Deduced a syphon composed of 118 places in 0 ms
Applied a total of 260 rules in 173 ms. Remains 222 /269 variables (removed 47) and now considering 257/241 (removed -16) transitions.
[2023-03-19 08:29:17] [INFO ] Redundant transitions in 12 ms returned []
// Phase 1: matrix 257 rows 222 cols
[2023-03-19 08:29:17] [INFO ] Computed 45 place invariants in 6 ms
[2023-03-19 08:29:18] [INFO ] Dead Transitions using invariants and state equation in 192 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 222/269 places, 257/241 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 403 ms. Remains : 222/269 places, 257/241 transitions.
Built C files in :
/tmp/ltsmin14803680377834045663
[2023-03-19 08:29:18] [INFO ] Built C files in 18ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14803680377834045663
Running compilation step : cd /tmp/ltsmin14803680377834045663;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 635 ms.
Running link step : cd /tmp/ltsmin14803680377834045663;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 98 ms.
Running LTSmin : cd /tmp/ltsmin14803680377834045663;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased7533384904232278524.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 2 out of 269 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 269/269 places, 241/241 transitions.
Applied a total of 0 rules in 9 ms. Remains 269 /269 variables (removed 0) and now considering 241/241 (removed 0) transitions.
// Phase 1: matrix 241 rows 269 cols
[2023-03-19 08:29:33] [INFO ] Computed 45 place invariants in 7 ms
[2023-03-19 08:29:33] [INFO ] Implicit Places using invariants in 182 ms returned []
[2023-03-19 08:29:33] [INFO ] Invariant cache hit.
[2023-03-19 08:29:33] [INFO ] Implicit Places using invariants and state equation in 281 ms returned []
Implicit Place search using SMT with State Equation took 507 ms to find 0 implicit places.
[2023-03-19 08:29:33] [INFO ] Invariant cache hit.
[2023-03-19 08:29:33] [INFO ] Dead Transitions using invariants and state equation in 178 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 708 ms. Remains : 269/269 places, 241/241 transitions.
Built C files in :
/tmp/ltsmin11948483001264071008
[2023-03-19 08:29:34] [INFO ] Built C files in 3ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11948483001264071008
Running compilation step : cd /tmp/ltsmin11948483001264071008;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 342 ms.
Running link step : cd /tmp/ltsmin11948483001264071008;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 41 ms.
Running LTSmin : cd /tmp/ltsmin11948483001264071008;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased1438988993433822635.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2023-03-19 08:29:49] [INFO ] Flatten gal took : 12 ms
[2023-03-19 08:29:49] [INFO ] Flatten gal took : 10 ms
[2023-03-19 08:29:49] [INFO ] Time to serialize gal into /tmp/LTL15680075525869285491.gal : 4 ms
[2023-03-19 08:29:49] [INFO ] Time to serialize properties into /tmp/LTL1279678247680331289.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL15680075525869285491.gal' '-t' 'CGAL' '-hoa' '/tmp/aut1380656583939762903.hoa' '-atoms' '/tmp/LTL1279678247680331289.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...318
Loading property file /tmp/LTL1279678247680331289.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut1380656583939762903.hoa
Detected timeout of ITS tools.
[2023-03-19 08:30:04] [INFO ] Flatten gal took : 19 ms
[2023-03-19 08:30:04] [INFO ] Flatten gal took : 10 ms
[2023-03-19 08:30:04] [INFO ] Time to serialize gal into /tmp/LTL16790464620061053429.gal : 2 ms
[2023-03-19 08:30:04] [INFO ] Time to serialize properties into /tmp/LTL14380780475880474584.ltl : 4 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL16790464620061053429.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL14380780475880474584.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 1 LTL properties
Checking formula 0 : !((F((G((F("(p244==1)"))&&(X("(p16!=1)"))))||((X((F("(p244==1)"))&&(X("(p16!=1)"))))&&(G(("(p16!=1)")||(F("(p244!=1)"))))))))
Formula 0 simplified : G(F(G!"(p244==1)" | X!"(p16!=1)") & (X(G!"(p244==1)" | X!"(p16!=1)") | F(!"(p16!=1)" & G!"(p244!=1)")))
Detected timeout of ITS tools.
[2023-03-19 08:30:19] [INFO ] Flatten gal took : 15 ms
[2023-03-19 08:30:19] [INFO ] Applying decomposition
[2023-03-19 08:30:19] [INFO ] Flatten gal took : 10 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/convert-linux64' '-i' '/tmp/graph16754763159599346892.txt' '-o' '/tmp/graph16754763159599346892.bin' '-w' '/tmp/graph16754763159599346892.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph16754763159599346892.bin' '-l' '-1' '-v' '-w' '/tmp/graph16754763159599346892.weights' '-q' '0' '-e' '0.001'
[2023-03-19 08:30:19] [INFO ] Decomposing Gal with order
[2023-03-19 08:30:19] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-19 08:30:19] [INFO ] Removed a total of 43 redundant transitions.
[2023-03-19 08:30:19] [INFO ] Flatten gal took : 46 ms
[2023-03-19 08:30:19] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 3 ms.
[2023-03-19 08:30:19] [INFO ] Time to serialize gal into /tmp/LTL7615502555816026172.gal : 4 ms
[2023-03-19 08:30:19] [INFO ] Time to serialize properties into /tmp/LTL18254376867893795673.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL7615502555816026172.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL18254376867893795673.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...255
Read 1 LTL properties
Checking formula 0 : !((F((G((F("(i13.i1.u76.p244==1)"))&&(X("(i4.i0.u7.p16!=1)"))))||((X((F("(i13.i1.u76.p244==1)"))&&(X("(i4.i0.u7.p16!=1)"))))&&(G(("(i4...206
Formula 0 simplified : G(F(G!"(i13.i1.u76.p244==1)" | X!"(i4.i0.u7.p16!=1)") & (X(G!"(i13.i1.u76.p244==1)" | X!"(i4.i0.u7.p16!=1)") | F(!"(i4.i0.u7.p16!=1)...186
Reverse transition relation is NOT exact ! Due to transitions t49, t52, t96, t99, t153, t195, t198, t226, t231, t235, t249, i0.i1.u82.t51, i0.i2.t19, i0.i2...952
Computing Next relation with stutter on 369558 deadlock states
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin12479461997472143994
[2023-03-19 08:30:34] [INFO ] Built C files in 8ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12479461997472143994
Running compilation step : cd /tmp/ltsmin12479461997472143994;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 383 ms.
Running link step : cd /tmp/ltsmin12479461997472143994;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 35 ms.
Running LTSmin : cd /tmp/ltsmin12479461997472143994;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '<>(([]((<>((LTLAPp0==true))&&X((LTLAPp1==true))))||(X((<>((LTLAPp0==true))&&X((LTLAPp1==true))))&&[](((LTLAPp1==true)||<>(!(LTLAPp0==true)))))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property ShieldPPPt-PT-004B-LTLFireability-00 finished in 109232 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((p0||G(F(p1)))))'
Support contains 2 out of 280 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 280/280 places, 252/252 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 58 transitions
Trivial Post-agglo rules discarded 58 transitions
Performed 58 trivial Post agglomeration. Transition count delta: 58
Iterating post reduction 0 with 58 rules applied. Total rules applied 58 place count 279 transition count 193
Reduce places removed 58 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 59 rules applied. Total rules applied 117 place count 221 transition count 192
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 118 place count 220 transition count 192
Performed 26 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 26 Pre rules applied. Total rules applied 118 place count 220 transition count 166
Deduced a syphon composed of 26 places in 0 ms
Reduce places removed 26 places and 0 transitions.
Iterating global reduction 3 with 52 rules applied. Total rules applied 170 place count 194 transition count 166
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 178 place count 186 transition count 158
Iterating global reduction 3 with 8 rules applied. Total rules applied 186 place count 186 transition count 158
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 6 Pre rules applied. Total rules applied 186 place count 186 transition count 152
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 3 with 12 rules applied. Total rules applied 198 place count 180 transition count 152
Performed 62 Post agglomeration using F-continuation condition.Transition count delta: 62
Deduced a syphon composed of 62 places in 0 ms
Reduce places removed 62 places and 0 transitions.
Iterating global reduction 3 with 124 rules applied. Total rules applied 322 place count 118 transition count 90
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 323 place count 118 transition count 89
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 325 place count 117 transition count 88
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 4 with 22 rules applied. Total rules applied 347 place count 106 transition count 88
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 349 place count 104 transition count 86
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 350 place count 103 transition count 86
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 2 Pre rules applied. Total rules applied 350 place count 103 transition count 84
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 354 place count 101 transition count 84
Applied a total of 354 rules in 54 ms. Remains 101 /280 variables (removed 179) and now considering 84/252 (removed 168) transitions.
// Phase 1: matrix 84 rows 101 cols
[2023-03-19 08:30:50] [INFO ] Computed 44 place invariants in 3 ms
[2023-03-19 08:30:50] [INFO ] Implicit Places using invariants in 107 ms returned [84, 88]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 110 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 99/280 places, 84/252 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 97 transition count 82
Applied a total of 4 rules in 4 ms. Remains 97 /99 variables (removed 2) and now considering 82/84 (removed 2) transitions.
// Phase 1: matrix 82 rows 97 cols
[2023-03-19 08:30:50] [INFO ] Computed 42 place invariants in 2 ms
[2023-03-19 08:30:50] [INFO ] Implicit Places using invariants in 110 ms returned []
[2023-03-19 08:30:50] [INFO ] Invariant cache hit.
[2023-03-19 08:30:50] [INFO ] State equation strengthened by 8 read => feed constraints.
[2023-03-19 08:30:50] [INFO ] Implicit Places using invariants and state equation in 183 ms returned []
Implicit Place search using SMT with State Equation took 295 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 97/280 places, 82/252 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 464 ms. Remains : 97/280 places, 82/252 transitions.
Stuttering acceptance computed with spot in 125 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : ShieldPPPt-PT-004B-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(EQ s3 1), p1:(EQ s76 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 20782 reset in 257 ms.
Stack based approach found an accepted trace after 1396 steps with 297 reset with depth 8 and stack size 8 in 11 ms.
FORMULA ShieldPPPt-PT-004B-LTLFireability-01 FALSE TECHNIQUES STACK_TEST
Treatment of property ShieldPPPt-PT-004B-LTLFireability-01 finished in 887 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 2 out of 280 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 280/280 places, 252/252 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 59 transitions
Trivial Post-agglo rules discarded 59 transitions
Performed 59 trivial Post agglomeration. Transition count delta: 59
Iterating post reduction 0 with 59 rules applied. Total rules applied 59 place count 279 transition count 192
Reduce places removed 59 places and 0 transitions.
Iterating post reduction 1 with 59 rules applied. Total rules applied 118 place count 220 transition count 192
Performed 25 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 25 Pre rules applied. Total rules applied 118 place count 220 transition count 167
Deduced a syphon composed of 25 places in 1 ms
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 2 with 50 rules applied. Total rules applied 168 place count 195 transition count 167
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 176 place count 187 transition count 159
Iterating global reduction 2 with 8 rules applied. Total rules applied 184 place count 187 transition count 159
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 6 Pre rules applied. Total rules applied 184 place count 187 transition count 153
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 196 place count 181 transition count 153
Performed 65 Post agglomeration using F-continuation condition.Transition count delta: 65
Deduced a syphon composed of 65 places in 0 ms
Reduce places removed 65 places and 0 transitions.
Iterating global reduction 2 with 130 rules applied. Total rules applied 326 place count 116 transition count 88
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 327 place count 116 transition count 87
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 329 place count 115 transition count 86
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 3 with 22 rules applied. Total rules applied 351 place count 104 transition count 86
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 353 place count 102 transition count 84
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 354 place count 101 transition count 84
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 354 place count 101 transition count 82
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 358 place count 99 transition count 82
Applied a total of 358 rules in 67 ms. Remains 99 /280 variables (removed 181) and now considering 82/252 (removed 170) transitions.
// Phase 1: matrix 82 rows 99 cols
[2023-03-19 08:30:50] [INFO ] Computed 44 place invariants in 1 ms
[2023-03-19 08:30:51] [INFO ] Implicit Places using invariants in 112 ms returned [82, 86]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 114 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 97/280 places, 82/252 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 95 transition count 80
Applied a total of 4 rules in 6 ms. Remains 95 /97 variables (removed 2) and now considering 80/82 (removed 2) transitions.
// Phase 1: matrix 80 rows 95 cols
[2023-03-19 08:30:51] [INFO ] Computed 42 place invariants in 0 ms
[2023-03-19 08:30:51] [INFO ] Implicit Places using invariants in 81 ms returned []
[2023-03-19 08:30:51] [INFO ] Invariant cache hit.
[2023-03-19 08:30:51] [INFO ] Implicit Places using invariants and state equation in 206 ms returned []
Implicit Place search using SMT with State Equation took 289 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 95/280 places, 80/252 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 476 ms. Remains : 95/280 places, 80/252 transitions.
Stuttering acceptance computed with spot in 94 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ShieldPPPt-PT-004B-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (NEQ s66 1) (NEQ s78 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 4248 reset in 193 ms.
Stack based approach found an accepted trace after 13125 steps with 571 reset with depth 31 and stack size 31 in 23 ms.
FORMULA ShieldPPPt-PT-004B-LTLFireability-02 FALSE TECHNIQUES STACK_TEST
Treatment of property ShieldPPPt-PT-004B-LTLFireability-02 finished in 814 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((X(X((p0||G(p1))))&&(p2||X(p3)))))'
Support contains 4 out of 280 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 280/280 places, 252/252 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 270 transition count 242
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 270 transition count 242
Applied a total of 20 rules in 4 ms. Remains 270 /280 variables (removed 10) and now considering 242/252 (removed 10) transitions.
// Phase 1: matrix 242 rows 270 cols
[2023-03-19 08:30:51] [INFO ] Computed 45 place invariants in 1 ms
[2023-03-19 08:30:51] [INFO ] Implicit Places using invariants in 176 ms returned []
[2023-03-19 08:30:51] [INFO ] Invariant cache hit.
[2023-03-19 08:30:52] [INFO ] Implicit Places using invariants and state equation in 293 ms returned []
Implicit Place search using SMT with State Equation took 471 ms to find 0 implicit places.
[2023-03-19 08:30:52] [INFO ] Invariant cache hit.
[2023-03-19 08:30:52] [INFO ] Dead Transitions using invariants and state equation in 214 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 270/280 places, 242/252 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 702 ms. Remains : 270/280 places, 242/252 transitions.
Stuttering acceptance computed with spot in 579 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p2) (NOT p3))), (AND (NOT p0) (NOT p1)), (OR (AND (NOT p0) (NOT p1) (NOT p3)) (AND (NOT p2) (NOT p3))), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1) (NOT p3)), false, (AND (NOT p2) (NOT p3) p0 (NOT p1))]
Running random walk in product with property : ShieldPPPt-PT-004B-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}, { cond=(NOT p2), acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={0} source=1 dest: 3}, { cond=(NOT p2), acceptance={0} source=1 dest: 4}], [{ cond=(NOT p3), acceptance={0} source=2 dest: 1}, { cond=(AND (NOT p2) (NOT p3)), acceptance={0} source=2 dest: 2}], [{ cond=(AND (NOT p0) p1), acceptance={} source=3 dest: 3}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=3 dest: 3}, { cond=(AND (NOT p2) (NOT p0) p1), acceptance={} source=3 dest: 4}, { cond=(AND (NOT p2) (NOT p0) (NOT p1)), acceptance={0} source=3 dest: 4}], [{ cond=(AND (NOT p3) (NOT p0) (NOT p1)), acceptance={0} source=4 dest: 1}, { cond=(AND (NOT p2) (NOT p3) (NOT p0) (NOT p1)), acceptance={0} source=4 dest: 2}, { cond=(AND (NOT p3) (NOT p0) p1), acceptance={} source=4 dest: 5}, { cond=(AND (NOT p2) (NOT p3) (NOT p0) p1), acceptance={} source=4 dest: 6}], [{ cond=(AND p0 p1), acceptance={} source=5 dest: 3}, { cond=(AND p0 (NOT p1)), acceptance={0} source=5 dest: 3}, { cond=(AND (NOT p2) p0 p1), acceptance={} source=5 dest: 4}, { cond=(AND (NOT p2) p0 (NOT p1)), acceptance={0} source=5 dest: 4}], [{ cond=(AND (NOT p3) p0 (NOT p1)), acceptance={0} source=6 dest: 1}, { cond=(AND (NOT p2) (NOT p3) p0 (NOT p1)), acceptance={0} source=6 dest: 2}, { cond=(AND (NOT p3) p0 p1), acceptance={} source=6 dest: 5}, { cond=(AND (NOT p2) (NOT p3) p0 p1), acceptance={} source=6 dest: 6}]], initial=0, aps=[p2:(EQ s246 0), p3:(EQ s194 0), p0:(AND (EQ s169 1) (EQ s195 1)), p1:(EQ s246 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 890 reset in 281 ms.
Stack based approach found an accepted trace after 921 steps with 8 reset with depth 95 and stack size 95 in 3 ms.
FORMULA ShieldPPPt-PT-004B-LTLFireability-03 FALSE TECHNIQUES STACK_TEST
Treatment of property ShieldPPPt-PT-004B-LTLFireability-03 finished in 1607 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((p0 U ((G(p0) U X(p1))&&F(p2))))'
Support contains 3 out of 280 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 280/280 places, 252/252 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 272 transition count 244
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 272 transition count 244
Applied a total of 16 rules in 11 ms. Remains 272 /280 variables (removed 8) and now considering 244/252 (removed 8) transitions.
// Phase 1: matrix 244 rows 272 cols
[2023-03-19 08:30:53] [INFO ] Computed 45 place invariants in 4 ms
[2023-03-19 08:30:53] [INFO ] Implicit Places using invariants in 179 ms returned []
[2023-03-19 08:30:53] [INFO ] Invariant cache hit.
[2023-03-19 08:30:53] [INFO ] Implicit Places using invariants and state equation in 207 ms returned []
Implicit Place search using SMT with State Equation took 388 ms to find 0 implicit places.
[2023-03-19 08:30:53] [INFO ] Invariant cache hit.
[2023-03-19 08:30:53] [INFO ] Dead Transitions using invariants and state equation in 193 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 272/280 places, 244/252 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 593 ms. Remains : 272/280 places, 244/252 transitions.
Stuttering acceptance computed with spot in 367 ms :[(OR (NOT p2) (NOT p1)), (NOT p1), (NOT p2), (NOT p1), true, (AND (NOT p2) (NOT p0))]
Running random walk in product with property : ShieldPPPt-PT-004B-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(NOT p2), acceptance={} source=0 dest: 2}, { cond=p0, acceptance={} source=0 dest: 3}], [{ cond=(NOT p1), acceptance={} source=1 dest: 4}], [{ cond=(NOT p2), acceptance={0} source=2 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 1}, { cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={} source=3 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={0} source=3 dest: 3}, { cond=(AND p0 (NOT p2) (NOT p1)), acceptance={} source=3 dest: 5}], [{ cond=true, acceptance={0} source=4 dest: 4}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=5 dest: 2}, { cond=(AND p0 (NOT p2)), acceptance={} source=5 dest: 5}]], initial=0, aps=[p0:(EQ s125 1), p2:(EQ s135 1), p1:(EQ s116 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA ShieldPPPt-PT-004B-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldPPPt-PT-004B-LTLFireability-04 finished in 1004 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(G((p0||X(p1)))))))'
Support contains 2 out of 280 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 280/280 places, 252/252 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 270 transition count 242
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 270 transition count 242
Applied a total of 20 rules in 12 ms. Remains 270 /280 variables (removed 10) and now considering 242/252 (removed 10) transitions.
// Phase 1: matrix 242 rows 270 cols
[2023-03-19 08:30:54] [INFO ] Computed 45 place invariants in 3 ms
[2023-03-19 08:30:54] [INFO ] Implicit Places using invariants in 204 ms returned []
[2023-03-19 08:30:54] [INFO ] Invariant cache hit.
[2023-03-19 08:30:54] [INFO ] Implicit Places using invariants and state equation in 313 ms returned []
Implicit Place search using SMT with State Equation took 532 ms to find 0 implicit places.
[2023-03-19 08:30:54] [INFO ] Invariant cache hit.
[2023-03-19 08:30:55] [INFO ] Dead Transitions using invariants and state equation in 210 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 270/280 places, 242/252 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 756 ms. Remains : 270/280 places, 242/252 transitions.
Stuttering acceptance computed with spot in 317 ms :[true, (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : ShieldPPPt-PT-004B-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p1), acceptance={} source=1 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=1 dest: 1}, { cond=(AND p0 p1), acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 1}, { cond=p0, acceptance={} source=2 dest: 2}], [{ cond=true, acceptance={} source=3 dest: 2}], [{ cond=true, acceptance={} source=4 dest: 5}], [{ cond=true, acceptance={} source=5 dest: 3}]], initial=4, aps=[p1:(NEQ s224 1), p0:(NEQ s259 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, 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 885 steps with 0 reset in 5 ms.
FORMULA ShieldPPPt-PT-004B-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldPPPt-PT-004B-LTLFireability-05 finished in 1108 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F((p0||(X(p2)&&p1)))&&F((G(p0)||G(p3))))))'
Support contains 5 out of 280 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 280/280 places, 252/252 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 269 transition count 241
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 269 transition count 241
Applied a total of 22 rules in 12 ms. Remains 269 /280 variables (removed 11) and now considering 241/252 (removed 11) transitions.
// Phase 1: matrix 241 rows 269 cols
[2023-03-19 08:30:55] [INFO ] Computed 45 place invariants in 3 ms
[2023-03-19 08:30:55] [INFO ] Implicit Places using invariants in 168 ms returned []
[2023-03-19 08:30:55] [INFO ] Invariant cache hit.
[2023-03-19 08:30:55] [INFO ] Implicit Places using invariants and state equation in 277 ms returned []
Implicit Place search using SMT with State Equation took 461 ms to find 0 implicit places.
[2023-03-19 08:30:55] [INFO ] Invariant cache hit.
[2023-03-19 08:30:56] [INFO ] Dead Transitions using invariants and state equation in 162 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 269/280 places, 241/252 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 636 ms. Remains : 269/280 places, 241/252 transitions.
Stuttering acceptance computed with spot in 284 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p3)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p3)), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : ShieldPPPt-PT-004B-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}, { cond=(OR (NOT p0) (NOT p3)), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p0) p1), acceptance={} source=0 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0, 1} source=1 dest: 1}, { cond=(AND (NOT p0) p1), acceptance={0, 1} source=1 dest: 3}], [{ cond=(AND p0 p3), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p0) p3), acceptance={0} source=2 dest: 2}, { cond=(AND p0 (NOT p3)), acceptance={1} source=2 dest: 2}, { cond=(AND (NOT p0) (NOT p3)), acceptance={0, 1} source=2 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={0, 1} source=3 dest: 1}, { cond=(AND (NOT p0) p1 (NOT p2)), acceptance={0, 1} source=3 dest: 3}]], initial=0, aps=[p0:(EQ s231 1), p1:(AND (EQ s83 1) (EQ s120 1)), p3:(AND (EQ s216 1) (EQ s246 1)), p2:(AND (EQ s83 1) (EQ s120 1))], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 1 reset in 296 ms.
Stack based approach found an accepted trace after 485 steps with 0 reset with depth 486 and stack size 486 in 2 ms.
FORMULA ShieldPPPt-PT-004B-LTLFireability-06 FALSE TECHNIQUES STACK_TEST
Treatment of property ShieldPPPt-PT-004B-LTLFireability-06 finished in 1265 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0)||F(G(p1))))'
Support contains 2 out of 280 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 280/280 places, 252/252 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 57 transitions
Trivial Post-agglo rules discarded 57 transitions
Performed 57 trivial Post agglomeration. Transition count delta: 57
Iterating post reduction 0 with 57 rules applied. Total rules applied 57 place count 279 transition count 194
Reduce places removed 57 places and 0 transitions.
Iterating post reduction 1 with 57 rules applied. Total rules applied 114 place count 222 transition count 194
Performed 25 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 25 Pre rules applied. Total rules applied 114 place count 222 transition count 169
Deduced a syphon composed of 25 places in 0 ms
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 2 with 50 rules applied. Total rules applied 164 place count 197 transition count 169
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 172 place count 189 transition count 161
Iterating global reduction 2 with 8 rules applied. Total rules applied 180 place count 189 transition count 161
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 6 Pre rules applied. Total rules applied 180 place count 189 transition count 155
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 192 place count 183 transition count 155
Performed 67 Post agglomeration using F-continuation condition.Transition count delta: 67
Deduced a syphon composed of 67 places in 0 ms
Reduce places removed 67 places and 0 transitions.
Iterating global reduction 2 with 134 rules applied. Total rules applied 326 place count 116 transition count 88
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 327 place count 116 transition count 87
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 329 place count 115 transition count 86
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 3 with 20 rules applied. Total rules applied 349 place count 105 transition count 86
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 351 place count 103 transition count 84
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 352 place count 102 transition count 84
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 352 place count 102 transition count 82
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 356 place count 100 transition count 82
Applied a total of 356 rules in 31 ms. Remains 100 /280 variables (removed 180) and now considering 82/252 (removed 170) transitions.
// Phase 1: matrix 82 rows 100 cols
[2023-03-19 08:30:56] [INFO ] Computed 44 place invariants in 1 ms
[2023-03-19 08:30:56] [INFO ] Implicit Places using invariants in 152 ms returned [83, 87]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 168 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 98/280 places, 82/252 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 97 transition count 81
Applied a total of 2 rules in 3 ms. Remains 97 /98 variables (removed 1) and now considering 81/82 (removed 1) transitions.
// Phase 1: matrix 81 rows 97 cols
[2023-03-19 08:30:56] [INFO ] Computed 42 place invariants in 1 ms
[2023-03-19 08:30:56] [INFO ] Implicit Places using invariants in 108 ms returned []
[2023-03-19 08:30:56] [INFO ] Invariant cache hit.
[2023-03-19 08:30:57] [INFO ] Implicit Places using invariants and state equation in 199 ms returned []
Implicit Place search using SMT with State Equation took 307 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 97/280 places, 81/252 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 510 ms. Remains : 97/280 places, 81/252 transitions.
Stuttering acceptance computed with spot in 106 ms :[(AND (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : ShieldPPPt-PT-004B-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=p1, acceptance={} source=1 dest: 1}, { cond=(NOT p1), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(EQ s28 1), p1:(EQ s82 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 0 reset in 230 ms.
Stack based approach found an accepted trace after 183 steps with 0 reset with depth 184 and stack size 180 in 1 ms.
FORMULA ShieldPPPt-PT-004B-LTLFireability-07 FALSE TECHNIQUES STACK_TEST
Treatment of property ShieldPPPt-PT-004B-LTLFireability-07 finished in 884 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((X(F(!(p0 U p1)))&&(F(p0)||p2))))'
Support contains 2 out of 280 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 280/280 places, 252/252 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 270 transition count 242
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 270 transition count 242
Applied a total of 20 rules in 8 ms. Remains 270 /280 variables (removed 10) and now considering 242/252 (removed 10) transitions.
// Phase 1: matrix 242 rows 270 cols
[2023-03-19 08:30:57] [INFO ] Computed 45 place invariants in 3 ms
[2023-03-19 08:30:57] [INFO ] Implicit Places using invariants in 176 ms returned []
[2023-03-19 08:30:57] [INFO ] Invariant cache hit.
[2023-03-19 08:30:57] [INFO ] Implicit Places using invariants and state equation in 228 ms returned []
Implicit Place search using SMT with State Equation took 405 ms to find 0 implicit places.
[2023-03-19 08:30:57] [INFO ] Invariant cache hit.
[2023-03-19 08:30:58] [INFO ] Dead Transitions using invariants and state equation in 187 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 270/280 places, 242/252 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 600 ms. Remains : 270/280 places, 242/252 transitions.
Stuttering acceptance computed with spot in 208 ms :[(OR p1 (AND (NOT p0) (NOT p2))), p1, (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) p1)), (AND (NOT p0) p1)]
Running random walk in product with property : ShieldPPPt-PT-004B-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}, { cond=(AND (NOT p2) (NOT p0)), acceptance={} source=0 dest: 2}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 1}, { cond=p1, acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p2) (NOT p0)), acceptance={0} source=2 dest: 2}, { cond=(AND p2 (NOT p0)), acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p0) p1), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p2:(AND (EQ s42 1) (EQ s176 1)), p0:(EQ s176 1), p1:(EQ s42 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 348 reset in 217 ms.
Stack based approach found an accepted trace after 661 steps with 3 reset with depth 368 and stack size 368 in 2 ms.
FORMULA ShieldPPPt-PT-004B-LTLFireability-08 FALSE TECHNIQUES STACK_TEST
Treatment of property ShieldPPPt-PT-004B-LTLFireability-08 finished in 1063 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((G((G(p0)||X(p1))) U p2)||G(!p1)))'
Support contains 3 out of 280 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 280/280 places, 252/252 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 270 transition count 242
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 270 transition count 242
Applied a total of 20 rules in 4 ms. Remains 270 /280 variables (removed 10) and now considering 242/252 (removed 10) transitions.
// Phase 1: matrix 242 rows 270 cols
[2023-03-19 08:30:58] [INFO ] Computed 45 place invariants in 1 ms
[2023-03-19 08:30:58] [INFO ] Implicit Places using invariants in 170 ms returned []
[2023-03-19 08:30:58] [INFO ] Invariant cache hit.
[2023-03-19 08:30:59] [INFO ] Implicit Places using invariants and state equation in 238 ms returned []
Implicit Place search using SMT with State Equation took 416 ms to find 0 implicit places.
[2023-03-19 08:30:59] [INFO ] Invariant cache hit.
[2023-03-19 08:30:59] [INFO ] Dead Transitions using invariants and state equation in 145 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 270/280 places, 242/252 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 567 ms. Remains : 270/280 places, 242/252 transitions.
Stuttering acceptance computed with spot in 735 ms :[(AND p1 (NOT p2)), (NOT p1), (AND (NOT p0) (NOT p1)), (NOT p2), false, false, false, (AND (NOT p1) (NOT p0)), true, p1, (AND p1 (NOT p0))]
Running random walk in product with property : ShieldPPPt-PT-004B-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p2) (NOT p0) p1), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p2) p1), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p2) p1), acceptance={} source=0 dest: 3}, { cond=(AND (NOT p2) (NOT p0) (NOT p1)), acceptance={} source=0 dest: 4}, { cond=(AND (NOT p2) (NOT p1)), acceptance={} source=0 dest: 5}, { cond=(AND (NOT p2) p0 (NOT p1)), acceptance={} source=0 dest: 6}, { cond=(AND (NOT p2) p0 p1), acceptance={} source=0 dest: 7}], [{ cond=(NOT p1), acceptance={} source=1 dest: 8}], [{ cond=(NOT p0), acceptance={} source=2 dest: 1}, { cond=true, acceptance={} source=2 dest: 2}, { cond=p0, acceptance={} source=2 dest: 7}], [{ cond=(AND (NOT p2) (NOT p0)), acceptance={0} source=3 dest: 1}, { cond=(NOT p2), acceptance={0} source=3 dest: 2}, { cond=(NOT p2), acceptance={0} source=3 dest: 3}, { cond=(AND (NOT p2) p0), acceptance={0} source=3 dest: 7}], [{ cond=(NOT p1), acceptance={} source=4 dest: 9}], [{ cond=(AND (NOT p0) p1), acceptance={} source=5 dest: 1}, { cond=p1, acceptance={} source=5 dest: 2}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=5 dest: 4}, { cond=(NOT p1), acceptance={} source=5 dest: 5}, { cond=(AND p0 (NOT p1)), acceptance={} source=5 dest: 6}, { cond=(AND p0 p1), acceptance={} source=5 dest: 7}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=6 dest: 9}, { cond=(AND p0 (NOT p1)), acceptance={} source=6 dest: 10}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=7 dest: 8}, { cond=(AND p0 (NOT p1)), acceptance={} source=7 dest: 10}], [{ cond=true, acceptance={0} source=8 dest: 8}], [{ cond=p1, acceptance={} source=9 dest: 8}, { cond=(NOT p1), acceptance={} source=9 dest: 9}], [{ cond=(AND (NOT p0) p1), acceptance={} source=10 dest: 8}, { cond=(AND p0 p1), acceptance={} source=10 dest: 10}]], initial=0, aps=[p2:(EQ s7 1), p1:(NEQ s253 1), p0:(EQ s112 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, 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 62 steps with 14 reset in 1 ms.
FORMULA ShieldPPPt-PT-004B-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldPPPt-PT-004B-LTLFireability-11 finished in 1350 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(p0) U p1)))'
Support contains 3 out of 280 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 280/280 places, 252/252 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 271 transition count 243
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 271 transition count 243
Applied a total of 18 rules in 7 ms. Remains 271 /280 variables (removed 9) and now considering 243/252 (removed 9) transitions.
// Phase 1: matrix 243 rows 271 cols
[2023-03-19 08:30:59] [INFO ] Computed 45 place invariants in 1 ms
[2023-03-19 08:31:00] [INFO ] Implicit Places using invariants in 187 ms returned []
[2023-03-19 08:31:00] [INFO ] Invariant cache hit.
[2023-03-19 08:31:00] [INFO ] Implicit Places using invariants and state equation in 281 ms returned []
Implicit Place search using SMT with State Equation took 498 ms to find 0 implicit places.
[2023-03-19 08:31:00] [INFO ] Invariant cache hit.
[2023-03-19 08:31:00] [INFO ] Dead Transitions using invariants and state equation in 147 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 271/280 places, 243/252 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 662 ms. Remains : 271/280 places, 243/252 transitions.
Stuttering acceptance computed with spot in 205 ms :[(NOT p1), (NOT p1), true, (NOT p0)]
Running random walk in product with property : ShieldPPPt-PT-004B-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p1) p0), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 2}, { cond=(AND (NOT p1) p0), acceptance={0} source=1 dest: 3}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(NOT p0), acceptance={} source=3 dest: 2}, { cond=p0, acceptance={} source=3 dest: 3}]], initial=0, aps=[p1:(EQ s180 1), p0:(AND (NEQ s113 1) (EQ s138 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 0 ms.
FORMULA ShieldPPPt-PT-004B-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldPPPt-PT-004B-LTLFireability-12 finished in 894 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((X(X((G(X(p0))&&p0))) U p1)))'
Support contains 2 out of 280 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 280/280 places, 252/252 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 270 transition count 242
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 270 transition count 242
Applied a total of 20 rules in 7 ms. Remains 270 /280 variables (removed 10) and now considering 242/252 (removed 10) transitions.
// Phase 1: matrix 242 rows 270 cols
[2023-03-19 08:31:00] [INFO ] Computed 45 place invariants in 1 ms
[2023-03-19 08:31:01] [INFO ] Implicit Places using invariants in 185 ms returned []
[2023-03-19 08:31:01] [INFO ] Invariant cache hit.
[2023-03-19 08:31:01] [INFO ] Implicit Places using invariants and state equation in 147 ms returned []
Implicit Place search using SMT with State Equation took 350 ms to find 0 implicit places.
[2023-03-19 08:31:01] [INFO ] Invariant cache hit.
[2023-03-19 08:31:01] [INFO ] Dead Transitions using invariants and state equation in 213 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 270/280 places, 242/252 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 573 ms. Remains : 270/280 places, 242/252 transitions.
Stuttering acceptance computed with spot in 160 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), (NOT p0), true]
Running random walk in product with property : ShieldPPPt-PT-004B-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}, { cond=true, acceptance={0} source=1 dest: 2}], [{ cond=p0, acceptance={} source=2 dest: 2}, { cond=(NOT p0), acceptance={} source=2 dest: 3}], [{ cond=true, acceptance={0} source=3 dest: 3}]], initial=0, aps=[p1:(OR (EQ s57 1) (EQ s209 1)), p0:(EQ s209 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, 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 5 steps with 0 reset in 0 ms.
FORMULA ShieldPPPt-PT-004B-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldPPPt-PT-004B-LTLFireability-13 finished in 760 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0||X(p1)||F(p2))))'
Support contains 4 out of 280 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 280/280 places, 252/252 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 270 transition count 242
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 270 transition count 242
Applied a total of 20 rules in 5 ms. Remains 270 /280 variables (removed 10) and now considering 242/252 (removed 10) transitions.
// Phase 1: matrix 242 rows 270 cols
[2023-03-19 08:31:01] [INFO ] Computed 45 place invariants in 2 ms
[2023-03-19 08:31:01] [INFO ] Implicit Places using invariants in 170 ms returned []
[2023-03-19 08:31:01] [INFO ] Invariant cache hit.
[2023-03-19 08:31:02] [INFO ] Implicit Places using invariants and state equation in 356 ms returned []
Implicit Place search using SMT with State Equation took 549 ms to find 0 implicit places.
[2023-03-19 08:31:02] [INFO ] Invariant cache hit.
[2023-03-19 08:31:02] [INFO ] Dead Transitions using invariants and state equation in 120 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 270/280 places, 242/252 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 686 ms. Remains : 270/280 places, 242/252 transitions.
Stuttering acceptance computed with spot in 173 ms :[(AND (NOT p2) (NOT p0) (NOT p1)), (NOT p2), (AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p1))]
Running random walk in product with property : ShieldPPPt-PT-004B-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 2}], [{ cond=(NOT p2), acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=3 dest: 1}]], initial=0, aps=[p2:(EQ s251 1), p0:(EQ s177 1), p1:(AND (EQ s30 1) (EQ s72 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 2440 reset in 147 ms.
Product exploration explored 100000 steps with 2451 reset in 253 ms.
Computed a total of 63 stabilizing places and 63 stable transitions
Computed a total of 63 stabilizing places and 63 stable transitions
Detected a total of 63/270 stabilizing places and 63/242 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge obtained : [(AND (NOT p2) (NOT p0) (NOT p1)), (X (AND (NOT p0) (NOT p2))), (X (X (AND (NOT p2) (NOT p1)))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 4 factoid took 270 ms. Reduced automaton from 4 states, 4 edges and 3 AP (stutter sensitive) to 2 states, 2 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 119 ms :[(NOT p2), (NOT p2)]
Finished random walk after 33 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=33 )
Knowledge obtained : [(AND (NOT p2) (NOT p0) (NOT p1)), (X (AND (NOT p0) (NOT p2))), (X (X (AND (NOT p2) (NOT p1)))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(F p2)]
Knowledge based reduction with 4 factoid took 258 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 77 ms :[(NOT p2)]
Stuttering acceptance computed with spot in 32 ms :[(NOT p2)]
[2023-03-19 08:31:03] [INFO ] Invariant cache hit.
[2023-03-19 08:31:03] [INFO ] [Real]Absence check using 45 positive place invariants in 35 ms returned sat
[2023-03-19 08:31:03] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-19 08:31:04] [INFO ] [Real]Absence check using state equation in 449 ms returned sat
[2023-03-19 08:31:04] [INFO ] Solution in real domain found non-integer solution.
[2023-03-19 08:31:04] [INFO ] [Nat]Absence check using 45 positive place invariants in 10 ms returned sat
[2023-03-19 08:31:04] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-19 08:31:04] [INFO ] [Nat]Absence check using state equation in 222 ms returned sat
[2023-03-19 08:31:04] [INFO ] Computed and/alt/rep : 241/358/241 causal constraints (skipped 0 transitions) in 16 ms.
[2023-03-19 08:31:06] [INFO ] Added : 237 causal constraints over 49 iterations in 1761 ms. Result :sat
Could not prove EG (NOT p2)
Support contains 1 out of 270 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 : 270/270 places, 242/242 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 54 transitions
Trivial Post-agglo rules discarded 54 transitions
Performed 54 trivial Post agglomeration. Transition count delta: 54
Iterating post reduction 0 with 54 rules applied. Total rules applied 54 place count 269 transition count 187
Reduce places removed 54 places and 0 transitions.
Iterating post reduction 1 with 54 rules applied. Total rules applied 108 place count 215 transition count 187
Performed 30 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 30 Pre rules applied. Total rules applied 108 place count 215 transition count 157
Deduced a syphon composed of 30 places in 0 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 2 with 60 rules applied. Total rules applied 168 place count 185 transition count 157
Performed 66 Post agglomeration using F-continuation condition.Transition count delta: 66
Deduced a syphon composed of 66 places in 0 ms
Reduce places removed 66 places and 0 transitions.
Iterating global reduction 2 with 132 rules applied. Total rules applied 300 place count 119 transition count 91
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 301 place count 119 transition count 90
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 303 place count 118 transition count 89
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 3 with 20 rules applied. Total rules applied 323 place count 108 transition count 89
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 325 place count 106 transition count 87
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 326 place count 105 transition count 87
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 326 place count 105 transition count 85
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 330 place count 103 transition count 85
Applied a total of 330 rules in 22 ms. Remains 103 /270 variables (removed 167) and now considering 85/242 (removed 157) transitions.
// Phase 1: matrix 85 rows 103 cols
[2023-03-19 08:31:06] [INFO ] Computed 44 place invariants in 0 ms
[2023-03-19 08:31:06] [INFO ] Implicit Places using invariants in 117 ms returned [84, 88]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 118 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 101/270 places, 85/242 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 99 transition count 83
Applied a total of 4 rules in 3 ms. Remains 99 /101 variables (removed 2) and now considering 83/85 (removed 2) transitions.
// Phase 1: matrix 83 rows 99 cols
[2023-03-19 08:31:06] [INFO ] Computed 42 place invariants in 0 ms
[2023-03-19 08:31:06] [INFO ] Implicit Places using invariants in 163 ms returned []
[2023-03-19 08:31:06] [INFO ] Invariant cache hit.
[2023-03-19 08:31:06] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-19 08:31:06] [INFO ] Implicit Places using invariants and state equation in 171 ms returned []
Implicit Place search using SMT with State Equation took 335 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 99/270 places, 83/242 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 478 ms. Remains : 99/270 places, 83/242 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/99 stabilizing places and 2/83 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [(NOT p2), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(X (NOT p2)), (X p2), (X (X (NOT p2))), (X (X p2))]
Knowledge based reduction with 2 factoid took 230 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 73 ms :[(NOT p2)]
Finished random walk after 2 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=2 )
Knowledge obtained : [(NOT p2), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(X (NOT p2)), (X p2), (X (X (NOT p2))), (X (X p2)), (F p2)]
Knowledge based reduction with 2 factoid took 272 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 28 ms :[(NOT p2)]
Stuttering acceptance computed with spot in 31 ms :[(NOT p2)]
[2023-03-19 08:31:07] [INFO ] Invariant cache hit.
[2023-03-19 08:31:07] [INFO ] [Real]Absence check using 42 positive place invariants in 14 ms returned sat
[2023-03-19 08:31:07] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-19 08:31:07] [INFO ] [Real]Absence check using state equation in 96 ms returned sat
[2023-03-19 08:31:07] [INFO ] Solution in real domain found non-integer solution.
[2023-03-19 08:31:07] [INFO ] [Nat]Absence check using 42 positive place invariants in 7 ms returned sat
[2023-03-19 08:31:07] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-19 08:31:07] [INFO ] [Nat]Absence check using state equation in 37 ms returned sat
[2023-03-19 08:31:07] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-19 08:31:07] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2023-03-19 08:31:07] [INFO ] Computed and/alt/rep : 77/124/77 causal constraints (skipped 0 transitions) in 3 ms.
[2023-03-19 08:31:08] [INFO ] Added : 65 causal constraints over 13 iterations in 118 ms. Result :sat
Could not prove EG (NOT p2)
Stuttering acceptance computed with spot in 100 ms :[(NOT p2)]
Product exploration explored 100000 steps with 18441 reset in 225 ms.
Stack based approach found an accepted trace after 93 steps with 20 reset with depth 4 and stack size 4 in 1 ms.
FORMULA ShieldPPPt-PT-004B-LTLFireability-14 FALSE TECHNIQUES STACK_TEST
Treatment of property ShieldPPPt-PT-004B-LTLFireability-14 finished in 6858 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(((X((F(p0)&&X(p1)))&&G((p1||F(!p0))))||G((F(p0)&&X(p1))))))'
Found a Shortening insensitive property : ShieldPPPt-PT-004B-LTLFireability-00
Stuttering acceptance computed with spot in 408 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), (AND (NOT p1) p0), (AND (NOT p1) p0), (NOT p0), (NOT p1)]
Support contains 2 out of 280 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 280/280 places, 252/252 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 59 transitions
Trivial Post-agglo rules discarded 59 transitions
Performed 59 trivial Post agglomeration. Transition count delta: 59
Iterating post reduction 0 with 59 rules applied. Total rules applied 59 place count 279 transition count 192
Reduce places removed 59 places and 0 transitions.
Iterating post reduction 1 with 59 rules applied. Total rules applied 118 place count 220 transition count 192
Performed 26 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 26 Pre rules applied. Total rules applied 118 place count 220 transition count 166
Deduced a syphon composed of 26 places in 0 ms
Reduce places removed 26 places and 0 transitions.
Iterating global reduction 2 with 52 rules applied. Total rules applied 170 place count 194 transition count 166
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 178 place count 186 transition count 158
Iterating global reduction 2 with 8 rules applied. Total rules applied 186 place count 186 transition count 158
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 6 Pre rules applied. Total rules applied 186 place count 186 transition count 152
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 198 place count 180 transition count 152
Performed 63 Post agglomeration using F-continuation condition.Transition count delta: 63
Deduced a syphon composed of 63 places in 0 ms
Reduce places removed 63 places and 0 transitions.
Iterating global reduction 2 with 126 rules applied. Total rules applied 324 place count 117 transition count 89
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 325 place count 117 transition count 88
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 327 place count 116 transition count 87
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 3 with 22 rules applied. Total rules applied 349 place count 105 transition count 87
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 351 place count 103 transition count 85
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 352 place count 102 transition count 85
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 352 place count 102 transition count 83
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 356 place count 100 transition count 83
Applied a total of 356 rules in 62 ms. Remains 100 /280 variables (removed 180) and now considering 83/252 (removed 169) transitions.
// Phase 1: matrix 83 rows 100 cols
[2023-03-19 08:31:09] [INFO ] Computed 44 place invariants in 1 ms
[2023-03-19 08:31:09] [INFO ] Implicit Places using invariants in 116 ms returned [83, 87]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 117 ms to find 2 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 98/280 places, 83/252 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 96 transition count 81
Applied a total of 4 rules in 2 ms. Remains 96 /98 variables (removed 2) and now considering 81/83 (removed 2) transitions.
// Phase 1: matrix 81 rows 96 cols
[2023-03-19 08:31:09] [INFO ] Computed 42 place invariants in 0 ms
[2023-03-19 08:31:09] [INFO ] Implicit Places using invariants in 53 ms returned []
[2023-03-19 08:31:09] [INFO ] Invariant cache hit.
[2023-03-19 08:31:09] [INFO ] Implicit Places using invariants and state equation in 170 ms returned []
Implicit Place search using SMT with State Equation took 224 ms to find 0 implicit places.
Starting structural reductions in LI_LTL mode, iteration 2 : 96/280 places, 81/252 transitions.
Finished structural reductions in LI_LTL mode , in 2 iterations and 405 ms. Remains : 96/280 places, 81/252 transitions.
Running random walk in product with property : ShieldPPPt-PT-004B-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}, { cond=(AND (NOT p1) p0), acceptance={} source=0 dest: 3}], [{ cond=(NOT p0), acceptance={} source=1 dest: 4}, { cond=true, acceptance={} source=1 dest: 5}], [{ cond=true, acceptance={} source=2 dest: 2}, { cond=(AND (NOT p1) p0), acceptance={} source=2 dest: 3}], [{ cond=(AND p1 p0), acceptance={} source=3 dest: 3}, { cond=(AND (NOT p1) p0), acceptance={0} source=3 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=4 dest: 4}], [{ cond=(NOT p1), acceptance={} source=5 dest: 2}, { cond=(AND (NOT p1) p0), acceptance={} source=5 dest: 3}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=5 dest: 4}, { cond=(NOT p1), acceptance={0} source=5 dest: 5}]], initial=0, aps=[p1:(NEQ s3 1), p0:(EQ s79 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, cl-invariant], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 1 reset in 208 ms.
Product exploration explored 100000 steps with 5 reset in 297 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/96 stabilizing places and 2/81 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND p1 (NOT p0)), (X (NOT (AND (NOT p1) p0))), (X p0), (X (AND p1 p0)), true, (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X p1)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0)), (X (X (AND p1 p0))), (X (X (NOT (AND p1 p0))))]
Knowledge based reduction with 9 factoid took 741 ms. Reduced automaton from 6 states, 14 edges and 2 AP (stutter sensitive) to 3 states, 5 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 155 ms :[(AND (NOT p1) p0), (AND (NOT p1) p0), (AND (NOT p1) p0)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 2) seen :1
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.
[2023-03-19 08:31:10] [INFO ] Invariant cache hit.
[2023-03-19 08:31:10] [INFO ] [Real]Absence check using 42 positive place invariants in 45 ms returned sat
[2023-03-19 08:31:11] [INFO ] After 182ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-19 08:31:11] [INFO ] [Nat]Absence check using 42 positive place invariants in 10 ms returned sat
[2023-03-19 08:31:11] [INFO ] After 44ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-19 08:31:11] [INFO ] After 54ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 19 ms.
[2023-03-19 08:31:11] [INFO ] After 133ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished Parikh walk after 38 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=19 )
Parikh walk visited 1 properties in 1 ms.
Knowledge obtained : [(AND p1 (NOT p0)), (X (NOT (AND (NOT p1) p0))), (X p0), (X (AND p1 p0)), true, (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X p1)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0)), (X (X (AND p1 p0))), (X (X (NOT (AND p1 p0)))), (F (AND (NOT p1) p0)), (F (AND p1 p0))]
Knowledge based reduction with 9 factoid took 656 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter insensitive) to 3 states, 5 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 130 ms :[(AND (NOT p1) p0), (AND (NOT p1) p0), (AND (NOT p1) p0)]
Stuttering acceptance computed with spot in 118 ms :[(AND (NOT p1) p0), (AND (NOT p1) p0), (AND (NOT p1) p0)]
Support contains 2 out of 96 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 96/96 places, 81/81 transitions.
Applied a total of 0 rules in 1 ms. Remains 96 /96 variables (removed 0) and now considering 81/81 (removed 0) transitions.
[2023-03-19 08:31:12] [INFO ] Invariant cache hit.
[2023-03-19 08:31:12] [INFO ] Implicit Places using invariants in 60 ms returned []
[2023-03-19 08:31:12] [INFO ] Invariant cache hit.
[2023-03-19 08:31:12] [INFO ] Implicit Places using invariants and state equation in 87 ms returned []
Implicit Place search using SMT with State Equation took 159 ms to find 0 implicit places.
[2023-03-19 08:31:12] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-19 08:31:12] [INFO ] Invariant cache hit.
[2023-03-19 08:31:12] [INFO ] Dead Transitions using invariants and state equation in 63 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 243 ms. Remains : 96/96 places, 81/81 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/96 stabilizing places and 2/81 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND p1 (NOT p0)), (X (NOT (AND (NOT p1) p0))), true, (X (X (NOT (AND (NOT p1) p0)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (X (AND p1 p0))), (X (X (NOT (AND p1 p0))))]
Knowledge based reduction with 5 factoid took 204 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter insensitive) to 3 states, 5 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 152 ms :[(AND (NOT p1) p0), (AND (NOT p1) p0), (AND (NOT p1) p0)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 58 ms. (steps per millisecond=172 ) properties (out of 2) seen :1
Finished Best-First random walk after 198 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=198 )
Knowledge obtained : [(AND p1 (NOT p0)), (X (NOT (AND (NOT p1) p0))), true, (X (X (NOT (AND (NOT p1) p0)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (X (AND p1 p0))), (X (X (NOT (AND p1 p0)))), (F (AND (NOT p1) p0)), (F (AND p1 p0))]
Knowledge based reduction with 5 factoid took 408 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter insensitive) to 3 states, 5 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 185 ms :[(AND (NOT p1) p0), (AND (NOT p1) p0), (AND (NOT p1) p0)]
Stuttering acceptance computed with spot in 155 ms :[(AND (NOT p1) p0), (AND (NOT p1) p0), (AND (NOT p1) p0)]
Stuttering acceptance computed with spot in 168 ms :[(AND (NOT p1) p0), (AND (NOT p1) p0), (AND (NOT p1) p0)]
Product exploration explored 100000 steps with 1 reset in 248 ms.
Product exploration explored 100000 steps with 1 reset in 223 ms.
Built C files in :
/tmp/ltsmin1553536623340785191
[2023-03-19 08:31:14] [INFO ] Computing symmetric may disable matrix : 81 transitions.
[2023-03-19 08:31:14] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-19 08:31:14] [INFO ] Computing symmetric may enable matrix : 81 transitions.
[2023-03-19 08:31:14] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-19 08:31:14] [INFO ] Computing Do-Not-Accords matrix : 81 transitions.
[2023-03-19 08:31:14] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-19 08:31:14] [INFO ] Built C files in 26ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1553536623340785191
Running compilation step : cd /tmp/ltsmin1553536623340785191;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 217 ms.
Running link step : cd /tmp/ltsmin1553536623340785191;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 49 ms.
Running LTSmin : cd /tmp/ltsmin1553536623340785191;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased13052857494869882829.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 2 out of 96 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 96/96 places, 81/81 transitions.
Applied a total of 0 rules in 2 ms. Remains 96 /96 variables (removed 0) and now considering 81/81 (removed 0) transitions.
[2023-03-19 08:31:29] [INFO ] Invariant cache hit.
[2023-03-19 08:31:29] [INFO ] Implicit Places using invariants in 215 ms returned []
[2023-03-19 08:31:29] [INFO ] Invariant cache hit.
[2023-03-19 08:31:29] [INFO ] Implicit Places using invariants and state equation in 102 ms returned []
Implicit Place search using SMT with State Equation took 334 ms to find 0 implicit places.
[2023-03-19 08:31:29] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-19 08:31:29] [INFO ] Invariant cache hit.
[2023-03-19 08:31:29] [INFO ] Dead Transitions using invariants and state equation in 68 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 435 ms. Remains : 96/96 places, 81/81 transitions.
Built C files in :
/tmp/ltsmin5193841295442042872
[2023-03-19 08:31:29] [INFO ] Computing symmetric may disable matrix : 81 transitions.
[2023-03-19 08:31:29] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-19 08:31:29] [INFO ] Computing symmetric may enable matrix : 81 transitions.
[2023-03-19 08:31:29] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-19 08:31:29] [INFO ] Computing Do-Not-Accords matrix : 81 transitions.
[2023-03-19 08:31:29] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-19 08:31:29] [INFO ] Built C files in 4ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5193841295442042872
Running compilation step : cd /tmp/ltsmin5193841295442042872;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 209 ms.
Running link step : cd /tmp/ltsmin5193841295442042872;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 46 ms.
Running LTSmin : cd /tmp/ltsmin5193841295442042872;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased8747537978320505505.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2023-03-19 08:31:44] [INFO ] Flatten gal took : 12 ms
[2023-03-19 08:31:44] [INFO ] Flatten gal took : 8 ms
[2023-03-19 08:31:44] [INFO ] Time to serialize gal into /tmp/LTL7354832792405330356.gal : 2 ms
[2023-03-19 08:31:44] [INFO ] Time to serialize properties into /tmp/LTL17632808194236759500.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL7354832792405330356.gal' '-t' 'CGAL' '-hoa' '/tmp/aut4265716915506364067.hoa' '-atoms' '/tmp/LTL17632808194236759500.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...318
Loading property file /tmp/LTL17632808194236759500.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut4265716915506364067.hoa
Reverse transition relation is NOT exact ! Due to transitions t0.t203, t1.t200, t2.t197, t3.t155, t4.t152, t5.t149, t6.t104, t7.t101, t8.t98, t204, t135.t2...318
Computing Next relation with stutter on 369558 deadlock states
4 unique states visited
4 strongly connected components in search stack
5 transitions explored
4 items max in DFS search stack
39 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,0.422689,31644,1,0,212,94849,202,112,3006,126707,299
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
Treatment of property ShieldPPPt-PT-004B-LTLFireability-00 finished in 37026 ms.
Length sensitive decision was in the wrong direction : Shortening insensitive + false
[2023-03-19 08:31:45] [INFO ] Flatten gal took : 17 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin8542088345430147580
[2023-03-19 08:31:45] [INFO ] Computing symmetric may disable matrix : 252 transitions.
[2023-03-19 08:31:45] [INFO ] Computation of Complete disable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-19 08:31:45] [INFO ] Computing symmetric may enable matrix : 252 transitions.
[2023-03-19 08:31:45] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-19 08:31:45] [INFO ] Applying decomposition
[2023-03-19 08:31:45] [INFO ] Computing Do-Not-Accords matrix : 252 transitions.
[2023-03-19 08:31:45] [INFO ] Computation of Completed DNA matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-19 08:31:45] [INFO ] Built C files in 24ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8542088345430147580
Running compilation step : cd /tmp/ltsmin8542088345430147580;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '720' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
[2023-03-19 08:31:45] [INFO ] Flatten gal took : 18 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/convert-linux64' '-i' '/tmp/graph14902232191248437244.txt' '-o' '/tmp/graph14902232191248437244.bin' '-w' '/tmp/graph14902232191248437244.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph14902232191248437244.bin' '-l' '-1' '-v' '-w' '/tmp/graph14902232191248437244.weights' '-q' '0' '-e' '0.001'
[2023-03-19 08:31:45] [INFO ] Decomposing Gal with order
[2023-03-19 08:31:45] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-19 08:31:45] [INFO ] Removed a total of 33 redundant transitions.
[2023-03-19 08:31:45] [INFO ] Flatten gal took : 40 ms
[2023-03-19 08:31:45] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 2 ms.
[2023-03-19 08:31:45] [INFO ] Time to serialize gal into /tmp/LTLFireability6338359499101041921.gal : 4 ms
[2023-03-19 08:31:45] [INFO ] Time to serialize properties into /tmp/LTLFireability12811081459915357134.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability6338359499101041921.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability12811081459915357134.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 1 LTL properties
Checking formula 0 : !((F(((X((F("(i13.i0.u85.p244==1)"))&&(X("(i1.i0.u6.p16!=1)"))))&&(G(("(i1.i0.u6.p16!=1)")||(F("(i13.i0.u85.p244!=1)")))))||(G((F("(i1...206
Formula 0 simplified : G(F(G!"(i13.i0.u85.p244==1)" | X!"(i1.i0.u6.p16!=1)") & (X(G!"(i13.i0.u85.p244==1)" | X!"(i1.i0.u6.p16!=1)") | F(!"(i1.i0.u6.p16!=1)...186
Compilation finished in 468 ms.
Running link step : cd /tmp/ltsmin8542088345430147580;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 62 ms.
Running LTSmin : cd /tmp/ltsmin8542088345430147580;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '<>(((X((<>((LTLAPp0==true))&&X((LTLAPp1==true))))&&[](((LTLAPp1==true)||<>(!(LTLAPp0==true)))))||[]((<>((LTLAPp0==true))&&X((LTLAPp1==true))))))' '--buchi-type=spotba'
Reverse transition relation is NOT exact ! Due to transitions t49, t52, t96, t99, t147, t150, t195, t198, t231, t235, t249, i0.i0.u1.t205, i0.i1.u101.t15, ...1182
Computing Next relation with stutter on 369558 deadlock states
pins2lts-mc-linux64, 0.000: Registering PINS so language module
pins2lts-mc-linux64( 0/ 8), 0.001: Loading model from ./gal.so
pins2lts-mc-linux64( 6/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 6/ 8), 0.001: loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.006: library has no initializer
pins2lts-mc-linux64( 1/ 8), 0.006: loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.002: library has no initializer
pins2lts-mc-linux64( 2/ 8), 0.002: loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.005: library has no initializer
pins2lts-mc-linux64( 5/ 8), 0.005: loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.004: library has no initializer
pins2lts-mc-linux64( 3/ 8), 0.006: library has no initializer
pins2lts-mc-linux64( 3/ 8), 0.006: loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.004: loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.002: library has no initializer
pins2lts-mc-linux64( 0/ 8), 0.002: loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.003: library has no initializer
pins2lts-mc-linux64( 4/ 8), 0.003: loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.386: completed loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.386: LTL layer: formula: <>(((X((<>((LTLAPp0==true))&&X((LTLAPp1==true))))&&[](((LTLAPp1==true)||<>(!(LTLAPp0==true)))))||[]((<>((LTLAPp0==true))&&X((LTLAPp1==true))))))
pins2lts-mc-linux64( 1/ 8), 0.386: "<>(((X((<>((LTLAPp0==true))&&X((LTLAPp1==true))))&&[](((LTLAPp1==true)||<>(!(LTLAPp0==true)))))||[]((<>((LTLAPp0==true))&&X((LTLAPp1==true))))))" is not a file, parsing as formula...
pins2lts-mc-linux64( 1/ 8), 0.387: Using Spin LTL semantics
pins2lts-mc-linux64( 2/ 8), 0.394: completed loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.396: completed loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.397: completed loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.400: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.401: completed loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.405: completed loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.405: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.442: There are 255 state labels and 1 edge labels
pins2lts-mc-linux64( 0/ 8), 0.442: State length is 281, there are 279 groups
pins2lts-mc-linux64( 0/ 8), 0.442: Running cndfs using 8 cores
pins2lts-mc-linux64( 0/ 8), 0.442: Using a tree table with 2^27 elements
pins2lts-mc-linux64( 0/ 8), 0.442: Successor permutation: dynamic
pins2lts-mc-linux64( 0/ 8), 0.442: Global bits: 2, count bits: 0, local bits: 0
pins2lts-mc-linux64( 1/ 8), 0.498: [Blue] ~120 levels ~960 states ~7752 transitions
pins2lts-mc-linux64( 6/ 8), 0.526: [Blue] ~240 levels ~1920 states ~9240 transitions
pins2lts-mc-linux64( 3/ 8), 0.585: [Blue] ~480 levels ~3840 states ~21432 transitions
pins2lts-mc-linux64( 3/ 8), 0.658: [Blue] ~947 levels ~7680 states ~36512 transitions
pins2lts-mc-linux64( 3/ 8), 0.861: [Blue] ~1874 levels ~15360 states ~74224 transitions
pins2lts-mc-linux64( 2/ 8), 1.225: [Blue] ~3840 levels ~30720 states ~152096 transitions
pins2lts-mc-linux64( 0/ 8), 1.709: [Blue] ~7664 levels ~61440 states ~298688 transitions
pins2lts-mc-linux64( 6/ 8), 2.445: [Blue] ~14913 levels ~122880 states ~562144 transitions
pins2lts-mc-linux64( 2/ 8), 3.388: [Blue] ~30612 levels ~245760 states ~1223144 transitions
pins2lts-mc-linux64( 4/ 8), 4.744: [Blue] ~60792 levels ~491520 states ~2586512 transitions
pins2lts-mc-linux64( 4/ 8), 7.435: [Blue] ~121584 levels ~983040 states ~5382616 transitions
pins2lts-mc-linux64( 1/ 8), 12.806: [Blue] ~245554 levels ~1966080 states ~10420720 transitions
pins2lts-mc-linux64( 1/ 8), 23.613: [Blue] ~491150 levels ~3932160 states ~21285496 transitions
pins2lts-mc-linux64( 1/ 8), 45.589: [Blue] ~982366 levels ~7864320 states ~43518152 transitions
pins2lts-mc-linux64( 1/ 8), 90.481: [Blue] ~1964867 levels ~15728640 states ~88908544 transitions
pins2lts-mc-linux64( 1/ 8), 181.212: [Blue] ~3929807 levels ~31457280 states ~181729040 transitions
pins2lts-mc-linux64( 3/ 8), 225.347: Error: tree roots table full! Change -s/--ratio.
pins2lts-mc-linux64( 0/ 8), 225.397:
pins2lts-mc-linux64( 0/ 8), 225.397: Explored 35853536 states 230553747 transitions, fanout: 6.430
pins2lts-mc-linux64( 0/ 8), 225.397: Total exploration time 224.940 sec (224.890 sec minimum, 224.909 sec on average)
pins2lts-mc-linux64( 0/ 8), 225.397: States per second: 159392, Transitions per second: 1024957
pins2lts-mc-linux64( 0/ 8), 225.397:
pins2lts-mc-linux64( 0/ 8), 225.397: State space has 134217345 states, 0 are accepting
pins2lts-mc-linux64( 0/ 8), 225.397: cndfs_1 (permutation: dynamic) stats:
pins2lts-mc-linux64( 0/ 8), 225.397: blue states: 35853536 (26.71%), transitions: 0 (per worker)
pins2lts-mc-linux64( 0/ 8), 225.397: red states: 0 (0.00%), bogus: 0 (0.00%), transitions: 0, waits: 0 (0.00 sec)
pins2lts-mc-linux64( 0/ 8), 225.397: all-red states: 0 (0.00%), bogus 0 (0.00%)
pins2lts-mc-linux64( 0/ 8), 225.397:
pins2lts-mc-linux64( 0/ 8), 225.397: Total memory used for local state coloring: 539.2MB
pins2lts-mc-linux64( 0/ 8), 225.397:
pins2lts-mc-linux64( 0/ 8), 225.397: Queue width: 8B, total height: 35339643, memory: 269.62MB
pins2lts-mc-linux64( 0/ 8), 225.397: Tree memory: 1118.6MB, 8.7 B/state, compr.: 0.8%
pins2lts-mc-linux64( 0/ 8), 225.397: Tree fill ratio (roots/leafs): 99.0%/36.0%
pins2lts-mc-linux64( 0/ 8), 225.397: Stored 252 string chucks using 0MB
pins2lts-mc-linux64( 0/ 8), 225.397: Total memory used for chunk indexing: 0MB
pins2lts-mc-linux64( 0/ 8), 225.397: Est. total memory use: 1388.2MB (~1293.6MB paged-in)
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin8542088345430147580;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '<>(((X((<>((LTLAPp0==true))&&X((LTLAPp1==true))))&&[](((LTLAPp1==true)||<>(!(LTLAPp0==true)))))||[]((<>((LTLAPp0==true))&&X((LTLAPp1==true))))))' '--buchi-type=spotba'
255
java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin8542088345430147580;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '<>(((X((<>((LTLAPp0==true))&&X((LTLAPp1==true))))&&[](((LTLAPp1==true)||<>(!(LTLAPp0==true)))))||[]((<>((LTLAPp0==true))&&X((LTLAPp1==true))))))' '--buchi-type=spotba'
255
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner.checkProperty(LTSminRunner.java:240)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.checkProperties(LTSminRunner.java:175)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:113)
at java.base/java.lang.Thread.run(Thread.java:833)
Detected timeout of ITS tools.
[2023-03-19 08:52:41] [INFO ] Applying decomposition
[2023-03-19 08:52:41] [INFO ] Flatten gal took : 36 ms
[2023-03-19 08:52:41] [INFO ] Decomposing Gal with order
[2023-03-19 08:52:41] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-19 08:52:41] [INFO ] Removed a total of 9 redundant transitions.
[2023-03-19 08:52:41] [INFO ] Flatten gal took : 17 ms
[2023-03-19 08:52:41] [INFO ] Fuse similar labels procedure discarded/fused a total of 32 labels/synchronizations in 9 ms.
[2023-03-19 08:52:41] [INFO ] Time to serialize gal into /tmp/LTLFireability380839517775638591.gal : 3 ms
[2023-03-19 08:52:41] [INFO ] Time to serialize properties into /tmp/LTLFireability11979074019646902554.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability380839517775638591.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability11979074019646902554.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((F(((X((F("(i1.i0.i0.i0.i0.i0.u91.p244==1)"))&&(X("(i0.i0.i0.i1.i0.i0.i0.i0.i0.i0.u12.p16!=1)"))))&&(G(("(i0.i0.i0.i1.i0.i0.i0.i0.i0...314
Formula 0 simplified : G(F(G!"(i1.i0.i0.i0.i0.i0.u91.p244==1)" | X!"(i0.i0.i0.i1.i0.i0.i0.i0.i0.i0.u12.p16!=1)") & (X(G!"(i1.i0.i0.i0.i0.i0.u91.p244==1)" |...294
Reverse transition relation is NOT exact ! Due to transitions i0.i0.i0.u4.t205, i0.i0.i0.i1.t249, i0.i0.i0.i1.u25.t160, i0.i0.i0.i1.u25.t164, i0.i0.i0.i1.i...2199
Computing Next relation with stutter on 369558 deadlock states
Detected timeout of ITS tools.
[2023-03-19 09:13:38] [INFO ] Flatten gal took : 305 ms
[2023-03-19 09:13:39] [INFO ] Input system was already deterministic with 252 transitions.
[2023-03-19 09:13:39] [INFO ] Transformed 280 places.
[2023-03-19 09:13:40] [INFO ] Transformed 252 transitions.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/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//../itstools/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
[2023-03-19 09:13:40] [INFO ] Time to serialize gal into /tmp/LTLFireability6474172267357127723.gal : 23 ms
[2023-03-19 09:13:40] [INFO ] Time to serialize properties into /tmp/LTLFireability16317281485112859644.ltl : 24 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability6474172267357127723.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability16317281485112859644.ltl' '-c' '-stutter-deadlock' '--load-order' '/home/mcc/execution/model.ord' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...343
Read 1 LTL properties
Successfully loaded order from file /home/mcc/execution/model.ord
Checking formula 0 : !((F(((X((F("(p244==1)"))&&(X("(p16!=1)"))))&&(G(("(p16!=1)")||(F("(p244!=1)")))))||(G((F("(p244==1)"))&&(X("(p16!=1)")))))))
Formula 0 simplified : G(F(G!"(p244==1)" | X!"(p16!=1)") & (X(G!"(p244==1)" | X!"(p16!=1)") | F(!"(p16!=1)" & G!"(p244!=1)")))
Reverse transition relation is NOT exact ! Due to transitions t15, t19, t24, t29, t31, t35, t39, t41, t45, t46, t49, t51, t52, t54, t55, t57, t58, t62, t66...619
Computing Next relation with stutter on 369558 deadlock states
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393220 kB
MemFree: 11730764 kB
After kill :
MemTotal: 16393220 kB
MemFree: 16073716 kB

BK_TIME_CONFINEMENT_REACHED

--------------------
content from stderr:

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ perl -pe 's/.*\.//g'
++ sed s/.jar//
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="ShieldPPPt-PT-004B"
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-5348"
echo " Executing tool itstools"
echo " Input is ShieldPPPt-PT-004B, 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 r389-oct2-167903713700588"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/ShieldPPPt-PT-004B.tgz
mv ShieldPPPt-PT-004B 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 '' LTLFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
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 ;