Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2024-input.r443-smll-171701110000188.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
...........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool greatspnxred
Input is UtilityControlRoom-PT-Z2T4N04, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r443-smll-171701110000188
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 748K
-rw-r--r-- 1 mcc users 18K Apr 13 05:10 CTLCardinality.txt
-rw-r--r-- 1 mcc users 110K Apr 13 05:10 CTLCardinality.xml
-rw-r--r-- 1 mcc users 17K Apr 13 05:06 CTLFireability.txt
-rw-r--r-- 1 mcc users 81K Apr 13 05:06 CTLFireability.xml
-rw-r--r-- 1 mcc users 8.1K Apr 23 08:04 LTLCardinality.txt
-rw-r--r-- 1 mcc users 36K Apr 23 08:04 LTLCardinality.xml
-rw-r--r-- 1 mcc users 6.3K Apr 23 08:04 LTLFireability.txt
-rw-r--r-- 1 mcc users 28K Apr 23 08:04 LTLFireability.xml
-rw-r--r-- 1 mcc users 17K Apr 13 05:16 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 111K Apr 13 05:16 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 38K Apr 13 05:14 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 184K Apr 13 05:14 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.5K Apr 23 08:04 UpperBounds.txt
-rw-r--r-- 1 mcc users 5.1K Apr 23 08:04 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 8 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 47K May 18 16:43 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 UtilityControlRoom-PT-Z2T4N04-LTLFireability-00
FORMULA_NAME UtilityControlRoom-PT-Z2T4N04-LTLFireability-01
FORMULA_NAME UtilityControlRoom-PT-Z2T4N04-LTLFireability-02
FORMULA_NAME UtilityControlRoom-PT-Z2T4N04-LTLFireability-03
FORMULA_NAME UtilityControlRoom-PT-Z2T4N04-LTLFireability-04
FORMULA_NAME UtilityControlRoom-PT-Z2T4N04-LTLFireability-05
FORMULA_NAME UtilityControlRoom-PT-Z2T4N04-LTLFireability-06
FORMULA_NAME UtilityControlRoom-PT-Z2T4N04-LTLFireability-07
FORMULA_NAME UtilityControlRoom-PT-Z2T4N04-LTLFireability-08
FORMULA_NAME UtilityControlRoom-PT-Z2T4N04-LTLFireability-09
FORMULA_NAME UtilityControlRoom-PT-Z2T4N04-LTLFireability-10
FORMULA_NAME UtilityControlRoom-PT-Z2T4N04-LTLFireability-11
FORMULA_NAME UtilityControlRoom-PT-Z2T4N04-LTLFireability-12
FORMULA_NAME UtilityControlRoom-PT-Z2T4N04-LTLFireability-13
FORMULA_NAME UtilityControlRoom-PT-Z2T4N04-LTLFireability-14
FORMULA_NAME UtilityControlRoom-PT-Z2T4N04-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1717073419333

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=UtilityControlRoom-PT-Z2T4N04
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-30 12:50:21] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2024-05-30 12:50:21] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-30 12:50:21] [INFO ] Load time of PNML (sax parser for PT used): 82 ms
[2024-05-30 12:50:21] [INFO ] Transformed 72 places.
[2024-05-30 12:50:21] [INFO ] Transformed 108 transitions.
[2024-05-30 12:50:21] [INFO ] Parsed PT model containing 72 places and 108 transitions and 340 arcs in 246 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 24 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 4 formulas.
[2024-05-30 12:50:21] [INFO ] Reduced 4 identical enabling conditions.
[2024-05-30 12:50:21] [INFO ] Reduced 4 identical enabling conditions.
[2024-05-30 12:50:21] [INFO ] Reduced 4 identical enabling conditions.
[2024-05-30 12:50:21] [INFO ] Reduced 4 identical enabling conditions.
Ensure Unique test removed 16 transitions
Reduce redundant transitions removed 16 transitions.
FORMULA UtilityControlRoom-PT-Z2T4N04-LTLFireability-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA UtilityControlRoom-PT-Z2T4N04-LTLFireability-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA UtilityControlRoom-PT-Z2T4N04-LTLFireability-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA UtilityControlRoom-PT-Z2T4N04-LTLFireability-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 49 out of 72 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 72/72 places, 92/92 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 66 transition count 86
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 66 transition count 86
Applied a total of 12 rules in 27 ms. Remains 66 /72 variables (removed 6) and now considering 86/92 (removed 6) transitions.
// Phase 1: matrix 86 rows 66 cols
[2024-05-30 12:50:21] [INFO ] Computed 11 invariants in 26 ms
[2024-05-30 12:50:22] [INFO ] Implicit Places using invariants in 319 ms returned [45]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 363 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 65/72 places, 86/92 transitions.
Applied a total of 0 rules in 3 ms. Remains 65 /65 variables (removed 0) and now considering 86/86 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 420 ms. Remains : 65/72 places, 86/92 transitions.
Support contains 49 out of 65 places after structural reductions.
[2024-05-30 12:50:22] [INFO ] Flatten gal took : 44 ms
[2024-05-30 12:50:22] [INFO ] Flatten gal took : 29 ms
[2024-05-30 12:50:22] [INFO ] Input system was already deterministic with 86 transitions.
Reduction of identical properties reduced properties to check from 23 to 21
RANDOM walk for 4643 steps (0 resets) in 403 ms. (11 steps per ms) remains 0/21 properties
Computed a total of 0 stabilizing places and 0 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((p0 U p1)||X(X(X(F(p2))))))'
Support contains 19 out of 65 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 65/65 places, 86/86 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 63 transition count 84
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 63 transition count 84
Applied a total of 4 rules in 9 ms. Remains 63 /65 variables (removed 2) and now considering 84/86 (removed 2) transitions.
// Phase 1: matrix 84 rows 63 cols
[2024-05-30 12:50:23] [INFO ] Computed 10 invariants in 8 ms
[2024-05-30 12:50:23] [INFO ] Implicit Places using invariants in 109 ms returned []
[2024-05-30 12:50:23] [INFO ] Invariant cache hit.
[2024-05-30 12:50:23] [INFO ] Implicit Places using invariants and state equation in 115 ms returned []
Implicit Place search using SMT with State Equation took 227 ms to find 0 implicit places.
Running 80 sub problems to find dead transitions.
[2024-05-30 12:50:23] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/59 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/59 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 2 (OVERLAPS) 4/63 variables, 8/10 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/63 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 4 (OVERLAPS) 84/147 variables, 63/73 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/147 variables, 0/73 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 6 (OVERLAPS) 0/147 variables, 0/73 constraints. Problems are: Problem set: 0 solved, 80 unsolved
No progress, stopping.
After SMT solving in domain Real declared 147/147 variables, and 73 constraints, problems are : Problem set: 0 solved, 80 unsolved in 2282 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 63/63 constraints, PredecessorRefiner: 80/80 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 80 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/59 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/59 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 2 (OVERLAPS) 4/63 variables, 8/10 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/63 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 4 (OVERLAPS) 84/147 variables, 63/73 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/147 variables, 80/153 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/147 variables, 0/153 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 7 (OVERLAPS) 0/147 variables, 0/153 constraints. Problems are: Problem set: 0 solved, 80 unsolved
No progress, stopping.
After SMT solving in domain Int declared 147/147 variables, and 153 constraints, problems are : Problem set: 0 solved, 80 unsolved in 1946 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 63/63 constraints, PredecessorRefiner: 80/80 constraints, Known Traps: 0/0 constraints]
After SMT, in 4350ms problems are : Problem set: 0 solved, 80 unsolved
Search for dead transitions found 0 dead transitions in 4367ms
Starting structural reductions in LTL mode, iteration 1 : 63/65 places, 84/86 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4605 ms. Remains : 63/65 places, 84/86 transitions.
Stuttering acceptance computed with spot in 542 ms :[(NOT p2), (AND (NOT p1) (NOT p2)), (NOT p2), (NOT p2), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : UtilityControlRoom-PT-Z2T4N04-LTLFireability-00
Product exploration explored 100000 steps with 22626 reset in 471 ms.
Product exploration explored 100000 steps with 22676 reset in 326 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p2) (NOT p1) (NOT p0)), (X (AND (NOT p1) (NOT p0))), (X (NOT (AND (NOT p1) p0))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT p1)))]
False Knowledge obtained : [(X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (AND (NOT p1) p0))), (X (X (NOT (AND (NOT p1) p0)))), (X (X p0)), (X (X (NOT p0)))]
Knowledge based reduction with 6 factoid took 261 ms. Reduced automaton from 7 states, 11 edges and 3 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 145 ms :[(NOT p2), (NOT p2), (NOT p2), (NOT p2)]
RANDOM walk for 4 steps (0 resets) in 4 ms. (0 steps per ms) remains 0/1 properties
Knowledge obtained : [(AND (NOT p2) (NOT p1) (NOT p0)), (X (AND (NOT p1) (NOT p0))), (X (NOT (AND (NOT p1) p0))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT p1)))]
False Knowledge obtained : [(X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (AND (NOT p1) p0))), (X (X (NOT (AND (NOT p1) p0)))), (X (X p0)), (X (X (NOT p0))), (F p2)]
Knowledge based reduction with 6 factoid took 272 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 139 ms :[(NOT p2), (NOT p2), (NOT p2), (NOT p2)]
Stuttering acceptance computed with spot in 137 ms :[(NOT p2), (NOT p2), (NOT p2), (NOT p2)]
[2024-05-30 12:50:30] [INFO ] Invariant cache hit.
[2024-05-30 12:50:30] [INFO ] [Real]Absence check using 10 positive place invariants in 5 ms returned sat
[2024-05-30 12:50:30] [INFO ] [Real]Absence check using state equation in 61 ms returned sat
[2024-05-30 12:50:30] [INFO ] Solution in real domain found non-integer solution.
[2024-05-30 12:50:30] [INFO ] [Nat]Absence check using 10 positive place invariants in 4 ms returned sat
[2024-05-30 12:50:30] [INFO ] [Nat]Absence check using state equation in 53 ms returned sat
[2024-05-30 12:50:30] [INFO ] Computed and/alt/rep : 80/124/80 causal constraints (skipped 0 transitions) in 11 ms.
[2024-05-30 12:50:30] [INFO ] Added : 20 causal constraints over 4 iterations in 76 ms. Result :sat
Could not prove EG (NOT p2)
Support contains 4 out of 63 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 63/63 places, 84/84 transitions.
Applied a total of 0 rules in 1 ms. Remains 63 /63 variables (removed 0) and now considering 84/84 (removed 0) transitions.
[2024-05-30 12:50:30] [INFO ] Invariant cache hit.
[2024-05-30 12:50:30] [INFO ] Implicit Places using invariants in 64 ms returned []
[2024-05-30 12:50:30] [INFO ] Invariant cache hit.
[2024-05-30 12:50:30] [INFO ] Implicit Places using invariants and state equation in 94 ms returned []
Implicit Place search using SMT with State Equation took 161 ms to find 0 implicit places.
Running 80 sub problems to find dead transitions.
[2024-05-30 12:50:30] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/59 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/59 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 2 (OVERLAPS) 4/63 variables, 8/10 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/63 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 4 (OVERLAPS) 84/147 variables, 63/73 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/147 variables, 0/73 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 6 (OVERLAPS) 0/147 variables, 0/73 constraints. Problems are: Problem set: 0 solved, 80 unsolved
No progress, stopping.
After SMT solving in domain Real declared 147/147 variables, and 73 constraints, problems are : Problem set: 0 solved, 80 unsolved in 1823 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 63/63 constraints, PredecessorRefiner: 80/80 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 80 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/59 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/59 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 2 (OVERLAPS) 4/63 variables, 8/10 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/63 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 4 (OVERLAPS) 84/147 variables, 63/73 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/147 variables, 80/153 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/147 variables, 0/153 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 7 (OVERLAPS) 0/147 variables, 0/153 constraints. Problems are: Problem set: 0 solved, 80 unsolved
No progress, stopping.
After SMT solving in domain Int declared 147/147 variables, and 153 constraints, problems are : Problem set: 0 solved, 80 unsolved in 1584 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 63/63 constraints, PredecessorRefiner: 80/80 constraints, Known Traps: 0/0 constraints]
After SMT, in 3455ms problems are : Problem set: 0 solved, 80 unsolved
Search for dead transitions found 0 dead transitions in 3457ms
Finished structural reductions in LTL mode , in 1 iterations and 3620 ms. Remains : 63/63 places, 84/84 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(NOT p2)]
False Knowledge obtained : []
Knowledge based reduction with 1 factoid took 105 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 171 ms :[(NOT p2), (NOT p2), (NOT p2), (NOT p2)]
RANDOM walk for 4 steps (0 resets) in 5 ms. (0 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p2)]
False Knowledge obtained : [(F p2)]
Knowledge based reduction with 1 factoid took 110 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 184 ms :[(NOT p2), (NOT p2), (NOT p2), (NOT p2)]
Stuttering acceptance computed with spot in 158 ms :[(NOT p2), (NOT p2), (NOT p2), (NOT p2)]
[2024-05-30 12:50:35] [INFO ] Invariant cache hit.
[2024-05-30 12:50:35] [INFO ] [Real]Absence check using 10 positive place invariants in 8 ms returned sat
[2024-05-30 12:50:35] [INFO ] [Real]Absence check using state equation in 51 ms returned sat
[2024-05-30 12:50:35] [INFO ] Solution in real domain found non-integer solution.
[2024-05-30 12:50:35] [INFO ] [Nat]Absence check using 10 positive place invariants in 4 ms returned sat
[2024-05-30 12:50:35] [INFO ] [Nat]Absence check using state equation in 46 ms returned sat
[2024-05-30 12:50:35] [INFO ] Computed and/alt/rep : 80/124/80 causal constraints (skipped 0 transitions) in 8 ms.
[2024-05-30 12:50:35] [INFO ] Added : 20 causal constraints over 4 iterations in 58 ms. Result :sat
Could not prove EG (NOT p2)
Stuttering acceptance computed with spot in 170 ms :[(NOT p2), (NOT p2), (NOT p2), (NOT p2)]
Product exploration explored 100000 steps with 22700 reset in 130 ms.
Product exploration explored 100000 steps with 22695 reset in 123 ms.
Applying partial POR strategy [true, false, false, false]
Stuttering acceptance computed with spot in 150 ms :[(NOT p2), (NOT p2), (NOT p2), (NOT p2)]
Support contains 4 out of 63 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 63/63 places, 84/84 transitions.
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 8 Pre rules applied. Total rules applied 0 place count 63 transition count 92
Deduced a syphon composed of 8 places in 1 ms
Iterating global reduction 0 with 8 rules applied. Total rules applied 8 place count 63 transition count 92
Performed 20 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 28 places in 1 ms
Iterating global reduction 0 with 20 rules applied. Total rules applied 28 place count 63 transition count 92
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 0 with 8 rules applied. Total rules applied 36 place count 63 transition count 84
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 37 place count 62 transition count 76
Deduced a syphon composed of 28 places in 0 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 38 place count 62 transition count 76
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 50 place count 50 transition count 56
Deduced a syphon composed of 20 places in 1 ms
Iterating global reduction 1 with 12 rules applied. Total rules applied 62 place count 50 transition count 56
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 70 place count 42 transition count 48
Deduced a syphon composed of 16 places in 0 ms
Iterating global reduction 1 with 8 rules applied. Total rules applied 78 place count 42 transition count 48
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 82 place count 42 transition count 44
Deduced a syphon composed of 16 places in 0 ms
Applied a total of 82 rules in 31 ms. Remains 42 /63 variables (removed 21) and now considering 44/84 (removed 40) transitions.
[2024-05-30 12:50:36] [INFO ] Redundant transitions in 1 ms returned []
Running 40 sub problems to find dead transitions.
// Phase 1: matrix 44 rows 42 cols
[2024-05-30 12:50:36] [INFO ] Computed 10 invariants in 1 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/38 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 40 unsolved
[2024-05-30 12:50:36] [INFO ] Deduced a trap composed of 5 places in 64 ms of which 10 ms to minimize.
[2024-05-30 12:50:36] [INFO ] Deduced a trap composed of 5 places in 27 ms of which 2 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/38 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/38 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 3 (OVERLAPS) 4/42 variables, 8/12 constraints. Problems are: Problem set: 0 solved, 40 unsolved
[2024-05-30 12:50:36] [INFO ] Deduced a trap composed of 4 places in 28 ms of which 2 ms to minimize.
Problem TDEAD4 is UNSAT
[2024-05-30 12:50:36] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 1 ms to minimize.
Problem TDEAD5 is UNSAT
[2024-05-30 12:50:36] [INFO ] Deduced a trap composed of 4 places in 22 ms of which 2 ms to minimize.
Problem TDEAD6 is UNSAT
[2024-05-30 12:50:37] [INFO ] Deduced a trap composed of 4 places in 22 ms of which 1 ms to minimize.
Problem TDEAD7 is UNSAT
Problem TDEAD12 is UNSAT
Problem TDEAD13 is UNSAT
Problem TDEAD14 is UNSAT
Problem TDEAD15 is UNSAT
Problem TDEAD24 is UNSAT
Problem TDEAD25 is UNSAT
Problem TDEAD26 is UNSAT
Problem TDEAD27 is UNSAT
Problem TDEAD28 is UNSAT
Problem TDEAD29 is UNSAT
Problem TDEAD32 is UNSAT
Problem TDEAD33 is UNSAT
Problem TDEAD36 is UNSAT
Problem TDEAD37 is UNSAT
Problem TDEAD40 is UNSAT
Problem TDEAD41 is UNSAT
At refinement iteration 4 (INCLUDED_ONLY) 0/42 variables, 4/16 constraints. Problems are: Problem set: 20 solved, 20 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/42 variables, 0/16 constraints. Problems are: Problem set: 20 solved, 20 unsolved
At refinement iteration 6 (OVERLAPS) 44/86 variables, 42/58 constraints. Problems are: Problem set: 20 solved, 20 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/86 variables, 0/58 constraints. Problems are: Problem set: 20 solved, 20 unsolved
At refinement iteration 8 (OVERLAPS) 0/86 variables, 0/58 constraints. Problems are: Problem set: 20 solved, 20 unsolved
No progress, stopping.
After SMT solving in domain Real declared 86/86 variables, and 58 constraints, problems are : Problem set: 20 solved, 20 unsolved in 876 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 42/42 constraints, PredecessorRefiner: 40/40 constraints, Known Traps: 6/6 constraints]
Escalating to Integer solving :Problem set: 20 solved, 20 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/22 variables, 2/2 constraints. Problems are: Problem set: 20 solved, 20 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/22 variables, 0/2 constraints. Problems are: Problem set: 20 solved, 20 unsolved
At refinement iteration 2 (OVERLAPS) 20/42 variables, 10/12 constraints. Problems are: Problem set: 20 solved, 20 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/42 variables, 4/16 constraints. Problems are: Problem set: 20 solved, 20 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/42 variables, 0/16 constraints. Problems are: Problem set: 20 solved, 20 unsolved
At refinement iteration 5 (OVERLAPS) 44/86 variables, 42/58 constraints. Problems are: Problem set: 20 solved, 20 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/86 variables, 20/78 constraints. Problems are: Problem set: 20 solved, 20 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/86 variables, 0/78 constraints. Problems are: Problem set: 20 solved, 20 unsolved
At refinement iteration 8 (OVERLAPS) 0/86 variables, 0/78 constraints. Problems are: Problem set: 20 solved, 20 unsolved
No progress, stopping.
After SMT solving in domain Int declared 86/86 variables, and 78 constraints, problems are : Problem set: 20 solved, 20 unsolved in 417 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 42/42 constraints, PredecessorRefiner: 20/40 constraints, Known Traps: 6/6 constraints]
After SMT, in 1309ms problems are : Problem set: 20 solved, 20 unsolved
Search for dead transitions found 20 dead transitions in 1311ms
Found 20 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 20 transitions
Dead transitions reduction (with SMT) removed 20 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 42/63 places, 24/84 transitions.
Graph (complete) has 64 edges and 42 vertex of which 26 are kept as prefixes of interest. Removing 16 places using SCC suffix rule.1 ms
Discarding 16 places :
Also discarding 0 output transitions
Ensure Unique test removed 1 places
Applied a total of 1 rules in 6 ms. Remains 25 /42 variables (removed 17) and now considering 24/24 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 25/63 places, 24/84 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 1383 ms. Remains : 25/63 places, 24/84 transitions.
Support contains 4 out of 63 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 63/63 places, 84/84 transitions.
Applied a total of 0 rules in 3 ms. Remains 63 /63 variables (removed 0) and now considering 84/84 (removed 0) transitions.
// Phase 1: matrix 84 rows 63 cols
[2024-05-30 12:50:37] [INFO ] Computed 10 invariants in 1 ms
[2024-05-30 12:50:37] [INFO ] Implicit Places using invariants in 81 ms returned [42]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 84 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 62/63 places, 84/84 transitions.
Applied a total of 0 rules in 1 ms. Remains 62 /62 variables (removed 0) and now considering 84/84 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 88 ms. Remains : 62/63 places, 84/84 transitions.
Treatment of property UtilityControlRoom-PT-Z2T4N04-LTLFireability-00 finished in 14506 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(G(p0))&&((X((!p1||X(!p2)))&&F(!p3))||X(G((!p1||X(!p2)))))))'
Support contains 35 out of 65 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 65/65 places, 86/86 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 63 transition count 84
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 63 transition count 84
Applied a total of 4 rules in 3 ms. Remains 63 /65 variables (removed 2) and now considering 84/86 (removed 2) transitions.
[2024-05-30 12:50:37] [INFO ] Invariant cache hit.
[2024-05-30 12:50:37] [INFO ] Implicit Places using invariants in 36 ms returned []
[2024-05-30 12:50:37] [INFO ] Invariant cache hit.
[2024-05-30 12:50:38] [INFO ] Implicit Places using invariants and state equation in 77 ms returned []
Implicit Place search using SMT with State Equation took 115 ms to find 0 implicit places.
Running 80 sub problems to find dead transitions.
[2024-05-30 12:50:38] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/59 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/59 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 2 (OVERLAPS) 4/63 variables, 8/10 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/63 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 4 (OVERLAPS) 84/147 variables, 63/73 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/147 variables, 0/73 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 6 (OVERLAPS) 0/147 variables, 0/73 constraints. Problems are: Problem set: 0 solved, 80 unsolved
No progress, stopping.
After SMT solving in domain Real declared 147/147 variables, and 73 constraints, problems are : Problem set: 0 solved, 80 unsolved in 1847 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 63/63 constraints, PredecessorRefiner: 80/80 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 80 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/59 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/59 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 2 (OVERLAPS) 4/63 variables, 8/10 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/63 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 4 (OVERLAPS) 84/147 variables, 63/73 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/147 variables, 80/153 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/147 variables, 0/153 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 7 (OVERLAPS) 0/147 variables, 0/153 constraints. Problems are: Problem set: 0 solved, 80 unsolved
No progress, stopping.
After SMT solving in domain Int declared 147/147 variables, and 153 constraints, problems are : Problem set: 0 solved, 80 unsolved in 2304 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 63/63 constraints, PredecessorRefiner: 80/80 constraints, Known Traps: 0/0 constraints]
After SMT, in 4182ms problems are : Problem set: 0 solved, 80 unsolved
Search for dead transitions found 0 dead transitions in 4184ms
Starting structural reductions in LTL mode, iteration 1 : 63/65 places, 84/86 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4303 ms. Remains : 63/65 places, 84/86 transitions.
Stuttering acceptance computed with spot in 307 ms :[(OR (NOT p0) (AND p1 p2)), (NOT p0), (AND p1 p2), (AND p3 p1 p2), true, p2, (AND p3 p2), p3]
Running random walk in product with property : UtilityControlRoom-PT-Z2T4N04-LTLFireability-01
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA UtilityControlRoom-PT-Z2T4N04-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property UtilityControlRoom-PT-Z2T4N04-LTLFireability-01 finished in 4640 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F((G(!p1)&&p0)))))'
Support contains 8 out of 65 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 65/65 places, 86/86 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 63 transition count 84
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 63 transition count 84
Applied a total of 4 rules in 3 ms. Remains 63 /65 variables (removed 2) and now considering 84/86 (removed 2) transitions.
[2024-05-30 12:50:42] [INFO ] Invariant cache hit.
[2024-05-30 12:50:42] [INFO ] Implicit Places using invariants in 62 ms returned [42]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 65 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 62/65 places, 84/86 transitions.
Applied a total of 0 rules in 1 ms. Remains 62 /62 variables (removed 0) and now considering 84/84 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 70 ms. Remains : 62/65 places, 84/86 transitions.
Stuttering acceptance computed with spot in 155 ms :[(OR (NOT p0) p1), (OR (NOT p0) p1), (OR (NOT p0) p1), p1]
Running random walk in product with property : UtilityControlRoom-PT-Z2T4N04-LTLFireability-03
Product exploration explored 100000 steps with 0 reset in 148 ms.
Stack based approach found an accepted trace after 351 steps with 0 reset with depth 352 and stack size 352 in 4 ms.
FORMULA UtilityControlRoom-PT-Z2T4N04-LTLFireability-03 FALSE TECHNIQUES STACK_TEST
Treatment of property UtilityControlRoom-PT-Z2T4N04-LTLFireability-03 finished in 394 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G((F(!p1) U X(p2)))||p0)))'
Support contains 23 out of 65 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 65/65 places, 86/86 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 65 transition count 82
Reduce places removed 4 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 10 place count 61 transition count 80
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
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 22 place count 55 transition count 74
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 28 place count 55 transition count 68
Applied a total of 28 rules in 15 ms. Remains 55 /65 variables (removed 10) and now considering 68/86 (removed 18) transitions.
// Phase 1: matrix 68 rows 55 cols
[2024-05-30 12:50:42] [INFO ] Computed 10 invariants in 2 ms
[2024-05-30 12:50:42] [INFO ] Implicit Places using invariants in 34 ms returned []
[2024-05-30 12:50:42] [INFO ] Invariant cache hit.
[2024-05-30 12:50:43] [INFO ] Implicit Places using invariants and state equation in 62 ms returned []
Implicit Place search using SMT with State Equation took 99 ms to find 0 implicit places.
[2024-05-30 12:50:43] [INFO ] Redundant transitions in 1 ms returned []
Running 64 sub problems to find dead transitions.
[2024-05-30 12:50:43] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/51 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/51 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 2 (OVERLAPS) 4/55 variables, 8/10 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/55 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 4 (OVERLAPS) 68/123 variables, 55/65 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/123 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 6 (OVERLAPS) 0/123 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 64 unsolved
No progress, stopping.
After SMT solving in domain Real declared 123/123 variables, and 65 constraints, problems are : Problem set: 0 solved, 64 unsolved in 1082 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 55/55 constraints, PredecessorRefiner: 64/64 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 64 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/51 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/51 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 2 (OVERLAPS) 4/55 variables, 8/10 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/55 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 4 (OVERLAPS) 68/123 variables, 55/65 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/123 variables, 64/129 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/123 variables, 0/129 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 7 (OVERLAPS) 0/123 variables, 0/129 constraints. Problems are: Problem set: 0 solved, 64 unsolved
No progress, stopping.
After SMT solving in domain Int declared 123/123 variables, and 129 constraints, problems are : Problem set: 0 solved, 64 unsolved in 1118 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 55/55 constraints, PredecessorRefiner: 64/64 constraints, Known Traps: 0/0 constraints]
After SMT, in 2220ms problems are : Problem set: 0 solved, 64 unsolved
Search for dead transitions found 0 dead transitions in 2228ms
Starting structural reductions in SI_LTL mode, iteration 1 : 55/65 places, 68/86 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2351 ms. Remains : 55/65 places, 68/86 transitions.
Stuttering acceptance computed with spot in 170 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) p1 (NOT p2)), false]
Running random walk in product with property : UtilityControlRoom-PT-Z2T4N04-LTLFireability-04
Product exploration explored 100000 steps with 23101 reset in 287 ms.
Product exploration explored 100000 steps with 23079 reset in 463 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1) (NOT p2)), (X (NOT p2)), (X (AND (NOT p0) p1)), (X (AND (NOT p0) (NOT p2))), (X (NOT p0)), (X (AND (NOT p0) p1 (NOT p2))), (X p1), (X (X (NOT p0)))]
False Knowledge obtained : [(X (X p2)), (X (X (NOT p2))), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (AND (NOT p0) p1 p2))), (X (X (NOT (AND (NOT p0) p1 p2)))), (X (X (AND (NOT p0) p1 (NOT p2)))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 8 factoid took 498 ms. Reduced automaton from 4 states, 9 edges and 3 AP (stutter insensitive) to 4 states, 9 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 190 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2) p1), false]
RANDOM walk for 144 steps (0 resets) in 9 ms. (14 steps per ms) remains 0/6 properties
Knowledge obtained : [(AND (NOT p0) (NOT p1) (NOT p2)), (X (NOT p2)), (X (AND (NOT p0) p1)), (X (AND (NOT p0) (NOT p2))), (X (NOT p0)), (X (AND (NOT p0) p1 (NOT p2))), (X p1), (X (X (NOT p0)))]
False Knowledge obtained : [(X (X p2)), (X (X (NOT p2))), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (AND (NOT p0) p1 p2))), (X (X (NOT (AND (NOT p0) p1 p2)))), (X (X (AND (NOT p0) p1 (NOT p2)))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X p1)), (X (X (NOT p1))), (F (NOT (OR p0 (NOT p2) (NOT p1)))), (F p0), (F p1), (F p2), (F (NOT (OR p0 p2 (NOT p1)))), (F (NOT (AND (NOT p0) (NOT p2))))]
Knowledge based reduction with 8 factoid took 652 ms. Reduced automaton from 4 states, 9 edges and 3 AP (stutter insensitive) to 4 states, 9 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 150 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2) p1), false]
Stuttering acceptance computed with spot in 173 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2) p1), false]
[2024-05-30 12:50:47] [INFO ] Invariant cache hit.
[2024-05-30 12:50:48] [INFO ] [Real]Absence check using 10 positive place invariants in 7 ms returned sat
[2024-05-30 12:50:48] [INFO ] [Real]Absence check using state equation in 54 ms returned sat
[2024-05-30 12:50:48] [INFO ] Solution in real domain found non-integer solution.
[2024-05-30 12:50:48] [INFO ] [Nat]Absence check using 10 positive place invariants in 7 ms returned sat
[2024-05-30 12:50:48] [INFO ] [Nat]Absence check using state equation in 50 ms returned sat
[2024-05-30 12:50:48] [INFO ] Computed and/alt/rep : 64/100/64 causal constraints (skipped 0 transitions) in 9 ms.
[2024-05-30 12:50:48] [INFO ] Added : 50 causal constraints over 10 iterations in 120 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p2))
Support contains 23 out of 55 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 55/55 places, 68/68 transitions.
Applied a total of 0 rules in 5 ms. Remains 55 /55 variables (removed 0) and now considering 68/68 (removed 0) transitions.
[2024-05-30 12:50:48] [INFO ] Invariant cache hit.
[2024-05-30 12:50:48] [INFO ] Implicit Places using invariants in 38 ms returned []
[2024-05-30 12:50:48] [INFO ] Invariant cache hit.
[2024-05-30 12:50:48] [INFO ] Implicit Places using invariants and state equation in 72 ms returned []
Implicit Place search using SMT with State Equation took 113 ms to find 0 implicit places.
[2024-05-30 12:50:48] [INFO ] Redundant transitions in 2 ms returned []
Running 64 sub problems to find dead transitions.
[2024-05-30 12:50:48] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/51 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/51 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 2 (OVERLAPS) 4/55 variables, 8/10 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/55 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 4 (OVERLAPS) 68/123 variables, 55/65 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/123 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 6 (OVERLAPS) 0/123 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 64 unsolved
No progress, stopping.
After SMT solving in domain Real declared 123/123 variables, and 65 constraints, problems are : Problem set: 0 solved, 64 unsolved in 1231 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 55/55 constraints, PredecessorRefiner: 64/64 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 64 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/51 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/51 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 2 (OVERLAPS) 4/55 variables, 8/10 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/55 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 4 (OVERLAPS) 68/123 variables, 55/65 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/123 variables, 64/129 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/123 variables, 0/129 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 7 (OVERLAPS) 0/123 variables, 0/129 constraints. Problems are: Problem set: 0 solved, 64 unsolved
No progress, stopping.
After SMT solving in domain Int declared 123/123 variables, and 129 constraints, problems are : Problem set: 0 solved, 64 unsolved in 1135 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 55/55 constraints, PredecessorRefiner: 64/64 constraints, Known Traps: 0/0 constraints]
After SMT, in 2390ms problems are : Problem set: 0 solved, 64 unsolved
Search for dead transitions found 0 dead transitions in 2393ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 2519 ms. Remains : 55/55 places, 68/68 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p2) (NOT p1)), (X (NOT p2)), (X (AND (NOT p0) (NOT p2))), (X (AND (NOT p0) (NOT p2) p1)), (X (NOT p0)), (X (NOT (AND (NOT p0) p2 p1))), (X p1), (X (X (NOT p0)))]
False Knowledge obtained : [(X (X p2)), (X (X (NOT p2))), (X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (AND (NOT p0) (NOT p2) p1))), (X (X (NOT (AND (NOT p0) (NOT p2) p1)))), (X (X (AND (NOT p0) p2 p1))), (X (X (NOT (AND (NOT p0) p2 p1)))), (X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 8 factoid took 443 ms. Reduced automaton from 4 states, 9 edges and 3 AP (stutter insensitive) to 4 states, 9 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 164 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2) p1), false]
RANDOM walk for 84 steps (0 resets) in 4 ms. (16 steps per ms) remains 0/6 properties
Knowledge obtained : [(AND (NOT p0) (NOT p2) (NOT p1)), (X (NOT p2)), (X (AND (NOT p0) (NOT p2))), (X (AND (NOT p0) (NOT p2) p1)), (X (NOT p0)), (X (NOT (AND (NOT p0) p2 p1))), (X p1), (X (X (NOT p0)))]
False Knowledge obtained : [(X (X p2)), (X (X (NOT p2))), (X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (AND (NOT p0) (NOT p2) p1))), (X (X (NOT (AND (NOT p0) (NOT p2) p1)))), (X (X (AND (NOT p0) p2 p1))), (X (X (NOT (AND (NOT p0) p2 p1)))), (X (X p1)), (X (X (NOT p1))), (F (NOT (OR p0 (NOT p2) (NOT p1)))), (F p0), (F p1), (F p2), (F (NOT (OR p0 p2 (NOT p1)))), (F (NOT (AND (NOT p0) (NOT p2))))]
Knowledge based reduction with 8 factoid took 598 ms. Reduced automaton from 4 states, 9 edges and 3 AP (stutter insensitive) to 4 states, 9 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 146 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2) p1), false]
Stuttering acceptance computed with spot in 147 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2) p1), false]
[2024-05-30 12:50:52] [INFO ] Invariant cache hit.
[2024-05-30 12:50:52] [INFO ] [Real]Absence check using 10 positive place invariants in 5 ms returned sat
[2024-05-30 12:50:52] [INFO ] [Real]Absence check using state equation in 38 ms returned sat
[2024-05-30 12:50:52] [INFO ] Solution in real domain found non-integer solution.
[2024-05-30 12:50:52] [INFO ] [Nat]Absence check using 10 positive place invariants in 6 ms returned sat
[2024-05-30 12:50:52] [INFO ] [Nat]Absence check using state equation in 36 ms returned sat
[2024-05-30 12:50:52] [INFO ] Computed and/alt/rep : 64/100/64 causal constraints (skipped 0 transitions) in 5 ms.
[2024-05-30 12:50:52] [INFO ] Added : 50 causal constraints over 10 iterations in 84 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p2))
Stuttering acceptance computed with spot in 158 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2) p1), false]
Product exploration explored 100000 steps with 22070 reset in 359 ms.
Product exploration explored 100000 steps with 22179 reset in 366 ms.
Support contains 23 out of 55 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 55/55 places, 68/68 transitions.
Applied a total of 0 rules in 3 ms. Remains 55 /55 variables (removed 0) and now considering 68/68 (removed 0) transitions.
[2024-05-30 12:50:53] [INFO ] Invariant cache hit.
[2024-05-30 12:50:53] [INFO ] Implicit Places using invariants in 46 ms returned []
[2024-05-30 12:50:53] [INFO ] Invariant cache hit.
[2024-05-30 12:50:53] [INFO ] Implicit Places using invariants and state equation in 59 ms returned []
Implicit Place search using SMT with State Equation took 108 ms to find 0 implicit places.
[2024-05-30 12:50:53] [INFO ] Redundant transitions in 2 ms returned []
Running 64 sub problems to find dead transitions.
[2024-05-30 12:50:53] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/51 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/51 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 2 (OVERLAPS) 4/55 variables, 8/10 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/55 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 4 (OVERLAPS) 68/123 variables, 55/65 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/123 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 6 (OVERLAPS) 0/123 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 64 unsolved
No progress, stopping.
After SMT solving in domain Real declared 123/123 variables, and 65 constraints, problems are : Problem set: 0 solved, 64 unsolved in 1097 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 55/55 constraints, PredecessorRefiner: 64/64 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 64 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/51 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/51 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 2 (OVERLAPS) 4/55 variables, 8/10 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/55 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 4 (OVERLAPS) 68/123 variables, 55/65 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/123 variables, 64/129 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/123 variables, 0/129 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 7 (OVERLAPS) 0/123 variables, 0/129 constraints. Problems are: Problem set: 0 solved, 64 unsolved
No progress, stopping.
After SMT solving in domain Int declared 123/123 variables, and 129 constraints, problems are : Problem set: 0 solved, 64 unsolved in 1160 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 55/55 constraints, PredecessorRefiner: 64/64 constraints, Known Traps: 0/0 constraints]
After SMT, in 2282ms problems are : Problem set: 0 solved, 64 unsolved
Search for dead transitions found 0 dead transitions in 2284ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 2402 ms. Remains : 55/55 places, 68/68 transitions.
Treatment of property UtilityControlRoom-PT-Z2T4N04-LTLFireability-04 finished in 13283 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 12 out of 65 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 65/65 places, 86/86 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 65 transition count 82
Reduce places removed 4 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 10 place count 61 transition count 80
Performed 22 Post agglomeration using F-continuation condition.Transition count delta: 22
Deduced a syphon composed of 22 places in 0 ms
Reduce places removed 22 places and 0 transitions.
Iterating global reduction 2 with 44 rules applied. Total rules applied 54 place count 39 transition count 58
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 60 place count 39 transition count 52
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 61 place count 38 transition count 44
Ensure Unique test removed 1 places
Iterating global reduction 3 with 2 rules applied. Total rules applied 63 place count 37 transition count 44
Applied a total of 63 rules in 9 ms. Remains 37 /65 variables (removed 28) and now considering 44/86 (removed 42) transitions.
// Phase 1: matrix 44 rows 37 cols
[2024-05-30 12:50:56] [INFO ] Computed 9 invariants in 1 ms
[2024-05-30 12:50:56] [INFO ] Implicit Places using invariants in 33 ms returned []
[2024-05-30 12:50:56] [INFO ] Invariant cache hit.
[2024-05-30 12:50:56] [INFO ] Implicit Places using invariants and state equation in 69 ms returned []
Implicit Place search using SMT with State Equation took 104 ms to find 0 implicit places.
[2024-05-30 12:50:56] [INFO ] Redundant transitions in 1 ms returned []
Running 36 sub problems to find dead transitions.
[2024-05-30 12:50:56] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/33 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/33 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 2 (OVERLAPS) 4/37 variables, 8/9 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/37 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 4 (OVERLAPS) 44/81 variables, 37/46 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/81 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 6 (OVERLAPS) 0/81 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 36 unsolved
No progress, stopping.
After SMT solving in domain Real declared 81/81 variables, and 46 constraints, problems are : Problem set: 0 solved, 36 unsolved in 683 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 37/37 constraints, PredecessorRefiner: 36/36 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 36 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/33 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/33 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 2 (OVERLAPS) 4/37 variables, 8/9 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/37 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 4 (OVERLAPS) 44/81 variables, 37/46 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/81 variables, 36/82 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/81 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 7 (OVERLAPS) 0/81 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 36 unsolved
No progress, stopping.
After SMT solving in domain Int declared 81/81 variables, and 82 constraints, problems are : Problem set: 0 solved, 36 unsolved in 492 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 37/37 constraints, PredecessorRefiner: 36/36 constraints, Known Traps: 0/0 constraints]
After SMT, in 1190ms problems are : Problem set: 0 solved, 36 unsolved
Search for dead transitions found 0 dead transitions in 1191ms
Starting structural reductions in SI_LTL mode, iteration 1 : 37/65 places, 44/86 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1311 ms. Remains : 37/65 places, 44/86 transitions.
Stuttering acceptance computed with spot in 90 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : UtilityControlRoom-PT-Z2T4N04-LTLFireability-05
Product exploration explored 100000 steps with 9149 reset in 147 ms.
Stack based approach found an accepted trace after 493 steps with 47 reset with depth 8 and stack size 8 in 1 ms.
FORMULA UtilityControlRoom-PT-Z2T4N04-LTLFireability-05 FALSE TECHNIQUES STACK_TEST
Treatment of property UtilityControlRoom-PT-Z2T4N04-LTLFireability-05 finished in 1567 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((p0&&F(p1)))))'
Support contains 3 out of 65 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 65/65 places, 86/86 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 63 transition count 84
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 63 transition count 84
Applied a total of 4 rules in 3 ms. Remains 63 /65 variables (removed 2) and now considering 84/86 (removed 2) transitions.
// Phase 1: matrix 84 rows 63 cols
[2024-05-30 12:50:57] [INFO ] Computed 10 invariants in 2 ms
[2024-05-30 12:50:57] [INFO ] Implicit Places using invariants in 66 ms returned [42]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 68 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 62/65 places, 84/86 transitions.
Applied a total of 0 rules in 2 ms. Remains 62 /62 variables (removed 0) and now considering 84/84 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 74 ms. Remains : 62/65 places, 84/86 transitions.
Stuttering acceptance computed with spot in 132 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), true, (NOT p1)]
Running random walk in product with property : UtilityControlRoom-PT-Z2T4N04-LTLFireability-08
Entered a terminal (fully accepting) state of product in 3122 steps with 2 reset in 5 ms.
FORMULA UtilityControlRoom-PT-Z2T4N04-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property UtilityControlRoom-PT-Z2T4N04-LTLFireability-08 finished in 226 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0) U (p1||(F(p1) U p2))))'
Support contains 5 out of 65 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 65/65 places, 86/86 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 65 transition count 82
Reduce places removed 4 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 10 place count 61 transition count 80
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 7 Pre rules applied. Total rules applied 10 place count 61 transition count 73
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 2 with 14 rules applied. Total rules applied 24 place count 54 transition count 73
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: 12
Deduced a syphon composed of 12 places in 4 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 2 with 24 rules applied. Total rules applied 48 place count 42 transition count 61
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 53 place count 42 transition count 56
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 55 place count 41 transition count 55
Applied a total of 55 rules in 19 ms. Remains 41 /65 variables (removed 24) and now considering 55/86 (removed 31) transitions.
// Phase 1: matrix 55 rows 41 cols
[2024-05-30 12:50:58] [INFO ] Computed 10 invariants in 0 ms
[2024-05-30 12:50:58] [INFO ] Implicit Places using invariants in 52 ms returned []
[2024-05-30 12:50:58] [INFO ] Invariant cache hit.
[2024-05-30 12:50:58] [INFO ] Implicit Places using invariants and state equation in 58 ms returned []
Implicit Place search using SMT with State Equation took 112 ms to find 0 implicit places.
[2024-05-30 12:50:58] [INFO ] Redundant transitions in 1 ms returned []
Running 46 sub problems to find dead transitions.
[2024-05-30 12:50:58] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/37 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/37 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 2 (OVERLAPS) 4/41 variables, 7/10 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/41 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 4 (OVERLAPS) 55/96 variables, 41/51 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/96 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 6 (OVERLAPS) 0/96 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 46 unsolved
No progress, stopping.
After SMT solving in domain Real declared 96/96 variables, and 51 constraints, problems are : Problem set: 0 solved, 46 unsolved in 725 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 41/41 constraints, PredecessorRefiner: 46/46 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 46 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/37 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/37 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 2 (OVERLAPS) 4/41 variables, 7/10 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/41 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 4 (OVERLAPS) 55/96 variables, 41/51 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/96 variables, 46/97 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/96 variables, 0/97 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 7 (OVERLAPS) 0/96 variables, 0/97 constraints. Problems are: Problem set: 0 solved, 46 unsolved
No progress, stopping.
After SMT solving in domain Int declared 96/96 variables, and 97 constraints, problems are : Problem set: 0 solved, 46 unsolved in 1011 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 41/41 constraints, PredecessorRefiner: 46/46 constraints, Known Traps: 0/0 constraints]
After SMT, in 1751ms problems are : Problem set: 0 solved, 46 unsolved
Search for dead transitions found 0 dead transitions in 1752ms
Starting structural reductions in SI_LTL mode, iteration 1 : 41/65 places, 55/86 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1889 ms. Remains : 41/65 places, 55/86 transitions.
Stuttering acceptance computed with spot in 229 ms :[(AND (NOT p1) (NOT p2)), (NOT p1), (NOT p2), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : UtilityControlRoom-PT-Z2T4N04-LTLFireability-09
Product exploration explored 100000 steps with 2179 reset in 139 ms.
Stack based approach found an accepted trace after 149 steps with 4 reset with depth 12 and stack size 12 in 1 ms.
FORMULA UtilityControlRoom-PT-Z2T4N04-LTLFireability-09 FALSE TECHNIQUES STACK_TEST
Treatment of property UtilityControlRoom-PT-Z2T4N04-LTLFireability-09 finished in 2286 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(G(p0)))))'
Support contains 1 out of 65 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 65/65 places, 86/86 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 63 transition count 84
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 63 transition count 84
Applied a total of 4 rules in 5 ms. Remains 63 /65 variables (removed 2) and now considering 84/86 (removed 2) transitions.
// Phase 1: matrix 84 rows 63 cols
[2024-05-30 12:51:00] [INFO ] Computed 10 invariants in 2 ms
[2024-05-30 12:51:00] [INFO ] Implicit Places using invariants in 70 ms returned [42]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 71 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 62/65 places, 84/86 transitions.
Applied a total of 0 rules in 2 ms. Remains 62 /62 variables (removed 0) and now considering 84/84 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 78 ms. Remains : 62/65 places, 84/86 transitions.
Stuttering acceptance computed with spot in 163 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : UtilityControlRoom-PT-Z2T4N04-LTLFireability-10
Entered a terminal (fully accepting) state of product in 8 steps with 0 reset in 0 ms.
FORMULA UtilityControlRoom-PT-Z2T4N04-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property UtilityControlRoom-PT-Z2T4N04-LTLFireability-10 finished in 261 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F(G(p1)))))'
Support contains 2 out of 65 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 65/65 places, 86/86 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 65 transition count 83
Reduce places removed 3 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 7 place count 62 transition count 82
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 7 Pre rules applied. Total rules applied 7 place count 62 transition count 75
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 2 with 14 rules applied. Total rules applied 21 place count 55 transition count 75
Performed 21 Post agglomeration using F-continuation condition.Transition count delta: 21
Deduced a syphon composed of 21 places in 0 ms
Reduce places removed 21 places and 0 transitions.
Iterating global reduction 2 with 42 rules applied. Total rules applied 63 place count 34 transition count 54
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 68 place count 34 transition count 49
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 69 place count 34 transition count 48
Applied a total of 69 rules in 18 ms. Remains 34 /65 variables (removed 31) and now considering 48/86 (removed 38) transitions.
// Phase 1: matrix 48 rows 34 cols
[2024-05-30 12:51:00] [INFO ] Computed 10 invariants in 1 ms
[2024-05-30 12:51:00] [INFO ] Implicit Places using invariants in 56 ms returned [25]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 57 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 33/65 places, 48/86 transitions.
Applied a total of 0 rules in 2 ms. Remains 33 /33 variables (removed 0) and now considering 48/48 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 77 ms. Remains : 33/65 places, 48/86 transitions.
Stuttering acceptance computed with spot in 124 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : UtilityControlRoom-PT-Z2T4N04-LTLFireability-11
Product exploration explored 100000 steps with 0 reset in 151 ms.
Stack based approach found an accepted trace after 142 steps with 0 reset with depth 143 and stack size 143 in 0 ms.
FORMULA UtilityControlRoom-PT-Z2T4N04-LTLFireability-11 FALSE TECHNIQUES STACK_TEST
Treatment of property UtilityControlRoom-PT-Z2T4N04-LTLFireability-11 finished in 367 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0||X(p0)||(p1 U G(p0)))))'
Support contains 3 out of 65 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 65/65 places, 86/86 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 64 transition count 85
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 64 transition count 85
Applied a total of 2 rules in 5 ms. Remains 64 /65 variables (removed 1) and now considering 85/86 (removed 1) transitions.
// Phase 1: matrix 85 rows 64 cols
[2024-05-30 12:51:00] [INFO ] Computed 10 invariants in 1 ms
[2024-05-30 12:51:01] [INFO ] Implicit Places using invariants in 88 ms returned [43]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 91 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 63/65 places, 85/86 transitions.
Applied a total of 0 rules in 6 ms. Remains 63 /63 variables (removed 0) and now considering 85/85 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 103 ms. Remains : 63/65 places, 85/86 transitions.
Stuttering acceptance computed with spot in 244 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), true, (NOT p0), (NOT p0)]
Running random walk in product with property : UtilityControlRoom-PT-Z2T4N04-LTLFireability-12
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA UtilityControlRoom-PT-Z2T4N04-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property UtilityControlRoom-PT-Z2T4N04-LTLFireability-12 finished in 366 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(!p0)))'
Support contains 1 out of 65 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 65/65 places, 86/86 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 63 transition count 84
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 63 transition count 84
Applied a total of 4 rules in 3 ms. Remains 63 /65 variables (removed 2) and now considering 84/86 (removed 2) transitions.
// Phase 1: matrix 84 rows 63 cols
[2024-05-30 12:51:01] [INFO ] Computed 10 invariants in 1 ms
[2024-05-30 12:51:01] [INFO ] Implicit Places using invariants in 66 ms returned [42]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 67 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 62/65 places, 84/86 transitions.
Applied a total of 0 rules in 1 ms. Remains 62 /62 variables (removed 0) and now considering 84/84 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 73 ms. Remains : 62/65 places, 84/86 transitions.
Stuttering acceptance computed with spot in 70 ms :[p0, p0]
Running random walk in product with property : UtilityControlRoom-PT-Z2T4N04-LTLFireability-14
Product exploration explored 100000 steps with 34797 reset in 173 ms.
Product exploration explored 100000 steps with 34733 reset in 229 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(NOT p0)]
False Knowledge obtained : [(X p0), (X (NOT p0)), (X (X p0)), (X (X (NOT p0)))]
Knowledge based reduction with 1 factoid took 150 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 2 states, 2 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 67 ms :[p0, p0]
RANDOM walk for 27 steps (0 resets) in 5 ms. (4 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0)]
False Knowledge obtained : [(X p0), (X (NOT p0)), (X (X p0)), (X (X (NOT p0))), (F p0)]
Knowledge based reduction with 1 factoid took 169 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 2 states, 2 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 65 ms :[p0, p0]
Stuttering acceptance computed with spot in 64 ms :[p0, p0]
Support contains 1 out of 62 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 62/62 places, 84/84 transitions.
Applied a total of 0 rules in 1 ms. Remains 62 /62 variables (removed 0) and now considering 84/84 (removed 0) transitions.
// Phase 1: matrix 84 rows 62 cols
[2024-05-30 12:51:02] [INFO ] Computed 9 invariants in 1 ms
[2024-05-30 12:51:02] [INFO ] Implicit Places using invariants in 49 ms returned []
[2024-05-30 12:51:02] [INFO ] Invariant cache hit.
[2024-05-30 12:51:02] [INFO ] Implicit Places using invariants and state equation in 72 ms returned []
Implicit Place search using SMT with State Equation took 123 ms to find 0 implicit places.
Running 80 sub problems to find dead transitions.
[2024-05-30 12:51:02] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/58 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/58 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 2 (OVERLAPS) 4/62 variables, 8/9 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/62 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 4 (OVERLAPS) 84/146 variables, 62/71 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/146 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 6 (OVERLAPS) 0/146 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 80 unsolved
No progress, stopping.
After SMT solving in domain Real declared 146/146 variables, and 71 constraints, problems are : Problem set: 0 solved, 80 unsolved in 1357 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 62/62 constraints, PredecessorRefiner: 80/80 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 80 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/58 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/58 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 2 (OVERLAPS) 4/62 variables, 8/9 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/62 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 4 (OVERLAPS) 84/146 variables, 62/71 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/146 variables, 80/151 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/146 variables, 0/151 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 7 (OVERLAPS) 0/146 variables, 0/151 constraints. Problems are: Problem set: 0 solved, 80 unsolved
No progress, stopping.
After SMT solving in domain Int declared 146/146 variables, and 151 constraints, problems are : Problem set: 0 solved, 80 unsolved in 1587 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 62/62 constraints, PredecessorRefiner: 80/80 constraints, Known Traps: 0/0 constraints]
After SMT, in 2963ms problems are : Problem set: 0 solved, 80 unsolved
Search for dead transitions found 0 dead transitions in 2964ms
Finished structural reductions in LTL mode , in 1 iterations and 3089 ms. Remains : 62/62 places, 84/84 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(NOT p0)]
False Knowledge obtained : [(X p0), (X (NOT p0)), (X (X p0)), (X (X (NOT p0)))]
Knowledge based reduction with 1 factoid took 198 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 2 states, 2 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 84 ms :[p0, p0]
RANDOM walk for 39 steps (0 resets) in 4 ms. (7 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0)]
False Knowledge obtained : [(X p0), (X (NOT p0)), (X (X p0)), (X (X (NOT p0))), (F p0)]
Knowledge based reduction with 1 factoid took 166 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 2 states, 2 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 75 ms :[p0, p0]
Stuttering acceptance computed with spot in 75 ms :[p0, p0]
Stuttering acceptance computed with spot in 64 ms :[p0, p0]
Product exploration explored 100000 steps with 34684 reset in 86 ms.
Product exploration explored 100000 steps with 34601 reset in 97 ms.
Applying partial POR strategy [false, true]
Stuttering acceptance computed with spot in 64 ms :[p0, p0]
Support contains 1 out of 62 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 62/62 places, 84/84 transitions.
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 8 Pre rules applied. Total rules applied 0 place count 62 transition count 92
Deduced a syphon composed of 8 places in 0 ms
Iterating global reduction 0 with 8 rules applied. Total rules applied 8 place count 62 transition count 92
Performed 23 Post agglomeration using F-continuation condition.Transition count delta: -3
Deduced a syphon composed of 31 places in 0 ms
Iterating global reduction 0 with 23 rules applied. Total rules applied 31 place count 62 transition count 95
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 0 with 8 rules applied. Total rules applied 39 place count 62 transition count 87
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 40 place count 61 transition count 79
Deduced a syphon composed of 31 places in 0 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 41 place count 61 transition count 79
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 53 place count 49 transition count 59
Deduced a syphon composed of 23 places in 0 ms
Iterating global reduction 1 with 12 rules applied. Total rules applied 65 place count 49 transition count 59
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 73 place count 41 transition count 51
Deduced a syphon composed of 19 places in 0 ms
Iterating global reduction 1 with 8 rules applied. Total rules applied 81 place count 41 transition count 51
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 88 place count 41 transition count 44
Deduced a syphon composed of 19 places in 0 ms
Applied a total of 88 rules in 10 ms. Remains 41 /62 variables (removed 21) and now considering 44/84 (removed 40) transitions.
[2024-05-30 12:51:06] [INFO ] Redundant transitions in 0 ms returned []
Running 40 sub problems to find dead transitions.
// Phase 1: matrix 44 rows 41 cols
[2024-05-30 12:51:06] [INFO ] Computed 9 invariants in 0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/37 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 40 unsolved
[2024-05-30 12:51:06] [INFO ] Deduced a trap composed of 5 places in 21 ms of which 2 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/37 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/37 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 3 (OVERLAPS) 4/41 variables, 8/10 constraints. Problems are: Problem set: 0 solved, 40 unsolved
[2024-05-30 12:51:06] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 1 ms to minimize.
[2024-05-30 12:51:06] [INFO ] Deduced a trap composed of 4 places in 18 ms of which 1 ms to minimize.
Problem TDEAD1 is UNSAT
[2024-05-30 12:51:06] [INFO ] Deduced a trap composed of 3 places in 17 ms of which 1 ms to minimize.
Problem TDEAD2 is UNSAT
Problem TDEAD3 is UNSAT
[2024-05-30 12:51:06] [INFO ] Deduced a trap composed of 3 places in 17 ms of which 0 ms to minimize.
Problem TDEAD4 is UNSAT
Problem TDEAD6 is UNSAT
Problem TDEAD7 is UNSAT
Problem TDEAD8 is UNSAT
Problem TDEAD9 is UNSAT
Problem TDEAD10 is UNSAT
Problem TDEAD11 is UNSAT
Problem TDEAD12 is UNSAT
Problem TDEAD24 is UNSAT
Problem TDEAD25 is UNSAT
Problem TDEAD26 is UNSAT
Problem TDEAD27 is UNSAT
Problem TDEAD28 is UNSAT
Problem TDEAD29 is UNSAT
Problem TDEAD32 is UNSAT
Problem TDEAD33 is UNSAT
Problem TDEAD36 is UNSAT
Problem TDEAD37 is UNSAT
Problem TDEAD40 is UNSAT
Problem TDEAD41 is UNSAT
At refinement iteration 4 (INCLUDED_ONLY) 0/41 variables, 4/14 constraints. Problems are: Problem set: 23 solved, 17 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/41 variables, 0/14 constraints. Problems are: Problem set: 23 solved, 17 unsolved
At refinement iteration 6 (OVERLAPS) 44/85 variables, 41/55 constraints. Problems are: Problem set: 23 solved, 17 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/85 variables, 0/55 constraints. Problems are: Problem set: 23 solved, 17 unsolved
At refinement iteration 8 (OVERLAPS) 0/85 variables, 0/55 constraints. Problems are: Problem set: 23 solved, 17 unsolved
No progress, stopping.
After SMT solving in domain Real declared 85/85 variables, and 55 constraints, problems are : Problem set: 23 solved, 17 unsolved in 628 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 41/41 constraints, PredecessorRefiner: 40/40 constraints, Known Traps: 5/5 constraints]
Escalating to Integer solving :Problem set: 23 solved, 17 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/18 variables, 1/1 constraints. Problems are: Problem set: 23 solved, 17 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/18 variables, 0/1 constraints. Problems are: Problem set: 23 solved, 17 unsolved
At refinement iteration 2 (OVERLAPS) 23/41 variables, 9/10 constraints. Problems are: Problem set: 23 solved, 17 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/41 variables, 4/14 constraints. Problems are: Problem set: 23 solved, 17 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/41 variables, 0/14 constraints. Problems are: Problem set: 23 solved, 17 unsolved
At refinement iteration 5 (OVERLAPS) 44/85 variables, 41/55 constraints. Problems are: Problem set: 23 solved, 17 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/85 variables, 17/72 constraints. Problems are: Problem set: 23 solved, 17 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/85 variables, 0/72 constraints. Problems are: Problem set: 23 solved, 17 unsolved
At refinement iteration 8 (OVERLAPS) 0/85 variables, 0/72 constraints. Problems are: Problem set: 23 solved, 17 unsolved
No progress, stopping.
After SMT solving in domain Int declared 85/85 variables, and 72 constraints, problems are : Problem set: 23 solved, 17 unsolved in 272 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 41/41 constraints, PredecessorRefiner: 17/40 constraints, Known Traps: 5/5 constraints]
After SMT, in 908ms problems are : Problem set: 23 solved, 17 unsolved
Search for dead transitions found 23 dead transitions in 909ms
Found 23 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 23 transitions
Dead transitions reduction (with SMT) removed 23 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 41/62 places, 21/84 transitions.
Graph (complete) has 45 edges and 41 vertex of which 22 are kept as prefixes of interest. Removing 19 places using SCC suffix rule.0 ms
Discarding 19 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 1 ms. Remains 22 /41 variables (removed 19) and now considering 21/21 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 22/62 places, 21/84 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 925 ms. Remains : 22/62 places, 21/84 transitions.
Support contains 1 out of 62 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 62/62 places, 84/84 transitions.
Applied a total of 0 rules in 0 ms. Remains 62 /62 variables (removed 0) and now considering 84/84 (removed 0) transitions.
// Phase 1: matrix 84 rows 62 cols
[2024-05-30 12:51:07] [INFO ] Computed 9 invariants in 1 ms
[2024-05-30 12:51:07] [INFO ] Implicit Places using invariants in 57 ms returned []
[2024-05-30 12:51:07] [INFO ] Invariant cache hit.
[2024-05-30 12:51:07] [INFO ] Implicit Places using invariants and state equation in 71 ms returned []
Implicit Place search using SMT with State Equation took 131 ms to find 0 implicit places.
Running 80 sub problems to find dead transitions.
[2024-05-30 12:51:07] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/58 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/58 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 2 (OVERLAPS) 4/62 variables, 8/9 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/62 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 4 (OVERLAPS) 84/146 variables, 62/71 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/146 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 6 (OVERLAPS) 0/146 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 80 unsolved
No progress, stopping.
After SMT solving in domain Real declared 146/146 variables, and 71 constraints, problems are : Problem set: 0 solved, 80 unsolved in 1385 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 62/62 constraints, PredecessorRefiner: 80/80 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 80 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/58 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/58 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 2 (OVERLAPS) 4/62 variables, 8/9 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/62 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 4 (OVERLAPS) 84/146 variables, 62/71 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/146 variables, 80/151 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/146 variables, 0/151 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 7 (OVERLAPS) 0/146 variables, 0/151 constraints. Problems are: Problem set: 0 solved, 80 unsolved
No progress, stopping.
After SMT solving in domain Int declared 146/146 variables, and 151 constraints, problems are : Problem set: 0 solved, 80 unsolved in 1511 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 62/62 constraints, PredecessorRefiner: 80/80 constraints, Known Traps: 0/0 constraints]
After SMT, in 2913ms problems are : Problem set: 0 solved, 80 unsolved
Search for dead transitions found 0 dead transitions in 2914ms
Finished structural reductions in LTL mode , in 1 iterations and 3045 ms. Remains : 62/62 places, 84/84 transitions.
Treatment of property UtilityControlRoom-PT-Z2T4N04-LTLFireability-14 finished in 9218 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(((p0 U p1) U p2)))'
Support contains 6 out of 65 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 65/65 places, 86/86 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 63 transition count 84
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 63 transition count 84
Applied a total of 4 rules in 2 ms. Remains 63 /65 variables (removed 2) and now considering 84/86 (removed 2) transitions.
// Phase 1: matrix 84 rows 63 cols
[2024-05-30 12:51:10] [INFO ] Computed 10 invariants in 1 ms
[2024-05-30 12:51:10] [INFO ] Implicit Places using invariants in 54 ms returned []
[2024-05-30 12:51:10] [INFO ] Invariant cache hit.
[2024-05-30 12:51:10] [INFO ] Implicit Places using invariants and state equation in 94 ms returned []
Implicit Place search using SMT with State Equation took 150 ms to find 0 implicit places.
Running 80 sub problems to find dead transitions.
[2024-05-30 12:51:10] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/59 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/59 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 2 (OVERLAPS) 4/63 variables, 8/10 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/63 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 4 (OVERLAPS) 84/147 variables, 63/73 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/147 variables, 0/73 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 6 (OVERLAPS) 0/147 variables, 0/73 constraints. Problems are: Problem set: 0 solved, 80 unsolved
No progress, stopping.
After SMT solving in domain Real declared 147/147 variables, and 73 constraints, problems are : Problem set: 0 solved, 80 unsolved in 1492 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 63/63 constraints, PredecessorRefiner: 80/80 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 80 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/59 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/59 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 2 (OVERLAPS) 4/63 variables, 8/10 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/63 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 4 (OVERLAPS) 84/147 variables, 63/73 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/147 variables, 80/153 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/147 variables, 0/153 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 7 (OVERLAPS) 0/147 variables, 0/153 constraints. Problems are: Problem set: 0 solved, 80 unsolved
No progress, stopping.
After SMT solving in domain Int declared 147/147 variables, and 153 constraints, problems are : Problem set: 0 solved, 80 unsolved in 2374 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 63/63 constraints, PredecessorRefiner: 80/80 constraints, Known Traps: 0/0 constraints]
After SMT, in 3892ms problems are : Problem set: 0 solved, 80 unsolved
Search for dead transitions found 0 dead transitions in 3893ms
Starting structural reductions in LTL mode, iteration 1 : 63/65 places, 84/86 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4046 ms. Remains : 63/65 places, 84/86 transitions.
Stuttering acceptance computed with spot in 134 ms :[(NOT p2), (NOT p2), true, (NOT p1)]
Running random walk in product with property : UtilityControlRoom-PT-Z2T4N04-LTLFireability-15
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA UtilityControlRoom-PT-Z2T4N04-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property UtilityControlRoom-PT-Z2T4N04-LTLFireability-15 finished in 4297 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((p0 U p1)||X(X(X(F(p2))))))'
Found a Shortening insensitive property : UtilityControlRoom-PT-Z2T4N04-LTLFireability-00
Stuttering acceptance computed with spot in 269 ms :[(NOT p2), (AND (NOT p1) (NOT p2)), (NOT p2), (NOT p2), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Support contains 19 out of 65 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 65/65 places, 86/86 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 65 transition count 82
Reduce places removed 4 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 10 place count 61 transition count 80
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 8 Pre rules applied. Total rules applied 10 place count 61 transition count 72
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 2 with 16 rules applied. Total rules applied 26 place count 53 transition count 72
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
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 38 place count 47 transition count 66
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 44 place count 47 transition count 60
Applied a total of 44 rules in 11 ms. Remains 47 /65 variables (removed 18) and now considering 60/86 (removed 26) transitions.
// Phase 1: matrix 60 rows 47 cols
[2024-05-30 12:51:15] [INFO ] Computed 10 invariants in 0 ms
[2024-05-30 12:51:15] [INFO ] Implicit Places using invariants in 37 ms returned []
[2024-05-30 12:51:15] [INFO ] Invariant cache hit.
[2024-05-30 12:51:15] [INFO ] Implicit Places using invariants and state equation in 60 ms returned []
Implicit Place search using SMT with State Equation took 100 ms to find 0 implicit places.
Running 56 sub problems to find dead transitions.
[2024-05-30 12:51:15] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/43 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/43 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 2 (OVERLAPS) 4/47 variables, 8/10 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/47 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 4 (OVERLAPS) 60/107 variables, 47/57 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/107 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 6 (OVERLAPS) 0/107 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 56 unsolved
No progress, stopping.
After SMT solving in domain Real declared 107/107 variables, and 57 constraints, problems are : Problem set: 0 solved, 56 unsolved in 1140 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 47/47 constraints, PredecessorRefiner: 56/56 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 56 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/43 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/43 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 2 (OVERLAPS) 4/47 variables, 8/10 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/47 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 4 (OVERLAPS) 60/107 variables, 47/57 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/107 variables, 56/113 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/107 variables, 0/113 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 7 (OVERLAPS) 0/107 variables, 0/113 constraints. Problems are: Problem set: 0 solved, 56 unsolved
No progress, stopping.
After SMT solving in domain Int declared 107/107 variables, and 113 constraints, problems are : Problem set: 0 solved, 56 unsolved in 920 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 47/47 constraints, PredecessorRefiner: 56/56 constraints, Known Traps: 0/0 constraints]
After SMT, in 2074ms problems are : Problem set: 0 solved, 56 unsolved
Search for dead transitions found 0 dead transitions in 2075ms
Starting structural reductions in LI_LTL mode, iteration 1 : 47/65 places, 60/86 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 2186 ms. Remains : 47/65 places, 60/86 transitions.
Running random walk in product with property : UtilityControlRoom-PT-Z2T4N04-LTLFireability-00
Product exploration explored 100000 steps with 22970 reset in 161 ms.
Product exploration explored 100000 steps with 22937 reset in 169 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p2) (NOT p1) (NOT p0)), (X (AND (NOT p1) (NOT p0))), (X (NOT (AND (NOT p1) p0))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT p1)))]
False Knowledge obtained : [(X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (AND (NOT p1) p0))), (X (X (NOT (AND (NOT p1) p0)))), (X (X p0)), (X (X (NOT p0)))]
Knowledge based reduction with 6 factoid took 248 ms. Reduced automaton from 7 states, 11 edges and 3 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 143 ms :[(NOT p2), (NOT p2), (NOT p2), (NOT p2)]
RANDOM walk for 4 steps (0 resets) in 4 ms. (0 steps per ms) remains 0/1 properties
Knowledge obtained : [(AND (NOT p2) (NOT p1) (NOT p0)), (X (AND (NOT p1) (NOT p0))), (X (NOT (AND (NOT p1) p0))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT p1)))]
False Knowledge obtained : [(X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (AND (NOT p1) p0))), (X (X (NOT (AND (NOT p1) p0)))), (X (X p0)), (X (X (NOT p0))), (F p2)]
Knowledge based reduction with 6 factoid took 294 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 147 ms :[(NOT p2), (NOT p2), (NOT p2), (NOT p2)]
Stuttering acceptance computed with spot in 145 ms :[(NOT p2), (NOT p2), (NOT p2), (NOT p2)]
[2024-05-30 12:51:18] [INFO ] Invariant cache hit.
[2024-05-30 12:51:18] [INFO ] [Real]Absence check using 10 positive place invariants in 6 ms returned sat
[2024-05-30 12:51:18] [INFO ] [Real]Absence check using state equation in 32 ms returned sat
[2024-05-30 12:51:18] [INFO ] Computed and/alt/rep : 56/100/56 causal constraints (skipped 0 transitions) in 11 ms.
[2024-05-30 12:51:18] [INFO ] Added : 0 causal constraints over 0 iterations in 36 ms. Result :sat
Could not prove EG (NOT p2)
Support contains 4 out of 47 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 47/47 places, 60/60 transitions.
Applied a total of 0 rules in 1 ms. Remains 47 /47 variables (removed 0) and now considering 60/60 (removed 0) transitions.
[2024-05-30 12:51:18] [INFO ] Invariant cache hit.
[2024-05-30 12:51:18] [INFO ] Implicit Places using invariants in 54 ms returned []
[2024-05-30 12:51:18] [INFO ] Invariant cache hit.
[2024-05-30 12:51:19] [INFO ] Implicit Places using invariants and state equation in 90 ms returned []
Implicit Place search using SMT with State Equation took 172 ms to find 0 implicit places.
Running 56 sub problems to find dead transitions.
[2024-05-30 12:51:19] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/43 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/43 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 2 (OVERLAPS) 4/47 variables, 8/10 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/47 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 4 (OVERLAPS) 60/107 variables, 47/57 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/107 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 6 (OVERLAPS) 0/107 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 56 unsolved
No progress, stopping.
After SMT solving in domain Real declared 107/107 variables, and 57 constraints, problems are : Problem set: 0 solved, 56 unsolved in 1254 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 47/47 constraints, PredecessorRefiner: 56/56 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 56 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/43 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/43 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 2 (OVERLAPS) 4/47 variables, 8/10 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/47 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 4 (OVERLAPS) 60/107 variables, 47/57 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/107 variables, 56/113 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/107 variables, 0/113 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 7 (OVERLAPS) 0/107 variables, 0/113 constraints. Problems are: Problem set: 0 solved, 56 unsolved
No progress, stopping.
After SMT solving in domain Int declared 107/107 variables, and 113 constraints, problems are : Problem set: 0 solved, 56 unsolved in 1217 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 47/47 constraints, PredecessorRefiner: 56/56 constraints, Known Traps: 0/0 constraints]
After SMT, in 2512ms problems are : Problem set: 0 solved, 56 unsolved
Search for dead transitions found 0 dead transitions in 2513ms
Finished structural reductions in LTL mode , in 1 iterations and 2687 ms. Remains : 47/47 places, 60/60 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(NOT p2)]
False Knowledge obtained : []
Knowledge based reduction with 1 factoid took 81 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 156 ms :[(NOT p2), (NOT p2), (NOT p2), (NOT p2)]
RANDOM walk for 4 steps (0 resets) in 4 ms. (0 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p2)]
False Knowledge obtained : [(F p2)]
Knowledge based reduction with 1 factoid took 99 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 157 ms :[(NOT p2), (NOT p2), (NOT p2), (NOT p2)]
Stuttering acceptance computed with spot in 261 ms :[(NOT p2), (NOT p2), (NOT p2), (NOT p2)]
[2024-05-30 12:51:22] [INFO ] Invariant cache hit.
[2024-05-30 12:51:22] [INFO ] [Real]Absence check using 10 positive place invariants in 7 ms returned sat
[2024-05-30 12:51:22] [INFO ] [Real]Absence check using state equation in 34 ms returned sat
[2024-05-30 12:51:22] [INFO ] Computed and/alt/rep : 56/100/56 causal constraints (skipped 0 transitions) in 6 ms.
[2024-05-30 12:51:22] [INFO ] Added : 0 causal constraints over 0 iterations in 16 ms. Result :sat
Could not prove EG (NOT p2)
Stuttering acceptance computed with spot in 145 ms :[(NOT p2), (NOT p2), (NOT p2), (NOT p2)]
Product exploration explored 100000 steps with 22950 reset in 99 ms.
Product exploration explored 100000 steps with 22948 reset in 106 ms.
Applying partial POR strategy [true, false, false, false]
Stuttering acceptance computed with spot in 154 ms :[(NOT p2), (NOT p2), (NOT p2), (NOT p2)]
Support contains 4 out of 47 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 47/47 places, 60/60 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 46 transition count 52
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 46 transition count 52
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 6 place count 42 transition count 48
Iterating global reduction 0 with 4 rules applied. Total rules applied 10 place count 42 transition count 48
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 14 place count 38 transition count 40
Iterating global reduction 0 with 4 rules applied. Total rules applied 18 place count 38 transition count 40
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 22 place count 34 transition count 36
Iterating global reduction 0 with 4 rules applied. Total rules applied 26 place count 34 transition count 36
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 30 place count 34 transition count 32
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 8 places in 0 ms
Iterating global reduction 1 with 8 rules applied. Total rules applied 38 place count 34 transition count 32
Deduced a syphon composed of 8 places in 0 ms
Applied a total of 38 rules in 10 ms. Remains 34 /47 variables (removed 13) and now considering 32/60 (removed 28) transitions.
[2024-05-30 12:51:23] [INFO ] Redundant transitions in 0 ms returned []
Running 28 sub problems to find dead transitions.
// Phase 1: matrix 32 rows 34 cols
[2024-05-30 12:51:23] [INFO ] Computed 10 invariants in 0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/30 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/30 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 2 (OVERLAPS) 4/34 variables, 8/10 constraints. Problems are: Problem set: 0 solved, 28 unsolved
[2024-05-30 12:51:23] [INFO ] Deduced a trap composed of 4 places in 24 ms of which 0 ms to minimize.
Problem TDEAD8 is UNSAT
[2024-05-30 12:51:23] [INFO ] Deduced a trap composed of 4 places in 25 ms of which 0 ms to minimize.
Problem TDEAD9 is UNSAT
[2024-05-30 12:51:23] [INFO ] Deduced a trap composed of 4 places in 24 ms of which 0 ms to minimize.
Problem TDEAD10 is UNSAT
[2024-05-30 12:51:23] [INFO ] Deduced a trap composed of 4 places in 24 ms of which 1 ms to minimize.
Problem TDEAD11 is UNSAT
Problem TDEAD20 is UNSAT
Problem TDEAD21 is UNSAT
Problem TDEAD22 is UNSAT
Problem TDEAD23 is UNSAT
At refinement iteration 3 (INCLUDED_ONLY) 0/34 variables, 4/14 constraints. Problems are: Problem set: 8 solved, 20 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/34 variables, 0/14 constraints. Problems are: Problem set: 8 solved, 20 unsolved
At refinement iteration 5 (OVERLAPS) 32/66 variables, 34/48 constraints. Problems are: Problem set: 8 solved, 20 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/66 variables, 0/48 constraints. Problems are: Problem set: 8 solved, 20 unsolved
At refinement iteration 7 (OVERLAPS) 0/66 variables, 0/48 constraints. Problems are: Problem set: 8 solved, 20 unsolved
No progress, stopping.
After SMT solving in domain Real declared 66/66 variables, and 48 constraints, problems are : Problem set: 8 solved, 20 unsolved in 494 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 34/34 constraints, PredecessorRefiner: 28/28 constraints, Known Traps: 4/4 constraints]
Escalating to Integer solving :Problem set: 8 solved, 20 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/22 variables, 0/0 constraints. Problems are: Problem set: 8 solved, 20 unsolved
At refinement iteration 1 (OVERLAPS) 12/34 variables, 10/10 constraints. Problems are: Problem set: 8 solved, 20 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/34 variables, 4/14 constraints. Problems are: Problem set: 8 solved, 20 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/34 variables, 0/14 constraints. Problems are: Problem set: 8 solved, 20 unsolved
At refinement iteration 4 (OVERLAPS) 32/66 variables, 34/48 constraints. Problems are: Problem set: 8 solved, 20 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/66 variables, 20/68 constraints. Problems are: Problem set: 8 solved, 20 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/66 variables, 0/68 constraints. Problems are: Problem set: 8 solved, 20 unsolved
At refinement iteration 7 (OVERLAPS) 0/66 variables, 0/68 constraints. Problems are: Problem set: 8 solved, 20 unsolved
No progress, stopping.
After SMT solving in domain Int declared 66/66 variables, and 68 constraints, problems are : Problem set: 8 solved, 20 unsolved in 274 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 34/34 constraints, PredecessorRefiner: 20/28 constraints, Known Traps: 4/4 constraints]
After SMT, in 774ms problems are : Problem set: 8 solved, 20 unsolved
Search for dead transitions found 8 dead transitions in 775ms
Found 8 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 8 transitions
Dead transitions reduction (with SMT) removed 8 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 34/47 places, 24/60 transitions.
Graph (complete) has 64 edges and 34 vertex of which 26 are kept as prefixes of interest. Removing 8 places using SCC suffix rule.1 ms
Discarding 8 places :
Also discarding 0 output transitions
Ensure Unique test removed 1 places
Applied a total of 1 rules in 2 ms. Remains 25 /34 variables (removed 9) and now considering 24/24 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 25/47 places, 24/60 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 794 ms. Remains : 25/47 places, 24/60 transitions.
Support contains 4 out of 47 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 47/47 places, 60/60 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 46 transition count 52
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 46 transition count 52
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 6 place count 42 transition count 48
Iterating global reduction 0 with 4 rules applied. Total rules applied 10 place count 42 transition count 48
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 14 place count 38 transition count 40
Iterating global reduction 0 with 4 rules applied. Total rules applied 18 place count 38 transition count 40
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 22 place count 34 transition count 36
Iterating global reduction 0 with 4 rules applied. Total rules applied 26 place count 34 transition count 36
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 30 place count 34 transition count 32
Applied a total of 30 rules in 4 ms. Remains 34 /47 variables (removed 13) and now considering 32/60 (removed 28) transitions.
// Phase 1: matrix 32 rows 34 cols
[2024-05-30 12:51:23] [INFO ] Computed 10 invariants in 1 ms
[2024-05-30 12:51:23] [INFO ] Implicit Places using invariants in 51 ms returned [17]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 53 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 33/47 places, 32/60 transitions.
Applied a total of 0 rules in 1 ms. Remains 33 /33 variables (removed 0) and now considering 32/32 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 59 ms. Remains : 33/47 places, 32/60 transitions.
Treatment of property UtilityControlRoom-PT-Z2T4N04-LTLFireability-00 finished in 9225 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G((F(!p1) U X(p2)))||p0)))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(!p0)))'
Found a Shortening insensitive property : UtilityControlRoom-PT-Z2T4N04-LTLFireability-14
Stuttering acceptance computed with spot in 87 ms :[p0, p0]
Support contains 1 out of 65 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 65/65 places, 86/86 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 65 transition count 82
Reduce places removed 4 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 10 place count 61 transition count 80
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 8 Pre rules applied. Total rules applied 10 place count 61 transition count 72
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 2 with 16 rules applied. Total rules applied 26 place count 53 transition count 72
Performed 21 Post agglomeration using F-continuation condition.Transition count delta: 21
Deduced a syphon composed of 21 places in 0 ms
Reduce places removed 21 places and 0 transitions.
Iterating global reduction 2 with 42 rules applied. Total rules applied 68 place count 32 transition count 51
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 74 place count 32 transition count 45
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 75 place count 31 transition count 37
Ensure Unique test removed 1 places
Iterating global reduction 3 with 2 rules applied. Total rules applied 77 place count 30 transition count 37
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 81 place count 26 transition count 29
Iterating global reduction 3 with 4 rules applied. Total rules applied 85 place count 26 transition count 29
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 89 place count 22 transition count 25
Iterating global reduction 3 with 4 rules applied. Total rules applied 93 place count 22 transition count 25
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 97 place count 22 transition count 21
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 4 with 6 rules applied. Total rules applied 103 place count 19 transition count 18
Applied a total of 103 rules in 11 ms. Remains 19 /65 variables (removed 46) and now considering 18/86 (removed 68) transitions.
// Phase 1: matrix 18 rows 19 cols
[2024-05-30 12:51:24] [INFO ] Computed 9 invariants in 0 ms
[2024-05-30 12:51:24] [INFO ] Implicit Places using invariants in 42 ms returned []
[2024-05-30 12:51:24] [INFO ] Invariant cache hit.
[2024-05-30 12:51:24] [INFO ] Implicit Places using invariants and state equation in 36 ms returned []
Implicit Place search using SMT with State Equation took 81 ms to find 0 implicit places.
Running 11 sub problems to find dead transitions.
[2024-05-30 12:51:24] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/15 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/15 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 2 (OVERLAPS) 4/19 variables, 5/9 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/19 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 4 (OVERLAPS) 18/37 variables, 19/28 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/37 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 6 (OVERLAPS) 0/37 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 11 unsolved
No progress, stopping.
After SMT solving in domain Real declared 37/37 variables, and 28 constraints, problems are : Problem set: 0 solved, 11 unsolved in 137 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 19/19 constraints, PredecessorRefiner: 11/11 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 11 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/15 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/15 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 2 (OVERLAPS) 4/19 variables, 5/9 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/19 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 4 (OVERLAPS) 18/37 variables, 19/28 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/37 variables, 11/39 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/37 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 7 (OVERLAPS) 0/37 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 11 unsolved
No progress, stopping.
After SMT solving in domain Int declared 37/37 variables, and 39 constraints, problems are : Problem set: 0 solved, 11 unsolved in 136 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 19/19 constraints, PredecessorRefiner: 11/11 constraints, Known Traps: 0/0 constraints]
After SMT, in 279ms problems are : Problem set: 0 solved, 11 unsolved
Search for dead transitions found 0 dead transitions in 279ms
Starting structural reductions in LI_LTL mode, iteration 1 : 19/65 places, 18/86 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 372 ms. Remains : 19/65 places, 18/86 transitions.
Running random walk in product with property : UtilityControlRoom-PT-Z2T4N04-LTLFireability-14
Product exploration explored 100000 steps with 34930 reset in 85 ms.
Stack based approach found an accepted trace after 61 steps with 20 reset with depth 7 and stack size 7 in 0 ms.
Treatment of property UtilityControlRoom-PT-Z2T4N04-LTLFireability-14 finished in 677 ms.
Length sensitive decision was in the wrong direction : Shortening insensitive + false
[2024-05-30 12:51:24] [INFO ] Flatten gal took : 11 ms
[2024-05-30 12:51:24] [INFO ] Export to MCC of 3 properties in file /home/mcc/execution/LTLFireability.sr.xml took 5 ms.
[2024-05-30 12:51:24] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 65 places, 86 transitions and 252 arcs took 7 ms.
Total runtime 63936 ms.
There are residual formulas that ITS could not solve within timeout
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------

Running UtilityControlRoom-PT-Z2T4N04

IS_COLORED=
IS_NUPN=

LOADING PETRI NET FILE /home/mcc/execution/413/model.pnml (PNML) ...
PNML VERSION 2009, P/T NET.
COLOR CLASSES: 0
CONSTANTS: 0
PLACES: 65
TRANSITIONS: 86
COLOR VARS: 0
MEASURES: 0
LOADING TIME: [User 0.002s, Sys 0.000s]


SAVING FILE /home/mcc/execution/413/model (.net / .def) ...
EXPORT TIME: [User 0.000s, Sys 0.000s]


----------------------------------------------------------------------
GreatSPN/Meddly.
Copyright (C) 1987-2022, University of Torino, Italy.
website: https://github.com/greatspn/SOURCES

Based on MEDDLY version 0.16.0
Copyright (C) 2009, Iowa State University Research Foundation, Inc.
website: http://meddly.sourceforge.net

Process ID: 1945
MODEL NAME: /home/mcc/execution/413/model
65 places, 86 transitions.

Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Creating all event NSFs..
Building monolithic NSF...
FORMULA UtilityControlRoom-PT-Z2T4N04-LTLFireability-14 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA UtilityControlRoom-PT-Z2T4N04-LTLFireability-00 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA UtilityControlRoom-PT-Z2T4N04-LTLFireability-04 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
Ok.
EXITCODE: 0
----------------------------------------------------------------------

BK_STOP 1717073486759

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -timeout 360 -rebuildPNML

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="UtilityControlRoom-PT-Z2T4N04"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="greatspnxred"
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-5568"
echo " Executing tool greatspnxred"
echo " Input is UtilityControlRoom-PT-Z2T4N04, 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 r443-smll-171701110000188"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/UtilityControlRoom-PT-Z2T4N04.tgz
mv UtilityControlRoom-PT-Z2T4N04 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 ;