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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 420K
-rw-r--r-- 1 mcc users 7.2K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 78K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.9K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 57K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16: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.4K Apr 22 14:33 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 22 14:33 LTLFireability.xml
-rw-r--r-- 1 mcc users 6.9K Apr 12 22:50 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 64K Apr 12 22:50 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.2K Apr 12 22:50 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 80K Apr 12 22:50 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-N0005P1-LTLFireability-00
FORMULA_NAME ClientsAndServers-PT-N0005P1-LTLFireability-01
FORMULA_NAME ClientsAndServers-PT-N0005P1-LTLFireability-02
FORMULA_NAME ClientsAndServers-PT-N0005P1-LTLFireability-03
FORMULA_NAME ClientsAndServers-PT-N0005P1-LTLFireability-04
FORMULA_NAME ClientsAndServers-PT-N0005P1-LTLFireability-05
FORMULA_NAME ClientsAndServers-PT-N0005P1-LTLFireability-06
FORMULA_NAME ClientsAndServers-PT-N0005P1-LTLFireability-07
FORMULA_NAME ClientsAndServers-PT-N0005P1-LTLFireability-08
FORMULA_NAME ClientsAndServers-PT-N0005P1-LTLFireability-09
FORMULA_NAME ClientsAndServers-PT-N0005P1-LTLFireability-10
FORMULA_NAME ClientsAndServers-PT-N0005P1-LTLFireability-11
FORMULA_NAME ClientsAndServers-PT-N0005P1-LTLFireability-12
FORMULA_NAME ClientsAndServers-PT-N0005P1-LTLFireability-13
FORMULA_NAME ClientsAndServers-PT-N0005P1-LTLFireability-14
FORMULA_NAME ClientsAndServers-PT-N0005P1-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1716293159181

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ClientsAndServers-PT-N0005P1
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202405141337
[2024-05-21 12:06:00] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-21 12:06:00] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-21 12:06:00] [INFO ] Load time of PNML (sax parser for PT used): 31 ms
[2024-05-21 12:06:00] [INFO ] Transformed 25 places.
[2024-05-21 12:06:00] [INFO ] Transformed 18 transitions.
[2024-05-21 12:06:00] [INFO ] Parsed PT model containing 25 places and 18 transitions and 54 arcs in 123 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 4 formulas.
FORMULA ClientsAndServers-PT-N0005P1-LTLFireability-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ClientsAndServers-PT-N0005P1-LTLFireability-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ClientsAndServers-PT-N0005P1-LTLFireability-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ClientsAndServers-PT-N0005P1-LTLFireability-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 20 out of 25 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 25/25 places, 18/18 transitions.
Applied a total of 0 rules in 13 ms. Remains 25 /25 variables (removed 0) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 25 cols
[2024-05-21 12:06:00] [INFO ] Computed 8 invariants in 6 ms
[2024-05-21 12:06:00] [INFO ] Implicit Places using invariants in 127 ms returned []
[2024-05-21 12:06:00] [INFO ] Invariant cache hit.
[2024-05-21 12:06:00] [INFO ] Implicit Places using invariants and state equation in 45 ms returned []
Implicit Place search using SMT with State Equation took 206 ms to find 0 implicit places.
Running 17 sub problems to find dead transitions.
[2024-05-21 12:06:00] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/24 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/24 variables, 3/6 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/24 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 3 (OVERLAPS) 1/25 variables, 2/8 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/25 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 5 (OVERLAPS) 18/43 variables, 25/33 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/43 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 7 (OVERLAPS) 0/43 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 17 unsolved
No progress, stopping.
After SMT solving in domain Real declared 43/43 variables, and 33 constraints, problems are : Problem set: 0 solved, 17 unsolved in 247 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 25/25 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/24 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/24 variables, 3/6 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/24 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 3 (OVERLAPS) 1/25 variables, 2/8 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/25 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 5 (OVERLAPS) 18/43 variables, 25/33 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/43 variables, 17/50 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/43 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 8 (OVERLAPS) 0/43 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 17 unsolved
No progress, stopping.
After SMT solving in domain Int declared 43/43 variables, and 50 constraints, problems are : Problem set: 0 solved, 17 unsolved in 192 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 25/25 constraints, PredecessorRefiner: 17/17 constraints, Known Traps: 0/0 constraints]
After SMT, in 460ms problems are : Problem set: 0 solved, 17 unsolved
Search for dead transitions found 0 dead transitions in 475ms
Finished structural reductions in LTL mode , in 1 iterations and 730 ms. Remains : 25/25 places, 18/18 transitions.
Support contains 20 out of 25 places after structural reductions.
[2024-05-21 12:06:01] [INFO ] Flatten gal took : 14 ms
[2024-05-21 12:06:01] [INFO ] Flatten gal took : 4 ms
[2024-05-21 12:06:01] [INFO ] Input system was already deterministic with 18 transitions.
RANDOM walk for 19869 steps (20 resets) in 197 ms. (100 steps per ms) remains 0/17 properties
Computed a total of 0 stabilizing places and 0 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0)||F((p1||G(p2)))))'
Support contains 5 out of 25 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 25/25 places, 18/18 transitions.
Discarding 2 places :
Implicit places reduction removed 2 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 23 transition count 14
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 10 place count 19 transition count 14
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 10 place count 19 transition count 12
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 14 place count 17 transition count 12
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 2 with 2 rules applied. Total rules applied 16 place count 16 transition count 11
Applied a total of 16 rules in 21 ms. Remains 16 /25 variables (removed 9) and now considering 11/18 (removed 7) transitions.
// Phase 1: matrix 11 rows 16 cols
[2024-05-21 12:06:01] [INFO ] Computed 6 invariants in 1 ms
[2024-05-21 12:06:01] [INFO ] Implicit Places using invariants in 23 ms returned [10]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 25 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 15/25 places, 11/18 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 15 transition count 10
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 14 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 2 with 2 rules applied. Total rules applied 4 place count 13 transition count 9
Applied a total of 4 rules in 2 ms. Remains 13 /15 variables (removed 2) and now considering 9/11 (removed 2) transitions.
// Phase 1: matrix 9 rows 13 cols
[2024-05-21 12:06:01] [INFO ] Computed 5 invariants in 0 ms
[2024-05-21 12:06:01] [INFO ] Implicit Places using invariants in 20 ms returned []
[2024-05-21 12:06:01] [INFO ] Invariant cache hit.
[2024-05-21 12:06:01] [INFO ] Implicit Places using invariants and state equation in 33 ms returned []
Implicit Place search using SMT with State Equation took 55 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 13/25 places, 9/18 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 103 ms. Remains : 13/25 places, 9/18 transitions.
Stuttering acceptance computed with spot in 244 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : ClientsAndServers-PT-N0005P1-LTLFireability-01
Product exploration explored 100000 steps with 3707 reset in 274 ms.
Product exploration explored 100000 steps with 3734 reset in 144 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 (NOT p1) (NOT p2)), (X (AND p0 (NOT p1))), (X (NOT p2)), (X (NOT (AND (NOT p1) p2))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND (NOT p1) (NOT p2))), (X p0), (X (NOT p1)), (X (X (AND p0 (NOT p1)))), (X (X (NOT p2))), (X (X (NOT (AND (NOT p1) p2)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND (NOT p1) (NOT p2)))), (X (X p0)), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 15 factoid took 151 ms. Reduced automaton from 2 states, 4 edges and 3 AP (stutter insensitive) to 2 states, 4 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 73 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
RANDOM walk for 413 steps (0 resets) in 11 ms. (34 steps per ms) remains 0/7 properties
Knowledge obtained : [(AND p0 (NOT p1) (NOT p2)), (X (AND p0 (NOT p1))), (X (NOT p2)), (X (NOT (AND (NOT p1) p2))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND (NOT p1) (NOT p2))), (X p0), (X (NOT p1)), (X (X (AND p0 (NOT p1)))), (X (X (NOT p2))), (X (X (NOT (AND (NOT p1) p2)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND (NOT p1) (NOT p2)))), (X (X p0)), (X (X (NOT p1)))]
False Knowledge obtained : [(F (NOT (AND (NOT p1) (NOT p2)))), (F (NOT (OR p0 p1))), (F p1), (F (NOT p0)), (F (NOT (AND p0 (NOT p1)))), (F (NOT (OR p1 (NOT p2)))), (F p2)]
Knowledge based reduction with 15 factoid took 319 ms. Reduced automaton from 2 states, 4 edges and 3 AP (stutter insensitive) to 2 states, 4 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 86 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 73 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Support contains 5 out of 13 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 13/13 places, 9/9 transitions.
Applied a total of 0 rules in 2 ms. Remains 13 /13 variables (removed 0) and now considering 9/9 (removed 0) transitions.
[2024-05-21 12:06:03] [INFO ] Invariant cache hit.
[2024-05-21 12:06:03] [INFO ] Implicit Places using invariants in 21 ms returned []
[2024-05-21 12:06:03] [INFO ] Invariant cache hit.
[2024-05-21 12:06:03] [INFO ] Implicit Places using invariants and state equation in 25 ms returned []
Implicit Place search using SMT with State Equation took 50 ms to find 0 implicit places.
[2024-05-21 12:06:03] [INFO ] Redundant transitions in 0 ms returned []
Running 8 sub problems to find dead transitions.
[2024-05-21 12:06:03] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/12 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/12 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/12 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (OVERLAPS) 1/13 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 5 (OVERLAPS) 9/22 variables, 13/18 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/22 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 7 (OVERLAPS) 0/22 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Real declared 22/22 variables, and 18 constraints, problems are : Problem set: 0 solved, 8 unsolved in 67 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 13/13 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/12 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/12 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/12 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (OVERLAPS) 1/13 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 5 (OVERLAPS) 9/22 variables, 13/18 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/22 variables, 8/26 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/22 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 8 (OVERLAPS) 0/22 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Int declared 22/22 variables, and 26 constraints, problems are : Problem set: 0 solved, 8 unsolved in 62 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 13/13 constraints, PredecessorRefiner: 8/8 constraints, Known Traps: 0/0 constraints]
After SMT, in 133ms problems are : Problem set: 0 solved, 8 unsolved
Search for dead transitions found 0 dead transitions in 133ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 189 ms. Remains : 13/13 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 p0 (NOT p1) (NOT p2)), (X (AND p0 (NOT p1))), (X (NOT p2)), (X (NOT (AND (NOT p1) p2))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND (NOT p1) (NOT p2))), (X p0), (X (NOT p1)), (X (X (AND p0 (NOT p1)))), (X (X (NOT p2))), (X (X (NOT (AND (NOT p1) p2)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND (NOT p1) (NOT p2)))), (X (X p0)), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 15 factoid took 92 ms. Reduced automaton from 2 states, 4 edges and 3 AP (stutter insensitive) to 2 states, 4 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 66 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
RANDOM walk for 437 steps (1 resets) in 10 ms. (39 steps per ms) remains 0/7 properties
Knowledge obtained : [(AND p0 (NOT p1) (NOT p2)), (X (AND p0 (NOT p1))), (X (NOT p2)), (X (NOT (AND (NOT p1) p2))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND (NOT p1) (NOT p2))), (X p0), (X (NOT p1)), (X (X (AND p0 (NOT p1)))), (X (X (NOT p2))), (X (X (NOT (AND (NOT p1) p2)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND (NOT p1) (NOT p2)))), (X (X p0)), (X (X (NOT p1)))]
False Knowledge obtained : [(F (NOT (AND (NOT p1) (NOT p2)))), (F (NOT (OR p0 p1))), (F p1), (F (NOT p0)), (F (NOT (AND p0 (NOT p1)))), (F (NOT (OR p1 (NOT p2)))), (F p2)]
Knowledge based reduction with 15 factoid took 314 ms. Reduced automaton from 2 states, 4 edges and 3 AP (stutter insensitive) to 2 states, 4 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 81 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 64 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 88 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Product exploration explored 100000 steps with 3723 reset in 107 ms.
Product exploration explored 100000 steps with 3740 reset in 204 ms.
Built C files in :
/tmp/ltsmin1117627823155419154
[2024-05-21 12:06:04] [INFO ] Computing symmetric may disable matrix : 9 transitions.
[2024-05-21 12:06:04] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 12:06:04] [INFO ] Computing symmetric may enable matrix : 9 transitions.
[2024-05-21 12:06:04] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 12:06:04] [INFO ] Computing Do-Not-Accords matrix : 9 transitions.
[2024-05-21 12:06:04] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 12:06:04] [INFO ] Built C files in 29ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1117627823155419154
Running compilation step : cd /tmp/ltsmin1117627823155419154;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 200 ms.
Running link step : cd /tmp/ltsmin1117627823155419154;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 44 ms.
Running LTSmin : cd /tmp/ltsmin1117627823155419154;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased3047656039822315425.hoa' '--buchi-type=spotba'
LTSmin run took 2091 ms.
FORMULA ClientsAndServers-PT-N0005P1-LTLFireability-01 TRUE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property ClientsAndServers-PT-N0005P1-LTLFireability-01 finished in 5235 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&&(!p1 U p2))))'
Support contains 4 out of 25 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 25/25 places, 18/18 transitions.
Discarding 4 places :
Implicit places reduction removed 4 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 0 with 8 rules applied. Total rules applied 8 place count 21 transition count 14
Reduce places removed 4 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 5 rules applied. Total rules applied 13 place count 17 transition count 13
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 14 place count 16 transition count 13
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 14 place count 16 transition count 12
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 16 place count 15 transition count 12
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 20 place count 13 transition count 10
Applied a total of 20 rules in 4 ms. Remains 13 /25 variables (removed 12) and now considering 10/18 (removed 8) transitions.
// Phase 1: matrix 10 rows 13 cols
[2024-05-21 12:06:07] [INFO ] Computed 4 invariants in 0 ms
[2024-05-21 12:06:07] [INFO ] Implicit Places using invariants in 31 ms returned [9]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 32 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 12/25 places, 10/18 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 12 transition count 9
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 11 transition count 9
Applied a total of 2 rules in 2 ms. Remains 11 /12 variables (removed 1) and now considering 9/10 (removed 1) transitions.
// Phase 1: matrix 9 rows 11 cols
[2024-05-21 12:06:07] [INFO ] Computed 3 invariants in 1 ms
[2024-05-21 12:06:07] [INFO ] Implicit Places using invariants in 22 ms returned []
[2024-05-21 12:06:07] [INFO ] Invariant cache hit.
[2024-05-21 12:06:07] [INFO ] Implicit Places using invariants and state equation in 34 ms returned []
Implicit Place search using SMT with State Equation took 58 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 11/25 places, 9/18 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 96 ms. Remains : 11/25 places, 9/18 transitions.
Stuttering acceptance computed with spot in 177 ms :[(NOT p2), (OR (NOT p0) (NOT p2))]
Running random walk in product with property : ClientsAndServers-PT-N0005P1-LTLFireability-03
Product exploration explored 100000 steps with 15169 reset in 82 ms.
Product exploration explored 100000 steps with 15091 reset in 87 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) p1 p0), (X (NOT p2)), (X (AND (NOT p2) p1)), (X (NOT (AND p0 (NOT p2) (NOT p1)))), (X (OR (NOT p0) (AND (NOT p2) p1))), (X (NOT (AND (NOT p2) (NOT p1)))), (X p0), (X p1), (X (X (NOT p2))), (X (X (AND (NOT p2) p1))), (X (X (NOT (AND p0 (NOT p2) (NOT p1))))), (X (X (OR (NOT p0) (AND (NOT p2) p1)))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 15 factoid took 126 ms. Reduced automaton from 2 states, 4 edges and 3 AP (stutter insensitive) to 2 states, 4 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 103 ms :[(NOT p2), (OR (NOT p2) (NOT p0))]
RANDOM walk for 2026 steps (2 resets) in 10 ms. (184 steps per ms) remains 0/7 properties
Knowledge obtained : [(AND (NOT p2) p1 p0), (X (NOT p2)), (X (AND (NOT p2) p1)), (X (NOT (AND p0 (NOT p2) (NOT p1)))), (X (OR (NOT p0) (AND (NOT p2) p1))), (X (NOT (AND (NOT p2) (NOT p1)))), (X p0), (X p1), (X (X (NOT p2))), (X (X (AND (NOT p2) p1))), (X (X (NOT (AND p0 (NOT p2) (NOT p1))))), (X (X (OR (NOT p0) (AND (NOT p2) p1)))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X p0)), (X (X p1))]
False Knowledge obtained : [(F (NOT p1)), (F (NOT p0)), (F (NOT (OR (AND p1 (NOT p2)) (NOT p0)))), (F (NOT (AND p1 (NOT p2)))), (F p2), (F (NOT (OR p1 p2 (NOT p0)))), (F (NOT (OR p1 p2)))]
Knowledge based reduction with 15 factoid took 358 ms. Reduced automaton from 2 states, 4 edges and 3 AP (stutter insensitive) to 2 states, 4 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 97 ms :[(NOT p2), (OR (NOT p2) (NOT p0))]
Stuttering acceptance computed with spot in 95 ms :[(NOT p2), (OR (NOT p2) (NOT p0))]
[2024-05-21 12:06:08] [INFO ] Invariant cache hit.
[2024-05-21 12:06:08] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-21 12:06:08] [INFO ] [Real]Absence check using state equation in 3 ms returned sat
[2024-05-21 12:06:08] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 12:06:08] [INFO ] [Nat]Absence check using 3 positive place invariants in 0 ms returned sat
[2024-05-21 12:06:08] [INFO ] [Nat]Absence check using state equation in 3 ms returned sat
[2024-05-21 12:06:08] [INFO ] Computed and/alt/rep : 8/8/8 causal constraints (skipped 0 transitions) in 1 ms.
[2024-05-21 12:06:08] [INFO ] Added : 4 causal constraints over 1 iterations in 13 ms. Result :sat
Could not prove EG (NOT p2)
Support contains 4 out of 11 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 11/11 places, 9/9 transitions.
Applied a total of 0 rules in 0 ms. Remains 11 /11 variables (removed 0) and now considering 9/9 (removed 0) transitions.
[2024-05-21 12:06:08] [INFO ] Invariant cache hit.
[2024-05-21 12:06:08] [INFO ] Implicit Places using invariants in 23 ms returned []
[2024-05-21 12:06:08] [INFO ] Invariant cache hit.
[2024-05-21 12:06:08] [INFO ] Implicit Places using invariants and state equation in 21 ms returned []
Implicit Place search using SMT with State Equation took 45 ms to find 0 implicit places.
[2024-05-21 12:06:08] [INFO ] Redundant transitions in 0 ms returned []
Running 8 sub problems to find dead transitions.
[2024-05-21 12:06:08] [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) 1/11 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/11 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 4 (OVERLAPS) 9/20 variables, 11/14 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/20 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 6 (OVERLAPS) 0/20 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Real declared 20/20 variables, and 14 constraints, problems are : Problem set: 0 solved, 8 unsolved in 74 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 11/11 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) 1/11 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/11 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 4 (OVERLAPS) 9/20 variables, 11/14 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/20 variables, 8/22 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/20 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 7 (OVERLAPS) 0/20 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Int declared 20/20 variables, and 22 constraints, problems are : Problem set: 0 solved, 8 unsolved in 65 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 11/11 constraints, PredecessorRefiner: 8/8 constraints, Known Traps: 0/0 constraints]
After SMT, in 143ms problems are : Problem set: 0 solved, 8 unsolved
Search for dead transitions found 0 dead transitions in 143ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 192 ms. Remains : 11/11 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 p1 (NOT p2) p0), (X (NOT p2)), (X (NOT (AND (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p1) (NOT p2) p0))), (X p0), (X p1), (X (AND p1 (NOT p2))), (X (OR (AND p1 (NOT p2)) (NOT p0))), (X (X (NOT p2))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p1) (NOT p2) p0)))), (X (X p0)), (X (X p1)), (X (X (AND p1 (NOT p2)))), (X (X (OR (AND p1 (NOT p2)) (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 15 factoid took 119 ms. Reduced automaton from 2 states, 4 edges and 3 AP (stutter insensitive) to 2 states, 4 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 87 ms :[(NOT p2), (OR (NOT p0) (NOT p2))]
RANDOM walk for 2277 steps (2 resets) in 13 ms. (162 steps per ms) remains 0/7 properties
Knowledge obtained : [(AND p1 (NOT p2) p0), (X (NOT p2)), (X (NOT (AND (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p1) (NOT p2) p0))), (X p0), (X p1), (X (AND p1 (NOT p2))), (X (OR (AND p1 (NOT p2)) (NOT p0))), (X (X (NOT p2))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p1) (NOT p2) p0)))), (X (X p0)), (X (X p1)), (X (X (AND p1 (NOT p2)))), (X (X (OR (AND p1 (NOT p2)) (NOT p0))))]
False Knowledge obtained : [(F (NOT p0)), (F (NOT (OR p2 p1))), (F (NOT (OR p2 (NOT p0) p1))), (F (NOT p1)), (F p2), (F (NOT (OR (AND (NOT p2) p1) (NOT p0)))), (F (NOT (AND (NOT p2) p1)))]
Knowledge based reduction with 15 factoid took 296 ms. Reduced automaton from 2 states, 4 edges and 3 AP (stutter insensitive) to 2 states, 4 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 101 ms :[(NOT p2), (OR (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 73 ms :[(NOT p2), (OR (NOT p0) (NOT p2))]
[2024-05-21 12:06:09] [INFO ] Invariant cache hit.
[2024-05-21 12:06:09] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-21 12:06:09] [INFO ] [Real]Absence check using state equation in 5 ms returned sat
[2024-05-21 12:06:09] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 12:06:09] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-21 12:06:09] [INFO ] [Nat]Absence check using state equation in 3 ms returned sat
[2024-05-21 12:06:09] [INFO ] Computed and/alt/rep : 8/8/8 causal constraints (skipped 0 transitions) in 0 ms.
[2024-05-21 12:06:09] [INFO ] Added : 4 causal constraints over 1 iterations in 8 ms. Result :sat
Could not prove EG (NOT p2)
Stuttering acceptance computed with spot in 82 ms :[(NOT p2), (OR (NOT p0) (NOT p2))]
Product exploration explored 100000 steps with 15119 reset in 74 ms.
Product exploration explored 100000 steps with 15138 reset in 74 ms.
Built C files in :
/tmp/ltsmin17949543652016099856
[2024-05-21 12:06:09] [INFO ] Computing symmetric may disable matrix : 9 transitions.
[2024-05-21 12:06:09] [INFO ] Computation of Complete disable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 12:06:09] [INFO ] Computing symmetric may enable matrix : 9 transitions.
[2024-05-21 12:06:09] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 12:06:09] [INFO ] Computing Do-Not-Accords matrix : 9 transitions.
[2024-05-21 12:06:09] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 12:06:09] [INFO ] Built C files in 2ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17949543652016099856
Running compilation step : cd /tmp/ltsmin17949543652016099856;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 92 ms.
Running link step : cd /tmp/ltsmin17949543652016099856;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 32 ms.
Running LTSmin : cd /tmp/ltsmin17949543652016099856;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased7759519237619119758.hoa' '--buchi-type=spotba'
LTSmin run took 65 ms.
FORMULA ClientsAndServers-PT-N0005P1-LTLFireability-03 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property ClientsAndServers-PT-N0005P1-LTLFireability-03 finished in 2789 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0||G(F(p1)))))'
Support contains 5 out of 25 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 25/25 places, 18/18 transitions.
Discarding 4 places :
Implicit places reduction removed 4 places
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 21 transition count 18
Applied a total of 4 rules in 1 ms. Remains 21 /25 variables (removed 4) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 21 cols
[2024-05-21 12:06:09] [INFO ] Computed 4 invariants in 1 ms
[2024-05-21 12:06:09] [INFO ] Implicit Places using invariants in 24 ms returned []
[2024-05-21 12:06:09] [INFO ] Invariant cache hit.
[2024-05-21 12:06:09] [INFO ] Implicit Places using invariants and state equation in 26 ms returned []
Implicit Place search using SMT with State Equation took 50 ms to find 0 implicit places.
Running 17 sub problems to find dead transitions.
[2024-05-21 12:06:09] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/20 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/20 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 2 (OVERLAPS) 1/21 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/21 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 4 (OVERLAPS) 18/39 variables, 21/25 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/39 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 6 (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 143 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 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, 3/3 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/20 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 2 (OVERLAPS) 1/21 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/21 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 4 (OVERLAPS) 18/39 variables, 21/25 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/39 variables, 17/42 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/39 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 7 (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 128 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 21/21 constraints, PredecessorRefiner: 17/17 constraints, Known Traps: 0/0 constraints]
After SMT, in 275ms problems are : Problem set: 0 solved, 17 unsolved
Search for dead transitions found 0 dead transitions in 275ms
Starting structural reductions in LTL mode, iteration 1 : 21/25 places, 18/18 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 327 ms. Remains : 21/25 places, 18/18 transitions.
Stuttering acceptance computed with spot in 165 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1)]
Running random walk in product with property : ClientsAndServers-PT-N0005P1-LTLFireability-04
Product exploration explored 100000 steps with 2588 reset in 86 ms.
Product exploration explored 100000 steps with 2565 reset in 79 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 (AND (NOT p0) (NOT p1))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 5 factoid took 69 ms. Reduced automaton from 4 states, 6 edges and 2 AP (stutter sensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 71 ms :[(NOT p1), (NOT p1)]
RANDOM walk for 674 steps (0 resets) in 4 ms. (134 steps per ms) remains 0/1 properties
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (AND (NOT p0) (NOT p1))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT p1)))]
False Knowledge obtained : [(F p1)]
Knowledge based reduction with 5 factoid took 113 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 66 ms :[(NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 87 ms :[(NOT p1), (NOT p1)]
[2024-05-21 12:06:10] [INFO ] Invariant cache hit.
[2024-05-21 12:06:11] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2024-05-21 12:06:11] [INFO ] [Real]Absence check using state equation in 6 ms returned sat
[2024-05-21 12:06:11] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 12:06:11] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2024-05-21 12:06:11] [INFO ] [Nat]Absence check using state equation in 5 ms returned sat
[2024-05-21 12:06:11] [INFO ] Computed and/alt/rep : 17/17/17 causal constraints (skipped 0 transitions) in 1 ms.
[2024-05-21 12:06:11] [INFO ] Added : 15 causal constraints over 3 iterations in 9 ms. Result :sat
Could not prove EG (NOT p1)
Support contains 2 out of 21 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 21/21 places, 18/18 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 21 transition count 16
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 19 transition count 16
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 4 place count 19 transition count 12
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 12 place count 15 transition count 12
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 2 with 2 rules applied. Total rules applied 14 place count 14 transition count 11
Applied a total of 14 rules in 2 ms. Remains 14 /21 variables (removed 7) and now considering 11/18 (removed 7) transitions.
// Phase 1: matrix 11 rows 14 cols
[2024-05-21 12:06:11] [INFO ] Computed 4 invariants in 1 ms
[2024-05-21 12:06:11] [INFO ] Implicit Places using invariants in 26 ms returned [13]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 27 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 13/21 places, 11/18 transitions.
Applied a total of 0 rules in 2 ms. Remains 13 /13 variables (removed 0) and now considering 11/11 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 31 ms. Remains : 13/21 places, 11/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 : [(NOT p1), (X (NOT p1)), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 61 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 70 ms :[(NOT p1), (NOT p1)]
RANDOM walk for 450 steps (0 resets) in 5 ms. (75 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p1), (X (NOT p1)), (X (X (NOT p1)))]
False Knowledge obtained : [(F p1)]
Knowledge based reduction with 3 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 84 ms :[(NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 75 ms :[(NOT p1), (NOT p1)]
// Phase 1: matrix 11 rows 13 cols
[2024-05-21 12:06:11] [INFO ] Computed 3 invariants in 1 ms
[2024-05-21 12:06:11] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-21 12:06:11] [INFO ] [Real]Absence check using state equation in 5 ms returned sat
[2024-05-21 12:06:11] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 12:06:11] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-21 12:06:11] [INFO ] [Nat]Absence check using state equation in 4 ms returned sat
[2024-05-21 12:06:11] [INFO ] Computed and/alt/rep : 10/10/10 causal constraints (skipped 0 transitions) in 0 ms.
[2024-05-21 12:06:11] [INFO ] Added : 9 causal constraints over 2 iterations in 8 ms. Result :sat
Could not prove EG (NOT p1)
Stuttering acceptance computed with spot in 70 ms :[(NOT p1), (NOT p1)]
Product exploration explored 100000 steps with 5627 reset in 64 ms.
Product exploration explored 100000 steps with 5761 reset in 60 ms.
Built C files in :
/tmp/ltsmin1828580846712377362
[2024-05-21 12:06:11] [INFO ] Computing symmetric may disable matrix : 11 transitions.
[2024-05-21 12:06:11] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 12:06:11] [INFO ] Computing symmetric may enable matrix : 11 transitions.
[2024-05-21 12:06:11] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 12:06:11] [INFO ] Computing Do-Not-Accords matrix : 11 transitions.
[2024-05-21 12:06:11] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 12:06:11] [INFO ] Built C files in 3ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1828580846712377362
Running compilation step : cd /tmp/ltsmin1828580846712377362;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 93 ms.
Running link step : cd /tmp/ltsmin1828580846712377362;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 32 ms.
Running LTSmin : cd /tmp/ltsmin1828580846712377362;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased20584380954925374.hoa' '--buchi-type=spotba'
LTSmin run took 198 ms.
FORMULA ClientsAndServers-PT-N0005P1-LTLFireability-04 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property ClientsAndServers-PT-N0005P1-LTLFireability-04 finished in 2295 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((X(X(p0))&&X(p0)))||p1))))'
Support contains 4 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 0 ms. Remains 22 /25 variables (removed 3) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 22 cols
[2024-05-21 12:06:12] [INFO ] Computed 5 invariants in 0 ms
[2024-05-21 12:06:12] [INFO ] Implicit Places using invariants in 22 ms returned []
[2024-05-21 12:06:12] [INFO ] Invariant cache hit.
[2024-05-21 12:06:12] [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.
Running 17 sub problems to find dead transitions.
[2024-05-21 12:06:12] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/21 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/21 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 2 (OVERLAPS) 1/22 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/22 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 4 (OVERLAPS) 18/40 variables, 22/27 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/40 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 6 (OVERLAPS) 0/40 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 17 unsolved
No progress, stopping.
After SMT solving in domain Real declared 40/40 variables, and 27 constraints, problems are : Problem set: 0 solved, 17 unsolved in 133 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 22/22 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/21 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/21 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 2 (OVERLAPS) 1/22 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/22 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 4 (OVERLAPS) 18/40 variables, 22/27 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/40 variables, 17/44 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/40 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 7 (OVERLAPS) 0/40 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 17 unsolved
No progress, stopping.
After SMT solving in domain Int declared 40/40 variables, and 44 constraints, problems are : Problem set: 0 solved, 17 unsolved in 113 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 22/22 constraints, PredecessorRefiner: 17/17 constraints, Known Traps: 0/0 constraints]
After SMT, in 250ms problems are : Problem set: 0 solved, 17 unsolved
Search for dead transitions found 0 dead transitions in 251ms
Starting structural reductions in LTL mode, iteration 1 : 22/25 places, 18/18 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 302 ms. Remains : 22/25 places, 18/18 transitions.
Stuttering acceptance computed with spot in 157 ms :[true, (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p0)]
Running random walk in product with property : ClientsAndServers-PT-N0005P1-LTLFireability-05
Entered a terminal (fully accepting) state of product in 3 steps with 0 reset in 0 ms.
FORMULA ClientsAndServers-PT-N0005P1-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ClientsAndServers-PT-N0005P1-LTLFireability-05 finished in 476 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F(p0))))'
Support contains 2 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 1 ms. Remains 22 /25 variables (removed 3) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 22 cols
[2024-05-21 12:06:12] [INFO ] Computed 5 invariants in 2 ms
[2024-05-21 12:06:12] [INFO ] Implicit Places using invariants in 25 ms returned [14]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 26 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 28 ms. Remains : 21/25 places, 18/18 transitions.
Stuttering acceptance computed with spot in 106 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : ClientsAndServers-PT-N0005P1-LTLFireability-06
Product exploration explored 100000 steps with 1350 reset in 118 ms.
Product exploration explored 100000 steps with 1345 reset in 130 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 (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 60 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 98 ms :[(NOT p0), (NOT p0), (NOT p0)]
RANDOM walk for 2470 steps (3 resets) in 7 ms. (308 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 2 factoid took 78 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 103 ms :[(NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 110 ms :[(NOT p0), (NOT p0), (NOT p0)]
// Phase 1: matrix 18 rows 21 cols
[2024-05-21 12:06:13] [INFO ] Computed 4 invariants in 0 ms
[2024-05-21 12:06:13] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-21 12:06:13] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-21 12:06:13] [INFO ] [Real]Absence check using state equation in 5 ms returned sat
[2024-05-21 12:06:13] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 12:06:13] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-21 12:06:13] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-21 12:06:13] [INFO ] [Nat]Absence check using state equation in 9 ms returned sat
[2024-05-21 12:06:13] [INFO ] Computed and/alt/rep : 17/18/17 causal constraints (skipped 0 transitions) in 6 ms.
[2024-05-21 12:06:13] [INFO ] Added : 13 causal constraints over 3 iterations in 16 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 2 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.
[2024-05-21 12:06:13] [INFO ] Invariant cache hit.
[2024-05-21 12:06:13] [INFO ] Implicit Places using invariants in 21 ms returned []
[2024-05-21 12:06:13] [INFO ] Invariant cache hit.
[2024-05-21 12:06:13] [INFO ] Implicit Places using invariants and state equation in 24 ms returned []
Implicit Place search using SMT with State Equation took 46 ms to find 0 implicit places.
Running 17 sub problems to find dead transitions.
[2024-05-21 12:06:13] [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 132 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 118 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 254ms problems are : Problem set: 0 solved, 17 unsolved
Search for dead transitions found 0 dead transitions in 255ms
Finished structural reductions in LTL mode , in 1 iterations and 303 ms. Remains : 21/21 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 : [(NOT p0), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 81 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 113 ms :[(NOT p0), (NOT p0), (NOT p0)]
RANDOM walk for 1051 steps (0 resets) in 4 ms. (210 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 2 factoid took 88 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 104 ms :[(NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 118 ms :[(NOT p0), (NOT p0), (NOT p0)]
[2024-05-21 12:06:14] [INFO ] Invariant cache hit.
[2024-05-21 12:06:14] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-21 12:06:14] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-21 12:06:14] [INFO ] [Real]Absence check using state equation in 5 ms returned sat
[2024-05-21 12:06:14] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 12:06:14] [INFO ] [Nat]Absence check using 3 positive place invariants in 0 ms returned sat
[2024-05-21 12:06:14] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-21 12:06:14] [INFO ] [Nat]Absence check using state equation in 6 ms returned sat
[2024-05-21 12:06:14] [INFO ] Computed and/alt/rep : 17/18/17 causal constraints (skipped 0 transitions) in 1 ms.
[2024-05-21 12:06:14] [INFO ] Added : 13 causal constraints over 3 iterations in 8 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 125 ms :[(NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 1347 reset in 90 ms.
Product exploration explored 100000 steps with 1351 reset in 92 ms.
Applying partial POR strategy [true, false, false]
Stuttering acceptance computed with spot in 105 ms :[(NOT p0), (NOT p0), (NOT 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.
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 21 transition count 18
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 3 Pre rules applied. Total rules applied 7 place count 21 transition count 18
Deduced a syphon composed of 10 places in 0 ms
Iterating global reduction 1 with 3 rules applied. Total rules applied 10 place count 21 transition count 18
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 13 place count 18 transition count 15
Deduced a syphon composed of 7 places in 0 ms
Iterating global reduction 1 with 3 rules applied. Total rules applied 16 place count 18 transition count 15
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 9 places in 0 ms
Iterating global reduction 1 with 2 rules applied. Total rules applied 18 place count 18 transition count 15
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 19 place count 17 transition count 14
Deduced a syphon composed of 8 places in 0 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 20 place count 17 transition count 14
Deduced a syphon composed of 8 places in 0 ms
Applied a total of 20 rules in 6 ms. Remains 17 /21 variables (removed 4) and now considering 14/18 (removed 4) transitions.
[2024-05-21 12:06:15] [INFO ] Redundant transitions in 0 ms returned []
Running 13 sub problems to find dead transitions.
// Phase 1: matrix 14 rows 17 cols
[2024-05-21 12:06:15] [INFO ] Computed 4 invariants in 0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/16 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/16 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 2 (OVERLAPS) 1/17 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/17 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/17 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 13 unsolved
Problem TDEAD0 is UNSAT
Problem TDEAD2 is UNSAT
Problem TDEAD3 is UNSAT
Problem TDEAD4 is UNSAT
Problem TDEAD5 is UNSAT
Problem TDEAD7 is UNSAT
Problem TDEAD9 is UNSAT
Problem TDEAD12 is UNSAT
At refinement iteration 5 (OVERLAPS) 14/31 variables, 17/21 constraints. Problems are: Problem set: 8 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/31 variables, 0/21 constraints. Problems are: Problem set: 8 solved, 5 unsolved
At refinement iteration 7 (OVERLAPS) 0/31 variables, 0/21 constraints. Problems are: Problem set: 8 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 31/31 variables, and 21 constraints, problems are : Problem set: 8 solved, 5 unsolved in 81 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 17/17 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/8 variables, 0/0 constraints. Problems are: Problem set: 8 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 9/17 variables, 3/3 constraints. Problems are: Problem set: 8 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/17 variables, 1/4 constraints. Problems are: Problem set: 8 solved, 5 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/17 variables, 0/4 constraints. Problems are: Problem set: 8 solved, 5 unsolved
At refinement iteration 4 (OVERLAPS) 14/31 variables, 17/21 constraints. Problems are: Problem set: 8 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/31 variables, 5/26 constraints. Problems are: Problem set: 8 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/31 variables, 0/26 constraints. Problems are: Problem set: 8 solved, 5 unsolved
At refinement iteration 7 (OVERLAPS) 0/31 variables, 0/26 constraints. Problems are: Problem set: 8 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Int declared 31/31 variables, and 26 constraints, problems are : Problem set: 8 solved, 5 unsolved in 56 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 17/17 constraints, PredecessorRefiner: 5/13 constraints, Known Traps: 0/0 constraints]
After SMT, in 141ms problems are : Problem set: 8 solved, 5 unsolved
Search for dead transitions found 8 dead transitions in 141ms
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 : 17/21 places, 6/18 transitions.
Graph (complete) has 16 edges and 17 vertex of which 9 are kept as prefixes of interest. Removing 8 places using SCC suffix rule.1 ms
Discarding 8 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 3 ms. Remains 9 /17 variables (removed 8) and now considering 6/6 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 9/21 places, 6/18 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 155 ms. Remains : 9/21 places, 6/18 transitions.
Built C files in :
/tmp/ltsmin2039601935026806464
[2024-05-21 12:06:15] [INFO ] Built C files in 1ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2039601935026806464
Running compilation step : cd /tmp/ltsmin2039601935026806464;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 82 ms.
Running link step : cd /tmp/ltsmin2039601935026806464;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 32 ms.
Running LTSmin : cd /tmp/ltsmin2039601935026806464;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased16235260489163236686.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 2 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 2 ms. Remains 21 /21 variables (removed 0) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 21 cols
[2024-05-21 12:06:30] [INFO ] Computed 4 invariants in 2 ms
[2024-05-21 12:06:30] [INFO ] Implicit Places using invariants in 29 ms returned []
[2024-05-21 12:06:30] [INFO ] Invariant cache hit.
[2024-05-21 12:06:30] [INFO ] Implicit Places using invariants and state equation in 26 ms returned []
Implicit Place search using SMT with State Equation took 55 ms to find 0 implicit places.
Running 17 sub problems to find dead transitions.
[2024-05-21 12:06:30] [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 134 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 106 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 247ms problems are : Problem set: 0 solved, 17 unsolved
Search for dead transitions found 0 dead transitions in 247ms
Finished structural reductions in LTL mode , in 1 iterations and 305 ms. Remains : 21/21 places, 18/18 transitions.
Built C files in :
/tmp/ltsmin1133231636557483431
[2024-05-21 12:06:30] [INFO ] Built C files in 1ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1133231636557483431
Running compilation step : cd /tmp/ltsmin1133231636557483431;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 95 ms.
Running link step : cd /tmp/ltsmin1133231636557483431;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 33 ms.
Running LTSmin : cd /tmp/ltsmin1133231636557483431;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased16798993213536057356.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-21 12:06:45] [INFO ] Flatten gal took : 3 ms
[2024-05-21 12:06:45] [INFO ] Flatten gal took : 2 ms
[2024-05-21 12:06:45] [INFO ] Time to serialize gal into /tmp/LTL4656875986187576795.gal : 1 ms
[2024-05-21 12:06:45] [INFO ] Time to serialize properties into /tmp/LTL5152673926788676934.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL4656875986187576795.gal' '-t' 'CGAL' '-hoa' '/tmp/aut10910180158879752817.hoa' '-atoms' '/tmp/LTL5152673926788676934.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...318
Loading property file /tmp/LTL5152673926788676934.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut10910180158879752817.hoa
Detected timeout of ITS tools.
[2024-05-21 12:07:00] [INFO ] Flatten gal took : 4 ms
[2024-05-21 12:07:00] [INFO ] Flatten gal took : 2 ms
[2024-05-21 12:07:00] [INFO ] Time to serialize gal into /tmp/LTL11862128036422461368.gal : 1 ms
[2024-05-21 12:07:00] [INFO ] Time to serialize properties into /tmp/LTL3984136808376083543.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL11862128036422461368.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL3984136808376083543.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((X(X(F("((SA>=1)&&(SwA>=1))")))))
Formula 0 simplified : XXG!"((SA>=1)&&(SwA>=1))"
Detected timeout of ITS tools.
[2024-05-21 12:07:15] [INFO ] Flatten gal took : 1 ms
[2024-05-21 12:07:15] [INFO ] Applying decomposition
[2024-05-21 12:07:15] [INFO ] Flatten gal took : 1 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph1310956539428303518.txt' '-o' '/tmp/graph1310956539428303518.bin' '-w' '/tmp/graph1310956539428303518.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph1310956539428303518.bin' '-l' '-1' '-v' '-w' '/tmp/graph1310956539428303518.weights' '-q' '0' '-e' '0.001'
[2024-05-21 12:07:16] [INFO ] Decomposing Gal with order
[2024-05-21 12:07:16] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 12:07:16] [INFO ] Removed a total of 1 redundant transitions.
[2024-05-21 12:07:16] [INFO ] Flatten gal took : 30 ms
[2024-05-21 12:07:16] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 0 ms.
[2024-05-21 12:07:16] [INFO ] Time to serialize gal into /tmp/LTL149969244073547999.gal : 1 ms
[2024-05-21 12:07:16] [INFO ] Time to serialize properties into /tmp/LTL3479512832599100186.ltl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL149969244073547999.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL3479512832599100186.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...253
Read 1 LTL properties
Checking formula 0 : !((X(X(F("((i0.u0.SA>=1)&&(i4.u6.SwA>=1))")))))
Formula 0 simplified : XXG!"((i0.u0.SA>=1)&&(i4.u6.SwA>=1))"
Detected timeout of ITS tools.
Treatment of property ClientsAndServers-PT-N0005P1-LTLFireability-06 finished in 78457 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 3 out of 25 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 25/25 places, 18/18 transitions.
Discarding 4 places :
Implicit places reduction removed 4 places
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 21 transition count 18
Applied a total of 4 rules in 1 ms. Remains 21 /25 variables (removed 4) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 21 cols
[2024-05-21 12:07:31] [INFO ] Computed 4 invariants in 1 ms
[2024-05-21 12:07:31] [INFO ] Implicit Places using invariants in 39 ms returned [14]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 40 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 20/25 places, 18/18 transitions.
Applied a total of 0 rules in 1 ms. Remains 20 /20 variables (removed 0) and now considering 18/18 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 42 ms. Remains : 20/25 places, 18/18 transitions.
Stuttering acceptance computed with spot in 75 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : ClientsAndServers-PT-N0005P1-LTLFireability-08
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA ClientsAndServers-PT-N0005P1-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ClientsAndServers-PT-N0005P1-LTLFireability-08 finished in 132 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F(p1))))'
Support contains 2 out of 25 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 25/25 places, 18/18 transitions.
Discarding 4 places :
Implicit places reduction removed 4 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 0 with 9 rules applied. Total rules applied 9 place count 21 transition count 13
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 14 place count 16 transition count 13
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 14 place count 16 transition count 11
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 18 place count 14 transition count 11
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 22 place count 12 transition count 9
Applied a total of 22 rules in 8 ms. Remains 12 /25 variables (removed 13) and now considering 9/18 (removed 9) transitions.
// Phase 1: matrix 9 rows 12 cols
[2024-05-21 12:07:31] [INFO ] Computed 4 invariants in 0 ms
[2024-05-21 12:07:31] [INFO ] Implicit Places using invariants in 23 ms returned [7, 11]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 28 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 10/25 places, 9/18 transitions.
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 2 rules applied. Total rules applied 2 place count 10 transition count 7
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 8 transition count 7
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 4 place count 8 transition count 6
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 6 place count 7 transition count 6
Applied a total of 6 rules in 5 ms. Remains 7 /10 variables (removed 3) and now considering 6/9 (removed 3) transitions.
// Phase 1: matrix 6 rows 7 cols
[2024-05-21 12:07:31] [INFO ] Computed 2 invariants in 0 ms
[2024-05-21 12:07:31] [INFO ] Implicit Places using invariants in 15 ms returned []
[2024-05-21 12:07:31] [INFO ] Invariant cache hit.
[2024-05-21 12:07:31] [INFO ] Implicit Places using invariants and state equation in 18 ms returned []
Implicit Place search using SMT with State Equation took 33 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 7/25 places, 6/18 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 75 ms. Remains : 7/25 places, 6/18 transitions.
Stuttering acceptance computed with spot in 102 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : ClientsAndServers-PT-N0005P1-LTLFireability-09
Product exploration explored 100000 steps with 15350 reset in 76 ms.
Stack based approach found an accepted trace after 36 steps with 0 reset with depth 37 and stack size 37 in 0 ms.
FORMULA ClientsAndServers-PT-N0005P1-LTLFireability-09 FALSE TECHNIQUES STACK_TEST
Treatment of property ClientsAndServers-PT-N0005P1-LTLFireability-09 finished in 267 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(p0) U (!p1||X(X(G(!p2))))))'
Support contains 4 out of 25 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 25/25 places, 18/18 transitions.
Discarding 4 places :
Implicit places reduction removed 4 places
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 21 transition count 18
Applied a total of 4 rules in 1 ms. Remains 21 /25 variables (removed 4) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 21 cols
[2024-05-21 12:07:31] [INFO ] Computed 4 invariants in 0 ms
[2024-05-21 12:07:31] [INFO ] Implicit Places using invariants in 24 ms returned [14]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 35 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 20/25 places, 18/18 transitions.
Applied a total of 0 rules in 2 ms. Remains 20 /20 variables (removed 0) and now considering 18/18 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 38 ms. Remains : 20/25 places, 18/18 transitions.
Stuttering acceptance computed with spot in 185 ms :[(AND p1 p2), (OR (AND (NOT p0) p2) (AND p1 p2)), p2, true, (AND p2 (NOT p0)), (AND p1 p2)]
Running random walk in product with property : ClientsAndServers-PT-N0005P1-LTLFireability-10
Entered a terminal (fully accepting) state of product in 3 steps with 0 reset in 0 ms.
FORMULA ClientsAndServers-PT-N0005P1-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ClientsAndServers-PT-N0005P1-LTLFireability-10 finished in 244 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||G(p1)))))'
Support contains 3 out of 25 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 25/25 places, 18/18 transitions.
Discarding 3 places :
Implicit places reduction removed 3 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 22 transition count 15
Reduce places removed 3 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 4 rules applied. Total rules applied 10 place count 19 transition count 14
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 11 place count 18 transition count 14
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 11 place count 18 transition count 11
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 17 place count 15 transition count 11
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 21 place count 13 transition count 9
Applied a total of 21 rules in 7 ms. Remains 13 /25 variables (removed 12) and now considering 9/18 (removed 9) transitions.
// Phase 1: matrix 9 rows 13 cols
[2024-05-21 12:07:31] [INFO ] Computed 5 invariants in 0 ms
[2024-05-21 12:07:31] [INFO ] Implicit Places using invariants in 23 ms returned [7, 12]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 24 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 11/25 places, 9/18 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 11 transition count 8
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 10 transition count 8
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 2 place count 10 transition count 7
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 4 place count 9 transition count 7
Applied a total of 4 rules in 2 ms. Remains 9 /11 variables (removed 2) and now considering 7/9 (removed 2) transitions.
// Phase 1: matrix 7 rows 9 cols
[2024-05-21 12:07:31] [INFO ] Computed 3 invariants in 1 ms
[2024-05-21 12:07:31] [INFO ] Implicit Places using invariants in 23 ms returned []
[2024-05-21 12:07:31] [INFO ] Invariant cache hit.
[2024-05-21 12:07:31] [INFO ] Implicit Places using invariants and state equation in 23 ms returned []
Implicit Place search using SMT with State Equation took 48 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 9/25 places, 7/18 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 81 ms. Remains : 9/25 places, 7/18 transitions.
Stuttering acceptance computed with spot in 63 ms :[(AND (NOT p1) p0), (AND (NOT p1) p0)]
Running random walk in product with property : ClientsAndServers-PT-N0005P1-LTLFireability-11
Product exploration explored 100000 steps with 5621 reset in 92 ms.
Product exploration explored 100000 steps with 5568 reset in 177 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p1) p0), (X (NOT (AND p1 p0))), (X p0), (X (AND (NOT p1) p0)), (X (NOT p1)), (X (X (NOT (AND p1 p0)))), (X (X p0)), (X (X (AND (NOT p1) p0))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 90 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 68 ms :[(AND (NOT p1) p0), (AND (NOT p1) p0)]
RANDOM walk for 453 steps (1 resets) in 7 ms. (56 steps per ms) remains 0/4 properties
Knowledge obtained : [(AND (NOT p1) p0), (X (NOT (AND p1 p0))), (X p0), (X (AND (NOT p1) p0)), (X (NOT p1)), (X (X (NOT (AND p1 p0)))), (X (X p0)), (X (X (AND (NOT p1) p0))), (X (X (NOT p1)))]
False Knowledge obtained : [(F p1), (F (NOT (OR (NOT p1) (NOT p0)))), (F (NOT p0)), (F (NOT (AND (NOT p1) p0)))]
Knowledge based reduction with 9 factoid took 230 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 76 ms :[(AND (NOT p1) p0), (AND (NOT p1) p0)]
Stuttering acceptance computed with spot in 74 ms :[(AND (NOT p1) p0), (AND (NOT p1) p0)]
[2024-05-21 12:07:32] [INFO ] Invariant cache hit.
[2024-05-21 12:07:32] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-21 12:07:32] [INFO ] [Real]Absence check using state equation in 3 ms returned sat
[2024-05-21 12:07:32] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 12:07:32] [INFO ] [Nat]Absence check using 3 positive place invariants in 0 ms returned sat
[2024-05-21 12:07:32] [INFO ] [Nat]Absence check using state equation in 4 ms returned sat
[2024-05-21 12:07:32] [INFO ] Computed and/alt/rep : 6/7/6 causal constraints (skipped 0 transitions) in 1 ms.
[2024-05-21 12:07:32] [INFO ] Added : 4 causal constraints over 1 iterations in 4 ms. Result :sat
Could not prove EG (AND (NOT p1) p0)
Support contains 3 out of 9 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 9/9 places, 7/7 transitions.
Applied a total of 0 rules in 0 ms. Remains 9 /9 variables (removed 0) and now considering 7/7 (removed 0) transitions.
[2024-05-21 12:07:32] [INFO ] Invariant cache hit.
[2024-05-21 12:07:32] [INFO ] Implicit Places using invariants in 20 ms returned []
[2024-05-21 12:07:32] [INFO ] Invariant cache hit.
[2024-05-21 12:07:32] [INFO ] Implicit Places using invariants and state equation in 25 ms returned []
Implicit Place search using SMT with State Equation took 56 ms to find 0 implicit places.
[2024-05-21 12:07:32] [INFO ] Redundant transitions in 0 ms returned []
Running 6 sub problems to find dead transitions.
[2024-05-21 12:07:32] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/9 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/9 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (OVERLAPS) 7/16 variables, 9/12 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/16 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (OVERLAPS) 0/16 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 16/16 variables, and 12 constraints, problems are : Problem set: 0 solved, 6 unsolved in 37 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 9/9 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/9 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/9 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (OVERLAPS) 7/16 variables, 9/12 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/16 variables, 6/18 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/16 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (OVERLAPS) 0/16 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 16/16 variables, and 18 constraints, problems are : Problem set: 0 solved, 6 unsolved in 40 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 9/9 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
After SMT, in 95ms problems are : Problem set: 0 solved, 6 unsolved
Search for dead transitions found 0 dead transitions in 95ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 155 ms. Remains : 9/9 places, 7/7 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p1) p0), (X (NOT (AND p1 p0))), (X p0), (X (AND (NOT p1) p0)), (X (NOT p1)), (X (X (NOT (AND p1 p0)))), (X (X p0)), (X (X (AND (NOT p1) p0))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 90 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 78 ms :[(AND (NOT p1) p0), (AND (NOT p1) p0)]
RANDOM walk for 459 steps (0 resets) in 6 ms. (65 steps per ms) remains 0/4 properties
Knowledge obtained : [(AND (NOT p1) p0), (X (NOT (AND p1 p0))), (X p0), (X (AND (NOT p1) p0)), (X (NOT p1)), (X (X (NOT (AND p1 p0)))), (X (X p0)), (X (X (AND (NOT p1) p0))), (X (X (NOT p1)))]
False Knowledge obtained : [(F p1), (F (NOT (OR (NOT p1) (NOT p0)))), (F (NOT p0)), (F (NOT (AND (NOT p1) p0)))]
Knowledge based reduction with 9 factoid took 220 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 70 ms :[(AND (NOT p1) p0), (AND (NOT p1) p0)]
Stuttering acceptance computed with spot in 59 ms :[(AND (NOT p1) p0), (AND (NOT p1) p0)]
[2024-05-21 12:07:33] [INFO ] Invariant cache hit.
[2024-05-21 12:07:33] [INFO ] [Real]Absence check using 3 positive place invariants in 0 ms returned sat
[2024-05-21 12:07:33] [INFO ] [Real]Absence check using state equation in 3 ms returned sat
[2024-05-21 12:07:33] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 12:07:33] [INFO ] [Nat]Absence check using 3 positive place invariants in 3 ms returned sat
[2024-05-21 12:07:33] [INFO ] [Nat]Absence check using state equation in 4 ms returned sat
[2024-05-21 12:07:33] [INFO ] Computed and/alt/rep : 6/7/6 causal constraints (skipped 0 transitions) in 1 ms.
[2024-05-21 12:07:33] [INFO ] Added : 4 causal constraints over 1 iterations in 5 ms. Result :sat
Could not prove EG (AND (NOT p1) p0)
Stuttering acceptance computed with spot in 95 ms :[(AND (NOT p1) p0), (AND (NOT p1) p0)]
Product exploration explored 100000 steps with 5604 reset in 68 ms.
Product exploration explored 100000 steps with 5660 reset in 82 ms.
Built C files in :
/tmp/ltsmin4547538025204973481
[2024-05-21 12:07:33] [INFO ] Computing symmetric may disable matrix : 7 transitions.
[2024-05-21 12:07:33] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 12:07:33] [INFO ] Computing symmetric may enable matrix : 7 transitions.
[2024-05-21 12:07:33] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 12:07:33] [INFO ] Computing Do-Not-Accords matrix : 7 transitions.
[2024-05-21 12:07:33] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 12:07:33] [INFO ] Built C files in 2ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4547538025204973481
Running compilation step : cd /tmp/ltsmin4547538025204973481;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 84 ms.
Running link step : cd /tmp/ltsmin4547538025204973481;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 36 ms.
Running LTSmin : cd /tmp/ltsmin4547538025204973481;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased11129894476883816784.hoa' '--buchi-type=spotba'
LTSmin run took 388 ms.
FORMULA ClientsAndServers-PT-N0005P1-LTLFireability-11 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property ClientsAndServers-PT-N0005P1-LTLFireability-11 finished in 2577 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((G(p1)||p0))))'
Support contains 5 out of 25 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 25/25 places, 18/18 transitions.
Discarding 2 places :
Implicit places reduction removed 2 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 23 transition count 15
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 8 place count 20 transition count 15
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 8 place count 20 transition count 13
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 12 place count 18 transition count 13
Applied a total of 12 rules in 1 ms. Remains 18 /25 variables (removed 7) and now considering 13/18 (removed 5) transitions.
// Phase 1: matrix 13 rows 18 cols
[2024-05-21 12:07:34] [INFO ] Computed 6 invariants in 0 ms
[2024-05-21 12:07:34] [INFO ] Implicit Places using invariants in 25 ms returned [11]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 30 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 17/25 places, 13/18 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 17 transition count 12
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 16 transition count 12
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 2 place count 16 transition count 11
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 4 place count 15 transition count 11
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 2 with 2 rules applied. Total rules applied 6 place count 14 transition count 10
Applied a total of 6 rules in 2 ms. Remains 14 /17 variables (removed 3) and now considering 10/13 (removed 3) transitions.
// Phase 1: matrix 10 rows 14 cols
[2024-05-21 12:07:34] [INFO ] Computed 5 invariants in 0 ms
[2024-05-21 12:07:34] [INFO ] Implicit Places using invariants in 18 ms returned []
[2024-05-21 12:07:34] [INFO ] Invariant cache hit.
[2024-05-21 12:07:34] [INFO ] Implicit Places using invariants and state equation in 24 ms returned []
Implicit Place search using SMT with State Equation took 43 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 14/25 places, 10/18 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 77 ms. Remains : 14/25 places, 10/18 transitions.
Stuttering acceptance computed with spot in 79 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : ClientsAndServers-PT-N0005P1-LTLFireability-13
Product exploration explored 100000 steps with 1215 reset in 95 ms.
Product exploration explored 100000 steps with 1169 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) p0), (X (NOT (AND p1 (NOT p0)))), (X (NOT (AND (NOT p1) (NOT p0)))), (X p0), (X (NOT p1)), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X p0))]
False Knowledge obtained : [(X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 8 factoid took 145 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 54 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
RANDOM walk for 1750 steps (3 resets) in 8 ms. (194 steps per ms) remains 0/4 properties
Knowledge obtained : [(AND (NOT p1) p0), (X (NOT (AND p1 (NOT p0)))), (X (NOT (AND (NOT p1) (NOT p0)))), (X p0), (X (NOT p1)), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X p0))]
False Knowledge obtained : [(X (X p1)), (X (X (NOT p1))), (F p1), (F (NOT (OR p0 (NOT p1)))), (F (NOT p0)), (F (NOT (OR p0 p1)))]
Knowledge based reduction with 8 factoid took 259 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 68 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 65 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 5 out of 14 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 14/14 places, 10/10 transitions.
Applied a total of 0 rules in 2 ms. Remains 14 /14 variables (removed 0) and now considering 10/10 (removed 0) transitions.
[2024-05-21 12:07:35] [INFO ] Invariant cache hit.
[2024-05-21 12:07:35] [INFO ] Implicit Places using invariants in 24 ms returned []
[2024-05-21 12:07:35] [INFO ] Invariant cache hit.
[2024-05-21 12:07:35] [INFO ] Implicit Places using invariants and state equation in 24 ms returned []
Implicit Place search using SMT with State Equation took 53 ms to find 0 implicit places.
[2024-05-21 12:07:35] [INFO ] Redundant transitions in 0 ms returned []
Running 9 sub problems to find dead transitions.
[2024-05-21 12:07:35] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/13 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/13 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/13 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (OVERLAPS) 1/14 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/14 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 5 (OVERLAPS) 10/24 variables, 14/19 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/24 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 7 (OVERLAPS) 0/24 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 9 unsolved
No progress, stopping.
After SMT solving in domain Real declared 24/24 variables, and 19 constraints, problems are : Problem set: 0 solved, 9 unsolved in 71 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 14/14 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 9 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/13 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/13 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/13 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (OVERLAPS) 1/14 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/14 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 5 (OVERLAPS) 10/24 variables, 14/19 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/24 variables, 9/28 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/24 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 8 (OVERLAPS) 0/24 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 9 unsolved
No progress, stopping.
After SMT solving in domain Int declared 24/24 variables, and 28 constraints, problems are : Problem set: 0 solved, 9 unsolved in 75 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 14/14 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 0/0 constraints]
After SMT, in 149ms problems are : Problem set: 0 solved, 9 unsolved
Search for dead transitions found 0 dead transitions in 149ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 210 ms. Remains : 14/14 places, 10/10 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), (X (NOT p1)), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0))]
False Knowledge obtained : [(X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 8 factoid took 154 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 66 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
RANDOM walk for 3547 steps (5 resets) in 11 ms. (295 steps per ms) remains 0/4 properties
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), (X (NOT p1)), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0))]
False Knowledge obtained : [(X (X p1)), (X (X (NOT p1))), (F p1), (F (NOT (OR p0 (NOT p1)))), (F (NOT p0)), (F (NOT (OR p0 p1)))]
Knowledge based reduction with 8 factoid took 247 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 68 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 64 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 66 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 1142 reset in 104 ms.
Product exploration explored 100000 steps with 1138 reset in 140 ms.
Built C files in :
/tmp/ltsmin12133538536920893679
[2024-05-21 12:07:36] [INFO ] Computing symmetric may disable matrix : 10 transitions.
[2024-05-21 12:07:36] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 12:07:36] [INFO ] Computing symmetric may enable matrix : 10 transitions.
[2024-05-21 12:07:36] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 12:07:36] [INFO ] Computing Do-Not-Accords matrix : 10 transitions.
[2024-05-21 12:07:36] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 12:07:36] [INFO ] Built C files in 2ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12133538536920893679
Running compilation step : cd /tmp/ltsmin12133538536920893679;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 80 ms.
Running link step : cd /tmp/ltsmin12133538536920893679;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 27 ms.
Running LTSmin : cd /tmp/ltsmin12133538536920893679;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased10534908215881756700.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 5 out of 14 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 14/14 places, 10/10 transitions.
Applied a total of 0 rules in 1 ms. Remains 14 /14 variables (removed 0) and now considering 10/10 (removed 0) transitions.
[2024-05-21 12:07:51] [INFO ] Invariant cache hit.
[2024-05-21 12:07:51] [INFO ] Implicit Places using invariants in 31 ms returned []
[2024-05-21 12:07:51] [INFO ] Invariant cache hit.
[2024-05-21 12:07:51] [INFO ] Implicit Places using invariants and state equation in 39 ms returned []
Implicit Place search using SMT with State Equation took 71 ms to find 0 implicit places.
[2024-05-21 12:07:51] [INFO ] Redundant transitions in 0 ms returned []
Running 9 sub problems to find dead transitions.
[2024-05-21 12:07:51] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/13 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/13 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/13 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (OVERLAPS) 1/14 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/14 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 5 (OVERLAPS) 10/24 variables, 14/19 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/24 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 7 (OVERLAPS) 0/24 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 9 unsolved
No progress, stopping.
After SMT solving in domain Real declared 24/24 variables, and 19 constraints, problems are : Problem set: 0 solved, 9 unsolved in 71 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 14/14 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 9 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/13 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/13 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/13 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (OVERLAPS) 1/14 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/14 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 5 (OVERLAPS) 10/24 variables, 14/19 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/24 variables, 9/28 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/24 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 8 (OVERLAPS) 0/24 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 9 unsolved
No progress, stopping.
After SMT solving in domain Int declared 24/24 variables, and 28 constraints, problems are : Problem set: 0 solved, 9 unsolved in 64 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 14/14 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 0/0 constraints]
After SMT, in 138ms problems are : Problem set: 0 solved, 9 unsolved
Search for dead transitions found 0 dead transitions in 139ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 226 ms. Remains : 14/14 places, 10/10 transitions.
Built C files in :
/tmp/ltsmin7338934033280707089
[2024-05-21 12:07:51] [INFO ] Computing symmetric may disable matrix : 10 transitions.
[2024-05-21 12:07:51] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 12:07:51] [INFO ] Computing symmetric may enable matrix : 10 transitions.
[2024-05-21 12:07:51] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 12:07:51] [INFO ] Computing Do-Not-Accords matrix : 10 transitions.
[2024-05-21 12:07:51] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 12:07:51] [INFO ] Built C files in 5ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7338934033280707089
Running compilation step : cd /tmp/ltsmin7338934033280707089;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 91 ms.
Running link step : cd /tmp/ltsmin7338934033280707089;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 35 ms.
Running LTSmin : cd /tmp/ltsmin7338934033280707089;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased10771461775942799826.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-21 12:08:06] [INFO ] Flatten gal took : 1 ms
[2024-05-21 12:08:06] [INFO ] Flatten gal took : 1 ms
[2024-05-21 12:08:06] [INFO ] Time to serialize gal into /tmp/LTL9909590164071152233.gal : 1 ms
[2024-05-21 12:08:06] [INFO ] Time to serialize properties into /tmp/LTL17797417872210687770.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL9909590164071152233.gal' '-t' 'CGAL' '-hoa' '/tmp/aut6717569400135420205.hoa' '-atoms' '/tmp/LTL17797417872210687770.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...318
Loading property file /tmp/LTL17797417872210687770.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut6717569400135420205.hoa
Detected timeout of ITS tools.
[2024-05-21 12:08:21] [INFO ] Flatten gal took : 1 ms
[2024-05-21 12:08:21] [INFO ] Flatten gal took : 1 ms
[2024-05-21 12:08:21] [INFO ] Time to serialize gal into /tmp/LTL13871801832896404234.gal : 1 ms
[2024-05-21 12:08:21] [INFO ] Time to serialize properties into /tmp/LTL9939761931917132683.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL13871801832896404234.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL9939761931917132683.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((G(F(("((SA<1)||(SwA<1))")||((G("(SpG>=1)"))||("((CA>=1)&&(CwA>=1))"))))))
Formula 0 simplified : G(F!"(SpG>=1)" & FG(!"((CA>=1)&&(CwA>=1))" & !"((SA<1)||(SwA<1))"))
Detected timeout of ITS tools.
[2024-05-21 12:08:37] [INFO ] Flatten gal took : 2 ms
[2024-05-21 12:08:37] [INFO ] Applying decomposition
[2024-05-21 12:08:37] [INFO ] Flatten gal took : 3 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph1288687855935617348.txt' '-o' '/tmp/graph1288687855935617348.bin' '-w' '/tmp/graph1288687855935617348.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph1288687855935617348.bin' '-l' '-1' '-v' '-w' '/tmp/graph1288687855935617348.weights' '-q' '0' '-e' '0.001'
[2024-05-21 12:08:37] [INFO ] Decomposing Gal with order
[2024-05-21 12:08:37] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 12:08:37] [INFO ] Removed a total of 1 redundant transitions.
[2024-05-21 12:08:37] [INFO ] Flatten gal took : 1 ms
[2024-05-21 12:08:37] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 0 ms.
[2024-05-21 12:08:37] [INFO ] Time to serialize gal into /tmp/LTL8575185612315553621.gal : 0 ms
[2024-05-21 12:08:37] [INFO ] Time to serialize properties into /tmp/LTL6241909125806399238.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL8575185612315553621.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL6241909125806399238.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...254
Read 1 LTL properties
Checking formula 0 : !((G(F(("((u0.SA<1)||(u4.SwA<1))")||((G("(i2.u3.SpG>=1)"))||("((u4.CA>=1)&&(u1.CwA>=1))"))))))
Formula 0 simplified : G(F!"(i2.u3.SpG>=1)" & FG(!"((u0.SA<1)||(u4.SwA<1))" & !"((u4.CA>=1)&&(u1.CwA>=1))"))
Detected timeout of ITS tools.
Treatment of property ClientsAndServers-PT-N0005P1-LTLFireability-13 finished in 77728 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(!p0)||G((p1||X(p1))))))'
Support contains 3 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 1 ms. Remains 22 /25 variables (removed 3) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 22 cols
[2024-05-21 12:08:52] [INFO ] Computed 5 invariants in 1 ms
[2024-05-21 12:08:52] [INFO ] Implicit Places using invariants in 29 ms returned [14]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 30 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 1 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 32 ms. Remains : 21/25 places, 18/18 transitions.
Stuttering acceptance computed with spot in 127 ms :[(AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1)), p0]
Running random walk in product with property : ClientsAndServers-PT-N0005P1-LTLFireability-14
Product exploration explored 100000 steps with 1229 reset in 86 ms.
Product exploration explored 100000 steps with 1218 reset in 91 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 (NOT p1)), (X (AND p0 (NOT p1))), (X (NOT (AND p0 p1))), (X p0), (X (NOT p1)), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 p1)))), (X (X p0)), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 86 ms. Reduced automaton from 4 states, 6 edges and 2 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 133 ms :[p0, p0, p0, p0]
RANDOM walk for 1885 steps (2 resets) in 5 ms. (314 steps per ms) remains 0/1 properties
Knowledge obtained : [(AND p0 (NOT p1)), (X (AND p0 (NOT p1))), (X (NOT (AND p0 p1))), (X p0), (X (NOT p1)), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 p1)))), (X (X p0)), (X (X (NOT p1)))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 9 factoid took 96 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 116 ms :[p0, p0, p0, p0]
Stuttering acceptance computed with spot in 131 ms :[p0, p0, p0, p0]
// Phase 1: matrix 18 rows 21 cols
[2024-05-21 12:08:52] [INFO ] Computed 4 invariants in 1 ms
[2024-05-21 12:08:53] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2024-05-21 12:08:53] [INFO ] [Real]Absence check using state equation in 14 ms returned sat
[2024-05-21 12:08:53] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 12:08:53] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2024-05-21 12:08:53] [INFO ] [Nat]Absence check using state equation in 5 ms returned sat
[2024-05-21 12:08:53] [INFO ] Computed and/alt/rep : 17/18/17 causal constraints (skipped 0 transitions) in 1 ms.
[2024-05-21 12:08:53] [INFO ] Added : 14 causal constraints over 3 iterations in 8 ms. Result :sat
Could not prove EG p0
Support contains 1 out of 21 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 21/21 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.
[2024-05-21 12:08:53] [INFO ] Invariant cache hit.
[2024-05-21 12:08:53] [INFO ] Implicit Places using invariants in 16 ms returned []
[2024-05-21 12:08:53] [INFO ] Invariant cache hit.
[2024-05-21 12:08:53] [INFO ] Implicit Places using invariants and state equation in 21 ms returned []
Implicit Place search using SMT with State Equation took 38 ms to find 0 implicit places.
Running 17 sub problems to find dead transitions.
[2024-05-21 12:08:53] [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, 0/2 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 2 (OVERLAPS) 1/21 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/21 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 4 (OVERLAPS) 18/39 variables, 21/25 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/39 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 6 (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 127 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 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, 0/2 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 2 (OVERLAPS) 1/21 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/21 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 4 (OVERLAPS) 18/39 variables, 21/25 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/39 variables, 17/42 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/39 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 7 (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 115 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 21/21 constraints, PredecessorRefiner: 17/17 constraints, Known Traps: 0/0 constraints]
After SMT, in 245ms problems are : Problem set: 0 solved, 17 unsolved
Search for dead transitions found 0 dead transitions in 246ms
Finished structural reductions in LTL mode , in 1 iterations and 284 ms. Remains : 21/21 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 : [p0]
False Knowledge obtained : []
Knowledge based reduction with 1 factoid took 130 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 119 ms :[p0, p0, p0, p0]
RANDOM walk for 1890 steps (2 resets) in 7 ms. (236 steps per ms) remains 0/1 properties
Knowledge obtained : [p0]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 1 factoid took 98 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 130 ms :[p0, p0, p0, p0]
Stuttering acceptance computed with spot in 135 ms :[p0, p0, p0, p0]
[2024-05-21 12:08:53] [INFO ] Invariant cache hit.
[2024-05-21 12:08:54] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2024-05-21 12:08:54] [INFO ] [Real]Absence check using state equation in 5 ms returned sat
[2024-05-21 12:08:54] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 12:08:54] [INFO ] [Nat]Absence check using 4 positive place invariants in 0 ms returned sat
[2024-05-21 12:08:54] [INFO ] [Nat]Absence check using state equation in 4 ms returned sat
[2024-05-21 12:08:54] [INFO ] Computed and/alt/rep : 17/18/17 causal constraints (skipped 0 transitions) in 1 ms.
[2024-05-21 12:08:54] [INFO ] Added : 14 causal constraints over 3 iterations in 9 ms. Result :sat
Could not prove EG p0
Stuttering acceptance computed with spot in 126 ms :[p0, p0, p0, p0]
Product exploration explored 100000 steps with 1235 reset in 167 ms.
Product exploration explored 100000 steps with 1229 reset in 139 ms.
Applying partial POR strategy [true, false, false, false]
Stuttering acceptance computed with spot in 122 ms :[p0, p0, p0, 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.
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 21 transition count 18
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 3 Pre rules applied. Total rules applied 7 place count 21 transition count 18
Deduced a syphon composed of 10 places in 0 ms
Iterating global reduction 1 with 3 rules applied. Total rules applied 10 place count 21 transition count 18
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 14 place count 17 transition count 14
Deduced a syphon composed of 6 places in 0 ms
Iterating global reduction 1 with 4 rules applied. Total rules applied 18 place count 17 transition count 14
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 8 places in 0 ms
Iterating global reduction 1 with 2 rules applied. Total rules applied 20 place count 17 transition count 14
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 22 place count 15 transition count 12
Deduced a syphon composed of 6 places in 0 ms
Iterating global reduction 1 with 2 rules applied. Total rules applied 24 place count 15 transition count 12
Deduced a syphon composed of 6 places in 0 ms
Applied a total of 24 rules in 7 ms. Remains 15 /21 variables (removed 6) and now considering 12/18 (removed 6) transitions.
[2024-05-21 12:08:54] [INFO ] Redundant transitions in 0 ms returned []
Running 11 sub problems to find dead transitions.
// Phase 1: matrix 12 rows 15 cols
[2024-05-21 12:08:54] [INFO ] Computed 4 invariants in 0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/14 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/14 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 2 (OVERLAPS) 1/15 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/15 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 11 unsolved
Problem TDEAD0 is UNSAT
Problem TDEAD1 is UNSAT
Problem TDEAD4 is UNSAT
Problem TDEAD5 is UNSAT
Problem TDEAD8 is UNSAT
Problem TDEAD10 is UNSAT
At refinement iteration 4 (OVERLAPS) 12/27 variables, 15/19 constraints. Problems are: Problem set: 6 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/27 variables, 0/19 constraints. Problems are: Problem set: 6 solved, 5 unsolved
At refinement iteration 6 (OVERLAPS) 0/27 variables, 0/19 constraints. Problems are: Problem set: 6 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 27/27 variables, and 19 constraints, problems are : Problem set: 6 solved, 5 unsolved in 75 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 15/15 constraints, PredecessorRefiner: 11/11 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 6 solved, 5 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 6 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 7/15 variables, 4/4 constraints. Problems are: Problem set: 6 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/15 variables, 0/4 constraints. Problems are: Problem set: 6 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 12/27 variables, 15/19 constraints. Problems are: Problem set: 6 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/27 variables, 5/24 constraints. Problems are: Problem set: 6 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/27 variables, 0/24 constraints. Problems are: Problem set: 6 solved, 5 unsolved
At refinement iteration 6 (OVERLAPS) 0/27 variables, 0/24 constraints. Problems are: Problem set: 6 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Int declared 27/27 variables, and 24 constraints, problems are : Problem set: 6 solved, 5 unsolved in 41 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 15/15 constraints, PredecessorRefiner: 5/11 constraints, Known Traps: 0/0 constraints]
After SMT, in 134ms problems are : Problem set: 6 solved, 5 unsolved
Search for dead transitions found 6 dead transitions in 135ms
Found 6 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 6 transitions
Dead transitions reduction (with SMT) removed 6 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 15/21 places, 6/18 transitions.
Graph (complete) has 17 edges and 15 vertex of which 9 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.0 ms
Discarding 6 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 1 ms. Remains 9 /15 variables (removed 6) and now considering 6/6 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 9/21 places, 6/18 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 148 ms. Remains : 9/21 places, 6/18 transitions.
Built C files in :
/tmp/ltsmin5201075603812675635
[2024-05-21 12:08:54] [INFO ] Built C files in 1ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5201075603812675635
Running compilation step : cd /tmp/ltsmin5201075603812675635;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 89 ms.
Running link step : cd /tmp/ltsmin5201075603812675635;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 28 ms.
Running LTSmin : cd /tmp/ltsmin5201075603812675635;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased1211194120991325067.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 1 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 3 ms. Remains 21 /21 variables (removed 0) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 21 cols
[2024-05-21 12:09:09] [INFO ] Computed 4 invariants in 1 ms
[2024-05-21 12:09:10] [INFO ] Implicit Places using invariants in 32 ms returned [18]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 34 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 20/21 places, 18/18 transitions.
Applied a total of 0 rules in 1 ms. Remains 20 /20 variables (removed 0) and now considering 18/18 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 38 ms. Remains : 20/21 places, 18/18 transitions.
Built C files in :
/tmp/ltsmin3840122891341021750
[2024-05-21 12:09:10] [INFO ] Built C files in 1ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3840122891341021750
Running compilation step : cd /tmp/ltsmin3840122891341021750;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 100 ms.
Running link step : cd /tmp/ltsmin3840122891341021750;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 35 ms.
Running LTSmin : cd /tmp/ltsmin3840122891341021750;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased16839434267193302053.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-21 12:09:25] [INFO ] Flatten gal took : 1 ms
[2024-05-21 12:09:25] [INFO ] Flatten gal took : 1 ms
[2024-05-21 12:09:25] [INFO ] Time to serialize gal into /tmp/LTL2915801216760518182.gal : 0 ms
[2024-05-21 12:09:25] [INFO ] Time to serialize properties into /tmp/LTL15763289438169620977.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL2915801216760518182.gal' '-t' 'CGAL' '-hoa' '/tmp/aut10847719960933485923.hoa' '-atoms' '/tmp/LTL15763289438169620977.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...319
Loading property file /tmp/LTL15763289438169620977.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut10847719960933485923.hoa
Detected timeout of ITS tools.
[2024-05-21 12:09:40] [INFO ] Flatten gal took : 1 ms
[2024-05-21 12:09:40] [INFO ] Flatten gal took : 1 ms
[2024-05-21 12:09:40] [INFO ] Time to serialize gal into /tmp/LTL14867539910823946456.gal : 1 ms
[2024-05-21 12:09:40] [INFO ] Time to serialize properties into /tmp/LTL15986649836431980131.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL14867539910823946456.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL15986649836431980131.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 1 LTL properties
Checking formula 0 : !((X((F("(SpA>=1)"))||(G(("((CA>=1)&&(CwA>=1))")||(X("((CA>=1)&&(CwA>=1))")))))))
Formula 0 simplified : X(G!"(SpA>=1)" & F(!"((CA>=1)&&(CwA>=1))" & X!"((CA>=1)&&(CwA>=1))"))
Detected timeout of ITS tools.
[2024-05-21 12:09:55] [INFO ] Flatten gal took : 2 ms
[2024-05-21 12:09:55] [INFO ] Applying decomposition
[2024-05-21 12:09:55] [INFO ] Flatten gal took : 1 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph1840004879947341643.txt' '-o' '/tmp/graph1840004879947341643.bin' '-w' '/tmp/graph1840004879947341643.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph1840004879947341643.bin' '-l' '-1' '-v' '-w' '/tmp/graph1840004879947341643.weights' '-q' '0' '-e' '0.001'
[2024-05-21 12:09:55] [INFO ] Decomposing Gal with order
[2024-05-21 12:09:55] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 12:09:55] [INFO ] Removed a total of 1 redundant transitions.
[2024-05-21 12:09:55] [INFO ] Flatten gal took : 2 ms
[2024-05-21 12:09:55] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 0 ms.
[2024-05-21 12:09:55] [INFO ] Time to serialize gal into /tmp/LTL14154131905045240827.gal : 0 ms
[2024-05-21 12:09:55] [INFO ] Time to serialize properties into /tmp/LTL9538978251115962224.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL14154131905045240827.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL9538978251115962224.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...255
Read 1 LTL properties
Checking formula 0 : !((X((F("(u1.SpA>=1)"))||(G(("((u5.CA>=1)&&(u4.CwA>=1))")||(X("((u5.CA>=1)&&(u4.CwA>=1))")))))))
Formula 0 simplified : X(G!"(u1.SpA>=1)" & F(!"((u5.CA>=1)&&(u4.CwA>=1))" & X!"((u5.CA>=1)&&(u4.CwA>=1))"))
Detected timeout of ITS tools.
Treatment of property ClientsAndServers-PT-N0005P1-LTLFireability-14 finished in 78226 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((X(X((p1||F(p2))))&&p0)))))'
Support contains 5 out of 25 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 25/25 places, 18/18 transitions.
Discarding 4 places :
Implicit places reduction removed 4 places
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 21 transition count 18
Applied a total of 4 rules in 1 ms. Remains 21 /25 variables (removed 4) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 21 cols
[2024-05-21 12:10:10] [INFO ] Computed 4 invariants in 1 ms
[2024-05-21 12:10:10] [INFO ] Implicit Places using invariants in 21 ms returned []
[2024-05-21 12:10:10] [INFO ] Invariant cache hit.
[2024-05-21 12:10:10] [INFO ] Implicit Places using invariants and state equation in 22 ms returned []
Implicit Place search using SMT with State Equation took 45 ms to find 0 implicit places.
Running 17 sub problems to find dead transitions.
[2024-05-21 12:10:10] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/20 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/20 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 2 (OVERLAPS) 1/21 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/21 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 4 (OVERLAPS) 18/39 variables, 21/25 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/39 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 6 (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 147 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 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, 3/3 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/20 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 2 (OVERLAPS) 1/21 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/21 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 4 (OVERLAPS) 18/39 variables, 21/25 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/39 variables, 17/42 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/39 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 7 (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 126 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 21/21 constraints, PredecessorRefiner: 17/17 constraints, Known Traps: 0/0 constraints]
After SMT, in 281ms problems are : Problem set: 0 solved, 17 unsolved
Search for dead transitions found 0 dead transitions in 283ms
Starting structural reductions in LTL mode, iteration 1 : 21/25 places, 18/18 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 329 ms. Remains : 21/25 places, 18/18 transitions.
Stuttering acceptance computed with spot in 250 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), true, (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1)), (NOT p2)]
Running random walk in product with property : ClientsAndServers-PT-N0005P1-LTLFireability-15
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA ClientsAndServers-PT-N0005P1-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ClientsAndServers-PT-N0005P1-LTLFireability-15 finished in 597 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F(p0))))'
Found a Shortening insensitive property : ClientsAndServers-PT-N0005P1-LTLFireability-06
Stuttering acceptance computed with spot in 112 ms :[(NOT p0), (NOT p0), (NOT p0)]
Support contains 2 out of 25 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 25/25 places, 18/18 transitions.
Discarding 3 places :
Implicit places reduction removed 3 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 0 with 8 rules applied. Total rules applied 8 place count 22 transition count 13
Reduce places removed 5 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 6 rules applied. Total rules applied 14 place count 17 transition count 12
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 15 place count 16 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 15 place count 16 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 19 place count 14 transition count 10
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 23 place count 12 transition count 8
Applied a total of 23 rules in 7 ms. Remains 12 /25 variables (removed 13) and now considering 8/18 (removed 10) transitions.
// Phase 1: matrix 8 rows 12 cols
[2024-05-21 12:10:11] [INFO ] Computed 5 invariants in 0 ms
[2024-05-21 12:10:11] [INFO ] Implicit Places using invariants in 21 ms returned [8, 11]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 22 ms to find 2 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 10/25 places, 8/18 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 10 transition count 7
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 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 2 with 2 rules applied. Total rules applied 4 place count 8 transition count 6
Applied a total of 4 rules in 3 ms. Remains 8 /10 variables (removed 2) and now considering 6/8 (removed 2) transitions.
// Phase 1: matrix 6 rows 8 cols
[2024-05-21 12:10:11] [INFO ] Computed 3 invariants in 0 ms
[2024-05-21 12:10:11] [INFO ] Implicit Places using invariants in 20 ms returned []
[2024-05-21 12:10:11] [INFO ] Invariant cache hit.
[2024-05-21 12:10:11] [INFO ] Implicit Places using invariants and state equation in 35 ms returned []
Implicit Place search using SMT with State Equation took 56 ms to find 0 implicit places.
Starting structural reductions in LI_LTL mode, iteration 2 : 8/25 places, 6/18 transitions.
Finished structural reductions in LI_LTL mode , in 2 iterations and 88 ms. Remains : 8/25 places, 6/18 transitions.
Running random walk in product with property : ClientsAndServers-PT-N0005P1-LTLFireability-06
Product exploration explored 100000 steps with 7516 reset in 49 ms.
Product exploration explored 100000 steps with 7486 reset in 54 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 (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 86 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 111 ms :[(NOT p0), (NOT p0), (NOT p0)]
RANDOM walk for 375 steps (2 resets) in 4 ms. (75 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 2 factoid took 91 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 102 ms :[(NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 107 ms :[(NOT p0), (NOT p0), (NOT p0)]
[2024-05-21 12:10:11] [INFO ] Invariant cache hit.
[2024-05-21 12:10:11] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-21 12:10:11] [INFO ] [Real]Absence check using state equation in 3 ms returned sat
[2024-05-21 12:10:11] [INFO ] Computed and/alt/rep : 5/6/5 causal constraints (skipped 0 transitions) in 1 ms.
[2024-05-21 12:10:11] [INFO ] Added : 3 causal constraints over 1 iterations in 6 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 2 out of 8 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 8/8 places, 6/6 transitions.
Applied a total of 0 rules in 1 ms. Remains 8 /8 variables (removed 0) and now considering 6/6 (removed 0) transitions.
[2024-05-21 12:10:11] [INFO ] Invariant cache hit.
[2024-05-21 12:10:11] [INFO ] Implicit Places using invariants in 21 ms returned []
[2024-05-21 12:10:11] [INFO ] Invariant cache hit.
[2024-05-21 12:10:11] [INFO ] Implicit Places using invariants and state equation in 21 ms returned []
Implicit Place search using SMT with State Equation took 44 ms to find 0 implicit places.
Running 5 sub problems to find dead transitions.
[2024-05-21 12:10:11] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/8 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (OVERLAPS) 6/14 variables, 8/11 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/14 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (OVERLAPS) 0/14 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 14/14 variables, and 11 constraints, problems are : Problem set: 0 solved, 5 unsolved in 45 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 8/8 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/8 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/8 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (OVERLAPS) 6/14 variables, 8/11 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/14 variables, 5/16 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/14 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 0/14 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Int declared 14/14 variables, and 16 constraints, problems are : Problem set: 0 solved, 5 unsolved in 41 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 8/8 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints]
After SMT, in 88ms problems are : Problem set: 0 solved, 5 unsolved
Search for dead transitions found 0 dead transitions in 88ms
Finished structural reductions in LTL mode , in 1 iterations and 134 ms. Remains : 8/8 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 : [(NOT p0), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 61 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 93 ms :[(NOT p0), (NOT p0), (NOT p0)]
RANDOM walk for 276 steps (1 resets) in 7 ms. (34 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 2 factoid took 149 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 100 ms :[(NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 99 ms :[(NOT p0), (NOT p0), (NOT p0)]
[2024-05-21 12:10:12] [INFO ] Invariant cache hit.
[2024-05-21 12:10:12] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-21 12:10:12] [INFO ] [Real]Absence check using state equation in 2 ms returned sat
[2024-05-21 12:10:12] [INFO ] Computed and/alt/rep : 5/6/5 causal constraints (skipped 0 transitions) in 0 ms.
[2024-05-21 12:10:12] [INFO ] Added : 3 causal constraints over 1 iterations in 3 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 105 ms :[(NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 7442 reset in 53 ms.
Product exploration explored 100000 steps with 7522 reset in 52 ms.
Applying partial POR strategy [true, false, false]
Stuttering acceptance computed with spot in 116 ms :[(NOT p0), (NOT p0), (NOT p0)]
Support contains 2 out of 8 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 8/8 places, 6/6 transitions.
Applied a total of 0 rules in 1 ms. Remains 8 /8 variables (removed 0) and now considering 6/6 (removed 0) transitions.
[2024-05-21 12:10:12] [INFO ] Redundant transitions in 0 ms returned []
Running 5 sub problems to find dead transitions.
[2024-05-21 12:10:12] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/8 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (OVERLAPS) 6/14 variables, 8/11 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/14 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (OVERLAPS) 0/14 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 14/14 variables, and 11 constraints, problems are : Problem set: 0 solved, 5 unsolved in 35 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 8/8 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/8 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/8 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (OVERLAPS) 6/14 variables, 8/11 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/14 variables, 5/16 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/14 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 0/14 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Int declared 14/14 variables, and 16 constraints, problems are : Problem set: 0 solved, 5 unsolved in 34 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 8/8 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints]
After SMT, in 72ms problems are : Problem set: 0 solved, 5 unsolved
Search for dead transitions found 0 dead transitions in 72ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 77 ms. Remains : 8/8 places, 6/6 transitions.
Built C files in :
/tmp/ltsmin1949794645717040700
[2024-05-21 12:10:13] [INFO ] Built C files in 0ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1949794645717040700
Running compilation step : cd /tmp/ltsmin1949794645717040700;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 69 ms.
Running link step : cd /tmp/ltsmin1949794645717040700;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 29 ms.
Running LTSmin : cd /tmp/ltsmin1949794645717040700;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased13173610385248879093.hoa' '--buchi-type=spotba'
LTSmin run took 4285 ms.
Treatment of property ClientsAndServers-PT-N0005P1-LTLFireability-06 finished in 6541 ms.
Length sensitive decision was in the wrong direction : Shortening insensitive + false
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((G(p1)||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((F(!p0)||G((p1||X(p1))))))'
[2024-05-21 12:10:17] [INFO ] Flatten gal took : 2 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin5430677046890298541
[2024-05-21 12:10:17] [INFO ] Computing symmetric may disable matrix : 18 transitions.
[2024-05-21 12:10:17] [INFO ] Computation of Complete disable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 12:10:17] [INFO ] Computing symmetric may enable matrix : 18 transitions.
[2024-05-21 12:10:17] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 12:10:17] [INFO ] Computing Do-Not-Accords matrix : 18 transitions.
[2024-05-21 12:10:17] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 12:10:17] [INFO ] Built C files in 4ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5430677046890298541
Running compilation step : cd /tmp/ltsmin5430677046890298541;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '240' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
[2024-05-21 12:10:17] [INFO ] Applying decomposition
[2024-05-21 12:10:17] [INFO ] Flatten gal took : 4 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph10394933649554037318.txt' '-o' '/tmp/graph10394933649554037318.bin' '-w' '/tmp/graph10394933649554037318.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph10394933649554037318.bin' '-l' '-1' '-v' '-w' '/tmp/graph10394933649554037318.weights' '-q' '0' '-e' '0.001'
[2024-05-21 12:10:17] [INFO ] Decomposing Gal with order
[2024-05-21 12:10:17] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 12:10:17] [INFO ] Removed a total of 1 redundant transitions.
[2024-05-21 12:10:17] [INFO ] Flatten gal took : 3 ms
[2024-05-21 12:10:17] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 0 ms.
[2024-05-21 12:10:17] [INFO ] Time to serialize gal into /tmp/LTLFireability11872599202662095307.gal : 1 ms
[2024-05-21 12:10:17] [INFO ] Time to serialize properties into /tmp/LTLFireability11688394758301407653.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability11872599202662095307.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability11688394758301407653.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...278
Read 3 LTL properties
Checking formula 0 : !((X(X(F("((u6.SA>=1)&&(u2.SwA>=1))")))))
Formula 0 simplified : XXG!"((u6.SA>=1)&&(u2.SwA>=1))"
Compilation finished in 106 ms.
Running link step : cd /tmp/ltsmin5430677046890298541;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 29 ms.
Running LTSmin : cd /tmp/ltsmin5430677046890298541;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X(X(<>((LTLAPp0==true))))' '--buchi-type=spotba'
WARNING : LTSmin timed out (>400 s) on command cd /tmp/ltsmin5430677046890298541;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X(X(<>((LTLAPp0==true))))' '--buchi-type=spotba'
Running LTSmin : cd /tmp/ltsmin5430677046890298541;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '[](<>(([]((LTLAPp2==true))||(LTLAPp1==true))))' '--buchi-type=spotba'
pins2lts-mc-linux64, 0.000: Registering PINS so language module
pins2lts-mc-linux64( 0/ 8), 0.001: Loading model from ./gal.so
pins2lts-mc-linux64( 1/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 3/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 2/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 3/ 8), 0.001: loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.001: loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.002: completed loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.002: completed loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.003: LTL layer: formula: [](<>(([]((LTLAPp2==true))||(LTLAPp1==true))))
pins2lts-mc-linux64( 1/ 8), 0.001: loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.003: completed loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.003: library has no initializer
pins2lts-mc-linux64( 5/ 8), 0.004: loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.004: library has no initializer
pins2lts-mc-linux64( 4/ 8), 0.004: loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.004: library has no initializer
pins2lts-mc-linux64( 0/ 8), 0.004: loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.004: library has no initializer
pins2lts-mc-linux64( 7/ 8), 0.004: loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.004: "[](<>(([]((LTLAPp2==true))||(LTLAPp1==true))))" is not a file, parsing as formula...
pins2lts-mc-linux64( 0/ 8), 0.005: completed loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.004: Using Spin LTL semantics
pins2lts-mc-linux64( 0/ 8), 0.005: Initializing POR dependencies: labels 23, guards 18
pins2lts-mc-linux64( 6/ 8), 0.004: library has no initializer
pins2lts-mc-linux64( 6/ 8), 0.004: loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.005: completed loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.006: completed loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.007: completed loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.010: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.017: Forcing use of the an ignoring proviso (cndfs)
pins2lts-mc-linux64( 0/ 8), 0.020: There are 24 state labels and 1 edge labels
pins2lts-mc-linux64( 0/ 8), 0.020: State length is 26, there are 24 groups
pins2lts-mc-linux64( 0/ 8), 0.020: Running cndfs using 8 cores
pins2lts-mc-linux64( 0/ 8), 0.020: Using a tree table with 2^27 elements
pins2lts-mc-linux64( 0/ 8), 0.020: Successor permutation: dynamic
pins2lts-mc-linux64( 0/ 8), 0.020: Visible groups: 0 / 24, labels: 2 / 24
pins2lts-mc-linux64( 0/ 8), 0.020: POR cycle proviso: cndfs (ltl)
pins2lts-mc-linux64( 0/ 8), 0.020: Global bits: 2, count bits: 2, local bits: 0
pins2lts-mc-linux64( 0/ 8), 0.037: [Blue] ~120 levels ~960 states ~1264 transitions
pins2lts-mc-linux64( 0/ 8), 0.050: [Blue] ~240 levels ~1920 states ~2768 transitions
pins2lts-mc-linux64( 3/ 8), 0.065: [Blue] ~395 levels ~3840 states ~5840 transitions
pins2lts-mc-linux64( 7/ 8), 0.097: [Blue] ~452 levels ~7680 states ~13096 transitions
pins2lts-mc-linux64( 7/ 8), 0.143: [Blue] ~452 levels ~15360 states ~28056 transitions
pins2lts-mc-linux64( 7/ 8), 0.224: [Blue] ~452 levels ~30720 states ~58784 transitions
pins2lts-mc-linux64( 2/ 8), 0.417: [Blue] ~446 levels ~61440 states ~88096 transitions
pins2lts-mc-linux64( 2/ 8), 0.755: [Blue] ~446 levels ~122880 states ~191960 transitions
pins2lts-mc-linux64( 2/ 8), 1.281: [Blue] ~446 levels ~245760 states ~390352 transitions
pins2lts-mc-linux64( 1/ 8), 1.973: [Blue] ~1340 levels ~491520 states ~932576 transitions
pins2lts-mc-linux64( 1/ 8), 2.873: [Blue] ~1340 levels ~983040 states ~1955624 transitions
pins2lts-mc-linux64( 2/ 8), 4.143: [Blue] ~446 levels ~1966080 states ~3485472 transitions
pins2lts-mc-linux64( 2/ 8), 6.706: [Blue] ~446 levels ~3932160 states ~7032536 transitions
pins2lts-mc-linux64( 4/ 8), 11.930: [Blue] ~863 levels ~7864320 states ~16041752 transitions
pins2lts-mc-linux64( 4/ 8), 22.370: [Blue] ~886 levels ~15728640 states ~31962208 transitions
pins2lts-mc-linux64( 4/ 8), 42.719: [Blue] ~899 levels ~31457280 states ~62799832 transitions
pins2lts-mc-linux64( 4/ 8), 100.080: [Blue] ~1487073 levels ~62914560 states ~121050224 transitions
pins2lts-mc-linux64( 0/ 8), 184.049: Error: tree leafs table full! Change -s/--ratio.
pins2lts-mc-linux64( 0/ 8), 184.108:
pins2lts-mc-linux64( 0/ 8), 184.108: Explored 74710416 states 114478661 transitions, fanout: 1.532
pins2lts-mc-linux64( 0/ 8), 184.108: Total exploration time 184.070 sec (183.990 sec minimum, 184.021 sec on average)
pins2lts-mc-linux64( 0/ 8), 184.108: States per second: 405880, Transitions per second: 621930
pins2lts-mc-linux64( 0/ 8), 184.108:
pins2lts-mc-linux64( 0/ 8), 184.108: State space has 99072314 states, 11963358 are accepting
pins2lts-mc-linux64( 0/ 8), 184.108: cndfs_1 (permutation: dynamic) stats:
pins2lts-mc-linux64( 0/ 8), 184.108: blue states: 74710416 (75.41%), transitions: 0 (per worker)
pins2lts-mc-linux64( 0/ 8), 184.108: red states: 0 (0.00%), bogus: 0 (0.00%), transitions: 0, waits: 0 (0.00 sec)
pins2lts-mc-linux64( 0/ 8), 184.108: all-red states: 22505366 (22.72%), bogus 48693 (0.05%)
pins2lts-mc-linux64( 0/ 8), 184.108:
pins2lts-mc-linux64( 0/ 8), 184.108: Total memory used for local state coloring: 732.4MB
pins2lts-mc-linux64( 0/ 8), 184.108:
pins2lts-mc-linux64( 0/ 8), 184.108: Queue width: 8B, total height: 48001451, memory: 366.22MB
pins2lts-mc-linux64( 0/ 8), 184.108: Tree memory: 1011.9MB, 10.7 B/state, compr.: 10.1%
pins2lts-mc-linux64( 0/ 8), 184.108: Tree fill ratio (roots/leafs): 73.0%/99.0%
pins2lts-mc-linux64( 0/ 8), 184.108: Stored 18 string chucks using 0MB
pins2lts-mc-linux64( 0/ 8), 184.108: Total memory used for chunk indexing: 0MB
pins2lts-mc-linux64( 0/ 8), 184.108: Est. total memory use: 1378.1MB (~1390.2MB paged-in)
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin5430677046890298541;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '[](<>(([]((LTLAPp2==true))||(LTLAPp1==true))))' '--buchi-type=spotba'
255
java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin5430677046890298541;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '[](<>(([]((LTLAPp2==true))||(LTLAPp1==true))))' '--buchi-type=spotba'
255
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner.checkProperty(LTSminRunner.java:241)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.checkProperties(LTSminRunner.java:176)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:114)
at java.base/java.lang.Thread.run(Thread.java:840)
Detected timeout of ITS tools.
[2024-05-21 12:31:42] [INFO ] Flatten gal took : 2 ms
[2024-05-21 12:31:42] [INFO ] Time to serialize gal into /tmp/LTLFireability13756487464084391158.gal : 1 ms
[2024-05-21 12:31:42] [INFO ] Time to serialize properties into /tmp/LTLFireability7211197319814780774.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability13756487464084391158.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability7211197319814780774.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...298
Read 3 LTL properties
Checking formula 0 : !((X(X(F("((SA>=1)&&(SwA>=1))")))))
Formula 0 simplified : XXG!"((SA>=1)&&(SwA>=1))"
Reverse transition relation is NOT exact ! Due to transitions t13, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :...164
Computing Next relation with stutter on 1 deadlock states
4 unique states visited
4 strongly connected components in search stack
4 transitions explored
4 items max in DFS search stack
40111 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,401.134,2459632,1,0,843,1.57055e+07,12,721,718,1.55982e+07,1518
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA ClientsAndServers-PT-N0005P1-LTLFireability-06 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 1 : !((G(F(("((SA<1)||(SwA<1))")||(("((CA>=1)&&(CwA>=1))")||(G("(SpG>=1)")))))))
Formula 1 simplified : G(F!"(SpG>=1)" & FG(!"((CA>=1)&&(CwA>=1))" & !"((SA<1)||(SwA<1))"))
Computing Next relation with stutter on 1 deadlock states
2 unique states visited
0 strongly connected components in search stack
2 transitions explored
2 items max in DFS search stack
43588 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,837.012,4556784,1,0,1256,2.87888e+07,24,757,696,3.00926e+07,1849
no accepting run found
Formula 1 is TRUE no accepting run found.
FORMULA ClientsAndServers-PT-N0005P1-LTLFireability-13 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 2 : !((X((F("(SpA>=1)"))||(G(("((CA>=1)&&(CwA>=1))")||(X("((CA>=1)&&(CwA>=1))")))))))
Formula 2 simplified : X(G!"(SpA>=1)" & F(!"((CA>=1)&&(CwA>=1))" & X!"((CA>=1)&&(CwA>=1))"))
Computing Next relation with stutter on 1 deadlock states
Detected timeout of ITS tools.
[2024-05-21 12:53:08] [INFO ] Flatten gal took : 3 ms
[2024-05-21 12:53:08] [INFO ] Input system was already deterministic with 18 transitions.
[2024-05-21 12:53:08] [INFO ] Transformed 25 places.
[2024-05-21 12:53:08] [INFO ] Transformed 18 transitions.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/pinvar' '/home/mcc/execution/gspn'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/RGMEDD2' '/home/mcc/execution/gspn' '-META' '-varord-only'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2024-05-21 12:53:08] [INFO ] Time to serialize gal into /tmp/LTLFireability1217652118547406028.gal : 1 ms
[2024-05-21 12:53:08] [INFO ] Time to serialize properties into /tmp/LTLFireability9438342265967890864.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability1217652118547406028.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability9438342265967890864.ltl' '-c' '-stutter-deadlock' '--load-order' '/home/mcc/execution/model.ord' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...342
Read 1 LTL properties
Successfully loaded order from file /home/mcc/execution/model.ord
Checking formula 0 : !((X((F("(SpA>=1)"))||(G(("((CA>=1)&&(CwA>=1))")||(X("((CA>=1)&&(CwA>=1))")))))))
Formula 0 simplified : X(G!"(SpA>=1)" & F(!"((CA>=1)&&(CwA>=1))" & X!"((CA>=1)&&(CwA>=1))"))
Reverse transition relation is NOT exact ! Due to transitions t13, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :...164
Computing Next relation with stutter on 1 deadlock states

BK_TIME_CONFINEMENT_REACHED

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

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

Sequence of Actions to be Executed by the VM

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

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

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

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