Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 508K
-rw-r--r-- 1 mcc users 9.9K Apr 13 05:34 CTLCardinality.txt
-rw-r--r-- 1 mcc users 94K Apr 13 05:34 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.6K Apr 13 05:31 CTLFireability.txt
-rw-r--r-- 1 mcc users 53K Apr 13 05:31 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.4K Apr 23 08:04 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Apr 23 08:04 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.9K Apr 23 08:04 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Apr 23 08:04 LTLFireability.xml
-rw-r--r-- 1 mcc users 14K Apr 13 05:42 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 122K Apr 13 05:42 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.7K Apr 13 05:39 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 69K Apr 13 05:39 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.0K 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-Z2T3N08-LTLCardinality-00
FORMULA_NAME UtilityControlRoom-COL-Z2T3N08-LTLCardinality-01
FORMULA_NAME UtilityControlRoom-COL-Z2T3N08-LTLCardinality-02
FORMULA_NAME UtilityControlRoom-COL-Z2T3N08-LTLCardinality-03
FORMULA_NAME UtilityControlRoom-COL-Z2T3N08-LTLCardinality-04
FORMULA_NAME UtilityControlRoom-COL-Z2T3N08-LTLCardinality-05
FORMULA_NAME UtilityControlRoom-COL-Z2T3N08-LTLCardinality-06
FORMULA_NAME UtilityControlRoom-COL-Z2T3N08-LTLCardinality-07
FORMULA_NAME UtilityControlRoom-COL-Z2T3N08-LTLCardinality-08
FORMULA_NAME UtilityControlRoom-COL-Z2T3N08-LTLCardinality-09
FORMULA_NAME UtilityControlRoom-COL-Z2T3N08-LTLCardinality-10
FORMULA_NAME UtilityControlRoom-COL-Z2T3N08-LTLCardinality-11
FORMULA_NAME UtilityControlRoom-COL-Z2T3N08-LTLCardinality-12
FORMULA_NAME UtilityControlRoom-COL-Z2T3N08-LTLCardinality-13
FORMULA_NAME UtilityControlRoom-COL-Z2T3N08-LTLCardinality-14
FORMULA_NAME UtilityControlRoom-COL-Z2T3N08-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1717053315908

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=UtilityControlRoom-COL-Z2T3N08
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-30 07:15:18] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2024-05-30 07:15:18] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-30 07:15:18] [INFO ] Detected file is not PT type :http://www.pnml.org/version-2009/grammar/symmetricnet
log4j:WARN No appenders could be found for logger (org.apache.axiom.locator.DefaultOMMetaFactoryLocator).
log4j:WARN Please initialize the log4j system properly.
log4j:WARN See http://logging.apache.org/log4j/1.2/faq.html#noconfig for more info.
[2024-05-30 07:15:19] [WARNING] Using fallBack plugin, rng conformance not checked
[2024-05-30 07:15:19] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 1236 ms
[2024-05-30 07:15:19] [INFO ] Imported 13 HL places and 12 HL transitions for a total of 140 PT places and 216.0 transition bindings in 31 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 102 ms.
Working with output stream class java.io.PrintStream
[2024-05-30 07:15:20] [INFO ] Built PT skeleton of HLPN with 13 places and 12 transitions 37 arcs in 9 ms.
[2024-05-30 07:15:20] [INFO ] Skeletonized 16 HLPN properties in 3 ms.
Initial state reduction rules removed 1 formulas.
FORMULA UtilityControlRoom-COL-Z2T3N08-LTLCardinality-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 0 stabilizing places and 0 stable transitions
Remains 15 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
RANDOM walk for 40000 steps (8 resets) in 1744 ms. (22 steps per ms) remains 3/33 properties
BEST_FIRST walk for 40004 steps (8 resets) in 365 ms. (109 steps per ms) remains 2/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 328 ms. (121 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40001 steps (8 resets) in 300 ms. (132 steps per ms) remains 2/2 properties
// Phase 1: matrix 11 rows 13 cols
[2024-05-30 07:15:21] [INFO ] Computed 5 invariants in 6 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Problem AtomicPropp16 is UNSAT
Problem AtomicPropp17 is UNSAT
After SMT solving in domain Real declared 13/24 variables, and 5 constraints, problems are : Problem set: 2 solved, 0 unsolved in 444 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/13 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 486ms problems are : Problem set: 2 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Successfully simplified 2 atomic propositions for a total of 15 simplifications.
[2024-05-30 07:15:21] [INFO ] Flatten gal took : 20 ms
[2024-05-30 07:15:21] [INFO ] Flatten gal took : 4 ms
Transition timeout forces synchronizations/join behavior on parameter c of sort Cli
Domain [Cli(8), Z(2), Z(2)] of place MovetoZ breaks symmetries in sort Z
[2024-05-30 07:15:21] [INFO ] Unfolded HLPN to a Petri net with 140 places and 216 transitions 680 arcs in 26 ms.
[2024-05-30 07:15:21] [INFO ] Unfolded 15 HLPN properties in 1 ms.
Ensure Unique test removed 32 transitions
Reduce redundant transitions removed 32 transitions.
Support contains 132 out of 140 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 140/140 places, 184/184 transitions.
Applied a total of 0 rules in 10 ms. Remains 140 /140 variables (removed 0) and now considering 184/184 (removed 0) transitions.
// Phase 1: matrix 184 rows 140 cols
[2024-05-30 07:15:22] [INFO ] Computed 19 invariants in 9 ms
[2024-05-30 07:15:22] [INFO ] Implicit Places using invariants in 138 ms returned []
[2024-05-30 07:15:22] [INFO ] Invariant cache hit.
[2024-05-30 07:15:22] [INFO ] Implicit Places using invariants and state equation in 263 ms returned []
Implicit Place search using SMT with State Equation took 438 ms to find 0 implicit places.
Running 176 sub problems to find dead transitions.
[2024-05-30 07:15:22] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/132 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/132 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 2 (OVERLAPS) 8/140 variables, 17/19 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/140 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 4 (OVERLAPS) 184/324 variables, 140/159 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/324 variables, 0/159 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 6 (OVERLAPS) 0/324 variables, 0/159 constraints. Problems are: Problem set: 0 solved, 176 unsolved
No progress, stopping.
After SMT solving in domain Real declared 324/324 variables, and 159 constraints, problems are : Problem set: 0 solved, 176 unsolved in 8071 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, State Equation: 140/140 constraints, PredecessorRefiner: 176/176 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 176 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/132 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/132 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 2 (OVERLAPS) 8/140 variables, 17/19 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/140 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 4 (OVERLAPS) 184/324 variables, 140/159 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/324 variables, 176/335 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/324 variables, 0/335 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 7 (OVERLAPS) 0/324 variables, 0/335 constraints. Problems are: Problem set: 0 solved, 176 unsolved
No progress, stopping.
After SMT solving in domain Int declared 324/324 variables, and 335 constraints, problems are : Problem set: 0 solved, 176 unsolved in 9863 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, State Equation: 140/140 constraints, PredecessorRefiner: 176/176 constraints, Known Traps: 0/0 constraints]
After SMT, in 18288ms problems are : Problem set: 0 solved, 176 unsolved
Search for dead transitions found 0 dead transitions in 18309ms
Finished structural reductions in LTL mode , in 1 iterations and 18781 ms. Remains : 140/140 places, 184/184 transitions.
Support contains 132 out of 140 places after structural reductions.
[2024-05-30 07:15:40] [INFO ] Flatten gal took : 48 ms
[2024-05-30 07:15:40] [INFO ] Flatten gal took : 33 ms
[2024-05-30 07:15:41] [INFO ] Input system was already deterministic with 184 transitions.
RANDOM walk for 40000 steps (8 resets) in 1775 ms. (22 steps per ms) remains 5/31 properties
BEST_FIRST walk for 40004 steps (8 resets) in 93 ms. (425 steps per ms) remains 3/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 88 ms. (449 steps per ms) remains 2/3 properties
BEST_FIRST walk for 40003 steps (8 resets) in 208 ms. (191 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (8 resets) in 185 ms. (215 steps per ms) remains 2/2 properties
[2024-05-30 07:15:41] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/26 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Problem AtomicPropp14 is UNSAT
Problem AtomicPropp15 is UNSAT
After SMT solving in domain Real declared 140/324 variables, and 19 constraints, problems are : Problem set: 2 solved, 0 unsolved in 58 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, State Equation: 0/140 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 70ms problems are : Problem set: 2 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
FORMULA UtilityControlRoom-COL-Z2T3N08-LTLCardinality-08 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 2 atomic propositions for a total of 14 simplifications.
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' '!(X((F(p0)&&(X(p1) U (X(G(p1))||(p2&&X(p1)))))))'
Support contains 35 out of 140 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 140/140 places, 184/184 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 124 transition count 168
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 124 transition count 168
Applied a total of 32 rules in 37 ms. Remains 124 /140 variables (removed 16) and now considering 168/184 (removed 16) transitions.
// Phase 1: matrix 168 rows 124 cols
[2024-05-30 07:15:42] [INFO ] Computed 19 invariants in 4 ms
[2024-05-30 07:15:42] [INFO ] Implicit Places using invariants in 109 ms returned []
[2024-05-30 07:15:42] [INFO ] Invariant cache hit.
[2024-05-30 07:15:42] [INFO ] Implicit Places using invariants and state equation in 210 ms returned []
Implicit Place search using SMT with State Equation took 325 ms to find 0 implicit places.
Running 160 sub problems to find dead transitions.
[2024-05-30 07:15:42] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/116 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/116 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 2 (OVERLAPS) 8/124 variables, 17/19 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/124 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 4 (OVERLAPS) 168/292 variables, 124/143 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/292 variables, 0/143 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 6 (OVERLAPS) 0/292 variables, 0/143 constraints. Problems are: Problem set: 0 solved, 160 unsolved
No progress, stopping.
After SMT solving in domain Real declared 292/292 variables, and 143 constraints, problems are : Problem set: 0 solved, 160 unsolved in 6488 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, State Equation: 124/124 constraints, PredecessorRefiner: 160/160 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 160 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/116 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/116 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 2 (OVERLAPS) 8/124 variables, 17/19 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/124 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 4 (OVERLAPS) 168/292 variables, 124/143 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/292 variables, 160/303 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/292 variables, 0/303 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 7 (OVERLAPS) 0/292 variables, 0/303 constraints. Problems are: Problem set: 0 solved, 160 unsolved
No progress, stopping.
After SMT solving in domain Int declared 292/292 variables, and 303 constraints, problems are : Problem set: 0 solved, 160 unsolved in 7196 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, State Equation: 124/124 constraints, PredecessorRefiner: 160/160 constraints, Known Traps: 0/0 constraints]
After SMT, in 13817ms problems are : Problem set: 0 solved, 160 unsolved
Search for dead transitions found 0 dead transitions in 13820ms
Starting structural reductions in LTL mode, iteration 1 : 124/140 places, 168/184 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 14186 ms. Remains : 124/140 places, 168/184 transitions.
Stuttering acceptance computed with spot in 500 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1), (NOT p1), true]
Running random walk in product with property : UtilityControlRoom-COL-Z2T3N08-LTLCardinality-00
Entered a terminal (fully accepting) state of product in 735 steps with 177 reset in 20 ms.
FORMULA UtilityControlRoom-COL-Z2T3N08-LTLCardinality-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property UtilityControlRoom-COL-Z2T3N08-LTLCardinality-00 finished in 14811 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((F(p0)&&(p1||X(!p1)))))'
Support contains 17 out of 140 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 140/140 places, 184/184 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 124 transition count 168
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 124 transition count 168
Applied a total of 32 rules in 11 ms. Remains 124 /140 variables (removed 16) and now considering 168/184 (removed 16) transitions.
[2024-05-30 07:15:57] [INFO ] Invariant cache hit.
[2024-05-30 07:15:57] [INFO ] Implicit Places using invariants in 106 ms returned [83]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 112 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 123/140 places, 168/184 transitions.
Applied a total of 0 rules in 7 ms. Remains 123 /123 variables (removed 0) and now considering 168/168 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 131 ms. Remains : 123/140 places, 168/184 transitions.
Stuttering acceptance computed with spot in 153 ms :[(AND (NOT p0) p1), (NOT p0), (NOT p0)]
Running random walk in product with property : UtilityControlRoom-COL-Z2T3N08-LTLCardinality-01
Product exploration explored 100000 steps with 50000 reset in 460 ms.
Product exploration explored 100000 steps with 50000 reset in 416 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT (AND (NOT p0) p1))), (X p0), (X (NOT p1)), (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 5 factoid took 18 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA UtilityControlRoom-COL-Z2T3N08-LTLCardinality-01 TRUE TECHNIQUES KNOWLEDGE
Treatment of property UtilityControlRoom-COL-Z2T3N08-LTLCardinality-01 finished in 1210 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G((F(p0)&&F(G(p1)))) U (p1&&X((p0&&X(p2))))))'
Support contains 18 out of 140 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 140/140 places, 184/184 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 124 transition count 168
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 124 transition count 168
Applied a total of 32 rules in 9 ms. Remains 124 /140 variables (removed 16) and now considering 168/184 (removed 16) transitions.
[2024-05-30 07:15:58] [INFO ] Invariant cache hit.
[2024-05-30 07:15:58] [INFO ] Implicit Places using invariants in 142 ms returned [83]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 150 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 123/140 places, 168/184 transitions.
Applied a total of 0 rules in 4 ms. Remains 123 /123 variables (removed 0) and now considering 168/168 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 164 ms. Remains : 123/140 places, 168/184 transitions.
Stuttering acceptance computed with spot in 367 ms :[(OR (NOT p0) (NOT p1) (NOT p2)), (NOT p0), (NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p2)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (NOT p2), (NOT p2)]
Running random walk in product with property : UtilityControlRoom-COL-Z2T3N08-LTLCardinality-02
Product exploration explored 100000 steps with 3 reset in 237 ms.
Stack based approach found an accepted trace after 4556 steps with 7 reset with depth 4507 and stack size 4507 in 29 ms.
FORMULA UtilityControlRoom-COL-Z2T3N08-LTLCardinality-02 FALSE TECHNIQUES STACK_TEST
Treatment of property UtilityControlRoom-COL-Z2T3N08-LTLCardinality-02 finished in 853 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)||(p0&&G(F(p1))))))'
Support contains 64 out of 140 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 140/140 places, 184/184 transitions.
Applied a total of 0 rules in 4 ms. Remains 140 /140 variables (removed 0) and now considering 184/184 (removed 0) transitions.
// Phase 1: matrix 184 rows 140 cols
[2024-05-30 07:15:59] [INFO ] Computed 19 invariants in 3 ms
[2024-05-30 07:15:59] [INFO ] Implicit Places using invariants in 136 ms returned [99]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 146 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 139/140 places, 184/184 transitions.
Applied a total of 0 rules in 4 ms. Remains 139 /139 variables (removed 0) and now considering 184/184 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 154 ms. Remains : 139/140 places, 184/184 transitions.
Stuttering acceptance computed with spot in 235 ms :[(NOT p0), (NOT p0), true, (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1)]
Running random walk in product with property : UtilityControlRoom-COL-Z2T3N08-LTLCardinality-03
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA UtilityControlRoom-COL-Z2T3N08-LTLCardinality-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property UtilityControlRoom-COL-Z2T3N08-LTLCardinality-03 finished in 410 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 26 out of 140 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 140/140 places, 184/184 transitions.
Performed 32 Post agglomeration using F-continuation condition.Transition count delta: 32
Iterating post reduction 0 with 32 rules applied. Total rules applied 32 place count 140 transition count 152
Reduce places removed 32 places and 0 transitions.
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Iterating post reduction 1 with 48 rules applied. Total rules applied 80 place count 108 transition count 136
Performed 16 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 16 Pre rules applied. Total rules applied 80 place count 108 transition count 120
Deduced a syphon composed of 16 places in 1 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 2 with 32 rules applied. Total rules applied 112 place count 92 transition count 120
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
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 128 place count 84 transition count 112
Applied a total of 128 rules in 50 ms. Remains 84 /140 variables (removed 56) and now considering 112/184 (removed 72) transitions.
// Phase 1: matrix 112 rows 84 cols
[2024-05-30 07:15:59] [INFO ] Computed 19 invariants in 1 ms
[2024-05-30 07:15:59] [INFO ] Implicit Places using invariants in 138 ms returned [43]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 141 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 83/140 places, 112/184 transitions.
Applied a total of 0 rules in 11 ms. Remains 83 /83 variables (removed 0) and now considering 112/112 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 202 ms. Remains : 83/140 places, 112/184 transitions.
Stuttering acceptance computed with spot in 54 ms :[(NOT p0)]
Running random walk in product with property : UtilityControlRoom-COL-Z2T3N08-LTLCardinality-04
Product exploration explored 100000 steps with 0 reset in 322 ms.
Stack based approach found an accepted trace after 808 steps with 0 reset with depth 809 and stack size 809 in 4 ms.
FORMULA UtilityControlRoom-COL-Z2T3N08-LTLCardinality-04 FALSE TECHNIQUES STACK_TEST
Treatment of property UtilityControlRoom-COL-Z2T3N08-LTLCardinality-04 finished in 599 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((p0||X(p1)))))'
Support contains 48 out of 140 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 140/140 places, 184/184 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 124 transition count 168
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 124 transition count 168
Applied a total of 32 rules in 3 ms. Remains 124 /140 variables (removed 16) and now considering 168/184 (removed 16) transitions.
// Phase 1: matrix 168 rows 124 cols
[2024-05-30 07:16:00] [INFO ] Computed 19 invariants in 2 ms
[2024-05-30 07:16:00] [INFO ] Implicit Places using invariants in 189 ms returned [83]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 190 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 123/140 places, 168/184 transitions.
Applied a total of 0 rules in 1 ms. Remains 123 /123 variables (removed 0) and now considering 168/168 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 195 ms. Remains : 123/140 places, 168/184 transitions.
Stuttering acceptance computed with spot in 156 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : UtilityControlRoom-COL-Z2T3N08-LTLCardinality-05
Entered a terminal (fully accepting) state of product in 25 steps with 0 reset in 0 ms.
FORMULA UtilityControlRoom-COL-Z2T3N08-LTLCardinality-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property UtilityControlRoom-COL-Z2T3N08-LTLCardinality-05 finished in 374 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((p0 U (!p0&&G(p1))))'
Support contains 34 out of 140 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 140/140 places, 184/184 transitions.
Performed 32 Post agglomeration using F-continuation condition.Transition count delta: 32
Iterating post reduction 0 with 32 rules applied. Total rules applied 32 place count 140 transition count 152
Reduce places removed 32 places and 0 transitions.
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Iterating post reduction 1 with 48 rules applied. Total rules applied 80 place count 108 transition count 136
Performed 16 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 16 Pre rules applied. Total rules applied 80 place count 108 transition count 120
Deduced a syphon composed of 16 places in 1 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 2 with 32 rules applied. Total rules applied 112 place count 92 transition count 120
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
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 128 place count 84 transition count 112
Applied a total of 128 rules in 12 ms. Remains 84 /140 variables (removed 56) and now considering 112/184 (removed 72) transitions.
// Phase 1: matrix 112 rows 84 cols
[2024-05-30 07:16:00] [INFO ] Computed 19 invariants in 2 ms
[2024-05-30 07:16:00] [INFO ] Implicit Places using invariants in 77 ms returned [43]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 78 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 83/140 places, 112/184 transitions.
Applied a total of 0 rules in 3 ms. Remains 83 /83 variables (removed 0) and now considering 112/112 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 94 ms. Remains : 83/140 places, 112/184 transitions.
Stuttering acceptance computed with spot in 102 ms :[(NOT p1), true, (OR (NOT p1) p0)]
Running random walk in product with property : UtilityControlRoom-COL-Z2T3N08-LTLCardinality-06
Entered a terminal (fully accepting) state of product in 21954 steps with 0 reset in 61 ms.
FORMULA UtilityControlRoom-COL-Z2T3N08-LTLCardinality-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property UtilityControlRoom-COL-Z2T3N08-LTLCardinality-06 finished in 277 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 G((!p1||((p2 U p3) U p0)))))'
Support contains 51 out of 140 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 140/140 places, 184/184 transitions.
Performed 16 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 16 Pre rules applied. Total rules applied 0 place count 140 transition count 168
Deduced a syphon composed of 16 places in 0 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 0 with 32 rules applied. Total rules applied 32 place count 124 transition count 168
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
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 48 place count 116 transition count 160
Applied a total of 48 rules in 10 ms. Remains 116 /140 variables (removed 24) and now considering 160/184 (removed 24) transitions.
// Phase 1: matrix 160 rows 116 cols
[2024-05-30 07:16:00] [INFO ] Computed 19 invariants in 1 ms
[2024-05-30 07:16:00] [INFO ] Implicit Places using invariants in 82 ms returned [75]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 85 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 115/140 places, 160/184 transitions.
Applied a total of 0 rules in 5 ms. Remains 115 /115 variables (removed 0) and now considering 160/160 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 100 ms. Remains : 115/140 places, 160/184 transitions.
Stuttering acceptance computed with spot in 237 ms :[(AND (NOT p0) p1), (NOT p0), (AND (NOT p0) (NOT p3)), (AND (NOT p0) p1 (NOT p3)), (AND (NOT p0) p1)]
Running random walk in product with property : UtilityControlRoom-COL-Z2T3N08-LTLCardinality-07
Product exploration explored 100000 steps with 0 reset in 568 ms.
Product exploration explored 100000 steps with 0 reset in 559 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 p1 p0 p3 (NOT p2)), (X (NOT p2)), (X p3), (X (NOT (AND p1 (NOT p0) (NOT p3) (NOT p2)))), (X (NOT (OR (AND (NOT p1) (NOT p0) p3) (AND (NOT p1) (NOT p0) p2)))), (X (NOT (AND p1 (NOT p0)))), (X (OR (NOT p1) p0 p3 p2)), (X (NOT (OR (AND p1 (NOT p0) p3) (AND p1 (NOT p0) p2)))), (X (NOT (OR (AND (NOT p1) (NOT p3) (NOT p2)) (AND p0 (NOT p3) (NOT p2))))), (X (NOT (AND p1 (NOT p0) (NOT p3) p2))), (X (NOT (AND (NOT p1) (NOT p0) (NOT p3) (NOT p2)))), (X (NOT (AND (NOT p1) (NOT p0) (NOT p3) p2))), (X (NOT (OR (AND (NOT p1) (NOT p3) p2) (AND p0 (NOT p3) p2)))), (X p0), (X p1), (X (X (NOT p2))), (X (X (NOT (AND p1 (NOT p0) (NOT p3) (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p3) p2)))), (X (X (NOT (OR (AND (NOT p1) (NOT p0) p3) (AND (NOT p1) (NOT p0) p2))))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (OR (NOT p1) p0 p3 p2))), (X (X (NOT (OR (AND p1 (NOT p0) p3) (AND p1 (NOT p0) p2))))), (X (X (NOT (AND p1 (NOT p0) (NOT p3) p2)))), (X (X (NOT (AND (NOT p1) (NOT p0) (NOT p3) p2)))), (X (X (NOT (OR (AND (NOT p1) (NOT p3) p2) (AND p0 (NOT p3) p2)))))]
False Knowledge obtained : [(X (X p3)), (X (X (NOT p3))), (X (X (OR (AND (NOT p1) (NOT p3) (NOT p2)) (AND p0 (NOT p3) (NOT p2))))), (X (X (NOT (OR (AND (NOT p1) (NOT p3) (NOT p2)) (AND p0 (NOT p3) (NOT p2)))))), (X (X (AND (NOT p1) (NOT p0) (NOT p3) (NOT p2)))), (X (X (NOT (AND (NOT p1) (NOT p0) (NOT p3) (NOT p2))))), (X (X (AND (NOT p0) (NOT p3) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p3) (NOT p2))))), (X (X p0)), (X (X (NOT p0))), (X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 25 factoid took 841 ms. Reduced automaton from 5 states, 20 edges and 4 AP (stutter insensitive) to 5 states, 21 edges and 4 AP (stutter insensitive).
Stuttering acceptance computed with spot in 304 ms :[(AND (NOT p0) p1), (NOT p0), (AND (NOT p0) (NOT p3)), (AND (NOT p0) p1 (NOT p3)), (AND (NOT p0) p1)]
Reduction of identical properties reduced properties to check from 16 to 15
RANDOM walk for 40000 steps (8 resets) in 584 ms. (68 steps per ms) remains 4/15 properties
BEST_FIRST walk for 40003 steps (8 resets) in 306 ms. (130 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (8 resets) in 197 ms. (202 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 140 ms. (283 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 578 ms. (69 steps per ms) remains 4/4 properties
// Phase 1: matrix 160 rows 115 cols
[2024-05-30 07:16:04] [INFO ] Computed 18 invariants in 1 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/51 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
Problem apf1 is UNSAT
Problem apf7 is UNSAT
Problem apf9 is UNSAT
Problem apf10 is UNSAT
After SMT solving in domain Real declared 115/275 variables, and 18 constraints, problems are : Problem set: 4 solved, 0 unsolved in 80 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, State Equation: 0/115 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
After SMT, in 113ms problems are : Problem set: 4 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 5 invariant AP formulas.
Knowledge obtained : [(AND p1 p0 p3 (NOT p2)), (X (NOT p2)), (X p3), (X (NOT (AND p1 (NOT p0) (NOT p3) (NOT p2)))), (X (NOT (OR (AND (NOT p1) (NOT p0) p3) (AND (NOT p1) (NOT p0) p2)))), (X (NOT (AND p1 (NOT p0)))), (X (OR (NOT p1) p0 p3 p2)), (X (NOT (OR (AND p1 (NOT p0) p3) (AND p1 (NOT p0) p2)))), (X (NOT (OR (AND (NOT p1) (NOT p3) (NOT p2)) (AND p0 (NOT p3) (NOT p2))))), (X (NOT (AND p1 (NOT p0) (NOT p3) p2))), (X (NOT (AND (NOT p1) (NOT p0) (NOT p3) (NOT p2)))), (X (NOT (AND (NOT p1) (NOT p0) (NOT p3) p2))), (X (NOT (OR (AND (NOT p1) (NOT p3) p2) (AND p0 (NOT p3) p2)))), (X p0), (X p1), (X (X (NOT p2))), (X (X (NOT (AND p1 (NOT p0) (NOT p3) (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p3) p2)))), (X (X (NOT (OR (AND (NOT p1) (NOT p0) p3) (AND (NOT p1) (NOT p0) p2))))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (OR (NOT p1) p0 p3 p2))), (X (X (NOT (OR (AND p1 (NOT p0) p3) (AND p1 (NOT p0) p2))))), (X (X (NOT (AND p1 (NOT p0) (NOT p3) p2)))), (X (X (NOT (AND (NOT p1) (NOT p0) (NOT p3) p2)))), (X (X (NOT (OR (AND (NOT p1) (NOT p3) p2) (AND p0 (NOT p3) p2))))), (G (OR p0 (NOT p1) p2 p3)), (G (OR p0 (NOT p1))), (G (OR p0 (NOT p1) p2 p3)), (G (OR p0 (NOT p1) (NOT p2) p3)), (G (AND (OR p0 (NOT p1) (NOT p2)) (OR p0 (NOT p1) (NOT p3))))]
False Knowledge obtained : [(X (X p3)), (X (X (NOT p3))), (X (X (OR (AND (NOT p1) (NOT p3) (NOT p2)) (AND p0 (NOT p3) (NOT p2))))), (X (X (NOT (OR (AND (NOT p1) (NOT p3) (NOT p2)) (AND p0 (NOT p3) (NOT p2)))))), (X (X (AND (NOT p1) (NOT p0) (NOT p3) (NOT p2)))), (X (X (NOT (AND (NOT p1) (NOT p0) (NOT p3) (NOT p2))))), (X (X (AND (NOT p0) (NOT p3) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p3) (NOT p2))))), (X (X p0)), (X (X (NOT p0))), (X (X p1)), (X (X (NOT p1))), (F (NOT (OR p0 p1 (NOT p2) p3))), (F (NOT (OR p0 (NOT p2) p3))), (F (NOT (AND (OR p0 p1 (NOT p2)) (OR p0 p1 (NOT p3))))), (F (NOT p1)), (F (NOT (OR p0 p1 p2 p3))), (F (NOT p0)), (F (NOT (OR p0 p2 p3))), (F (NOT (AND (OR (NOT p0) p2 p3) (OR p1 p2 p3)))), (F p2), (F (NOT p3)), (F (NOT (AND (OR (NOT p0) (NOT p2) p3) (OR p1 (NOT p2) p3))))]
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 30 factoid took 37 ms. Reduced automaton from 5 states, 21 edges and 4 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA UtilityControlRoom-COL-Z2T3N08-LTLCardinality-07 TRUE TECHNIQUES KNOWLEDGE
Treatment of property UtilityControlRoom-COL-Z2T3N08-LTLCardinality-07 finished in 3401 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((p0||X((X(X(X(G(!p1)))) U (p0&&X(X(X(G(!p1)))))))))'
Support contains 24 out of 140 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 140/140 places, 184/184 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 124 transition count 168
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 124 transition count 168
Applied a total of 32 rules in 4 ms. Remains 124 /140 variables (removed 16) and now considering 168/184 (removed 16) transitions.
// Phase 1: matrix 168 rows 124 cols
[2024-05-30 07:16:04] [INFO ] Computed 19 invariants in 1 ms
[2024-05-30 07:16:04] [INFO ] Implicit Places using invariants in 117 ms returned [83]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 118 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 123/140 places, 168/184 transitions.
Applied a total of 0 rules in 1 ms. Remains 123 /123 variables (removed 0) and now considering 168/168 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 123 ms. Remains : 123/140 places, 168/184 transitions.
Stuttering acceptance computed with spot in 225 ms :[(NOT p0), (OR (NOT p0) p1), p1, p1, p1, true]
Running random walk in product with property : UtilityControlRoom-COL-Z2T3N08-LTLCardinality-09
Entered a terminal (fully accepting) state of product in 36 steps with 0 reset in 0 ms.
FORMULA UtilityControlRoom-COL-Z2T3N08-LTLCardinality-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property UtilityControlRoom-COL-Z2T3N08-LTLCardinality-09 finished in 381 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(p0))))'
Support contains 40 out of 140 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 140/140 places, 184/184 transitions.
Applied a total of 0 rules in 2 ms. Remains 140 /140 variables (removed 0) and now considering 184/184 (removed 0) transitions.
// Phase 1: matrix 184 rows 140 cols
[2024-05-30 07:16:04] [INFO ] Computed 19 invariants in 2 ms
[2024-05-30 07:16:04] [INFO ] Implicit Places using invariants in 142 ms returned [99]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 143 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 139/140 places, 184/184 transitions.
Applied a total of 0 rules in 2 ms. Remains 139 /139 variables (removed 0) and now considering 184/184 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 148 ms. Remains : 139/140 places, 184/184 transitions.
Stuttering acceptance computed with spot in 108 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : UtilityControlRoom-COL-Z2T3N08-LTLCardinality-10
Product exploration explored 100000 steps with 7332 reset in 502 ms.
Product exploration explored 100000 steps with 7195 reset in 250 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 (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 86 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 134 ms :[(NOT p0), (NOT p0), (NOT p0)]
RANDOM walk for 83 steps (0 resets) in 6 ms. (11 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 2 factoid took 94 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 94 ms :[(NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 119 ms :[(NOT p0), (NOT p0), (NOT p0)]
// Phase 1: matrix 184 rows 139 cols
[2024-05-30 07:16:06] [INFO ] Computed 18 invariants in 2 ms
[2024-05-30 07:16:06] [INFO ] [Real]Absence check using 18 positive place invariants in 8 ms returned sat
[2024-05-30 07:16:06] [INFO ] [Real]Absence check using state equation in 107 ms returned sat
[2024-05-30 07:16:06] [INFO ] Solution in real domain found non-integer solution.
[2024-05-30 07:16:06] [INFO ] [Nat]Absence check using 18 positive place invariants in 14 ms returned sat
[2024-05-30 07:16:06] [INFO ] [Nat]Absence check using state equation in 135 ms returned sat
[2024-05-30 07:16:06] [INFO ] Computed and/alt/rep : 176/264/176 causal constraints (skipped 0 transitions) in 19 ms.
[2024-05-30 07:16:07] [INFO ] Added : 136 causal constraints over 28 iterations in 540 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 40 out of 139 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 139/139 places, 184/184 transitions.
Applied a total of 0 rules in 1 ms. Remains 139 /139 variables (removed 0) and now considering 184/184 (removed 0) transitions.
[2024-05-30 07:16:07] [INFO ] Invariant cache hit.
[2024-05-30 07:16:07] [INFO ] Implicit Places using invariants in 97 ms returned []
[2024-05-30 07:16:07] [INFO ] Invariant cache hit.
[2024-05-30 07:16:07] [INFO ] Implicit Places using invariants and state equation in 193 ms returned []
Implicit Place search using SMT with State Equation took 296 ms to find 0 implicit places.
Running 176 sub problems to find dead transitions.
[2024-05-30 07:16:07] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/131 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/131 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 2 (OVERLAPS) 8/139 variables, 16/18 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/139 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 4 (OVERLAPS) 184/323 variables, 139/157 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/323 variables, 0/157 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 6 (OVERLAPS) 0/323 variables, 0/157 constraints. Problems are: Problem set: 0 solved, 176 unsolved
No progress, stopping.
After SMT solving in domain Real declared 323/323 variables, and 157 constraints, problems are : Problem set: 0 solved, 176 unsolved in 7020 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, State Equation: 139/139 constraints, PredecessorRefiner: 176/176 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 176 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/131 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/131 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 2 (OVERLAPS) 8/139 variables, 16/18 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/139 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 4 (OVERLAPS) 184/323 variables, 139/157 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/323 variables, 176/333 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/323 variables, 0/333 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 7 (OVERLAPS) 0/323 variables, 0/333 constraints. Problems are: Problem set: 0 solved, 176 unsolved
No progress, stopping.
After SMT solving in domain Int declared 323/323 variables, and 333 constraints, problems are : Problem set: 0 solved, 176 unsolved in 8278 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, State Equation: 139/139 constraints, PredecessorRefiner: 176/176 constraints, Known Traps: 0/0 constraints]
After SMT, in 15457ms problems are : Problem set: 0 solved, 176 unsolved
Search for dead transitions found 0 dead transitions in 15468ms
Finished structural reductions in LTL mode , in 1 iterations and 15768 ms. Remains : 139/139 places, 184/184 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(NOT p0), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 80 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 100 ms :[(NOT p0), (NOT p0), (NOT p0)]
RANDOM walk for 32 steps (0 resets) in 4 ms. (6 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 2 factoid took 88 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 97 ms :[(NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 98 ms :[(NOT p0), (NOT p0), (NOT p0)]
[2024-05-30 07:16:23] [INFO ] Invariant cache hit.
[2024-05-30 07:16:23] [INFO ] [Real]Absence check using 18 positive place invariants in 18 ms returned sat
[2024-05-30 07:16:23] [INFO ] [Real]Absence check using state equation in 159 ms returned sat
[2024-05-30 07:16:23] [INFO ] Solution in real domain found non-integer solution.
[2024-05-30 07:16:24] [INFO ] [Nat]Absence check using 18 positive place invariants in 16 ms returned sat
[2024-05-30 07:16:24] [INFO ] [Nat]Absence check using state equation in 154 ms returned sat
[2024-05-30 07:16:24] [INFO ] Computed and/alt/rep : 176/264/176 causal constraints (skipped 0 transitions) in 25 ms.
[2024-05-30 07:16:24] [INFO ] Added : 56 causal constraints over 12 iterations in 302 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 132 ms :[(NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 7306 reset in 241 ms.
Product exploration explored 100000 steps with 7284 reset in 248 ms.
Applying partial POR strategy [true, false, false]
Stuttering acceptance computed with spot in 117 ms :[(NOT p0), (NOT p0), (NOT p0)]
Support contains 40 out of 139 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 139/139 places, 184/184 transitions.
Performed 16 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 16 Pre rules applied. Total rules applied 0 place count 139 transition count 200
Deduced a syphon composed of 16 places in 0 ms
Iterating global reduction 0 with 16 rules applied. Total rules applied 16 place count 139 transition count 200
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: -8
Deduced a syphon composed of 24 places in 0 ms
Iterating global reduction 0 with 8 rules applied. Total rules applied 24 place count 139 transition count 208
Deduced a syphon composed of 24 places in 0 ms
Applied a total of 24 rules in 23 ms. Remains 139 /139 variables (removed 0) and now considering 208/184 (removed -24) transitions.
[2024-05-30 07:16:25] [INFO ] Redundant transitions in 15 ms returned []
Running 192 sub problems to find dead transitions.
// Phase 1: matrix 208 rows 139 cols
[2024-05-30 07:16:25] [INFO ] Computed 18 invariants in 2 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/131 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 192 unsolved
[2024-05-30 07:16:28] [INFO ] Deduced a trap composed of 66 places in 152 ms of which 26 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/131 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 192 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/131 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 192 unsolved
At refinement iteration 3 (OVERLAPS) 8/139 variables, 16/19 constraints. Problems are: Problem set: 0 solved, 192 unsolved
[2024-05-30 07:16:30] [INFO ] Deduced a trap composed of 12 places in 48 ms of which 2 ms to minimize.
[2024-05-30 07:16:30] [INFO ] Deduced a trap composed of 12 places in 37 ms of which 1 ms to minimize.
[2024-05-30 07:16:30] [INFO ] Deduced a trap composed of 12 places in 23 ms of which 0 ms to minimize.
Problem TDEAD64 is UNSAT
[2024-05-30 07:16:30] [INFO ] Deduced a trap composed of 12 places in 21 ms of which 1 ms to minimize.
Problem TDEAD65 is UNSAT
[2024-05-30 07:16:30] [INFO ] Deduced a trap composed of 12 places in 26 ms of which 1 ms to minimize.
Problem TDEAD66 is UNSAT
[2024-05-30 07:16:30] [INFO ] Deduced a trap composed of 12 places in 22 ms of which 1 ms to minimize.
Problem TDEAD67 is UNSAT
Problem TDEAD68 is UNSAT
[2024-05-30 07:16:30] [INFO ] Deduced a trap composed of 12 places in 22 ms of which 2 ms to minimize.
Problem TDEAD69 is UNSAT
Problem TDEAD70 is UNSAT
[2024-05-30 07:16:30] [INFO ] Deduced a trap composed of 12 places in 21 ms of which 1 ms to minimize.
Problem TDEAD71 is UNSAT
Problem TDEAD72 is UNSAT
Problem TDEAD73 is UNSAT
Problem TDEAD74 is UNSAT
Problem TDEAD75 is UNSAT
Problem TDEAD76 is UNSAT
Problem TDEAD77 is UNSAT
Problem TDEAD78 is UNSAT
Problem TDEAD79 is UNSAT
Problem TDEAD128 is UNSAT
Problem TDEAD129 is UNSAT
Problem TDEAD130 is UNSAT
Problem TDEAD131 is UNSAT
Problem TDEAD132 is UNSAT
Problem TDEAD133 is UNSAT
Problem TDEAD134 is UNSAT
Problem TDEAD135 is UNSAT
Problem TDEAD136 is UNSAT
Problem TDEAD137 is UNSAT
Problem TDEAD138 is UNSAT
Problem TDEAD139 is UNSAT
Problem TDEAD140 is UNSAT
Problem TDEAD141 is UNSAT
Problem TDEAD142 is UNSAT
Problem TDEAD143 is UNSAT
Problem TDEAD144 is UNSAT
Problem TDEAD145 is UNSAT
Problem TDEAD146 is UNSAT
Problem TDEAD147 is UNSAT
Problem TDEAD148 is UNSAT
Problem TDEAD149 is UNSAT
Problem TDEAD150 is UNSAT
Problem TDEAD151 is UNSAT
Problem TDEAD152 is UNSAT
Problem TDEAD153 is UNSAT
Problem TDEAD154 is UNSAT
Problem TDEAD155 is UNSAT
Problem TDEAD156 is UNSAT
Problem TDEAD157 is UNSAT
Problem TDEAD158 is UNSAT
Problem TDEAD159 is UNSAT
At refinement iteration 4 (INCLUDED_ONLY) 0/139 variables, 8/27 constraints. Problems are: Problem set: 48 solved, 144 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/139 variables, 0/27 constraints. Problems are: Problem set: 48 solved, 144 unsolved
At refinement iteration 6 (OVERLAPS) 208/347 variables, 139/166 constraints. Problems are: Problem set: 48 solved, 144 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/347 variables, 0/166 constraints. Problems are: Problem set: 48 solved, 144 unsolved
At refinement iteration 8 (OVERLAPS) 0/347 variables, 0/166 constraints. Problems are: Problem set: 48 solved, 144 unsolved
No progress, stopping.
After SMT solving in domain Real declared 347/347 variables, and 166 constraints, problems are : Problem set: 48 solved, 144 unsolved in 9295 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, State Equation: 139/139 constraints, PredecessorRefiner: 192/192 constraints, Known Traps: 9/9 constraints]
Escalating to Integer solving :Problem set: 48 solved, 144 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/107 variables, 1/1 constraints. Problems are: Problem set: 48 solved, 144 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/107 variables, 0/1 constraints. Problems are: Problem set: 48 solved, 144 unsolved
At refinement iteration 2 (OVERLAPS) 32/139 variables, 18/19 constraints. Problems are: Problem set: 48 solved, 144 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/139 variables, 8/27 constraints. Problems are: Problem set: 48 solved, 144 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/139 variables, 0/27 constraints. Problems are: Problem set: 48 solved, 144 unsolved
At refinement iteration 5 (OVERLAPS) 208/347 variables, 139/166 constraints. Problems are: Problem set: 48 solved, 144 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/347 variables, 144/310 constraints. Problems are: Problem set: 48 solved, 144 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/347 variables, 0/310 constraints. Problems are: Problem set: 48 solved, 144 unsolved
At refinement iteration 8 (OVERLAPS) 0/347 variables, 0/310 constraints. Problems are: Problem set: 48 solved, 144 unsolved
No progress, stopping.
After SMT solving in domain Int declared 347/347 variables, and 310 constraints, problems are : Problem set: 48 solved, 144 unsolved in 7182 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, State Equation: 139/139 constraints, PredecessorRefiner: 144/192 constraints, Known Traps: 9/9 constraints]
After SMT, in 16629ms problems are : Problem set: 48 solved, 144 unsolved
Search for dead transitions found 48 dead transitions in 16635ms
Found 48 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 48 transitions
Dead transitions reduction (with SMT) removed 48 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 139/139 places, 160/184 transitions.
Graph (complete) has 304 edges and 139 vertex of which 115 are kept as prefixes of interest. Removing 24 places using SCC suffix rule.3 ms
Discarding 24 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 9 ms. Remains 115 /139 variables (removed 24) and now considering 160/160 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 115/139 places, 160/184 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 16702 ms. Remains : 115/139 places, 160/184 transitions.
Support contains 40 out of 139 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 139/139 places, 184/184 transitions.
Applied a total of 0 rules in 1 ms. Remains 139 /139 variables (removed 0) and now considering 184/184 (removed 0) transitions.
// Phase 1: matrix 184 rows 139 cols
[2024-05-30 07:16:42] [INFO ] Computed 18 invariants in 1 ms
[2024-05-30 07:16:42] [INFO ] Implicit Places using invariants in 101 ms returned []
[2024-05-30 07:16:42] [INFO ] Invariant cache hit.
[2024-05-30 07:16:42] [INFO ] Implicit Places using invariants and state equation in 220 ms returned []
Implicit Place search using SMT with State Equation took 323 ms to find 0 implicit places.
Running 176 sub problems to find dead transitions.
[2024-05-30 07:16:42] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/131 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/131 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 2 (OVERLAPS) 8/139 variables, 16/18 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/139 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 4 (OVERLAPS) 184/323 variables, 139/157 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/323 variables, 0/157 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 6 (OVERLAPS) 0/323 variables, 0/157 constraints. Problems are: Problem set: 0 solved, 176 unsolved
No progress, stopping.
After SMT solving in domain Real declared 323/323 variables, and 157 constraints, problems are : Problem set: 0 solved, 176 unsolved in 6585 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, State Equation: 139/139 constraints, PredecessorRefiner: 176/176 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 176 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/131 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/131 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 2 (OVERLAPS) 8/139 variables, 16/18 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/139 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 4 (OVERLAPS) 184/323 variables, 139/157 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/323 variables, 176/333 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/323 variables, 0/333 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 7 (OVERLAPS) 0/323 variables, 0/333 constraints. Problems are: Problem set: 0 solved, 176 unsolved
No progress, stopping.
After SMT solving in domain Int declared 323/323 variables, and 333 constraints, problems are : Problem set: 0 solved, 176 unsolved in 8607 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, State Equation: 139/139 constraints, PredecessorRefiner: 176/176 constraints, Known Traps: 0/0 constraints]
After SMT, in 15270ms problems are : Problem set: 0 solved, 176 unsolved
Search for dead transitions found 0 dead transitions in 15272ms
Finished structural reductions in LTL mode , in 1 iterations and 15597 ms. Remains : 139/139 places, 184/184 transitions.
Treatment of property UtilityControlRoom-COL-Z2T3N08-LTLCardinality-10 finished in 53560 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(p0)||G(p1))))'
Support contains 26 out of 140 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 140/140 places, 184/184 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 124 transition count 168
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 124 transition count 168
Applied a total of 32 rules in 4 ms. Remains 124 /140 variables (removed 16) and now considering 168/184 (removed 16) transitions.
// Phase 1: matrix 168 rows 124 cols
[2024-05-30 07:16:58] [INFO ] Computed 19 invariants in 2 ms
[2024-05-30 07:16:58] [INFO ] Implicit Places using invariants in 80 ms returned [83]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 83 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 123/140 places, 168/184 transitions.
Applied a total of 0 rules in 2 ms. Remains 123 /123 variables (removed 0) and now considering 168/168 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 89 ms. Remains : 123/140 places, 168/184 transitions.
Stuttering acceptance computed with spot in 196 ms :[true, (NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), (NOT p1)]
Running random walk in product with property : UtilityControlRoom-COL-Z2T3N08-LTLCardinality-11
Entered a terminal (fully accepting) state of product in 7 steps with 0 reset in 0 ms.
FORMULA UtilityControlRoom-COL-Z2T3N08-LTLCardinality-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property UtilityControlRoom-COL-Z2T3N08-LTLCardinality-11 finished in 301 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(G(p0)) U G((p0||X(p1))))))'
Support contains 64 out of 140 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 140/140 places, 184/184 transitions.
Applied a total of 0 rules in 1 ms. Remains 140 /140 variables (removed 0) and now considering 184/184 (removed 0) transitions.
// Phase 1: matrix 184 rows 140 cols
[2024-05-30 07:16:58] [INFO ] Computed 19 invariants in 1 ms
[2024-05-30 07:16:58] [INFO ] Implicit Places using invariants in 88 ms returned [99]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 90 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 139/140 places, 184/184 transitions.
Applied a total of 0 rules in 1 ms. Remains 139 /139 variables (removed 0) and now considering 184/184 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 95 ms. Remains : 139/140 places, 184/184 transitions.
Stuttering acceptance computed with spot in 144 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), (NOT p0)]
Running random walk in product with property : UtilityControlRoom-COL-Z2T3N08-LTLCardinality-13
Product exploration explored 100000 steps with 0 reset in 311 ms.
Stack based approach found an accepted trace after 3296 steps with 0 reset with depth 3297 and stack size 3297 in 12 ms.
FORMULA UtilityControlRoom-COL-Z2T3N08-LTLCardinality-13 FALSE TECHNIQUES STACK_TEST
Treatment of property UtilityControlRoom-COL-Z2T3N08-LTLCardinality-13 finished in 585 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((X(F(p0)) U (p1 U (F(p2) U p0)))))'
Support contains 1 out of 140 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 140/140 places, 184/184 transitions.
Performed 32 Post agglomeration using F-continuation condition.Transition count delta: 32
Iterating post reduction 0 with 32 rules applied. Total rules applied 32 place count 140 transition count 152
Reduce places removed 32 places and 0 transitions.
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Iterating post reduction 1 with 48 rules applied. Total rules applied 80 place count 108 transition count 136
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
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 96 place count 100 transition count 128
Applied a total of 96 rules in 13 ms. Remains 100 /140 variables (removed 40) and now considering 128/184 (removed 56) transitions.
// Phase 1: matrix 128 rows 100 cols
[2024-05-30 07:16:59] [INFO ] Computed 19 invariants in 1 ms
[2024-05-30 07:16:59] [INFO ] Implicit Places using invariants in 82 ms returned [59]
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 : 99/140 places, 128/184 transitions.
Applied a total of 0 rules in 4 ms. Remains 99 /99 variables (removed 0) and now considering 128/128 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 103 ms. Remains : 99/140 places, 128/184 transitions.
Stuttering acceptance computed with spot in 91 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : UtilityControlRoom-COL-Z2T3N08-LTLCardinality-14
Product exploration explored 100000 steps with 41 reset in 164 ms.
Stack based approach found an accepted trace after 2874 steps with 1 reset with depth 1556 and stack size 1556 in 5 ms.
FORMULA UtilityControlRoom-COL-Z2T3N08-LTLCardinality-14 FALSE TECHNIQUES STACK_TEST
Treatment of property UtilityControlRoom-COL-Z2T3N08-LTLCardinality-14 finished in 395 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||X(F(p1)))))'
Support contains 42 out of 140 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 140/140 places, 184/184 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 124 transition count 168
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 124 transition count 168
Applied a total of 32 rules in 3 ms. Remains 124 /140 variables (removed 16) and now considering 168/184 (removed 16) transitions.
// Phase 1: matrix 168 rows 124 cols
[2024-05-30 07:16:59] [INFO ] Computed 19 invariants in 1 ms
[2024-05-30 07:16:59] [INFO ] Implicit Places using invariants in 117 ms returned [83]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 119 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 123/140 places, 168/184 transitions.
Applied a total of 0 rules in 1 ms. Remains 123 /123 variables (removed 0) and now considering 168/168 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 124 ms. Remains : 123/140 places, 168/184 transitions.
Stuttering acceptance computed with spot in 99 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : UtilityControlRoom-COL-Z2T3N08-LTLCardinality-15
Product exploration explored 100000 steps with 8840 reset in 256 ms.
Product exploration explored 100000 steps with 8803 reset in 271 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 (AND (NOT p0) (NOT p1))), (X (NOT p0)), (X (NOT p1)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 7 factoid took 105 ms. Reduced automaton from 2 states, 2 edges and 2 AP (stutter sensitive) to 5 states, 11 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 227 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
RANDOM walk for 282 steps (0 resets) in 8 ms. (31 steps per ms) remains 0/6 properties
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (AND (NOT p0) (NOT p1))), (X (NOT p0)), (X (NOT p1)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : [(F p0), (F (NOT (OR (NOT p0) p1))), (F p1), (F (NOT (OR p0 (NOT p1)))), (F (NOT (AND (NOT p0) (NOT p1)))), (F (NOT (OR (NOT p0) (NOT p1))))]
Knowledge based reduction with 7 factoid took 435 ms. Reduced automaton from 5 states, 11 edges and 2 AP (stutter insensitive) to 5 states, 11 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 246 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 250 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
// Phase 1: matrix 168 rows 123 cols
[2024-05-30 07:17:01] [INFO ] Computed 18 invariants in 2 ms
[2024-05-30 07:17:01] [INFO ] [Real]Absence check using 18 positive place invariants in 15 ms returned sat
[2024-05-30 07:17:01] [INFO ] [Real]Absence check using state equation in 138 ms returned sat
[2024-05-30 07:17:01] [INFO ] Solution in real domain found non-integer solution.
[2024-05-30 07:17:02] [INFO ] [Nat]Absence check using 18 positive place invariants in 17 ms returned sat
[2024-05-30 07:17:02] [INFO ] [Nat]Absence check using state equation in 147 ms returned sat
[2024-05-30 07:17:02] [INFO ] Computed and/alt/rep : 160/248/160 causal constraints (skipped 0 transitions) in 16 ms.
[2024-05-30 07:17:02] [INFO ] Added : 17 causal constraints over 4 iterations in 101 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p1))
Support contains 42 out of 123 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 123/123 places, 168/168 transitions.
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
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 115 transition count 160
Applied a total of 16 rules in 8 ms. Remains 115 /123 variables (removed 8) and now considering 160/168 (removed 8) transitions.
// Phase 1: matrix 160 rows 115 cols
[2024-05-30 07:17:02] [INFO ] Computed 18 invariants in 1 ms
[2024-05-30 07:17:02] [INFO ] Implicit Places using invariants in 142 ms returned [82]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 144 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 114/123 places, 160/168 transitions.
Applied a total of 0 rules in 4 ms. Remains 114 /114 variables (removed 0) and now considering 160/160 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 157 ms. Remains : 114/123 places, 160/168 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)), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND p0 p1))), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND p0 (NOT p1)))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND p0 p1)))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 13 factoid took 199 ms. Reduced automaton from 5 states, 11 edges and 2 AP (stutter insensitive) to 5 states, 11 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 296 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
RANDOM walk for 223 steps (0 resets) in 9 ms. (22 steps per ms) remains 0/6 properties
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND p0 p1))), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND p0 (NOT p1)))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND p0 p1)))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : [(F p0), (F (NOT (OR (NOT p0) p1))), (F p1), (F (NOT (OR p0 (NOT p1)))), (F (NOT (AND (NOT p0) (NOT p1)))), (F (NOT (OR (NOT p0) (NOT p1))))]
Knowledge based reduction with 13 factoid took 431 ms. Reduced automaton from 5 states, 11 edges and 2 AP (stutter insensitive) to 5 states, 11 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 223 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 230 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
// Phase 1: matrix 160 rows 114 cols
[2024-05-30 07:17:04] [INFO ] Computed 17 invariants in 1 ms
[2024-05-30 07:17:04] [INFO ] [Real]Absence check using 17 positive place invariants in 11 ms returned sat
[2024-05-30 07:17:04] [INFO ] [Real]Absence check using state equation in 105 ms returned sat
[2024-05-30 07:17:04] [INFO ] Solution in real domain found non-integer solution.
[2024-05-30 07:17:04] [INFO ] [Nat]Absence check using 17 positive place invariants in 12 ms returned sat
[2024-05-30 07:17:04] [INFO ] [Nat]Absence check using state equation in 134 ms returned sat
[2024-05-30 07:17:04] [INFO ] Computed and/alt/rep : 152/232/152 causal constraints (skipped 0 transitions) in 21 ms.
[2024-05-30 07:17:04] [INFO ] Added : 17 causal constraints over 4 iterations in 117 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p1))
Stuttering acceptance computed with spot in 224 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 8786 reset in 449 ms.
Product exploration explored 100000 steps with 8794 reset in 370 ms.
Support contains 42 out of 114 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 114/114 places, 160/160 transitions.
Applied a total of 0 rules in 3 ms. Remains 114 /114 variables (removed 0) and now considering 160/160 (removed 0) transitions.
[2024-05-30 07:17:05] [INFO ] Invariant cache hit.
[2024-05-30 07:17:05] [INFO ] Implicit Places using invariants in 63 ms returned []
[2024-05-30 07:17:05] [INFO ] Invariant cache hit.
[2024-05-30 07:17:06] [INFO ] Implicit Places using invariants and state equation in 125 ms returned []
Implicit Place search using SMT with State Equation took 194 ms to find 0 implicit places.
[2024-05-30 07:17:06] [INFO ] Redundant transitions in 5 ms returned []
Running 152 sub problems to find dead transitions.
[2024-05-30 07:17:06] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/106 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/106 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 2 (OVERLAPS) 8/114 variables, 16/17 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/114 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 4 (OVERLAPS) 160/274 variables, 114/131 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/274 variables, 0/131 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 6 (OVERLAPS) 0/274 variables, 0/131 constraints. Problems are: Problem set: 0 solved, 152 unsolved
No progress, stopping.
After SMT solving in domain Real declared 274/274 variables, and 131 constraints, problems are : Problem set: 0 solved, 152 unsolved in 6203 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, State Equation: 114/114 constraints, PredecessorRefiner: 152/152 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 152 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/106 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/106 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 2 (OVERLAPS) 8/114 variables, 16/17 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/114 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 4 (OVERLAPS) 160/274 variables, 114/131 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/274 variables, 152/283 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/274 variables, 0/283 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 7 (OVERLAPS) 0/274 variables, 0/283 constraints. Problems are: Problem set: 0 solved, 152 unsolved
No progress, stopping.
After SMT solving in domain Int declared 274/274 variables, and 283 constraints, problems are : Problem set: 0 solved, 152 unsolved in 4847 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, State Equation: 114/114 constraints, PredecessorRefiner: 152/152 constraints, Known Traps: 0/0 constraints]
After SMT, in 11096ms problems are : Problem set: 0 solved, 152 unsolved
Search for dead transitions found 0 dead transitions in 11099ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 11309 ms. Remains : 114/114 places, 160/160 transitions.
Treatment of property UtilityControlRoom-COL-Z2T3N08-LTLCardinality-15 finished in 17825 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(p0))))'
Found a Shortening insensitive property : UtilityControlRoom-COL-Z2T3N08-LTLCardinality-10
Stuttering acceptance computed with spot in 121 ms :[(NOT p0), (NOT p0), (NOT p0)]
Support contains 40 out of 140 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 140/140 places, 184/184 transitions.
Performed 16 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 16 Pre rules applied. Total rules applied 0 place count 140 transition count 168
Deduced a syphon composed of 16 places in 0 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 0 with 32 rules applied. Total rules applied 32 place count 124 transition count 168
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
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 48 place count 116 transition count 160
Applied a total of 48 rules in 13 ms. Remains 116 /140 variables (removed 24) and now considering 160/184 (removed 24) transitions.
// Phase 1: matrix 160 rows 116 cols
[2024-05-30 07:17:17] [INFO ] Computed 19 invariants in 1 ms
[2024-05-30 07:17:17] [INFO ] Implicit Places using invariants in 161 ms returned [75]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 163 ms to find 1 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 115/140 places, 160/184 transitions.
Applied a total of 0 rules in 5 ms. Remains 115 /115 variables (removed 0) and now considering 160/160 (removed 0) transitions.
Finished structural reductions in LI_LTL mode , in 2 iterations and 183 ms. Remains : 115/140 places, 160/184 transitions.
Running random walk in product with property : UtilityControlRoom-COL-Z2T3N08-LTLCardinality-10
Product exploration explored 100000 steps with 11164 reset in 433 ms.
Stack based approach found an accepted trace after 41798 steps with 4681 reset with depth 29 and stack size 29 in 160 ms.
Treatment of property UtilityControlRoom-COL-Z2T3N08-LTLCardinality-10 finished in 1041 ms.
Length sensitive decision was in the wrong direction : Shortening insensitive + false
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||X(F(p1)))))'
Found a Shortening insensitive property : UtilityControlRoom-COL-Z2T3N08-LTLCardinality-15
Stuttering acceptance computed with spot in 69 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 42 out of 140 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 140/140 places, 184/184 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 124 transition count 168
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 124 transition count 168
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
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 48 place count 116 transition count 160
Applied a total of 48 rules in 7 ms. Remains 116 /140 variables (removed 24) and now considering 160/184 (removed 24) transitions.
// Phase 1: matrix 160 rows 116 cols
[2024-05-30 07:17:18] [INFO ] Computed 19 invariants in 3 ms
[2024-05-30 07:17:18] [INFO ] Implicit Places using invariants in 112 ms returned [82, 83]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 126 ms to find 2 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 114/140 places, 160/184 transitions.
Applied a total of 0 rules in 4 ms. Remains 114 /114 variables (removed 0) and now considering 160/160 (removed 0) transitions.
Finished structural reductions in LI_LTL mode , in 2 iterations and 138 ms. Remains : 114/140 places, 160/184 transitions.
Running random walk in product with property : UtilityControlRoom-COL-Z2T3N08-LTLCardinality-15
Product exploration explored 100000 steps with 8779 reset in 338 ms.
Product exploration explored 100000 steps with 8843 reset in 378 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 (AND (NOT p0) (NOT p1))), (X (NOT p0)), (X (NOT p1)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 7 factoid took 91 ms. Reduced automaton from 2 states, 2 edges and 2 AP (stutter sensitive) to 5 states, 11 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 165 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
RANDOM walk for 231 steps (0 resets) in 7 ms. (28 steps per ms) remains 0/6 properties
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (AND (NOT p0) (NOT p1))), (X (NOT p0)), (X (NOT p1)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : [(F p0), (F (NOT (OR (NOT p0) p1))), (F p1), (F (NOT (OR p0 (NOT p1)))), (F (NOT (AND (NOT p0) (NOT p1)))), (F (NOT (OR (NOT p0) (NOT p1))))]
Knowledge based reduction with 7 factoid took 247 ms. Reduced automaton from 5 states, 11 edges and 2 AP (stutter insensitive) to 5 states, 11 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 214 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 288 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
// Phase 1: matrix 160 rows 114 cols
[2024-05-30 07:17:20] [INFO ] Computed 17 invariants in 1 ms
[2024-05-30 07:17:20] [INFO ] [Real]Absence check using 17 positive place invariants in 10 ms returned sat
[2024-05-30 07:17:20] [INFO ] [Real]Absence check using state equation in 108 ms returned sat
[2024-05-30 07:17:20] [INFO ] Solution in real domain found non-integer solution.
[2024-05-30 07:17:20] [INFO ] [Nat]Absence check using 17 positive place invariants in 13 ms returned sat
[2024-05-30 07:17:21] [INFO ] [Nat]Absence check using state equation in 120 ms returned sat
[2024-05-30 07:17:21] [INFO ] Computed and/alt/rep : 152/232/152 causal constraints (skipped 0 transitions) in 16 ms.
[2024-05-30 07:17:21] [INFO ] Added : 17 causal constraints over 4 iterations in 95 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p1))
Support contains 42 out of 114 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 114/114 places, 160/160 transitions.
Applied a total of 0 rules in 8 ms. Remains 114 /114 variables (removed 0) and now considering 160/160 (removed 0) transitions.
[2024-05-30 07:17:21] [INFO ] Invariant cache hit.
[2024-05-30 07:17:21] [INFO ] Implicit Places using invariants in 96 ms returned []
[2024-05-30 07:17:21] [INFO ] Invariant cache hit.
[2024-05-30 07:17:21] [INFO ] Implicit Places using invariants and state equation in 195 ms returned []
Implicit Place search using SMT with State Equation took 294 ms to find 0 implicit places.
[2024-05-30 07:17:21] [INFO ] Redundant transitions in 3 ms returned []
Running 152 sub problems to find dead transitions.
[2024-05-30 07:17:21] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/106 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/106 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 2 (OVERLAPS) 8/114 variables, 16/17 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/114 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 4 (OVERLAPS) 160/274 variables, 114/131 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/274 variables, 0/131 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 6 (OVERLAPS) 0/274 variables, 0/131 constraints. Problems are: Problem set: 0 solved, 152 unsolved
No progress, stopping.
After SMT solving in domain Real declared 274/274 variables, and 131 constraints, problems are : Problem set: 0 solved, 152 unsolved in 5861 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, State Equation: 114/114 constraints, PredecessorRefiner: 152/152 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 152 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/106 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/106 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 2 (OVERLAPS) 8/114 variables, 16/17 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/114 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 4 (OVERLAPS) 160/274 variables, 114/131 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/274 variables, 152/283 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/274 variables, 0/283 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 7 (OVERLAPS) 0/274 variables, 0/283 constraints. Problems are: Problem set: 0 solved, 152 unsolved
No progress, stopping.
After SMT solving in domain Int declared 274/274 variables, and 283 constraints, problems are : Problem set: 0 solved, 152 unsolved in 4999 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, State Equation: 114/114 constraints, PredecessorRefiner: 152/152 constraints, Known Traps: 0/0 constraints]
After SMT, in 10934ms problems are : Problem set: 0 solved, 152 unsolved
Search for dead transitions found 0 dead transitions in 10938ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 11254 ms. Remains : 114/114 places, 160/160 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)), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND p0 p1))), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND p0 (NOT p1)))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND p0 p1)))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 13 factoid took 212 ms. Reduced automaton from 5 states, 11 edges and 2 AP (stutter insensitive) to 5 states, 11 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 233 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
RANDOM walk for 157 steps (0 resets) in 8 ms. (17 steps per ms) remains 0/6 properties
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND p0 p1))), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND p0 (NOT p1)))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND p0 p1)))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : [(F p0), (F (NOT (OR (NOT p0) p1))), (F p1), (F (NOT (OR p0 (NOT p1)))), (F (NOT (AND (NOT p0) (NOT p1)))), (F (NOT (OR (NOT p0) (NOT p1))))]
Knowledge based reduction with 13 factoid took 566 ms. Reduced automaton from 5 states, 11 edges and 2 AP (stutter insensitive) to 5 states, 11 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 252 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 202 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
[2024-05-30 07:17:33] [INFO ] Invariant cache hit.
[2024-05-30 07:17:34] [INFO ] [Real]Absence check using 17 positive place invariants in 14 ms returned sat
[2024-05-30 07:17:34] [INFO ] [Real]Absence check using state equation in 143 ms returned sat
[2024-05-30 07:17:34] [INFO ] Solution in real domain found non-integer solution.
[2024-05-30 07:17:34] [INFO ] [Nat]Absence check using 17 positive place invariants in 12 ms returned sat
[2024-05-30 07:17:34] [INFO ] [Nat]Absence check using state equation in 103 ms returned sat
[2024-05-30 07:17:34] [INFO ] Computed and/alt/rep : 152/232/152 causal constraints (skipped 0 transitions) in 19 ms.
[2024-05-30 07:17:34] [INFO ] Added : 17 causal constraints over 4 iterations in 92 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p1))
Stuttering acceptance computed with spot in 300 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 8860 reset in 450 ms.
Product exploration explored 100000 steps with 8801 reset in 279 ms.
Support contains 42 out of 114 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 114/114 places, 160/160 transitions.
Applied a total of 0 rules in 9 ms. Remains 114 /114 variables (removed 0) and now considering 160/160 (removed 0) transitions.
[2024-05-30 07:17:35] [INFO ] Invariant cache hit.
[2024-05-30 07:17:35] [INFO ] Implicit Places using invariants in 79 ms returned []
[2024-05-30 07:17:35] [INFO ] Invariant cache hit.
[2024-05-30 07:17:36] [INFO ] Implicit Places using invariants and state equation in 199 ms returned []
Implicit Place search using SMT with State Equation took 281 ms to find 0 implicit places.
[2024-05-30 07:17:36] [INFO ] Redundant transitions in 2 ms returned []
Running 152 sub problems to find dead transitions.
[2024-05-30 07:17:36] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/106 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/106 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 2 (OVERLAPS) 8/114 variables, 16/17 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/114 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 4 (OVERLAPS) 160/274 variables, 114/131 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/274 variables, 0/131 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 6 (OVERLAPS) 0/274 variables, 0/131 constraints. Problems are: Problem set: 0 solved, 152 unsolved
No progress, stopping.
After SMT solving in domain Real declared 274/274 variables, and 131 constraints, problems are : Problem set: 0 solved, 152 unsolved in 5222 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, State Equation: 114/114 constraints, PredecessorRefiner: 152/152 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 152 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/106 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/106 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 2 (OVERLAPS) 8/114 variables, 16/17 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/114 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 4 (OVERLAPS) 160/274 variables, 114/131 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/274 variables, 152/283 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/274 variables, 0/283 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 7 (OVERLAPS) 0/274 variables, 0/283 constraints. Problems are: Problem set: 0 solved, 152 unsolved
No progress, stopping.
After SMT solving in domain Int declared 274/274 variables, and 283 constraints, problems are : Problem set: 0 solved, 152 unsolved in 4612 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, State Equation: 114/114 constraints, PredecessorRefiner: 152/152 constraints, Known Traps: 0/0 constraints]
After SMT, in 9912ms problems are : Problem set: 0 solved, 152 unsolved
Search for dead transitions found 0 dead transitions in 9916ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 10217 ms. Remains : 114/114 places, 160/160 transitions.
Treatment of property UtilityControlRoom-COL-Z2T3N08-LTLCardinality-15 finished in 27761 ms.
[2024-05-30 07:17:46] [INFO ] Flatten gal took : 17 ms
[2024-05-30 07:17:46] [INFO ] Export to MCC of 2 properties in file /home/mcc/execution/LTLCardinality.sr.xml took 3 ms.
[2024-05-30 07:17:46] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 140 places, 184 transitions and 552 arcs took 7 ms.
Total runtime 147791 ms.
There are residual formulas that ITS could not solve within timeout
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------

Running UtilityControlRoom-COL-Z2T3N08

IS_COLORED=
IS_NUPN=

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


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


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

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

Process ID: 1671
MODEL NAME: /home/mcc/execution/414/model
140 places, 184 transitions.

Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Building monolithic NSF...
FORMULA UtilityControlRoom-COL-Z2T3N08-LTLCardinality-10 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA UtilityControlRoom-COL-Z2T3N08-LTLCardinality-15 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
Ok.
EXITCODE: 0
----------------------------------------------------------------------

BK_STOP 1717053469569

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

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

Sequence of Actions to be Executed by the VM

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

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool greatspnxred"
echo " Input is UtilityControlRoom-COL-Z2T3N08, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r443-smll-171701109600027"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/UtilityControlRoom-COL-Z2T3N08.tgz
mv UtilityControlRoom-COL-Z2T3N08 execution
cd execution
if [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "UpperBounds" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] || [ "LTLCardinality" = "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 [ "LTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLCardinality" != "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 "LTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLCardinality.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 '' LTLCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLCardinality"
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 ;