About the Execution of GreatSPN+red for UtilityControlRoom-COL-Z2T4N04
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
490.951 | 77106.00 | 112889.00 | 631.70 | TFFFFFTTTFFTFFTF | normal |
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-171701109600052.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-COL-Z2T4N04, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r443-smll-171701109600052
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 448K
-rw-r--r-- 1 mcc users 9.8K Apr 13 05:09 CTLCardinality.txt
-rw-r--r-- 1 mcc users 97K Apr 13 05:09 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.4K Apr 13 05:05 CTLFireability.txt
-rw-r--r-- 1 mcc users 40K Apr 13 05:05 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Apr 23 08:04 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Apr 23 08:04 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.7K Apr 23 08:04 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Apr 23 08:04 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.2K Apr 13 05:15 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 76K Apr 13 05:15 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Apr 13 05:13 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 81K Apr 13 05:13 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.9K Apr 23 08:04 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.0K Apr 23 08:04 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:43 equiv_pt
-rw-r--r-- 1 mcc users 8 May 18 16:43 instance
-rw-r--r-- 1 mcc users 5 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 29K 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-COL-Z2T4N04-LTLFireability-00
FORMULA_NAME UtilityControlRoom-COL-Z2T4N04-LTLFireability-01
FORMULA_NAME UtilityControlRoom-COL-Z2T4N04-LTLFireability-02
FORMULA_NAME UtilityControlRoom-COL-Z2T4N04-LTLFireability-03
FORMULA_NAME UtilityControlRoom-COL-Z2T4N04-LTLFireability-04
FORMULA_NAME UtilityControlRoom-COL-Z2T4N04-LTLFireability-05
FORMULA_NAME UtilityControlRoom-COL-Z2T4N04-LTLFireability-06
FORMULA_NAME UtilityControlRoom-COL-Z2T4N04-LTLFireability-07
FORMULA_NAME UtilityControlRoom-COL-Z2T4N04-LTLFireability-08
FORMULA_NAME UtilityControlRoom-COL-Z2T4N04-LTLFireability-09
FORMULA_NAME UtilityControlRoom-COL-Z2T4N04-LTLFireability-10
FORMULA_NAME UtilityControlRoom-COL-Z2T4N04-LTLFireability-11
FORMULA_NAME UtilityControlRoom-COL-Z2T4N04-LTLFireability-12
FORMULA_NAME UtilityControlRoom-COL-Z2T4N04-LTLFireability-13
FORMULA_NAME UtilityControlRoom-COL-Z2T4N04-LTLFireability-14
FORMULA_NAME UtilityControlRoom-COL-Z2T4N04-LTLFireability-15
=== Now, execution of the tool begins
BK_START 1717055384192
Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=UtilityControlRoom-COL-Z2T4N04
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-30 07:49:45] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2024-05-30 07:49:45] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-30 07:49:46] [INFO ] Detected file is not PT type :http://www.pnml.org/version-2009/grammar/symmetricnet
log4j:WARN No appenders could be found for logger (org.apache.axiom.locator.DefaultOMMetaFactoryLocator).
log4j:WARN Please initialize the log4j system properly.
log4j:WARN See http://logging.apache.org/log4j/1.2/faq.html#noconfig for more info.
[2024-05-30 07:49:46] [WARNING] Using fallBack plugin, rng conformance not checked
[2024-05-30 07:49:47] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 1092 ms
[2024-05-30 07:49:47] [INFO ] Imported 13 HL places and 12 HL transitions for a total of 72 PT places and 108.0 transition bindings in 32 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 16 ms.
Working with output stream class java.io.PrintStream
[2024-05-30 07:49:47] [INFO ] Built PT skeleton of HLPN with 13 places and 12 transitions 37 arcs in 5 ms.
[2024-05-30 07:49:47] [INFO ] Skeletonized 16 HLPN properties in 2 ms.
Initial state reduction rules removed 4 formulas.
FORMULA UtilityControlRoom-COL-Z2T4N04-LTLFireability-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA UtilityControlRoom-COL-Z2T4N04-LTLFireability-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA UtilityControlRoom-COL-Z2T4N04-LTLFireability-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA UtilityControlRoom-COL-Z2T4N04-LTLFireability-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 0 stabilizing places and 0 stable transitions
Remains 11 properties that can be checked using skeleton over-approximation.
Ensure Unique test removed 1 transitions
Reduce redundant transitions removed 1 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Reduction of identical properties reduced properties to check from 10 to 9
RANDOM walk for 281 steps (0 resets) in 22 ms. (12 steps per ms) remains 0/9 properties
[2024-05-30 07:49:47] [INFO ] Flatten gal took : 20 ms
[2024-05-30 07:49:47] [INFO ] Flatten gal took : 5 ms
Transition timeout forces synchronizations/join behavior on parameter c of sort Cli
Domain [Cli(4), Z(2), Z(2)] of place MovetoZ breaks symmetries in sort Z
[2024-05-30 07:49:47] [INFO ] Unfolded HLPN to a Petri net with 72 places and 108 transitions 340 arcs in 24 ms.
[2024-05-30 07:49:47] [INFO ] Unfolded 12 HLPN properties in 0 ms.
[2024-05-30 07:49:47] [INFO ] Reduced 4 identical enabling conditions.
[2024-05-30 07:49:47] [INFO ] Reduced 4 identical enabling conditions.
[2024-05-30 07:49:47] [INFO ] Reduced 4 identical enabling conditions.
Ensure Unique test removed 16 transitions
Reduce redundant transitions removed 16 transitions.
Support contains 63 out of 72 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 72/72 places, 92/92 transitions.
Applied a total of 0 rules in 9 ms. Remains 72 /72 variables (removed 0) and now considering 92/92 (removed 0) transitions.
// Phase 1: matrix 92 rows 72 cols
[2024-05-30 07:49:47] [INFO ] Computed 11 invariants in 18 ms
[2024-05-30 07:49:47] [INFO ] Implicit Places using invariants in 231 ms returned [51]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 277 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 71/72 places, 92/92 transitions.
Applied a total of 0 rules in 6 ms. Remains 71 /71 variables (removed 0) and now considering 92/92 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 319 ms. Remains : 71/72 places, 92/92 transitions.
Support contains 63 out of 71 places after structural reductions.
[2024-05-30 07:49:48] [INFO ] Flatten gal took : 18 ms
[2024-05-30 07:49:48] [INFO ] Flatten gal took : 20 ms
[2024-05-30 07:49:48] [INFO ] Input system was already deterministic with 92 transitions.
Reduction of identical properties reduced properties to check from 17 to 12
RANDOM walk for 761 steps (0 resets) in 54 ms. (13 steps per ms) remains 0/12 properties
FORMULA UtilityControlRoom-COL-Z2T4N04-LTLFireability-10 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
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 71 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 71/71 places, 92/92 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 63 transition count 84
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 63 transition count 84
Applied a total of 16 rules in 13 ms. Remains 63 /71 variables (removed 8) and now considering 84/92 (removed 8) transitions.
// Phase 1: matrix 84 rows 63 cols
[2024-05-30 07:49:48] [INFO ] Computed 10 invariants in 3 ms
[2024-05-30 07:49:48] [INFO ] Implicit Places using invariants in 79 ms returned []
[2024-05-30 07:49:48] [INFO ] Invariant cache hit.
[2024-05-30 07:49:48] [INFO ] Implicit Places using invariants and state equation in 107 ms returned []
Implicit Place search using SMT with State Equation took 188 ms to find 0 implicit places.
Running 80 sub problems to find dead transitions.
[2024-05-30 07:49:48] [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 2496 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 1773 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 4394ms problems are : Problem set: 0 solved, 80 unsolved
Search for dead transitions found 0 dead transitions in 4409ms
Starting structural reductions in LTL mode, iteration 1 : 63/71 places, 84/92 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4613 ms. Remains : 63/71 places, 84/92 transitions.
Stuttering acceptance computed with spot in 464 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-COL-Z2T4N04-LTLFireability-00
Product exploration explored 100000 steps with 22579 reset in 556 ms.
Product exploration explored 100000 steps with 22636 reset in 357 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p2) (NOT p1) (NOT p0)), (X (NOT (AND (NOT p1) p0))), (X (AND (NOT p1) (NOT p0))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT p1)))]
False Knowledge obtained : [(X (X (AND (NOT p1) p0))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X p0)), (X (X (NOT p0)))]
Knowledge based reduction with 6 factoid took 245 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 136 ms :[(NOT p2), (NOT p2), (NOT p2), (NOT p2)]
RANDOM walk for 4 steps (0 resets) in 6 ms. (0 steps per ms) remains 0/1 properties
Knowledge obtained : [(AND (NOT p2) (NOT p1) (NOT p0)), (X (NOT (AND (NOT p1) p0))), (X (AND (NOT p1) (NOT p0))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT p1)))]
False Knowledge obtained : [(X (X (AND (NOT p1) p0))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X p0)), (X (X (NOT p0))), (F p2)]
Knowledge based reduction with 6 factoid took 264 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 134 ms :[(NOT p2), (NOT p2), (NOT p2), (NOT p2)]
Stuttering acceptance computed with spot in 136 ms :[(NOT p2), (NOT p2), (NOT p2), (NOT p2)]
[2024-05-30 07:49:55] [INFO ] Invariant cache hit.
[2024-05-30 07:49:55] [INFO ] [Real]Absence check using 10 positive place invariants in 6 ms returned sat
[2024-05-30 07:49:55] [INFO ] [Real]Absence check using state equation in 51 ms returned sat
[2024-05-30 07:49:55] [INFO ] Computed and/alt/rep : 80/124/80 causal constraints (skipped 0 transitions) in 21 ms.
[2024-05-30 07:49:55] [INFO ] Added : 0 causal constraints over 0 iterations in 50 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 3 ms. Remains 63 /63 variables (removed 0) and now considering 84/84 (removed 0) transitions.
[2024-05-30 07:49:55] [INFO ] Invariant cache hit.
[2024-05-30 07:49:55] [INFO ] Implicit Places using invariants in 52 ms returned []
[2024-05-30 07:49:55] [INFO ] Invariant cache hit.
[2024-05-30 07:49:55] [INFO ] Implicit Places using invariants and state equation in 93 ms returned []
Implicit Place search using SMT with State Equation took 151 ms to find 0 implicit places.
Running 80 sub problems to find dead transitions.
[2024-05-30 07:49:55] [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 1716 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 1865 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 3649ms problems are : Problem set: 0 solved, 80 unsolved
Search for dead transitions found 0 dead transitions in 3653ms
Finished structural reductions in LTL mode , in 1 iterations and 3808 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 69 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 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 : [(NOT p2)]
False Knowledge obtained : [(F p2)]
Knowledge based reduction with 1 factoid took 93 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 132 ms :[(NOT p2), (NOT p2), (NOT p2), (NOT p2)]
Stuttering acceptance computed with spot in 153 ms :[(NOT p2), (NOT p2), (NOT p2), (NOT p2)]
[2024-05-30 07:50:00] [INFO ] Invariant cache hit.
[2024-05-30 07:50:00] [INFO ] [Real]Absence check using 10 positive place invariants in 5 ms returned sat
[2024-05-30 07:50:00] [INFO ] [Real]Absence check using state equation in 38 ms returned sat
[2024-05-30 07:50:00] [INFO ] Computed and/alt/rep : 80/124/80 causal constraints (skipped 0 transitions) in 7 ms.
[2024-05-30 07:50:00] [INFO ] Added : 0 causal constraints over 0 iterations in 19 ms. Result :sat
Could not prove EG (NOT p2)
Stuttering acceptance computed with spot in 158 ms :[(NOT p2), (NOT p2), (NOT p2), (NOT p2)]
Product exploration explored 100000 steps with 22679 reset in 102 ms.
Product exploration explored 100000 steps with 22698 reset in 291 ms.
Applying partial POR strategy [true, false, false, false]
Stuttering acceptance computed with spot in 153 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 0 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 1 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 07:50:01] [INFO ] Redundant transitions in 0 ms returned []
Running 40 sub problems to find dead transitions.
// Phase 1: matrix 44 rows 42 cols
[2024-05-30 07:50:01] [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 07:50:01] [INFO ] Deduced a trap composed of 5 places in 34 ms of which 9 ms to minimize.
[2024-05-30 07:50:01] [INFO ] Deduced a trap composed of 5 places in 40 ms of which 1 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 07:50:01] [INFO ] Deduced a trap composed of 4 places in 27 ms of which 1 ms to minimize.
Problem TDEAD4 is UNSAT
[2024-05-30 07:50:01] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 2 ms to minimize.
Problem TDEAD5 is UNSAT
[2024-05-30 07:50:02] [INFO ] Deduced a trap composed of 4 places in 17 ms of which 1 ms to minimize.
Problem TDEAD6 is UNSAT
[2024-05-30 07:50:02] [INFO ] Deduced a trap composed of 4 places in 18 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 755 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 330 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 1101ms problems are : Problem set: 20 solved, 20 unsolved
Search for dead transitions found 20 dead transitions in 1102ms
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 4 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 1145 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 2 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 07:50:02] [INFO ] Computed 10 invariants in 1 ms
[2024-05-30 07:50:02] [INFO ] Implicit Places using invariants in 69 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/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 74 ms. Remains : 62/63 places, 84/84 transitions.
Treatment of property UtilityControlRoom-COL-Z2T4N04-LTLFireability-00 finished in 14242 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(G((p1||X(!p2))))||(X((p1||X(!p2)))&&F(p3)))))'
Support contains 35 out of 71 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 71/71 places, 92/92 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 63 transition count 84
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 63 transition count 84
Applied a total of 16 rules in 3 ms. Remains 63 /71 variables (removed 8) and now considering 84/92 (removed 8) transitions.
[2024-05-30 07:50:02] [INFO ] Invariant cache hit.
[2024-05-30 07:50:02] [INFO ] Implicit Places using invariants in 37 ms returned []
[2024-05-30 07:50:02] [INFO ] Invariant cache hit.
[2024-05-30 07:50:02] [INFO ] Implicit Places using invariants and state equation in 72 ms returned []
Implicit Place search using SMT with State Equation took 111 ms to find 0 implicit places.
Running 80 sub problems to find dead transitions.
[2024-05-30 07:50:02] [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 1806 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 1603 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 3434ms problems are : Problem set: 0 solved, 80 unsolved
Search for dead transitions found 0 dead transitions in 3437ms
Starting structural reductions in LTL mode, iteration 1 : 63/71 places, 84/92 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3551 ms. Remains : 63/71 places, 84/92 transitions.
Stuttering acceptance computed with spot in 329 ms :[(OR (NOT p0) (AND (NOT p1) p2)), (NOT p0), (AND (NOT p1) p2), (AND (NOT p3) (NOT p1) p2), true, p2, (AND (NOT p3) p2), (NOT p3)]
Running random walk in product with property : UtilityControlRoom-COL-Z2T4N04-LTLFireability-01
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA UtilityControlRoom-COL-Z2T4N04-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property UtilityControlRoom-COL-Z2T4N04-LTLFireability-01 finished in 3908 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 71 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 71/71 places, 92/92 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 63 transition count 84
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 63 transition count 84
Applied a total of 16 rules in 4 ms. Remains 63 /71 variables (removed 8) and now considering 84/92 (removed 8) transitions.
[2024-05-30 07:50:06] [INFO ] Invariant cache hit.
[2024-05-30 07:50:06] [INFO ] Implicit Places using invariants in 74 ms returned [42]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 75 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 62/71 places, 84/92 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 81 ms. Remains : 62/71 places, 84/92 transitions.
Stuttering acceptance computed with spot in 189 ms :[(OR (NOT p0) p1), (OR (NOT p0) p1), (OR (NOT p0) p1), p1]
Running random walk in product with property : UtilityControlRoom-COL-Z2T4N04-LTLFireability-03
Product exploration explored 100000 steps with 0 reset in 188 ms.
Stack based approach found an accepted trace after 555 steps with 0 reset with depth 556 and stack size 556 in 3 ms.
FORMULA UtilityControlRoom-COL-Z2T4N04-LTLFireability-03 FALSE TECHNIQUES STACK_TEST
Treatment of property UtilityControlRoom-COL-Z2T4N04-LTLFireability-03 finished in 477 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 71 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 71/71 places, 92/92 transitions.
Performed 16 Post agglomeration using F-continuation condition.Transition count delta: 16
Iterating post reduction 0 with 16 rules applied. Total rules applied 16 place count 71 transition count 76
Reduce places removed 16 places and 0 transitions.
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 1 with 24 rules applied. Total rules applied 40 place count 55 transition count 68
Applied a total of 40 rules in 16 ms. Remains 55 /71 variables (removed 16) and now considering 68/92 (removed 24) transitions.
// Phase 1: matrix 68 rows 55 cols
[2024-05-30 07:50:07] [INFO ] Computed 10 invariants in 1 ms
[2024-05-30 07:50:07] [INFO ] Implicit Places using invariants in 39 ms returned []
[2024-05-30 07:50:07] [INFO ] Invariant cache hit.
[2024-05-30 07:50:07] [INFO ] Implicit Places using invariants and state equation in 71 ms returned []
Implicit Place search using SMT with State Equation took 115 ms to find 0 implicit places.
[2024-05-30 07:50:07] [INFO ] Redundant transitions in 1 ms returned []
Running 64 sub problems to find dead transitions.
[2024-05-30 07:50:07] [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 1481 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 1244 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 2749ms problems are : Problem set: 0 solved, 64 unsolved
Search for dead transitions found 0 dead transitions in 2751ms
Starting structural reductions in SI_LTL mode, iteration 1 : 55/71 places, 68/92 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2889 ms. Remains : 55/71 places, 68/92 transitions.
Stuttering acceptance computed with spot in 160 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-COL-Z2T4N04-LTLFireability-04
Product exploration explored 100000 steps with 23217 reset in 303 ms.
Product exploration explored 100000 steps with 23033 reset in 417 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 (NOT p2))), (X (AND (NOT p0) p1)), (X (NOT p0)), (X (AND (NOT p0) (NOT p2))), (X p1), (X (X (NOT p0)))]
False Knowledge obtained : [(X (X p2)), (X (X (NOT p2))), (X (X (AND (NOT p0) p1 (NOT p2)))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (AND (NOT p0) p1 p2))), (X (X (NOT (AND (NOT p0) p1 p2)))), (X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (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 167 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2) p1), false]
RANDOM walk for 126 steps (0 resets) in 10 ms. (11 steps per ms) remains 0/6 properties
Knowledge obtained : [(AND (NOT p0) (NOT p1) (NOT p2)), (X (NOT p2)), (X (AND (NOT p0) p1 (NOT p2))), (X (AND (NOT p0) p1)), (X (NOT p0)), (X (AND (NOT p0) (NOT p2))), (X p1), (X (X (NOT p0)))]
False Knowledge obtained : [(X (X p2)), (X (X (NOT p2))), (X (X (AND (NOT p0) p1 (NOT p2)))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (AND (NOT p0) p1 p2))), (X (X (NOT (AND (NOT p0) p1 p2)))), (X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X p1)), (X (X (NOT p1))), (F (NOT (AND (NOT p0) (NOT p2)))), (F p0), (F p1), (F p2), (F (NOT (OR p0 (NOT p2) (NOT p1)))), (F (NOT (OR p0 p2 (NOT p1))))]
Knowledge based reduction with 8 factoid took 600 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]
Stuttering acceptance computed with spot in 162 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2) p1), false]
[2024-05-30 07:50:12] [INFO ] Invariant cache hit.
[2024-05-30 07:50:12] [INFO ] [Real]Absence check using 10 positive place invariants in 7 ms returned sat
[2024-05-30 07:50:12] [INFO ] [Real]Absence check using state equation in 41 ms returned sat
[2024-05-30 07:50:12] [INFO ] Solution in real domain found non-integer solution.
[2024-05-30 07:50:12] [INFO ] [Nat]Absence check using 10 positive place invariants in 11 ms returned sat
[2024-05-30 07:50:12] [INFO ] [Nat]Absence check using state equation in 50 ms returned sat
[2024-05-30 07:50:12] [INFO ] Computed and/alt/rep : 64/100/64 causal constraints (skipped 0 transitions) in 8 ms.
[2024-05-30 07:50:13] [INFO ] Added : 36 causal constraints over 8 iterations in 95 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 07:50:13] [INFO ] Invariant cache hit.
[2024-05-30 07:50:13] [INFO ] Implicit Places using invariants in 45 ms returned []
[2024-05-30 07:50:13] [INFO ] Invariant cache hit.
[2024-05-30 07:50:13] [INFO ] Implicit Places using invariants and state equation in 79 ms returned []
Implicit Place search using SMT with State Equation took 126 ms to find 0 implicit places.
[2024-05-30 07:50:13] [INFO ] Redundant transitions in 1 ms returned []
Running 64 sub problems to find dead transitions.
[2024-05-30 07:50:13] [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 1171 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 1227 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 2414ms problems are : Problem set: 0 solved, 64 unsolved
Search for dead transitions found 0 dead transitions in 2415ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 2556 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) p1)), (X (NOT (AND (NOT p0) p2 p1))), (X (NOT p0)), (X (AND (NOT p0) (NOT p2))), (X p1), (X (X (NOT p0)))]
False Knowledge obtained : [(X (X p2)), (X (X (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 (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 8 factoid took 420 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 175 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2) p1), false]
RANDOM walk for 232 steps (0 resets) in 9 ms. (23 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) p1)), (X (NOT (AND (NOT p0) p2 p1))), (X (NOT p0)), (X (AND (NOT p0) (NOT p2))), (X p1), (X (X (NOT p0)))]
False Knowledge obtained : [(X (X p2)), (X (X (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 (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X p1)), (X (X (NOT p1))), (F (NOT (AND (NOT p0) (NOT p2)))), (F p0), (F p1), (F p2), (F (NOT (OR p0 (NOT p2) (NOT p1)))), (F (NOT (OR p0 p2 (NOT p1))))]
Knowledge based reduction with 8 factoid took 684 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 152 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2) p1), false]
Stuttering acceptance computed with spot in 156 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2) p1), false]
[2024-05-30 07:50:17] [INFO ] Invariant cache hit.
[2024-05-30 07:50:17] [INFO ] [Real]Absence check using 10 positive place invariants in 8 ms returned sat
[2024-05-30 07:50:17] [INFO ] [Real]Absence check using state equation in 46 ms returned sat
[2024-05-30 07:50:17] [INFO ] Solution in real domain found non-integer solution.
[2024-05-30 07:50:17] [INFO ] [Nat]Absence check using 10 positive place invariants in 7 ms returned sat
[2024-05-30 07:50:17] [INFO ] [Nat]Absence check using state equation in 46 ms returned sat
[2024-05-30 07:50:17] [INFO ] Computed and/alt/rep : 64/100/64 causal constraints (skipped 0 transitions) in 6 ms.
[2024-05-30 07:50:17] [INFO ] Added : 36 causal constraints over 8 iterations in 84 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p2))
Stuttering acceptance computed with spot in 186 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2) p1), false]
Product exploration explored 100000 steps with 22178 reset in 363 ms.
Product exploration explored 100000 steps with 22098 reset in 383 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 4 ms. Remains 55 /55 variables (removed 0) and now considering 68/68 (removed 0) transitions.
[2024-05-30 07:50:18] [INFO ] Invariant cache hit.
[2024-05-30 07:50:18] [INFO ] Implicit Places using invariants in 32 ms returned []
[2024-05-30 07:50:18] [INFO ] Invariant cache hit.
[2024-05-30 07:50:18] [INFO ] Implicit Places using invariants and state equation in 57 ms returned []
Implicit Place search using SMT with State Equation took 91 ms to find 0 implicit places.
[2024-05-30 07:50:18] [INFO ] Redundant transitions in 1 ms returned []
Running 64 sub problems to find dead transitions.
[2024-05-30 07:50:18] [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 1282 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 1113 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 2417ms problems are : Problem set: 0 solved, 64 unsolved
Search for dead transitions found 0 dead transitions in 2418ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 2519 ms. Remains : 55/55 places, 68/68 transitions.
Treatment of property UtilityControlRoom-COL-Z2T4N04-LTLFireability-04 finished in 13970 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 71 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 71/71 places, 92/92 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 16 transitions
Trivial Post-agglo rules discarded 16 transitions
Performed 16 trivial Post agglomeration. Transition count delta: 16
Iterating post reduction 0 with 16 rules applied. Total rules applied 16 place count 71 transition count 76
Reduce places removed 16 places and 0 transitions.
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 1 with 24 rules applied. Total rules applied 40 place count 55 transition count 68
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 41 place count 54 transition count 60
Iterating global reduction 2 with 1 rules applied. Total rules applied 42 place count 54 transition count 60
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 46 place count 50 transition count 56
Iterating global reduction 2 with 4 rules applied. Total rules applied 50 place count 50 transition count 56
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: 12
Deduced a syphon composed of 12 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 2 with 25 rules applied. Total rules applied 75 place count 37 transition count 44
Applied a total of 75 rules in 16 ms. Remains 37 /71 variables (removed 34) and now considering 44/92 (removed 48) transitions.
// Phase 1: matrix 44 rows 37 cols
[2024-05-30 07:50:21] [INFO ] Computed 9 invariants in 1 ms
[2024-05-30 07:50:21] [INFO ] Implicit Places using invariants in 94 ms returned []
[2024-05-30 07:50:21] [INFO ] Invariant cache hit.
[2024-05-30 07:50:21] [INFO ] Implicit Places using invariants and state equation in 127 ms returned []
Implicit Place search using SMT with State Equation took 228 ms to find 0 implicit places.
[2024-05-30 07:50:21] [INFO ] Redundant transitions in 0 ms returned []
Running 36 sub problems to find dead transitions.
[2024-05-30 07:50:21] [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 773 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 482 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 1264ms problems are : Problem set: 0 solved, 36 unsolved
Search for dead transitions found 0 dead transitions in 1265ms
Starting structural reductions in SI_LTL mode, iteration 1 : 37/71 places, 44/92 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1514 ms. Remains : 37/71 places, 44/92 transitions.
Stuttering acceptance computed with spot in 74 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : UtilityControlRoom-COL-Z2T4N04-LTLFireability-05
Product exploration explored 100000 steps with 9142 reset in 145 ms.
Stack based approach found an accepted trace after 2460 steps with 224 reset with depth 14 and stack size 14 in 4 ms.
FORMULA UtilityControlRoom-COL-Z2T4N04-LTLFireability-05 FALSE TECHNIQUES STACK_TEST
Treatment of property UtilityControlRoom-COL-Z2T4N04-LTLFireability-05 finished in 1770 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))||p0)))'
Support contains 11 out of 71 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 71/71 places, 92/92 transitions.
Performed 16 Post agglomeration using F-continuation condition.Transition count delta: 16
Iterating post reduction 0 with 16 rules applied. Total rules applied 16 place count 71 transition count 76
Reduce places removed 16 places and 0 transitions.
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 1 with 24 rules applied. Total rules applied 40 place count 55 transition count 68
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 8 Pre rules applied. Total rules applied 40 place count 55 transition count 60
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 56 place count 47 transition count 60
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 64 place count 43 transition count 56
Applied a total of 64 rules in 8 ms. Remains 43 /71 variables (removed 28) and now considering 56/92 (removed 36) transitions.
// Phase 1: matrix 56 rows 43 cols
[2024-05-30 07:50:22] [INFO ] Computed 10 invariants in 1 ms
[2024-05-30 07:50:22] [INFO ] Implicit Places using invariants in 53 ms returned []
[2024-05-30 07:50:22] [INFO ] Invariant cache hit.
[2024-05-30 07:50:23] [INFO ] Implicit Places using invariants and state equation in 107 ms returned []
Implicit Place search using SMT with State Equation took 162 ms to find 0 implicit places.
[2024-05-30 07:50:23] [INFO ] Redundant transitions in 1 ms returned []
Running 44 sub problems to find dead transitions.
[2024-05-30 07:50:23] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/39 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/39 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 2 (OVERLAPS) 4/43 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/43 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 4 (OVERLAPS) 56/99 variables, 43/53 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/99 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 6 (OVERLAPS) 0/99 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 44 unsolved
No progress, stopping.
After SMT solving in domain Real declared 99/99 variables, and 53 constraints, problems are : Problem set: 0 solved, 44 unsolved in 642 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 43/43 constraints, PredecessorRefiner: 44/44 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 44 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/39 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/39 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 2 (OVERLAPS) 4/43 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/43 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 4 (OVERLAPS) 56/99 variables, 43/53 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/99 variables, 44/97 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/99 variables, 0/97 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 7 (OVERLAPS) 0/99 variables, 0/97 constraints. Problems are: Problem set: 0 solved, 44 unsolved
No progress, stopping.
After SMT solving in domain Int declared 99/99 variables, and 97 constraints, problems are : Problem set: 0 solved, 44 unsolved in 773 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 43/43 constraints, PredecessorRefiner: 44/44 constraints, Known Traps: 0/0 constraints]
After SMT, in 1431ms problems are : Problem set: 0 solved, 44 unsolved
Search for dead transitions found 0 dead transitions in 1432ms
Starting structural reductions in SI_LTL mode, iteration 1 : 43/71 places, 56/92 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1610 ms. Remains : 43/71 places, 56/92 transitions.
Stuttering acceptance computed with spot in 83 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1)]
Running random walk in product with property : UtilityControlRoom-COL-Z2T4N04-LTLFireability-08
Product exploration explored 100000 steps with 40982 reset in 381 ms.
Product exploration explored 100000 steps with 40889 reset in 391 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)), (X (NOT (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1))))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X p1), (X (NOT p1)), (X (X (NOT p0))), (X (X p0)), (X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 3 factoid took 272 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 73 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1)]
Reduction of identical properties reduced properties to check from 3 to 2
RANDOM walk for 40000 steps (8 resets) in 410 ms. (97 steps per ms) remains 1/2 properties
BEST_FIRST walk for 40003 steps (8 resets) in 527 ms. (75 steps per ms) remains 1/1 properties
[2024-05-30 07:50:25] [INFO ] Invariant cache hit.
Problem apf0 is UNSAT
After SMT solving in domain Real declared 11/99 variables, and 0 constraints, problems are : Problem set: 1 solved, 0 unsolved in 16 ms.
Refiners :[Positive P Invariants (semi-flows): 0/10 constraints, State Equation: 0/43 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 24ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1)))), (G (OR p0 (NOT p1)))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X p1), (X (NOT p1)), (X (X (NOT p0))), (X (X p0)), (X (X p1)), (X (X (NOT p1))), (F p1), (F p0)]
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 4 factoid took 15 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA UtilityControlRoom-COL-Z2T4N04-LTLFireability-08 TRUE TECHNIQUES KNOWLEDGE
Treatment of property UtilityControlRoom-COL-Z2T4N04-LTLFireability-08 finished in 3140 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((X((p0&&(G(p2)||p1))) U !p3)))))'
Support contains 27 out of 71 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 71/71 places, 92/92 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 63 transition count 84
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 63 transition count 84
Applied a total of 16 rules in 2 ms. Remains 63 /71 variables (removed 8) and now considering 84/92 (removed 8) transitions.
// Phase 1: matrix 84 rows 63 cols
[2024-05-30 07:50:26] [INFO ] Computed 10 invariants in 1 ms
[2024-05-30 07:50:26] [INFO ] Implicit Places using invariants in 55 ms returned []
[2024-05-30 07:50:26] [INFO ] Invariant cache hit.
[2024-05-30 07:50:26] [INFO ] Implicit Places using invariants and state equation in 73 ms returned []
Implicit Place search using SMT with State Equation took 130 ms to find 0 implicit places.
Running 80 sub problems to find dead transitions.
[2024-05-30 07:50:26] [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 1491 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 1757 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 3271ms problems are : Problem set: 0 solved, 80 unsolved
Search for dead transitions found 0 dead transitions in 3272ms
Starting structural reductions in LTL mode, iteration 1 : 63/71 places, 84/92 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3405 ms. Remains : 63/71 places, 84/92 transitions.
Stuttering acceptance computed with spot in 312 ms :[p3, p3, p3, p3, (OR (NOT p0) p3 (AND (NOT p1) (NOT p2))), true, (NOT p2)]
Running random walk in product with property : UtilityControlRoom-COL-Z2T4N04-LTLFireability-09
Entered a terminal (fully accepting) state of product in 20 steps with 4 reset in 0 ms.
FORMULA UtilityControlRoom-COL-Z2T4N04-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property UtilityControlRoom-COL-Z2T4N04-LTLFireability-09 finished in 3737 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((G(p2)||p1)))||p0)))'
Support contains 32 out of 71 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 71/71 places, 92/92 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 0 with 8 rules applied. Total rules applied 8 place count 67 transition count 88
Applied a total of 8 rules in 6 ms. Remains 67 /71 variables (removed 4) and now considering 88/92 (removed 4) transitions.
// Phase 1: matrix 88 rows 67 cols
[2024-05-30 07:50:29] [INFO ] Computed 10 invariants in 2 ms
[2024-05-30 07:50:29] [INFO ] Implicit Places using invariants in 86 ms returned [46]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 87 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 66/71 places, 88/92 transitions.
Applied a total of 0 rules in 3 ms. Remains 66 /66 variables (removed 0) and now considering 88/88 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 96 ms. Remains : 66/71 places, 88/92 transitions.
Stuttering acceptance computed with spot in 85 ms :[(AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1))]
Running random walk in product with property : UtilityControlRoom-COL-Z2T4N04-LTLFireability-11
Product exploration explored 100000 steps with 8621 reset in 312 ms.
Product exploration explored 100000 steps with 8630 reset in 322 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 p2) (NOT p1)), (X (AND (NOT p2) (NOT p1) (NOT p0))), (X (NOT p2)), (X (NOT p0)), (X (NOT (AND p2 (NOT p1) (NOT p0)))), (X (NOT p1)), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : [(X (X (AND (NOT p2) (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p2) (NOT p1) (NOT p0))))), (X (X p2)), (X (X (NOT p2))), (X (X (AND p2 (NOT p1) (NOT p0)))), (X (X (NOT (AND p2 (NOT p1) (NOT p0)))))]
Knowledge based reduction with 8 factoid took 292 ms. Reduced automaton from 2 states, 4 edges and 3 AP (stutter insensitive) to 2 states, 4 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 91 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2))]
RANDOM walk for 59 steps (0 resets) in 7 ms. (7 steps per ms) remains 0/5 properties
Knowledge obtained : [(AND (NOT p0) (NOT p2) (NOT p1)), (X (AND (NOT p2) (NOT p1) (NOT p0))), (X (NOT p2)), (X (NOT p0)), (X (NOT (AND p2 (NOT p1) (NOT p0)))), (X (NOT p1)), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : [(X (X (AND (NOT p2) (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p2) (NOT p1) (NOT p0))))), (X (X p2)), (X (X (NOT p2))), (X (X (AND p2 (NOT p1) (NOT p0)))), (X (X (NOT (AND p2 (NOT p1) (NOT p0))))), (F p1), (F p0), (F p2), (F (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (F (NOT (OR p0 p1 (NOT p2))))]
Knowledge based reduction with 8 factoid took 513 ms. Reduced automaton from 2 states, 4 edges and 3 AP (stutter insensitive) to 2 states, 4 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 90 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 76 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2))]
// Phase 1: matrix 88 rows 66 cols
[2024-05-30 07:50:31] [INFO ] Computed 9 invariants in 2 ms
[2024-05-30 07:50:31] [INFO ] [Real]Absence check using 9 positive place invariants in 7 ms returned sat
[2024-05-30 07:50:31] [INFO ] [Real]Absence check using state equation in 60 ms returned sat
[2024-05-30 07:50:31] [INFO ] Solution in real domain found non-integer solution.
[2024-05-30 07:50:32] [INFO ] [Nat]Absence check using 9 positive place invariants in 6 ms returned sat
[2024-05-30 07:50:32] [INFO ] [Nat]Absence check using state equation in 56 ms returned sat
[2024-05-30 07:50:32] [INFO ] Computed and/alt/rep : 80/136/80 causal constraints (skipped 0 transitions) in 9 ms.
[2024-05-30 07:50:32] [INFO ] Added : 80 causal constraints over 16 iterations in 216 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p1) (NOT p2))
Support contains 32 out of 66 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 66/66 places, 88/88 transitions.
Applied a total of 0 rules in 3 ms. Remains 66 /66 variables (removed 0) and now considering 88/88 (removed 0) transitions.
[2024-05-30 07:50:32] [INFO ] Invariant cache hit.
[2024-05-30 07:50:32] [INFO ] Implicit Places using invariants in 40 ms returned []
[2024-05-30 07:50:32] [INFO ] Invariant cache hit.
[2024-05-30 07:50:32] [INFO ] Implicit Places using invariants and state equation in 75 ms returned []
Implicit Place search using SMT with State Equation took 118 ms to find 0 implicit places.
[2024-05-30 07:50:32] [INFO ] Redundant transitions in 1 ms returned []
Running 80 sub problems to find dead transitions.
[2024-05-30 07:50:32] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/62 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/62 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 2 (OVERLAPS) 4/66 variables, 8/9 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/66 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 4 (OVERLAPS) 88/154 variables, 66/75 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/154 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 6 (OVERLAPS) 0/154 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 80 unsolved
No progress, stopping.
After SMT solving in domain Real declared 154/154 variables, and 75 constraints, problems are : Problem set: 0 solved, 80 unsolved in 1769 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 66/66 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/62 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/62 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 2 (OVERLAPS) 4/66 variables, 8/9 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/66 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 4 (OVERLAPS) 88/154 variables, 66/75 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/154 variables, 80/155 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/154 variables, 0/155 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 7 (OVERLAPS) 0/154 variables, 0/155 constraints. Problems are: Problem set: 0 solved, 80 unsolved
No progress, stopping.
After SMT solving in domain Int declared 154/154 variables, and 155 constraints, problems are : Problem set: 0 solved, 80 unsolved in 2224 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 66/66 constraints, PredecessorRefiner: 80/80 constraints, Known Traps: 0/0 constraints]
After SMT, in 4014ms problems are : Problem set: 0 solved, 80 unsolved
Search for dead transitions found 0 dead transitions in 4016ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 4146 ms. Remains : 66/66 places, 88/88 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 p1) (NOT p2)), (X (NOT p2)), (X (NOT (AND (NOT p0) (NOT p1) p2))), (X (AND (NOT p0) (NOT p1) (NOT p2))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : [(X (X p2)), (X (X (NOT p2))), (X (X (AND (NOT p0) (NOT p1) p2))), (X (X (NOT (AND (NOT p0) (NOT p1) p2)))), (X (X (AND (NOT p0) (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))))]
Knowledge based reduction with 8 factoid took 300 ms. Reduced automaton from 2 states, 4 edges and 3 AP (stutter insensitive) to 2 states, 4 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 85 ms :[(AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1))]
RANDOM walk for 45 steps (0 resets) in 7 ms. (5 steps per ms) remains 0/5 properties
Knowledge obtained : [(AND (NOT p0) (NOT p1) (NOT p2)), (X (NOT p2)), (X (NOT (AND (NOT p0) (NOT p1) p2))), (X (AND (NOT p0) (NOT p1) (NOT p2))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : [(X (X p2)), (X (X (NOT p2))), (X (X (AND (NOT p0) (NOT p1) p2))), (X (X (NOT (AND (NOT p0) (NOT p1) p2)))), (X (X (AND (NOT p0) (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (F p1), (F p0), (F p2), (F (NOT (AND (NOT p0) (NOT p2) (NOT p1)))), (F (NOT (OR p0 (NOT p2) p1)))]
Knowledge based reduction with 8 factoid took 463 ms. Reduced automaton from 2 states, 4 edges and 3 AP (stutter insensitive) to 2 states, 4 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 83 ms :[(AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1))]
Stuttering acceptance computed with spot in 71 ms :[(AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1))]
[2024-05-30 07:50:37] [INFO ] Invariant cache hit.
[2024-05-30 07:50:37] [INFO ] [Real]Absence check using 9 positive place invariants in 6 ms returned sat
[2024-05-30 07:50:37] [INFO ] [Real]Absence check using state equation in 53 ms returned sat
[2024-05-30 07:50:37] [INFO ] Solution in real domain found non-integer solution.
[2024-05-30 07:50:37] [INFO ] [Nat]Absence check using 9 positive place invariants in 3 ms returned sat
[2024-05-30 07:50:37] [INFO ] [Nat]Absence check using state equation in 36 ms returned sat
[2024-05-30 07:50:37] [INFO ] Computed and/alt/rep : 80/136/80 causal constraints (skipped 0 transitions) in 6 ms.
[2024-05-30 07:50:38] [INFO ] Added : 80 causal constraints over 16 iterations in 214 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p2) (NOT p1))
Stuttering acceptance computed with spot in 107 ms :[(AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1))]
Product exploration explored 100000 steps with 8639 reset in 439 ms.
Product exploration explored 100000 steps with 8652 reset in 352 ms.
Support contains 32 out of 66 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 66/66 places, 88/88 transitions.
Applied a total of 0 rules in 3 ms. Remains 66 /66 variables (removed 0) and now considering 88/88 (removed 0) transitions.
[2024-05-30 07:50:38] [INFO ] Invariant cache hit.
[2024-05-30 07:50:39] [INFO ] Implicit Places using invariants in 55 ms returned []
[2024-05-30 07:50:39] [INFO ] Invariant cache hit.
[2024-05-30 07:50:39] [INFO ] Implicit Places using invariants and state equation in 65 ms returned []
Implicit Place search using SMT with State Equation took 123 ms to find 0 implicit places.
[2024-05-30 07:50:39] [INFO ] Redundant transitions in 1 ms returned []
Running 80 sub problems to find dead transitions.
[2024-05-30 07:50:39] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/62 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/62 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 2 (OVERLAPS) 4/66 variables, 8/9 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/66 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 4 (OVERLAPS) 88/154 variables, 66/75 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/154 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 6 (OVERLAPS) 0/154 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 80 unsolved
No progress, stopping.
After SMT solving in domain Real declared 154/154 variables, and 75 constraints, problems are : Problem set: 0 solved, 80 unsolved in 1494 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 66/66 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/62 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/62 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 2 (OVERLAPS) 4/66 variables, 8/9 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/66 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 4 (OVERLAPS) 88/154 variables, 66/75 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/154 variables, 80/155 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/154 variables, 0/155 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 7 (OVERLAPS) 0/154 variables, 0/155 constraints. Problems are: Problem set: 0 solved, 80 unsolved
No progress, stopping.
After SMT solving in domain Int declared 154/154 variables, and 155 constraints, problems are : Problem set: 0 solved, 80 unsolved in 1574 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 66/66 constraints, PredecessorRefiner: 80/80 constraints, Known Traps: 0/0 constraints]
After SMT, in 3088ms problems are : Problem set: 0 solved, 80 unsolved
Search for dead transitions found 0 dead transitions in 3090ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 3223 ms. Remains : 66/66 places, 88/88 transitions.
Treatment of property UtilityControlRoom-COL-Z2T4N04-LTLFireability-11 finished in 12465 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(p0)))'
Support contains 11 out of 71 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 71/71 places, 92/92 transitions.
Performed 16 Post agglomeration using F-continuation condition.Transition count delta: 16
Iterating post reduction 0 with 16 rules applied. Total rules applied 16 place count 71 transition count 76
Reduce places removed 16 places and 0 transitions.
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 1 with 24 rules applied. Total rules applied 40 place count 55 transition count 68
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 8 Pre rules applied. Total rules applied 40 place count 55 transition count 60
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 56 place count 47 transition count 60
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 64 place count 43 transition count 56
Applied a total of 64 rules in 6 ms. Remains 43 /71 variables (removed 28) and now considering 56/92 (removed 36) transitions.
// Phase 1: matrix 56 rows 43 cols
[2024-05-30 07:50:42] [INFO ] Computed 10 invariants in 1 ms
[2024-05-30 07:50:42] [INFO ] Implicit Places using invariants in 46 ms returned []
[2024-05-30 07:50:42] [INFO ] Invariant cache hit.
[2024-05-30 07:50:42] [INFO ] Implicit Places using invariants and state equation in 64 ms returned []
Implicit Place search using SMT with State Equation took 113 ms to find 0 implicit places.
[2024-05-30 07:50:42] [INFO ] Redundant transitions in 2 ms returned []
Running 44 sub problems to find dead transitions.
[2024-05-30 07:50:42] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/39 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/39 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 2 (OVERLAPS) 4/43 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/43 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 4 (OVERLAPS) 56/99 variables, 43/53 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/99 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 6 (OVERLAPS) 0/99 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 44 unsolved
No progress, stopping.
After SMT solving in domain Real declared 99/99 variables, and 53 constraints, problems are : Problem set: 0 solved, 44 unsolved in 837 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 43/43 constraints, PredecessorRefiner: 44/44 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 44 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/39 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/39 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 2 (OVERLAPS) 4/43 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/43 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 4 (OVERLAPS) 56/99 variables, 43/53 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/99 variables, 44/97 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/99 variables, 0/97 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 7 (OVERLAPS) 0/99 variables, 0/97 constraints. Problems are: Problem set: 0 solved, 44 unsolved
No progress, stopping.
After SMT solving in domain Int declared 99/99 variables, and 97 constraints, problems are : Problem set: 0 solved, 44 unsolved in 1042 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 43/43 constraints, PredecessorRefiner: 44/44 constraints, Known Traps: 0/0 constraints]
After SMT, in 1899ms problems are : Problem set: 0 solved, 44 unsolved
Search for dead transitions found 0 dead transitions in 1900ms
Starting structural reductions in SI_LTL mode, iteration 1 : 43/71 places, 56/92 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2026 ms. Remains : 43/71 places, 56/92 transitions.
Stuttering acceptance computed with spot in 40 ms :[(NOT p0)]
Running random walk in product with property : UtilityControlRoom-COL-Z2T4N04-LTLFireability-12
Product exploration explored 100000 steps with 0 reset in 251 ms.
Stack based approach found an accepted trace after 76 steps with 0 reset with depth 77 and stack size 77 in 0 ms.
FORMULA UtilityControlRoom-COL-Z2T4N04-LTLFireability-12 FALSE TECHNIQUES STACK_TEST
Treatment of property UtilityControlRoom-COL-Z2T4N04-LTLFireability-12 finished in 2331 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 4 out of 71 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 71/71 places, 92/92 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 63 transition count 84
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 63 transition count 84
Applied a total of 16 rules in 3 ms. Remains 63 /71 variables (removed 8) and now considering 84/92 (removed 8) transitions.
// Phase 1: matrix 84 rows 63 cols
[2024-05-30 07:50:44] [INFO ] Computed 10 invariants in 5 ms
[2024-05-30 07:50:44] [INFO ] Implicit Places using invariants in 73 ms returned [42]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 76 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 62/71 places, 84/92 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 82 ms. Remains : 62/71 places, 84/92 transitions.
Stuttering acceptance computed with spot in 67 ms :[p0, p0]
Running random walk in product with property : UtilityControlRoom-COL-Z2T4N04-LTLFireability-14
Product exploration explored 100000 steps with 50000 reset in 308 ms.
Product exploration explored 100000 steps with 50000 reset in 149 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), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 3 factoid took 13 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA UtilityControlRoom-COL-Z2T4N04-LTLFireability-14 TRUE TECHNIQUES KNOWLEDGE
Treatment of property UtilityControlRoom-COL-Z2T4N04-LTLFireability-14 finished in 632 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(p0) U p1))'
Support contains 27 out of 71 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 71/71 places, 92/92 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 71 transition count 84
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 0 with 16 rules applied. Total rules applied 16 place count 63 transition count 84
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 0 with 8 rules applied. Total rules applied 24 place count 59 transition count 80
Applied a total of 24 rules in 5 ms. Remains 59 /71 variables (removed 12) and now considering 80/92 (removed 12) transitions.
// Phase 1: matrix 80 rows 59 cols
[2024-05-30 07:50:45] [INFO ] Computed 10 invariants in 1 ms
[2024-05-30 07:50:45] [INFO ] Implicit Places using invariants in 55 ms returned []
[2024-05-30 07:50:45] [INFO ] Invariant cache hit.
[2024-05-30 07:50:45] [INFO ] Implicit Places using invariants and state equation in 90 ms returned []
Implicit Place search using SMT with State Equation took 148 ms to find 0 implicit places.
[2024-05-30 07:50:45] [INFO ] Redundant transitions in 2 ms returned []
Running 68 sub problems to find dead transitions.
[2024-05-30 07:50:45] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/55 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 68 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/55 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 68 unsolved
At refinement iteration 2 (OVERLAPS) 4/59 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 68 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/59 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 68 unsolved
At refinement iteration 4 (OVERLAPS) 80/139 variables, 59/69 constraints. Problems are: Problem set: 0 solved, 68 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/139 variables, 0/69 constraints. Problems are: Problem set: 0 solved, 68 unsolved
At refinement iteration 6 (OVERLAPS) 0/139 variables, 0/69 constraints. Problems are: Problem set: 0 solved, 68 unsolved
No progress, stopping.
After SMT solving in domain Real declared 139/139 variables, and 69 constraints, problems are : Problem set: 0 solved, 68 unsolved in 1234 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 59/59 constraints, PredecessorRefiner: 68/68 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 68 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/55 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 68 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/55 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 68 unsolved
At refinement iteration 2 (OVERLAPS) 4/59 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 68 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/59 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 68 unsolved
At refinement iteration 4 (OVERLAPS) 80/139 variables, 59/69 constraints. Problems are: Problem set: 0 solved, 68 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/139 variables, 68/137 constraints. Problems are: Problem set: 0 solved, 68 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/139 variables, 0/137 constraints. Problems are: Problem set: 0 solved, 68 unsolved
At refinement iteration 7 (OVERLAPS) 0/139 variables, 0/137 constraints. Problems are: Problem set: 0 solved, 68 unsolved
No progress, stopping.
After SMT solving in domain Int declared 139/139 variables, and 137 constraints, problems are : Problem set: 0 solved, 68 unsolved in 1321 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 59/59 constraints, PredecessorRefiner: 68/68 constraints, Known Traps: 0/0 constraints]
After SMT, in 2575ms problems are : Problem set: 0 solved, 68 unsolved
Search for dead transitions found 0 dead transitions in 2576ms
Starting structural reductions in SI_LTL mode, iteration 1 : 59/71 places, 80/92 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2738 ms. Remains : 59/71 places, 80/92 transitions.
Stuttering acceptance computed with spot in 86 ms :[(NOT p1), (NOT p0)]
Running random walk in product with property : UtilityControlRoom-COL-Z2T4N04-LTLFireability-15
Product exploration explored 100000 steps with 24710 reset in 297 ms.
Stack based approach found an accepted trace after 9201 steps with 2316 reset with depth 7 and stack size 7 in 28 ms.
FORMULA UtilityControlRoom-COL-Z2T4N04-LTLFireability-15 FALSE TECHNIQUES STACK_TEST
Treatment of property UtilityControlRoom-COL-Z2T4N04-LTLFireability-15 finished in 3163 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-COL-Z2T4N04-LTLFireability-00
Stuttering acceptance computed with spot in 263 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 71 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 71/71 places, 92/92 transitions.
Performed 16 Post agglomeration using F-continuation condition.Transition count delta: 16
Iterating post reduction 0 with 16 rules applied. Total rules applied 16 place count 71 transition count 76
Reduce places removed 16 places and 0 transitions.
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 1 with 24 rules applied. Total rules applied 40 place count 55 transition count 68
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 8 Pre rules applied. Total rules applied 40 place count 55 transition count 60
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 56 place count 47 transition count 60
Applied a total of 56 rules in 6 ms. Remains 47 /71 variables (removed 24) and now considering 60/92 (removed 32) transitions.
// Phase 1: matrix 60 rows 47 cols
[2024-05-30 07:50:48] [INFO ] Computed 10 invariants in 0 ms
[2024-05-30 07:50:48] [INFO ] Implicit Places using invariants in 37 ms returned []
[2024-05-30 07:50:48] [INFO ] Invariant cache hit.
[2024-05-30 07:50:48] [INFO ] Implicit Places using invariants and state equation in 55 ms returned []
Implicit Place search using SMT with State Equation took 93 ms to find 0 implicit places.
Running 56 sub problems to find dead transitions.
[2024-05-30 07:50:48] [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 996 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 958 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 1969ms problems are : Problem set: 0 solved, 56 unsolved
Search for dead transitions found 0 dead transitions in 1970ms
Starting structural reductions in LI_LTL mode, iteration 1 : 47/71 places, 60/92 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 2070 ms. Remains : 47/71 places, 60/92 transitions.
Running random walk in product with property : UtilityControlRoom-COL-Z2T4N04-LTLFireability-00
Product exploration explored 100000 steps with 22900 reset in 164 ms.
Product exploration explored 100000 steps with 22986 reset in 178 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p2) (NOT p1) (NOT p0)), (X (NOT (AND (NOT p1) p0))), (X (AND (NOT p1) (NOT p0))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT p1)))]
False Knowledge obtained : [(X (X (AND (NOT p1) p0))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X p0)), (X (X (NOT p0)))]
Knowledge based reduction with 6 factoid took 272 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 142 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 (NOT (AND (NOT p1) p0))), (X (AND (NOT p1) (NOT p0))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT p1)))]
False Knowledge obtained : [(X (X (AND (NOT p1) p0))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X p0)), (X (X (NOT p0))), (F p2)]
Knowledge based reduction with 6 factoid took 313 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 155 ms :[(NOT p2), (NOT p2), (NOT p2), (NOT p2)]
Stuttering acceptance computed with spot in 228 ms :[(NOT p2), (NOT p2), (NOT p2), (NOT p2)]
[2024-05-30 07:50:52] [INFO ] Invariant cache hit.
[2024-05-30 07:50:52] [INFO ] [Real]Absence check using 10 positive place invariants in 4 ms returned sat
[2024-05-30 07:50:52] [INFO ] [Real]Absence check using state equation in 28 ms returned sat
[2024-05-30 07:50:52] [INFO ] Computed and/alt/rep : 56/100/56 causal constraints (skipped 0 transitions) in 5 ms.
[2024-05-30 07:50:52] [INFO ] Solution in real domain found non-integer solution.
[2024-05-30 07:50:52] [INFO ] [Nat]Absence check using 10 positive place invariants in 5 ms returned sat
[2024-05-30 07:50:52] [INFO ] [Nat]Absence check using state equation in 36 ms returned sat
[2024-05-30 07:50:52] [INFO ] Computed and/alt/rep : 56/100/56 causal constraints (skipped 0 transitions) in 6 ms.
[2024-05-30 07:50:52] [INFO ] Added : 28 causal constraints over 7 iterations in 71 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 07:50:52] [INFO ] Invariant cache hit.
[2024-05-30 07:50:52] [INFO ] Implicit Places using invariants in 40 ms returned []
[2024-05-30 07:50:52] [INFO ] Invariant cache hit.
[2024-05-30 07:50:52] [INFO ] Implicit Places using invariants and state equation in 71 ms returned []
Implicit Place search using SMT with State Equation took 113 ms to find 0 implicit places.
Running 56 sub problems to find dead transitions.
[2024-05-30 07:50:52] [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 1011 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 906 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 1940ms problems are : Problem set: 0 solved, 56 unsolved
Search for dead transitions found 0 dead transitions in 1941ms
Finished structural reductions in LTL mode , in 1 iterations and 2056 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 76 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)]
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 90 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 163 ms :[(NOT p2), (NOT p2), (NOT p2), (NOT p2)]
[2024-05-30 07:50:55] [INFO ] Invariant cache hit.
[2024-05-30 07:50:55] [INFO ] [Real]Absence check using 10 positive place invariants in 5 ms returned sat
[2024-05-30 07:50:55] [INFO ] [Real]Absence check using state equation in 28 ms returned sat
[2024-05-30 07:50:55] [INFO ] Computed and/alt/rep : 56/100/56 causal constraints (skipped 0 transitions) in 6 ms.
[2024-05-30 07:50:55] [INFO ] Solution in real domain found non-integer solution.
[2024-05-30 07:50:55] [INFO ] [Nat]Absence check using 10 positive place invariants in 6 ms returned sat
[2024-05-30 07:50:55] [INFO ] [Nat]Absence check using state equation in 35 ms returned sat
[2024-05-30 07:50:55] [INFO ] Computed and/alt/rep : 56/100/56 causal constraints (skipped 0 transitions) in 5 ms.
[2024-05-30 07:50:55] [INFO ] Added : 28 causal constraints over 7 iterations in 71 ms. Result :sat
Could not prove EG (NOT p2)
Stuttering acceptance computed with spot in 156 ms :[(NOT p2), (NOT p2), (NOT p2), (NOT p2)]
Product exploration explored 100000 steps with 22956 reset in 95 ms.
Product exploration explored 100000 steps with 22981 reset in 102 ms.
Applying partial POR strategy [true, false, false, false]
Stuttering acceptance computed with spot in 152 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 9 ms. Remains 34 /47 variables (removed 13) and now considering 32/60 (removed 28) transitions.
[2024-05-30 07:50:56] [INFO ] Redundant transitions in 1 ms returned []
Running 28 sub problems to find dead transitions.
// Phase 1: matrix 32 rows 34 cols
[2024-05-30 07:50:56] [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 07:50:56] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 1 ms to minimize.
Problem TDEAD8 is UNSAT
[2024-05-30 07:50:56] [INFO ] Deduced a trap composed of 4 places in 17 ms of which 1 ms to minimize.
Problem TDEAD9 is UNSAT
[2024-05-30 07:50:56] [INFO ] Deduced a trap composed of 4 places in 17 ms of which 1 ms to minimize.
Problem TDEAD10 is UNSAT
[2024-05-30 07:50:56] [INFO ] Deduced a trap composed of 4 places in 17 ms of which 0 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 574 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 383 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 963ms problems are : Problem set: 8 solved, 20 unsolved
Search for dead transitions found 8 dead transitions in 964ms
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.0 ms
Discarding 8 places :
Also discarding 0 output transitions
Ensure Unique test removed 1 places
Applied a total of 1 rules in 1 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 981 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 3 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 07:50:57] [INFO ] Computed 10 invariants in 1 ms
[2024-05-30 07:50:57] [INFO ] Implicit Places using invariants in 53 ms returned [17]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 54 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 0 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 57 ms. Remains : 33/47 places, 32/60 transitions.
Treatment of property UtilityControlRoom-COL-Z2T4N04-LTLFireability-00 finished in 8919 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' '!(F((G(F((G(p2)||p1)))||p0)))'
[2024-05-30 07:50:57] [INFO ] Flatten gal took : 10 ms
[2024-05-30 07:50:57] [INFO ] Export to MCC of 3 properties in file /home/mcc/execution/LTLFireability.sr.xml took 3 ms.
[2024-05-30 07:50:57] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 71 places, 92 transitions and 264 arcs took 5 ms.
Total runtime 71754 ms.
There are residual formulas that ITS could not solve within timeout
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------
Running UtilityControlRoom-COL-Z2T4N04
IS_COLORED=
IS_NUPN=
LOADING PETRI NET FILE /home/mcc/execution/412/model.pnml (PNML) ...
PNML VERSION 2009, P/T NET.
COLOR CLASSES: 0
CONSTANTS: 0
PLACES: 71
TRANSITIONS: 92
COLOR VARS: 0
MEASURES: 0
LOADING TIME: [User 0.000s, Sys 0.003s]
SAVING FILE /home/mcc/execution/412/model (.net / .def) ...
EXPORT TIME: [User 0.000s, Sys 0.001s]
----------------------------------------------------------------------
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: 1955
MODEL NAME: /home/mcc/execution/412/model
71 places, 92 transitions.
Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Building monolithic NSF...
FORMULA UtilityControlRoom-COL-Z2T4N04-LTLFireability-00 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA UtilityControlRoom-COL-Z2T4N04-LTLFireability-04 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA UtilityControlRoom-COL-Z2T4N04-LTLFireability-11 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
Ok.
EXITCODE: 0
----------------------------------------------------------------------
BK_STOP 1717055461298
--------------------
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-COL-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-COL-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-171701109600052"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/UtilityControlRoom-COL-Z2T4N04.tgz
mv UtilityControlRoom-COL-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 '
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 ;