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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 520K
-rw-r--r-- 1 mcc users 6.1K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 61K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.3K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 49K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:42 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K May 18 16:42 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.4K Apr 22 14:33 LTLCardinality.txt
-rw-r--r-- 1 mcc users 22K Apr 22 14:33 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K May 19 07:14 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 19 18:02 LTLFireability.xml
-rw-r--r-- 1 mcc users 15K Apr 12 23:10 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 169K Apr 12 23:10 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.5K Apr 12 23:09 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 86K Apr 12 23:09 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Apr 22 14:33 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Apr 22 14:33 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 8 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 9.2K May 18 16:42 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 ClientsAndServers-PT-N0100P0-LTLFireability-00
FORMULA_NAME ClientsAndServers-PT-N0100P0-LTLFireability-01
FORMULA_NAME ClientsAndServers-PT-N0100P0-LTLFireability-02
FORMULA_NAME ClientsAndServers-PT-N0100P0-LTLFireability-03
FORMULA_NAME ClientsAndServers-PT-N0100P0-LTLFireability-04
FORMULA_NAME ClientsAndServers-PT-N0100P0-LTLFireability-05
FORMULA_NAME ClientsAndServers-PT-N0100P0-LTLFireability-06
FORMULA_NAME ClientsAndServers-PT-N0100P0-LTLFireability-07
FORMULA_NAME ClientsAndServers-PT-N0100P0-LTLFireability-08
FORMULA_NAME ClientsAndServers-PT-N0100P0-LTLFireability-09
FORMULA_NAME ClientsAndServers-PT-N0100P0-LTLFireability-10
FORMULA_NAME ClientsAndServers-PT-N0100P0-LTLFireability-11
FORMULA_NAME ClientsAndServers-PT-N0100P0-LTLFireability-12
FORMULA_NAME ClientsAndServers-PT-N0100P0-LTLFireability-13
FORMULA_NAME ClientsAndServers-PT-N0100P0-LTLFireability-14
FORMULA_NAME ClientsAndServers-PT-N0100P0-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1717207454225

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ClientsAndServers-PT-N0100P0
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 02:04:15] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2024-06-01 02:04:15] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 02:04:15] [INFO ] Load time of PNML (sax parser for PT used): 35 ms
[2024-06-01 02:04:15] [INFO ] Transformed 25 places.
[2024-06-01 02:04:15] [INFO ] Transformed 18 transitions.
[2024-06-01 02:04:15] [INFO ] Parsed PT model containing 25 places and 18 transitions and 54 arcs in 135 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 13 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 5 formulas.
FORMULA ClientsAndServers-PT-N0100P0-LTLFireability-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ClientsAndServers-PT-N0100P0-LTLFireability-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ClientsAndServers-PT-N0100P0-LTLFireability-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ClientsAndServers-PT-N0100P0-LTLFireability-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ClientsAndServers-PT-N0100P0-LTLFireability-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ClientsAndServers-PT-N0100P0-LTLFireability-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ClientsAndServers-PT-N0100P0-LTLFireability-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 13 out of 25 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 25/25 places, 18/18 transitions.
Discarding 3 places :
Implicit places reduction removed 3 places
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 22 transition count 18
Applied a total of 3 rules in 19 ms. Remains 22 /25 variables (removed 3) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 22 cols
[2024-06-01 02:04:15] [INFO ] Computed 5 invariants in 7 ms
[2024-06-01 02:04:15] [INFO ] Implicit Places using invariants in 151 ms returned [14]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 181 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 21/25 places, 18/18 transitions.
Applied a total of 0 rules in 0 ms. Remains 21 /21 variables (removed 0) and now considering 18/18 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 218 ms. Remains : 21/25 places, 18/18 transitions.
Support contains 13 out of 21 places after structural reductions.
[2024-06-01 02:04:16] [INFO ] Flatten gal took : 15 ms
[2024-06-01 02:04:16] [INFO ] Flatten gal took : 5 ms
[2024-06-01 02:04:16] [INFO ] Input system was already deterministic with 18 transitions.
RANDOM walk for 40180 steps (8 resets) in 138 ms. (289 steps per ms) remains 3/12 properties
BEST_FIRST walk for 3791 steps (0 resets) in 27 ms. (135 steps per ms) remains 0/3 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' '!((X(X(G(p0)))||(p1 U X(!p2))))'
Support contains 6 out of 21 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 21/21 places, 18/18 transitions.
Applied a total of 0 rules in 1 ms. Remains 21 /21 variables (removed 0) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 21 cols
[2024-06-01 02:04:16] [INFO ] Computed 4 invariants in 2 ms
[2024-06-01 02:04:16] [INFO ] Implicit Places using invariants in 52 ms returned []
[2024-06-01 02:04:16] [INFO ] Invariant cache hit.
[2024-06-01 02:04:16] [INFO ] Implicit Places using invariants and state equation in 51 ms returned []
Implicit Place search using SMT with State Equation took 105 ms to find 0 implicit places.
Running 17 sub problems to find dead transitions.
[2024-06-01 02:04:16] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/20 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/20 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/20 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 3 (OVERLAPS) 1/21 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/21 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 5 (OVERLAPS) 18/39 variables, 21/25 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/39 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 7 (OVERLAPS) 0/39 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 17 unsolved
No progress, stopping.
After SMT solving in domain Real declared 39/39 variables, and 25 constraints, problems are : Problem set: 0 solved, 17 unsolved in 407 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 21/21 constraints, PredecessorRefiner: 17/17 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 17 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/20 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/20 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/20 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 3 (OVERLAPS) 1/21 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/21 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 5 (OVERLAPS) 18/39 variables, 21/25 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/39 variables, 17/42 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/39 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 8 (OVERLAPS) 0/39 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 17 unsolved
No progress, stopping.
After SMT solving in domain Int declared 39/39 variables, and 42 constraints, problems are : Problem set: 0 solved, 17 unsolved in 253 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 21/21 constraints, PredecessorRefiner: 17/17 constraints, Known Traps: 0/0 constraints]
After SMT, in 701ms problems are : Problem set: 0 solved, 17 unsolved
Search for dead transitions found 0 dead transitions in 709ms
Finished structural reductions in LTL mode , in 1 iterations and 816 ms. Remains : 21/21 places, 18/18 transitions.
Stuttering acceptance computed with spot in 732 ms :[true, (AND (NOT p0) p2), (NOT p0), (AND (NOT p0) p2), (AND (NOT p0) p2), p2, p2, (AND (NOT p0) p2), (AND (NOT p0) p2)]
Running random walk in product with property : ClientsAndServers-PT-N0100P0-LTLFireability-00
Product exploration explored 100000 steps with 50000 reset in 187 ms.
Product exploration explored 100000 steps with 50000 reset in 94 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0) (NOT p2)), (X (NOT p2)), (X (NOT (AND (NOT p1) p2))), (X (NOT (AND p1 p2))), (X (NOT p1)), (X (X (NOT p2))), (X (X (NOT (AND p1 p2 p0)))), (X (X (NOT (AND p2 p0)))), (X (X (NOT (AND p2 (NOT p0))))), (X (X (NOT (AND (NOT p1) p2 (NOT p0))))), (X (X (NOT (AND p1 p2 (NOT p0))))), (X (X (NOT p0))), (X (X (NOT (AND (NOT p1) p2 p0)))), (X (X (NOT p1)))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 14 factoid took 30 ms. Reduced automaton from 9 states, 17 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA ClientsAndServers-PT-N0100P0-LTLFireability-00 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ClientsAndServers-PT-N0100P0-LTLFireability-00 finished in 1946 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((G(p0) U (F(p1) U p2)))))'
Support contains 4 out of 21 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 21/21 places, 18/18 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 20 transition count 16
Reduce places removed 2 places and 0 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Iterating post reduction 1 with 6 rules applied. Total rules applied 9 place count 18 transition count 12
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 13 place count 14 transition count 12
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 13 place count 14 transition count 10
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 17 place count 12 transition count 10
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 19 place count 11 transition count 9
Applied a total of 19 rules in 16 ms. Remains 11 /21 variables (removed 10) and now considering 9/18 (removed 9) transitions.
// Phase 1: matrix 9 rows 11 cols
[2024-06-01 02:04:18] [INFO ] Computed 3 invariants in 1 ms
[2024-06-01 02:04:18] [INFO ] Implicit Places using invariants in 20 ms returned [10]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 21 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 10/21 places, 9/18 transitions.
Applied a total of 0 rules in 1 ms. Remains 10 /10 variables (removed 0) and now considering 9/9 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 38 ms. Remains : 10/21 places, 9/18 transitions.
Stuttering acceptance computed with spot in 276 ms :[(NOT p2), (AND (NOT p1) (NOT p2)), (NOT p2), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p2)), (NOT p2)]
Running random walk in product with property : ClientsAndServers-PT-N0100P0-LTLFireability-02
Product exploration explored 100000 steps with 16318 reset in 171 ms.
Product exploration explored 100000 steps with 16276 reset in 208 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 p2) (NOT p1) (NOT p0)), (X (NOT p2)), (X (NOT (AND (NOT p2) (NOT p1) p0))), (X (NOT (AND p2 (NOT p1) p0))), (X (AND (NOT p2) (NOT p1))), (X (AND (NOT p2) (NOT p0))), (X (NOT (AND p2 (NOT p1) (NOT p0)))), (X (NOT (OR (AND p2 (NOT p1)) (AND (NOT p1) p0)))), (X (AND (NOT p2) (NOT p1) (NOT p0))), (X (NOT (AND (NOT p2) p0))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT p2))), (X (X (NOT (AND (NOT p2) (NOT p1) p0)))), (X (X (NOT (AND p2 (NOT p1) p0)))), (X (X (AND (NOT p2) (NOT p0)))), (X (X (NOT (AND p2 (NOT p1) (NOT p0))))), (X (X (NOT (OR (AND p2 (NOT p1)) (AND (NOT p1) p0))))), (X (X (NOT (AND (NOT p2) p0)))), (X (X (NOT p0)))]
False Knowledge obtained : [(X (X (AND (NOT p2) (NOT p1)))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (AND (NOT p2) (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p2) (NOT p1) (NOT p0))))), (X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 20 factoid took 331 ms. Reduced automaton from 6 states, 25 edges and 3 AP (stutter insensitive) to 6 states, 24 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 278 ms :[(NOT p2), (AND (NOT p1) (NOT p2)), (NOT p2), (AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2) p0), (NOT p2)]
RANDOM walk for 39206 steps (9 resets) in 33 ms. (1153 steps per ms) remains 0/11 properties
Knowledge obtained : [(AND (NOT p2) (NOT p1) (NOT p0)), (X (NOT p2)), (X (NOT (AND (NOT p2) (NOT p1) p0))), (X (NOT (AND p2 (NOT p1) p0))), (X (AND (NOT p2) (NOT p1))), (X (AND (NOT p2) (NOT p0))), (X (NOT (AND p2 (NOT p1) (NOT p0)))), (X (NOT (OR (AND p2 (NOT p1)) (AND (NOT p1) p0)))), (X (AND (NOT p2) (NOT p1) (NOT p0))), (X (NOT (AND (NOT p2) p0))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT p2))), (X (X (NOT (AND (NOT p2) (NOT p1) p0)))), (X (X (NOT (AND p2 (NOT p1) p0)))), (X (X (AND (NOT p2) (NOT p0)))), (X (X (NOT (AND p2 (NOT p1) (NOT p0))))), (X (X (NOT (OR (AND p2 (NOT p1)) (AND (NOT p1) p0))))), (X (X (NOT (AND (NOT p2) p0)))), (X (X (NOT p0)))]
False Knowledge obtained : [(X (X (AND (NOT p2) (NOT p1)))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (AND (NOT p2) (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p2) (NOT p1) (NOT p0))))), (X (X p1)), (X (X (NOT p1))), (F (NOT (AND (NOT p1) (NOT p2) (NOT p0)))), (F (NOT (AND (NOT p2) (NOT p0)))), (F p0), (F (NOT (OR p2 (NOT p0)))), (F p2), (F (NOT (OR p1 (NOT p2) p0))), (F (NOT (AND (OR p1 (NOT p2)) (OR p1 (NOT p0))))), (F (NOT (AND (NOT p1) (NOT p2)))), (F (NOT (OR p1 (NOT p2) (NOT p0)))), (F (NOT (OR p1 p2 (NOT p0)))), (F p1)]
Knowledge based reduction with 20 factoid took 590 ms. Reduced automaton from 6 states, 24 edges and 3 AP (stutter insensitive) to 6 states, 24 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 269 ms :[(NOT p2), (AND (NOT p1) (NOT p2)), (NOT p2), (AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2) p0), (NOT p2)]
Stuttering acceptance computed with spot in 266 ms :[(NOT p2), (AND (NOT p1) (NOT p2)), (NOT p2), (AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2) p0), (NOT p2)]
// Phase 1: matrix 9 rows 10 cols
[2024-06-01 02:04:20] [INFO ] Computed 2 invariants in 1 ms
[2024-06-01 02:04:20] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-06-01 02:04:20] [INFO ] [Real]Absence check using state equation in 4 ms returned sat
[2024-06-01 02:04:20] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 02:04:20] [INFO ] [Nat]Absence check using 2 positive place invariants in 0 ms returned sat
[2024-06-01 02:04:21] [INFO ] [Nat]Absence check using state equation in 3 ms returned sat
[2024-06-01 02:04:21] [INFO ] Computed and/alt/rep : 8/8/8 causal constraints (skipped 0 transitions) in 1 ms.
[2024-06-01 02:04:21] [INFO ] Added : 7 causal constraints over 2 iterations in 9 ms. Result :sat
Could not prove EG (NOT p2)
Support contains 4 out of 10 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 10/10 places, 9/9 transitions.
Applied a total of 0 rules in 1 ms. Remains 10 /10 variables (removed 0) and now considering 9/9 (removed 0) transitions.
[2024-06-01 02:04:21] [INFO ] Invariant cache hit.
[2024-06-01 02:04:21] [INFO ] Implicit Places using invariants in 20 ms returned []
[2024-06-01 02:04:21] [INFO ] Invariant cache hit.
[2024-06-01 02:04:21] [INFO ] Implicit Places using invariants and state equation in 22 ms returned []
Implicit Place search using SMT with State Equation took 44 ms to find 0 implicit places.
[2024-06-01 02:04:21] [INFO ] Redundant transitions in 0 ms returned []
Running 8 sub problems to find dead transitions.
[2024-06-01 02:04:21] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/10 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/10 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 2 (OVERLAPS) 9/19 variables, 10/12 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/19 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 4 (OVERLAPS) 0/19 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Real declared 19/19 variables, and 12 constraints, problems are : Problem set: 0 solved, 8 unsolved in 53 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 10/10 constraints, PredecessorRefiner: 8/8 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 8 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/10 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/10 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 2 (OVERLAPS) 9/19 variables, 10/12 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/19 variables, 8/20 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/19 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 5 (OVERLAPS) 0/19 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Int declared 19/19 variables, and 20 constraints, problems are : Problem set: 0 solved, 8 unsolved in 51 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 10/10 constraints, PredecessorRefiner: 8/8 constraints, Known Traps: 0/0 constraints]
After SMT, in 110ms problems are : Problem set: 0 solved, 8 unsolved
Search for dead transitions found 0 dead transitions in 110ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 171 ms. Remains : 10/10 places, 9/9 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p2) (NOT p0)), (X (NOT p2)), (X (NOT (OR (AND (NOT p1) p2) (AND (NOT p1) p0)))), (X (NOT (AND (NOT p1) p2 (NOT p0)))), (X (AND (NOT p2) (NOT p0))), (X (AND (NOT p1) (NOT p2) (NOT p0))), (X (NOT (AND (NOT p2) p0))), (X (NOT p0)), (X (NOT (AND (NOT p1) (NOT p2) p0))), (X (AND (NOT p1) (NOT p2))), (X (NOT p1)), (X (NOT (AND (NOT p1) p2 p0))), (X (X (NOT p2))), (X (X (NOT (OR (AND (NOT p1) p2) (AND (NOT p1) p0))))), (X (X (NOT (AND (NOT p1) p2 (NOT p0))))), (X (X (AND (NOT p2) (NOT p0)))), (X (X (NOT (AND (NOT p2) p0)))), (X (X (NOT p0))), (X (X (NOT (AND (NOT p1) (NOT p2) p0)))), (X (X (NOT (AND (NOT p1) p2 p0))))]
False Knowledge obtained : [(X (X (AND (NOT p1) (NOT p2) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p2) (NOT p0))))), (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 20 factoid took 320 ms. Reduced automaton from 6 states, 24 edges and 3 AP (stutter insensitive) to 6 states, 24 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 273 ms :[(NOT p2), (AND (NOT p1) (NOT p2)), (NOT p2), (AND (NOT p0) (NOT p1) (NOT p2)), (AND p0 (NOT p1) (NOT p2)), (NOT p2)]
RANDOM walk for 35991 steps (10 resets) in 94 ms. (378 steps per ms) remains 0/11 properties
Knowledge obtained : [(AND (NOT p1) (NOT p2) (NOT p0)), (X (NOT p2)), (X (NOT (OR (AND (NOT p1) p2) (AND (NOT p1) p0)))), (X (NOT (AND (NOT p1) p2 (NOT p0)))), (X (AND (NOT p2) (NOT p0))), (X (AND (NOT p1) (NOT p2) (NOT p0))), (X (NOT (AND (NOT p2) p0))), (X (NOT p0)), (X (NOT (AND (NOT p1) (NOT p2) p0))), (X (AND (NOT p1) (NOT p2))), (X (NOT p1)), (X (NOT (AND (NOT p1) p2 p0))), (X (X (NOT p2))), (X (X (NOT (OR (AND (NOT p1) p2) (AND (NOT p1) p0))))), (X (X (NOT (AND (NOT p1) p2 (NOT p0))))), (X (X (AND (NOT p2) (NOT p0)))), (X (X (NOT (AND (NOT p2) p0)))), (X (X (NOT p0))), (X (X (NOT (AND (NOT p1) (NOT p2) p0)))), (X (X (NOT (AND (NOT p1) p2 p0))))]
False Knowledge obtained : [(X (X (AND (NOT p1) (NOT p2) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p2) (NOT p0))))), (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X p1)), (X (X (NOT p1))), (F (NOT (OR (NOT p0) p2))), (F (NOT (OR (NOT p0) p2 p1))), (F p0), (F (NOT (AND (NOT p0) (NOT p2) (NOT p1)))), (F p2), (F (NOT (AND (NOT p2) (NOT p1)))), (F (NOT (AND (NOT p0) (NOT p2)))), (F p1), (F (NOT (OR p0 (NOT p2) p1))), (F (NOT (OR (NOT p0) (NOT p2) p1))), (F (NOT (AND (OR (NOT p0) p1) (OR (NOT p2) p1))))]
Knowledge based reduction with 20 factoid took 746 ms. Reduced automaton from 6 states, 24 edges and 3 AP (stutter insensitive) to 6 states, 24 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 267 ms :[(NOT p2), (AND (NOT p1) (NOT p2)), (NOT p2), (AND (NOT p0) (NOT p1) (NOT p2)), (AND p0 (NOT p1) (NOT p2)), (NOT p2)]
Stuttering acceptance computed with spot in 260 ms :[(NOT p2), (AND (NOT p1) (NOT p2)), (NOT p2), (AND (NOT p0) (NOT p1) (NOT p2)), (AND p0 (NOT p1) (NOT p2)), (NOT p2)]
[2024-06-01 02:04:23] [INFO ] Invariant cache hit.
[2024-06-01 02:04:23] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2024-06-01 02:04:23] [INFO ] [Real]Absence check using state equation in 9 ms returned sat
[2024-06-01 02:04:23] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 02:04:23] [INFO ] [Nat]Absence check using 2 positive place invariants in 3 ms returned sat
[2024-06-01 02:04:23] [INFO ] [Nat]Absence check using state equation in 4 ms returned sat
[2024-06-01 02:04:23] [INFO ] Computed and/alt/rep : 8/8/8 causal constraints (skipped 0 transitions) in 1 ms.
[2024-06-01 02:04:23] [INFO ] Added : 7 causal constraints over 2 iterations in 14 ms. Result :sat
Could not prove EG (NOT p2)
Stuttering acceptance computed with spot in 272 ms :[(NOT p2), (AND (NOT p1) (NOT p2)), (NOT p2), (AND (NOT p0) (NOT p1) (NOT p2)), (AND p0 (NOT p1) (NOT p2)), (NOT p2)]
Product exploration explored 100000 steps with 16387 reset in 80 ms.
Product exploration explored 100000 steps with 16446 reset in 133 ms.
Support contains 4 out of 10 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 10/10 places, 9/9 transitions.
Applied a total of 0 rules in 19 ms. Remains 10 /10 variables (removed 0) and now considering 9/9 (removed 0) transitions.
[2024-06-01 02:04:23] [INFO ] Invariant cache hit.
[2024-06-01 02:04:23] [INFO ] Implicit Places using invariants in 21 ms returned []
[2024-06-01 02:04:23] [INFO ] Invariant cache hit.
[2024-06-01 02:04:23] [INFO ] Implicit Places using invariants and state equation in 28 ms returned []
Implicit Place search using SMT with State Equation took 51 ms to find 0 implicit places.
[2024-06-01 02:04:23] [INFO ] Redundant transitions in 0 ms returned []
Running 8 sub problems to find dead transitions.
[2024-06-01 02:04:23] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/10 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/10 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 2 (OVERLAPS) 9/19 variables, 10/12 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/19 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 4 (OVERLAPS) 0/19 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Real declared 19/19 variables, and 12 constraints, problems are : Problem set: 0 solved, 8 unsolved in 51 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 10/10 constraints, PredecessorRefiner: 8/8 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 8 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/10 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/10 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 2 (OVERLAPS) 9/19 variables, 10/12 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/19 variables, 8/20 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/19 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 5 (OVERLAPS) 0/19 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Int declared 19/19 variables, and 20 constraints, problems are : Problem set: 0 solved, 8 unsolved in 51 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 10/10 constraints, PredecessorRefiner: 8/8 constraints, Known Traps: 0/0 constraints]
After SMT, in 107ms problems are : Problem set: 0 solved, 8 unsolved
Search for dead transitions found 0 dead transitions in 108ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 184 ms. Remains : 10/10 places, 9/9 transitions.
Treatment of property ClientsAndServers-PT-N0100P0-LTLFireability-02 finished in 5466 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)))'
Support contains 2 out of 21 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 21/21 places, 18/18 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 0 with 9 rules applied. Total rules applied 9 place count 20 transition count 10
Reduce places removed 8 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 9 rules applied. Total rules applied 18 place count 12 transition count 9
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 19 place count 11 transition count 9
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 19 place count 11 transition count 7
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 23 place count 9 transition count 7
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 27 place count 7 transition count 5
Applied a total of 27 rules in 4 ms. Remains 7 /21 variables (removed 14) and now considering 5/18 (removed 13) transitions.
// Phase 1: matrix 5 rows 7 cols
[2024-06-01 02:04:23] [INFO ] Computed 3 invariants in 0 ms
[2024-06-01 02:04:23] [INFO ] Implicit Places using invariants in 20 ms returned [6]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 21 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 6/21 places, 5/18 transitions.
Applied a total of 0 rules in 1 ms. Remains 6 /6 variables (removed 0) and now considering 5/5 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 26 ms. Remains : 6/21 places, 5/18 transitions.
Stuttering acceptance computed with spot in 74 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ClientsAndServers-PT-N0100P0-LTLFireability-04
Product exploration explored 100000 steps with 10562 reset in 87 ms.
Product exploration explored 100000 steps with 12019 reset in 192 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(NOT p0), (X (NOT p0))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 2 factoid took 123 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 71 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 808 steps (0 resets) in 4 ms. (161 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0), (X (NOT p0))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0)), (F p0)]
Knowledge based reduction with 2 factoid took 154 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 79 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 70 ms :[(NOT p0), (NOT p0)]
// Phase 1: matrix 5 rows 6 cols
[2024-06-01 02:04:24] [INFO ] Computed 2 invariants in 2 ms
[2024-06-01 02:04:24] [INFO ] [Real]Absence check using 2 positive place invariants in 0 ms returned sat
[2024-06-01 02:04:24] [INFO ] [Real]Absence check using state equation in 2 ms returned sat
[2024-06-01 02:04:24] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 02:04:24] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-06-01 02:04:24] [INFO ] [Nat]Absence check using state equation in 3 ms returned sat
[2024-06-01 02:04:24] [INFO ] Computed and/alt/rep : 4/4/4 causal constraints (skipped 0 transitions) in 0 ms.
[2024-06-01 02:04:24] [INFO ] Added : 3 causal constraints over 1 iterations in 3 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 2 out of 6 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 6/6 places, 5/5 transitions.
Applied a total of 0 rules in 0 ms. Remains 6 /6 variables (removed 0) and now considering 5/5 (removed 0) transitions.
[2024-06-01 02:04:24] [INFO ] Invariant cache hit.
[2024-06-01 02:04:24] [INFO ] Implicit Places using invariants in 26 ms returned []
[2024-06-01 02:04:24] [INFO ] Invariant cache hit.
[2024-06-01 02:04:24] [INFO ] Implicit Places using invariants and state equation in 27 ms returned []
Implicit Place search using SMT with State Equation took 54 ms to find 0 implicit places.
[2024-06-01 02:04:24] [INFO ] Redundant transitions in 0 ms returned []
Running 4 sub problems to find dead transitions.
[2024-06-01 02:04:24] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/6 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (OVERLAPS) 5/11 variables, 6/8 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/11 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (OVERLAPS) 0/11 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 11/11 variables, and 8 constraints, problems are : Problem set: 0 solved, 4 unsolved in 44 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 6/6 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/6 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (OVERLAPS) 5/11 variables, 6/8 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/11 variables, 4/12 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/11 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 0/11 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 11/11 variables, and 12 constraints, problems are : Problem set: 0 solved, 4 unsolved in 34 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 6/6 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
After SMT, in 81ms problems are : Problem set: 0 solved, 4 unsolved
Search for dead transitions found 0 dead transitions in 81ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 139 ms. Remains : 6/6 places, 5/5 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 (NOT p0))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 2 factoid took 139 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 79 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 808 steps (0 resets) in 6 ms. (115 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0), (X (NOT p0))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0)), (F p0)]
Knowledge based reduction with 2 factoid took 194 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 76 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 98 ms :[(NOT p0), (NOT p0)]
[2024-06-01 02:04:25] [INFO ] Invariant cache hit.
[2024-06-01 02:04:25] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-06-01 02:04:25] [INFO ] [Real]Absence check using state equation in 3 ms returned sat
[2024-06-01 02:04:25] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 02:04:25] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-06-01 02:04:25] [INFO ] [Nat]Absence check using state equation in 3 ms returned sat
[2024-06-01 02:04:25] [INFO ] Computed and/alt/rep : 4/4/4 causal constraints (skipped 0 transitions) in 1 ms.
[2024-06-01 02:04:25] [INFO ] Added : 3 causal constraints over 1 iterations in 4 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 78 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 11683 reset in 63 ms.
Product exploration explored 100000 steps with 4732 reset in 184 ms.
Support contains 2 out of 6 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 6/6 places, 5/5 transitions.
Applied a total of 0 rules in 1 ms. Remains 6 /6 variables (removed 0) and now considering 5/5 (removed 0) transitions.
[2024-06-01 02:04:26] [INFO ] Invariant cache hit.
[2024-06-01 02:04:26] [INFO ] Implicit Places using invariants in 23 ms returned []
[2024-06-01 02:04:26] [INFO ] Invariant cache hit.
[2024-06-01 02:04:26] [INFO ] Implicit Places using invariants and state equation in 19 ms returned []
Implicit Place search using SMT with State Equation took 42 ms to find 0 implicit places.
[2024-06-01 02:04:26] [INFO ] Redundant transitions in 0 ms returned []
Running 4 sub problems to find dead transitions.
[2024-06-01 02:04:26] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/6 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (OVERLAPS) 5/11 variables, 6/8 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/11 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (OVERLAPS) 0/11 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 11/11 variables, and 8 constraints, problems are : Problem set: 0 solved, 4 unsolved in 31 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 6/6 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/6 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (OVERLAPS) 5/11 variables, 6/8 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/11 variables, 4/12 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/11 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 0/11 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 11/11 variables, and 12 constraints, problems are : Problem set: 0 solved, 4 unsolved in 41 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 6/6 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
After SMT, in 76ms problems are : Problem set: 0 solved, 4 unsolved
Search for dead transitions found 0 dead transitions in 76ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 124 ms. Remains : 6/6 places, 5/5 transitions.
Treatment of property ClientsAndServers-PT-N0100P0-LTLFireability-04 finished in 2257 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||G(p1)))))'
Support contains 3 out of 21 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 21/21 places, 18/18 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 20 transition count 18
Applied a total of 1 rules in 2 ms. Remains 20 /21 variables (removed 1) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 20 cols
[2024-06-01 02:04:26] [INFO ] Computed 3 invariants in 1 ms
[2024-06-01 02:04:26] [INFO ] Implicit Places using invariants in 23 ms returned []
[2024-06-01 02:04:26] [INFO ] Invariant cache hit.
[2024-06-01 02:04:26] [INFO ] Implicit Places using invariants and state equation in 27 ms returned []
Implicit Place search using SMT with State Equation took 52 ms to find 0 implicit places.
Running 17 sub problems to find dead transitions.
[2024-06-01 02:04:26] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/19 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/19 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 2 (OVERLAPS) 1/20 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/20 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 4 (OVERLAPS) 18/38 variables, 20/23 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/38 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 6 (OVERLAPS) 0/38 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 17 unsolved
No progress, stopping.
After SMT solving in domain Real declared 38/38 variables, and 23 constraints, problems are : Problem set: 0 solved, 17 unsolved in 132 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 20/20 constraints, PredecessorRefiner: 17/17 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 17 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/19 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/19 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 2 (OVERLAPS) 1/20 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/20 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 4 (OVERLAPS) 18/38 variables, 20/23 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/38 variables, 17/40 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/38 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 7 (OVERLAPS) 0/38 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 17 unsolved
No progress, stopping.
After SMT solving in domain Int declared 38/38 variables, and 40 constraints, problems are : Problem set: 0 solved, 17 unsolved in 120 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 20/20 constraints, PredecessorRefiner: 17/17 constraints, Known Traps: 0/0 constraints]
After SMT, in 256ms problems are : Problem set: 0 solved, 17 unsolved
Search for dead transitions found 0 dead transitions in 256ms
Starting structural reductions in LTL mode, iteration 1 : 20/21 places, 18/18 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 310 ms. Remains : 20/21 places, 18/18 transitions.
Stuttering acceptance computed with spot in 127 ms :[true, (AND (NOT p1) (NOT p0)), (NOT p1), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : ClientsAndServers-PT-N0100P0-LTLFireability-07
Entered a terminal (fully accepting) state of product in 76 steps with 0 reset in 1 ms.
FORMULA ClientsAndServers-PT-N0100P0-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ClientsAndServers-PT-N0100P0-LTLFireability-07 finished in 456 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((p0||X(F((p0&&F(!p0)))))))'
Support contains 1 out of 21 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 21/21 places, 18/18 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 9 transitions
Trivial Post-agglo rules discarded 9 transitions
Performed 9 trivial Post agglomeration. Transition count delta: 9
Iterating post reduction 0 with 10 rules applied. Total rules applied 10 place count 20 transition count 9
Reduce places removed 9 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 10 rules applied. Total rules applied 20 place count 11 transition count 8
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 21 place count 10 transition count 8
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 21 place count 10 transition count 6
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 25 place count 8 transition count 6
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 27 place count 7 transition count 5
Applied a total of 27 rules in 4 ms. Remains 7 /21 variables (removed 14) and now considering 5/18 (removed 13) transitions.
// Phase 1: matrix 5 rows 7 cols
[2024-06-01 02:04:26] [INFO ] Computed 3 invariants in 0 ms
[2024-06-01 02:04:26] [INFO ] Implicit Places using invariants in 19 ms returned [6]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 20 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 6/21 places, 5/18 transitions.
Applied a total of 0 rules in 1 ms. Remains 6 /6 variables (removed 0) and now considering 5/5 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 25 ms. Remains : 6/21 places, 5/18 transitions.
Stuttering acceptance computed with spot in 36 ms :[(NOT p0)]
Running random walk in product with property : ClientsAndServers-PT-N0100P0-LTLFireability-08
Product exploration explored 100000 steps with 10200 reset in 81 ms.
Product exploration explored 100000 steps with 10225 reset in 82 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 87 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 32 ms :[(NOT p0)]
RANDOM walk for 4428 steps (2 resets) in 9 ms. (442 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 95 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 35 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 40 ms :[(NOT p0)]
// Phase 1: matrix 5 rows 6 cols
[2024-06-01 02:04:27] [INFO ] Computed 2 invariants in 2 ms
[2024-06-01 02:04:27] [INFO ] [Real]Absence check using 2 positive place invariants in 0 ms returned sat
[2024-06-01 02:04:27] [INFO ] [Real]Absence check using state equation in 3 ms returned sat
[2024-06-01 02:04:27] [INFO ] Computed and/alt/rep : 4/4/4 causal constraints (skipped 0 transitions) in 1 ms.
[2024-06-01 02:04:27] [INFO ] Added : 2 causal constraints over 1 iterations in 7 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 1 out of 6 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 6/6 places, 5/5 transitions.
Applied a total of 0 rules in 1 ms. Remains 6 /6 variables (removed 0) and now considering 5/5 (removed 0) transitions.
[2024-06-01 02:04:27] [INFO ] Invariant cache hit.
[2024-06-01 02:04:27] [INFO ] Implicit Places using invariants in 24 ms returned []
[2024-06-01 02:04:27] [INFO ] Invariant cache hit.
[2024-06-01 02:04:27] [INFO ] Implicit Places using invariants and state equation in 27 ms returned []
Implicit Place search using SMT with State Equation took 54 ms to find 0 implicit places.
[2024-06-01 02:04:27] [INFO ] Redundant transitions in 0 ms returned []
Running 4 sub problems to find dead transitions.
[2024-06-01 02:04:27] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/6 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (OVERLAPS) 5/11 variables, 6/8 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/11 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (OVERLAPS) 0/11 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 11/11 variables, and 8 constraints, problems are : Problem set: 0 solved, 4 unsolved in 31 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 6/6 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/6 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (OVERLAPS) 5/11 variables, 6/8 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/11 variables, 4/12 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/11 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 0/11 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 11/11 variables, and 12 constraints, problems are : Problem set: 0 solved, 4 unsolved in 38 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 6/6 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
After SMT, in 71ms problems are : Problem set: 0 solved, 4 unsolved
Search for dead transitions found 0 dead transitions in 72ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 131 ms. Remains : 6/6 places, 5/5 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 (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 158 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 35 ms :[(NOT p0)]
RANDOM walk for 4226 steps (1 resets) in 8 ms. (469 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 101 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 27 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 38 ms :[(NOT p0)]
[2024-06-01 02:04:27] [INFO ] Invariant cache hit.
[2024-06-01 02:04:27] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-06-01 02:04:27] [INFO ] [Real]Absence check using state equation in 3 ms returned sat
[2024-06-01 02:04:27] [INFO ] Computed and/alt/rep : 4/4/4 causal constraints (skipped 0 transitions) in 0 ms.
[2024-06-01 02:04:27] [INFO ] Added : 2 causal constraints over 1 iterations in 3 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 39 ms :[(NOT p0)]
Product exploration explored 100000 steps with 10211 reset in 129 ms.
Product exploration explored 100000 steps with 10255 reset in 82 ms.
Support contains 1 out of 6 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 6/6 places, 5/5 transitions.
Applied a total of 0 rules in 0 ms. Remains 6 /6 variables (removed 0) and now considering 5/5 (removed 0) transitions.
[2024-06-01 02:04:28] [INFO ] Invariant cache hit.
[2024-06-01 02:04:28] [INFO ] Implicit Places using invariants in 25 ms returned []
[2024-06-01 02:04:28] [INFO ] Invariant cache hit.
[2024-06-01 02:04:28] [INFO ] Implicit Places using invariants and state equation in 18 ms returned []
Implicit Place search using SMT with State Equation took 44 ms to find 0 implicit places.
[2024-06-01 02:04:28] [INFO ] Redundant transitions in 0 ms returned []
Running 4 sub problems to find dead transitions.
[2024-06-01 02:04:28] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/6 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (OVERLAPS) 5/11 variables, 6/8 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/11 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (OVERLAPS) 0/11 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 11/11 variables, and 8 constraints, problems are : Problem set: 0 solved, 4 unsolved in 35 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 6/6 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/6 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (OVERLAPS) 5/11 variables, 6/8 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/11 variables, 4/12 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/11 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 0/11 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 11/11 variables, and 12 constraints, problems are : Problem set: 0 solved, 4 unsolved in 40 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 6/6 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
After SMT, in 78ms problems are : Problem set: 0 solved, 4 unsolved
Search for dead transitions found 0 dead transitions in 78ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 128 ms. Remains : 6/6 places, 5/5 transitions.
Treatment of property ClientsAndServers-PT-N0100P0-LTLFireability-08 finished in 1546 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)))))'
Support contains 3 out of 21 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 21/21 places, 18/18 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 20 transition count 18
Applied a total of 1 rules in 1 ms. Remains 20 /21 variables (removed 1) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 20 cols
[2024-06-01 02:04:28] [INFO ] Computed 3 invariants in 1 ms
[2024-06-01 02:04:28] [INFO ] Implicit Places using invariants in 23 ms returned []
[2024-06-01 02:04:28] [INFO ] Invariant cache hit.
[2024-06-01 02:04:28] [INFO ] Implicit Places using invariants and state equation in 28 ms returned []
Implicit Place search using SMT with State Equation took 53 ms to find 0 implicit places.
Running 17 sub problems to find dead transitions.
[2024-06-01 02:04:28] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/19 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/19 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 2 (OVERLAPS) 1/20 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/20 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 4 (OVERLAPS) 18/38 variables, 20/23 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/38 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 6 (OVERLAPS) 0/38 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 17 unsolved
No progress, stopping.
After SMT solving in domain Real declared 38/38 variables, and 23 constraints, problems are : Problem set: 0 solved, 17 unsolved in 133 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 20/20 constraints, PredecessorRefiner: 17/17 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 17 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/19 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/19 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 2 (OVERLAPS) 1/20 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/20 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 4 (OVERLAPS) 18/38 variables, 20/23 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/38 variables, 17/40 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/38 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 7 (OVERLAPS) 0/38 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 17 unsolved
No progress, stopping.
After SMT solving in domain Int declared 38/38 variables, and 40 constraints, problems are : Problem set: 0 solved, 17 unsolved in 117 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 20/20 constraints, PredecessorRefiner: 17/17 constraints, Known Traps: 0/0 constraints]
After SMT, in 255ms problems are : Problem set: 0 solved, 17 unsolved
Search for dead transitions found 0 dead transitions in 256ms
Starting structural reductions in LTL mode, iteration 1 : 20/21 places, 18/18 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 310 ms. Remains : 20/21 places, 18/18 transitions.
Stuttering acceptance computed with spot in 171 ms :[p1, p1, p1, p1, true]
Running random walk in product with property : ClientsAndServers-PT-N0100P0-LTLFireability-09
Product exploration explored 100000 steps with 25063 reset in 56 ms.
Product exploration explored 100000 steps with 25028 reset in 49 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT p0)), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT p0))), (X (X (NOT (AND p0 p1)))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 87 ms. Reduced automaton from 5 states, 8 edges and 2 AP (stutter sensitive) to 5 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 170 ms :[p1, p1, p1, p1, true]
RANDOM walk for 40172 steps (8 resets) in 58 ms. (680 steps per ms) remains 3/4 properties
BEST_FIRST walk for 40003 steps (8 resets) in 176 ms. (226 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 103 ms. (384 steps per ms) remains 1/3 properties
[2024-06-01 02:04:29] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 17/20 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/20 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 18/38 variables, 20/23 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/38 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 0/38 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 38/38 variables, and 23 constraints, problems are : Problem set: 0 solved, 1 unsolved in 28 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 20/20 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 17/20 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/20 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 18/38 variables, 20/23 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/38 variables, 1/24 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/38 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 0/38 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 38/38 variables, and 24 constraints, problems are : Problem set: 0 solved, 1 unsolved in 27 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 20/20 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 57ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 133 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=66 )
Parikh walk visited 1 properties in 5 ms.
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT p0)), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT p0))), (X (X (NOT (AND p0 p1)))), (X (X (NOT p1)))]
False Knowledge obtained : [(F p1), (F (NOT (OR p0 (NOT p1)))), (F (NOT (OR (NOT p0) (NOT p1)))), (F p0)]
Knowledge based reduction with 6 factoid took 201 ms. Reduced automaton from 5 states, 8 edges and 2 AP (stutter sensitive) to 5 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 191 ms :[p1, p1, p1, p1, true]
Stuttering acceptance computed with spot in 168 ms :[p1, p1, p1, p1, true]
Support contains 3 out of 20 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 20/20 places, 18/18 transitions.
Applied a total of 0 rules in 0 ms. Remains 20 /20 variables (removed 0) and now considering 18/18 (removed 0) transitions.
[2024-06-01 02:04:29] [INFO ] Invariant cache hit.
[2024-06-01 02:04:29] [INFO ] Implicit Places using invariants in 25 ms returned []
[2024-06-01 02:04:29] [INFO ] Invariant cache hit.
[2024-06-01 02:04:29] [INFO ] Implicit Places using invariants and state equation in 31 ms returned []
Implicit Place search using SMT with State Equation took 57 ms to find 0 implicit places.
Running 17 sub problems to find dead transitions.
[2024-06-01 02:04:29] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/19 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/19 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 2 (OVERLAPS) 1/20 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/20 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 4 (OVERLAPS) 18/38 variables, 20/23 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/38 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 6 (OVERLAPS) 0/38 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 17 unsolved
No progress, stopping.
After SMT solving in domain Real declared 38/38 variables, and 23 constraints, problems are : Problem set: 0 solved, 17 unsolved in 127 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 20/20 constraints, PredecessorRefiner: 17/17 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 17 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/19 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/19 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 2 (OVERLAPS) 1/20 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/20 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 4 (OVERLAPS) 18/38 variables, 20/23 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/38 variables, 17/40 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/38 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 7 (OVERLAPS) 0/38 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 17 unsolved
No progress, stopping.
After SMT solving in domain Int declared 38/38 variables, and 40 constraints, problems are : Problem set: 0 solved, 17 unsolved in 112 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 20/20 constraints, PredecessorRefiner: 17/17 constraints, Known Traps: 0/0 constraints]
After SMT, in 242ms problems are : Problem set: 0 solved, 17 unsolved
Search for dead transitions found 0 dead transitions in 243ms
Finished structural reductions in LTL mode , in 1 iterations and 300 ms. Remains : 20/20 places, 18/18 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT p0)), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT p0))), (X (X (NOT (AND p0 p1)))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 111 ms. Reduced automaton from 5 states, 8 edges and 2 AP (stutter sensitive) to 5 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 178 ms :[p1, p1, p1, p1, true]
RANDOM walk for 40176 steps (8 resets) in 43 ms. (913 steps per ms) remains 3/4 properties
BEST_FIRST walk for 40003 steps (8 resets) in 84 ms. (470 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (8 resets) in 123 ms. (322 steps per ms) remains 1/3 properties
[2024-06-01 02:04:30] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 17/20 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/20 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 18/38 variables, 20/23 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/38 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 0/38 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 38/38 variables, and 23 constraints, problems are : Problem set: 0 solved, 1 unsolved in 38 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 20/20 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 17/20 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/20 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 18/38 variables, 20/23 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/38 variables, 1/24 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/38 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 0/38 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 38/38 variables, and 24 constraints, problems are : Problem set: 0 solved, 1 unsolved in 31 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 20/20 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 71ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 84 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=42 )
Parikh walk visited 1 properties in 1 ms.
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT p0)), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT p0))), (X (X (NOT (AND p0 p1)))), (X (X (NOT p1)))]
False Knowledge obtained : [(F p1), (F (NOT (OR p0 (NOT p1)))), (F (NOT (OR (NOT p0) (NOT p1)))), (F p0)]
Knowledge based reduction with 6 factoid took 177 ms. Reduced automaton from 5 states, 8 edges and 2 AP (stutter sensitive) to 5 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 173 ms :[p1, p1, p1, p1, true]
Stuttering acceptance computed with spot in 187 ms :[p1, p1, p1, p1, true]
Stuttering acceptance computed with spot in 189 ms :[p1, p1, p1, p1, true]
Product exploration explored 100000 steps with 25028 reset in 56 ms.
Product exploration explored 100000 steps with 25005 reset in 50 ms.
Applying partial POR strategy [false, false, true, false, true]
Stuttering acceptance computed with spot in 181 ms :[p1, p1, p1, p1, true]
Support contains 3 out of 20 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 20/20 places, 18/18 transitions.
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 7 rules applied. Total rules applied 7 place count 20 transition count 18
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 2 Pre rules applied. Total rules applied 7 place count 20 transition count 18
Deduced a syphon composed of 9 places in 1 ms
Iterating global reduction 1 with 2 rules applied. Total rules applied 9 place count 20 transition count 18
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 11 place count 18 transition count 16
Deduced a syphon composed of 7 places in 0 ms
Iterating global reduction 1 with 2 rules applied. Total rules applied 13 place count 18 transition count 16
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 10 places in 0 ms
Iterating global reduction 1 with 3 rules applied. Total rules applied 16 place count 18 transition count 16
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 18 place count 16 transition count 14
Deduced a syphon composed of 8 places in 0 ms
Iterating global reduction 1 with 2 rules applied. Total rules applied 20 place count 16 transition count 14
Deduced a syphon composed of 8 places in 0 ms
Applied a total of 20 rules in 12 ms. Remains 16 /20 variables (removed 4) and now considering 14/18 (removed 4) transitions.
[2024-06-01 02:04:31] [INFO ] Redundant transitions in 0 ms returned []
Running 13 sub problems to find dead transitions.
// Phase 1: matrix 14 rows 16 cols
[2024-06-01 02:04:31] [INFO ] Computed 3 invariants in 1 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/15 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/15 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 2 (OVERLAPS) 1/16 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/16 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 13 unsolved
Problem TDEAD1 is UNSAT
Problem TDEAD3 is UNSAT
Problem TDEAD4 is UNSAT
Problem TDEAD5 is UNSAT
Problem TDEAD6 is UNSAT
Problem TDEAD8 is UNSAT
Problem TDEAD10 is UNSAT
Problem TDEAD12 is UNSAT
At refinement iteration 4 (OVERLAPS) 14/30 variables, 16/19 constraints. Problems are: Problem set: 8 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/30 variables, 0/19 constraints. Problems are: Problem set: 8 solved, 5 unsolved
At refinement iteration 6 (OVERLAPS) 0/30 variables, 0/19 constraints. Problems are: Problem set: 8 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 30/30 variables, and 19 constraints, problems are : Problem set: 8 solved, 5 unsolved in 66 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 16/16 constraints, PredecessorRefiner: 13/13 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 8 solved, 5 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 8 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 9/16 variables, 3/3 constraints. Problems are: Problem set: 8 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/16 variables, 0/3 constraints. Problems are: Problem set: 8 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 14/30 variables, 16/19 constraints. Problems are: Problem set: 8 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/30 variables, 5/24 constraints. Problems are: Problem set: 8 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/30 variables, 0/24 constraints. Problems are: Problem set: 8 solved, 5 unsolved
At refinement iteration 6 (OVERLAPS) 0/30 variables, 0/24 constraints. Problems are: Problem set: 8 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Int declared 30/30 variables, and 24 constraints, problems are : Problem set: 8 solved, 5 unsolved in 42 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 16/16 constraints, PredecessorRefiner: 5/13 constraints, Known Traps: 0/0 constraints]
After SMT, in 114ms problems are : Problem set: 8 solved, 5 unsolved
Search for dead transitions found 8 dead transitions in 114ms
Found 8 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 8 transitions
Dead transitions reduction (with SMT) removed 8 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 16/20 places, 6/18 transitions.
Graph (complete) has 13 edges and 16 vertex of which 8 are kept as prefixes of interest. Removing 8 places using SCC suffix rule.0 ms
Discarding 8 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 2 ms. Remains 8 /16 variables (removed 8) and now considering 6/6 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 8/20 places, 6/18 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 133 ms. Remains : 8/20 places, 6/18 transitions.
Support contains 3 out of 20 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 20/20 places, 18/18 transitions.
Applied a total of 0 rules in 0 ms. Remains 20 /20 variables (removed 0) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 20 cols
[2024-06-01 02:04:31] [INFO ] Computed 3 invariants in 0 ms
[2024-06-01 02:04:31] [INFO ] Implicit Places using invariants in 19 ms returned []
[2024-06-01 02:04:31] [INFO ] Invariant cache hit.
[2024-06-01 02:04:31] [INFO ] Implicit Places using invariants and state equation in 51 ms returned []
Implicit Place search using SMT with State Equation took 70 ms to find 0 implicit places.
Running 17 sub problems to find dead transitions.
[2024-06-01 02:04:31] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/19 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/19 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 2 (OVERLAPS) 1/20 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/20 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 4 (OVERLAPS) 18/38 variables, 20/23 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/38 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 6 (OVERLAPS) 0/38 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 17 unsolved
No progress, stopping.
After SMT solving in domain Real declared 38/38 variables, and 23 constraints, problems are : Problem set: 0 solved, 17 unsolved in 119 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 20/20 constraints, PredecessorRefiner: 17/17 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 17 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/19 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/19 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 2 (OVERLAPS) 1/20 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/20 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 4 (OVERLAPS) 18/38 variables, 20/23 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/38 variables, 17/40 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/38 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 7 (OVERLAPS) 0/38 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 17 unsolved
No progress, stopping.
After SMT solving in domain Int declared 38/38 variables, and 40 constraints, problems are : Problem set: 0 solved, 17 unsolved in 104 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 20/20 constraints, PredecessorRefiner: 17/17 constraints, Known Traps: 0/0 constraints]
After SMT, in 227ms problems are : Problem set: 0 solved, 17 unsolved
Search for dead transitions found 0 dead transitions in 228ms
Finished structural reductions in LTL mode , in 1 iterations and 298 ms. Remains : 20/20 places, 18/18 transitions.
Treatment of property ClientsAndServers-PT-N0100P0-LTLFireability-09 finished in 4065 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((p0||G(p1))))'
Support contains 2 out of 21 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 21/21 places, 18/18 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 0 with 9 rules applied. Total rules applied 9 place count 20 transition count 10
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 17 place count 12 transition count 10
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 17 place count 12 transition count 8
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 21 place count 10 transition count 8
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 25 place count 8 transition count 6
Applied a total of 25 rules in 7 ms. Remains 8 /21 variables (removed 13) and now considering 6/18 (removed 12) transitions.
// Phase 1: matrix 6 rows 8 cols
[2024-06-01 02:04:32] [INFO ] Computed 3 invariants in 1 ms
[2024-06-01 02:04:32] [INFO ] Implicit Places using invariants in 28 ms returned [7]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 29 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 7/21 places, 6/18 transitions.
Applied a total of 0 rules in 2 ms. Remains 7 /7 variables (removed 0) and now considering 6/6 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 39 ms. Remains : 7/21 places, 6/18 transitions.
Stuttering acceptance computed with spot in 37 ms :[(AND (NOT p1) (NOT p0))]
Running random walk in product with property : ClientsAndServers-PT-N0100P0-LTLFireability-11
Product exploration explored 100000 steps with 24939 reset in 46 ms.
Product exploration explored 100000 steps with 25041 reset in 51 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p1 (NOT p0)), (X (AND p1 (NOT p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT p0)), (X p1), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X p1))]
False Knowledge obtained : [(X (X (AND p1 (NOT p0)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X p0)), (X (X (NOT p0)))]
Knowledge based reduction with 7 factoid took 186 ms. Reduced automaton from 1 states, 2 edges and 2 AP (stutter insensitive) to 1 states, 2 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 44 ms :[(AND (NOT p0) (NOT p1))]
RANDOM walk for 4426 steps (0 resets) in 4 ms. (885 steps per ms) remains 0/4 properties
Knowledge obtained : [(AND p1 (NOT p0)), (X (AND p1 (NOT p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT p0)), (X p1), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X p1))]
False Knowledge obtained : [(X (X (AND p1 (NOT p0)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X p0)), (X (X (NOT p0))), (F (NOT p1)), (F (NOT (AND (NOT p0) p1))), (F (NOT (OR p0 p1))), (F p0)]
Knowledge based reduction with 7 factoid took 283 ms. Reduced automaton from 1 states, 2 edges and 2 AP (stutter insensitive) to 1 states, 2 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 39 ms :[(AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 43 ms :[(AND (NOT p0) (NOT p1))]
Support contains 2 out of 7 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 7/7 places, 6/6 transitions.
Applied a total of 0 rules in 1 ms. Remains 7 /7 variables (removed 0) and now considering 6/6 (removed 0) transitions.
// Phase 1: matrix 6 rows 7 cols
[2024-06-01 02:04:33] [INFO ] Computed 2 invariants in 1 ms
[2024-06-01 02:04:33] [INFO ] Implicit Places using invariants in 23 ms returned []
[2024-06-01 02:04:33] [INFO ] Invariant cache hit.
[2024-06-01 02:04:33] [INFO ] Implicit Places using invariants and state equation in 18 ms returned []
Implicit Place search using SMT with State Equation took 42 ms to find 0 implicit places.
[2024-06-01 02:04:33] [INFO ] Redundant transitions in 0 ms returned []
Running 5 sub problems to find dead transitions.
[2024-06-01 02:04:33] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/7 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (OVERLAPS) 6/13 variables, 7/9 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/13 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (OVERLAPS) 0/13 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 13/13 variables, and 9 constraints, problems are : Problem set: 0 solved, 5 unsolved in 33 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 7/7 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 5 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/7 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (OVERLAPS) 6/13 variables, 7/9 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/13 variables, 5/14 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 0/13 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Int declared 13/13 variables, and 14 constraints, problems are : Problem set: 0 solved, 5 unsolved in 33 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 7/7 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints]
After SMT, in 81ms problems are : Problem set: 0 solved, 5 unsolved
Search for dead transitions found 0 dead transitions in 81ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 128 ms. Remains : 7/7 places, 6/6 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) p1), (X (AND (NOT p0) p1)), (X (NOT p0)), (X (NOT (AND (NOT p0) (NOT p1)))), (X p1), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p1))]
False Knowledge obtained : [(X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X p0)), (X (X (NOT p0)))]
Knowledge based reduction with 7 factoid took 183 ms. Reduced automaton from 1 states, 2 edges and 2 AP (stutter insensitive) to 1 states, 2 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 48 ms :[(AND (NOT p0) (NOT p1))]
RANDOM walk for 4627 steps (0 resets) in 4 ms. (925 steps per ms) remains 0/4 properties
Knowledge obtained : [(AND (NOT p0) p1), (X (AND (NOT p0) p1)), (X (NOT p0)), (X (NOT (AND (NOT p0) (NOT p1)))), (X p1), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p1))]
False Knowledge obtained : [(X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X p0)), (X (X (NOT p0))), (F (NOT p1)), (F (NOT (AND (NOT p0) p1))), (F (NOT (OR p0 p1))), (F p0)]
Knowledge based reduction with 7 factoid took 304 ms. Reduced automaton from 1 states, 2 edges and 2 AP (stutter insensitive) to 1 states, 2 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 43 ms :[(AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 35 ms :[(AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 29 ms :[(AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 25080 reset in 60 ms.
Product exploration explored 100000 steps with 24979 reset in 51 ms.
Support contains 2 out of 7 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 7/7 places, 6/6 transitions.
Applied a total of 0 rules in 0 ms. Remains 7 /7 variables (removed 0) and now considering 6/6 (removed 0) transitions.
[2024-06-01 02:04:34] [INFO ] Invariant cache hit.
[2024-06-01 02:04:34] [INFO ] Implicit Places using invariants in 24 ms returned []
[2024-06-01 02:04:34] [INFO ] Invariant cache hit.
[2024-06-01 02:04:34] [INFO ] Implicit Places using invariants and state equation in 28 ms returned []
Implicit Place search using SMT with State Equation took 54 ms to find 0 implicit places.
[2024-06-01 02:04:34] [INFO ] Redundant transitions in 0 ms returned []
Running 5 sub problems to find dead transitions.
[2024-06-01 02:04:34] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/7 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (OVERLAPS) 6/13 variables, 7/9 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/13 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (OVERLAPS) 0/13 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 13/13 variables, and 9 constraints, problems are : Problem set: 0 solved, 5 unsolved in 38 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 7/7 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 5 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/7 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (OVERLAPS) 6/13 variables, 7/9 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/13 variables, 5/14 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 0/13 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Int declared 13/13 variables, and 14 constraints, problems are : Problem set: 0 solved, 5 unsolved in 32 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 7/7 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints]
After SMT, in 73ms problems are : Problem set: 0 solved, 5 unsolved
Search for dead transitions found 0 dead transitions in 73ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 131 ms. Remains : 7/7 places, 6/6 transitions.
Treatment of property ClientsAndServers-PT-N0100P0-LTLFireability-11 finished in 2098 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((X(G(p0))&&p1)))&&F(p0)&&X(!p0)))'
Support contains 3 out of 21 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 21/21 places, 18/18 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 20 transition count 18
Applied a total of 1 rules in 1 ms. Remains 20 /21 variables (removed 1) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 20 cols
[2024-06-01 02:04:34] [INFO ] Computed 3 invariants in 3 ms
[2024-06-01 02:04:34] [INFO ] Implicit Places using invariants in 27 ms returned []
[2024-06-01 02:04:34] [INFO ] Invariant cache hit.
[2024-06-01 02:04:34] [INFO ] Implicit Places using invariants and state equation in 29 ms returned []
Implicit Place search using SMT with State Equation took 60 ms to find 0 implicit places.
Running 17 sub problems to find dead transitions.
[2024-06-01 02:04:34] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/19 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/19 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 2 (OVERLAPS) 1/20 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/20 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 4 (OVERLAPS) 18/38 variables, 20/23 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/38 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 6 (OVERLAPS) 0/38 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 17 unsolved
No progress, stopping.
After SMT solving in domain Real declared 38/38 variables, and 23 constraints, problems are : Problem set: 0 solved, 17 unsolved in 128 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 20/20 constraints, PredecessorRefiner: 17/17 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 17 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/19 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/19 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 2 (OVERLAPS) 1/20 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/20 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 4 (OVERLAPS) 18/38 variables, 20/23 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/38 variables, 17/40 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/38 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 7 (OVERLAPS) 0/38 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 17 unsolved
No progress, stopping.
After SMT solving in domain Int declared 38/38 variables, and 40 constraints, problems are : Problem set: 0 solved, 17 unsolved in 110 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 20/20 constraints, PredecessorRefiner: 17/17 constraints, Known Traps: 0/0 constraints]
After SMT, in 243ms problems are : Problem set: 0 solved, 17 unsolved
Search for dead transitions found 0 dead transitions in 243ms
Starting structural reductions in LTL mode, iteration 1 : 20/21 places, 18/18 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 304 ms. Remains : 20/21 places, 18/18 transitions.
Stuttering acceptance computed with spot in 217 ms :[true, true, true, (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p0)]
Running random walk in product with property : ClientsAndServers-PT-N0100P0-LTLFireability-12
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA ClientsAndServers-PT-N0100P0-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ClientsAndServers-PT-N0100P0-LTLFireability-12 finished in 538 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 U p1)))))'
Support contains 2 out of 21 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 21/21 places, 18/18 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 20 transition count 18
Applied a total of 1 rules in 2 ms. Remains 20 /21 variables (removed 1) and now considering 18/18 (removed 0) transitions.
[2024-06-01 02:04:34] [INFO ] Invariant cache hit.
[2024-06-01 02:04:34] [INFO ] Implicit Places using invariants in 27 ms returned []
[2024-06-01 02:04:34] [INFO ] Invariant cache hit.
[2024-06-01 02:04:34] [INFO ] Implicit Places using invariants and state equation in 33 ms returned []
Implicit Place search using SMT with State Equation took 62 ms to find 0 implicit places.
Running 17 sub problems to find dead transitions.
[2024-06-01 02:04:34] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/19 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/19 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 2 (OVERLAPS) 1/20 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/20 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 4 (OVERLAPS) 18/38 variables, 20/23 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/38 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 6 (OVERLAPS) 0/38 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 17 unsolved
No progress, stopping.
After SMT solving in domain Real declared 38/38 variables, and 23 constraints, problems are : Problem set: 0 solved, 17 unsolved in 136 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 20/20 constraints, PredecessorRefiner: 17/17 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 17 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/19 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/19 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 2 (OVERLAPS) 1/20 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/20 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 4 (OVERLAPS) 18/38 variables, 20/23 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/38 variables, 17/40 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/38 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 7 (OVERLAPS) 0/38 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 17 unsolved
No progress, stopping.
After SMT solving in domain Int declared 38/38 variables, and 40 constraints, problems are : Problem set: 0 solved, 17 unsolved in 109 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 20/20 constraints, PredecessorRefiner: 17/17 constraints, Known Traps: 0/0 constraints]
After SMT, in 251ms problems are : Problem set: 0 solved, 17 unsolved
Search for dead transitions found 0 dead transitions in 252ms
Starting structural reductions in LTL mode, iteration 1 : 20/21 places, 18/18 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 316 ms. Remains : 20/21 places, 18/18 transitions.
Stuttering acceptance computed with spot in 177 ms :[(NOT p1), (NOT p1), (NOT p1), true, (NOT p1)]
Running random walk in product with property : ClientsAndServers-PT-N0100P0-LTLFireability-15
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA ClientsAndServers-PT-N0100P0-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ClientsAndServers-PT-N0100P0-LTLFireability-15 finished in 511 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((G(p0) U (F(p1) U p2)))))'
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)))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((p0||X(F((p0&&F(!p0)))))))'
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)))))'
Found a Lengthening insensitive property : ClientsAndServers-PT-N0100P0-LTLFireability-09
Stuttering acceptance computed with spot in 174 ms :[p1, p1, p1, p1, true]
Support contains 3 out of 21 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 21/21 places, 18/18 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 0 with 8 rules applied. Total rules applied 8 place count 20 transition count 11
Reduce places removed 7 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 9 rules applied. Total rules applied 17 place count 13 transition count 9
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 19 place count 11 transition count 9
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 19 place count 11 transition count 7
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 23 place count 9 transition count 7
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 25 place count 8 transition count 6
Applied a total of 25 rules in 5 ms. Remains 8 /21 variables (removed 13) and now considering 6/18 (removed 12) transitions.
// Phase 1: matrix 6 rows 8 cols
[2024-06-01 02:04:36] [INFO ] Computed 3 invariants in 1 ms
[2024-06-01 02:04:36] [INFO ] Implicit Places using invariants in 23 ms returned [7]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 24 ms to find 1 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 7/21 places, 6/18 transitions.
Applied a total of 0 rules in 0 ms. Remains 7 /7 variables (removed 0) and now considering 6/6 (removed 0) transitions.
Finished structural reductions in LI_LTL mode , in 2 iterations and 31 ms. Remains : 7/21 places, 6/18 transitions.
Running random walk in product with property : ClientsAndServers-PT-N0100P0-LTLFireability-09
Entered a terminal (fully accepting) state of product in 895 steps with 233 reset in 1 ms.
Treatment of property ClientsAndServers-PT-N0100P0-LTLFireability-09 finished in 311 ms.
FORMULA ClientsAndServers-PT-N0100P0-LTLFireability-09 FALSE TECHNIQUES LENGTHENING_INSENSITIVE
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((p0||G(p1))))'
[2024-06-01 02:04:36] [INFO ] Flatten gal took : 4 ms
[2024-06-01 02:04:36] [INFO ] Export to MCC of 5 properties in file /home/mcc/execution/LTLFireability.sr.xml took 7 ms.
[2024-06-01 02:04:36] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 21 places, 18 transitions and 44 arcs took 6 ms.
Total runtime 20735 ms.
There are residual formulas that ITS could not solve within timeout
Could not compute solution for formula : ClientsAndServers-PT-N0100P0-LTLFireability-02
Could not compute solution for formula : ClientsAndServers-PT-N0100P0-LTLFireability-04
FORMULA ClientsAndServers-PT-N0100P0-LTLFireability-08 FALSE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
FORMULA ClientsAndServers-PT-N0100P0-LTLFireability-09 FALSE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
Could not compute solution for formula : ClientsAndServers-PT-N0100P0-LTLFireability-11

BK_STOP 1717207497469

--------------------
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 LTLFireability -timeout 360 -rebuildPNML
mcc2024
ltl formula name ClientsAndServers-PT-N0100P0-LTLFireability-02
ltl formula formula --ltl=/tmp/1759/ltl_0_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 21 places, 18 transitions and 44 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1759/ltl_0_
pnml2lts-mc( 0/ 4): Loading Petri net took 0.000 real 0.000 user 0.000 sys
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1759/ltl_0_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1759/ltl_0_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1759/ltl_0_
pnml2lts-mc( 0/ 4): buchi has 8 states
pnml2lts-mc( 0/ 4): There are 22 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 22, there are 73 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 1/ 4): ~1402 levels ~10000 states ~21560 transitions
pnml2lts-mc( 1/ 4): ~1402 levels ~20000 states ~40968 transitions
pnml2lts-mc( 1/ 4): ~1402 levels ~40000 states ~81068 transitions
pnml2lts-mc( 3/ 4): ~1401 levels ~80000 states ~204996 transitions
pnml2lts-mc( 2/ 4): ~1379 levels ~160000 states ~335548 transitions
pnml2lts-mc( 2/ 4): ~1379 levels ~320000 states ~677088 transitions
pnml2lts-mc( 3/ 4): ~1401 levels ~640000 states ~1613976 transitions
pnml2lts-mc( 0/ 4): ~1389 levels ~1280000 states ~2716900 transitions
pnml2lts-mc( 0/ 4): ~1389 levels ~2560000 states ~5278512 transitions
pnml2lts-mc( 0/ 4): ~1389 levels ~5120000 states ~10410700 transitions
pnml2lts-mc( 2/ 4): Error: tree leafs table full! Change -s/--ratio.
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 4235036
pnml2lts-mc( 0/ 4): unique states count: 4238576
pnml2lts-mc( 0/ 4): unique transitions count: 9288021
pnml2lts-mc( 0/ 4): - self-loop count: 0
pnml2lts-mc( 0/ 4): - claim dead count: 6305421
pnml2lts-mc( 0/ 4): - claim found count: 0
pnml2lts-mc( 0/ 4): - claim success count: 5194410
pnml2lts-mc( 0/ 4): - cum. max stack depth: 5571
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 5194410 states 11578086 transitions, fanout: 2.229
pnml2lts-mc( 0/ 4): Total exploration time 7.150 sec (7.140 sec minimum, 7.148 sec on average)
pnml2lts-mc( 0/ 4): States per second: 726491, Transitions per second: 1619313
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 96.4MB, 23.8 B/state, compr.: 26.5%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 12.0%/99.0%
pnml2lts-mc( 0/ 4): Stored 18 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 96.4MB (~256.0MB paged-in)
ltl formula name ClientsAndServers-PT-N0100P0-LTLFireability-04
ltl formula formula --ltl=/tmp/1759/ltl_1_
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 21 places, 18 transitions and 44 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1759/ltl_1_
pnml2lts-mc( 0/ 4): Loading Petri net took 0.000 real 0.000 user 0.000 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1759/ltl_1_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1759/ltl_1_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1759/ltl_1_
pnml2lts-mc( 0/ 4): buchi has 2 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4): There are 23 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 22, there are 23 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 3/ 4): ~1200 levels ~10000 states ~11824 transitions
pnml2lts-mc( 3/ 4): ~1200 levels ~20000 states ~26828 transitions
pnml2lts-mc( 2/ 4): ~1202 levels ~40000 states ~61996 transitions
pnml2lts-mc( 2/ 4): ~1202 levels ~80000 states ~121996 transitions
pnml2lts-mc( 2/ 4): ~1202 levels ~160000 states ~241996 transitions
pnml2lts-mc( 2/ 4): ~1202 levels ~320000 states ~481996 transitions
pnml2lts-mc( 2/ 4): ~1202 levels ~640000 states ~961996 transitions
pnml2lts-mc( 2/ 4): ~1202 levels ~1280000 states ~2111088 transitions
pnml2lts-mc( 2/ 4): ~1202 levels ~2560000 states ~4672760 transitions
pnml2lts-mc( 3/ 4): ~1200 levels ~5120000 states ~10088484 transitions
pnml2lts-mc( 2/ 4): Error: tree leafs table full! Change -s/--ratio.
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 8219439
pnml2lts-mc( 0/ 4): unique states count: 8222837
pnml2lts-mc( 0/ 4): unique transitions count: 16963819
pnml2lts-mc( 0/ 4): - self-loop count: 0
pnml2lts-mc( 0/ 4): - claim dead count: 8735994
pnml2lts-mc( 0/ 4): - claim found count: 0
pnml2lts-mc( 0/ 4): - claim success count: 8222843
pnml2lts-mc( 0/ 4): - cum. max stack depth: 4837
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 8222843 states 16963834 transitions, fanout: 2.063
pnml2lts-mc( 0/ 4): Total exploration time 6.790 sec (6.790 sec minimum, 6.790 sec on average)
pnml2lts-mc( 0/ 4): States per second: 1211022, Transitions per second: 2498356
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 126.8MB, 16.2 B/state, compr.: 18.0%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 24.0%/99.0%
pnml2lts-mc( 0/ 4): Stored 18 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 126.8MB (~256.0MB paged-in)
ltl formula name ClientsAndServers-PT-N0100P0-LTLFireability-08
ltl formula formula --ltl=/tmp/1759/ltl_2_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 21 places, 18 transitions and 44 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.010 real 0.000 user 0.000 sys
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1759/ltl_2_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1759/ltl_2_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1759/ltl_2_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1759/ltl_2_
pnml2lts-mc( 0/ 4): buchi has 1 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4): There are 23 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 22, there are 19 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 2/ 4): ~1915 levels ~10000 states ~22340 transitions
pnml2lts-mc( 2/ 4): ~3202 levels ~20000 states ~37568 transitions
pnml2lts-mc( 3/ 4):
pnml2lts-mc( 3/ 4): Accepting cycle FOUND at depth ~5001!
pnml2lts-mc( 3/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 7164
pnml2lts-mc( 0/ 4): unique states count: 22688
pnml2lts-mc( 0/ 4): unique transitions count: 47250
pnml2lts-mc( 0/ 4): - self-loop count: 1
pnml2lts-mc( 0/ 4): - claim dead count: 1490
pnml2lts-mc( 0/ 4): - claim found count: 0
pnml2lts-mc( 0/ 4): - claim success count: 22702
pnml2lts-mc( 0/ 4): - cum. max stack depth: 15816
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 22702 states 47279 transitions, fanout: 2.083
pnml2lts-mc( 0/ 4): Total exploration time 0.180 sec (0.180 sec minimum, 0.180 sec on average)
pnml2lts-mc( 0/ 4): States per second: 126122, Transitions per second: 262661
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 1.0MB, 22.5 B/state, compr.: 25.0%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/0.0%
pnml2lts-mc( 0/ 4): Stored 18 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 1.0MB (~256.0MB paged-in)
ltl formula name ClientsAndServers-PT-N0100P0-LTLFireability-09
ltl formula formula --ltl=/tmp/1759/ltl_3_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 21 places, 18 transitions and 44 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.000 real 0.000 user 0.000 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1759/ltl_3_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1759/ltl_3_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1759/ltl_3_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1759/ltl_3_
pnml2lts-mc( 0/ 4): buchi has 5 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4): There are 23 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 22, there are 28 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 3/ 4):
pnml2lts-mc( 3/ 4): Accepting cycle FOUND at depth ~1031!
pnml2lts-mc( 3/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 2755
pnml2lts-mc( 0/ 4): unique states count: 5531
pnml2lts-mc( 0/ 4): unique transitions count: 12751
pnml2lts-mc( 0/ 4): - self-loop count: 0
pnml2lts-mc( 0/ 4): - claim dead count: 165
pnml2lts-mc( 0/ 4): - claim found count: 1
pnml2lts-mc( 0/ 4): - claim success count: 6855
pnml2lts-mc( 0/ 4): - cum. max stack depth: 3537
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 6855 states 17074 transitions, fanout: 2.491
pnml2lts-mc( 0/ 4): Total exploration time 0.090 sec (0.090 sec minimum, 0.090 sec on average)
pnml2lts-mc( 0/ 4): States per second: 76167, Transitions per second: 189711
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 0.3MB, 22.0 B/state, compr.: 24.4%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/0.0%
pnml2lts-mc( 0/ 4): Stored 18 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 0.3MB (~256.0MB paged-in)
ltl formula name ClientsAndServers-PT-N0100P0-LTLFireability-11
ltl formula formula --ltl=/tmp/1759/ltl_4_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 21 places, 18 transitions and 44 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.010 real 0.000 user 0.000 sys
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1759/ltl_4_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1759/ltl_4_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1759/ltl_4_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1759/ltl_4_
pnml2lts-mc( 0/ 4): buchi has 2 states
pnml2lts-mc( 0/ 4): There are 22 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 22, there are 22 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 2/ 4): ~1552 levels ~10000 states ~16396 transitions
pnml2lts-mc( 2/ 4): ~1801 levels ~20000 states ~30392 transitions
pnml2lts-mc( 2/ 4): ~1801 levels ~40000 states ~60420 transitions
pnml2lts-mc( 2/ 4): ~1801 levels ~80000 states ~137200 transitions
pnml2lts-mc( 2/ 4): ~1801 levels ~160000 states ~297184 transitions
pnml2lts-mc( 2/ 4): ~1801 levels ~320000 states ~627164 transitions
pnml2lts-mc( 3/ 4): ~1799 levels ~640000 states ~1242240 transitions
pnml2lts-mc( 3/ 4): ~1799 levels ~1280000 states ~2500748 transitions
pnml2lts-mc( 3/ 4): ~1799 levels ~2560000 states ~5026644 transitions
pnml2lts-mc( 3/ 4): ~1799 levels ~5120000 states ~10093208 transitions
pnml2lts-mc( 3/ 4): Error: tree leafs table full! Change -s/--ratio.
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 4768244
pnml2lts-mc( 0/ 4): unique states count: 4774535
pnml2lts-mc( 0/ 4): unique transitions count: 11497134
pnml2lts-mc( 0/ 4): - self-loop count: 0
pnml2lts-mc( 0/ 4): - claim dead count: 6714910
pnml2lts-mc( 0/ 4): - claim found count: 0
pnml2lts-mc( 0/ 4): - claim success count: 4774549
pnml2lts-mc( 0/ 4): - cum. max stack depth: 7199
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 4774549 states 11497166 transitions, fanout: 2.408
pnml2lts-mc( 0/ 4): Total exploration time 5.110 sec (5.100 sec minimum, 5.102 sec on average)
pnml2lts-mc( 0/ 4): States per second: 934354, Transitions per second: 2249934
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 100.5MB, 22.0 B/state, compr.: 24.5%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 14.0%/99.0%
pnml2lts-mc( 0/ 4): Stored 18 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 100.5MB (~256.0MB paged-in)

Sequence of Actions to be Executed by the VM

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

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool ltsminxred"
echo " Input is ClientsAndServers-PT-N0100P0, 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 r476-tall-171620506000492"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/ClientsAndServers-PT-N0100P0.tgz
mv ClientsAndServers-PT-N0100P0 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 ;