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-171620505800427.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-N0010P1, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r070-tall-171620505800427
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 456K
-rw-r--r-- 1 mcc users 8.1K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 93K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.3K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 60K 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.2K May 19 07:07 LTLCardinality.txt
-rw-r--r-- 1 mcc users 22K May 19 15:36 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Apr 22 14:33 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Apr 22 14:33 LTLFireability.xml
-rw-r--r-- 1 mcc users 7.8K Apr 12 22:51 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 78K Apr 12 22:51 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.8K Apr 12 22:50 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 77K 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-N0010P1-LTLCardinality-00
FORMULA_NAME ClientsAndServers-PT-N0010P1-LTLCardinality-01
FORMULA_NAME ClientsAndServers-PT-N0010P1-LTLCardinality-02
FORMULA_NAME ClientsAndServers-PT-N0010P1-LTLCardinality-03
FORMULA_NAME ClientsAndServers-PT-N0010P1-LTLCardinality-04
FORMULA_NAME ClientsAndServers-PT-N0010P1-LTLCardinality-05
FORMULA_NAME ClientsAndServers-PT-N0010P1-LTLCardinality-06
FORMULA_NAME ClientsAndServers-PT-N0010P1-LTLCardinality-07
FORMULA_NAME ClientsAndServers-PT-N0010P1-LTLCardinality-08
FORMULA_NAME ClientsAndServers-PT-N0010P1-LTLCardinality-09
FORMULA_NAME ClientsAndServers-PT-N0010P1-LTLCardinality-10
FORMULA_NAME ClientsAndServers-PT-N0010P1-LTLCardinality-11
FORMULA_NAME ClientsAndServers-PT-N0010P1-LTLCardinality-12
FORMULA_NAME ClientsAndServers-PT-N0010P1-LTLCardinality-13
FORMULA_NAME ClientsAndServers-PT-N0010P1-LTLCardinality-14
FORMULA_NAME ClientsAndServers-PT-N0010P1-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1716296703125

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ClientsAndServers-PT-N0010P1
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202405141337
[2024-05-21 13:05:04] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-21 13:05:04] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-21 13:05:04] [INFO ] Load time of PNML (sax parser for PT used): 28 ms
[2024-05-21 13:05:04] [INFO ] Transformed 25 places.
[2024-05-21 13:05:04] [INFO ] Transformed 18 transitions.
[2024-05-21 13:05:04] [INFO ] Parsed PT model containing 25 places and 18 transitions and 54 arcs in 122 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 14 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 5 formulas.
FORMULA ClientsAndServers-PT-N0010P1-LTLCardinality-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ClientsAndServers-PT-N0010P1-LTLCardinality-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ClientsAndServers-PT-N0010P1-LTLCardinality-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ClientsAndServers-PT-N0010P1-LTLCardinality-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ClientsAndServers-PT-N0010P1-LTLCardinality-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 18 out of 25 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 25/25 places, 18/18 transitions.
Discarding 2 places :
Implicit places reduction removed 2 places
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 23 transition count 18
Applied a total of 2 rules in 16 ms. Remains 23 /25 variables (removed 2) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 23 cols
[2024-05-21 13:05:04] [INFO ] Computed 6 invariants in 7 ms
[2024-05-21 13:05:04] [INFO ] Implicit Places using invariants in 159 ms returned []
[2024-05-21 13:05:04] [INFO ] Invariant cache hit.
[2024-05-21 13:05:04] [INFO ] Implicit Places using invariants and state equation in 68 ms returned []
Implicit Place search using SMT with State Equation took 258 ms to find 0 implicit places.
Running 17 sub problems to find dead transitions.
[2024-05-21 13:05:04] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/22 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/22 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/22 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 3 (OVERLAPS) 1/23 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/23 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 5 (OVERLAPS) 18/41 variables, 23/29 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/41 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 7 (OVERLAPS) 0/41 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 17 unsolved
No progress, stopping.
After SMT solving in domain Real declared 41/41 variables, and 29 constraints, problems are : Problem set: 0 solved, 17 unsolved in 313 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 23/23 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/22 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/22 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/22 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 3 (OVERLAPS) 1/23 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/23 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 5 (OVERLAPS) 18/41 variables, 23/29 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/41 variables, 17/46 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/41 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 8 (OVERLAPS) 0/41 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 17 unsolved
No progress, stopping.
After SMT solving in domain Int declared 41/41 variables, and 46 constraints, problems are : Problem set: 0 solved, 17 unsolved in 199 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 23/23 constraints, PredecessorRefiner: 17/17 constraints, Known Traps: 0/0 constraints]
After SMT, in 543ms problems are : Problem set: 0 solved, 17 unsolved
Search for dead transitions found 0 dead transitions in 552ms
Starting structural reductions in LTL mode, iteration 1 : 23/25 places, 18/18 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 841 ms. Remains : 23/25 places, 18/18 transitions.
Support contains 18 out of 23 places after structural reductions.
[2024-05-21 13:05:05] [INFO ] Flatten gal took : 15 ms
[2024-05-21 13:05:05] [INFO ] Flatten gal took : 5 ms
[2024-05-21 13:05:05] [INFO ] Input system was already deterministic with 18 transitions.
RANDOM walk for 40070 steps (22 resets) in 236 ms. (169 steps per ms) remains 4/16 properties
BEST_FIRST walk for 40004 steps (8 resets) in 359 ms. (111 steps per ms) remains 3/4 properties
BEST_FIRST walk for 40002 steps (8 resets) in 281 ms. (141 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 267 ms. (149 steps per ms) remains 3/3 properties
[2024-05-21 13:05:06] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
Problem AtomicPropp6 is UNSAT
Problem AtomicPropp14 is UNSAT
At refinement iteration 1 (OVERLAPS) 15/22 variables, 5/5 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/22 variables, 0/5 constraints. Problems are: Problem set: 2 solved, 1 unsolved
Problem AtomicPropp0 is UNSAT
After SMT solving in domain Real declared 23/41 variables, and 6 constraints, problems are : Problem set: 3 solved, 0 unsolved in 45 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 0/23 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
After SMT, in 53ms problems are : Problem set: 3 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
FORMULA ClientsAndServers-PT-N0010P1-LTLCardinality-15 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 3 atomic propositions for a total of 10 simplifications.
FORMULA ClientsAndServers-PT-N0010P1-LTLCardinality-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ClientsAndServers-PT-N0010P1-LTLCardinality-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 0 stabilizing places and 0 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((X(G(p1))||p0)))'
Support contains 5 out of 23 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 23/23 places, 18/18 transitions.
Applied a total of 0 rules in 0 ms. Remains 23 /23 variables (removed 0) and now considering 18/18 (removed 0) transitions.
[2024-05-21 13:05:06] [INFO ] Invariant cache hit.
[2024-05-21 13:05:06] [INFO ] Implicit Places using invariants in 32 ms returned [14, 19, 21]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 34 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 20/23 places, 18/18 transitions.
Applied a total of 0 rules in 0 ms. Remains 20 /20 variables (removed 0) and now considering 18/18 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 34 ms. Remains : 20/23 places, 18/18 transitions.
Stuttering acceptance computed with spot in 336 ms :[true, (AND (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : ClientsAndServers-PT-N0010P1-LTLCardinality-01
Entered a terminal (fully accepting) state of product in 20012 steps with 1 reset in 122 ms.
FORMULA ClientsAndServers-PT-N0010P1-LTLCardinality-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ClientsAndServers-PT-N0010P1-LTLCardinality-01 finished in 591 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G((p0||X((!p0||F(p1)))))))'
Support contains 2 out of 23 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 23/23 places, 18/18 transitions.
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 4 rules applied. Total rules applied 4 place count 23 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 9 place count 19 transition count 13
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 10 place count 18 transition count 13
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
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 16 place count 15 transition count 10
Discarding 2 places :
Implicit places reduction removed 2 places
Iterating post reduction 3 with 2 rules applied. Total rules applied 18 place count 13 transition count 10
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 18 place count 13 transition count 8
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 22 place count 11 transition count 8
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 4 with 2 rules applied. Total rules applied 24 place count 10 transition count 7
Applied a total of 24 rules in 18 ms. Remains 10 /23 variables (removed 13) and now considering 7/18 (removed 11) transitions.
// Phase 1: matrix 7 rows 10 cols
[2024-05-21 13:05:06] [INFO ] Computed 4 invariants in 1 ms
[2024-05-21 13:05:06] [INFO ] Implicit Places using invariants in 25 ms returned [6, 9]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 27 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 8/23 places, 7/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 8 transition count 6
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 7 transition count 6
Applied a total of 2 rules in 2 ms. Remains 7 /8 variables (removed 1) and now considering 6/7 (removed 1) transitions.
// Phase 1: matrix 6 rows 7 cols
[2024-05-21 13:05:06] [INFO ] Computed 2 invariants in 1 ms
[2024-05-21 13:05:06] [INFO ] Implicit Places using invariants in 19 ms returned []
[2024-05-21 13:05:06] [INFO ] Invariant cache hit.
[2024-05-21 13:05:06] [INFO ] Implicit Places using invariants and state equation in 31 ms returned []
Implicit Place search using SMT with State Equation took 52 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 7/23 places, 6/18 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 99 ms. Remains : 7/23 places, 6/18 transitions.
Stuttering acceptance computed with spot in 139 ms :[false, false, false]
Running random walk in product with property : ClientsAndServers-PT-N0010P1-LTLCardinality-02
Product exploration explored 100000 steps with 22 reset in 187 ms.
Product exploration explored 100000 steps with 18 reset in 215 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 p1), (X (NOT (AND p0 (NOT p1)))), (X p0), (X p1), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 126 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter insensitive) to 3 states, 5 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 109 ms :[false, false, false]
RANDOM walk for 2720 steps (0 resets) in 14 ms. (181 steps per ms) remains 0/4 properties
Knowledge obtained : [(AND p0 p1), (X (NOT (AND p0 (NOT p1)))), (X p0), (X p1), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (X (X p1))]
False Knowledge obtained : [(F (NOT p1)), (F (NOT (OR (NOT p0) p1))), (F (NOT p0)), (F (NOT (OR p0 p1)))]
Knowledge based reduction with 7 factoid took 210 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter insensitive) to 3 states, 5 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 120 ms :[false, false, false]
Stuttering acceptance computed with spot in 110 ms :[false, false, false]
Support contains 2 out of 7 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 7/7 places, 6/6 transitions.
Applied a total of 0 rules in 2 ms. Remains 7 /7 variables (removed 0) and now considering 6/6 (removed 0) transitions.
[2024-05-21 13:05:08] [INFO ] Invariant cache hit.
[2024-05-21 13:05:08] [INFO ] Implicit Places using invariants in 20 ms returned []
[2024-05-21 13:05:08] [INFO ] Invariant cache hit.
[2024-05-21 13:05:08] [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.
[2024-05-21 13:05:08] [INFO ] Redundant transitions in 0 ms returned []
Running 5 sub problems to find dead transitions.
[2024-05-21 13:05:08] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/7 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (OVERLAPS) 6/13 variables, 7/9 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/13 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (OVERLAPS) 0/13 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 13/13 variables, and 9 constraints, problems are : Problem set: 0 solved, 5 unsolved in 39 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 7/7 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 5 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/7 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (OVERLAPS) 6/13 variables, 7/9 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/13 variables, 5/14 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 0/13 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Int declared 13/13 variables, and 14 constraints, problems are : Problem set: 0 solved, 5 unsolved in 44 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 7/7 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints]
After SMT, in 86ms problems are : Problem set: 0 solved, 5 unsolved
Search for dead transitions found 0 dead transitions in 87ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 144 ms. Remains : 7/7 places, 6/6 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 p1), (X (NOT (AND p0 (NOT p1)))), (X p0), (X p1), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 112 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter insensitive) to 3 states, 5 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 125 ms :[false, false, false]
RANDOM walk for 3364 steps (0 resets) in 13 ms. (240 steps per ms) remains 0/4 properties
Knowledge obtained : [(AND p0 p1), (X (NOT (AND p0 (NOT p1)))), (X p0), (X p1), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (X (X p1))]
False Knowledge obtained : [(F (NOT p1)), (F (NOT (OR (NOT p0) p1))), (F (NOT p0)), (F (NOT (OR p0 p1)))]
Knowledge based reduction with 7 factoid took 215 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter insensitive) to 3 states, 5 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 97 ms :[false, false, false]
Stuttering acceptance computed with spot in 123 ms :[false, false, false]
Stuttering acceptance computed with spot in 120 ms :[false, false, false]
Product exploration explored 100000 steps with 22 reset in 78 ms.
Product exploration explored 100000 steps with 15 reset in 85 ms.
Built C files in :
/tmp/ltsmin5550994889402635062
[2024-05-21 13:05:09] [INFO ] Computing symmetric may disable matrix : 6 transitions.
[2024-05-21 13:05:09] [INFO ] Computation of Complete disable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 13:05:09] [INFO ] Computing symmetric may enable matrix : 6 transitions.
[2024-05-21 13:05:09] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 13:05:09] [INFO ] Computing Do-Not-Accords matrix : 6 transitions.
[2024-05-21 13:05:09] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 13:05:09] [INFO ] Built C files in 25ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5550994889402635062
Running compilation step : cd /tmp/ltsmin5550994889402635062;'/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 210 ms.
Running link step : cd /tmp/ltsmin5550994889402635062;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 42 ms.
Running LTSmin : cd /tmp/ltsmin5550994889402635062;'/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/stateBased2600758293291294754.hoa' '--buchi-type=spotba'
LTSmin run took 284 ms.
FORMULA ClientsAndServers-PT-N0010P1-LTLCardinality-02 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property ClientsAndServers-PT-N0010P1-LTLCardinality-02 finished in 3129 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((G(p0)||(p1&&G(F(!p1))))))))'
Support contains 3 out of 23 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 23/23 places, 18/18 transitions.
Applied a total of 0 rules in 1 ms. Remains 23 /23 variables (removed 0) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 23 cols
[2024-05-21 13:05:10] [INFO ] Computed 6 invariants in 1 ms
[2024-05-21 13:05:10] [INFO ] Implicit Places using invariants in 33 ms returned [14]
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 : 22/23 places, 18/18 transitions.
Applied a total of 0 rules in 1 ms. Remains 22 /22 variables (removed 0) and now considering 18/18 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 36 ms. Remains : 22/23 places, 18/18 transitions.
Stuttering acceptance computed with spot in 275 ms :[(NOT p0), (NOT p0), (NOT p0), true, (NOT p0), p1, p1]
Running random walk in product with property : ClientsAndServers-PT-N0010P1-LTLCardinality-03
Product exploration explored 100000 steps with 11 reset in 142 ms.
Product exploration explored 100000 steps with 8 reset in 208 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p1 p0), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND (NOT p0) p1))), (X (X (NOT p0))), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 122 ms. Reduced automaton from 7 states, 13 edges and 2 AP (stutter sensitive) to 7 states, 13 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 255 ms :[(NOT p0), (NOT p0), (NOT p0), true, (NOT p0), p1, p1]
RANDOM walk for 13946 steps (8 resets) in 38 ms. (357 steps per ms) remains 0/5 properties
Knowledge obtained : [(AND p1 p0), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND (NOT p0) p1))), (X (X (NOT p0))), (X (X p1))]
False Knowledge obtained : [(F (NOT p1)), (F (NOT p0)), (F (NOT (OR (NOT p0) p1))), (F (NOT (OR p0 (NOT p1)))), (F (NOT (OR p0 p1)))]
Knowledge based reduction with 6 factoid took 355 ms. Reduced automaton from 7 states, 13 edges and 2 AP (stutter sensitive) to 7 states, 13 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 245 ms :[(NOT p0), (NOT p0), (NOT p0), true, (NOT p0), p1, p1]
Stuttering acceptance computed with spot in 269 ms :[(NOT p0), (NOT p0), (NOT p0), true, (NOT p0), p1, p1]
Support contains 3 out of 22 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 22/22 places, 18/18 transitions.
Applied a total of 0 rules in 1 ms. Remains 22 /22 variables (removed 0) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 22 cols
[2024-05-21 13:05:11] [INFO ] Computed 5 invariants in 2 ms
[2024-05-21 13:05:12] [INFO ] Implicit Places using invariants in 36 ms returned []
[2024-05-21 13:05:12] [INFO ] Invariant cache hit.
[2024-05-21 13:05:12] [INFO ] Implicit Places using invariants and state equation in 45 ms returned []
Implicit Place search using SMT with State Equation took 82 ms to find 0 implicit places.
Running 17 sub problems to find dead transitions.
[2024-05-21 13:05:12] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/21 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/21 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/21 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 3 (OVERLAPS) 1/22 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/22 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 5 (OVERLAPS) 18/40 variables, 22/27 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/40 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 7 (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 142 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, Generalized P Invariants (flows): 1/1 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, 2/2 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/21 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/21 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 3 (OVERLAPS) 1/22 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/22 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 5 (OVERLAPS) 18/40 variables, 22/27 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/40 variables, 17/44 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/40 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 8 (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 147 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 22/22 constraints, PredecessorRefiner: 17/17 constraints, Known Traps: 0/0 constraints]
After SMT, in 296ms problems are : Problem set: 0 solved, 17 unsolved
Search for dead transitions found 0 dead transitions in 296ms
Finished structural reductions in LTL mode , in 1 iterations and 380 ms. Remains : 22/22 places, 18/18 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p1 p0), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND (NOT p0) p1))), (X (X (NOT p0))), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 98 ms. Reduced automaton from 7 states, 13 edges and 2 AP (stutter sensitive) to 7 states, 13 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 220 ms :[(NOT p0), (NOT p0), (NOT p0), true, (NOT p0), p1, p1]
RANDOM walk for 6779 steps (2 resets) in 13 ms. (484 steps per ms) remains 0/5 properties
Knowledge obtained : [(AND p1 p0), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND (NOT p0) p1))), (X (X (NOT p0))), (X (X p1))]
False Knowledge obtained : [(F (NOT p1)), (F (NOT p0)), (F (NOT (OR (NOT p0) p1))), (F (NOT (OR p0 (NOT p1)))), (F (NOT (OR p0 p1)))]
Knowledge based reduction with 6 factoid took 221 ms. Reduced automaton from 7 states, 13 edges and 2 AP (stutter sensitive) to 7 states, 13 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 244 ms :[(NOT p0), (NOT p0), (NOT p0), true, (NOT p0), p1, p1]
Stuttering acceptance computed with spot in 260 ms :[(NOT p0), (NOT p0), (NOT p0), true, (NOT p0), p1, p1]
Stuttering acceptance computed with spot in 280 ms :[(NOT p0), (NOT p0), (NOT p0), true, (NOT p0), p1, p1]
Product exploration explored 100000 steps with 13 reset in 148 ms.
Product exploration explored 100000 steps with 7 reset in 157 ms.
Applying partial POR strategy [false, false, true, true, true, true, true]
Stuttering acceptance computed with spot in 254 ms :[(NOT p0), (NOT p0), (NOT p0), true, (NOT p0), p1, p1]
Support contains 3 out of 22 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 22/22 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 22 transition count 18
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 1 Pre rules applied. Total rules applied 7 place count 22 transition count 18
Deduced a syphon composed of 8 places in 0 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 8 place count 22 transition count 18
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 12 place count 18 transition count 14
Deduced a syphon composed of 4 places in 0 ms
Iterating global reduction 1 with 4 rules applied. Total rules applied 16 place count 18 transition count 14
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 6 places in 0 ms
Iterating global reduction 1 with 2 rules applied. Total rules applied 18 place count 18 transition count 14
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 20 place count 16 transition count 12
Deduced a syphon composed of 4 places in 0 ms
Iterating global reduction 1 with 2 rules applied. Total rules applied 22 place count 16 transition count 12
Deduced a syphon composed of 4 places in 0 ms
Applied a total of 22 rules in 10 ms. Remains 16 /22 variables (removed 6) and now considering 12/18 (removed 6) transitions.
[2024-05-21 13:05:14] [INFO ] Redundant transitions in 0 ms returned []
Running 11 sub problems to find dead transitions.
// Phase 1: matrix 12 rows 16 cols
[2024-05-21 13:05:14] [INFO ] Computed 5 invariants in 1 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/15 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/15 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/15 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 3 (OVERLAPS) 1/16 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/16 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 11 unsolved
Problem TDEAD0 is UNSAT
Problem TDEAD1 is UNSAT
Problem TDEAD8 is UNSAT
Problem TDEAD10 is UNSAT
At refinement iteration 5 (OVERLAPS) 12/28 variables, 16/21 constraints. Problems are: Problem set: 4 solved, 7 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/28 variables, 0/21 constraints. Problems are: Problem set: 4 solved, 7 unsolved
At refinement iteration 7 (OVERLAPS) 0/28 variables, 0/21 constraints. Problems are: Problem set: 4 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Real declared 28/28 variables, and 21 constraints, problems are : Problem set: 4 solved, 7 unsolved in 84 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 16/16 constraints, PredecessorRefiner: 11/11 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 4 solved, 7 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/11 variables, 0/0 constraints. Problems are: Problem set: 4 solved, 7 unsolved
At refinement iteration 1 (OVERLAPS) 5/16 variables, 4/4 constraints. Problems are: Problem set: 4 solved, 7 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/16 variables, 1/5 constraints. Problems are: Problem set: 4 solved, 7 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/16 variables, 0/5 constraints. Problems are: Problem set: 4 solved, 7 unsolved
At refinement iteration 4 (OVERLAPS) 12/28 variables, 16/21 constraints. Problems are: Problem set: 4 solved, 7 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/28 variables, 7/28 constraints. Problems are: Problem set: 4 solved, 7 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/28 variables, 0/28 constraints. Problems are: Problem set: 4 solved, 7 unsolved
At refinement iteration 7 (OVERLAPS) 0/28 variables, 0/28 constraints. Problems are: Problem set: 4 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Int declared 28/28 variables, and 28 constraints, problems are : Problem set: 4 solved, 7 unsolved in 67 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 16/16 constraints, PredecessorRefiner: 7/11 constraints, Known Traps: 0/0 constraints]
After SMT, in 156ms problems are : Problem set: 4 solved, 7 unsolved
Search for dead transitions found 4 dead transitions in 159ms
Found 4 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 4 transitions
Dead transitions reduction (with SMT) removed 4 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 16/22 places, 8/18 transitions.
Graph (complete) has 19 edges and 16 vertex of which 12 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.0 ms
Discarding 4 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 5 ms. Remains 12 /16 variables (removed 4) and now considering 8/8 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 12/22 places, 8/18 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 209 ms. Remains : 12/22 places, 8/18 transitions.
Built C files in :
/tmp/ltsmin16976511212721365855
[2024-05-21 13:05:14] [INFO ] Built C files in 1ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16976511212721365855
Running compilation step : cd /tmp/ltsmin16976511212721365855;'/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 96 ms.
Running link step : cd /tmp/ltsmin16976511212721365855;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 33 ms.
Running LTSmin : cd /tmp/ltsmin16976511212721365855;'/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/stateBased15800757295476508660.hoa' '--buchi-type=spotba'
LTSmin run took 8016 ms.
FORMULA ClientsAndServers-PT-N0010P1-LTLCardinality-03 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property ClientsAndServers-PT-N0010P1-LTLCardinality-03 finished in 12844 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&&F(p1))))))'
Support contains 4 out of 23 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 23/23 places, 18/18 transitions.
Applied a total of 0 rules in 1 ms. Remains 23 /23 variables (removed 0) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 23 cols
[2024-05-21 13:05:22] [INFO ] Computed 6 invariants in 1 ms
[2024-05-21 13:05:22] [INFO ] Implicit Places using invariants in 32 ms returned [14, 19, 21]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 33 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 20/23 places, 18/18 transitions.
Applied a total of 0 rules in 0 ms. Remains 20 /20 variables (removed 0) and now considering 18/18 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 35 ms. Remains : 20/23 places, 18/18 transitions.
Stuttering acceptance computed with spot in 146 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : ClientsAndServers-PT-N0010P1-LTLCardinality-06
Product exploration explored 100000 steps with 12 reset in 139 ms.
Product exploration explored 100000 steps with 9 reset in 190 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 89 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter sensitive) to 4 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 169 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1))]
RANDOM walk for 2418 steps (0 resets) in 8 ms. (268 steps per ms) remains 0/3 properties
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : [(F (NOT (OR (NOT p0) p1))), (F p0), (F p1)]
Knowledge based reduction with 4 factoid took 177 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter sensitive) to 4 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 146 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 152 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1))]
// Phase 1: matrix 18 rows 20 cols
[2024-05-21 13:05:24] [INFO ] Computed 3 invariants in 1 ms
[2024-05-21 13:05:24] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-21 13:05:24] [INFO ] [Real]Absence check using state equation in 8 ms returned sat
[2024-05-21 13:05:24] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 13:05:24] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-21 13:05:24] [INFO ] [Nat]Absence check using state equation in 6 ms returned sat
[2024-05-21 13:05:24] [INFO ] Computed and/alt/rep : 17/17/17 causal constraints (skipped 0 transitions) in 1 ms.
[2024-05-21 13:05:24] [INFO ] Added : 5 causal constraints over 1 iterations in 7 ms. Result :sat
Could not prove EG (NOT p0)
[2024-05-21 13:05:24] [INFO ] Invariant cache hit.
[2024-05-21 13:05:24] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-21 13:05:24] [INFO ] [Real]Absence check using state equation in 6 ms returned sat
[2024-05-21 13:05:24] [INFO ] Computed and/alt/rep : 17/17/17 causal constraints (skipped 0 transitions) in 2 ms.
[2024-05-21 13:05:24] [INFO ] Added : 16 causal constraints over 4 iterations in 22 ms. Result :sat
Could not prove EG (NOT p1)
Support contains 4 out of 20 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 20/20 places, 18/18 transitions.
Applied a total of 0 rules in 1 ms. Remains 20 /20 variables (removed 0) and now considering 18/18 (removed 0) transitions.
[2024-05-21 13:05:24] [INFO ] Invariant cache hit.
[2024-05-21 13:05:24] [INFO ] Implicit Places using invariants in 25 ms returned []
[2024-05-21 13:05:24] [INFO ] Invariant cache hit.
[2024-05-21 13:05:24] [INFO ] Implicit Places using invariants and state equation in 25 ms returned []
Implicit Place search using SMT with State Equation took 52 ms to find 0 implicit places.
Running 17 sub problems to find dead transitions.
[2024-05-21 13:05:24] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/19 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/19 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 2 (OVERLAPS) 1/20 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/20 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 4 (OVERLAPS) 18/38 variables, 20/23 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/38 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 6 (OVERLAPS) 0/38 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 17 unsolved
No progress, stopping.
After SMT solving in domain Real declared 38/38 variables, and 23 constraints, problems are : Problem set: 0 solved, 17 unsolved in 122 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 20/20 constraints, PredecessorRefiner: 17/17 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 17 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/19 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/19 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 2 (OVERLAPS) 1/20 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/20 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 4 (OVERLAPS) 18/38 variables, 20/23 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/38 variables, 17/40 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/38 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 7 (OVERLAPS) 0/38 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 17 unsolved
No progress, stopping.
After SMT solving in domain Int declared 38/38 variables, and 40 constraints, problems are : Problem set: 0 solved, 17 unsolved in 106 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 20/20 constraints, PredecessorRefiner: 17/17 constraints, Known Traps: 0/0 constraints]
After SMT, in 232ms problems are : Problem set: 0 solved, 17 unsolved
Search for dead transitions found 0 dead transitions in 232ms
Finished structural reductions in LTL mode , in 1 iterations and 285 ms. Remains : 20/20 places, 18/18 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 79 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter sensitive) to 4 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 177 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1))]
RANDOM walk for 3951 steps (0 resets) in 9 ms. (395 steps per ms) remains 0/3 properties
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : [(F (NOT (OR (NOT p0) p1))), (F p0), (F p1)]
Knowledge based reduction with 4 factoid took 171 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter sensitive) to 4 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 157 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 168 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1))]
[2024-05-21 13:05:25] [INFO ] Invariant cache hit.
[2024-05-21 13:05:25] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-21 13:05:25] [INFO ] [Real]Absence check using state equation in 6 ms returned sat
[2024-05-21 13:05:25] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 13:05:25] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-21 13:05:25] [INFO ] [Nat]Absence check using state equation in 6 ms returned sat
[2024-05-21 13:05:25] [INFO ] Computed and/alt/rep : 17/17/17 causal constraints (skipped 0 transitions) in 2 ms.
[2024-05-21 13:05:25] [INFO ] Added : 5 causal constraints over 1 iterations in 6 ms. Result :sat
Could not prove EG (NOT p0)
[2024-05-21 13:05:25] [INFO ] Invariant cache hit.
[2024-05-21 13:05:25] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-21 13:05:25] [INFO ] [Real]Absence check using state equation in 5 ms returned sat
[2024-05-21 13:05:25] [INFO ] Computed and/alt/rep : 17/17/17 causal constraints (skipped 0 transitions) in 1 ms.
[2024-05-21 13:05:25] [INFO ] Added : 16 causal constraints over 4 iterations in 11 ms. Result :sat
Could not prove EG (NOT p1)
Stuttering acceptance computed with spot in 151 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 8 reset in 176 ms.
Product exploration explored 100000 steps with 12 reset in 148 ms.
Applying partial POR strategy [true, true, false, false]
Stuttering acceptance computed with spot in 162 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1))]
Support contains 4 out of 20 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 20/20 places, 18/18 transitions.
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 7 rules applied. Total rules applied 7 place count 20 transition count 18
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 2 Pre rules applied. Total rules applied 7 place count 20 transition count 18
Deduced a syphon composed of 9 places in 0 ms
Iterating global reduction 1 with 2 rules applied. Total rules applied 9 place count 20 transition count 18
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 11 place count 18 transition count 16
Deduced a syphon composed of 7 places in 0 ms
Iterating global reduction 1 with 2 rules applied. Total rules applied 13 place count 18 transition count 16
Deduced a syphon composed of 7 places in 0 ms
Applied a total of 13 rules in 6 ms. Remains 18 /20 variables (removed 2) and now considering 16/18 (removed 2) transitions.
[2024-05-21 13:05:26] [INFO ] Redundant transitions in 0 ms returned []
Running 15 sub problems to find dead transitions.
// Phase 1: matrix 16 rows 18 cols
[2024-05-21 13:05:26] [INFO ] Computed 3 invariants in 2 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/17 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/17 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 2 (OVERLAPS) 1/18 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/18 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 15 unsolved
Problem TDEAD1 is UNSAT
Problem TDEAD2 is UNSAT
Problem TDEAD3 is UNSAT
Problem TDEAD6 is UNSAT
Problem TDEAD10 is UNSAT
Problem TDEAD12 is UNSAT
Problem TDEAD14 is UNSAT
At refinement iteration 4 (OVERLAPS) 16/34 variables, 18/21 constraints. Problems are: Problem set: 7 solved, 8 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/34 variables, 0/21 constraints. Problems are: Problem set: 7 solved, 8 unsolved
At refinement iteration 6 (OVERLAPS) 0/34 variables, 0/21 constraints. Problems are: Problem set: 7 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Real declared 34/34 variables, and 21 constraints, problems are : Problem set: 7 solved, 8 unsolved in 239 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 18/18 constraints, PredecessorRefiner: 15/15 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 7 solved, 8 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/10 variables, 0/0 constraints. Problems are: Problem set: 7 solved, 8 unsolved
At refinement iteration 1 (OVERLAPS) 8/18 variables, 3/3 constraints. Problems are: Problem set: 7 solved, 8 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/18 variables, 0/3 constraints. Problems are: Problem set: 7 solved, 8 unsolved
At refinement iteration 3 (OVERLAPS) 16/34 variables, 18/21 constraints. Problems are: Problem set: 7 solved, 8 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/34 variables, 8/29 constraints. Problems are: Problem set: 7 solved, 8 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/34 variables, 0/29 constraints. Problems are: Problem set: 7 solved, 8 unsolved
At refinement iteration 6 (OVERLAPS) 0/34 variables, 0/29 constraints. Problems are: Problem set: 7 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Int declared 34/34 variables, and 29 constraints, problems are : Problem set: 7 solved, 8 unsolved in 66 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 18/18 constraints, PredecessorRefiner: 8/15 constraints, Known Traps: 0/0 constraints]
After SMT, in 312ms problems are : Problem set: 7 solved, 8 unsolved
Search for dead transitions found 7 dead transitions in 313ms
Found 7 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 7 transitions
Dead transitions reduction (with SMT) removed 7 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 18/20 places, 9/18 transitions.
Graph (complete) has 15 edges and 18 vertex of which 11 are kept as prefixes of interest. Removing 7 places using SCC suffix rule.0 ms
Discarding 7 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 1 ms. Remains 11 /18 variables (removed 7) and now considering 9/9 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 11/20 places, 9/18 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 325 ms. Remains : 11/20 places, 9/18 transitions.
Built C files in :
/tmp/ltsmin7892219432591776003
[2024-05-21 13:05:26] [INFO ] Built C files in 1ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7892219432591776003
Running compilation step : cd /tmp/ltsmin7892219432591776003;'/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 86 ms.
Running link step : cd /tmp/ltsmin7892219432591776003;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 29 ms.
Running LTSmin : cd /tmp/ltsmin7892219432591776003;'/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/stateBased11074666044125607524.hoa' '--buchi-type=spotba'
LTSmin run took 2437 ms.
FORMULA ClientsAndServers-PT-N0010P1-LTLCardinality-06 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property ClientsAndServers-PT-N0010P1-LTLCardinality-06 finished in 6286 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 23 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 23/23 places, 18/18 transitions.
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 4 rules applied. Total rules applied 4 place count 23 transition count 14
Reduce places removed 4 places and 0 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 6 rules applied. Total rules applied 10 place count 18 transition count 13
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 11 place count 17 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 11 place count 17 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 13 place count 16 transition count 12
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
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 19 place count 13 transition count 9
Applied a total of 19 rules in 3 ms. Remains 13 /23 variables (removed 10) and now considering 9/18 (removed 9) transitions.
// Phase 1: matrix 9 rows 13 cols
[2024-05-21 13:05:29] [INFO ] Computed 5 invariants in 0 ms
[2024-05-21 13:05:29] [INFO ] Implicit Places using invariants in 25 ms returned [9]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 26 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 12/23 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 12 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 11 transition count 8
Applied a total of 2 rules in 3 ms. Remains 11 /12 variables (removed 1) and now considering 8/9 (removed 1) transitions.
// Phase 1: matrix 8 rows 11 cols
[2024-05-21 13:05:29] [INFO ] Computed 4 invariants in 0 ms
[2024-05-21 13:05:29] [INFO ] Implicit Places using invariants in 21 ms returned []
[2024-05-21 13:05:29] [INFO ] Invariant cache hit.
[2024-05-21 13:05:29] [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.
Starting structural reductions in SI_LTL mode, iteration 2 : 11/23 places, 8/18 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 78 ms. Remains : 11/23 places, 8/18 transitions.
Stuttering acceptance computed with spot in 86 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : ClientsAndServers-PT-N0010P1-LTLCardinality-07
Product exploration explored 100000 steps with 5191 reset in 79 ms.
Product exploration explored 100000 steps with 6017 reset in 166 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT (AND p1 (NOT p0)))), (X (AND (NOT p1) (NOT p0))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT (AND p1 (NOT p0))))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 102 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 84 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
RANDOM walk for 517 steps (0 resets) in 5 ms. (86 steps per ms) remains 0/4 properties
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT (AND p1 (NOT p0)))), (X (AND (NOT p1) (NOT p0))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT (AND p1 (NOT p0))))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : [(F p1), (F (NOT (AND (NOT p0) (NOT p1)))), (F p0), (F (NOT (OR p0 (NOT p1))))]
Knowledge based reduction with 9 factoid took 201 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 79 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 82 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
[2024-05-21 13:05:30] [INFO ] Invariant cache hit.
[2024-05-21 13:05:30] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2024-05-21 13:05:30] [INFO ] [Real]Absence check using state equation in 3 ms returned sat
[2024-05-21 13:05:30] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 13:05:30] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2024-05-21 13:05:30] [INFO ] [Nat]Absence check using state equation in 4 ms returned sat
[2024-05-21 13:05:30] [INFO ] Computed and/alt/rep : 7/8/7 causal constraints (skipped 0 transitions) in 1 ms.
[2024-05-21 13:05:30] [INFO ] Added : 5 causal constraints over 1 iterations in 6 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p1))
Support contains 3 out of 11 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 11/11 places, 8/8 transitions.
Applied a total of 0 rules in 1 ms. Remains 11 /11 variables (removed 0) and now considering 8/8 (removed 0) transitions.
[2024-05-21 13:05:30] [INFO ] Invariant cache hit.
[2024-05-21 13:05:30] [INFO ] Implicit Places using invariants in 16 ms returned []
[2024-05-21 13:05:30] [INFO ] Invariant cache hit.
[2024-05-21 13:05:30] [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.
[2024-05-21 13:05:30] [INFO ] Redundant transitions in 0 ms returned []
Running 7 sub problems to find dead transitions.
[2024-05-21 13:05:30] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/10 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/10 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (OVERLAPS) 1/11 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/11 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (OVERLAPS) 8/19 variables, 11/15 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/19 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 6 (OVERLAPS) 0/19 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Real declared 19/19 variables, and 15 constraints, problems are : Problem set: 0 solved, 7 unsolved in 52 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 11/11 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 7 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/10 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/10 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (OVERLAPS) 1/11 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/11 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (OVERLAPS) 8/19 variables, 11/15 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/19 variables, 7/22 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/19 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 7 (OVERLAPS) 0/19 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Int declared 19/19 variables, and 22 constraints, problems are : Problem set: 0 solved, 7 unsolved in 68 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 11/11 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 0/0 constraints]
After SMT, in 125ms problems are : Problem set: 0 solved, 7 unsolved
Search for dead transitions found 0 dead transitions in 125ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 169 ms. Remains : 11/11 places, 8/8 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) p1))), (X (NOT p0)), (X (NOT p1)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 82 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 75 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
RANDOM walk for 602 steps (0 resets) in 8 ms. (66 steps per ms) remains 0/4 properties
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) p1))), (X (NOT p0)), (X (NOT p1)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : [(F p1), (F (NOT (AND (NOT p0) (NOT p1)))), (F p0), (F (NOT (OR p0 (NOT p1))))]
Knowledge based reduction with 9 factoid took 254 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 86 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 84 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
[2024-05-21 13:05:30] [INFO ] Invariant cache hit.
[2024-05-21 13:05:31] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2024-05-21 13:05:31] [INFO ] [Real]Absence check using state equation in 3 ms returned sat
[2024-05-21 13:05:31] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 13:05:31] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2024-05-21 13:05:31] [INFO ] [Nat]Absence check using state equation in 5 ms returned sat
[2024-05-21 13:05:31] [INFO ] Computed and/alt/rep : 7/8/7 causal constraints (skipped 0 transitions) in 0 ms.
[2024-05-21 13:05:31] [INFO ] Added : 5 causal constraints over 1 iterations in 7 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p1))
Stuttering acceptance computed with spot in 74 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 6950 reset in 103 ms.
Product exploration explored 100000 steps with 7890 reset in 185 ms.
Built C files in :
/tmp/ltsmin5319687427648353136
[2024-05-21 13:05:31] [INFO ] Computing symmetric may disable matrix : 8 transitions.
[2024-05-21 13:05:31] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 13:05:31] [INFO ] Computing symmetric may enable matrix : 8 transitions.
[2024-05-21 13:05:31] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 13:05:31] [INFO ] Computing Do-Not-Accords matrix : 8 transitions.
[2024-05-21 13:05:31] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 13:05:31] [INFO ] Built C files in 6ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5319687427648353136
Running compilation step : cd /tmp/ltsmin5319687427648353136;'/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/ltsmin5319687427648353136;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 36 ms.
Running LTSmin : cd /tmp/ltsmin5319687427648353136;'/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/stateBased7931608150664534755.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 3 out of 11 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 11/11 places, 8/8 transitions.
Applied a total of 0 rules in 2 ms. Remains 11 /11 variables (removed 0) and now considering 8/8 (removed 0) transitions.
[2024-05-21 13:05:46] [INFO ] Invariant cache hit.
[2024-05-21 13:05:46] [INFO ] Implicit Places using invariants in 36 ms returned []
[2024-05-21 13:05:46] [INFO ] Invariant cache hit.
[2024-05-21 13:05:46] [INFO ] Implicit Places using invariants and state equation in 30 ms returned []
Implicit Place search using SMT with State Equation took 68 ms to find 0 implicit places.
[2024-05-21 13:05:46] [INFO ] Redundant transitions in 0 ms returned []
Running 7 sub problems to find dead transitions.
[2024-05-21 13:05:46] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/10 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/10 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (OVERLAPS) 1/11 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/11 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (OVERLAPS) 8/19 variables, 11/15 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/19 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 6 (OVERLAPS) 0/19 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Real declared 19/19 variables, and 15 constraints, problems are : Problem set: 0 solved, 7 unsolved in 57 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 11/11 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 7 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/10 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/10 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (OVERLAPS) 1/11 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/11 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (OVERLAPS) 8/19 variables, 11/15 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/19 variables, 7/22 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/19 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 7 (OVERLAPS) 0/19 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Int declared 19/19 variables, and 22 constraints, problems are : Problem set: 0 solved, 7 unsolved in 62 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 11/11 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 0/0 constraints]
After SMT, in 149ms problems are : Problem set: 0 solved, 7 unsolved
Search for dead transitions found 0 dead transitions in 149ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 223 ms. Remains : 11/11 places, 8/8 transitions.
Built C files in :
/tmp/ltsmin6599574791438670811
[2024-05-21 13:05:46] [INFO ] Computing symmetric may disable matrix : 8 transitions.
[2024-05-21 13:05:46] [INFO ] Computation of Complete disable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 13:05:46] [INFO ] Computing symmetric may enable matrix : 8 transitions.
[2024-05-21 13:05:46] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 13:05:46] [INFO ] Computing Do-Not-Accords matrix : 8 transitions.
[2024-05-21 13:05:46] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 13:05:46] [INFO ] Built C files in 4ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6599574791438670811
Running compilation step : cd /tmp/ltsmin6599574791438670811;'/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 77 ms.
Running link step : cd /tmp/ltsmin6599574791438670811;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 25 ms.
Running LTSmin : cd /tmp/ltsmin6599574791438670811;'/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/stateBased227983558430751721.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-21 13:06:01] [INFO ] Flatten gal took : 1 ms
[2024-05-21 13:06:01] [INFO ] Flatten gal took : 1 ms
[2024-05-21 13:06:01] [INFO ] Time to serialize gal into /tmp/LTL275574342219045206.gal : 1 ms
[2024-05-21 13:06:01] [INFO ] Time to serialize properties into /tmp/LTL11121140776837994700.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/LTL275574342219045206.gal' '-t' 'CGAL' '-hoa' '/tmp/aut9936551928009443698.hoa' '-atoms' '/tmp/LTL11121140776837994700.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...317
Loading property file /tmp/LTL11121140776837994700.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut9936551928009443698.hoa
Detected timeout of ITS tools.
[2024-05-21 13:06:17] [INFO ] Flatten gal took : 2 ms
[2024-05-21 13:06:17] [INFO ] Flatten gal took : 2 ms
[2024-05-21 13:06:17] [INFO ] Time to serialize gal into /tmp/LTL9192985800142445592.gal : 1 ms
[2024-05-21 13:06:17] [INFO ] Time to serialize properties into /tmp/LTL3693208449165482224.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/LTL9192985800142445592.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL3693208449165482224.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...275
Read 1 LTL properties
Checking formula 0 : !((G(F(("(CwA>SF)")||(G("(Ci<2)"))))))
Formula 0 simplified : G(F!"(Ci<2)" & FG!"(CwA>SF)")
Detected timeout of ITS tools.
[2024-05-21 13:06:32] [INFO ] Flatten gal took : 3 ms
[2024-05-21 13:06:32] [INFO ] Applying decomposition
[2024-05-21 13:06:32] [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/graph6239104019283644957.txt' '-o' '/tmp/graph6239104019283644957.bin' '-w' '/tmp/graph6239104019283644957.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph6239104019283644957.bin' '-l' '-1' '-v' '-w' '/tmp/graph6239104019283644957.weights' '-q' '0' '-e' '0.001'
[2024-05-21 13:06:32] [INFO ] Decomposing Gal with order
[2024-05-21 13:06:32] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 13:06:32] [INFO ] Flatten gal took : 27 ms
[2024-05-21 13:06:32] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2024-05-21 13:06:32] [INFO ] Time to serialize gal into /tmp/LTL9325687688626615651.gal : 1 ms
[2024-05-21 13:06:32] [INFO ] Time to serialize properties into /tmp/LTL3313793500893545275.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/LTL9325687688626615651.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL3313793500893545275.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...275
Read 1 LTL properties
Checking formula 0 : !((G(F(("(gu3.CwA>gu3.SF)")||(G("(gi0.gu1.Ci<2)"))))))
Formula 0 simplified : G(F!"(gi0.gu1.Ci<2)" & FG!"(gu3.CwA>gu3.SF)")
Detected timeout of ITS tools.
Treatment of property ClientsAndServers-PT-N0010P1-LTLCardinality-07 finished in 78066 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 1 out of 23 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 23/23 places, 18/18 transitions.
Applied a total of 0 rules in 1 ms. Remains 23 /23 variables (removed 0) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 23 cols
[2024-05-21 13:06:47] [INFO ] Computed 6 invariants in 1 ms
[2024-05-21 13:06:47] [INFO ] Implicit Places using invariants in 26 ms returned [14, 19, 21]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 27 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 20/23 places, 18/18 transitions.
Applied a total of 0 rules in 0 ms. Remains 20 /20 variables (removed 0) and now considering 18/18 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 28 ms. Remains : 20/23 places, 18/18 transitions.
Stuttering acceptance computed with spot in 104 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : ClientsAndServers-PT-N0010P1-LTLCardinality-08
Product exploration explored 100000 steps with 1218 reset in 99 ms.
Product exploration explored 100000 steps with 1220 reset in 121 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 90 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 3255 steps (2 resets) in 5 ms. (542 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 80 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 83 ms :[(NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 105 ms :[(NOT p0), (NOT p0), (NOT p0)]
// Phase 1: matrix 18 rows 20 cols
[2024-05-21 13:06:48] [INFO ] Computed 3 invariants in 4 ms
[2024-05-21 13:06:48] [INFO ] [Real]Absence check using 3 positive place invariants in 0 ms returned sat
[2024-05-21 13:06:48] [INFO ] [Real]Absence check using state equation in 6 ms returned sat
[2024-05-21 13:06:48] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 13:06:48] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-21 13:06:48] [INFO ] [Nat]Absence check using state equation in 7 ms returned sat
[2024-05-21 13:06:48] [INFO ] Computed and/alt/rep : 17/17/17 causal constraints (skipped 0 transitions) in 2 ms.
[2024-05-21 13:06:48] [INFO ] Added : 14 causal constraints over 3 iterations in 10 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 1 out of 20 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 20/20 places, 18/18 transitions.
Applied a total of 0 rules in 1 ms. Remains 20 /20 variables (removed 0) and now considering 18/18 (removed 0) transitions.
[2024-05-21 13:06:48] [INFO ] Invariant cache hit.
[2024-05-21 13:06:48] [INFO ] Implicit Places using invariants in 30 ms returned []
[2024-05-21 13:06:48] [INFO ] Invariant cache hit.
[2024-05-21 13:06:48] [INFO ] Implicit Places using invariants and state equation in 35 ms returned []
Implicit Place search using SMT with State Equation took 82 ms to find 0 implicit places.
Running 17 sub problems to find dead transitions.
[2024-05-21 13:06:48] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/19 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/19 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 2 (OVERLAPS) 1/20 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/20 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 4 (OVERLAPS) 18/38 variables, 20/23 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/38 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 6 (OVERLAPS) 0/38 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 17 unsolved
No progress, stopping.
After SMT solving in domain Real declared 38/38 variables, and 23 constraints, problems are : Problem set: 0 solved, 17 unsolved in 121 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 20/20 constraints, PredecessorRefiner: 17/17 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 17 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/19 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/19 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 2 (OVERLAPS) 1/20 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/20 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 4 (OVERLAPS) 18/38 variables, 20/23 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/38 variables, 17/40 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/38 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 7 (OVERLAPS) 0/38 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 17 unsolved
No progress, stopping.
After SMT solving in domain Int declared 38/38 variables, and 40 constraints, problems are : Problem set: 0 solved, 17 unsolved in 110 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 20/20 constraints, PredecessorRefiner: 17/17 constraints, Known Traps: 0/0 constraints]
After SMT, in 239ms problems are : Problem set: 0 solved, 17 unsolved
Search for dead transitions found 0 dead transitions in 240ms
Finished structural reductions in LTL mode , in 1 iterations and 324 ms. Remains : 20/20 places, 18/18 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(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 119 ms :[(NOT p0), (NOT p0), (NOT p0)]
RANDOM walk for 2673 steps (1 resets) in 5 ms. (445 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 94 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 119 ms :[(NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 106 ms :[(NOT p0), (NOT p0), (NOT p0)]
[2024-05-21 13:06:49] [INFO ] Invariant cache hit.
[2024-05-21 13:06:49] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-21 13:06:49] [INFO ] [Real]Absence check using state equation in 5 ms returned sat
[2024-05-21 13:06:49] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 13:06:49] [INFO ] [Nat]Absence check using 3 positive place invariants in 0 ms returned sat
[2024-05-21 13:06:49] [INFO ] [Nat]Absence check using state equation in 5 ms returned sat
[2024-05-21 13:06:49] [INFO ] Computed and/alt/rep : 17/17/17 causal constraints (skipped 0 transitions) in 1 ms.
[2024-05-21 13:06:49] [INFO ] Added : 14 causal constraints over 3 iterations in 9 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 109 ms :[(NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 1208 reset in 92 ms.
Product exploration explored 100000 steps with 1218 reset in 101 ms.
Applying partial POR strategy [true, false, false]
Stuttering acceptance computed with spot in 114 ms :[(NOT p0), (NOT p0), (NOT p0)]
Support contains 1 out of 20 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 20/20 places, 18/18 transitions.
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 7 rules applied. Total rules applied 7 place count 20 transition count 18
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 4 Pre rules applied. Total rules applied 7 place count 20 transition count 18
Deduced a syphon composed of 11 places in 0 ms
Iterating global reduction 1 with 4 rules applied. Total rules applied 11 place count 20 transition count 18
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 15 place count 16 transition count 14
Deduced a syphon composed of 7 places in 0 ms
Iterating global reduction 1 with 4 rules applied. Total rules applied 19 place count 16 transition count 14
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 21 place count 16 transition count 14
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 22 place count 15 transition count 13
Deduced a syphon composed of 8 places in 0 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 23 place count 15 transition count 13
Deduced a syphon composed of 8 places in 0 ms
Applied a total of 23 rules in 8 ms. Remains 15 /20 variables (removed 5) and now considering 13/18 (removed 5) transitions.
[2024-05-21 13:06:49] [INFO ] Redundant transitions in 0 ms returned []
Running 12 sub problems to find dead transitions.
// Phase 1: matrix 13 rows 15 cols
[2024-05-21 13:06:49] [INFO ] Computed 3 invariants in 0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/14 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/14 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 2 (OVERLAPS) 1/15 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/15 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 12 unsolved
Problem TDEAD0 is UNSAT
Problem TDEAD1 is UNSAT
Problem TDEAD2 is UNSAT
Problem TDEAD3 is UNSAT
Problem TDEAD6 is UNSAT
Problem TDEAD9 is UNSAT
Problem TDEAD10 is UNSAT
Problem TDEAD12 is UNSAT
At refinement iteration 4 (OVERLAPS) 13/28 variables, 15/18 constraints. Problems are: Problem set: 8 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/28 variables, 0/18 constraints. Problems are: Problem set: 8 solved, 4 unsolved
At refinement iteration 6 (OVERLAPS) 0/28 variables, 0/18 constraints. Problems are: Problem set: 8 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 28/28 variables, and 18 constraints, problems are : Problem set: 8 solved, 4 unsolved in 67 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 15/15 constraints, PredecessorRefiner: 12/12 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 8 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 8 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 9/15 variables, 3/3 constraints. Problems are: Problem set: 8 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/15 variables, 0/3 constraints. Problems are: Problem set: 8 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 13/28 variables, 15/18 constraints. Problems are: Problem set: 8 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/28 variables, 4/22 constraints. Problems are: Problem set: 8 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/28 variables, 0/22 constraints. Problems are: Problem set: 8 solved, 4 unsolved
At refinement iteration 6 (OVERLAPS) 0/28 variables, 0/22 constraints. Problems are: Problem set: 8 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 28/28 variables, and 22 constraints, problems are : Problem set: 8 solved, 4 unsolved in 65 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 15/15 constraints, PredecessorRefiner: 4/12 constraints, Known Traps: 0/0 constraints]
After SMT, in 136ms problems are : Problem set: 8 solved, 4 unsolved
Search for dead transitions found 8 dead transitions in 137ms
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 : 15/20 places, 5/18 transitions.
Graph (complete) has 13 edges and 15 vertex of which 7 are kept as prefixes of interest. Removing 8 places using SCC suffix rule.0 ms
Discarding 8 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 1 ms. Remains 7 /15 variables (removed 8) and now considering 5/5 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 7/20 places, 5/18 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 152 ms. Remains : 7/20 places, 5/18 transitions.
Built C files in :
/tmp/ltsmin11920841355227455343
[2024-05-21 13:06:49] [INFO ] Built C files in 1ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11920841355227455343
Running compilation step : cd /tmp/ltsmin11920841355227455343;'/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 86 ms.
Running link step : cd /tmp/ltsmin11920841355227455343;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 29 ms.
Running LTSmin : cd /tmp/ltsmin11920841355227455343;'/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/stateBased11782560158283837455.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 1 out of 20 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 20/20 places, 18/18 transitions.
Applied a total of 0 rules in 1 ms. Remains 20 /20 variables (removed 0) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 20 cols
[2024-05-21 13:07:04] [INFO ] Computed 3 invariants in 1 ms
[2024-05-21 13:07:04] [INFO ] Implicit Places using invariants in 24 ms returned []
[2024-05-21 13:07:04] [INFO ] Invariant cache hit.
[2024-05-21 13:07:04] [INFO ] Implicit Places using invariants and state equation in 26 ms returned []
Implicit Place search using SMT with State Equation took 66 ms to find 0 implicit places.
Running 17 sub problems to find dead transitions.
[2024-05-21 13:07:04] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/19 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/19 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 2 (OVERLAPS) 1/20 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/20 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 4 (OVERLAPS) 18/38 variables, 20/23 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/38 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 6 (OVERLAPS) 0/38 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 17 unsolved
No progress, stopping.
After SMT solving in domain Real declared 38/38 variables, and 23 constraints, problems are : Problem set: 0 solved, 17 unsolved in 135 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 20/20 constraints, PredecessorRefiner: 17/17 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 17 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/19 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/19 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 2 (OVERLAPS) 1/20 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/20 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 4 (OVERLAPS) 18/38 variables, 20/23 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/38 variables, 17/40 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/38 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 7 (OVERLAPS) 0/38 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 17 unsolved
No progress, stopping.
After SMT solving in domain Int declared 38/38 variables, and 40 constraints, problems are : Problem set: 0 solved, 17 unsolved in 116 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 20/20 constraints, PredecessorRefiner: 17/17 constraints, Known Traps: 0/0 constraints]
After SMT, in 265ms problems are : Problem set: 0 solved, 17 unsolved
Search for dead transitions found 0 dead transitions in 267ms
Finished structural reductions in LTL mode , in 1 iterations and 335 ms. Remains : 20/20 places, 18/18 transitions.
Built C files in :
/tmp/ltsmin7948531564525680433
[2024-05-21 13:07:05] [INFO ] Built C files in 6ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7948531564525680433
Running compilation step : cd /tmp/ltsmin7948531564525680433;'/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/ltsmin7948531564525680433;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 31 ms.
Running LTSmin : cd /tmp/ltsmin7948531564525680433;'/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/stateBased4250092493487443647.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-21 13:07:20] [INFO ] Flatten gal took : 3 ms
[2024-05-21 13:07:20] [INFO ] Flatten gal took : 1 ms
[2024-05-21 13:07:20] [INFO ] Time to serialize gal into /tmp/LTL6636083707440560025.gal : 1 ms
[2024-05-21 13:07:20] [INFO ] Time to serialize properties into /tmp/LTL3385489956110396396.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/LTL6636083707440560025.gal' '-t' 'CGAL' '-hoa' '/tmp/aut7501827952725300758.hoa' '-atoms' '/tmp/LTL3385489956110396396.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...317
Loading property file /tmp/LTL3385489956110396396.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut7501827952725300758.hoa
Detected timeout of ITS tools.
[2024-05-21 13:07:35] [INFO ] Flatten gal took : 2 ms
[2024-05-21 13:07:35] [INFO ] Flatten gal took : 1 ms
[2024-05-21 13:07:35] [INFO ] Time to serialize gal into /tmp/LTL13729827943868942532.gal : 1 ms
[2024-05-21 13:07:35] [INFO ] Time to serialize properties into /tmp/LTL723218307106574978.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/LTL13729827943868942532.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL723218307106574978.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...275
Read 1 LTL properties
Checking formula 0 : !((X(X(F("(SpA>=1)")))))
Formula 0 simplified : XXG!"(SpA>=1)"
Detected timeout of ITS tools.
[2024-05-21 13:07:50] [INFO ] Flatten gal took : 2 ms
[2024-05-21 13:07:50] [INFO ] Applying decomposition
[2024-05-21 13:07:50] [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/graph5513996334513348500.txt' '-o' '/tmp/graph5513996334513348500.bin' '-w' '/tmp/graph5513996334513348500.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph5513996334513348500.bin' '-l' '-1' '-v' '-w' '/tmp/graph5513996334513348500.weights' '-q' '0' '-e' '0.001'
[2024-05-21 13:07:50] [INFO ] Decomposing Gal with order
[2024-05-21 13:07:50] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 13:07:50] [INFO ] Removed a total of 1 redundant transitions.
[2024-05-21 13:07:50] [INFO ] Flatten gal took : 3 ms
[2024-05-21 13:07:50] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 0 ms.
[2024-05-21 13:07:50] [INFO ] Time to serialize gal into /tmp/LTL8644663666631578361.gal : 1 ms
[2024-05-21 13:07:50] [INFO ] Time to serialize properties into /tmp/LTL5404035876249830001.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/LTL8644663666631578361.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL5404035876249830001.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 : !((X(X(F("(u0.SpA>=1)")))))
Formula 0 simplified : XXG!"(u0.SpA>=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
Detected timeout of ITS tools.
Treatment of property ClientsAndServers-PT-N0010P1-LTLCardinality-08 finished in 78136 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 23 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 23/23 places, 18/18 transitions.
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 4 rules applied. Total rules applied 4 place count 23 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 9 place count 19 transition count 13
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 10 place count 18 transition count 13
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
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 16 place count 15 transition count 10
Discarding 2 places :
Implicit places reduction removed 2 places
Iterating post reduction 3 with 2 rules applied. Total rules applied 18 place count 13 transition count 10
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 18 place count 13 transition count 8
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 22 place count 11 transition count 8
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 4 with 2 rules applied. Total rules applied 24 place count 10 transition count 7
Applied a total of 24 rules in 5 ms. Remains 10 /23 variables (removed 13) and now considering 7/18 (removed 11) transitions.
// Phase 1: matrix 7 rows 10 cols
[2024-05-21 13:08:05] [INFO ] Computed 4 invariants in 0 ms
[2024-05-21 13:08:05] [INFO ] Implicit Places using invariants in 25 ms returned [6, 9]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 32 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 8/23 places, 7/18 transitions.
Applied a total of 0 rules in 1 ms. Remains 8 /8 variables (removed 0) and now considering 7/7 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 38 ms. Remains : 8/23 places, 7/18 transitions.
Stuttering acceptance computed with spot in 35 ms :[(NOT p0)]
Running random walk in product with property : ClientsAndServers-PT-N0010P1-LTLCardinality-09
Product exploration explored 100000 steps with 6 reset in 131 ms.
Stack based approach found an accepted trace after 7 steps with 0 reset with depth 8 and stack size 8 in 0 ms.
FORMULA ClientsAndServers-PT-N0010P1-LTLCardinality-09 FALSE TECHNIQUES STACK_TEST
Treatment of property ClientsAndServers-PT-N0010P1-LTLCardinality-09 finished in 235 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 1 out of 23 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 23/23 places, 18/18 transitions.
Applied a total of 0 rules in 0 ms. Remains 23 /23 variables (removed 0) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 23 cols
[2024-05-21 13:08:05] [INFO ] Computed 6 invariants in 1 ms
[2024-05-21 13:08:05] [INFO ] Implicit Places using invariants in 92 ms returned [14, 19, 21]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 93 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 20/23 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 94 ms. Remains : 20/23 places, 18/18 transitions.
Stuttering acceptance computed with spot in 67 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : ClientsAndServers-PT-N0010P1-LTLCardinality-14
Entered a terminal (fully accepting) state of product in 496 steps with 0 reset in 1 ms.
FORMULA ClientsAndServers-PT-N0010P1-LTLCardinality-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ClientsAndServers-PT-N0010P1-LTLCardinality-14 finished in 173 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)))))'
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-N0010P1-LTLCardinality-08
Stuttering acceptance computed with spot in 92 ms :[(NOT p0), (NOT p0), (NOT p0)]
Support contains 1 out of 23 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 23/23 places, 18/18 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 23 transition count 12
Reduce places removed 6 places and 0 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 1 with 7 rules applied. Total rules applied 13 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 13 place count 16 transition count 11
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 15 place count 15 transition count 11
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 21 place count 12 transition count 8
Applied a total of 21 rules in 3 ms. Remains 12 /23 variables (removed 11) and now considering 8/18 (removed 10) transitions.
// Phase 1: matrix 8 rows 12 cols
[2024-05-21 13:08:06] [INFO ] Computed 5 invariants in 0 ms
[2024-05-21 13:08:06] [INFO ] Implicit Places using invariants in 29 ms returned [7, 10]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 31 ms to find 2 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 10/23 places, 8/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 6
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 6
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 6 place count 7 transition count 5
Applied a total of 6 rules in 3 ms. Remains 7 /10 variables (removed 3) and now considering 5/8 (removed 3) transitions.
// Phase 1: matrix 5 rows 7 cols
[2024-05-21 13:08:06] [INFO ] Computed 3 invariants in 1 ms
[2024-05-21 13:08:06] [INFO ] Implicit Places using invariants in 19 ms returned [6]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 28 ms to find 1 implicit places.
Starting structural reductions in LI_LTL mode, iteration 2 : 6/23 places, 5/18 transitions.
Applied a total of 0 rules in 1 ms. Remains 6 /6 variables (removed 0) and now considering 5/5 (removed 0) transitions.
Finished structural reductions in LI_LTL mode , in 3 iterations and 66 ms. Remains : 6/23 places, 5/18 transitions.
Running random walk in product with property : ClientsAndServers-PT-N0010P1-LTLCardinality-08
Product exploration explored 100000 steps with 10208 reset in 55 ms.
Product exploration explored 100000 steps with 10222 reset in 55 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 123 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 84 ms :[(NOT p0), (NOT p0), (NOT p0)]
RANDOM walk for 316 steps (0 resets) in 4 ms. (63 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 73 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 95 ms :[(NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 91 ms :[(NOT p0), (NOT p0), (NOT p0)]
// Phase 1: matrix 5 rows 6 cols
[2024-05-21 13:08:06] [INFO ] Computed 2 invariants in 1 ms
[2024-05-21 13:08:06] [INFO ] [Real]Absence check using 2 positive place invariants in 0 ms returned sat
[2024-05-21 13:08:06] [INFO ] [Real]Absence check using state equation in 2 ms returned sat
[2024-05-21 13:08:06] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 13:08:06] [INFO ] [Nat]Absence check using 2 positive place invariants in 0 ms returned sat
[2024-05-21 13:08:06] [INFO ] [Nat]Absence check using state equation in 4 ms returned sat
[2024-05-21 13:08:06] [INFO ] Computed and/alt/rep : 4/4/4 causal constraints (skipped 0 transitions) in 0 ms.
[2024-05-21 13:08:06] [INFO ] Added : 2 causal constraints over 1 iterations in 3 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 1 out of 6 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 6/6 places, 5/5 transitions.
Applied a total of 0 rules in 1 ms. Remains 6 /6 variables (removed 0) and now considering 5/5 (removed 0) transitions.
[2024-05-21 13:08:06] [INFO ] Invariant cache hit.
[2024-05-21 13:08:06] [INFO ] Implicit Places using invariants in 38 ms returned []
[2024-05-21 13:08:06] [INFO ] Invariant cache hit.
[2024-05-21 13:08:06] [INFO ] Implicit Places using invariants and state equation in 33 ms returned []
Implicit Place search using SMT with State Equation took 73 ms to find 0 implicit places.
Running 4 sub problems to find dead transitions.
[2024-05-21 13:08:06] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/6 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (OVERLAPS) 5/11 variables, 6/8 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/11 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (OVERLAPS) 0/11 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 11/11 variables, and 8 constraints, problems are : Problem set: 0 solved, 4 unsolved in 24 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 6/6 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/6 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (OVERLAPS) 5/11 variables, 6/8 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/11 variables, 4/12 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/11 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 0/11 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 11/11 variables, and 12 constraints, problems are : Problem set: 0 solved, 4 unsolved in 36 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 6/6 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
After SMT, in 62ms problems are : Problem set: 0 solved, 4 unsolved
Search for dead transitions found 0 dead transitions in 62ms
Finished structural reductions in LTL mode , in 1 iterations and 136 ms. Remains : 6/6 places, 5/5 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(NOT p0), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 77 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 128 ms :[(NOT p0), (NOT p0), (NOT p0)]
RANDOM walk for 682 steps (2 resets) in 4 ms. (136 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 131 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 90 ms :[(NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 121 ms :[(NOT p0), (NOT p0), (NOT p0)]
[2024-05-21 13:08:07] [INFO ] Invariant cache hit.
[2024-05-21 13:08:07] [INFO ] [Real]Absence check using 2 positive place invariants in 0 ms returned sat
[2024-05-21 13:08:07] [INFO ] [Real]Absence check using state equation in 2 ms returned sat
[2024-05-21 13:08:07] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 13:08:07] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-21 13:08:07] [INFO ] [Nat]Absence check using state equation in 2 ms returned sat
[2024-05-21 13:08:07] [INFO ] Computed and/alt/rep : 4/4/4 causal constraints (skipped 0 transitions) in 1 ms.
[2024-05-21 13:08:07] [INFO ] Added : 2 causal constraints over 1 iterations in 3 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 78 ms :[(NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 10264 reset in 62 ms.
Product exploration explored 100000 steps with 10228 reset in 56 ms.
Applying partial POR strategy [true, false, false]
Stuttering acceptance computed with spot in 87 ms :[(NOT p0), (NOT p0), (NOT p0)]
Support contains 1 out of 6 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 6/6 places, 5/5 transitions.
Applied a total of 0 rules in 0 ms. Remains 6 /6 variables (removed 0) and now considering 5/5 (removed 0) transitions.
[2024-05-21 13:08:07] [INFO ] Redundant transitions in 0 ms returned []
Running 4 sub problems to find dead transitions.
[2024-05-21 13:08:07] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/6 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (OVERLAPS) 5/11 variables, 6/8 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/11 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (OVERLAPS) 0/11 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 11/11 variables, and 8 constraints, problems are : Problem set: 0 solved, 4 unsolved in 30 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 6/6 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/6 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (OVERLAPS) 5/11 variables, 6/8 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/11 variables, 4/12 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/11 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 0/11 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 11/11 variables, and 12 constraints, problems are : Problem set: 0 solved, 4 unsolved in 38 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 6/6 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
After SMT, in 87ms problems are : Problem set: 0 solved, 4 unsolved
Search for dead transitions found 0 dead transitions in 87ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 92 ms. Remains : 6/6 places, 5/5 transitions.
Built C files in :
/tmp/ltsmin7327889086740077021
[2024-05-21 13:08:08] [INFO ] Built C files in 1ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7327889086740077021
Running compilation step : cd /tmp/ltsmin7327889086740077021;'/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 74 ms.
Running link step : cd /tmp/ltsmin7327889086740077021;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 30 ms.
Running LTSmin : cd /tmp/ltsmin7327889086740077021;'/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/stateBased7937685996203953244.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 1 out of 6 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 6/6 places, 5/5 transitions.
Applied a total of 0 rules in 0 ms. Remains 6 /6 variables (removed 0) and now considering 5/5 (removed 0) transitions.
[2024-05-21 13:08:23] [INFO ] Invariant cache hit.
[2024-05-21 13:08:23] [INFO ] Implicit Places using invariants in 17 ms returned []
[2024-05-21 13:08:23] [INFO ] Invariant cache hit.
[2024-05-21 13:08:23] [INFO ] Implicit Places using invariants and state equation in 17 ms returned []
Implicit Place search using SMT with State Equation took 35 ms to find 0 implicit places.
Running 4 sub problems to find dead transitions.
[2024-05-21 13:08:23] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/6 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (OVERLAPS) 5/11 variables, 6/8 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/11 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (OVERLAPS) 0/11 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 11/11 variables, and 8 constraints, problems are : Problem set: 0 solved, 4 unsolved in 39 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 6/6 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/6 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (OVERLAPS) 5/11 variables, 6/8 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/11 variables, 4/12 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/11 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 0/11 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 11/11 variables, and 12 constraints, problems are : Problem set: 0 solved, 4 unsolved in 49 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 6/6 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
After SMT, in 89ms problems are : Problem set: 0 solved, 4 unsolved
Search for dead transitions found 0 dead transitions in 90ms
Finished structural reductions in LTL mode , in 1 iterations and 125 ms. Remains : 6/6 places, 5/5 transitions.
Built C files in :
/tmp/ltsmin3194385324050232909
[2024-05-21 13:08:23] [INFO ] Built C files in 0ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3194385324050232909
Running compilation step : cd /tmp/ltsmin3194385324050232909;'/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 64 ms.
Running link step : cd /tmp/ltsmin3194385324050232909;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 30 ms.
Running LTSmin : cd /tmp/ltsmin3194385324050232909;'/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/stateBased15426992467475893170.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-21 13:08:38] [INFO ] Flatten gal took : 2 ms
[2024-05-21 13:08:38] [INFO ] Flatten gal took : 1 ms
[2024-05-21 13:08:38] [INFO ] Time to serialize gal into /tmp/LTL15530637267271412635.gal : 1 ms
[2024-05-21 13:08:38] [INFO ] Time to serialize properties into /tmp/LTL1362598752961189776.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/LTL15530637267271412635.gal' '-t' 'CGAL' '-hoa' '/tmp/aut16485157360384486286.hoa' '-atoms' '/tmp/LTL1362598752961189776.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/LTL1362598752961189776.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut16485157360384486286.hoa
Reverse transition relation is NOT exact ! Due to transitions t13.t14, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/tota...166
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
64 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,0.644578,31144,1,0,821,96578,31,661,333,100307,1558
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
Treatment of property ClientsAndServers-PT-N0010P1-LTLCardinality-08 finished in 33040 ms.
Length sensitive decision was in the wrong direction : Shortening insensitive + false
[2024-05-21 13:08:38] [INFO ] Flatten gal took : 3 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin7432603465402731304
[2024-05-21 13:08:38] [INFO ] Computing symmetric may disable matrix : 18 transitions.
[2024-05-21 13:08:38] [INFO ] Computation of Complete disable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 13:08:38] [INFO ] Computing symmetric may enable matrix : 18 transitions.
[2024-05-21 13:08:38] [INFO ] Applying decomposition
[2024-05-21 13:08:38] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 13:08:38] [INFO ] Computing Do-Not-Accords matrix : 18 transitions.
[2024-05-21 13:08:38] [INFO ] Flatten gal took : 2 ms
[2024-05-21 13:08:38] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 13:08:38] [INFO ] Built C files in 5ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7432603465402731304
Running compilation step : cd /tmp/ltsmin7432603465402731304;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '360' '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'
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/graph12633063599541930566.txt' '-o' '/tmp/graph12633063599541930566.bin' '-w' '/tmp/graph12633063599541930566.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph12633063599541930566.bin' '-l' '-1' '-v' '-w' '/tmp/graph12633063599541930566.weights' '-q' '0' '-e' '0.001'
[2024-05-21 13:08:38] [INFO ] Decomposing Gal with order
[2024-05-21 13:08:38] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 13:08:38] [INFO ] Removed a total of 1 redundant transitions.
[2024-05-21 13:08:38] [INFO ] Flatten gal took : 3 ms
[2024-05-21 13:08:38] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 0 ms.
[2024-05-21 13:08:38] [INFO ] Time to serialize gal into /tmp/LTLCardinality7043980435876819628.gal : 1 ms
[2024-05-21 13:08:38] [INFO ] Time to serialize properties into /tmp/LTLCardinality8932733358637827023.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/LTLCardinality7043980435876819628.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality8932733358637827023.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...297
Read 2 LTL properties
Checking formula 0 : !((G(F(("(gu1.CwA>gu1.SF)")||(G("(gi1.gi1.gu2.Ci<2)"))))))
Formula 0 simplified : G(F!"(gi1.gi1.gu2.Ci<2)" & FG!"(gu1.CwA>gu1.SF)")
Compilation finished in 104 ms.
Running link step : cd /tmp/ltsmin7432603465402731304;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 26 ms.
Running LTSmin : cd /tmp/ltsmin7432603465402731304;'/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' '[](<>(((LTLAPp0==true)||[]((LTLAPp1==true)))))' '--buchi-type=spotba'
pins2lts-mc-linux64, 0.000: Registering PINS so language module
pins2lts-mc-linux64( 0/ 8), 0.004: Loading model from ./gal.so
pins2lts-mc-linux64( 2/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 2/ 8), 0.001: loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.002: library has no initializer
pins2lts-mc-linux64( 3/ 8), 0.002: loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.002: library has no initializer
pins2lts-mc-linux64( 1/ 8), 0.002: 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( 1/ 8), 0.002: completed loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.002: LTL layer: formula: [](<>(((LTLAPp0==true)||[]((LTLAPp1==true)))))
pins2lts-mc-linux64( 2/ 8), 0.003: "[](<>(((LTLAPp0==true)||[]((LTLAPp1==true)))))" is not a file, parsing as formula...
pins2lts-mc-linux64( 2/ 8), 0.003: Using Spin LTL semantics
pins2lts-mc-linux64( 4/ 8), 0.003: library has no initializer
pins2lts-mc-linux64( 4/ 8), 0.003: loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.003: library has no initializer
pins2lts-mc-linux64( 4/ 8), 0.003: completed loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.003: loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.003: completed loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.002: library has no initializer
pins2lts-mc-linux64( 7/ 8), 0.002: loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.002: completed loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.003: library has no initializer
pins2lts-mc-linux64( 0/ 8), 0.007: library has no initializer
pins2lts-mc-linux64( 0/ 8), 0.007: loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.003: loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.007: completed loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.003: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.007: Initializing POR dependencies: labels 21, guards 18
pins2lts-mc-linux64( 0/ 8), 0.018: Forcing use of the an ignoring proviso (cndfs)
pins2lts-mc-linux64( 0/ 8), 0.024: There are 22 state labels and 1 edge labels
pins2lts-mc-linux64( 0/ 8), 0.024: State length is 24, there are 24 groups
pins2lts-mc-linux64( 0/ 8), 0.024: Running cndfs using 8 cores
pins2lts-mc-linux64( 0/ 8), 0.024: Using a tree table with 2^27 elements
pins2lts-mc-linux64( 0/ 8), 0.024: Successor permutation: dynamic
pins2lts-mc-linux64( 0/ 8), 0.024: Visible groups: 0 / 24, labels: 2 / 22
pins2lts-mc-linux64( 0/ 8), 0.024: POR cycle proviso: cndfs (ltl)
pins2lts-mc-linux64( 0/ 8), 0.024: Global bits: 2, count bits: 2, local bits: 0
pins2lts-mc-linux64( 2/ 8), 0.044: [Blue] ~114 levels ~960 states ~1608 transitions
pins2lts-mc-linux64( 2/ 8), 0.061: [Blue] ~217 levels ~1920 states ~2640 transitions
pins2lts-mc-linux64( 2/ 8), 0.092: [Blue] ~422 levels ~3840 states ~4688 transitions
pins2lts-mc-linux64( 2/ 8), 0.178: [Blue] ~526 levels ~7680 states ~9792 transitions
pins2lts-mc-linux64( 1/ 8), 0.277: [Blue] ~526 levels ~15360 states ~21152 transitions
pins2lts-mc-linux64( 1/ 8), 0.581: [Blue] ~526 levels ~30720 states ~41664 transitions
pins2lts-mc-linux64( 1/ 8), 0.899: [Blue] ~526 levels ~61440 states ~82376 transitions
pins2lts-mc-linux64( 1/ 8), 1.743: [Blue] ~2194 levels ~122880 states ~173776 transitions
pins2lts-mc-linux64( 1/ 8), 3.577: [Blue] ~16542 levels ~245760 states ~405464 transitions
pins2lts-mc-linux64( 6/ 8), 6.209: [Blue] ~34876 levels ~491520 states ~990600 transitions
pins2lts-mc-linux64( 7/ 8), 9.867: [Blue] ~5764 levels ~983040 states ~1312680 transitions
pins2lts-mc-linux64( 7/ 8), 14.403: [Blue] ~23237 levels ~1966080 states ~2531576 transitions
pins2lts-mc-linux64( 1/ 8), 19.281: [Blue] ~436360 levels ~3932160 states ~6066952 transitions
pins2lts-mc-linux64( 3/ 8), 27.988: [Blue] ~975847 levels ~7864320 states ~14003384 transitions
pins2lts-mc-linux64( 3/ 8), 45.813: [Blue] ~1958025 levels ~15728640 states ~27460384 transitions
pins2lts-mc-linux64( 3/ 8), 90.502: [Blue] ~3921855 levels ~31457280 states ~53397792 transitions
pins2lts-mc-linux64( 3/ 8), 201.512: [Blue] ~7837919 levels ~62914560 states ~103616304 transitions
pins2lts-mc-linux64( 0/ 8), 232.640: Error: tree leafs table full! Change -s/--ratio.
pins2lts-mc-linux64( 0/ 8), 232.800:
pins2lts-mc-linux64( 0/ 8), 232.800: Explored 56769238 states 69730056 transitions, fanout: 1.228
pins2lts-mc-linux64( 0/ 8), 232.800: Total exploration time 232.720 sec (232.590 sec minimum, 232.621 sec on average)
pins2lts-mc-linux64( 0/ 8), 232.800: States per second: 243938, Transitions per second: 299631
pins2lts-mc-linux64( 0/ 8), 232.800:
pins2lts-mc-linux64( 0/ 8), 232.800: State space has 68661554 states, 862825 are accepting
pins2lts-mc-linux64( 0/ 8), 232.800: cndfs_1 (permutation: dynamic) stats:
pins2lts-mc-linux64( 0/ 8), 232.800: blue states: 56769238 (82.68%), transitions: 0 (per worker)
pins2lts-mc-linux64( 0/ 8), 232.800: red states: 0 (0.00%), bogus: 0 (0.00%), transitions: 0, waits: 0 (0.00 sec)
pins2lts-mc-linux64( 0/ 8), 232.800: all-red states: 896082 (1.31%), bogus 65627 (0.10%)
pins2lts-mc-linux64( 0/ 8), 232.800:
pins2lts-mc-linux64( 0/ 8), 232.800: Total memory used for local state coloring: 782.2MB
pins2lts-mc-linux64( 0/ 8), 232.800:
pins2lts-mc-linux64( 0/ 8), 232.800: Queue width: 8B, total height: 51263339, memory: 391.11MB
pins2lts-mc-linux64( 0/ 8), 232.800: Tree memory: 779.8MB, 11.9 B/state, compr.: 12.2%
pins2lts-mc-linux64( 0/ 8), 232.800: Tree fill ratio (roots/leafs): 51.0%/99.0%
pins2lts-mc-linux64( 0/ 8), 232.800: Stored 18 string chucks using 0MB
pins2lts-mc-linux64( 0/ 8), 232.800: Total memory used for chunk indexing: 0MB
pins2lts-mc-linux64( 0/ 8), 232.800: Est. total memory use: 1171.0MB (~1415.1MB paged-in)
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin7432603465402731304;'/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' '[](<>(((LTLAPp0==true)||[]((LTLAPp1==true)))))' '--buchi-type=spotba'
255
java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin7432603465402731304;'/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' '[](<>(((LTLAPp0==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)
ITS-tools command line returned an error code 137
[2024-05-21 13:25:03] [INFO ] Flatten gal took : 4 ms
[2024-05-21 13:25:03] [INFO ] Time to serialize gal into /tmp/LTLCardinality8905320307446289919.gal : 1 ms
[2024-05-21 13:25:03] [INFO ] Time to serialize properties into /tmp/LTLCardinality15330356856999159548.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/LTLCardinality8905320307446289919.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality15330356856999159548.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 2 LTL properties
Checking formula 0 : !((G(F(("(CwA>SF)")||(G("(Ci<2)"))))))
Formula 0 simplified : G(F!"(Ci<2)" & FG!"(CwA>SF)")
Detected timeout of ITS tools.
[2024-05-21 13:46:15] [INFO ] Flatten gal took : 2 ms
[2024-05-21 13:46:15] [INFO ] Input system was already deterministic with 18 transitions.
[2024-05-21 13:46:15] [INFO ] Transformed 23 places.
[2024-05-21 13:46:15] [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 13:46:15] [INFO ] Time to serialize gal into /tmp/LTLCardinality17839050932715709819.gal : 7 ms
[2024-05-21 13:46:15] [INFO ] Time to serialize properties into /tmp/LTLCardinality8932464536435415009.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/LTLCardinality17839050932715709819.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality8932464536435415009.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...343
Read 2 LTL properties
Successfully loaded order from file /home/mcc/execution/model.ord
Checking formula 0 : !((G(F(("(CwA>SF)")||(G("(Ci<2)"))))))
Formula 0 simplified : G(F!"(Ci<2)" & FG!"(CwA>SF)")
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
+ [[ LTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLCardinality -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-N0010P1"
export BK_EXAMINATION="LTLCardinality"
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-N0010P1, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r070-tall-171620505800427"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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

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