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.r378-smll-171683810900156.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.....................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool itstools
Input is SimpleLoadBal-PT-05, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r378-smll-171683810900156
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 768K
-rw-r--r-- 1 mcc users 8.8K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 77K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 8.0K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 57K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.8K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 5.7K Apr 23 07:56 LTLCardinality.txt
-rw-r--r-- 1 mcc users 32K Apr 23 07:56 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.3K Apr 23 07:56 LTLFireability.txt
-rw-r--r-- 1 mcc users 22K Apr 23 07:56 LTLFireability.xml
-rw-r--r-- 1 mcc users 23K Apr 13 12:09 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 196K Apr 13 12:09 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 17K Apr 13 12:08 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 107K Apr 13 12:08 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Apr 23 07:56 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K Apr 23 07:56 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 3 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 155K 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 SimpleLoadBal-PT-05-LTLFireability-00
FORMULA_NAME SimpleLoadBal-PT-05-LTLFireability-01
FORMULA_NAME SimpleLoadBal-PT-05-LTLFireability-02
FORMULA_NAME SimpleLoadBal-PT-05-LTLFireability-03
FORMULA_NAME SimpleLoadBal-PT-05-LTLFireability-04
FORMULA_NAME SimpleLoadBal-PT-05-LTLFireability-05
FORMULA_NAME SimpleLoadBal-PT-05-LTLFireability-06
FORMULA_NAME SimpleLoadBal-PT-05-LTLFireability-07
FORMULA_NAME SimpleLoadBal-PT-05-LTLFireability-08
FORMULA_NAME SimpleLoadBal-PT-05-LTLFireability-09
FORMULA_NAME SimpleLoadBal-PT-05-LTLFireability-10
FORMULA_NAME SimpleLoadBal-PT-05-LTLFireability-11
FORMULA_NAME SimpleLoadBal-PT-05-LTLFireability-12
FORMULA_NAME SimpleLoadBal-PT-05-LTLFireability-13
FORMULA_NAME SimpleLoadBal-PT-05-LTLFireability-14
FORMULA_NAME SimpleLoadBal-PT-05-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1716958494058

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=SimpleLoadBal-PT-05
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202405141337
[2024-05-29 04:54:55] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-29 04:54:55] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-29 04:54:56] [INFO ] Load time of PNML (sax parser for PT used): 122 ms
[2024-05-29 04:54:56] [INFO ] Transformed 59 places.
[2024-05-29 04:54:56] [INFO ] Transformed 180 transitions.
[2024-05-29 04:54:56] [INFO ] Found NUPN structural information;
[2024-05-29 04:54:56] [INFO ] Completing missing partition info from NUPN : creating a component with [P_client_idle_1, P_client_idle_2, P_client_idle_3, P_client_idle_4, P_client_idle_5, P_client_waiting_1, P_client_waiting_2, P_client_waiting_3, P_client_waiting_4, P_client_waiting_5, P_client_request_1, P_client_request_2, P_client_request_3, P_client_request_4, P_client_request_5, P_client_ack_1, P_client_ack_2, P_client_ack_3, P_client_ack_4, P_client_ack_5, P_server_idle_1, P_server_idle_2, P_server_waiting_1, P_server_waiting_2, P_server_processed_1, P_server_processed_2, P_server_notification_1, P_server_notification_2, P_server_notification_ack_1, P_server_notification_ack_2, P_server_request_1_1, P_server_request_1_2, P_server_request_2_1, P_server_request_2_2, P_server_request_3_1, P_server_request_3_2, P_server_request_4_1, P_server_request_4_2, P_server_request_5_1, P_server_request_5_2, P_lb_idle_1, P_lb_routing_1_1, P_lb_routing_1_2, P_lb_routing_1_3, P_lb_routing_1_4, P_lb_routing_1_5, P_lb_balancing_1, P_lb_load_1_0, P_lb_load_1_1, P_lb_load_1_2, P_lb_load_1_3, P_lb_load_1_4, P_lb_load_1_5, P_lb_load_2_0, P_lb_load_2_1, P_lb_load_2_2, P_lb_load_2_3, P_lb_load_2_4, P_lb_load_2_5]
[2024-05-29 04:54:56] [INFO ] Parsed PT model containing 59 places and 180 transitions and 1158 arcs in 274 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 17 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 1 formulas.
FORMULA SimpleLoadBal-PT-05-LTLFireability-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 28 out of 59 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 59/59 places, 180/180 transitions.
Applied a total of 0 rules in 32 ms. Remains 59 /59 variables (removed 0) and now considering 180/180 (removed 0) transitions.
[2024-05-29 04:54:56] [INFO ] Flow matrix only has 140 transitions (discarded 40 similar events)
// Phase 1: matrix 140 rows 59 cols
[2024-05-29 04:54:56] [INFO ] Computed 19 invariants in 20 ms
[2024-05-29 04:54:56] [INFO ] Implicit Places using invariants in 436 ms returned [5, 6, 7, 8, 9, 22]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 497 ms to find 6 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 53/59 places, 180/180 transitions.
Applied a total of 0 rules in 4 ms. Remains 53 /53 variables (removed 0) and now considering 180/180 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 567 ms. Remains : 53/59 places, 180/180 transitions.
Support contains 28 out of 53 places after structural reductions.
[2024-05-29 04:54:57] [INFO ] Flatten gal took : 96 ms
[2024-05-29 04:54:57] [INFO ] Flatten gal took : 94 ms
[2024-05-29 04:54:57] [INFO ] Input system was already deterministic with 180 transitions.
Support contains 27 out of 53 places (down from 28) after GAL structural reductions.
Reduction of identical properties reduced properties to check from 31 to 28
RANDOM walk for 40000 steps (8 resets) in 3235 ms. (12 steps per ms) remains 8/28 properties
BEST_FIRST walk for 40004 steps (8 resets) in 567 ms. (70 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (8 resets) in 444 ms. (89 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 199 ms. (200 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 111 ms. (357 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 85 ms. (465 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 87 ms. (454 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (8 resets) in 130 ms. (305 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (8 resets) in 93 ms. (425 steps per ms) remains 8/8 properties
[2024-05-29 04:54:59] [INFO ] Flow matrix only has 140 transitions (discarded 40 similar events)
// Phase 1: matrix 140 rows 53 cols
[2024-05-29 04:54:59] [INFO ] Computed 13 invariants in 5 ms
[2024-05-29 04:54:59] [INFO ] State equation strengthened by 55 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/14 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/14 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 2 (OVERLAPS) 26/40 variables, 7/21 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/40 variables, 26/47 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/40 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 5 (OVERLAPS) 5/45 variables, 1/48 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/45 variables, 5/53 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/45 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 8 unsolved
Problem AtomicPropp13 is UNSAT
Problem AtomicPropp15 is UNSAT
Problem AtomicPropp21 is UNSAT
Problem AtomicPropp24 is UNSAT
Problem AtomicPropp27 is UNSAT
At refinement iteration 8 (OVERLAPS) 7/52 variables, 4/57 constraints. Problems are: Problem set: 5 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/52 variables, 7/64 constraints. Problems are: Problem set: 5 solved, 3 unsolved
[2024-05-29 04:55:00] [INFO ] Deduced a trap composed of 8 places in 219 ms of which 14 ms to minimize.
[2024-05-29 04:55:00] [INFO ] Deduced a trap composed of 29 places in 191 ms of which 4 ms to minimize.
Problem AtomicPropp7 is UNSAT
At refinement iteration 10 (INCLUDED_ONLY) 0/52 variables, 2/66 constraints. Problems are: Problem set: 6 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/52 variables, 0/66 constraints. Problems are: Problem set: 6 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 1/53 variables, 1/67 constraints. Problems are: Problem set: 6 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/53 variables, 1/68 constraints. Problems are: Problem set: 6 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/53 variables, 0/68 constraints. Problems are: Problem set: 6 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 140/193 variables, 53/121 constraints. Problems are: Problem set: 6 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/193 variables, 55/176 constraints. Problems are: Problem set: 6 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/193 variables, 0/176 constraints. Problems are: Problem set: 6 solved, 2 unsolved
At refinement iteration 18 (OVERLAPS) 0/193 variables, 0/176 constraints. Problems are: Problem set: 6 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 193/193 variables, and 176 constraints, problems are : Problem set: 6 solved, 2 unsolved in 1258 ms.
Refiners :[Domain max(s): 53/53 constraints, Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 53/53 constraints, ReadFeed: 55/55 constraints, PredecessorRefiner: 8/8 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 6 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 5/5 constraints. Problems are: Problem set: 6 solved, 2 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/5 variables, 0/5 constraints. Problems are: Problem set: 6 solved, 2 unsolved
At refinement iteration 2 (OVERLAPS) 24/29 variables, 5/10 constraints. Problems are: Problem set: 6 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/29 variables, 24/34 constraints. Problems are: Problem set: 6 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/29 variables, 1/35 constraints. Problems are: Problem set: 6 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/29 variables, 0/35 constraints. Problems are: Problem set: 6 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 15/44 variables, 3/38 constraints. Problems are: Problem set: 6 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/44 variables, 15/53 constraints. Problems are: Problem set: 6 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/44 variables, 0/53 constraints. Problems are: Problem set: 6 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 8/52 variables, 4/57 constraints. Problems are: Problem set: 6 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/52 variables, 8/65 constraints. Problems are: Problem set: 6 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/52 variables, 1/66 constraints. Problems are: Problem set: 6 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/52 variables, 0/66 constraints. Problems are: Problem set: 6 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 1/53 variables, 1/67 constraints. Problems are: Problem set: 6 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/53 variables, 1/68 constraints. Problems are: Problem set: 6 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/53 variables, 0/68 constraints. Problems are: Problem set: 6 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 140/193 variables, 53/121 constraints. Problems are: Problem set: 6 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/193 variables, 55/176 constraints. Problems are: Problem set: 6 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/193 variables, 2/178 constraints. Problems are: Problem set: 6 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/193 variables, 0/178 constraints. Problems are: Problem set: 6 solved, 2 unsolved
At refinement iteration 20 (OVERLAPS) 0/193 variables, 0/178 constraints. Problems are: Problem set: 6 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 193/193 variables, and 178 constraints, problems are : Problem set: 6 solved, 2 unsolved in 409 ms.
Refiners :[Domain max(s): 53/53 constraints, Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 53/53 constraints, ReadFeed: 55/55 constraints, PredecessorRefiner: 2/8 constraints, Known Traps: 2/2 constraints]
After SMT, in 1866ms problems are : Problem set: 6 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 221 ms.
Support contains 5 out of 53 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 53/53 places, 180/180 transitions.
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 6 Pre rules applied. Total rules applied 0 place count 53 transition count 174
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 0 with 12 rules applied. Total rules applied 12 place count 47 transition count 174
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 1 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 0 with 14 rules applied. Total rules applied 26 place count 40 transition count 167
Free-agglomeration rule (complex) applied 5 times.
Iterating global reduction 0 with 5 rules applied. Total rules applied 31 place count 40 transition count 162
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 36 place count 35 transition count 162
Applied a total of 36 rules in 167 ms. Remains 35 /53 variables (removed 18) and now considering 162/180 (removed 18) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 167 ms. Remains : 35/53 places, 162/180 transitions.
RANDOM walk for 40000 steps (8 resets) in 705 ms. (56 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (8 resets) in 166 ms. (239 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (8 resets) in 64 ms. (615 steps per ms) remains 2/2 properties
Probably explored full state space saw : 2007 states, properties seen :0
Probabilistic random walk after 10147 steps, saw 2007 distinct states, run finished after 167 ms. (steps per millisecond=60 ) properties seen :0
Explored full state space saw : 2007 states, properties seen :0
Exhaustive walk after 10147 steps, saw 2007 distinct states, run finished after 56 ms. (steps per millisecond=181 ) properties seen :0
Successfully simplified 8 atomic propositions for a total of 15 simplifications.
Initial state reduction rules removed 2 formulas.
FORMULA SimpleLoadBal-PT-05-LTLFireability-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SimpleLoadBal-PT-05-LTLFireability-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SimpleLoadBal-PT-05-LTLFireability-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 0 stabilizing places and 0 stable transitions
FORMULA SimpleLoadBal-PT-05-LTLFireability-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
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 3 out of 53 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 53/53 places, 180/180 transitions.
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 6 Pre rules applied. Total rules applied 0 place count 53 transition count 174
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 0 with 12 rules applied. Total rules applied 12 place count 47 transition count 174
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 1 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 0 with 14 rules applied. Total rules applied 26 place count 40 transition count 167
Applied a total of 26 rules in 21 ms. Remains 40 /53 variables (removed 13) and now considering 167/180 (removed 13) transitions.
[2024-05-29 04:55:03] [INFO ] Flow matrix only has 127 transitions (discarded 40 similar events)
// Phase 1: matrix 127 rows 40 cols
[2024-05-29 04:55:03] [INFO ] Computed 13 invariants in 3 ms
[2024-05-29 04:55:03] [INFO ] Implicit Places using invariants in 159 ms returned [7]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 163 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 39/53 places, 167/180 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 38 transition count 166
Applied a total of 2 rules in 19 ms. Remains 38 /39 variables (removed 1) and now considering 166/167 (removed 1) transitions.
[2024-05-29 04:55:03] [INFO ] Flow matrix only has 126 transitions (discarded 40 similar events)
// Phase 1: matrix 126 rows 38 cols
[2024-05-29 04:55:03] [INFO ] Computed 12 invariants in 4 ms
[2024-05-29 04:55:03] [INFO ] Implicit Places using invariants in 134 ms returned []
[2024-05-29 04:55:03] [INFO ] Flow matrix only has 126 transitions (discarded 40 similar events)
[2024-05-29 04:55:03] [INFO ] Invariant cache hit.
[2024-05-29 04:55:03] [INFO ] State equation strengthened by 55 read => feed constraints.
[2024-05-29 04:55:03] [INFO ] Implicit Places using invariants and state equation in 220 ms returned []
Implicit Place search using SMT with State Equation took 357 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 38/53 places, 166/180 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 561 ms. Remains : 38/53 places, 166/180 transitions.
Stuttering acceptance computed with spot in 207 ms :[(NOT p0)]
Running random walk in product with property : SimpleLoadBal-PT-05-LTLFireability-00
Product exploration explored 100000 steps with 0 reset in 499 ms.
Stack based approach found an accepted trace after 18 steps with 0 reset with depth 19 and stack size 19 in 0 ms.
FORMULA SimpleLoadBal-PT-05-LTLFireability-00 FALSE TECHNIQUES STACK_TEST
Treatment of property SimpleLoadBal-PT-05-LTLFireability-00 finished in 1359 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((p0&&F(G(p1))))))'
Support contains 3 out of 53 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 53/53 places, 180/180 transitions.
Applied a total of 0 rules in 2 ms. Remains 53 /53 variables (removed 0) and now considering 180/180 (removed 0) transitions.
[2024-05-29 04:55:04] [INFO ] Flow matrix only has 140 transitions (discarded 40 similar events)
// Phase 1: matrix 140 rows 53 cols
[2024-05-29 04:55:04] [INFO ] Computed 13 invariants in 2 ms
[2024-05-29 04:55:04] [INFO ] Implicit Places using invariants in 120 ms returned [17]
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 : 52/53 places, 180/180 transitions.
Applied a total of 0 rules in 3 ms. Remains 52 /52 variables (removed 0) and now considering 180/180 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 126 ms. Remains : 52/53 places, 180/180 transitions.
Stuttering acceptance computed with spot in 188 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), true, (NOT p1)]
Running random walk in product with property : SimpleLoadBal-PT-05-LTLFireability-01
Product exploration explored 100000 steps with 0 reset in 283 ms.
Stack based approach found an accepted trace after 162 steps with 0 reset with depth 163 and stack size 163 in 1 ms.
FORMULA SimpleLoadBal-PT-05-LTLFireability-01 FALSE TECHNIQUES STACK_TEST
Treatment of property SimpleLoadBal-PT-05-LTLFireability-01 finished in 614 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 3 out of 53 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 53/53 places, 180/180 transitions.
Applied a total of 0 rules in 2 ms. Remains 53 /53 variables (removed 0) and now considering 180/180 (removed 0) transitions.
[2024-05-29 04:55:05] [INFO ] Flow matrix only has 140 transitions (discarded 40 similar events)
[2024-05-29 04:55:05] [INFO ] Invariant cache hit.
[2024-05-29 04:55:05] [INFO ] Implicit Places using invariants in 125 ms returned [17]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 126 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 52/53 places, 180/180 transitions.
Applied a total of 0 rules in 2 ms. Remains 52 /52 variables (removed 0) and now considering 180/180 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 131 ms. Remains : 52/53 places, 180/180 transitions.
Stuttering acceptance computed with spot in 74 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : SimpleLoadBal-PT-05-LTLFireability-02
Product exploration explored 100000 steps with 112 reset in 361 ms.
Stack based approach found an accepted trace after 275 steps with 0 reset with depth 276 and stack size 276 in 8 ms.
FORMULA SimpleLoadBal-PT-05-LTLFireability-02 FALSE TECHNIQUES STACK_TEST
Treatment of property SimpleLoadBal-PT-05-LTLFireability-02 finished in 589 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((X((G(F(p2))&&p1))&&p0)))'
Support contains 7 out of 53 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 53/53 places, 180/180 transitions.
Applied a total of 0 rules in 2 ms. Remains 53 /53 variables (removed 0) and now considering 180/180 (removed 0) transitions.
[2024-05-29 04:55:05] [INFO ] Flow matrix only has 140 transitions (discarded 40 similar events)
[2024-05-29 04:55:05] [INFO ] Invariant cache hit.
[2024-05-29 04:55:05] [INFO ] Implicit Places using invariants in 131 ms returned [17]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 133 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 52/53 places, 180/180 transitions.
Applied a total of 0 rules in 2 ms. Remains 52 /52 variables (removed 0) and now considering 180/180 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 137 ms. Remains : 52/53 places, 180/180 transitions.
Stuttering acceptance computed with spot in 185 ms :[(OR (NOT p0) (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2)), (NOT p2), (NOT p2)]
Running random walk in product with property : SimpleLoadBal-PT-05-LTLFireability-03
Product exploration explored 100000 steps with 9 reset in 218 ms.
Stack based approach found an accepted trace after 590 steps with 1 reset with depth 351 and stack size 351 in 2 ms.
FORMULA SimpleLoadBal-PT-05-LTLFireability-03 FALSE TECHNIQUES STACK_TEST
Treatment of property SimpleLoadBal-PT-05-LTLFireability-03 finished in 571 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(p0) U p1)))'
Support contains 5 out of 53 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 53/53 places, 180/180 transitions.
Applied a total of 0 rules in 2 ms. Remains 53 /53 variables (removed 0) and now considering 180/180 (removed 0) transitions.
[2024-05-29 04:55:06] [INFO ] Flow matrix only has 140 transitions (discarded 40 similar events)
[2024-05-29 04:55:06] [INFO ] Invariant cache hit.
[2024-05-29 04:55:06] [INFO ] Implicit Places using invariants in 104 ms returned [17]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 106 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 52/53 places, 180/180 transitions.
Applied a total of 0 rules in 2 ms. Remains 52 /52 variables (removed 0) and now considering 180/180 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 110 ms. Remains : 52/53 places, 180/180 transitions.
Stuttering acceptance computed with spot in 93 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), true]
Running random walk in product with property : SimpleLoadBal-PT-05-LTLFireability-04
Entered a terminal (fully accepting) state of product in 3 steps with 0 reset in 0 ms.
FORMULA SimpleLoadBal-PT-05-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SimpleLoadBal-PT-05-LTLFireability-04 finished in 220 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((F(p1)&&F(p2)))&&p0)))'
Support contains 5 out of 53 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 53/53 places, 180/180 transitions.
Applied a total of 0 rules in 2 ms. Remains 53 /53 variables (removed 0) and now considering 180/180 (removed 0) transitions.
[2024-05-29 04:55:06] [INFO ] Flow matrix only has 140 transitions (discarded 40 similar events)
[2024-05-29 04:55:06] [INFO ] Invariant cache hit.
[2024-05-29 04:55:06] [INFO ] Implicit Places using invariants in 98 ms returned []
[2024-05-29 04:55:06] [INFO ] Flow matrix only has 140 transitions (discarded 40 similar events)
[2024-05-29 04:55:06] [INFO ] Invariant cache hit.
[2024-05-29 04:55:06] [INFO ] State equation strengthened by 55 read => feed constraints.
[2024-05-29 04:55:06] [INFO ] Implicit Places using invariants and state equation in 195 ms returned []
Implicit Place search using SMT with State Equation took 298 ms to find 0 implicit places.
Running 175 sub problems to find dead transitions.
[2024-05-29 04:55:06] [INFO ] Flow matrix only has 140 transitions (discarded 40 similar events)
[2024-05-29 04:55:06] [INFO ] Invariant cache hit.
[2024-05-29 04:55:06] [INFO ] State equation strengthened by 55 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/48 variables, 48/48 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/48 variables, 4/52 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/48 variables, 2/54 constraints. Problems are: Problem set: 0 solved, 175 unsolved
[2024-05-29 04:55:07] [INFO ] Deduced a trap composed of 16 places in 52 ms of which 1 ms to minimize.
Problem TDEAD129 is UNSAT
At refinement iteration 3 (INCLUDED_ONLY) 0/48 variables, 1/55 constraints. Problems are: Problem set: 1 solved, 174 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/48 variables, 0/55 constraints. Problems are: Problem set: 1 solved, 174 unsolved
At refinement iteration 5 (OVERLAPS) 5/53 variables, 5/60 constraints. Problems are: Problem set: 1 solved, 174 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/53 variables, 5/65 constraints. Problems are: Problem set: 1 solved, 174 unsolved
Problem TDEAD36 is UNSAT
Problem TDEAD37 is UNSAT
Problem TDEAD38 is UNSAT
Problem TDEAD46 is UNSAT
Problem TDEAD47 is UNSAT
Problem TDEAD48 is UNSAT
Problem TDEAD56 is UNSAT
Problem TDEAD57 is UNSAT
Problem TDEAD58 is UNSAT
Problem TDEAD66 is UNSAT
Problem TDEAD67 is UNSAT
Problem TDEAD68 is UNSAT
Problem TDEAD76 is UNSAT
Problem TDEAD77 is UNSAT
Problem TDEAD78 is UNSAT
Problem TDEAD82 is UNSAT
Problem TDEAD83 is UNSAT
Problem TDEAD87 is UNSAT
Problem TDEAD88 is UNSAT
Problem TDEAD92 is UNSAT
Problem TDEAD93 is UNSAT
Problem TDEAD97 is UNSAT
Problem TDEAD98 is UNSAT
Problem TDEAD102 is UNSAT
Problem TDEAD103 is UNSAT
Problem TDEAD126 is UNSAT
Problem TDEAD127 is UNSAT
Problem TDEAD128 is UNSAT
Problem TDEAD145 is UNSAT
Problem TDEAD146 is UNSAT
Problem TDEAD147 is UNSAT
Problem TDEAD148 is UNSAT
Problem TDEAD149 is UNSAT
Problem TDEAD165 is UNSAT
Problem TDEAD166 is UNSAT
Problem TDEAD167 is UNSAT
Problem TDEAD168 is UNSAT
Problem TDEAD169 is UNSAT
At refinement iteration 7 (INCLUDED_ONLY) 0/53 variables, 2/67 constraints. Problems are: Problem set: 39 solved, 136 unsolved
[2024-05-29 04:55:10] [INFO ] Deduced a trap composed of 12 places in 79 ms of which 1 ms to minimize.
[2024-05-29 04:55:10] [INFO ] Deduced a trap composed of 9 places in 69 ms of which 1 ms to minimize.
[2024-05-29 04:55:10] [INFO ] Deduced a trap composed of 11 places in 89 ms of which 1 ms to minimize.
[2024-05-29 04:55:10] [INFO ] Deduced a trap composed of 8 places in 83 ms of which 1 ms to minimize.
[2024-05-29 04:55:10] [INFO ] Deduced a trap composed of 28 places in 79 ms of which 2 ms to minimize.
Problem TDEAD124 is UNSAT
[2024-05-29 04:55:11] [INFO ] Deduced a trap composed of 27 places in 67 ms of which 2 ms to minimize.
Problem TDEAD125 is UNSAT
[2024-05-29 04:55:11] [INFO ] Deduced a trap composed of 30 places in 63 ms of which 1 ms to minimize.
Problem TDEAD108 is UNSAT
At refinement iteration 8 (INCLUDED_ONLY) 0/53 variables, 7/74 constraints. Problems are: Problem set: 42 solved, 133 unsolved
[2024-05-29 04:55:11] [INFO ] Deduced a trap composed of 9 places in 64 ms of which 1 ms to minimize.
[2024-05-29 04:55:11] [INFO ] Deduced a trap composed of 8 places in 71 ms of which 3 ms to minimize.
[2024-05-29 04:55:11] [INFO ] Deduced a trap composed of 9 places in 62 ms of which 1 ms to minimize.
[2024-05-29 04:55:11] [INFO ] Deduced a trap composed of 11 places in 69 ms of which 1 ms to minimize.
[2024-05-29 04:55:11] [INFO ] Deduced a trap composed of 13 places in 78 ms of which 1 ms to minimize.
Problem TDEAD113 is UNSAT
At refinement iteration 9 (INCLUDED_ONLY) 0/53 variables, 5/79 constraints. Problems are: Problem set: 43 solved, 132 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/53 variables, 0/79 constraints. Problems are: Problem set: 43 solved, 132 unsolved
At refinement iteration 11 (OVERLAPS) 140/193 variables, 53/132 constraints. Problems are: Problem set: 43 solved, 132 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/193 variables, 55/187 constraints. Problems are: Problem set: 43 solved, 132 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/193 variables, 0/187 constraints. Problems are: Problem set: 43 solved, 132 unsolved
At refinement iteration 14 (OVERLAPS) 0/193 variables, 0/187 constraints. Problems are: Problem set: 43 solved, 132 unsolved
No progress, stopping.
After SMT solving in domain Real declared 193/193 variables, and 187 constraints, problems are : Problem set: 43 solved, 132 unsolved in 8741 ms.
Refiners :[Domain max(s): 53/53 constraints, Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 53/53 constraints, ReadFeed: 55/55 constraints, PredecessorRefiner: 175/175 constraints, Known Traps: 13/13 constraints]
Escalating to Integer solving :Problem set: 43 solved, 132 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/48 variables, 48/48 constraints. Problems are: Problem set: 43 solved, 132 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/48 variables, 4/52 constraints. Problems are: Problem set: 43 solved, 132 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/48 variables, 2/54 constraints. Problems are: Problem set: 43 solved, 132 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/48 variables, 7/61 constraints. Problems are: Problem set: 43 solved, 132 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/48 variables, 0/61 constraints. Problems are: Problem set: 43 solved, 132 unsolved
At refinement iteration 5 (OVERLAPS) 5/53 variables, 5/66 constraints. Problems are: Problem set: 43 solved, 132 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/53 variables, 5/71 constraints. Problems are: Problem set: 43 solved, 132 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/53 variables, 2/73 constraints. Problems are: Problem set: 43 solved, 132 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/53 variables, 6/79 constraints. Problems are: Problem set: 43 solved, 132 unsolved
[2024-05-29 04:55:17] [INFO ] Deduced a trap composed of 9 places in 77 ms of which 1 ms to minimize.
[2024-05-29 04:55:17] [INFO ] Deduced a trap composed of 8 places in 71 ms of which 1 ms to minimize.
[2024-05-29 04:55:17] [INFO ] Deduced a trap composed of 8 places in 82 ms of which 1 ms to minimize.
Problem TDEAD112 is UNSAT
At refinement iteration 9 (INCLUDED_ONLY) 0/53 variables, 3/82 constraints. Problems are: Problem set: 44 solved, 131 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/53 variables, 0/82 constraints. Problems are: Problem set: 44 solved, 131 unsolved
At refinement iteration 11 (OVERLAPS) 140/193 variables, 53/135 constraints. Problems are: Problem set: 44 solved, 131 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/193 variables, 55/190 constraints. Problems are: Problem set: 44 solved, 131 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/193 variables, 131/321 constraints. Problems are: Problem set: 44 solved, 131 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/193 variables, 0/321 constraints. Problems are: Problem set: 44 solved, 131 unsolved
At refinement iteration 15 (OVERLAPS) 0/193 variables, 0/321 constraints. Problems are: Problem set: 44 solved, 131 unsolved
No progress, stopping.
After SMT solving in domain Int declared 193/193 variables, and 321 constraints, problems are : Problem set: 44 solved, 131 unsolved in 7223 ms.
Refiners :[Domain max(s): 53/53 constraints, Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 53/53 constraints, ReadFeed: 55/55 constraints, PredecessorRefiner: 131/175 constraints, Known Traps: 16/16 constraints]
After SMT, in 16343ms problems are : Problem set: 44 solved, 131 unsolved
Search for dead transitions found 44 dead transitions in 16349ms
Found 44 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 44 transitions
Dead transitions reduction (with SMT) removed 44 transitions
Starting structural reductions in LTL mode, iteration 1 : 53/53 places, 136/180 transitions.
Reduce places removed 2 places and 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 51 transition count 134
Reduce places removed 1 places and 6 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 3 place count 50 transition count 128
Applied a total of 3 rules in 2 ms. Remains 50 /53 variables (removed 3) and now considering 128/136 (removed 8) transitions.
[2024-05-29 04:55:23] [INFO ] Flow matrix only has 104 transitions (discarded 24 similar events)
// Phase 1: matrix 104 rows 50 cols
[2024-05-29 04:55:23] [INFO ] Computed 13 invariants in 2 ms
[2024-05-29 04:55:23] [INFO ] Implicit Places using invariants in 88 ms returned []
[2024-05-29 04:55:23] [INFO ] Flow matrix only has 104 transitions (discarded 24 similar events)
[2024-05-29 04:55:23] [INFO ] Invariant cache hit.
[2024-05-29 04:55:23] [INFO ] State equation strengthened by 37 read => feed constraints.
[2024-05-29 04:55:23] [INFO ] Implicit Places using invariants and state equation in 188 ms returned []
Implicit Place search using SMT with State Equation took 287 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 50/53 places, 128/180 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 16943 ms. Remains : 50/53 places, 128/180 transitions.
Stuttering acceptance computed with spot in 238 ms :[(OR (NOT p0) (NOT p1) (NOT p2)), (OR (NOT p0) (NOT p1) (NOT p2)), true, (NOT p1), (NOT p2), (OR (NOT p1) (NOT p2))]
Running random walk in product with property : SimpleLoadBal-PT-05-LTLFireability-05
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA SimpleLoadBal-PT-05-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SimpleLoadBal-PT-05-LTLFireability-05 finished in 17199 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(p0)))))'
Support contains 3 out of 53 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 53/53 places, 180/180 transitions.
Applied a total of 0 rules in 3 ms. Remains 53 /53 variables (removed 0) and now considering 180/180 (removed 0) transitions.
[2024-05-29 04:55:23] [INFO ] Flow matrix only has 140 transitions (discarded 40 similar events)
// Phase 1: matrix 140 rows 53 cols
[2024-05-29 04:55:23] [INFO ] Computed 13 invariants in 2 ms
[2024-05-29 04:55:23] [INFO ] Implicit Places using invariants in 109 ms returned [17]
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 : 52/53 places, 180/180 transitions.
Applied a total of 0 rules in 2 ms. Remains 52 /52 variables (removed 0) and now considering 180/180 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 116 ms. Remains : 52/53 places, 180/180 transitions.
Stuttering acceptance computed with spot in 108 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : SimpleLoadBal-PT-05-LTLFireability-09
Product exploration explored 100000 steps with 33333 reset in 192 ms.
Product exploration explored 100000 steps with 33333 reset in 275 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to conjunction of knowledge (Minato strategy)
Knowledge based reduction with 3 factoid took 87 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA SimpleLoadBal-PT-05-LTLFireability-09 TRUE TECHNIQUES KNOWLEDGE
Treatment of property SimpleLoadBal-PT-05-LTLFireability-09 finished in 814 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(G(p0))))'
Support contains 3 out of 53 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 53/53 places, 180/180 transitions.
Applied a total of 0 rules in 2 ms. Remains 53 /53 variables (removed 0) and now considering 180/180 (removed 0) transitions.
[2024-05-29 04:55:24] [INFO ] Flow matrix only has 140 transitions (discarded 40 similar events)
[2024-05-29 04:55:24] [INFO ] Invariant cache hit.
[2024-05-29 04:55:24] [INFO ] Implicit Places using invariants in 138 ms returned [17]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 139 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 52/53 places, 180/180 transitions.
Applied a total of 0 rules in 2 ms. Remains 52 /52 variables (removed 0) and now considering 180/180 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 143 ms. Remains : 52/53 places, 180/180 transitions.
Stuttering acceptance computed with spot in 120 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : SimpleLoadBal-PT-05-LTLFireability-10
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA SimpleLoadBal-PT-05-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SimpleLoadBal-PT-05-LTLFireability-10 finished in 282 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(p1)))))'
Support contains 5 out of 53 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 53/53 places, 180/180 transitions.
Applied a total of 0 rules in 2 ms. Remains 53 /53 variables (removed 0) and now considering 180/180 (removed 0) transitions.
[2024-05-29 04:55:24] [INFO ] Flow matrix only has 140 transitions (discarded 40 similar events)
[2024-05-29 04:55:24] [INFO ] Invariant cache hit.
[2024-05-29 04:55:24] [INFO ] Implicit Places using invariants in 95 ms returned [17]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 96 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 52/53 places, 180/180 transitions.
Applied a total of 0 rules in 1 ms. Remains 52 /52 variables (removed 0) and now considering 180/180 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 100 ms. Remains : 52/53 places, 180/180 transitions.
Stuttering acceptance computed with spot in 117 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : SimpleLoadBal-PT-05-LTLFireability-11
Product exploration explored 100000 steps with 9664 reset in 208 ms.
Stack based approach found an accepted trace after 19813 steps with 1907 reset with depth 15 and stack size 15 in 53 ms.
FORMULA SimpleLoadBal-PT-05-LTLFireability-11 FALSE TECHNIQUES STACK_TEST
Treatment of property SimpleLoadBal-PT-05-LTLFireability-11 finished in 492 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 U p1) U X(p0)))))'
Support contains 7 out of 53 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 53/53 places, 180/180 transitions.
Applied a total of 0 rules in 1 ms. Remains 53 /53 variables (removed 0) and now considering 180/180 (removed 0) transitions.
[2024-05-29 04:55:25] [INFO ] Flow matrix only has 140 transitions (discarded 40 similar events)
[2024-05-29 04:55:25] [INFO ] Invariant cache hit.
[2024-05-29 04:55:25] [INFO ] Implicit Places using invariants in 86 ms returned [17]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 87 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 52/53 places, 180/180 transitions.
Applied a total of 0 rules in 1 ms. Remains 52 /52 variables (removed 0) and now considering 180/180 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 90 ms. Remains : 52/53 places, 180/180 transitions.
Stuttering acceptance computed with spot in 162 ms :[(NOT p0), (NOT p0), (AND (NOT p1) (NOT p0)), (NOT p0)]
Running random walk in product with property : SimpleLoadBal-PT-05-LTLFireability-13
Product exploration explored 100000 steps with 291 reset in 261 ms.
Stack based approach found an accepted trace after 167 steps with 1 reset with depth 146 and stack size 146 in 1 ms.
FORMULA SimpleLoadBal-PT-05-LTLFireability-13 FALSE TECHNIQUES STACK_TEST
Treatment of property SimpleLoadBal-PT-05-LTLFireability-13 finished in 534 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) U X((!p1 U (G(!p1)||(!p1&&(!p2 U (!p0||G(!p2))))))))))'
Support contains 9 out of 53 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 53/53 places, 180/180 transitions.
Applied a total of 0 rules in 1 ms. Remains 53 /53 variables (removed 0) and now considering 180/180 (removed 0) transitions.
[2024-05-29 04:55:25] [INFO ] Flow matrix only has 140 transitions (discarded 40 similar events)
[2024-05-29 04:55:25] [INFO ] Invariant cache hit.
[2024-05-29 04:55:25] [INFO ] Implicit Places using invariants in 114 ms returned [17]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 115 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 52/53 places, 180/180 transitions.
Applied a total of 0 rules in 2 ms. Remains 52 /52 variables (removed 0) and now considering 180/180 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 118 ms. Remains : 52/53 places, 180/180 transitions.
Stuttering acceptance computed with spot in 335 ms :[p1, p1, p1, p1, true, (AND p1 p0 p2), p0, (AND p0 p2)]
Running random walk in product with property : SimpleLoadBal-PT-05-LTLFireability-15
Product exploration explored 100000 steps with 33333 reset in 122 ms.
Product exploration explored 100000 steps with 33333 reset in 127 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p2) (NOT p1)), (X (NOT p0)), (X (X (NOT p2))), (X (X (NOT (AND p0 p2 (NOT p1))))), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND p0 (NOT p2) (NOT p1))))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 9 factoid took 22 ms. Reduced automaton from 8 states, 20 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA SimpleLoadBal-PT-05-LTLFireability-15 TRUE TECHNIQUES KNOWLEDGE
Treatment of property SimpleLoadBal-PT-05-LTLFireability-15 finished in 766 ms.
All properties solved by simple procedures.
Total runtime 30680 ms.

BK_STOP 1716958526527

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

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

Sequence of Actions to be Executed by the VM

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

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool itstools"
echo " Input is SimpleLoadBal-PT-05, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r378-smll-171683810900156"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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

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