Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.3M
-rw-r--r-- 1 mcc users 23K Apr 13 05:45 CTLCardinality.txt
-rw-r--r-- 1 mcc users 154K Apr 13 05:45 CTLCardinality.xml
-rw-r--r-- 1 mcc users 29K Apr 13 05:42 CTLFireability.txt
-rw-r--r-- 1 mcc users 137K Apr 13 05:42 CTLFireability.xml
-rw-r--r-- 1 mcc users 8.0K Apr 23 08:04 LTLCardinality.txt
-rw-r--r-- 1 mcc users 34K Apr 23 08:04 LTLCardinality.xml
-rw-r--r-- 1 mcc users 16K Apr 23 08:04 LTLFireability.txt
-rw-r--r-- 1 mcc users 50K Apr 23 08:04 LTLFireability.xml
-rw-r--r-- 1 mcc users 46K Apr 13 05:52 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 278K Apr 13 05:52 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 74K Apr 13 05:50 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 312K Apr 13 05:50 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.5K Apr 23 08:04 UpperBounds.txt
-rw-r--r-- 1 mcc users 5.2K Apr 23 08:04 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 8 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 65K May 18 16:43 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1717277357365

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=UtilityControlRoom-PT-Z4T4N02
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 21:29:19] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2024-06-01 21:29:19] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 21:29:19] [INFO ] Load time of PNML (sax parser for PT used): 95 ms
[2024-06-01 21:29:19] [INFO ] Transformed 80 places.
[2024-06-01 21:29:19] [INFO ] Transformed 150 transitions.
[2024-06-01 21:29:19] [INFO ] Parsed PT model containing 80 places and 150 transitions and 482 arcs in 270 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 21 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
Ensure Unique test removed 32 transitions
Reduce redundant transitions removed 32 transitions.
FORMULA UtilityControlRoom-PT-Z4T4N02-LTLCardinality-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA UtilityControlRoom-PT-Z4T4N02-LTLCardinality-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 78 out of 80 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 80/80 places, 118/118 transitions.
Applied a total of 0 rules in 13 ms. Remains 80 /80 variables (removed 0) and now considering 118/118 (removed 0) transitions.
// Phase 1: matrix 118 rows 80 cols
[2024-06-01 21:29:19] [INFO ] Computed 7 invariants in 24 ms
[2024-06-01 21:29:20] [INFO ] Implicit Places using invariants in 271 ms returned []
[2024-06-01 21:29:20] [INFO ] Invariant cache hit.
[2024-06-01 21:29:20] [INFO ] Implicit Places using invariants and state equation in 271 ms returned []
Implicit Place search using SMT with State Equation took 677 ms to find 0 implicit places.
Running 116 sub problems to find dead transitions.
[2024-06-01 21:29:20] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/78 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/78 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 2 (OVERLAPS) 2/80 variables, 5/7 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/80 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 4 (OVERLAPS) 118/198 variables, 80/87 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/198 variables, 0/87 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 6 (OVERLAPS) 0/198 variables, 0/87 constraints. Problems are: Problem set: 0 solved, 116 unsolved
No progress, stopping.
After SMT solving in domain Real declared 198/198 variables, and 87 constraints, problems are : Problem set: 0 solved, 116 unsolved in 3406 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 80/80 constraints, PredecessorRefiner: 116/116 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 116 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/78 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/78 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 2 (OVERLAPS) 2/80 variables, 5/7 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/80 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 4 (OVERLAPS) 118/198 variables, 80/87 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/198 variables, 116/203 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/198 variables, 0/203 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 7 (OVERLAPS) 0/198 variables, 0/203 constraints. Problems are: Problem set: 0 solved, 116 unsolved
No progress, stopping.
After SMT solving in domain Int declared 198/198 variables, and 203 constraints, problems are : Problem set: 0 solved, 116 unsolved in 3546 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 80/80 constraints, PredecessorRefiner: 116/116 constraints, Known Traps: 0/0 constraints]
After SMT, in 7166ms problems are : Problem set: 0 solved, 116 unsolved
Search for dead transitions found 0 dead transitions in 7189ms
Finished structural reductions in LTL mode , in 1 iterations and 7910 ms. Remains : 80/80 places, 118/118 transitions.
Support contains 78 out of 80 places after structural reductions.
[2024-06-01 21:29:27] [INFO ] Flatten gal took : 52 ms
[2024-06-01 21:29:27] [INFO ] Flatten gal took : 19 ms
[2024-06-01 21:29:28] [INFO ] Input system was already deterministic with 118 transitions.
RANDOM walk for 40000 steps (8 resets) in 1709 ms. (23 steps per ms) remains 5/24 properties
BEST_FIRST walk for 40002 steps (8 resets) in 250 ms. (159 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 114 ms. (347 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (8 resets) in 71 ms. (555 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (8 resets) in 72 ms. (547 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 59 ms. (666 steps per ms) remains 5/5 properties
[2024-06-01 21:29:28] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/20 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
Problem AtomicPropp1 is UNSAT
Problem AtomicPropp3 is UNSAT
Problem AtomicPropp16 is UNSAT
Problem AtomicPropp19 is UNSAT
Problem AtomicPropp21 is UNSAT
After SMT solving in domain Real declared 80/198 variables, and 7 constraints, problems are : Problem set: 5 solved, 0 unsolved in 72 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 0/80 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints]
After SMT, in 91ms problems are : Problem set: 5 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Successfully simplified 5 atomic propositions for a total of 14 simplifications.
Initial state reduction rules removed 1 formulas.
FORMULA UtilityControlRoom-PT-Z4T4N02-LTLCardinality-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA UtilityControlRoom-PT-Z4T4N02-LTLCardinality-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA UtilityControlRoom-PT-Z4T4N02-LTLCardinality-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA UtilityControlRoom-PT-Z4T4N02-LTLCardinality-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA UtilityControlRoom-PT-Z4T4N02-LTLCardinality-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA UtilityControlRoom-PT-Z4T4N02-LTLCardinality-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 0 stabilizing places and 0 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 10 out of 80 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 80/80 places, 118/118 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 32 transitions
Trivial Post-agglo rules discarded 32 transitions
Performed 32 trivial Post agglomeration. Transition count delta: 32
Iterating post reduction 0 with 32 rules applied. Total rules applied 32 place count 80 transition count 86
Reduce places removed 32 places and 0 transitions.
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 1 with 40 rules applied. Total rules applied 72 place count 48 transition count 78
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 75 place count 45 transition count 54
Iterating global reduction 2 with 3 rules applied. Total rules applied 78 place count 45 transition count 54
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 84 place count 39 transition count 48
Iterating global reduction 2 with 6 rules applied. Total rules applied 90 place count 39 transition count 48
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 9 rules applied. Total rules applied 99 place count 34 transition count 44
Applied a total of 99 rules in 39 ms. Remains 34 /80 variables (removed 46) and now considering 44/118 (removed 74) transitions.
// Phase 1: matrix 44 rows 34 cols
[2024-06-01 21:29:29] [INFO ] Computed 6 invariants in 1 ms
[2024-06-01 21:29:29] [INFO ] Implicit Places using invariants in 52 ms returned [26, 27]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 54 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 32/80 places, 44/118 transitions.
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 8 Pre rules applied. Total rules applied 0 place count 32 transition count 36
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 0 with 16 rules applied. Total rules applied 16 place count 24 transition count 36
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 20 place count 22 transition count 34
Applied a total of 20 rules in 6 ms. Remains 22 /32 variables (removed 10) and now considering 34/44 (removed 10) transitions.
// Phase 1: matrix 34 rows 22 cols
[2024-06-01 21:29:29] [INFO ] Computed 4 invariants in 0 ms
[2024-06-01 21:29:29] [INFO ] Implicit Places using invariants in 22 ms returned []
[2024-06-01 21:29:29] [INFO ] Invariant cache hit.
[2024-06-01 21:29:29] [INFO ] Implicit Places using invariants and state equation in 37 ms returned []
Implicit Place search using SMT with State Equation took 61 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 22/80 places, 34/118 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 160 ms. Remains : 22/80 places, 34/118 transitions.
Stuttering acceptance computed with spot in 259 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : UtilityControlRoom-PT-Z4T4N02-LTLCardinality-00
Product exploration explored 100000 steps with 7588 reset in 575 ms.
Stack based approach found an accepted trace after 609 steps with 44 reset with depth 21 and stack size 20 in 3 ms.
FORMULA UtilityControlRoom-PT-Z4T4N02-LTLCardinality-00 FALSE TECHNIQUES STACK_TEST
Treatment of property UtilityControlRoom-PT-Z4T4N02-LTLCardinality-00 finished in 1090 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0 U p1)))'
Support contains 11 out of 80 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 80/80 places, 118/118 transitions.
Discarding 24 places :
Symmetric choice reduction at 0 with 24 rule applications. Total rules 24 place count 56 transition count 94
Iterating global reduction 0 with 24 rules applied. Total rules applied 48 place count 56 transition count 94
Applied a total of 48 rules in 5 ms. Remains 56 /80 variables (removed 24) and now considering 94/118 (removed 24) transitions.
// Phase 1: matrix 94 rows 56 cols
[2024-06-01 21:29:30] [INFO ] Computed 7 invariants in 2 ms
[2024-06-01 21:29:30] [INFO ] Implicit Places using invariants in 110 ms returned [40]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 111 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 55/80 places, 94/118 transitions.
Applied a total of 0 rules in 6 ms. Remains 55 /55 variables (removed 0) and now considering 94/94 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 122 ms. Remains : 55/80 places, 94/118 transitions.
Stuttering acceptance computed with spot in 123 ms :[(NOT p1), (NOT p1), true]
Running random walk in product with property : UtilityControlRoom-PT-Z4T4N02-LTLCardinality-03
Entered a terminal (fully accepting) state of product in 19 steps with 2 reset in 1 ms.
FORMULA UtilityControlRoom-PT-Z4T4N02-LTLCardinality-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property UtilityControlRoom-PT-Z4T4N02-LTLCardinality-03 finished in 263 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 4 out of 80 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 80/80 places, 118/118 transitions.
Discarding 24 places :
Symmetric choice reduction at 0 with 24 rule applications. Total rules 24 place count 56 transition count 94
Iterating global reduction 0 with 24 rules applied. Total rules applied 48 place count 56 transition count 94
Applied a total of 48 rules in 6 ms. Remains 56 /80 variables (removed 24) and now considering 94/118 (removed 24) transitions.
[2024-06-01 21:29:30] [INFO ] Invariant cache hit.
[2024-06-01 21:29:30] [INFO ] Implicit Places using invariants in 111 ms returned [40, 41]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 112 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 54/80 places, 94/118 transitions.
Applied a total of 0 rules in 6 ms. Remains 54 /54 variables (removed 0) and now considering 94/94 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 124 ms. Remains : 54/80 places, 94/118 transitions.
Stuttering acceptance computed with spot in 86 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : UtilityControlRoom-PT-Z4T4N02-LTLCardinality-04
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA UtilityControlRoom-PT-Z4T4N02-LTLCardinality-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property UtilityControlRoom-PT-Z4T4N02-LTLCardinality-04 finished in 226 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F(G(p1)))))'
Support contains 4 out of 80 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 80/80 places, 118/118 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 32 transitions
Trivial Post-agglo rules discarded 32 transitions
Performed 32 trivial Post agglomeration. Transition count delta: 32
Iterating post reduction 0 with 32 rules applied. Total rules applied 32 place count 80 transition count 86
Reduce places removed 32 places and 0 transitions.
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 1 with 40 rules applied. Total rules applied 72 place count 48 transition count 78
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 8 Pre rules applied. Total rules applied 72 place count 48 transition count 70
Deduced a syphon composed of 8 places in 1 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 2 with 16 rules applied. Total rules applied 88 place count 40 transition count 70
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 91 place count 37 transition count 46
Iterating global reduction 2 with 3 rules applied. Total rules applied 94 place count 37 transition count 46
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 100 place count 31 transition count 40
Iterating global reduction 2 with 6 rules applied. Total rules applied 106 place count 31 transition count 40
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 112 place count 25 transition count 28
Iterating global reduction 2 with 6 rules applied. Total rules applied 118 place count 25 transition count 28
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 124 place count 19 transition count 22
Iterating global reduction 2 with 6 rules applied. Total rules applied 130 place count 19 transition count 22
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 136 place count 19 transition count 16
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 136 place count 19 transition count 14
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 140 place count 17 transition count 14
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 144 place count 15 transition count 12
Applied a total of 144 rules in 12 ms. Remains 15 /80 variables (removed 65) and now considering 12/118 (removed 106) transitions.
// Phase 1: matrix 12 rows 15 cols
[2024-06-01 21:29:30] [INFO ] Computed 7 invariants in 1 ms
[2024-06-01 21:29:30] [INFO ] Implicit Places using invariants in 33 ms returned [0, 5, 6]
[2024-06-01 21:29:30] [INFO ] Actually due to overlaps returned [0, 6]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 35 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 13/80 places, 12/118 transitions.
Applied a total of 0 rules in 1 ms. Remains 13 /13 variables (removed 0) and now considering 12/12 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 48 ms. Remains : 13/80 places, 12/118 transitions.
Stuttering acceptance computed with spot in 122 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : UtilityControlRoom-PT-Z4T4N02-LTLCardinality-06
Product exploration explored 100000 steps with 0 reset in 174 ms.
Stack based approach found an accepted trace after 8 steps with 1 reset with depth 6 and stack size 6 in 0 ms.
FORMULA UtilityControlRoom-PT-Z4T4N02-LTLCardinality-06 FALSE TECHNIQUES STACK_TEST
Treatment of property UtilityControlRoom-PT-Z4T4N02-LTLCardinality-06 finished in 359 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((X((p0&&X(F(p1))))||(p2 U (p3||G(p2)))))))'
Support contains 69 out of 80 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 80/80 places, 118/118 transitions.
Applied a total of 0 rules in 1 ms. Remains 80 /80 variables (removed 0) and now considering 118/118 (removed 0) transitions.
// Phase 1: matrix 118 rows 80 cols
[2024-06-01 21:29:31] [INFO ] Computed 7 invariants in 2 ms
[2024-06-01 21:29:31] [INFO ] Implicit Places using invariants in 53 ms returned [65]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 54 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 79/80 places, 118/118 transitions.
Applied a total of 0 rules in 1 ms. Remains 79 /79 variables (removed 0) and now considering 118/118 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 56 ms. Remains : 79/80 places, 118/118 transitions.
Stuttering acceptance computed with spot in 392 ms :[(NOT p1), (OR (AND (NOT p0) (NOT p2) (NOT p3)) (AND (NOT p1) (NOT p2) (NOT p3))), (AND (NOT p1) (NOT p3) (NOT p2)), true, (OR (NOT p0) (NOT p1)), (OR (AND (NOT p1) (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p2) (NOT p3))), (OR (AND (NOT p1) (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p2) (NOT p3))), (OR (AND (NOT p1) (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p2) (NOT p3))), (AND (NOT p3) (NOT p2))]
Running random walk in product with property : UtilityControlRoom-PT-Z4T4N02-LTLCardinality-07
Product exploration explored 100000 steps with 13654 reset in 231 ms.
Product exploration explored 100000 steps with 13624 reset in 395 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) (NOT p3) (NOT p2) p0), (X (X (NOT p3)))]
False Knowledge obtained : [(X (X p2)), (X (X (NOT p2))), (X (X (AND (NOT p3) (NOT p2)))), (X (X (NOT (AND (NOT p3) (NOT p2))))), (X (X (AND (NOT p3) p2))), (X (X (NOT (AND (NOT p3) p2))))]
Knowledge based reduction with 2 factoid took 253 ms. Reduced automaton from 9 states, 16 edges and 4 AP (stutter sensitive) to 9 states, 16 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 347 ms :[(NOT p1), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (AND (NOT p2) (NOT p3)), (OR (AND (NOT p0) (NOT p2) (NOT p3)) (AND (NOT p1) (NOT p2) (NOT p3))), (AND (NOT p1) (NOT p2) (NOT p3)), true, (OR (NOT p0) (NOT p1)), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2)))]
Reduction of identical properties reduced properties to check from 12 to 10
RANDOM walk for 40000 steps (8 resets) in 215 ms. (185 steps per ms) remains 2/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 169 ms. (235 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (8 resets) in 254 ms. (156 steps per ms) remains 2/2 properties
// Phase 1: matrix 118 rows 79 cols
[2024-06-01 21:29:33] [INFO ] Computed 6 invariants in 3 ms
Problem apf10 is UNSAT
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/69 variables, 1/1 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/69 variables, 0/1 constraints. Problems are: Problem set: 1 solved, 1 unsolved
Problem apf11 is UNSAT
After SMT solving in domain Real declared 79/197 variables, and 6 constraints, problems are : Problem set: 2 solved, 0 unsolved in 60 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 0/79 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 88ms problems are : Problem set: 2 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 2 invariant AP formulas.
Knowledge obtained : [(AND (NOT p1) (NOT p3) (NOT p2) p0), (X (X (NOT p3))), (G (OR p0 p3 (NOT p2))), (G (OR p3 p1 (NOT p2)))]
False Knowledge obtained : [(X (X p2)), (X (X (NOT p2))), (X (X (AND (NOT p3) (NOT p2)))), (X (X (NOT (AND (NOT p3) (NOT p2))))), (X (X (AND (NOT p3) p2))), (X (X (NOT (AND (NOT p3) p2)))), (F (NOT (OR p3 (NOT p2)))), (F (NOT (AND (NOT p3) (NOT p1) (NOT p2)))), (F (NOT p0)), (F (NOT (OR (NOT p0) p3 (NOT p2)))), (F p1), (F (NOT (AND p0 (NOT p3) (NOT p2)))), (F (NOT (AND (NOT p3) (NOT p2)))), (F p2), (F (NOT (OR p0 p3 p2))), (F p3)]
Knowledge based reduction with 4 factoid took 540 ms. Reduced automaton from 9 states, 16 edges and 4 AP (stutter sensitive) to 8 states, 12 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 321 ms :[(NOT p1), (AND (NOT p1) (NOT p3)), (OR (AND (NOT p1) (NOT p3)) (AND (NOT p0) (NOT p3))), (OR (AND (NOT p1) (NOT p3)) (AND (NOT p0) (NOT p3)) (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (OR (NOT p0) (NOT p1)), (OR (AND (NOT p1) (NOT p3)) (AND (NOT p0) (NOT p3)) (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p1) (NOT p3)) (AND (NOT p0) (NOT p3)) (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), true]
Stuttering acceptance computed with spot in 305 ms :[(NOT p1), (AND (NOT p1) (NOT p3)), (OR (AND (NOT p1) (NOT p3)) (AND (NOT p0) (NOT p3))), (OR (AND (NOT p1) (NOT p3)) (AND (NOT p0) (NOT p3)) (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (OR (NOT p0) (NOT p1)), (OR (AND (NOT p1) (NOT p3)) (AND (NOT p0) (NOT p3)) (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p1) (NOT p3)) (AND (NOT p0) (NOT p3)) (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), true]
[2024-06-01 21:29:34] [INFO ] Invariant cache hit.
[2024-06-01 21:29:34] [INFO ] [Real]Absence check using 6 positive place invariants in 6 ms returned sat
[2024-06-01 21:29:34] [INFO ] [Real]Absence check using state equation in 64 ms returned sat
[2024-06-01 21:29:34] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 21:29:34] [INFO ] [Nat]Absence check using 6 positive place invariants in 5 ms returned sat
[2024-06-01 21:29:34] [INFO ] [Nat]Absence check using state equation in 60 ms returned sat
[2024-06-01 21:29:34] [INFO ] Computed and/alt/rep : 116/178/116 causal constraints (skipped 0 transitions) in 17 ms.
[2024-06-01 21:29:35] [INFO ] Added : 116 causal constraints over 24 iterations in 312 ms. Result :sat
Could not prove EG (AND (NOT p1) (NOT p3))
[2024-06-01 21:29:35] [INFO ] Invariant cache hit.
[2024-06-01 21:29:35] [INFO ] [Real]Absence check using 6 positive place invariants in 5 ms returned sat
[2024-06-01 21:29:35] [INFO ] [Real]Absence check using state equation in 68 ms returned sat
[2024-06-01 21:29:35] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 21:29:35] [INFO ] [Nat]Absence check using 6 positive place invariants in 5 ms returned sat
[2024-06-01 21:29:35] [INFO ] [Nat]Absence check using state equation in 61 ms returned sat
[2024-06-01 21:29:35] [INFO ] Computed and/alt/rep : 116/178/116 causal constraints (skipped 0 transitions) in 12 ms.
[2024-06-01 21:29:35] [INFO ] Added : 59 causal constraints over 12 iterations in 145 ms. Result :sat
Could not prove EG (AND (NOT p1) (NOT p2))
Support contains 69 out of 79 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 79/79 places, 118/118 transitions.
Applied a total of 0 rules in 2 ms. Remains 79 /79 variables (removed 0) and now considering 118/118 (removed 0) transitions.
[2024-06-01 21:29:35] [INFO ] Invariant cache hit.
[2024-06-01 21:29:35] [INFO ] Implicit Places using invariants in 36 ms returned []
[2024-06-01 21:29:35] [INFO ] Invariant cache hit.
[2024-06-01 21:29:35] [INFO ] Implicit Places using invariants and state equation in 82 ms returned []
Implicit Place search using SMT with State Equation took 124 ms to find 0 implicit places.
Running 116 sub problems to find dead transitions.
[2024-06-01 21:29:35] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/77 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/77 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 2 (OVERLAPS) 2/79 variables, 4/6 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/79 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 4 (OVERLAPS) 118/197 variables, 79/85 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/197 variables, 0/85 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 6 (OVERLAPS) 0/197 variables, 0/85 constraints. Problems are: Problem set: 0 solved, 116 unsolved
No progress, stopping.
After SMT solving in domain Real declared 197/197 variables, and 85 constraints, problems are : Problem set: 0 solved, 116 unsolved in 2578 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 79/79 constraints, PredecessorRefiner: 116/116 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 116 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/77 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/77 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 2 (OVERLAPS) 2/79 variables, 4/6 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/79 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 4 (OVERLAPS) 118/197 variables, 79/85 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/197 variables, 116/201 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/197 variables, 0/201 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 7 (OVERLAPS) 0/197 variables, 0/201 constraints. Problems are: Problem set: 0 solved, 116 unsolved
No progress, stopping.
After SMT solving in domain Int declared 197/197 variables, and 201 constraints, problems are : Problem set: 0 solved, 116 unsolved in 3467 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 79/79 constraints, PredecessorRefiner: 116/116 constraints, Known Traps: 0/0 constraints]
After SMT, in 6102ms problems are : Problem set: 0 solved, 116 unsolved
Search for dead transitions found 0 dead transitions in 6104ms
Finished structural reductions in LTL mode , in 1 iterations and 6231 ms. Remains : 79/79 places, 118/118 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) (NOT p3) p0 (NOT p2))]
False Knowledge obtained : [(X (X p2)), (X (X (NOT p2)))]
Knowledge based reduction with 1 factoid took 130 ms. Reduced automaton from 8 states, 12 edges and 4 AP (stutter sensitive) to 8 states, 12 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 303 ms :[(NOT p1), (OR (AND (NOT p1) (NOT p3)) (AND (NOT p0) (NOT p3))), (AND (NOT p1) (NOT p3)), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p3)) (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p3))), (OR (NOT p0) (NOT p1)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p3)) (AND (NOT p1) (NOT p3))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p3)) (AND (NOT p1) (NOT p3))), true]
Reduction of identical properties reduced properties to check from 8 to 7
RANDOM walk for 271 steps (0 resets) in 9 ms. (27 steps per ms) remains 0/7 properties
Knowledge obtained : [(AND (NOT p1) (NOT p3) p0 (NOT p2))]
False Knowledge obtained : [(X (X p2)), (X (X (NOT p2))), (F p1), (F (NOT (OR (NOT p0) (NOT p2) p3))), (F (NOT (AND (NOT p1) (NOT p3)))), (F (NOT (AND p0 (NOT p2) (NOT p3)))), (F p2), (F (NOT (OR p0 p3))), (F p3), (F (NOT p0))]
Knowledge based reduction with 1 factoid took 304 ms. Reduced automaton from 8 states, 12 edges and 4 AP (stutter sensitive) to 8 states, 12 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 304 ms :[(NOT p1), (OR (AND (NOT p1) (NOT p3)) (AND (NOT p0) (NOT p3))), (AND (NOT p1) (NOT p3)), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p3)) (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p3))), (OR (NOT p0) (NOT p1)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p3)) (AND (NOT p1) (NOT p3))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p3)) (AND (NOT p1) (NOT p3))), true]
Stuttering acceptance computed with spot in 309 ms :[(NOT p1), (OR (AND (NOT p1) (NOT p3)) (AND (NOT p0) (NOT p3))), (AND (NOT p1) (NOT p3)), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p3)) (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p3))), (OR (NOT p0) (NOT p1)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p3)) (AND (NOT p1) (NOT p3))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p3)) (AND (NOT p1) (NOT p3))), true]
[2024-06-01 21:29:43] [INFO ] Invariant cache hit.
[2024-06-01 21:29:43] [INFO ] [Real]Absence check using 6 positive place invariants in 5 ms returned sat
[2024-06-01 21:29:43] [INFO ] [Real]Absence check using state equation in 46 ms returned sat
[2024-06-01 21:29:43] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 21:29:43] [INFO ] [Nat]Absence check using 6 positive place invariants in 4 ms returned sat
[2024-06-01 21:29:43] [INFO ] [Nat]Absence check using state equation in 57 ms returned sat
[2024-06-01 21:29:43] [INFO ] Computed and/alt/rep : 116/178/116 causal constraints (skipped 0 transitions) in 11 ms.
[2024-06-01 21:29:43] [INFO ] Added : 59 causal constraints over 12 iterations in 150 ms. Result :sat
Could not prove EG (AND (NOT p1) (NOT p2))
[2024-06-01 21:29:43] [INFO ] Invariant cache hit.
[2024-06-01 21:29:43] [INFO ] [Real]Absence check using 6 positive place invariants in 5 ms returned sat
[2024-06-01 21:29:44] [INFO ] [Real]Absence check using state equation in 55 ms returned sat
[2024-06-01 21:29:44] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 21:29:44] [INFO ] [Nat]Absence check using 6 positive place invariants in 8 ms returned sat
[2024-06-01 21:29:44] [INFO ] [Nat]Absence check using state equation in 55 ms returned sat
[2024-06-01 21:29:44] [INFO ] Computed and/alt/rep : 116/178/116 causal constraints (skipped 0 transitions) in 9 ms.
[2024-06-01 21:29:44] [INFO ] Added : 116 causal constraints over 24 iterations in 321 ms. Result :sat
Could not prove EG (AND (NOT p1) (NOT p3))
Stuttering acceptance computed with spot in 311 ms :[(NOT p1), (OR (AND (NOT p1) (NOT p3)) (AND (NOT p0) (NOT p3))), (AND (NOT p1) (NOT p3)), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p3)) (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p3))), (OR (NOT p0) (NOT p1)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p3)) (AND (NOT p1) (NOT p3))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p3)) (AND (NOT p1) (NOT p3))), true]
Product exploration explored 100000 steps with 13592 reset in 189 ms.
Product exploration explored 100000 steps with 13618 reset in 237 ms.
Applying partial POR strategy [true, false, true, false, false, false, false, true]
Stuttering acceptance computed with spot in 313 ms :[(NOT p1), (OR (AND (NOT p1) (NOT p3)) (AND (NOT p0) (NOT p3))), (AND (NOT p1) (NOT p3)), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p3)) (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p3))), (OR (NOT p0) (NOT p1)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p3)) (AND (NOT p1) (NOT p3))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p3)) (AND (NOT p1) (NOT p3))), true]
Support contains 69 out of 79 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 79/79 places, 118/118 transitions.
Applied a total of 0 rules in 4 ms. Remains 79 /79 variables (removed 0) and now considering 118/118 (removed 0) transitions.
[2024-06-01 21:29:46] [INFO ] Redundant transitions in 2 ms returned []
Running 116 sub problems to find dead transitions.
[2024-06-01 21:29:46] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/77 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/77 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 2 (OVERLAPS) 2/79 variables, 4/6 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/79 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 4 (OVERLAPS) 118/197 variables, 79/85 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/197 variables, 0/85 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 6 (OVERLAPS) 0/197 variables, 0/85 constraints. Problems are: Problem set: 0 solved, 116 unsolved
No progress, stopping.
After SMT solving in domain Real declared 197/197 variables, and 85 constraints, problems are : Problem set: 0 solved, 116 unsolved in 2688 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 79/79 constraints, PredecessorRefiner: 116/116 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 116 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/77 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/77 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 2 (OVERLAPS) 2/79 variables, 4/6 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/79 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 4 (OVERLAPS) 118/197 variables, 79/85 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/197 variables, 116/201 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/197 variables, 0/201 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 7 (OVERLAPS) 0/197 variables, 0/201 constraints. Problems are: Problem set: 0 solved, 116 unsolved
No progress, stopping.
After SMT solving in domain Int declared 197/197 variables, and 201 constraints, problems are : Problem set: 0 solved, 116 unsolved in 3424 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 79/79 constraints, PredecessorRefiner: 116/116 constraints, Known Traps: 0/0 constraints]
After SMT, in 6166ms problems are : Problem set: 0 solved, 116 unsolved
Search for dead transitions found 0 dead transitions in 6169ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 6182 ms. Remains : 79/79 places, 118/118 transitions.
Support contains 69 out of 79 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 79/79 places, 118/118 transitions.
Applied a total of 0 rules in 1 ms. Remains 79 /79 variables (removed 0) and now considering 118/118 (removed 0) transitions.
[2024-06-01 21:29:52] [INFO ] Invariant cache hit.
[2024-06-01 21:29:52] [INFO ] Implicit Places using invariants in 32 ms returned []
[2024-06-01 21:29:52] [INFO ] Invariant cache hit.
[2024-06-01 21:29:52] [INFO ] Implicit Places using invariants and state equation in 75 ms returned []
Implicit Place search using SMT with State Equation took 109 ms to find 0 implicit places.
Running 116 sub problems to find dead transitions.
[2024-06-01 21:29:52] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/77 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/77 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 2 (OVERLAPS) 2/79 variables, 4/6 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/79 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 4 (OVERLAPS) 118/197 variables, 79/85 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/197 variables, 0/85 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 6 (OVERLAPS) 0/197 variables, 0/85 constraints. Problems are: Problem set: 0 solved, 116 unsolved
No progress, stopping.
After SMT solving in domain Real declared 197/197 variables, and 85 constraints, problems are : Problem set: 0 solved, 116 unsolved in 2698 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 79/79 constraints, PredecessorRefiner: 116/116 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 116 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/77 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/77 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 2 (OVERLAPS) 2/79 variables, 4/6 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/79 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 4 (OVERLAPS) 118/197 variables, 79/85 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/197 variables, 116/201 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/197 variables, 0/201 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 7 (OVERLAPS) 0/197 variables, 0/201 constraints. Problems are: Problem set: 0 solved, 116 unsolved
No progress, stopping.
After SMT solving in domain Int declared 197/197 variables, and 201 constraints, problems are : Problem set: 0 solved, 116 unsolved in 3499 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 79/79 constraints, PredecessorRefiner: 116/116 constraints, Known Traps: 0/0 constraints]
After SMT, in 6243ms problems are : Problem set: 0 solved, 116 unsolved
Search for dead transitions found 0 dead transitions in 6245ms
Finished structural reductions in LTL mode , in 1 iterations and 6355 ms. Remains : 79/79 places, 118/118 transitions.
Treatment of property UtilityControlRoom-PT-Z4T4N02-LTLCardinality-07 finished in 27578 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 2 out of 80 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 80/80 places, 118/118 transitions.
Discarding 24 places :
Symmetric choice reduction at 0 with 24 rule applications. Total rules 24 place count 56 transition count 94
Iterating global reduction 0 with 24 rules applied. Total rules applied 48 place count 56 transition count 94
Applied a total of 48 rules in 4 ms. Remains 56 /80 variables (removed 24) and now considering 94/118 (removed 24) transitions.
// Phase 1: matrix 94 rows 56 cols
[2024-06-01 21:29:58] [INFO ] Computed 7 invariants in 1 ms
[2024-06-01 21:29:58] [INFO ] Implicit Places using invariants in 76 ms returned [41]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 77 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 55/80 places, 94/118 transitions.
Applied a total of 0 rules in 1 ms. Remains 55 /55 variables (removed 0) and now considering 94/94 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 83 ms. Remains : 55/80 places, 94/118 transitions.
Stuttering acceptance computed with spot in 84 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : UtilityControlRoom-PT-Z4T4N02-LTLCardinality-08
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA UtilityControlRoom-PT-Z4T4N02-LTLCardinality-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property UtilityControlRoom-PT-Z4T4N02-LTLCardinality-08 finished in 201 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((p0&&F(p1)&&X(X(G(p0))))))'
Support contains 3 out of 80 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 80/80 places, 118/118 transitions.
Discarding 24 places :
Symmetric choice reduction at 0 with 24 rule applications. Total rules 24 place count 56 transition count 94
Iterating global reduction 0 with 24 rules applied. Total rules applied 48 place count 56 transition count 94
Applied a total of 48 rules in 3 ms. Remains 56 /80 variables (removed 24) and now considering 94/118 (removed 24) transitions.
[2024-06-01 21:29:58] [INFO ] Invariant cache hit.
[2024-06-01 21:29:59] [INFO ] Implicit Places using invariants in 104 ms returned [40, 41]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 106 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 54/80 places, 94/118 transitions.
Applied a total of 0 rules in 1 ms. Remains 54 /54 variables (removed 0) and now considering 94/94 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 113 ms. Remains : 54/80 places, 94/118 transitions.
Stuttering acceptance computed with spot in 219 ms :[(OR (NOT p0) (NOT p1)), (NOT p1), (NOT p0), (NOT p0), (AND (NOT p1) (NOT p0)), (NOT p0)]
Running random walk in product with property : UtilityControlRoom-PT-Z4T4N02-LTLCardinality-11
Product exploration explored 100000 steps with 22607 reset in 148 ms.
Stack based approach found an accepted trace after 3066 steps with 695 reset with depth 10 and stack size 10 in 7 ms.
FORMULA UtilityControlRoom-PT-Z4T4N02-LTLCardinality-11 FALSE TECHNIQUES STACK_TEST
Treatment of property UtilityControlRoom-PT-Z4T4N02-LTLCardinality-11 finished in 516 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0&&G(p1))))'
Support contains 3 out of 80 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 80/80 places, 118/118 transitions.
Discarding 24 places :
Symmetric choice reduction at 0 with 24 rule applications. Total rules 24 place count 56 transition count 94
Iterating global reduction 0 with 24 rules applied. Total rules applied 48 place count 56 transition count 94
Applied a total of 48 rules in 3 ms. Remains 56 /80 variables (removed 24) and now considering 94/118 (removed 24) transitions.
[2024-06-01 21:29:59] [INFO ] Invariant cache hit.
[2024-06-01 21:29:59] [INFO ] Implicit Places using invariants in 97 ms returned [40, 41]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 98 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 54/80 places, 94/118 transitions.
Applied a total of 0 rules in 1 ms. Remains 54 /54 variables (removed 0) and now considering 94/94 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 102 ms. Remains : 54/80 places, 94/118 transitions.
Stuttering acceptance computed with spot in 130 ms :[true, (OR (NOT p0) (NOT p1)), (NOT p1), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : UtilityControlRoom-PT-Z4T4N02-LTLCardinality-15
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA UtilityControlRoom-PT-Z4T4N02-LTLCardinality-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property UtilityControlRoom-PT-Z4T4N02-LTLCardinality-15 finished in 248 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((X((p0&&X(F(p1))))||(p2 U (p3||G(p2)))))))'
[2024-06-01 21:29:59] [INFO ] Flatten gal took : 12 ms
[2024-06-01 21:29:59] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/LTLCardinality.sr.xml took 3 ms.
[2024-06-01 21:29:59] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 80 places, 118 transitions and 354 arcs took 6 ms.
Total runtime 40763 ms.
There are residual formulas that ITS could not solve within timeout
FORMULA UtilityControlRoom-PT-Z4T4N02-LTLCardinality-07 TRUE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN

BK_STOP 1717277400242

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLCardinality -timeout 360 -rebuildPNML
mcc2024
ltl formula name UtilityControlRoom-PT-Z4T4N02-LTLCardinality-07
ltl formula formula --ltl=/tmp/1118/ltl_0_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 80 places, 118 transitions and 354 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1118/ltl_0_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1118/ltl_0_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1118/ltl_0_
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.040 real 0.000 user 0.010 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1118/ltl_0_
pnml2lts-mc( 0/ 4): buchi has 8 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4): There are 82 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 81, there are 132 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Empty product with LTL!
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 4523
pnml2lts-mc( 0/ 4): unique states count: 4523
pnml2lts-mc( 0/ 4): unique transitions count: 6162
pnml2lts-mc( 0/ 4): - self-loop count: 0
pnml2lts-mc( 0/ 4): - claim dead count: 1792
pnml2lts-mc( 0/ 4): - claim found count: 0
pnml2lts-mc( 0/ 4): - claim success count: 4629
pnml2lts-mc( 0/ 4): - cum. max stack depth: 60
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 4629 states 6693 transitions, fanout: 1.446
pnml2lts-mc( 0/ 4): Total exploration time 0.060 sec (0.060 sec minimum, 0.060 sec on average)
pnml2lts-mc( 0/ 4): States per second: 77150, Transitions per second: 111550
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 0.1MB, 15.0 B/state, compr.: 4.6%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/0.0%
pnml2lts-mc( 0/ 4): Stored 118 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 0.1MB (~256.0MB paged-in)

Sequence of Actions to be Executed by the VM

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

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool ltsminxred"
echo " Input is UtilityControlRoom-PT-Z4T4N02, 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 r544-smll-171701111100243"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/UtilityControlRoom-PT-Z4T4N02.tgz
mv UtilityControlRoom-PT-Z4T4N02 execution
cd execution
if [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "UpperBounds" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] || [ "LTLCardinality" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLCardinality" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "LTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLCardinality.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' LTLCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLCardinality"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;