Execution Chart

Sorry, for this execution, no execution chart could be reported.

Trace from the execution

Formatting '/data/fkordon/mcc2025-input.r240-tall-174915590400747.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2025-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-5832
Executing tool itstools
Input is UtilityControlRoom-COL-Z4T4N06, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r240-tall-174915590400747
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 560K
-rw-r--r-- 1 mcc users 9.4K May 29 14:48 CTLCardinality.txt
-rw-r--r-- 1 mcc users 89K May 29 14:48 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.6K May 29 14:48 CTLFireability.txt
-rw-r--r-- 1 mcc users 63K May 29 14:48 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 29 14:48 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K May 29 14:48 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.9K May 29 14:48 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K May 29 14:48 LTLFireability.xml
-rw-r--r-- 1 mcc users 19K May 29 14:48 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 182K May 29 14:48 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.3K May 29 14:48 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 56K May 29 14:48 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.9K May 29 14:48 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.0K May 29 14:48 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 29 14:33 equiv_pt
-rw-r--r-- 1 mcc users 8 May 29 14:33 instance
-rw-r--r-- 1 mcc users 5 May 29 14:33 iscolored
-rw-r--r-- 1 mcc users 29K May 29 14:33 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

echo here is the order used to build the result vector(from xml file)
FORMULA_NAME UtilityControlRoom-COL-Z4T4N06-LTLCardinality-00
FORMULA_NAME UtilityControlRoom-COL-Z4T4N06-LTLCardinality-01
FORMULA_NAME UtilityControlRoom-COL-Z4T4N06-LTLCardinality-02
FORMULA_NAME UtilityControlRoom-COL-Z4T4N06-LTLCardinality-03
FORMULA_NAME UtilityControlRoom-COL-Z4T4N06-LTLCardinality-04
FORMULA_NAME UtilityControlRoom-COL-Z4T4N06-LTLCardinality-05
FORMULA_NAME UtilityControlRoom-COL-Z4T4N06-LTLCardinality-06
FORMULA_NAME UtilityControlRoom-COL-Z4T4N06-LTLCardinality-07
FORMULA_NAME UtilityControlRoom-COL-Z4T4N06-LTLCardinality-08
FORMULA_NAME UtilityControlRoom-COL-Z4T4N06-LTLCardinality-09
FORMULA_NAME UtilityControlRoom-COL-Z4T4N06-LTLCardinality-10
FORMULA_NAME UtilityControlRoom-COL-Z4T4N06-LTLCardinality-11
FORMULA_NAME UtilityControlRoom-COL-Z4T4N06-LTLCardinality-12
FORMULA_NAME UtilityControlRoom-COL-Z4T4N06-LTLCardinality-13
FORMULA_NAME UtilityControlRoom-COL-Z4T4N06-LTLCardinality-14
FORMULA_NAME UtilityControlRoom-COL-Z4T4N06-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1749269443020

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=UtilityControlRoom-COL-Z4T4N06
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is COL
LTLCardinality COL
Running Version 202505121319
[2025-06-07 04:10:44] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2025-06-07 04:10:44] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-07 04:10:44] [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.
[2025-06-07 04:10:45] [WARNING] Using fallBack plugin, rng conformance not checked
[2025-06-07 04:10:46] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 1626 ms
[2025-06-07 04:10:46] [INFO ] Imported 13 HL places and 12 HL transitions for a total of 228 PT places and 450.0 transition bindings in 22 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 13 ms.
Working with output stream class java.io.PrintStream
[2025-06-07 04:10:46] [INFO ] Built PT skeleton of HLPN with 13 places and 12 transitions 37 arcs in 6 ms.
[2025-06-07 04:10:46] [INFO ] Skeletonized 16 HLPN properties in 1 ms.
Initial state reduction rules removed 2 formulas.
FORMULA UtilityControlRoom-COL-Z4T4N06-LTLCardinality-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA UtilityControlRoom-COL-Z4T4N06-LTLCardinality-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 0 stabilizing places and 0 stable transitions
Remains 14 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 40004 steps (8 resets) in 460 ms. (86 steps per ms) remains 1/27 properties
BEST_FIRST walk for 40003 steps (8 resets) in 145 ms. (273 steps per ms) remains 1/1 properties
// Phase 1: matrix 11 rows 13 cols
[2025-06-07 04:10:46] [INFO ] Computed 5 invariants in 3 ms
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Problem AtomicPropp3 is UNSAT
After SMT solving in domain Real declared 11/24 variables, and 4 constraints, problems are : Problem set: 1 solved, 0 unsolved in 145 ms.
Refiners :[Positive P Invariants (semi-flows): 4/5 constraints, State Equation: 0/13 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 186ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Successfully simplified 1 atomic propositions for a total of 14 simplifications.
FORMULA UtilityControlRoom-COL-Z4T4N06-LTLCardinality-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2025-06-07 04:10:46] [INFO ] Flatten gal took : 15 ms
[2025-06-07 04:10:46] [INFO ] Flatten gal took : 3 ms
Transition timeout forces synchronizations/join behavior on parameter c of sort Cli
Domain [Cli(6), Z(4), Z(4)] of place MovetoZ breaks symmetries in sort Z
[2025-06-07 04:10:46] [INFO ] Unfolded HLPN to a Petri net with 228 places and 450 transitions 1446 arcs in 22 ms.
[2025-06-07 04:10:46] [INFO ] Unfolded 13 HLPN properties in 0 ms.
Ensure Unique test removed 96 transitions
Reduce redundant transitions removed 96 transitions.
Support contains 222 out of 228 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 228/228 places, 354/354 transitions.
Applied a total of 0 rules in 8 ms. Remains 228 /228 variables (removed 0) and now considering 354/354 (removed 0) transitions.
// Phase 1: matrix 354 rows 228 cols
[2025-06-07 04:10:46] [INFO ] Computed 15 invariants in 14 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 04:10:47] [INFO ] Implicit Places using invariants in 113 ms returned []
[2025-06-07 04:10:47] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 04:10:47] [INFO ] Implicit Places using invariants and state equation in 166 ms returned []
Implicit Place search using SMT with State Equation took 289 ms to find 0 implicit places.
Running 348 sub problems to find dead transitions.
[2025-06-07 04:10:47] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/222 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 348 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/222 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 348 unsolved
At refinement iteration 2 (OVERLAPS) 6/228 variables, 13/15 constraints. Problems are: Problem set: 0 solved, 348 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/228 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 348 unsolved
At refinement iteration 4 (OVERLAPS) 354/582 variables, 228/243 constraints. Problems are: Problem set: 0 solved, 348 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/582 variables, 0/243 constraints. Problems are: Problem set: 0 solved, 348 unsolved
At refinement iteration 6 (OVERLAPS) 0/582 variables, 0/243 constraints. Problems are: Problem set: 0 solved, 348 unsolved
No progress, stopping.
After SMT solving in domain Real declared 582/582 variables, and 243 constraints, problems are : Problem set: 0 solved, 348 unsolved in 26575 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, State Equation: 228/228 constraints, PredecessorRefiner: 348/348 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 348 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/222 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 348 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/222 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 348 unsolved
At refinement iteration 2 (OVERLAPS) 6/228 variables, 13/15 constraints. Problems are: Problem set: 0 solved, 348 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/228 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 348 unsolved
At refinement iteration 4 (OVERLAPS) 354/582 variables, 228/243 constraints. Problems are: Problem set: 0 solved, 348 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/582 variables, 348/591 constraints. Problems are: Problem set: 0 solved, 348 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 582/582 variables, and 591 constraints, problems are : Problem set: 0 solved, 348 unsolved in 30048 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, State Equation: 228/228 constraints, PredecessorRefiner: 348/348 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 56889ms problems are : Problem set: 0 solved, 348 unsolved
Search for dead transitions found 0 dead transitions in 56894ms
Finished structural reductions in LTL mode , in 1 iterations and 57203 ms. Remains : 228/228 places, 354/354 transitions.
Support contains 222 out of 228 places after structural reductions.
[2025-06-07 04:11:44] [INFO ] Flatten gal took : 58 ms
[2025-06-07 04:11:44] [INFO ] Flatten gal took : 51 ms
[2025-06-07 04:11:44] [INFO ] Input system was already deterministic with 354 transitions.
RANDOM walk for 396 steps (0 resets) in 32 ms. (12 steps per ms) remains 0/26 properties
FORMULA UtilityControlRoom-COL-Z4T4N06-LTLCardinality-05 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 0 stabilizing places and 0 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((X(F(p0))||G(p1)||(p1&&F(p2)))))'
Support contains 42 out of 228 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 228/228 places, 354/354 transitions.
Discarding 72 places :
Symmetric choice reduction at 0 with 72 rule applications. Total rules 72 place count 156 transition count 282
Iterating global reduction 0 with 72 rules applied. Total rules applied 144 place count 156 transition count 282
Applied a total of 144 rules in 15 ms. Remains 156 /228 variables (removed 72) and now considering 282/354 (removed 72) transitions.
// Phase 1: matrix 282 rows 156 cols
[2025-06-07 04:11:45] [INFO ] Computed 15 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 04:11:45] [INFO ] Implicit Places using invariants in 132 ms returned [113]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 135 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 155/228 places, 282/354 transitions.
Applied a total of 0 rules in 6 ms. Remains 155 /155 variables (removed 0) and now considering 282/282 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 157 ms. Remains : 155/228 places, 282/354 transitions.
Stuttering acceptance computed with spot in 340 ms :[(NOT p0), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1))]
Running random walk in product with property : UtilityControlRoom-COL-Z4T4N06-LTLCardinality-00
Product exploration explored 100000 steps with 50000 reset in 508 ms.
Product exploration explored 100000 steps with 50000 reset in 230 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 p2 p1), (X p2), (X p1), (X (NOT (AND p1 (NOT p2)))), (X (X p2)), (X (X (NOT (AND p1 (NOT p2) (NOT p0))))), (X (X (NOT (AND (NOT p1) (NOT p2) (NOT p0))))), (X (X p1))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0))]
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 8 factoid took 79 ms. Reduced automaton from 5 states, 7 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA UtilityControlRoom-COL-Z4T4N06-LTLCardinality-00 TRUE TECHNIQUES KNOWLEDGE
Treatment of property UtilityControlRoom-COL-Z4T4N06-LTLCardinality-00 finished in 1418 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G((p0&&(p1 U (p2||G(p1)))))))'
Support contains 144 out of 228 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 228/228 places, 354/354 transitions.
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: 12
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 0 with 24 rules applied. Total rules applied 24 place count 216 transition count 342
Applied a total of 24 rules in 29 ms. Remains 216 /228 variables (removed 12) and now considering 342/354 (removed 12) transitions.
// Phase 1: matrix 342 rows 216 cols
[2025-06-07 04:11:46] [INFO ] Computed 15 invariants in 4 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 04:11:46] [INFO ] Implicit Places using invariants in 387 ms returned [178, 179]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 396 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 214/228 places, 342/354 transitions.
Applied a total of 0 rules in 11 ms. Remains 214 /214 variables (removed 0) and now considering 342/342 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 436 ms. Remains : 214/228 places, 342/354 transitions.
Stuttering acceptance computed with spot in 37 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2)))]
Running random walk in product with property : UtilityControlRoom-COL-Z4T4N06-LTLCardinality-03
Product exploration explored 100000 steps with 0 reset in 925 ms.
Stack based approach found an accepted trace after 3094 steps with 0 reset with depth 3095 and stack size 3095 in 34 ms.
FORMULA UtilityControlRoom-COL-Z4T4N06-LTLCardinality-03 FALSE TECHNIQUES STACK_TEST
Treatment of property UtilityControlRoom-COL-Z4T4N06-LTLCardinality-03 finished in 1462 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((p0 U p1))'
Support contains 11 out of 228 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 228/228 places, 354/354 transitions.
Performed 96 Post agglomeration using F-continuation condition.Transition count delta: 96
Iterating post reduction 0 with 96 rules applied. Total rules applied 96 place count 228 transition count 258
Reduce places removed 96 places and 0 transitions.
Ensure Unique test removed 24 transitions
Reduce isomorphic transitions removed 24 transitions.
Iterating post reduction 1 with 120 rules applied. Total rules applied 216 place count 132 transition count 234
Performed 24 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 24 Pre rules applied. Total rules applied 216 place count 132 transition count 210
Deduced a syphon composed of 24 places in 1 ms
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 2 with 48 rules applied. Total rules applied 264 place count 108 transition count 210
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 276 place count 102 transition count 204
Applied a total of 276 rules in 44 ms. Remains 102 /228 variables (removed 126) and now considering 204/354 (removed 150) transitions.
// Phase 1: matrix 204 rows 102 cols
[2025-06-07 04:11:47] [INFO ] Computed 15 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 04:11:48] [INFO ] Implicit Places using invariants in 317 ms returned [59]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 325 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 101/228 places, 204/354 transitions.
Applied a total of 0 rules in 5 ms. Remains 101 /101 variables (removed 0) and now considering 204/204 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 374 ms. Remains : 101/228 places, 204/354 transitions.
Stuttering acceptance computed with spot in 50 ms :[true, (NOT p1)]
Running random walk in product with property : UtilityControlRoom-COL-Z4T4N06-LTLCardinality-04
Entered a terminal (fully accepting) state of product in 29 steps with 3 reset in 1 ms.
FORMULA UtilityControlRoom-COL-Z4T4N06-LTLCardinality-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property UtilityControlRoom-COL-Z4T4N06-LTLCardinality-04 finished in 448 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((G(p0)&&F(p1)) U X((F(p1) U X(X(p2))))))'
Support contains 40 out of 228 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 228/228 places, 354/354 transitions.
Discarding 72 places :
Symmetric choice reduction at 0 with 72 rule applications. Total rules 72 place count 156 transition count 282
Iterating global reduction 0 with 72 rules applied. Total rules applied 144 place count 156 transition count 282
Applied a total of 144 rules in 13 ms. Remains 156 /228 variables (removed 72) and now considering 282/354 (removed 72) transitions.
// Phase 1: matrix 282 rows 156 cols
[2025-06-07 04:11:48] [INFO ] Computed 15 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 04:11:48] [INFO ] Implicit Places using invariants in 108 ms returned [113]
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 : 155/228 places, 282/354 transitions.
Applied a total of 0 rules in 2 ms. Remains 155 /155 variables (removed 0) and now considering 282/282 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 135 ms. Remains : 155/228 places, 282/354 transitions.
Stuttering acceptance computed with spot in 690 ms :[(NOT p2), (NOT p2), (NOT p2), (AND p0 (NOT p1) (NOT p2)), (NOT p2), (AND (NOT p1) (NOT p2)), (NOT p2), (AND (NOT p1) (NOT p2)), (NOT p2), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p2), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p0) (NOT p2)), (NOT p1), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : UtilityControlRoom-COL-Z4T4N06-LTLCardinality-06
Product exploration explored 100000 steps with 7552 reset in 334 ms.
Product exploration explored 100000 steps with 7906 reset in 356 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) (NOT p2)), (X p0), (X (NOT (AND (NOT p0) (NOT p1)))), (X p1), (X (NOT (AND p0 (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0)), (X (X (NOT p1))), (X (X p1)), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1)))))]
Knowledge based reduction with 6 factoid took 330 ms. Reduced automaton from 16 states, 36 edges and 3 AP (stutter sensitive) to 11 states, 21 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 547 ms :[(NOT p2), (NOT p2), (NOT p2), (NOT p2), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p2), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p0) (NOT p2)), (NOT p1), (AND (NOT p1) (NOT p0))]
RANDOM walk for 2047 steps (0 resets) in 24 ms. (81 steps per ms) remains 0/10 properties
Knowledge obtained : [(AND p0 (NOT p1) (NOT p2)), (X p0), (X (NOT (AND (NOT p0) (NOT p1)))), (X p1), (X (NOT (AND p0 (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0)), (X (X (NOT p1))), (X (X p1)), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (F (NOT (AND (NOT p2) (NOT p1)))), (F (NOT (OR p2 p0 p1))), (F (NOT (AND (NOT p2) p0 (NOT p1)))), (F p2), (F (NOT p0)), (F (NOT (AND (NOT p2) p0))), (F (NOT (OR p2 p0))), (F p1), (F (NOT (OR p0 p1))), (F (NOT (AND p0 (NOT p1))))]
Knowledge based reduction with 6 factoid took 596 ms. Reduced automaton from 11 states, 21 edges and 3 AP (stutter sensitive) to 11 states, 21 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 412 ms :[(NOT p2), (NOT p2), (NOT p2), (NOT p2), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p2), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p0) (NOT p2)), (NOT p1), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 398 ms :[(NOT p2), (NOT p2), (NOT p2), (NOT p2), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p2), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p0) (NOT p2)), (NOT p1), (AND (NOT p1) (NOT p0))]
// Phase 1: matrix 282 rows 155 cols
[2025-06-07 04:11:52] [INFO ] Computed 14 invariants in 1 ms
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-07 04:11:52] [INFO ] [Real]Absence check using 14 positive place invariants in 25 ms returned unsat
Proved EG (NOT p2)
Knowledge obtained : [(AND p0 (NOT p1) (NOT p2)), (X p0), (X (NOT (AND (NOT p0) (NOT p1)))), (X p1), (X (NOT (AND p0 (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0)), (X (X (NOT p1))), (X (X p1)), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (F (NOT (AND (NOT p2) (NOT p1)))), (F (NOT (OR p2 p0 p1))), (F (NOT (AND (NOT p2) p0 (NOT p1)))), (F p2), (F (NOT p0)), (F (NOT (AND (NOT p2) p0))), (F (NOT (OR p2 p0))), (F p1), (F (NOT (OR p0 p1))), (F (NOT (AND p0 (NOT p1)))), (G (NOT p2))]
Property proved to be false thanks to negative knowledge :(G (NOT p2))
Knowledge based reduction with 6 factoid took 590 ms. Reduced automaton from 11 states, 21 edges and 3 AP (stutter sensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA UtilityControlRoom-COL-Z4T4N06-LTLCardinality-06 FALSE TECHNIQUES KNOWLEDGE
Treatment of property UtilityControlRoom-COL-Z4T4N06-LTLCardinality-06 finished in 4666 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(((p0&&X(F(p1))) U X(p2))))'
Support contains 67 out of 228 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 228/228 places, 354/354 transitions.
Discarding 72 places :
Symmetric choice reduction at 0 with 72 rule applications. Total rules 72 place count 156 transition count 282
Iterating global reduction 0 with 72 rules applied. Total rules applied 144 place count 156 transition count 282
Applied a total of 144 rules in 6 ms. Remains 156 /228 variables (removed 72) and now considering 282/354 (removed 72) transitions.
// Phase 1: matrix 282 rows 156 cols
[2025-06-07 04:11:52] [INFO ] Computed 15 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 04:11:53] [INFO ] Implicit Places using invariants in 173 ms returned [113]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 174 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 155/228 places, 282/354 transitions.
Applied a total of 0 rules in 1 ms. Remains 155 /155 variables (removed 0) and now considering 282/282 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 182 ms. Remains : 155/228 places, 282/354 transitions.
Stuttering acceptance computed with spot in 265 ms :[(NOT p2), (NOT p2), (NOT p2), (NOT p2), true, (NOT p1)]
Running random walk in product with property : UtilityControlRoom-COL-Z4T4N06-LTLCardinality-07
Entered a terminal (fully accepting) state of product in 163 steps with 26 reset in 1 ms.
FORMULA UtilityControlRoom-COL-Z4T4N06-LTLCardinality-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property UtilityControlRoom-COL-Z4T4N06-LTLCardinality-07 finished in 466 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(!p0)))'
Support contains 24 out of 228 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 228/228 places, 354/354 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 96 transitions
Trivial Post-agglo rules discarded 96 transitions
Performed 96 trivial Post agglomeration. Transition count delta: 96
Iterating post reduction 0 with 96 rules applied. Total rules applied 96 place count 228 transition count 258
Reduce places removed 96 places and 0 transitions.
Ensure Unique test removed 24 transitions
Reduce isomorphic transitions removed 24 transitions.
Iterating post reduction 1 with 120 rules applied. Total rules applied 216 place count 132 transition count 234
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 219 place count 129 transition count 162
Iterating global reduction 2 with 3 rules applied. Total rules applied 222 place count 129 transition count 162
Discarding 18 places :
Symmetric choice reduction at 2 with 18 rule applications. Total rules 240 place count 111 transition count 144
Iterating global reduction 2 with 18 rules applied. Total rules applied 258 place count 111 transition count 144
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: 12
Deduced a syphon composed of 12 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 2 with 25 rules applied. Total rules applied 283 place count 98 transition count 132
Applied a total of 283 rules in 29 ms. Remains 98 /228 variables (removed 130) and now considering 132/354 (removed 222) transitions.
// Phase 1: matrix 132 rows 98 cols
[2025-06-07 04:11:53] [INFO ] Computed 14 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 04:11:53] [INFO ] Implicit Places using invariants in 93 ms returned [79]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 95 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 97/228 places, 132/354 transitions.
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 0 with 12 rules applied. Total rules applied 12 place count 91 transition count 126
Applied a total of 12 rules in 5 ms. Remains 91 /97 variables (removed 6) and now considering 126/132 (removed 6) transitions.
// Phase 1: matrix 126 rows 91 cols
[2025-06-07 04:11:53] [INFO ] Computed 13 invariants in 0 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 04:11:53] [INFO ] Implicit Places using invariants in 68 ms returned []
[2025-06-07 04:11:53] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 04:11:53] [INFO ] Implicit Places using invariants and state equation in 105 ms returned []
Implicit Place search using SMT with State Equation took 183 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 91/228 places, 126/354 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 313 ms. Remains : 91/228 places, 126/354 transitions.
Stuttering acceptance computed with spot in 60 ms :[p0, p0]
Running random walk in product with property : UtilityControlRoom-COL-Z4T4N06-LTLCardinality-08
Product exploration explored 100000 steps with 3372 reset in 222 ms.
Stack based approach found an accepted trace after 261 steps with 8 reset with depth 19 and stack size 19 in 1 ms.
FORMULA UtilityControlRoom-COL-Z4T4N06-LTLCardinality-08 FALSE TECHNIQUES STACK_TEST
Treatment of property UtilityControlRoom-COL-Z4T4N06-LTLCardinality-08 finished in 606 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((G(p0)||F((G(F(p1))||(!p0&&F(p1))))) U G(p2)))'
Support contains 168 out of 228 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 228/228 places, 354/354 transitions.
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 0 with 12 rules applied. Total rules applied 12 place count 222 transition count 348
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 0 with 13 rules applied. Total rules applied 25 place count 215 transition count 342
Applied a total of 25 rules in 23 ms. Remains 215 /228 variables (removed 13) and now considering 342/354 (removed 12) transitions.
// Phase 1: matrix 342 rows 215 cols
[2025-06-07 04:11:54] [INFO ] Computed 14 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 04:11:54] [INFO ] Implicit Places using invariants in 248 ms returned [178]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 258 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 214/228 places, 342/354 transitions.
Applied a total of 0 rules in 5 ms. Remains 214 /214 variables (removed 0) and now considering 342/342 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 286 ms. Remains : 214/228 places, 342/354 transitions.
Stuttering acceptance computed with spot in 137 ms :[(NOT p2), (AND (NOT p1) p2 (NOT p0)), (NOT p1), (AND (NOT p1) (NOT p2) p0)]
Running random walk in product with property : UtilityControlRoom-COL-Z4T4N06-LTLCardinality-10
Product exploration explored 100000 steps with 11661 reset in 1242 ms.
Product exploration explored 100000 steps with 11691 reset in 1270 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 p2 p0 (NOT p1)), (X p2), (X (NOT (AND (NOT p2) p0))), (X (NOT (AND (NOT p2) (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p2) p0 (NOT p1)))), (X (AND p2 p0)), (X (AND p2 p0 (NOT p1))), (X (NOT (AND p2 (NOT p0) (NOT p1)))), (X p0), (X (NOT p1)), (X (X (NOT (AND (NOT p2) (NOT p0) (NOT p1))))), (X (X (NOT (AND p2 (NOT p0) (NOT p1))))), (X (X p0)), (X (X (NOT p1)))]
False Knowledge obtained : [(X (X p2)), (X (X (NOT p2))), (X (X (AND (NOT p2) p0))), (X (X (NOT (AND (NOT p2) p0)))), (X (X (AND (NOT p2) p0 (NOT p1)))), (X (X (NOT (AND (NOT p2) p0 (NOT p1))))), (X (X (AND p2 p0))), (X (X (NOT (AND p2 p0)))), (X (X (AND p2 p0 (NOT p1)))), (X (X (NOT (AND p2 p0 (NOT p1)))))]
Knowledge based reduction with 14 factoid took 356 ms. Reduced automaton from 4 states, 10 edges and 3 AP (stutter insensitive) to 4 states, 10 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 118 ms :[(NOT p2), (AND (NOT p1) p2 (NOT p0)), (NOT p1), (AND (NOT p1) (NOT p2) p0)]
RANDOM walk for 175 steps (0 resets) in 7 ms. (21 steps per ms) remains 0/9 properties
Knowledge obtained : [(AND p2 p0 (NOT p1)), (X p2), (X (NOT (AND (NOT p2) p0))), (X (NOT (AND (NOT p2) (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p2) p0 (NOT p1)))), (X (AND p2 p0)), (X (AND p2 p0 (NOT p1))), (X (NOT (AND p2 (NOT p0) (NOT p1)))), (X p0), (X (NOT p1)), (X (X (NOT (AND (NOT p2) (NOT p0) (NOT p1))))), (X (X (NOT (AND p2 (NOT p0) (NOT p1))))), (X (X p0)), (X (X (NOT p1)))]
False Knowledge obtained : [(X (X p2)), (X (X (NOT p2))), (X (X (AND (NOT p2) p0))), (X (X (NOT (AND (NOT p2) p0)))), (X (X (AND (NOT p2) p0 (NOT p1)))), (X (X (NOT (AND (NOT p2) p0 (NOT p1))))), (X (X (AND p2 p0))), (X (X (NOT (AND p2 p0)))), (X (X (AND p2 p0 (NOT p1)))), (X (X (NOT (AND p2 p0 (NOT p1))))), (F (NOT (AND p0 p2 (NOT p1)))), (F (NOT (OR (NOT p0) p2 p1))), (F (NOT p0)), (F (NOT (OR (NOT p0) p2))), (F (NOT p2)), (F (NOT (OR p0 p2 p1))), (F (NOT (OR p0 (NOT p2) p1))), (F p1), (F (NOT (AND p0 p2)))]
Knowledge based reduction with 14 factoid took 679 ms. Reduced automaton from 4 states, 10 edges and 3 AP (stutter insensitive) to 4 states, 10 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 135 ms :[(NOT p2), (AND (NOT p1) p2 (NOT p0)), (NOT p1), (AND (NOT p1) (NOT p2) p0)]
Stuttering acceptance computed with spot in 137 ms :[(NOT p2), (AND (NOT p1) p2 (NOT p0)), (NOT p1), (AND (NOT p1) (NOT p2) p0)]
Support contains 168 out of 214 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 214/214 places, 342/342 transitions.
Applied a total of 0 rules in 5 ms. Remains 214 /214 variables (removed 0) and now considering 342/342 (removed 0) transitions.
// Phase 1: matrix 342 rows 214 cols
[2025-06-07 04:11:58] [INFO ] Computed 13 invariants in 8 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 04:11:58] [INFO ] Implicit Places using invariants in 174 ms returned []
[2025-06-07 04:11:58] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 04:11:58] [INFO ] Implicit Places using invariants and state equation in 232 ms returned []
Implicit Place search using SMT with State Equation took 443 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-07 04:11:58] [INFO ] Redundant transitions in 17 ms returned []
Running 312 sub problems to find dead transitions.
[2025-06-07 04:11:58] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/208 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 312 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/208 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 312 unsolved
At refinement iteration 2 (OVERLAPS) 6/214 variables, 6/13 constraints. Problems are: Problem set: 0 solved, 312 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/214 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 312 unsolved
At refinement iteration 4 (OVERLAPS) 342/556 variables, 214/227 constraints. Problems are: Problem set: 0 solved, 312 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/556 variables, 0/227 constraints. Problems are: Problem set: 0 solved, 312 unsolved
At refinement iteration 6 (OVERLAPS) 0/556 variables, 0/227 constraints. Problems are: Problem set: 0 solved, 312 unsolved
No progress, stopping.
After SMT solving in domain Real declared 556/556 variables, and 227 constraints, problems are : Problem set: 0 solved, 312 unsolved in 20176 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, State Equation: 214/214 constraints, PredecessorRefiner: 312/312 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 312 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/208 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 312 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/208 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 312 unsolved
At refinement iteration 2 (OVERLAPS) 6/214 variables, 6/13 constraints. Problems are: Problem set: 0 solved, 312 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/214 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 312 unsolved
At refinement iteration 4 (OVERLAPS) 342/556 variables, 214/227 constraints. Problems are: Problem set: 0 solved, 312 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/556 variables, 312/539 constraints. Problems are: Problem set: 0 solved, 312 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/556 variables, 0/539 constraints. Problems are: Problem set: 0 solved, 312 unsolved
At refinement iteration 7 (OVERLAPS) 0/556 variables, 0/539 constraints. Problems are: Problem set: 0 solved, 312 unsolved
No progress, stopping.
After SMT solving in domain Int declared 556/556 variables, and 539 constraints, problems are : Problem set: 0 solved, 312 unsolved in 30011 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, State Equation: 214/214 constraints, PredecessorRefiner: 312/312 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 50299ms problems are : Problem set: 0 solved, 312 unsolved
Search for dead transitions found 0 dead transitions in 50300ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 50772 ms. Remains : 214/214 places, 342/342 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 p2 p0 (NOT p1)), (X p2), (X (NOT (AND (NOT p0) p2 (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p2) (NOT p1)))), (X (NOT (AND p0 (NOT p2) (NOT p1)))), (X (AND p0 p2 (NOT p1))), (X (NOT (AND p0 (NOT p2)))), (X p0), (X (AND p0 p2)), (X (NOT p1)), (X (X (NOT (AND (NOT p0) p2 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1))))), (X (X p0)), (X (X (NOT p1)))]
False Knowledge obtained : [(X (X p2)), (X (X (NOT p2))), (X (X (AND p0 (NOT p2) (NOT p1)))), (X (X (NOT (AND p0 (NOT p2) (NOT p1))))), (X (X (AND p0 p2 (NOT p1)))), (X (X (NOT (AND p0 p2 (NOT p1))))), (X (X (AND p0 (NOT p2)))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (AND p0 p2))), (X (X (NOT (AND p0 p2))))]
Knowledge based reduction with 14 factoid took 503 ms. Reduced automaton from 4 states, 10 edges and 3 AP (stutter insensitive) to 4 states, 10 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 174 ms :[(NOT p2), (AND (NOT p1) p2 (NOT p0)), (NOT p1), (AND (NOT p1) (NOT p2) p0)]
RANDOM walk for 309 steps (0 resets) in 11 ms. (25 steps per ms) remains 0/9 properties
Knowledge obtained : [(AND p2 p0 (NOT p1)), (X p2), (X (NOT (AND (NOT p0) p2 (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p2) (NOT p1)))), (X (NOT (AND p0 (NOT p2) (NOT p1)))), (X (AND p0 p2 (NOT p1))), (X (NOT (AND p0 (NOT p2)))), (X p0), (X (AND p0 p2)), (X (NOT p1)), (X (X (NOT (AND (NOT p0) p2 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1))))), (X (X p0)), (X (X (NOT p1)))]
False Knowledge obtained : [(X (X p2)), (X (X (NOT p2))), (X (X (AND p0 (NOT p2) (NOT p1)))), (X (X (NOT (AND p0 (NOT p2) (NOT p1))))), (X (X (AND p0 p2 (NOT p1)))), (X (X (NOT (AND p0 p2 (NOT p1))))), (X (X (AND p0 (NOT p2)))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (AND p0 p2))), (X (X (NOT (AND p0 p2)))), (F (NOT (AND p0 p2 (NOT p1)))), (F (NOT (OR (NOT p0) p2 p1))), (F (NOT p0)), (F (NOT (OR (NOT p0) p2))), (F (NOT p2)), (F (NOT (OR p0 p2 p1))), (F (NOT (OR p0 (NOT p2) p1))), (F p1), (F (NOT (AND p0 p2)))]
Knowledge based reduction with 14 factoid took 788 ms. Reduced automaton from 4 states, 10 edges and 3 AP (stutter insensitive) to 4 states, 10 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 192 ms :[(NOT p2), (AND (NOT p1) p2 (NOT p0)), (NOT p1), (AND (NOT p1) (NOT p2) p0)]
Stuttering acceptance computed with spot in 168 ms :[(NOT p2), (AND (NOT p1) p2 (NOT p0)), (NOT p1), (AND (NOT p1) (NOT p2) p0)]
Stuttering acceptance computed with spot in 171 ms :[(NOT p2), (AND (NOT p1) p2 (NOT p0)), (NOT p1), (AND (NOT p1) (NOT p2) p0)]
Product exploration explored 100000 steps with 11595 reset in 985 ms.
Product exploration explored 100000 steps with 11600 reset in 1000 ms.
Built C files in :
/tmp/ltsmin6295321470159997461
[2025-06-07 04:12:53] [INFO ] Computing symmetric may disable matrix : 342 transitions.
[2025-06-07 04:12:53] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-07 04:12:53] [INFO ] Computing symmetric may enable matrix : 342 transitions.
[2025-06-07 04:12:53] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-07 04:12:53] [INFO ] Computing Do-Not-Accords matrix : 342 transitions.
[2025-06-07 04:12:53] [INFO ] Computation of Completed DNA matrix. took 8 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-07 04:12:53] [INFO ] Built C files in 65ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6295321470159997461
Running compilation step : cd /tmp/ltsmin6295321470159997461;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 828 ms.
Running link step : cd /tmp/ltsmin6295321470159997461;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 54 ms.
Running LTSmin : cd /tmp/ltsmin6295321470159997461;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased17068494053126234563.hoa' '--buchi-type=spotba'
LTSmin run took 1144 ms.
FORMULA UtilityControlRoom-COL-Z4T4N06-LTLCardinality-10 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property UtilityControlRoom-COL-Z4T4N06-LTLCardinality-10 finished in 61392 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((X((X(p0) U (X(G(p0))||(p1&&X(p0))))) U (X(G((X(p0) U (X(G(p0))||(p1&&X(p0))))))||(p2&&X((X(p0) U (X(G(p0))||(p1&&X(p0))))))))&&X(!p0)))'
Support contains 54 out of 228 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 228/228 places, 354/354 transitions.
Discarding 72 places :
Symmetric choice reduction at 0 with 72 rule applications. Total rules 72 place count 156 transition count 282
Iterating global reduction 0 with 72 rules applied. Total rules applied 144 place count 156 transition count 282
Applied a total of 144 rules in 8 ms. Remains 156 /228 variables (removed 72) and now considering 282/354 (removed 72) transitions.
// Phase 1: matrix 282 rows 156 cols
[2025-06-07 04:12:55] [INFO ] Computed 15 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 04:12:55] [INFO ] Implicit Places using invariants in 122 ms returned [113]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 124 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 155/228 places, 282/354 transitions.
Applied a total of 0 rules in 2 ms. Remains 155 /155 variables (removed 0) and now considering 282/282 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 135 ms. Remains : 155/228 places, 282/354 transitions.
Stuttering acceptance computed with spot in 278 ms :[true, (NOT p0), true, true, true, (NOT p0), (NOT p0)]
Running random walk in product with property : UtilityControlRoom-COL-Z4T4N06-LTLCardinality-11
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA UtilityControlRoom-COL-Z4T4N06-LTLCardinality-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property UtilityControlRoom-COL-Z4T4N06-LTLCardinality-11 finished in 443 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F(p0))))'
Support contains 25 out of 228 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 228/228 places, 354/354 transitions.
Discarding 72 places :
Symmetric choice reduction at 0 with 72 rule applications. Total rules 72 place count 156 transition count 282
Iterating global reduction 0 with 72 rules applied. Total rules applied 144 place count 156 transition count 282
Applied a total of 144 rules in 8 ms. Remains 156 /228 variables (removed 72) and now considering 282/354 (removed 72) transitions.
[2025-06-07 04:12:55] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 04:12:55] [INFO ] Implicit Places using invariants in 121 ms returned []
[2025-06-07 04:12:55] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 04:12:56] [INFO ] Implicit Places using invariants and state equation in 163 ms returned []
Implicit Place search using SMT with State Equation took 286 ms to find 0 implicit places.
Running 276 sub problems to find dead transitions.
[2025-06-07 04:12:56] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/150 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/150 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 2 (OVERLAPS) 6/156 variables, 13/15 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/156 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 4 (OVERLAPS) 282/438 variables, 156/171 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/438 variables, 0/171 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 6 (OVERLAPS) 0/438 variables, 0/171 constraints. Problems are: Problem set: 0 solved, 276 unsolved
No progress, stopping.
After SMT solving in domain Real declared 438/438 variables, and 171 constraints, problems are : Problem set: 0 solved, 276 unsolved in 14045 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, State Equation: 156/156 constraints, PredecessorRefiner: 276/276 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 276 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/150 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/150 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 2 (OVERLAPS) 6/156 variables, 13/15 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/156 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 4 (OVERLAPS) 282/438 variables, 156/171 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/438 variables, 276/447 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/438 variables, 0/447 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 7 (OVERLAPS) 0/438 variables, 0/447 constraints. Problems are: Problem set: 0 solved, 276 unsolved
No progress, stopping.
After SMT solving in domain Int declared 438/438 variables, and 447 constraints, problems are : Problem set: 0 solved, 276 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, State Equation: 156/156 constraints, PredecessorRefiner: 276/276 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 44165ms problems are : Problem set: 0 solved, 276 unsolved
Search for dead transitions found 0 dead transitions in 44166ms
Starting structural reductions in LTL mode, iteration 1 : 156/228 places, 282/354 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 44462 ms. Remains : 156/228 places, 282/354 transitions.
Stuttering acceptance computed with spot in 120 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : UtilityControlRoom-COL-Z4T4N06-LTLCardinality-12
Product exploration explored 100000 steps with 33333 reset in 202 ms.
Product exploration explored 100000 steps with 33333 reset in 251 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 : [p0, (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 2 factoid took 20 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA UtilityControlRoom-COL-Z4T4N06-LTLCardinality-12 TRUE TECHNIQUES KNOWLEDGE
Treatment of property UtilityControlRoom-COL-Z4T4N06-LTLCardinality-12 finished in 45076 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F(G(p1)))))'
Support contains 31 out of 228 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 228/228 places, 354/354 transitions.
Performed 96 Post agglomeration using F-continuation condition.Transition count delta: 96
Iterating post reduction 0 with 96 rules applied. Total rules applied 96 place count 228 transition count 258
Reduce places removed 96 places and 0 transitions.
Ensure Unique test removed 24 transitions
Reduce isomorphic transitions removed 24 transitions.
Iterating post reduction 1 with 120 rules applied. Total rules applied 216 place count 132 transition count 234
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 219 place count 129 transition count 162
Iterating global reduction 2 with 3 rules applied. Total rules applied 222 place count 129 transition count 162
Discarding 18 places :
Symmetric choice reduction at 2 with 18 rule applications. Total rules 240 place count 111 transition count 144
Iterating global reduction 2 with 18 rules applied. Total rules applied 258 place count 111 transition count 144
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 270 place count 105 transition count 138
Applied a total of 270 rules in 16 ms. Remains 105 /228 variables (removed 123) and now considering 138/354 (removed 216) transitions.
// Phase 1: matrix 138 rows 105 cols
[2025-06-07 04:13:40] [INFO ] Computed 15 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 04:13:41] [INFO ] Implicit Places using invariants in 113 ms returned [0, 80]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 126 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 103/228 places, 138/354 transitions.
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 6 Pre rules applied. Total rules applied 0 place count 103 transition count 132
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 0 with 12 rules applied. Total rules applied 12 place count 97 transition count 132
Applied a total of 12 rules in 4 ms. Remains 97 /103 variables (removed 6) and now considering 132/138 (removed 6) transitions.
// Phase 1: matrix 132 rows 97 cols
[2025-06-07 04:13:41] [INFO ] Computed 13 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 04:13:41] [INFO ] Implicit Places using invariants in 65 ms returned []
[2025-06-07 04:13:41] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 04:13:41] [INFO ] Implicit Places using invariants and state equation in 72 ms returned []
Implicit Place search using SMT with State Equation took 139 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 97/228 places, 132/354 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 286 ms. Remains : 97/228 places, 132/354 transitions.
Stuttering acceptance computed with spot in 121 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : UtilityControlRoom-COL-Z4T4N06-LTLCardinality-13
Product exploration explored 100000 steps with 1 reset in 312 ms.
Stack based approach found an accepted trace after 1207 steps with 0 reset with depth 1208 and stack size 1205 in 5 ms.
FORMULA UtilityControlRoom-COL-Z4T4N06-LTLCardinality-13 FALSE TECHNIQUES STACK_TEST
Treatment of property UtilityControlRoom-COL-Z4T4N06-LTLCardinality-13 finished in 736 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(G(F(!((p0 U p1) U !X(!X(p0)))))))'
Support contains 36 out of 228 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 228/228 places, 354/354 transitions.
Discarding 72 places :
Symmetric choice reduction at 0 with 72 rule applications. Total rules 72 place count 156 transition count 282
Iterating global reduction 0 with 72 rules applied. Total rules applied 144 place count 156 transition count 282
Applied a total of 144 rules in 2 ms. Remains 156 /228 variables (removed 72) and now considering 282/354 (removed 72) transitions.
// Phase 1: matrix 282 rows 156 cols
[2025-06-07 04:13:41] [INFO ] Computed 15 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 04:13:41] [INFO ] Implicit Places using invariants in 150 ms returned [113]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 151 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 155/228 places, 282/354 transitions.
Applied a total of 0 rules in 2 ms. Remains 155 /155 variables (removed 0) and now considering 282/282 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 155 ms. Remains : 155/228 places, 282/354 transitions.
Stuttering acceptance computed with spot in 349 ms :[p0, p0, p0, false, p0, p0, (AND p1 p0), false]
Running random walk in product with property : UtilityControlRoom-COL-Z4T4N06-LTLCardinality-14
Product exploration explored 100000 steps with 16991 reset in 309 ms.
Product exploration explored 100000 steps with 16995 reset in 317 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 p1) p0), (X (AND p0 (NOT p1))), (X p0), (X (NOT p1)), (X (X (NOT (AND p0 p1)))), (X (X (AND p0 (NOT p1)))), (X (X p0)), (X (X (NOT p1))), (X (X (NOT (AND (NOT p0) p1))))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 148 ms. Reduced automaton from 8 states, 23 edges and 2 AP (stutter sensitive) to 8 states, 23 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 354 ms :[p0, p0, p0, false, p0, p0, (AND p1 p0), false]
RANDOM walk for 165 steps (0 resets) in 9 ms. (16 steps per ms) remains 0/5 properties
Knowledge obtained : [(AND (NOT p1) p0), (X (AND p0 (NOT p1))), (X p0), (X (NOT p1)), (X (X (NOT (AND p0 p1)))), (X (X (AND p0 (NOT p1)))), (X (X p0)), (X (X (NOT p1))), (X (X (NOT (AND (NOT p0) p1))))]
False Knowledge obtained : [(F (NOT (OR p0 (NOT p1)))), (F p1), (F (NOT (OR (NOT p0) (NOT p1)))), (F (NOT p0)), (F (NOT (AND p0 (NOT p1))))]
Knowledge based reduction with 9 factoid took 327 ms. Reduced automaton from 8 states, 23 edges and 2 AP (stutter sensitive) to 8 states, 23 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 383 ms :[p0, p0, p0, false, p0, p0, (AND p1 p0), false]
Stuttering acceptance computed with spot in 379 ms :[p0, p0, p0, false, p0, p0, (AND p1 p0), false]
// Phase 1: matrix 282 rows 155 cols
[2025-06-07 04:13:44] [INFO ] Computed 14 invariants in 4 ms
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-07 04:13:44] [INFO ] [Real]Absence check using 14 positive place invariants in 18 ms returned sat
[2025-06-07 04:13:44] [INFO ] [Real]Absence check using state equation in 126 ms returned sat
[2025-06-07 04:13:44] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-07 04:13:44] [INFO ] [Nat]Absence check using 14 positive place invariants in 16 ms returned sat
[2025-06-07 04:13:45] [INFO ] [Nat]Absence check using state equation in 242 ms returned sat
[2025-06-07 04:13:45] [INFO ] Computed and/alt/rep : 276/462/276 causal constraints (skipped 0 transitions) in 17 ms.
[2025-06-07 04:13:45] [INFO ] Added : 104 causal constraints over 21 iterations in 431 ms. Result :sat
Could not prove EG p0
Support contains 36 out of 155 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 155/155 places, 282/282 transitions.
Applied a total of 0 rules in 1 ms. Remains 155 /155 variables (removed 0) and now considering 282/282 (removed 0) transitions.
[2025-06-07 04:13:45] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 04:13:45] [INFO ] Implicit Places using invariants in 118 ms returned []
[2025-06-07 04:13:45] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 04:13:45] [INFO ] Implicit Places using invariants and state equation in 161 ms returned []
Implicit Place search using SMT with State Equation took 281 ms to find 0 implicit places.
Running 276 sub problems to find dead transitions.
[2025-06-07 04:13:45] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/149 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/149 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 2 (OVERLAPS) 6/155 variables, 12/14 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/155 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 4 (OVERLAPS) 282/437 variables, 155/169 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/437 variables, 0/169 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 6 (OVERLAPS) 0/437 variables, 0/169 constraints. Problems are: Problem set: 0 solved, 276 unsolved
No progress, stopping.
After SMT solving in domain Real declared 437/437 variables, and 169 constraints, problems are : Problem set: 0 solved, 276 unsolved in 14000 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, State Equation: 155/155 constraints, PredecessorRefiner: 276/276 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 276 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/149 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/149 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 2 (OVERLAPS) 6/155 variables, 12/14 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/155 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 4 (OVERLAPS) 282/437 variables, 155/169 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/437 variables, 276/445 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/437 variables, 0/445 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 7 (OVERLAPS) 0/437 variables, 0/445 constraints. Problems are: Problem set: 0 solved, 276 unsolved
No progress, stopping.
After SMT solving in domain Int declared 437/437 variables, and 445 constraints, problems are : Problem set: 0 solved, 276 unsolved in 23101 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, State Equation: 155/155 constraints, PredecessorRefiner: 276/276 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 37210ms problems are : Problem set: 0 solved, 276 unsolved
Search for dead transitions found 0 dead transitions in 37211ms
Finished structural reductions in LTL mode , in 1 iterations and 37495 ms. Remains : 155/155 places, 282/282 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 p1) p0), (X (AND p0 (NOT p1))), (X p0), (X (NOT p1)), (X (X (NOT (AND p0 p1)))), (X (X (AND p0 (NOT p1)))), (X (X p0)), (X (X (NOT p1))), (X (X (NOT (AND (NOT p0) p1))))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 153 ms. Reduced automaton from 8 states, 23 edges and 2 AP (stutter sensitive) to 8 states, 23 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 372 ms :[p0, p0, p0, false, p0, p0, (AND p1 p0), false]
RANDOM walk for 146 steps (0 resets) in 8 ms. (16 steps per ms) remains 0/5 properties
Knowledge obtained : [(AND (NOT p1) p0), (X (AND p0 (NOT p1))), (X p0), (X (NOT p1)), (X (X (NOT (AND p0 p1)))), (X (X (AND p0 (NOT p1)))), (X (X p0)), (X (X (NOT p1))), (X (X (NOT (AND (NOT p0) p1))))]
False Knowledge obtained : [(F (NOT (OR p0 (NOT p1)))), (F p1), (F (NOT (OR (NOT p0) (NOT p1)))), (F (NOT p0)), (F (NOT (AND p0 (NOT p1))))]
Knowledge based reduction with 9 factoid took 322 ms. Reduced automaton from 8 states, 23 edges and 2 AP (stutter sensitive) to 8 states, 23 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 359 ms :[p0, p0, p0, false, p0, p0, (AND p1 p0), false]
Stuttering acceptance computed with spot in 383 ms :[p0, p0, p0, false, p0, p0, (AND p1 p0), false]
[2025-06-07 04:14:24] [INFO ] Invariant cache hit.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-07 04:14:24] [INFO ] [Real]Absence check using 14 positive place invariants in 30 ms returned sat
[2025-06-07 04:14:25] [INFO ] [Real]Absence check using state equation in 132 ms returned sat
[2025-06-07 04:14:25] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-07 04:14:25] [INFO ] [Nat]Absence check using 14 positive place invariants in 16 ms returned sat
[2025-06-07 04:14:25] [INFO ] [Nat]Absence check using state equation in 180 ms returned sat
[2025-06-07 04:14:25] [INFO ] Computed and/alt/rep : 276/462/276 causal constraints (skipped 0 transitions) in 17 ms.
[2025-06-07 04:14:25] [INFO ] Added : 16 causal constraints over 4 iterations in 98 ms. Result :sat
Could not prove EG p0
Stuttering acceptance computed with spot in 356 ms :[p0, p0, p0, false, p0, p0, (AND p1 p0), false]
Product exploration explored 100000 steps with 17089 reset in 281 ms.
Product exploration explored 100000 steps with 16970 reset in 300 ms.
Built C files in :
/tmp/ltsmin9616454174693207192
[2025-06-07 04:14:26] [INFO ] Built C files in 4ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9616454174693207192
Running compilation step : cd /tmp/ltsmin9616454174693207192;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 421 ms.
Running link step : cd /tmp/ltsmin9616454174693207192;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 37 ms.
Running LTSmin : cd /tmp/ltsmin9616454174693207192;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased8023481043112922436.hoa' '--buchi-type=spotba'
LTSmin run took 269 ms.
FORMULA UtilityControlRoom-COL-Z4T4N06-LTLCardinality-14 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property UtilityControlRoom-COL-Z4T4N06-LTLCardinality-14 finished in 45832 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((G(F(!p0))||(F(!p0)&&X(X(X(p1))))))))'
Support contains 54 out of 228 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 228/228 places, 354/354 transitions.
Discarding 72 places :
Symmetric choice reduction at 0 with 72 rule applications. Total rules 72 place count 156 transition count 282
Iterating global reduction 0 with 72 rules applied. Total rules applied 144 place count 156 transition count 282
Applied a total of 144 rules in 4 ms. Remains 156 /228 variables (removed 72) and now considering 282/354 (removed 72) transitions.
// Phase 1: matrix 282 rows 156 cols
[2025-06-07 04:14:27] [INFO ] Computed 15 invariants in 4 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 04:14:27] [INFO ] Implicit Places using invariants in 139 ms returned [113]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 141 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 155/228 places, 282/354 transitions.
Applied a total of 0 rules in 2 ms. Remains 155 /155 variables (removed 0) and now considering 282/282 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 148 ms. Remains : 155/228 places, 282/354 transitions.
Stuttering acceptance computed with spot in 393 ms :[p0, p0, (AND p0 (NOT p1)), p0, (AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1))]
Running random walk in product with property : UtilityControlRoom-COL-Z4T4N06-LTLCardinality-15
Product exploration explored 100000 steps with 10930 reset in 248 ms.
Product exploration explored 100000 steps with 10974 reset in 274 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 p1), (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 107 ms. Reduced automaton from 9 states, 13 edges and 2 AP (stutter sensitive) to 8 states, 11 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 330 ms :[p0, p0, (AND p0 (NOT p1)), p0, (AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1))]
RANDOM walk for 115 steps (0 resets) in 7 ms. (14 steps per ms) remains 0/3 properties
Knowledge obtained : [(AND p0 p1), (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p1)), (F (NOT (OR (NOT p0) p1))), (F (NOT p0))]
Knowledge based reduction with 3 factoid took 168 ms. Reduced automaton from 8 states, 11 edges and 2 AP (stutter sensitive) to 8 states, 11 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 375 ms :[p0, p0, (AND p0 (NOT p1)), p0, (AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1))]
Stuttering acceptance computed with spot in 348 ms :[p0, p0, (AND p0 (NOT p1)), p0, (AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1))]
// Phase 1: matrix 282 rows 155 cols
[2025-06-07 04:14:29] [INFO ] Computed 14 invariants in 3 ms
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-07 04:14:30] [INFO ] [Real]Absence check using 14 positive place invariants in 19 ms returned sat
[2025-06-07 04:14:30] [INFO ] [Real]Absence check using state equation in 130 ms returned sat
[2025-06-07 04:14:30] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-07 04:14:30] [INFO ] [Nat]Absence check using 14 positive place invariants in 16 ms returned sat
[2025-06-07 04:14:30] [INFO ] [Nat]Absence check using state equation in 232 ms returned sat
[2025-06-07 04:14:30] [INFO ] Computed and/alt/rep : 276/462/276 causal constraints (skipped 0 transitions) in 16 ms.
[2025-06-07 04:14:31] [INFO ] Added : 104 causal constraints over 21 iterations in 413 ms. Result :sat
Could not prove EG p0
Support contains 54 out of 155 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 155/155 places, 282/282 transitions.
Applied a total of 0 rules in 1 ms. Remains 155 /155 variables (removed 0) and now considering 282/282 (removed 0) transitions.
[2025-06-07 04:14:31] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 04:14:31] [INFO ] Implicit Places using invariants in 126 ms returned []
[2025-06-07 04:14:31] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 04:14:31] [INFO ] Implicit Places using invariants and state equation in 161 ms returned []
Implicit Place search using SMT with State Equation took 289 ms to find 0 implicit places.
Running 276 sub problems to find dead transitions.
[2025-06-07 04:14:31] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/149 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/149 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 2 (OVERLAPS) 6/155 variables, 12/14 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/155 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 4 (OVERLAPS) 282/437 variables, 155/169 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/437 variables, 0/169 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 6 (OVERLAPS) 0/437 variables, 0/169 constraints. Problems are: Problem set: 0 solved, 276 unsolved
No progress, stopping.
After SMT solving in domain Real declared 437/437 variables, and 169 constraints, problems are : Problem set: 0 solved, 276 unsolved in 14032 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, State Equation: 155/155 constraints, PredecessorRefiner: 276/276 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 276 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/149 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/149 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 2 (OVERLAPS) 6/155 variables, 12/14 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/155 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 4 (OVERLAPS) 282/437 variables, 155/169 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/437 variables, 276/445 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/437 variables, 0/445 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 7 (OVERLAPS) 0/437 variables, 0/445 constraints. Problems are: Problem set: 0 solved, 276 unsolved
No progress, stopping.
After SMT solving in domain Int declared 437/437 variables, and 445 constraints, problems are : Problem set: 0 solved, 276 unsolved in 23069 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, State Equation: 155/155 constraints, PredecessorRefiner: 276/276 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 37190ms problems are : Problem set: 0 solved, 276 unsolved
Search for dead transitions found 0 dead transitions in 37190ms
Finished structural reductions in LTL mode , in 1 iterations and 37481 ms. Remains : 155/155 places, 282/282 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 p0 p1), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 116 ms. Reduced automaton from 8 states, 11 edges and 2 AP (stutter sensitive) to 8 states, 11 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 370 ms :[p0, p0, (AND p0 (NOT p1)), p0, (AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1))]
RANDOM walk for 180 steps (0 resets) in 17 ms. (10 steps per ms) remains 0/3 properties
Knowledge obtained : [(AND p0 p1), (X (X p0))]
False Knowledge obtained : [(F (NOT p1)), (F (NOT (OR (NOT p0) p1))), (F (NOT p0))]
Knowledge based reduction with 2 factoid took 178 ms. Reduced automaton from 8 states, 11 edges and 2 AP (stutter sensitive) to 8 states, 11 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 376 ms :[p0, p0, (AND p0 (NOT p1)), p0, (AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1))]
Stuttering acceptance computed with spot in 364 ms :[p0, p0, (AND p0 (NOT p1)), p0, (AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1))]
[2025-06-07 04:15:09] [INFO ] Invariant cache hit.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-07 04:15:10] [INFO ] [Real]Absence check using 14 positive place invariants in 29 ms returned sat
[2025-06-07 04:15:10] [INFO ] [Real]Absence check using state equation in 130 ms returned sat
[2025-06-07 04:15:10] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-07 04:15:10] [INFO ] [Nat]Absence check using 14 positive place invariants in 14 ms returned sat
[2025-06-07 04:15:10] [INFO ] [Nat]Absence check using state equation in 176 ms returned sat
[2025-06-07 04:15:10] [INFO ] Computed and/alt/rep : 276/462/276 causal constraints (skipped 0 transitions) in 16 ms.
[2025-06-07 04:15:10] [INFO ] Added : 16 causal constraints over 4 iterations in 97 ms. Result :sat
Could not prove EG p0
Stuttering acceptance computed with spot in 353 ms :[p0, p0, (AND p0 (NOT p1)), p0, (AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1))]
Product exploration explored 100000 steps with 10863 reset in 229 ms.
Product exploration explored 100000 steps with 11034 reset in 247 ms.
Applying partial POR strategy [false, false, false, true, false, false, false, true]
Stuttering acceptance computed with spot in 358 ms :[p0, p0, (AND p0 (NOT p1)), p0, (AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1))]
Support contains 54 out of 155 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 155/155 places, 282/282 transitions.
Performed 30 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 30 places in 0 ms
Iterating global reduction 0 with 30 rules applied. Total rules applied 30 place count 155 transition count 282
Deduced a syphon composed of 30 places in 0 ms
Drop transitions (Redundant composition of simpler transitions.) removed 24 transitions
Redundant transition composition rules discarded 24 transitions
Iterating global reduction 0 with 24 rules applied. Total rules applied 54 place count 155 transition count 258
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 57 place count 152 transition count 186
Deduced a syphon composed of 30 places in 0 ms
Iterating global reduction 0 with 3 rules applied. Total rules applied 60 place count 152 transition count 186
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 78 place count 134 transition count 168
Deduced a syphon composed of 12 places in 0 ms
Iterating global reduction 0 with 18 rules applied. Total rules applied 96 place count 134 transition count 168
Deduced a syphon composed of 12 places in 0 ms
Applied a total of 96 rules in 27 ms. Remains 134 /155 variables (removed 21) and now considering 168/282 (removed 114) transitions.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-07 04:15:12] [INFO ] Redundant transitions in 2 ms returned []
Running 162 sub problems to find dead transitions.
// Phase 1: matrix 168 rows 134 cols
[2025-06-07 04:15:12] [INFO ] Computed 14 invariants in 1 ms
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/128 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 162 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 04:15:12] [INFO ] Deduced a trap composed of 73 places in 63 ms of which 9 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/128 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 162 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/128 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 162 unsolved
At refinement iteration 3 (OVERLAPS) 6/134 variables, 12/15 constraints. Problems are: Problem set: 0 solved, 162 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 04:15:14] [INFO ] Deduced a trap composed of 3 places in 39 ms of which 2 ms to minimize.
Problem TDEAD103 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 04:15:14] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 2 ms to minimize.
Problem TDEAD104 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 04:15:14] [INFO ] Deduced a trap composed of 3 places in 43 ms of which 2 ms to minimize.
Problem TDEAD105 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 04:15:14] [INFO ] Deduced a trap composed of 3 places in 33 ms of which 3 ms to minimize.
Problem TDEAD106 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 04:15:14] [INFO ] Deduced a trap composed of 3 places in 33 ms of which 2 ms to minimize.
Problem TDEAD107 is UNSAT
Problem TDEAD115 is UNSAT
Problem TDEAD116 is UNSAT
Problem TDEAD117 is UNSAT
Problem TDEAD118 is UNSAT
Problem TDEAD119 is UNSAT
At refinement iteration 4 (INCLUDED_ONLY) 0/134 variables, 5/20 constraints. Problems are: Problem set: 10 solved, 152 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/134 variables, 0/20 constraints. Problems are: Problem set: 10 solved, 152 unsolved
Problem TDEAD102 is UNSAT
Problem TDEAD114 is UNSAT
At refinement iteration 6 (OVERLAPS) 168/302 variables, 134/154 constraints. Problems are: Problem set: 12 solved, 150 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/302 variables, 0/154 constraints. Problems are: Problem set: 12 solved, 150 unsolved
At refinement iteration 8 (OVERLAPS) 0/302 variables, 0/154 constraints. Problems are: Problem set: 12 solved, 150 unsolved
No progress, stopping.
After SMT solving in domain Real declared 302/302 variables, and 154 constraints, problems are : Problem set: 12 solved, 150 unsolved in 6827 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, State Equation: 134/134 constraints, PredecessorRefiner: 162/162 constraints, Known Traps: 6/6 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 12 solved, 150 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/116 variables, 1/1 constraints. Problems are: Problem set: 12 solved, 150 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/116 variables, 0/1 constraints. Problems are: Problem set: 12 solved, 150 unsolved
At refinement iteration 2 (OVERLAPS) 18/134 variables, 14/15 constraints. Problems are: Problem set: 12 solved, 150 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/134 variables, 5/20 constraints. Problems are: Problem set: 12 solved, 150 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/134 variables, 0/20 constraints. Problems are: Problem set: 12 solved, 150 unsolved
At refinement iteration 5 (OVERLAPS) 168/302 variables, 134/154 constraints. Problems are: Problem set: 12 solved, 150 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/302 variables, 150/304 constraints. Problems are: Problem set: 12 solved, 150 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/302 variables, 0/304 constraints. Problems are: Problem set: 12 solved, 150 unsolved
At refinement iteration 8 (OVERLAPS) 0/302 variables, 0/304 constraints. Problems are: Problem set: 12 solved, 150 unsolved
No progress, stopping.
After SMT solving in domain Int declared 302/302 variables, and 304 constraints, problems are : Problem set: 12 solved, 150 unsolved in 8123 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, State Equation: 134/134 constraints, PredecessorRefiner: 150/162 constraints, Known Traps: 6/6 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 14976ms problems are : Problem set: 12 solved, 150 unsolved
Search for dead transitions found 12 dead transitions in 14977ms
Found 12 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 12 transitions
Dead transitions reduction (with SMT) removed 12 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 134/155 places, 156/282 transitions.
Graph (complete) has 270 edges and 134 vertex of which 122 are kept as prefixes of interest. Removing 12 places using SCC suffix rule.5 ms
Discarding 12 places :
Also discarding 0 output transitions
Ensure Unique test removed 1 places
Applied a total of 1 rules in 9 ms. Remains 121 /134 variables (removed 13) and now considering 156/156 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 121/155 places, 156/282 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 15029 ms. Remains : 121/155 places, 156/282 transitions.
Built C files in :
/tmp/ltsmin13057748889263553522
[2025-06-07 04:15:27] [INFO ] Built C files in 3ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13057748889263553522
Running compilation step : cd /tmp/ltsmin13057748889263553522;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 450 ms.
Running link step : cd /tmp/ltsmin13057748889263553522;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 36 ms.
Running LTSmin : cd /tmp/ltsmin13057748889263553522;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased7420667958390767090.hoa' '--buchi-type=spotba'
LTSmin run took 1351 ms.
FORMULA UtilityControlRoom-COL-Z4T4N06-LTLCardinality-15 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property UtilityControlRoom-COL-Z4T4N06-LTLCardinality-15 finished in 61476 ms.
All properties solved by simple procedures.
Total runtime 284567 ms.

BK_STOP 1749269728998

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

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

Sequence of Actions to be Executed by the VM

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

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5832"
echo " Executing tool itstools"
echo " Input is UtilityControlRoom-COL-Z4T4N06, 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 r240-tall-174915590400747"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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