Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 436K
-rw-r--r-- 1 mcc users 6.7K Apr 13 05:24 CTLCardinality.txt
-rw-r--r-- 1 mcc users 53K Apr 13 05:24 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.4K Apr 13 05:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 51K Apr 13 05:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.3K Apr 23 08:04 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Apr 23 08:04 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.9K Apr 23 08:04 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Apr 23 08:04 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Apr 13 05:34 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 95K Apr 13 05:34 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Apr 13 05:32 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 78K Apr 13 05:32 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.9K Apr 23 08:04 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.0K Apr 23 08:04 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:43 equiv_pt
-rw-r--r-- 1 mcc users 8 May 18 16:43 instance
-rw-r--r-- 1 mcc users 5 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 29K May 18 16:43 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1717053969107

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=UtilityControlRoom-COL-Z2T3N10
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-30 07:26:11] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2024-05-30 07:26:11] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-30 07:26:11] [INFO ] Detected file is not PT type :http://www.pnml.org/version-2009/grammar/symmetricnet
log4j:WARN No appenders could be found for logger (org.apache.axiom.locator.DefaultOMMetaFactoryLocator).
log4j:WARN Please initialize the log4j system properly.
log4j:WARN See http://logging.apache.org/log4j/1.2/faq.html#noconfig for more info.
[2024-05-30 07:26:11] [WARNING] Using fallBack plugin, rng conformance not checked
[2024-05-30 07:26:12] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 888 ms
[2024-05-30 07:26:12] [INFO ] Imported 13 HL places and 12 HL transitions for a total of 174 PT places and 270.0 transition bindings in 24 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 33 ms.
Working with output stream class java.io.PrintStream
[2024-05-30 07:26:12] [INFO ] Built PT skeleton of HLPN with 13 places and 12 transitions 37 arcs in 6 ms.
[2024-05-30 07:26:12] [INFO ] Skeletonized 16 HLPN properties in 3 ms.
Initial state reduction rules removed 3 formulas.
FORMULA UtilityControlRoom-COL-Z2T3N10-LTLCardinality-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA UtilityControlRoom-COL-Z2T3N10-LTLCardinality-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA UtilityControlRoom-COL-Z2T3N10-LTLCardinality-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 0 stabilizing places and 0 stable transitions
Remains 13 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 40001 steps (8 resets) in 1742 ms. (22 steps per ms) remains 3/19 properties
BEST_FIRST walk for 40004 steps (8 resets) in 403 ms. (99 steps per ms) remains 2/3 properties
BEST_FIRST walk for 40003 steps (8 resets) in 276 ms. (144 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (8 resets) in 146 ms. (272 steps per ms) remains 2/2 properties
// Phase 1: matrix 11 rows 13 cols
[2024-05-30 07:26:13] [INFO ] Computed 5 invariants in 6 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Problem AtomicPropp6 is UNSAT
Problem AtomicPropp12 is UNSAT
After SMT solving in domain Real declared 13/24 variables, and 5 constraints, problems are : Problem set: 2 solved, 0 unsolved in 284 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/13 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 344ms problems are : Problem set: 2 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Successfully simplified 2 atomic propositions for a total of 13 simplifications.
FORMULA UtilityControlRoom-COL-Z2T3N10-LTLCardinality-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA UtilityControlRoom-COL-Z2T3N10-LTLCardinality-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-30 07:26:14] [INFO ] Flatten gal took : 35 ms
[2024-05-30 07:26:14] [INFO ] Flatten gal took : 8 ms
Transition timeout forces synchronizations/join behavior on parameter c of sort Cli
Domain [Cli(10), Z(2), Z(2)] of place MovetoZ breaks symmetries in sort Z
[2024-05-30 07:26:14] [INFO ] Unfolded HLPN to a Petri net with 174 places and 270 transitions 850 arcs in 91 ms.
[2024-05-30 07:26:14] [INFO ] Unfolded 11 HLPN properties in 1 ms.
Ensure Unique test removed 40 transitions
Reduce redundant transitions removed 40 transitions.
Support contains 164 out of 174 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 174/174 places, 230/230 transitions.
Applied a total of 0 rules in 24 ms. Remains 174 /174 variables (removed 0) and now considering 230/230 (removed 0) transitions.
// Phase 1: matrix 230 rows 174 cols
[2024-05-30 07:26:14] [INFO ] Computed 23 invariants in 18 ms
[2024-05-30 07:26:14] [INFO ] Implicit Places using invariants in 248 ms returned []
[2024-05-30 07:26:14] [INFO ] Invariant cache hit.
[2024-05-30 07:26:14] [INFO ] Implicit Places using invariants and state equation in 290 ms returned []
Implicit Place search using SMT with State Equation took 558 ms to find 0 implicit places.
Running 220 sub problems to find dead transitions.
[2024-05-30 07:26:14] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/164 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/164 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 2 (OVERLAPS) 10/174 variables, 21/23 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/174 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 4 (OVERLAPS) 230/404 variables, 174/197 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/404 variables, 0/197 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 6 (OVERLAPS) 0/404 variables, 0/197 constraints. Problems are: Problem set: 0 solved, 220 unsolved
No progress, stopping.
After SMT solving in domain Real declared 404/404 variables, and 197 constraints, problems are : Problem set: 0 solved, 220 unsolved in 9497 ms.
Refiners :[Positive P Invariants (semi-flows): 23/23 constraints, State Equation: 174/174 constraints, PredecessorRefiner: 220/220 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 220 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/164 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/164 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 2 (OVERLAPS) 10/174 variables, 21/23 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/174 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 4 (OVERLAPS) 230/404 variables, 174/197 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/404 variables, 220/417 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/404 variables, 0/417 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 7 (OVERLAPS) 0/404 variables, 0/417 constraints. Problems are: Problem set: 0 solved, 220 unsolved
No progress, stopping.
After SMT solving in domain Int declared 404/404 variables, and 417 constraints, problems are : Problem set: 0 solved, 220 unsolved in 13794 ms.
Refiners :[Positive P Invariants (semi-flows): 23/23 constraints, State Equation: 174/174 constraints, PredecessorRefiner: 220/220 constraints, Known Traps: 0/0 constraints]
After SMT, in 23625ms problems are : Problem set: 0 solved, 220 unsolved
Search for dead transitions found 0 dead transitions in 23638ms
Finished structural reductions in LTL mode , in 1 iterations and 24272 ms. Remains : 174/174 places, 230/230 transitions.
Support contains 164 out of 174 places after structural reductions.
[2024-05-30 07:26:38] [INFO ] Flatten gal took : 36 ms
[2024-05-30 07:26:38] [INFO ] Flatten gal took : 33 ms
[2024-05-30 07:26:38] [INFO ] Input system was already deterministic with 230 transitions.
RANDOM walk for 40000 steps (8 resets) in 1083 ms. (36 steps per ms) remains 1/17 properties
BEST_FIRST walk for 427 steps (0 resets) in 8 ms. (47 steps per ms) remains 0/1 properties
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(p0) U p1)&&G(F(!p1))))'
Support contains 22 out of 174 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 174/174 places, 230/230 transitions.
Performed 40 Post agglomeration using F-continuation condition.Transition count delta: 40
Iterating post reduction 0 with 40 rules applied. Total rules applied 40 place count 174 transition count 190
Reduce places removed 40 places and 0 transitions.
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Iterating post reduction 1 with 60 rules applied. Total rules applied 100 place count 134 transition count 170
Performed 20 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 20 Pre rules applied. Total rules applied 100 place count 134 transition count 150
Deduced a syphon composed of 20 places in 0 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 2 with 40 rules applied. Total rules applied 140 place count 114 transition count 150
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 2 with 20 rules applied. Total rules applied 160 place count 104 transition count 140
Applied a total of 160 rules in 45 ms. Remains 104 /174 variables (removed 70) and now considering 140/230 (removed 90) transitions.
// Phase 1: matrix 140 rows 104 cols
[2024-05-30 07:26:39] [INFO ] Computed 23 invariants in 2 ms
[2024-05-30 07:26:39] [INFO ] Implicit Places using invariants in 133 ms returned [62, 63]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 136 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 102/174 places, 140/230 transitions.
Applied a total of 0 rules in 10 ms. Remains 102 /102 variables (removed 0) and now considering 140/140 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 191 ms. Remains : 102/174 places, 140/230 transitions.
Stuttering acceptance computed with spot in 427 ms :[true, true, (NOT p0), (NOT p1), p1, p1]
Running random walk in product with property : UtilityControlRoom-COL-Z2T3N10-LTLCardinality-00
Entered a terminal (fully accepting) state of product in 3 steps with 0 reset in 1 ms.
FORMULA UtilityControlRoom-COL-Z2T3N10-LTLCardinality-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property UtilityControlRoom-COL-Z2T3N10-LTLCardinality-00 finished in 697 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 30 out of 174 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 174/174 places, 230/230 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 40 transitions
Trivial Post-agglo rules discarded 40 transitions
Performed 40 trivial Post agglomeration. Transition count delta: 40
Iterating post reduction 0 with 40 rules applied. Total rules applied 40 place count 174 transition count 190
Reduce places removed 40 places and 0 transitions.
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Iterating post reduction 1 with 60 rules applied. Total rules applied 100 place count 134 transition count 170
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 101 place count 133 transition count 150
Iterating global reduction 2 with 1 rules applied. Total rules applied 102 place count 133 transition count 150
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 112 place count 123 transition count 140
Iterating global reduction 2 with 10 rules applied. Total rules applied 122 place count 123 transition count 140
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Deduced a syphon composed of 10 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 2 with 21 rules applied. Total rules applied 143 place count 112 transition count 130
Applied a total of 143 rules in 35 ms. Remains 112 /174 variables (removed 62) and now considering 130/230 (removed 100) transitions.
// Phase 1: matrix 130 rows 112 cols
[2024-05-30 07:26:40] [INFO ] Computed 22 invariants in 2 ms
[2024-05-30 07:26:40] [INFO ] Implicit Places using invariants in 79 ms returned [81]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 80 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 111/174 places, 130/230 transitions.
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 0 with 20 rules applied. Total rules applied 20 place count 101 transition count 120
Applied a total of 20 rules in 13 ms. Remains 101 /111 variables (removed 10) and now considering 120/130 (removed 10) transitions.
// Phase 1: matrix 120 rows 101 cols
[2024-05-30 07:26:40] [INFO ] Computed 21 invariants in 1 ms
[2024-05-30 07:26:40] [INFO ] Implicit Places using invariants in 57 ms returned []
[2024-05-30 07:26:40] [INFO ] Invariant cache hit.
[2024-05-30 07:26:40] [INFO ] Implicit Places using invariants and state equation in 114 ms returned []
Implicit Place search using SMT with State Equation took 182 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 101/174 places, 120/230 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 310 ms. Remains : 101/174 places, 120/230 transitions.
Stuttering acceptance computed with spot in 35 ms :[(NOT p0)]
Running random walk in product with property : UtilityControlRoom-COL-Z2T3N10-LTLCardinality-02
Product exploration explored 100000 steps with 0 reset in 534 ms.
Stack based approach found an accepted trace after 2016 steps with 0 reset with depth 2017 and stack size 2017 in 9 ms.
FORMULA UtilityControlRoom-COL-Z2T3N10-LTLCardinality-02 FALSE TECHNIQUES STACK_TEST
Treatment of property UtilityControlRoom-COL-Z2T3N10-LTLCardinality-02 finished in 920 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 71 out of 174 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 174/174 places, 230/230 transitions.
Applied a total of 0 rules in 4 ms. Remains 174 /174 variables (removed 0) and now considering 230/230 (removed 0) transitions.
// Phase 1: matrix 230 rows 174 cols
[2024-05-30 07:26:40] [INFO ] Computed 23 invariants in 4 ms
[2024-05-30 07:26:40] [INFO ] Implicit Places using invariants in 110 ms returned [123]
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 : 173/174 places, 230/230 transitions.
Applied a total of 0 rules in 4 ms. Remains 173 /173 variables (removed 0) and now considering 230/230 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 120 ms. Remains : 173/174 places, 230/230 transitions.
Stuttering acceptance computed with spot in 87 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : UtilityControlRoom-COL-Z2T3N10-LTLCardinality-03
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA UtilityControlRoom-COL-Z2T3N10-LTLCardinality-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property UtilityControlRoom-COL-Z2T3N10-LTLCardinality-03 finished in 229 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F((p0&&X(X(p1)))))))'
Support contains 21 out of 174 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 174/174 places, 230/230 transitions.
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 20 place count 154 transition count 210
Iterating global reduction 0 with 20 rules applied. Total rules applied 40 place count 154 transition count 210
Applied a total of 40 rules in 6 ms. Remains 154 /174 variables (removed 20) and now considering 210/230 (removed 20) transitions.
// Phase 1: matrix 210 rows 154 cols
[2024-05-30 07:26:41] [INFO ] Computed 23 invariants in 1 ms
[2024-05-30 07:26:41] [INFO ] Implicit Places using invariants in 108 ms returned []
[2024-05-30 07:26:41] [INFO ] Invariant cache hit.
[2024-05-30 07:26:41] [INFO ] Implicit Places using invariants and state equation in 187 ms returned []
Implicit Place search using SMT with State Equation took 297 ms to find 0 implicit places.
Running 200 sub problems to find dead transitions.
[2024-05-30 07:26:41] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/144 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/144 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 2 (OVERLAPS) 10/154 variables, 21/23 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/154 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 4 (OVERLAPS) 210/364 variables, 154/177 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/364 variables, 0/177 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 6 (OVERLAPS) 0/364 variables, 0/177 constraints. Problems are: Problem set: 0 solved, 200 unsolved
No progress, stopping.
After SMT solving in domain Real declared 364/364 variables, and 177 constraints, problems are : Problem set: 0 solved, 200 unsolved in 7365 ms.
Refiners :[Positive P Invariants (semi-flows): 23/23 constraints, State Equation: 154/154 constraints, PredecessorRefiner: 200/200 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 200 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/144 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/144 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 2 (OVERLAPS) 10/154 variables, 21/23 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/154 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 4 (OVERLAPS) 210/364 variables, 154/177 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/364 variables, 200/377 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/364 variables, 0/377 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 7 (OVERLAPS) 0/364 variables, 0/377 constraints. Problems are: Problem set: 0 solved, 200 unsolved
No progress, stopping.
After SMT solving in domain Int declared 364/364 variables, and 377 constraints, problems are : Problem set: 0 solved, 200 unsolved in 10957 ms.
Refiners :[Positive P Invariants (semi-flows): 23/23 constraints, State Equation: 154/154 constraints, PredecessorRefiner: 200/200 constraints, Known Traps: 0/0 constraints]
After SMT, in 18499ms problems are : Problem set: 0 solved, 200 unsolved
Search for dead transitions found 0 dead transitions in 18506ms
Starting structural reductions in LTL mode, iteration 1 : 154/174 places, 210/230 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 18810 ms. Remains : 154/174 places, 210/230 transitions.
Stuttering acceptance computed with spot in 245 ms :[(NOT p1), (NOT p1), (NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0))]
Running random walk in product with property : UtilityControlRoom-COL-Z2T3N10-LTLCardinality-04
Product exploration explored 100000 steps with 0 reset in 553 ms.
Stack based approach found an accepted trace after 6927 steps with 0 reset with depth 6928 and stack size 6928 in 43 ms.
FORMULA UtilityControlRoom-COL-Z2T3N10-LTLCardinality-04 FALSE TECHNIQUES STACK_TEST
Treatment of property UtilityControlRoom-COL-Z2T3N10-LTLCardinality-04 finished in 19672 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(p0)&&X(F(p1)))))'
Support contains 30 out of 174 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 174/174 places, 230/230 transitions.
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 20 place count 154 transition count 210
Iterating global reduction 0 with 20 rules applied. Total rules applied 40 place count 154 transition count 210
Applied a total of 40 rules in 6 ms. Remains 154 /174 variables (removed 20) and now considering 210/230 (removed 20) transitions.
[2024-05-30 07:27:00] [INFO ] Invariant cache hit.
[2024-05-30 07:27:01] [INFO ] Implicit Places using invariants in 358 ms returned [103]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 360 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 153/174 places, 210/230 transitions.
Applied a total of 0 rules in 2 ms. Remains 153 /153 variables (removed 0) and now considering 210/210 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 368 ms. Remains : 153/174 places, 210/230 transitions.
Stuttering acceptance computed with spot in 177 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : UtilityControlRoom-COL-Z2T3N10-LTLCardinality-07
Product exploration explored 100000 steps with 5523 reset in 460 ms.
Product exploration explored 100000 steps with 5430 reset in 382 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT p0)), (X (X (NOT p0))), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 86 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 125 ms :[(NOT p0), (NOT p0), (NOT p0)]
RANDOM walk for 131 steps (0 resets) in 4 ms. (26 steps per ms) remains 0/1 properties
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT p0)), (X (X (NOT p0))), (X (X p1))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 4 factoid took 107 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 99 ms :[(NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 121 ms :[(NOT p0), (NOT p0), (NOT p0)]
// Phase 1: matrix 210 rows 153 cols
[2024-05-30 07:27:02] [INFO ] Computed 22 invariants in 2 ms
[2024-05-30 07:27:02] [INFO ] [Real]Absence check using 22 positive place invariants in 15 ms returned sat
[2024-05-30 07:27:03] [INFO ] [Real]Absence check using state equation in 127 ms returned sat
[2024-05-30 07:27:03] [INFO ] Solution in real domain found non-integer solution.
[2024-05-30 07:27:03] [INFO ] [Nat]Absence check using 22 positive place invariants in 18 ms returned sat
[2024-05-30 07:27:03] [INFO ] [Nat]Absence check using state equation in 191 ms returned sat
[2024-05-30 07:27:03] [INFO ] Computed and/alt/rep : 200/310/200 causal constraints (skipped 0 transitions) in 28 ms.
[2024-05-30 07:27:03] [INFO ] Added : 56 causal constraints over 12 iterations in 384 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 10 out of 153 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 153/153 places, 210/210 transitions.
Applied a total of 0 rules in 6 ms. Remains 153 /153 variables (removed 0) and now considering 210/210 (removed 0) transitions.
[2024-05-30 07:27:04] [INFO ] Invariant cache hit.
[2024-05-30 07:27:04] [INFO ] Implicit Places using invariants in 183 ms returned []
[2024-05-30 07:27:04] [INFO ] Invariant cache hit.
[2024-05-30 07:27:04] [INFO ] Implicit Places using invariants and state equation in 250 ms returned []
Implicit Place search using SMT with State Equation took 438 ms to find 0 implicit places.
Running 200 sub problems to find dead transitions.
[2024-05-30 07:27:04] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/143 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/143 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 2 (OVERLAPS) 10/153 variables, 20/22 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/153 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 4 (OVERLAPS) 210/363 variables, 153/175 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/363 variables, 0/175 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 6 (OVERLAPS) 0/363 variables, 0/175 constraints. Problems are: Problem set: 0 solved, 200 unsolved
No progress, stopping.
After SMT solving in domain Real declared 363/363 variables, and 175 constraints, problems are : Problem set: 0 solved, 200 unsolved in 8948 ms.
Refiners :[Positive P Invariants (semi-flows): 22/22 constraints, State Equation: 153/153 constraints, PredecessorRefiner: 200/200 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 200 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/143 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/143 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 2 (OVERLAPS) 10/153 variables, 20/22 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/153 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 4 (OVERLAPS) 210/363 variables, 153/175 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/363 variables, 200/375 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/363 variables, 0/375 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 7 (OVERLAPS) 0/363 variables, 0/375 constraints. Problems are: Problem set: 0 solved, 200 unsolved
No progress, stopping.
After SMT solving in domain Int declared 363/363 variables, and 375 constraints, problems are : Problem set: 0 solved, 200 unsolved in 10443 ms.
Refiners :[Positive P Invariants (semi-flows): 22/22 constraints, State Equation: 153/153 constraints, PredecessorRefiner: 200/200 constraints, Known Traps: 0/0 constraints]
After SMT, in 19584ms problems are : Problem set: 0 solved, 200 unsolved
Search for dead transitions found 0 dead transitions in 19591ms
Finished structural reductions in LTL mode , in 1 iterations and 20038 ms. Remains : 153/153 places, 210/210 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(NOT p0), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 106 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 143 ms :[(NOT p0), (NOT p0), (NOT p0)]
RANDOM walk for 113 steps (0 resets) in 4 ms. (22 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 2 factoid took 111 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 129 ms :[(NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 153 ms :[(NOT p0), (NOT p0), (NOT p0)]
[2024-05-30 07:27:24] [INFO ] Invariant cache hit.
[2024-05-30 07:27:24] [INFO ] [Real]Absence check using 22 positive place invariants in 16 ms returned sat
[2024-05-30 07:27:25] [INFO ] [Real]Absence check using state equation in 130 ms returned sat
[2024-05-30 07:27:25] [INFO ] Solution in real domain found non-integer solution.
[2024-05-30 07:27:25] [INFO ] [Nat]Absence check using 22 positive place invariants in 19 ms returned sat
[2024-05-30 07:27:25] [INFO ] [Nat]Absence check using state equation in 179 ms returned sat
[2024-05-30 07:27:25] [INFO ] Computed and/alt/rep : 200/310/200 causal constraints (skipped 0 transitions) in 27 ms.
[2024-05-30 07:27:25] [INFO ] Added : 92 causal constraints over 19 iterations in 411 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 104 ms :[(NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 2942 reset in 334 ms.
Product exploration explored 100000 steps with 2935 reset in 274 ms.
Applying partial POR strategy [true, false, false]
Stuttering acceptance computed with spot in 100 ms :[(NOT p0), (NOT p0), (NOT p0)]
Support contains 10 out of 153 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 153/153 places, 210/210 transitions.
Performed 20 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 20 Pre rules applied. Total rules applied 0 place count 153 transition count 230
Deduced a syphon composed of 20 places in 0 ms
Iterating global reduction 0 with 20 rules applied. Total rules applied 20 place count 153 transition count 230
Performed 30 Post agglomeration using F-continuation condition.Transition count delta: -10
Deduced a syphon composed of 50 places in 0 ms
Iterating global reduction 0 with 30 rules applied. Total rules applied 50 place count 153 transition count 240
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Iterating post reduction 0 with 20 rules applied. Total rules applied 70 place count 153 transition count 220
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 71 place count 152 transition count 200
Deduced a syphon composed of 50 places in 1 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 72 place count 152 transition count 200
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 82 place count 142 transition count 190
Deduced a syphon composed of 50 places in 0 ms
Iterating global reduction 1 with 10 rules applied. Total rules applied 92 place count 142 transition count 190
Discarding 20 places :
Symmetric choice reduction at 1 with 20 rule applications. Total rules 112 place count 122 transition count 150
Deduced a syphon composed of 40 places in 0 ms
Iterating global reduction 1 with 20 rules applied. Total rules applied 132 place count 122 transition count 150
Discarding 20 places :
Symmetric choice reduction at 1 with 20 rule applications. Total rules 152 place count 102 transition count 130
Deduced a syphon composed of 30 places in 0 ms
Iterating global reduction 1 with 20 rules applied. Total rules applied 172 place count 102 transition count 130
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Iterating post reduction 1 with 20 rules applied. Total rules applied 192 place count 102 transition count 110
Deduced a syphon composed of 30 places in 0 ms
Applied a total of 192 rules in 30 ms. Remains 102 /153 variables (removed 51) and now considering 110/210 (removed 100) transitions.
[2024-05-30 07:27:27] [INFO ] Redundant transitions in 2 ms returned []
Running 100 sub problems to find dead transitions.
// Phase 1: matrix 110 rows 102 cols
[2024-05-30 07:27:27] [INFO ] Computed 22 invariants in 1 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/92 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/92 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 2 (OVERLAPS) 10/102 variables, 20/22 constraints. Problems are: Problem set: 0 solved, 100 unsolved
[2024-05-30 07:27:27] [INFO ] Deduced a trap composed of 5 places in 73 ms of which 14 ms to minimize.
[2024-05-30 07:27:27] [INFO ] Deduced a trap composed of 5 places in 53 ms of which 3 ms to minimize.
[2024-05-30 07:27:27] [INFO ] Deduced a trap composed of 5 places in 47 ms of which 1 ms to minimize.
[2024-05-30 07:27:27] [INFO ] Deduced a trap composed of 5 places in 46 ms of which 1 ms to minimize.
[2024-05-30 07:27:27] [INFO ] Deduced a trap composed of 5 places in 47 ms of which 1 ms to minimize.
[2024-05-30 07:27:28] [INFO ] Deduced a trap composed of 5 places in 44 ms of which 1 ms to minimize.
Problem TDEAD9 is UNSAT
[2024-05-30 07:27:28] [INFO ] Deduced a trap composed of 5 places in 19 ms of which 1 ms to minimize.
[2024-05-30 07:27:28] [INFO ] Deduced a trap composed of 5 places in 20 ms of which 1 ms to minimize.
Problem TDEAD20 is UNSAT
[2024-05-30 07:27:28] [INFO ] Deduced a trap composed of 5 places in 19 ms of which 1 ms to minimize.
Problem TDEAD21 is UNSAT
[2024-05-30 07:27:28] [INFO ] Deduced a trap composed of 5 places in 18 ms of which 0 ms to minimize.
Problem TDEAD22 is UNSAT
Problem TDEAD23 is UNSAT
Problem TDEAD24 is UNSAT
Problem TDEAD25 is UNSAT
Problem TDEAD26 is UNSAT
Problem TDEAD27 is UNSAT
Problem TDEAD28 is UNSAT
Problem TDEAD29 is UNSAT
Problem TDEAD50 is UNSAT
Problem TDEAD51 is UNSAT
Problem TDEAD52 is UNSAT
Problem TDEAD53 is UNSAT
Problem TDEAD54 is UNSAT
Problem TDEAD55 is UNSAT
Problem TDEAD56 is UNSAT
Problem TDEAD57 is UNSAT
Problem TDEAD58 is UNSAT
Problem TDEAD59 is UNSAT
Problem TDEAD60 is UNSAT
Problem TDEAD61 is UNSAT
Problem TDEAD62 is UNSAT
Problem TDEAD63 is UNSAT
Problem TDEAD64 is UNSAT
Problem TDEAD65 is UNSAT
Problem TDEAD66 is UNSAT
Problem TDEAD67 is UNSAT
Problem TDEAD68 is UNSAT
Problem TDEAD69 is UNSAT
Problem TDEAD0 is UNSAT
Problem TDEAD1 is UNSAT
Problem TDEAD2 is UNSAT
Problem TDEAD3 is UNSAT
Problem TDEAD4 is UNSAT
Problem TDEAD5 is UNSAT
Problem TDEAD6 is UNSAT
Problem TDEAD7 is UNSAT
Problem TDEAD8 is UNSAT
At refinement iteration 3 (INCLUDED_ONLY) 0/102 variables, 10/32 constraints. Problems are: Problem set: 40 solved, 60 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/102 variables, 0/32 constraints. Problems are: Problem set: 40 solved, 60 unsolved
At refinement iteration 5 (OVERLAPS) 110/212 variables, 102/134 constraints. Problems are: Problem set: 40 solved, 60 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/212 variables, 0/134 constraints. Problems are: Problem set: 40 solved, 60 unsolved
At refinement iteration 7 (OVERLAPS) 0/212 variables, 0/134 constraints. Problems are: Problem set: 40 solved, 60 unsolved
No progress, stopping.
After SMT solving in domain Real declared 212/212 variables, and 134 constraints, problems are : Problem set: 40 solved, 60 unsolved in 2524 ms.
Refiners :[Positive P Invariants (semi-flows): 22/22 constraints, State Equation: 102/102 constraints, PredecessorRefiner: 100/100 constraints, Known Traps: 10/10 constraints]
Escalating to Integer solving :Problem set: 40 solved, 60 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/62 variables, 0/0 constraints. Problems are: Problem set: 40 solved, 60 unsolved
At refinement iteration 1 (OVERLAPS) 40/102 variables, 22/22 constraints. Problems are: Problem set: 40 solved, 60 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/102 variables, 10/32 constraints. Problems are: Problem set: 40 solved, 60 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/102 variables, 0/32 constraints. Problems are: Problem set: 40 solved, 60 unsolved
At refinement iteration 4 (OVERLAPS) 110/212 variables, 102/134 constraints. Problems are: Problem set: 40 solved, 60 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/212 variables, 60/194 constraints. Problems are: Problem set: 40 solved, 60 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/212 variables, 0/194 constraints. Problems are: Problem set: 40 solved, 60 unsolved
At refinement iteration 7 (OVERLAPS) 0/212 variables, 0/194 constraints. Problems are: Problem set: 40 solved, 60 unsolved
No progress, stopping.
After SMT solving in domain Int declared 212/212 variables, and 194 constraints, problems are : Problem set: 40 solved, 60 unsolved in 2090 ms.
Refiners :[Positive P Invariants (semi-flows): 22/22 constraints, State Equation: 102/102 constraints, PredecessorRefiner: 60/100 constraints, Known Traps: 10/10 constraints]
After SMT, in 4637ms problems are : Problem set: 40 solved, 60 unsolved
Search for dead transitions found 40 dead transitions in 4640ms
Found 40 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 40 transitions
Dead transitions reduction (with SMT) removed 40 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 102/153 places, 70/210 transitions.
Graph (complete) has 130 edges and 102 vertex of which 72 are kept as prefixes of interest. Removing 30 places using SCC suffix rule.3 ms
Discarding 30 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 10 ms. Remains 72 /102 variables (removed 30) and now considering 70/70 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 72/153 places, 70/210 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 4692 ms. Remains : 72/153 places, 70/210 transitions.
Support contains 10 out of 153 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 153/153 places, 210/210 transitions.
Applied a total of 0 rules in 2 ms. Remains 153 /153 variables (removed 0) and now considering 210/210 (removed 0) transitions.
// Phase 1: matrix 210 rows 153 cols
[2024-05-30 07:27:31] [INFO ] Computed 22 invariants in 2 ms
[2024-05-30 07:27:31] [INFO ] Implicit Places using invariants in 145 ms returned []
[2024-05-30 07:27:31] [INFO ] Invariant cache hit.
[2024-05-30 07:27:32] [INFO ] Implicit Places using invariants and state equation in 306 ms returned []
Implicit Place search using SMT with State Equation took 457 ms to find 0 implicit places.
Running 200 sub problems to find dead transitions.
[2024-05-30 07:27:32] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/143 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/143 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 2 (OVERLAPS) 10/153 variables, 20/22 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/153 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 4 (OVERLAPS) 210/363 variables, 153/175 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/363 variables, 0/175 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 6 (OVERLAPS) 0/363 variables, 0/175 constraints. Problems are: Problem set: 0 solved, 200 unsolved
No progress, stopping.
After SMT solving in domain Real declared 363/363 variables, and 175 constraints, problems are : Problem set: 0 solved, 200 unsolved in 8449 ms.
Refiners :[Positive P Invariants (semi-flows): 22/22 constraints, State Equation: 153/153 constraints, PredecessorRefiner: 200/200 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 200 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/143 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/143 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 2 (OVERLAPS) 10/153 variables, 20/22 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/153 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 4 (OVERLAPS) 210/363 variables, 153/175 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/363 variables, 200/375 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/363 variables, 0/375 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 7 (OVERLAPS) 0/363 variables, 0/375 constraints. Problems are: Problem set: 0 solved, 200 unsolved
No progress, stopping.
After SMT solving in domain Int declared 363/363 variables, and 375 constraints, problems are : Problem set: 0 solved, 200 unsolved in 10373 ms.
Refiners :[Positive P Invariants (semi-flows): 22/22 constraints, State Equation: 153/153 constraints, PredecessorRefiner: 200/200 constraints, Known Traps: 0/0 constraints]
After SMT, in 19016ms problems are : Problem set: 0 solved, 200 unsolved
Search for dead transitions found 0 dead transitions in 19021ms
Finished structural reductions in LTL mode , in 1 iterations and 19481 ms. Remains : 153/153 places, 210/210 transitions.
Treatment of property UtilityControlRoom-COL-Z2T3N10-LTLCardinality-07 finished in 50519 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 20 out of 174 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 174/174 places, 230/230 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 40 transitions
Trivial Post-agglo rules discarded 40 transitions
Performed 40 trivial Post agglomeration. Transition count delta: 40
Iterating post reduction 0 with 40 rules applied. Total rules applied 40 place count 174 transition count 190
Reduce places removed 40 places and 0 transitions.
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Iterating post reduction 1 with 60 rules applied. Total rules applied 100 place count 134 transition count 170
Performed 20 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 20 Pre rules applied. Total rules applied 100 place count 134 transition count 150
Deduced a syphon composed of 20 places in 0 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 2 with 40 rules applied. Total rules applied 140 place count 114 transition count 150
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 141 place count 113 transition count 130
Iterating global reduction 2 with 1 rules applied. Total rules applied 142 place count 113 transition count 130
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 152 place count 103 transition count 120
Iterating global reduction 2 with 10 rules applied. Total rules applied 162 place count 103 transition count 120
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 172 place count 93 transition count 100
Iterating global reduction 2 with 10 rules applied. Total rules applied 182 place count 93 transition count 100
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 192 place count 83 transition count 90
Iterating global reduction 2 with 10 rules applied. Total rules applied 202 place count 83 transition count 90
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 2 with 10 rules applied. Total rules applied 212 place count 83 transition count 80
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 10 Pre rules applied. Total rules applied 212 place count 83 transition count 70
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 3 with 20 rules applied. Total rules applied 232 place count 73 transition count 70
Applied a total of 232 rules in 15 ms. Remains 73 /174 variables (removed 101) and now considering 70/230 (removed 160) transitions.
// Phase 1: matrix 70 rows 73 cols
[2024-05-30 07:27:51] [INFO ] Computed 23 invariants in 0 ms
[2024-05-30 07:27:51] [INFO ] Implicit Places using invariants in 66 ms returned [32]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 67 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 72/174 places, 70/230 transitions.
Applied a total of 0 rules in 2 ms. Remains 72 /72 variables (removed 0) and now considering 70/70 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 84 ms. Remains : 72/174 places, 70/230 transitions.
Stuttering acceptance computed with spot in 64 ms :[(NOT p0)]
Running random walk in product with property : UtilityControlRoom-COL-Z2T3N10-LTLCardinality-08
Product exploration explored 100000 steps with 0 reset in 280 ms.
Stack based approach found an accepted trace after 632 steps with 0 reset with depth 633 and stack size 633 in 2 ms.
FORMULA UtilityControlRoom-COL-Z2T3N10-LTLCardinality-08 FALSE TECHNIQUES STACK_TEST
Treatment of property UtilityControlRoom-COL-Z2T3N10-LTLCardinality-08 finished in 464 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)&&F(p1))))'
Support contains 80 out of 174 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 174/174 places, 230/230 transitions.
Applied a total of 0 rules in 1 ms. Remains 174 /174 variables (removed 0) and now considering 230/230 (removed 0) transitions.
// Phase 1: matrix 230 rows 174 cols
[2024-05-30 07:27:51] [INFO ] Computed 23 invariants in 2 ms
[2024-05-30 07:27:51] [INFO ] Implicit Places using invariants in 120 ms returned [123]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 121 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 173/174 places, 230/230 transitions.
Applied a total of 0 rules in 1 ms. Remains 173 /173 variables (removed 0) and now considering 230/230 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 123 ms. Remains : 173/174 places, 230/230 transitions.
Stuttering acceptance computed with spot in 127 ms :[(NOT p0), (OR (NOT p1) (NOT p0)), true, (OR (NOT p0) (NOT p1))]
Running random walk in product with property : UtilityControlRoom-COL-Z2T3N10-LTLCardinality-10
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA UtilityControlRoom-COL-Z2T3N10-LTLCardinality-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property UtilityControlRoom-COL-Z2T3N10-LTLCardinality-10 finished in 266 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(X((G(X(p0))&&(X(p0) U p1)))))'
Support contains 80 out of 174 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 174/174 places, 230/230 transitions.
Applied a total of 0 rules in 1 ms. Remains 174 /174 variables (removed 0) and now considering 230/230 (removed 0) transitions.
[2024-05-30 07:27:52] [INFO ] Invariant cache hit.
[2024-05-30 07:27:52] [INFO ] Implicit Places using invariants in 100 ms returned [123]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 103 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 173/174 places, 230/230 transitions.
Applied a total of 0 rules in 1 ms. Remains 173 /173 variables (removed 0) and now considering 230/230 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 105 ms. Remains : 173/174 places, 230/230 transitions.
Stuttering acceptance computed with spot in 183 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), (NOT p0), (OR (NOT p0) (NOT p1)), true]
Running random walk in product with property : UtilityControlRoom-COL-Z2T3N10-LTLCardinality-12
Entered a terminal (fully accepting) state of product in 3 steps with 0 reset in 0 ms.
FORMULA UtilityControlRoom-COL-Z2T3N10-LTLCardinality-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property UtilityControlRoom-COL-Z2T3N10-LTLCardinality-12 finished in 306 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 70 out of 174 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 174/174 places, 230/230 transitions.
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 20 place count 154 transition count 210
Iterating global reduction 0 with 20 rules applied. Total rules applied 40 place count 154 transition count 210
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Deduced a syphon composed of 10 places in 1 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 0 with 20 rules applied. Total rules applied 60 place count 144 transition count 200
Applied a total of 60 rules in 11 ms. Remains 144 /174 variables (removed 30) and now considering 200/230 (removed 30) transitions.
// Phase 1: matrix 200 rows 144 cols
[2024-05-30 07:27:52] [INFO ] Computed 23 invariants in 2 ms
[2024-05-30 07:27:52] [INFO ] Implicit Places using invariants in 125 ms returned [93]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 126 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 143/174 places, 200/230 transitions.
Applied a total of 0 rules in 5 ms. Remains 143 /143 variables (removed 0) and now considering 200/200 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 142 ms. Remains : 143/174 places, 200/230 transitions.
Stuttering acceptance computed with spot in 154 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : UtilityControlRoom-COL-Z2T3N10-LTLCardinality-13
Product exploration explored 100000 steps with 0 reset in 372 ms.
Stack based approach found an accepted trace after 5891 steps with 0 reset with depth 5892 and stack size 5892 in 20 ms.
FORMULA UtilityControlRoom-COL-Z2T3N10-LTLCardinality-13 FALSE TECHNIQUES STACK_TEST
Treatment of property UtilityControlRoom-COL-Z2T3N10-LTLCardinality-13 finished in 700 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(p0)||(!p0&&F(p0)))))'
Support contains 20 out of 174 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 174/174 places, 230/230 transitions.
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 20 place count 154 transition count 210
Iterating global reduction 0 with 20 rules applied. Total rules applied 40 place count 154 transition count 210
Applied a total of 40 rules in 3 ms. Remains 154 /174 variables (removed 20) and now considering 210/230 (removed 20) transitions.
// Phase 1: matrix 210 rows 154 cols
[2024-05-30 07:27:53] [INFO ] Computed 23 invariants in 2 ms
[2024-05-30 07:27:53] [INFO ] Implicit Places using invariants in 176 ms returned [103]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 177 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 153/174 places, 210/230 transitions.
Applied a total of 0 rules in 1 ms. Remains 153 /153 variables (removed 0) and now considering 210/210 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 181 ms. Remains : 153/174 places, 210/230 transitions.
Stuttering acceptance computed with spot in 164 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : UtilityControlRoom-COL-Z2T3N10-LTLCardinality-14
Product exploration explored 100000 steps with 1801 reset in 219 ms.
Stack based approach found an accepted trace after 5504 steps with 96 reset with depth 116 and stack size 116 in 14 ms.
FORMULA UtilityControlRoom-COL-Z2T3N10-LTLCardinality-14 FALSE TECHNIQUES STACK_TEST
Treatment of property UtilityControlRoom-COL-Z2T3N10-LTLCardinality-14 finished in 600 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 20 out of 174 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 174/174 places, 230/230 transitions.
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 20 place count 154 transition count 210
Iterating global reduction 0 with 20 rules applied. Total rules applied 40 place count 154 transition count 210
Applied a total of 40 rules in 4 ms. Remains 154 /174 variables (removed 20) and now considering 210/230 (removed 20) transitions.
[2024-05-30 07:27:53] [INFO ] Invariant cache hit.
[2024-05-30 07:27:53] [INFO ] Implicit Places using invariants in 158 ms returned [103]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 159 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 153/174 places, 210/230 transitions.
Applied a total of 0 rules in 1 ms. Remains 153 /153 variables (removed 0) and now considering 210/210 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 165 ms. Remains : 153/174 places, 210/230 transitions.
Stuttering acceptance computed with spot in 87 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : UtilityControlRoom-COL-Z2T3N10-LTLCardinality-15
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA UtilityControlRoom-COL-Z2T3N10-LTLCardinality-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property UtilityControlRoom-COL-Z2T3N10-LTLCardinality-15 finished in 270 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(p0)&&X(F(p1)))))'
Found a Shortening insensitive property : UtilityControlRoom-COL-Z2T3N10-LTLCardinality-07
Stuttering acceptance computed with spot in 174 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Support contains 30 out of 174 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 174/174 places, 230/230 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 40 transitions
Trivial Post-agglo rules discarded 40 transitions
Performed 40 trivial Post agglomeration. Transition count delta: 40
Iterating post reduction 0 with 40 rules applied. Total rules applied 40 place count 174 transition count 190
Reduce places removed 40 places and 0 transitions.
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Iterating post reduction 1 with 60 rules applied. Total rules applied 100 place count 134 transition count 170
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 101 place count 133 transition count 150
Iterating global reduction 2 with 1 rules applied. Total rules applied 102 place count 133 transition count 150
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 112 place count 123 transition count 140
Iterating global reduction 2 with 10 rules applied. Total rules applied 122 place count 123 transition count 140
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 2 with 20 rules applied. Total rules applied 142 place count 113 transition count 130
Applied a total of 142 rules in 13 ms. Remains 113 /174 variables (removed 61) and now considering 130/230 (removed 100) transitions.
// Phase 1: matrix 130 rows 113 cols
[2024-05-30 07:27:54] [INFO ] Computed 23 invariants in 1 ms
[2024-05-30 07:27:54] [INFO ] Implicit Places using invariants in 73 ms returned [72]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 74 ms to find 1 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 112/174 places, 130/230 transitions.
Applied a total of 0 rules in 2 ms. Remains 112 /112 variables (removed 0) and now considering 130/130 (removed 0) transitions.
Finished structural reductions in LI_LTL mode , in 2 iterations and 91 ms. Remains : 112/174 places, 130/230 transitions.
Running random walk in product with property : UtilityControlRoom-COL-Z2T3N10-LTLCardinality-07
Product exploration explored 100000 steps with 7350 reset in 206 ms.
Product exploration explored 100000 steps with 7308 reset in 226 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT p0)), (X (X (NOT p0))), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 93 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 122 ms :[(NOT p0), (NOT p0), (NOT p0)]
RANDOM walk for 83 steps (0 resets) in 4 ms. (16 steps per ms) remains 0/1 properties
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT p0)), (X (X (NOT p0))), (X (X p1))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 4 factoid took 105 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 107 ms :[(NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 104 ms :[(NOT p0), (NOT p0), (NOT p0)]
// Phase 1: matrix 130 rows 112 cols
[2024-05-30 07:27:55] [INFO ] Computed 22 invariants in 1 ms
[2024-05-30 07:27:55] [INFO ] [Real]Absence check using 22 positive place invariants in 11 ms returned sat
[2024-05-30 07:27:55] [INFO ] [Real]Absence check using state equation in 89 ms returned sat
[2024-05-30 07:27:55] [INFO ] Solution in real domain found non-integer solution.
[2024-05-30 07:27:55] [INFO ] [Nat]Absence check using 22 positive place invariants in 17 ms returned sat
[2024-05-30 07:27:55] [INFO ] [Nat]Absence check using state equation in 116 ms returned sat
[2024-05-30 07:27:55] [INFO ] Computed and/alt/rep : 110/210/110 causal constraints (skipped 0 transitions) in 18 ms.
[2024-05-30 07:27:56] [INFO ] Added : 107 causal constraints over 22 iterations in 384 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 10 out of 112 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 112/112 places, 130/130 transitions.
Applied a total of 0 rules in 2 ms. Remains 112 /112 variables (removed 0) and now considering 130/130 (removed 0) transitions.
[2024-05-30 07:27:56] [INFO ] Invariant cache hit.
[2024-05-30 07:27:56] [INFO ] Implicit Places using invariants in 87 ms returned []
[2024-05-30 07:27:56] [INFO ] Invariant cache hit.
[2024-05-30 07:27:56] [INFO ] Implicit Places using invariants and state equation in 158 ms returned []
Implicit Place search using SMT with State Equation took 247 ms to find 0 implicit places.
Running 110 sub problems to find dead transitions.
[2024-05-30 07:27:56] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/102 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/102 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 2 (OVERLAPS) 10/112 variables, 20/22 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/112 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 4 (OVERLAPS) 130/242 variables, 112/134 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/242 variables, 0/134 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 6 (OVERLAPS) 0/242 variables, 0/134 constraints. Problems are: Problem set: 0 solved, 110 unsolved
No progress, stopping.
After SMT solving in domain Real declared 242/242 variables, and 134 constraints, problems are : Problem set: 0 solved, 110 unsolved in 3688 ms.
Refiners :[Positive P Invariants (semi-flows): 22/22 constraints, State Equation: 112/112 constraints, PredecessorRefiner: 110/110 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 110 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/102 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/102 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 2 (OVERLAPS) 10/112 variables, 20/22 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/112 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 4 (OVERLAPS) 130/242 variables, 112/134 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/242 variables, 110/244 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/242 variables, 0/244 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 7 (OVERLAPS) 0/242 variables, 0/244 constraints. Problems are: Problem set: 0 solved, 110 unsolved
No progress, stopping.
After SMT solving in domain Int declared 242/242 variables, and 244 constraints, problems are : Problem set: 0 solved, 110 unsolved in 3899 ms.
Refiners :[Positive P Invariants (semi-flows): 22/22 constraints, State Equation: 112/112 constraints, PredecessorRefiner: 110/110 constraints, Known Traps: 0/0 constraints]
After SMT, in 7621ms problems are : Problem set: 0 solved, 110 unsolved
Search for dead transitions found 0 dead transitions in 7628ms
Finished structural reductions in LTL mode , in 1 iterations and 7879 ms. Remains : 112/112 places, 130/130 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(NOT p0), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 91 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 98 ms :[(NOT p0), (NOT p0), (NOT p0)]
RANDOM walk for 88 steps (0 resets) in 5 ms. (14 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 2 factoid took 107 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 117 ms :[(NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 115 ms :[(NOT p0), (NOT p0), (NOT p0)]
[2024-05-30 07:28:04] [INFO ] Invariant cache hit.
[2024-05-30 07:28:04] [INFO ] [Real]Absence check using 22 positive place invariants in 12 ms returned sat
[2024-05-30 07:28:04] [INFO ] [Real]Absence check using state equation in 88 ms returned sat
[2024-05-30 07:28:04] [INFO ] Solution in real domain found non-integer solution.
[2024-05-30 07:28:05] [INFO ] [Nat]Absence check using 22 positive place invariants in 15 ms returned sat
[2024-05-30 07:28:05] [INFO ] [Nat]Absence check using state equation in 103 ms returned sat
[2024-05-30 07:28:05] [INFO ] Computed and/alt/rep : 110/210/110 causal constraints (skipped 0 transitions) in 13 ms.
[2024-05-30 07:28:05] [INFO ] Added : 110 causal constraints over 22 iterations in 380 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 133 ms :[(NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 4094 reset in 205 ms.
Product exploration explored 100000 steps with 4091 reset in 224 ms.
Applying partial POR strategy [true, false, false]
Stuttering acceptance computed with spot in 126 ms :[(NOT p0), (NOT p0), (NOT p0)]
Support contains 10 out of 112 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 112/112 places, 130/130 transitions.
Performed 20 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 20 rules applied. Total rules applied 20 place count 112 transition count 130
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 30 place count 102 transition count 110
Deduced a syphon composed of 20 places in 0 ms
Iterating global reduction 1 with 10 rules applied. Total rules applied 40 place count 102 transition count 110
Discarding 20 places :
Symmetric choice reduction at 1 with 20 rule applications. Total rules 60 place count 82 transition count 90
Deduced a syphon composed of 10 places in 0 ms
Iterating global reduction 1 with 20 rules applied. Total rules applied 80 place count 82 transition count 90
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 90 place count 82 transition count 80
Deduced a syphon composed of 10 places in 0 ms
Applied a total of 90 rules in 15 ms. Remains 82 /112 variables (removed 30) and now considering 80/130 (removed 50) transitions.
[2024-05-30 07:28:06] [INFO ] Redundant transitions in 2 ms returned []
Running 70 sub problems to find dead transitions.
// Phase 1: matrix 80 rows 82 cols
[2024-05-30 07:28:06] [INFO ] Computed 22 invariants in 1 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/72 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/72 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 2 (OVERLAPS) 10/82 variables, 20/22 constraints. Problems are: Problem set: 0 solved, 70 unsolved
[2024-05-30 07:28:07] [INFO ] Deduced a trap composed of 5 places in 39 ms of which 2 ms to minimize.
Problem TDEAD1 is UNSAT
[2024-05-30 07:28:07] [INFO ] Deduced a trap composed of 5 places in 38 ms of which 1 ms to minimize.
[2024-05-30 07:28:07] [INFO ] Deduced a trap composed of 5 places in 37 ms of which 2 ms to minimize.
Problem TDEAD3 is UNSAT
[2024-05-30 07:28:07] [INFO ] Deduced a trap composed of 5 places in 39 ms of which 1 ms to minimize.
[2024-05-30 07:28:07] [INFO ] Deduced a trap composed of 5 places in 38 ms of which 1 ms to minimize.
[2024-05-30 07:28:07] [INFO ] Deduced a trap composed of 5 places in 38 ms of which 1 ms to minimize.
[2024-05-30 07:28:07] [INFO ] Deduced a trap composed of 5 places in 39 ms of which 1 ms to minimize.
[2024-05-30 07:28:07] [INFO ] Deduced a trap composed of 5 places in 44 ms of which 3 ms to minimize.
[2024-05-30 07:28:07] [INFO ] Deduced a trap composed of 5 places in 37 ms of which 2 ms to minimize.
[2024-05-30 07:28:07] [INFO ] Deduced a trap composed of 5 places in 27 ms of which 1 ms to minimize.
Problem TDEAD0 is UNSAT
Problem TDEAD2 is UNSAT
Problem TDEAD4 is UNSAT
Problem TDEAD5 is UNSAT
Problem TDEAD6 is UNSAT
Problem TDEAD7 is UNSAT
Problem TDEAD8 is UNSAT
Problem TDEAD9 is UNSAT
At refinement iteration 3 (INCLUDED_ONLY) 0/82 variables, 10/32 constraints. Problems are: Problem set: 10 solved, 60 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/82 variables, 0/32 constraints. Problems are: Problem set: 10 solved, 60 unsolved
At refinement iteration 5 (OVERLAPS) 80/162 variables, 82/114 constraints. Problems are: Problem set: 10 solved, 60 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/162 variables, 0/114 constraints. Problems are: Problem set: 10 solved, 60 unsolved
At refinement iteration 7 (OVERLAPS) 0/162 variables, 0/114 constraints. Problems are: Problem set: 10 solved, 60 unsolved
No progress, stopping.
After SMT solving in domain Real declared 162/162 variables, and 114 constraints, problems are : Problem set: 10 solved, 60 unsolved in 2648 ms.
Refiners :[Positive P Invariants (semi-flows): 22/22 constraints, State Equation: 82/82 constraints, PredecessorRefiner: 70/70 constraints, Known Traps: 10/10 constraints]
Escalating to Integer solving :Problem set: 10 solved, 60 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/62 variables, 0/0 constraints. Problems are: Problem set: 10 solved, 60 unsolved
At refinement iteration 1 (OVERLAPS) 20/82 variables, 22/22 constraints. Problems are: Problem set: 10 solved, 60 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/82 variables, 10/32 constraints. Problems are: Problem set: 10 solved, 60 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/82 variables, 0/32 constraints. Problems are: Problem set: 10 solved, 60 unsolved
At refinement iteration 4 (OVERLAPS) 80/162 variables, 82/114 constraints. Problems are: Problem set: 10 solved, 60 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/162 variables, 60/174 constraints. Problems are: Problem set: 10 solved, 60 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/162 variables, 0/174 constraints. Problems are: Problem set: 10 solved, 60 unsolved
At refinement iteration 7 (OVERLAPS) 0/162 variables, 0/174 constraints. Problems are: Problem set: 10 solved, 60 unsolved
No progress, stopping.
After SMT solving in domain Int declared 162/162 variables, and 174 constraints, problems are : Problem set: 10 solved, 60 unsolved in 1914 ms.
Refiners :[Positive P Invariants (semi-flows): 22/22 constraints, State Equation: 82/82 constraints, PredecessorRefiner: 60/70 constraints, Known Traps: 10/10 constraints]
After SMT, in 4585ms problems are : Problem set: 10 solved, 60 unsolved
Search for dead transitions found 10 dead transitions in 4587ms
Found 10 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 10 transitions
Dead transitions reduction (with SMT) removed 10 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 82/112 places, 70/130 transitions.
Graph (complete) has 130 edges and 82 vertex of which 72 are kept as prefixes of interest. Removing 10 places using SCC suffix rule.0 ms
Discarding 10 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 3 ms. Remains 72 /82 variables (removed 10) and now considering 70/70 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 72/112 places, 70/130 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 4615 ms. Remains : 72/112 places, 70/130 transitions.
Support contains 10 out of 112 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 112/112 places, 130/130 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 102 transition count 110
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 102 transition count 110
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 30 place count 92 transition count 100
Iterating global reduction 0 with 10 rules applied. Total rules applied 40 place count 92 transition count 100
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 50 place count 82 transition count 90
Iterating global reduction 0 with 10 rules applied. Total rules applied 60 place count 82 transition count 90
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 0 with 10 rules applied. Total rules applied 70 place count 82 transition count 80
Applied a total of 70 rules in 4 ms. Remains 82 /112 variables (removed 30) and now considering 80/130 (removed 50) transitions.
// Phase 1: matrix 80 rows 82 cols
[2024-05-30 07:28:11] [INFO ] Computed 22 invariants in 1 ms
[2024-05-30 07:28:11] [INFO ] Implicit Places using invariants in 54 ms returned []
[2024-05-30 07:28:11] [INFO ] Invariant cache hit.
[2024-05-30 07:28:11] [INFO ] Implicit Places using invariants and state equation in 89 ms returned []
Implicit Place search using SMT with State Equation took 147 ms to find 0 implicit places.
Running 70 sub problems to find dead transitions.
[2024-05-30 07:28:11] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/72 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/72 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 2 (OVERLAPS) 10/82 variables, 20/22 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/82 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 4 (OVERLAPS) 80/162 variables, 82/104 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/162 variables, 0/104 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 6 (OVERLAPS) 0/162 variables, 0/104 constraints. Problems are: Problem set: 0 solved, 70 unsolved
No progress, stopping.
After SMT solving in domain Real declared 162/162 variables, and 104 constraints, problems are : Problem set: 0 solved, 70 unsolved in 2056 ms.
Refiners :[Positive P Invariants (semi-flows): 22/22 constraints, State Equation: 82/82 constraints, PredecessorRefiner: 70/70 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 70 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/72 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/72 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 2 (OVERLAPS) 10/82 variables, 20/22 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/82 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 4 (OVERLAPS) 80/162 variables, 82/104 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/162 variables, 70/174 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/162 variables, 0/174 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 7 (OVERLAPS) 0/162 variables, 0/174 constraints. Problems are: Problem set: 0 solved, 70 unsolved
No progress, stopping.
After SMT solving in domain Int declared 162/162 variables, and 174 constraints, problems are : Problem set: 0 solved, 70 unsolved in 1741 ms.
Refiners :[Positive P Invariants (semi-flows): 22/22 constraints, State Equation: 82/82 constraints, PredecessorRefiner: 70/70 constraints, Known Traps: 0/0 constraints]
After SMT, in 3819ms problems are : Problem set: 0 solved, 70 unsolved
Search for dead transitions found 0 dead transitions in 3820ms
Starting structural reductions in LTL mode, iteration 1 : 82/112 places, 80/130 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3971 ms. Remains : 82/112 places, 80/130 transitions.
Treatment of property UtilityControlRoom-COL-Z2T3N10-LTLCardinality-07 finished in 21211 ms.
[2024-05-30 07:28:15] [INFO ] Flatten gal took : 20 ms
[2024-05-30 07:28:15] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/LTLCardinality.sr.xml took 3 ms.
[2024-05-30 07:28:15] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 174 places, 230 transitions and 690 arcs took 9 ms.
Total runtime 123847 ms.
There are residual formulas that ITS could not solve within timeout
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------

Running UtilityControlRoom-COL-Z2T3N10

IS_COLORED=
IS_NUPN=

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


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


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

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

Process ID: 1254
MODEL NAME: /home/mcc/execution/415/model
174 places, 230 transitions.

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

BK_STOP 1717054102991

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

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

Sequence of Actions to be Executed by the VM

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

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

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

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