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.r444-smll-171701110600052.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 itstools
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 r444-smll-171701110600052
=====================================================================

--------------------
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 1717073828619

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=UtilityControlRoom-COL-Z2T4N04
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is COL
LTLFireability COL
Running Version 202405141337
[2024-05-30 12:57:11] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-30 12:57:11] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-30 12:57:11] [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 12:57:11] [WARNING] Using fallBack plugin, rng conformance not checked
[2024-05-30 12:57:12] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 842 ms
[2024-05-30 12:57:12] [INFO ] Imported 13 HL places and 12 HL transitions for a total of 72 PT places and 108.0 transition bindings in 25 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 25 ms.
Working with output stream class java.io.PrintStream
[2024-05-30 12:57:12] [INFO ] Built PT skeleton of HLPN with 13 places and 12 transitions 37 arcs in 9 ms.
[2024-05-30 12:57:12] [INFO ] Skeletonized 16 HLPN properties in 3 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 353 steps (0 resets) in 35 ms. (9 steps per ms) remains 0/9 properties
[2024-05-30 12:57:12] [INFO ] Flatten gal took : 30 ms
[2024-05-30 12:57:12] [INFO ] Flatten gal took : 7 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 12:57:12] [INFO ] Unfolded HLPN to a Petri net with 72 places and 108 transitions 340 arcs in 36 ms.
[2024-05-30 12:57:12] [INFO ] Unfolded 12 HLPN properties in 0 ms.
[2024-05-30 12:57:12] [INFO ] Reduced 4 identical enabling conditions.
[2024-05-30 12:57:12] [INFO ] Reduced 4 identical enabling conditions.
[2024-05-30 12:57:12] [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 14 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 12:57:12] [INFO ] Computed 11 invariants in 22 ms
[2024-05-30 12:57:13] [INFO ] Implicit Places using invariants in 281 ms returned [51]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 350 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 3 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 395 ms. Remains : 71/72 places, 92/92 transitions.
Support contains 63 out of 71 places after structural reductions.
[2024-05-30 12:57:13] [INFO ] Flatten gal took : 27 ms
[2024-05-30 12:57:13] [INFO ] Flatten gal took : 32 ms
[2024-05-30 12:57:13] [INFO ] Input system was already deterministic with 92 transitions.
Reduction of identical properties reduced properties to check from 17 to 12
RANDOM walk for 701 steps (0 resets) in 86 ms. (8 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 30 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 12:57:13] [INFO ] Computed 10 invariants in 3 ms
[2024-05-30 12:57:14] [INFO ] Implicit Places using invariants in 94 ms returned []
[2024-05-30 12:57:14] [INFO ] Invariant cache hit.
[2024-05-30 12:57:14] [INFO ] Implicit Places using invariants and state equation in 127 ms returned []
Implicit Place search using SMT with State Equation took 225 ms to find 0 implicit places.
Running 80 sub problems to find dead transitions.
[2024-05-30 12:57:14] [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 2678 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 2689 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 5507ms problems are : Problem set: 0 solved, 80 unsolved
Search for dead transitions found 0 dead transitions in 5533ms
Starting structural reductions in LTL mode, iteration 1 : 63/71 places, 84/92 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5791 ms. Remains : 63/71 places, 84/92 transitions.
Stuttering acceptance computed with spot in 563 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 22655 reset in 569 ms.
Product exploration explored 100000 steps with 22663 reset in 412 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 270 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 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 : [(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 307 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 160 ms :[(NOT p2), (NOT p2), (NOT p2), (NOT p2)]
Stuttering acceptance computed with spot in 151 ms :[(NOT p2), (NOT p2), (NOT p2), (NOT p2)]
[2024-05-30 12:57:22] [INFO ] Invariant cache hit.
[2024-05-30 12:57:22] [INFO ] [Real]Absence check using 10 positive place invariants in 7 ms returned sat
[2024-05-30 12:57:22] [INFO ] [Real]Absence check using state equation in 50 ms returned sat
[2024-05-30 12:57:22] [INFO ] Computed and/alt/rep : 80/124/80 causal constraints (skipped 0 transitions) in 12 ms.
[2024-05-30 12:57:22] [INFO ] Added : 0 causal constraints over 0 iterations in 47 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 2 ms. Remains 63 /63 variables (removed 0) and now considering 84/84 (removed 0) transitions.
[2024-05-30 12:57:22] [INFO ] Invariant cache hit.
[2024-05-30 12:57:22] [INFO ] Implicit Places using invariants in 76 ms returned []
[2024-05-30 12:57:22] [INFO ] Invariant cache hit.
[2024-05-30 12:57:22] [INFO ] Implicit Places using invariants and state equation in 83 ms returned []
Implicit Place search using SMT with State Equation took 161 ms to find 0 implicit places.
Running 80 sub problems to find dead transitions.
[2024-05-30 12:57:22] [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 2239 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 2618 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 4900ms problems are : Problem set: 0 solved, 80 unsolved
Search for dead transitions found 0 dead transitions in 4904ms
Finished structural reductions in LTL mode , in 1 iterations and 5071 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 100 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 179 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 113 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 215 ms :[(NOT p2), (NOT p2), (NOT p2), (NOT p2)]
[2024-05-30 12:57:28] [INFO ] Invariant cache hit.
[2024-05-30 12:57:28] [INFO ] [Real]Absence check using 10 positive place invariants in 8 ms returned sat
[2024-05-30 12:57:28] [INFO ] [Real]Absence check using state equation in 66 ms returned sat
[2024-05-30 12:57:28] [INFO ] Computed and/alt/rep : 80/124/80 causal constraints (skipped 0 transitions) in 15 ms.
[2024-05-30 12:57:28] [INFO ] Added : 0 causal constraints over 0 iterations in 33 ms. Result :sat
Could not prove EG (NOT p2)
Stuttering acceptance computed with spot in 205 ms :[(NOT p2), (NOT p2), (NOT p2), (NOT p2)]
Product exploration explored 100000 steps with 22636 reset in 175 ms.
Product exploration explored 100000 steps with 22687 reset in 263 ms.
Applying partial POR strategy [true, false, false, false]
Stuttering acceptance computed with spot in 142 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 0 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 0 ms
Iterating global reduction 1 with 12 rules applied. Total rules applied 62 place count 50 transition count 56
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 70 place count 42 transition count 48
Deduced a syphon composed of 16 places in 0 ms
Iterating global reduction 1 with 8 rules applied. Total rules applied 78 place count 42 transition count 48
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 82 place count 42 transition count 44
Deduced a syphon composed of 16 places in 0 ms
Applied a total of 82 rules in 39 ms. Remains 42 /63 variables (removed 21) and now considering 44/84 (removed 40) transitions.
[2024-05-30 12:57:29] [INFO ] Redundant transitions in 1 ms returned []
Running 40 sub problems to find dead transitions.
// Phase 1: matrix 44 rows 42 cols
[2024-05-30 12:57:29] [INFO ] Computed 10 invariants in 1 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/38 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 40 unsolved
[2024-05-30 12:57:30] [INFO ] Deduced a trap composed of 5 places in 52 ms of which 26 ms to minimize.
[2024-05-30 12:57:30] [INFO ] Deduced a trap composed of 5 places in 43 ms of which 6 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/38 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/38 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 3 (OVERLAPS) 4/42 variables, 8/12 constraints. Problems are: Problem set: 0 solved, 40 unsolved
[2024-05-30 12:57:30] [INFO ] Deduced a trap composed of 4 places in 27 ms of which 3 ms to minimize.
Problem TDEAD4 is UNSAT
[2024-05-30 12:57:30] [INFO ] Deduced a trap composed of 4 places in 23 ms of which 1 ms to minimize.
Problem TDEAD5 is UNSAT
[2024-05-30 12:57:30] [INFO ] Deduced a trap composed of 4 places in 28 ms of which 1 ms to minimize.
Problem TDEAD6 is UNSAT
[2024-05-30 12:57:30] [INFO ] Deduced a trap composed of 4 places in 25 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 922 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 479 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 1415ms problems are : Problem set: 20 solved, 20 unsolved
Search for dead transitions found 20 dead transitions in 1416ms
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 1481 ms. Remains : 25/63 places, 24/84 transitions.
Built C files in :
/tmp/ltsmin18197973243748625764
[2024-05-30 12:57:31] [INFO ] Built C files in 19ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin18197973243748625764
Running compilation step : cd /tmp/ltsmin18197973243748625764;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 720 ms.
Running link step : cd /tmp/ltsmin18197973243748625764;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 76 ms.
Running LTSmin : cd /tmp/ltsmin18197973243748625764;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased13486568971552563811.hoa' '--buchi-type=spotba'
LTSmin run took 218 ms.
FORMULA UtilityControlRoom-COL-Z2T4N04-LTLFireability-00 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property UtilityControlRoom-COL-Z2T4N04-LTLFireability-00 finished in 18573 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 4 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 12:57:32] [INFO ] Computed 10 invariants in 2 ms
[2024-05-30 12:57:32] [INFO ] Implicit Places using invariants in 60 ms returned []
[2024-05-30 12:57:32] [INFO ] Invariant cache hit.
[2024-05-30 12:57:32] [INFO ] Implicit Places using invariants and state equation in 117 ms returned []
Implicit Place search using SMT with State Equation took 181 ms to find 0 implicit places.
Running 80 sub problems to find dead transitions.
[2024-05-30 12:57:32] [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 2387 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 2510 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 4956ms problems are : Problem set: 0 solved, 80 unsolved
Search for dead transitions found 0 dead transitions in 4963ms
Starting structural reductions in LTL mode, iteration 1 : 63/71 places, 84/92 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5149 ms. Remains : 63/71 places, 84/92 transitions.
Stuttering acceptance computed with spot in 375 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 1 ms.
FORMULA UtilityControlRoom-COL-Z2T4N04-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property UtilityControlRoom-COL-Z2T4N04-LTLFireability-01 finished in 5568 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 5 ms. Remains 63 /71 variables (removed 8) and now considering 84/92 (removed 8) transitions.
[2024-05-30 12:57:37] [INFO ] Invariant cache hit.
[2024-05-30 12:57:38] [INFO ] Implicit Places using invariants in 99 ms returned [42]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 101 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 108 ms. Remains : 62/71 places, 84/92 transitions.
Stuttering acceptance computed with spot in 222 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 341 ms.
Stack based approach found an accepted trace after 143 steps with 0 reset with depth 144 and stack size 144 in 2 ms.
FORMULA UtilityControlRoom-COL-Z2T4N04-LTLFireability-03 FALSE TECHNIQUES STACK_TEST
Treatment of property UtilityControlRoom-COL-Z2T4N04-LTLFireability-03 finished in 695 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 14 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 12:57:38] [INFO ] Computed 10 invariants in 2 ms
[2024-05-30 12:57:38] [INFO ] Implicit Places using invariants in 49 ms returned []
[2024-05-30 12:57:38] [INFO ] Invariant cache hit.
[2024-05-30 12:57:38] [INFO ] Implicit Places using invariants and state equation in 93 ms returned []
Implicit Place search using SMT with State Equation took 144 ms to find 0 implicit places.
[2024-05-30 12:57:38] [INFO ] Redundant transitions in 1 ms returned []
Running 64 sub problems to find dead transitions.
[2024-05-30 12:57:38] [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 1752 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 1878 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 3659ms problems are : Problem set: 0 solved, 64 unsolved
Search for dead transitions found 0 dead transitions in 3661ms
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 3828 ms. Remains : 55/71 places, 68/92 transitions.
Stuttering acceptance computed with spot in 242 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 23100 reset in 517 ms.
Product exploration explored 100000 steps with 22984 reset in 558 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 530 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 205 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2) p1), false]
RANDOM walk for 153 steps (0 resets) in 8 ms. (17 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 918 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 336 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2) p1), false]
Stuttering acceptance computed with spot in 225 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2) p1), false]
[2024-05-30 12:57:46] [INFO ] Invariant cache hit.
[2024-05-30 12:57:46] [INFO ] [Real]Absence check using 10 positive place invariants in 9 ms returned sat
[2024-05-30 12:57:46] [INFO ] [Real]Absence check using state equation in 54 ms returned sat
[2024-05-30 12:57:46] [INFO ] Solution in real domain found non-integer solution.
[2024-05-30 12:57:46] [INFO ] [Nat]Absence check using 10 positive place invariants in 8 ms returned sat
[2024-05-30 12:57:46] [INFO ] [Nat]Absence check using state equation in 51 ms returned sat
[2024-05-30 12:57:46] [INFO ] Computed and/alt/rep : 64/100/64 causal constraints (skipped 0 transitions) in 7 ms.
[2024-05-30 12:57:46] [INFO ] Added : 36 causal constraints over 8 iterations in 99 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p2))
Support contains 23 out of 55 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 55/55 places, 68/68 transitions.
Applied a total of 0 rules in 5 ms. Remains 55 /55 variables (removed 0) and now considering 68/68 (removed 0) transitions.
[2024-05-30 12:57:46] [INFO ] Invariant cache hit.
[2024-05-30 12:57:46] [INFO ] Implicit Places using invariants in 39 ms returned []
[2024-05-30 12:57:46] [INFO ] Invariant cache hit.
[2024-05-30 12:57:46] [INFO ] Implicit Places using invariants and state equation in 82 ms returned []
Implicit Place search using SMT with State Equation took 124 ms to find 0 implicit places.
[2024-05-30 12:57:46] [INFO ] Redundant transitions in 2 ms returned []
Running 64 sub problems to find dead transitions.
[2024-05-30 12:57:46] [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 1779 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 1483 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 3288ms problems are : Problem set: 0 solved, 64 unsolved
Search for dead transitions found 0 dead transitions in 3289ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 3426 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 617 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 200 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2) p1), false]
RANDOM walk for 95 steps (0 resets) in 7 ms. (11 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 756 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 178 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2) p1), false]
Stuttering acceptance computed with spot in 159 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2) p1), false]
[2024-05-30 12:57:52] [INFO ] Invariant cache hit.
[2024-05-30 12:57:52] [INFO ] [Real]Absence check using 10 positive place invariants in 6 ms returned sat
[2024-05-30 12:57:52] [INFO ] [Real]Absence check using state equation in 38 ms returned sat
[2024-05-30 12:57:52] [INFO ] Solution in real domain found non-integer solution.
[2024-05-30 12:57:52] [INFO ] [Nat]Absence check using 10 positive place invariants in 9 ms returned sat
[2024-05-30 12:57:52] [INFO ] [Nat]Absence check using state equation in 103 ms returned sat
[2024-05-30 12:57:52] [INFO ] Computed and/alt/rep : 64/100/64 causal constraints (skipped 0 transitions) in 9 ms.
[2024-05-30 12:57:52] [INFO ] Added : 36 causal constraints over 8 iterations in 111 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p2))
Stuttering acceptance computed with spot in 173 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2) p1), false]
Product exploration explored 100000 steps with 22102 reset in 574 ms.
Product exploration explored 100000 steps with 22230 reset in 372 ms.
Built C files in :
/tmp/ltsmin4921256562093678910
[2024-05-30 12:57:53] [INFO ] Computing symmetric may disable matrix : 68 transitions.
[2024-05-30 12:57:53] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-30 12:57:53] [INFO ] Computing symmetric may enable matrix : 68 transitions.
[2024-05-30 12:57:53] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-30 12:57:53] [INFO ] Computing Do-Not-Accords matrix : 68 transitions.
[2024-05-30 12:57:53] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-30 12:57:53] [INFO ] Built C files in 28ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4921256562093678910
Running compilation step : cd /tmp/ltsmin4921256562093678910;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 432 ms.
Running link step : cd /tmp/ltsmin4921256562093678910;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 32 ms.
Running LTSmin : cd /tmp/ltsmin4921256562093678910;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased18168114540444829618.hoa' '--buchi-type=spotba'
LTSmin run took 132 ms.
FORMULA UtilityControlRoom-COL-Z2T4N04-LTLFireability-04 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property UtilityControlRoom-COL-Z2T4N04-LTLFireability-04 finished in 15695 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 17 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 12:57:54] [INFO ] Computed 9 invariants in 1 ms
[2024-05-30 12:57:54] [INFO ] Implicit Places using invariants in 45 ms returned []
[2024-05-30 12:57:54] [INFO ] Invariant cache hit.
[2024-05-30 12:57:54] [INFO ] Implicit Places using invariants and state equation in 76 ms returned []
Implicit Place search using SMT with State Equation took 123 ms to find 0 implicit places.
[2024-05-30 12:57:54] [INFO ] Redundant transitions in 0 ms returned []
Running 36 sub problems to find dead transitions.
[2024-05-30 12:57:54] [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 852 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 857 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 1723ms problems are : Problem set: 0 solved, 36 unsolved
Search for dead transitions found 0 dead transitions in 1725ms
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 1873 ms. Remains : 37/71 places, 44/92 transitions.
Stuttering acceptance computed with spot in 101 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : UtilityControlRoom-COL-Z2T4N04-LTLFireability-05
Product exploration explored 100000 steps with 9164 reset in 264 ms.
Stack based approach found an accepted trace after 748 steps with 67 reset with depth 6 and stack size 6 in 3 ms.
FORMULA UtilityControlRoom-COL-Z2T4N04-LTLFireability-05 FALSE TECHNIQUES STACK_TEST
Treatment of property UtilityControlRoom-COL-Z2T4N04-LTLFireability-05 finished in 2260 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 1 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 18 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 12:57:56] [INFO ] Computed 10 invariants in 2 ms
[2024-05-30 12:57:56] [INFO ] Implicit Places using invariants in 56 ms returned []
[2024-05-30 12:57:56] [INFO ] Invariant cache hit.
[2024-05-30 12:57:56] [INFO ] Implicit Places using invariants and state equation in 89 ms returned []
Implicit Place search using SMT with State Equation took 159 ms to find 0 implicit places.
[2024-05-30 12:57:56] [INFO ] Redundant transitions in 2 ms returned []
Running 44 sub problems to find dead transitions.
[2024-05-30 12:57:56] [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 1115 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 1238 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 2374ms problems are : Problem set: 0 solved, 44 unsolved
Search for dead transitions found 0 dead transitions in 2375ms
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 2561 ms. Remains : 43/71 places, 56/92 transitions.
Stuttering acceptance computed with spot in 109 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 40927 reset in 652 ms.
Product exploration explored 100000 steps with 40839 reset in 516 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 314 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 99 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 560 ms. (71 steps per ms) remains 1/2 properties
BEST_FIRST walk for 40003 steps (8 resets) in 1567 ms. (25 steps per ms) remains 1/1 properties
[2024-05-30 12:58:01] [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 25 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 39ms 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 99 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 5052 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 4 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 12:58:01] [INFO ] Computed 10 invariants in 6 ms
[2024-05-30 12:58:01] [INFO ] Implicit Places using invariants in 65 ms returned []
[2024-05-30 12:58:01] [INFO ] Invariant cache hit.
[2024-05-30 12:58:01] [INFO ] Implicit Places using invariants and state equation in 116 ms returned []
Implicit Place search using SMT with State Equation took 183 ms to find 0 implicit places.
Running 80 sub problems to find dead transitions.
[2024-05-30 12:58:01] [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 2444 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 2500 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 4984ms problems are : Problem set: 0 solved, 80 unsolved
Search for dead transitions found 0 dead transitions in 4986ms
Starting structural reductions in LTL mode, iteration 1 : 63/71 places, 84/92 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5173 ms. Remains : 63/71 places, 84/92 transitions.
Stuttering acceptance computed with spot in 347 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 160 steps with 39 reset in 0 ms.
FORMULA UtilityControlRoom-COL-Z2T4N04-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property UtilityControlRoom-COL-Z2T4N04-LTLFireability-09 finished in 5550 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 12:58:07] [INFO ] Computed 10 invariants in 3 ms
[2024-05-30 12:58:07] [INFO ] Implicit Places using invariants in 71 ms returned [46]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 84 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 93 ms. Remains : 66/71 places, 88/92 transitions.
Stuttering acceptance computed with spot in 90 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 8622 reset in 377 ms.
Product exploration explored 100000 steps with 8644 reset in 422 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 299 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 88 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2))]
RANDOM walk for 42 steps (0 resets) in 5 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 546 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 103 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 80 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 12:58:09] [INFO ] Computed 9 invariants in 1 ms
[2024-05-30 12:58:09] [INFO ] [Real]Absence check using 9 positive place invariants in 5 ms returned sat
[2024-05-30 12:58:09] [INFO ] [Real]Absence check using state equation in 44 ms returned sat
[2024-05-30 12:58:09] [INFO ] Solution in real domain found non-integer solution.
[2024-05-30 12:58:09] [INFO ] [Nat]Absence check using 9 positive place invariants in 6 ms returned sat
[2024-05-30 12:58:09] [INFO ] [Nat]Absence check using state equation in 57 ms returned sat
[2024-05-30 12:58:09] [INFO ] Computed and/alt/rep : 80/136/80 causal constraints (skipped 0 transitions) in 8 ms.
[2024-05-30 12:58:09] [INFO ] Added : 80 causal constraints over 16 iterations in 186 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 12:58:09] [INFO ] Invariant cache hit.
[2024-05-30 12:58:09] [INFO ] Implicit Places using invariants in 37 ms returned []
[2024-05-30 12:58:09] [INFO ] Invariant cache hit.
[2024-05-30 12:58:10] [INFO ] Implicit Places using invariants and state equation in 80 ms returned []
Implicit Place search using SMT with State Equation took 118 ms to find 0 implicit places.
[2024-05-30 12:58:10] [INFO ] Redundant transitions in 2 ms returned []
Running 80 sub problems to find dead transitions.
[2024-05-30 12:58:10] [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 2363 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 2047 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 4428ms problems are : Problem set: 0 solved, 80 unsolved
Search for dead transitions found 0 dead transitions in 4430ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 4559 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 399 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 112 ms :[(AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1))]
RANDOM walk for 56 steps (0 resets) in 6 ms. (8 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 607 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 109 ms :[(AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1))]
Stuttering acceptance computed with spot in 108 ms :[(AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1))]
[2024-05-30 12:58:15] [INFO ] Invariant cache hit.
[2024-05-30 12:58:16] [INFO ] [Real]Absence check using 9 positive place invariants in 9 ms returned sat
[2024-05-30 12:58:16] [INFO ] [Real]Absence check using state equation in 74 ms returned sat
[2024-05-30 12:58:16] [INFO ] Solution in real domain found non-integer solution.
[2024-05-30 12:58:16] [INFO ] [Nat]Absence check using 9 positive place invariants in 8 ms returned sat
[2024-05-30 12:58:16] [INFO ] [Nat]Absence check using state equation in 65 ms returned sat
[2024-05-30 12:58:16] [INFO ] Computed and/alt/rep : 80/136/80 causal constraints (skipped 0 transitions) in 11 ms.
[2024-05-30 12:58:16] [INFO ] Added : 80 causal constraints over 16 iterations in 246 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p2) (NOT p1))
Stuttering acceptance computed with spot in 109 ms :[(AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1))]
Product exploration explored 100000 steps with 8617 reset in 562 ms.
Product exploration explored 100000 steps with 8628 reset in 362 ms.
Built C files in :
/tmp/ltsmin2336321875101358133
[2024-05-30 12:58:17] [INFO ] Computing symmetric may disable matrix : 88 transitions.
[2024-05-30 12:58:17] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-30 12:58:17] [INFO ] Computing symmetric may enable matrix : 88 transitions.
[2024-05-30 12:58:17] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-30 12:58:17] [INFO ] Computing Do-Not-Accords matrix : 88 transitions.
[2024-05-30 12:58:17] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-30 12:58:17] [INFO ] Built C files in 18ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2336321875101358133
Running compilation step : cd /tmp/ltsmin2336321875101358133;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 526 ms.
Running link step : cd /tmp/ltsmin2336321875101358133;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 50 ms.
Running LTSmin : cd /tmp/ltsmin2336321875101358133;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased13999145327340803902.hoa' '--buchi-type=spotba'
LTSmin run took 3852 ms.
FORMULA UtilityControlRoom-COL-Z2T4N04-LTLFireability-11 TRUE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property UtilityControlRoom-COL-Z2T4N04-LTLFireability-11 finished in 15052 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 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 7 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 12:58:22] [INFO ] Computed 10 invariants in 1 ms
[2024-05-30 12:58:22] [INFO ] Implicit Places using invariants in 57 ms returned []
[2024-05-30 12:58:22] [INFO ] Invariant cache hit.
[2024-05-30 12:58:22] [INFO ] Implicit Places using invariants and state equation in 57 ms returned []
Implicit Place search using SMT with State Equation took 125 ms to find 0 implicit places.
[2024-05-30 12:58:22] [INFO ] Redundant transitions in 1 ms returned []
Running 44 sub problems to find dead transitions.
[2024-05-30 12:58:22] [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 1068 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 1230 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 2313ms problems are : Problem set: 0 solved, 44 unsolved
Search for dead transitions found 0 dead transitions in 2313ms
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 2454 ms. Remains : 43/71 places, 56/92 transitions.
Stuttering acceptance computed with spot in 51 ms :[(NOT p0)]
Running random walk in product with property : UtilityControlRoom-COL-Z2T4N04-LTLFireability-12
Product exploration explored 100000 steps with 0 reset in 266 ms.
Stack based approach found an accepted trace after 151 steps with 0 reset with depth 152 and stack size 152 in 0 ms.
FORMULA UtilityControlRoom-COL-Z2T4N04-LTLFireability-12 FALSE TECHNIQUES STACK_TEST
Treatment of property UtilityControlRoom-COL-Z2T4N04-LTLFireability-12 finished in 2786 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 12:58:25] [INFO ] Computed 10 invariants in 2 ms
[2024-05-30 12:58:25] [INFO ] Implicit Places using invariants in 98 ms returned [42]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 100 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 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 104 ms. Remains : 62/71 places, 84/92 transitions.
Stuttering acceptance computed with spot in 102 ms :[p0, p0]
Running random walk in product with property : UtilityControlRoom-COL-Z2T4N04-LTLFireability-14
Product exploration explored 100000 steps with 50000 reset in 119 ms.
Product exploration explored 100000 steps with 50000 reset in 137 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 17 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 499 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 13 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 12:58:25] [INFO ] Computed 10 invariants in 1 ms
[2024-05-30 12:58:25] [INFO ] Implicit Places using invariants in 61 ms returned []
[2024-05-30 12:58:25] [INFO ] Invariant cache hit.
[2024-05-30 12:58:25] [INFO ] Implicit Places using invariants and state equation in 105 ms returned []
Implicit Place search using SMT with State Equation took 168 ms to find 0 implicit places.
[2024-05-30 12:58:25] [INFO ] Redundant transitions in 2 ms returned []
Running 68 sub problems to find dead transitions.
[2024-05-30 12:58:25] [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 1405 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 2079 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 3511ms problems are : Problem set: 0 solved, 68 unsolved
Search for dead transitions found 0 dead transitions in 3513ms
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 3703 ms. Remains : 59/71 places, 80/92 transitions.
Stuttering acceptance computed with spot in 106 ms :[(NOT p1), (NOT p0)]
Running random walk in product with property : UtilityControlRoom-COL-Z2T4N04-LTLFireability-15
Product exploration explored 100000 steps with 24567 reset in 501 ms.
Stack based approach found an accepted trace after 5061 steps with 1241 reset with depth 7 and stack size 7 in 27 ms.
FORMULA UtilityControlRoom-COL-Z2T4N04-LTLFireability-15 FALSE TECHNIQUES STACK_TEST
Treatment of property UtilityControlRoom-COL-Z2T4N04-LTLFireability-15 finished in 4356 ms.
All properties solved by simple procedures.
Total runtime 78847 ms.

BK_STOP 1717073910001

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

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

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="UtilityControlRoom-COL-Z2T4N04"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool itstools"
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 r444-smll-171701110600052"
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 '' LTLFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLFireability"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;