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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 464K
-rw-r--r-- 1 mcc users 7.2K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 80K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.8K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 56K 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.7K Apr 22 14:33 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Apr 22 14:33 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Apr 22 14:33 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Apr 22 14:33 LTLFireability.xml
-rw-r--r-- 1 mcc users 7.9K Apr 12 23:09 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 78K Apr 12 23:09 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 12K Apr 12 23:09 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 111K Apr 12 23:09 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Apr 22 14:33 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Apr 22 14:33 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 8 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 9.2K May 18 16:42 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1716298535191

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ClientsAndServers-PT-N0010P2
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202405141337
[2024-05-21 13:35:36] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-21 13:35:36] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-21 13:35:36] [INFO ] Load time of PNML (sax parser for PT used): 40 ms
[2024-05-21 13:35:36] [INFO ] Transformed 25 places.
[2024-05-21 13:35:36] [INFO ] Transformed 18 transitions.
[2024-05-21 13:35:36] [INFO ] Parsed PT model containing 25 places and 18 transitions and 54 arcs in 138 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 11 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 4 formulas.
FORMULA ClientsAndServers-PT-N0010P2-LTLFireability-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ClientsAndServers-PT-N0010P2-LTLFireability-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ClientsAndServers-PT-N0010P2-LTLFireability-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ClientsAndServers-PT-N0010P2-LTLFireability-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Initial state reduction rules removed 1 formulas.
FORMULA ClientsAndServers-PT-N0010P2-LTLFireability-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 19 out of 25 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 25/25 places, 18/18 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 24 transition count 18
Applied a total of 1 rules in 13 ms. Remains 24 /25 variables (removed 1) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 24 cols
[2024-05-21 13:35:36] [INFO ] Computed 7 invariants in 7 ms
[2024-05-21 13:35:36] [INFO ] Implicit Places using invariants in 124 ms returned []
[2024-05-21 13:35:36] [INFO ] Invariant cache hit.
[2024-05-21 13:35:36] [INFO ] Implicit Places using invariants and state equation in 43 ms returned []
Implicit Place search using SMT with State Equation took 196 ms to find 0 implicit places.
Running 17 sub problems to find dead transitions.
[2024-05-21 13:35:36] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/23 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/23 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/23 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 3 (OVERLAPS) 1/24 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/24 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 5 (OVERLAPS) 18/42 variables, 24/31 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/42 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 7 (OVERLAPS) 0/42 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 17 unsolved
No progress, stopping.
After SMT solving in domain Real declared 42/42 variables, and 31 constraints, problems are : Problem set: 0 solved, 17 unsolved in 244 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 24/24 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/23 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/23 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/23 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 3 (OVERLAPS) 1/24 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/24 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 5 (OVERLAPS) 18/42 variables, 24/31 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/42 variables, 17/48 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/42 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 8 (OVERLAPS) 0/42 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 17 unsolved
No progress, stopping.
After SMT solving in domain Int declared 42/42 variables, and 48 constraints, problems are : Problem set: 0 solved, 17 unsolved in 191 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 24/24 constraints, PredecessorRefiner: 17/17 constraints, Known Traps: 0/0 constraints]
After SMT, in 461ms problems are : Problem set: 0 solved, 17 unsolved
Search for dead transitions found 0 dead transitions in 478ms
Starting structural reductions in LTL mode, iteration 1 : 24/25 places, 18/18 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 706 ms. Remains : 24/25 places, 18/18 transitions.
Support contains 19 out of 24 places after structural reductions.
[2024-05-21 13:35:37] [INFO ] Flatten gal took : 16 ms
[2024-05-21 13:35:37] [INFO ] Flatten gal took : 5 ms
[2024-05-21 13:35:37] [INFO ] Input system was already deterministic with 18 transitions.
Reduction of identical properties reduced properties to check from 15 to 14
RANDOM walk for 16079 steps (7 resets) in 149 ms. (107 steps per ms) remains 0/14 properties
FORMULA ClientsAndServers-PT-N0010P2-LTLFireability-15 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
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(F(p0)))'
Support contains 1 out of 24 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 24/24 places, 18/18 transitions.
Discarding 2 places :
Implicit places reduction removed 2 places
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 8 rules applied. Total rules applied 8 place count 22 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 15 place count 15 transition count 12
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 15 place count 15 transition count 10
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 19 place count 13 transition count 10
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 25 place count 10 transition count 7
Applied a total of 25 rules in 13 ms. Remains 10 /24 variables (removed 14) and now considering 7/18 (removed 11) transitions.
// Phase 1: matrix 7 rows 10 cols
[2024-05-21 13:35:37] [INFO ] Computed 4 invariants in 0 ms
[2024-05-21 13:35:37] [INFO ] Implicit Places using invariants in 61 ms returned [6, 9]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 62 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 8/24 places, 7/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 8 transition count 5
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 6 transition count 5
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 4 place count 6 transition count 4
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 5 transition count 4
Applied a total of 6 rules in 2 ms. Remains 5 /8 variables (removed 3) and now considering 4/7 (removed 3) transitions.
// Phase 1: matrix 4 rows 5 cols
[2024-05-21 13:35:37] [INFO ] Computed 2 invariants in 0 ms
[2024-05-21 13:35:38] [INFO ] Implicit Places using invariants in 17 ms returned []
[2024-05-21 13:35:38] [INFO ] Invariant cache hit.
[2024-05-21 13:35:38] [INFO ] Implicit Places using invariants and state equation in 34 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 : 5/24 places, 4/18 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 129 ms. Remains : 5/24 places, 4/18 transitions.
Stuttering acceptance computed with spot in 259 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ClientsAndServers-PT-N0010P2-LTLFireability-01
Product exploration explored 100000 steps with 13717 reset in 268 ms.
Product exploration explored 100000 steps with 13938 reset in 183 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(NOT p0), (X (NOT p0))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 2 factoid took 104 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 60 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 88 steps (0 resets) in 5 ms. (14 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0), (X (NOT p0))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0)), (F p0)]
Knowledge based reduction with 2 factoid took 154 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 57 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 67 ms :[(NOT p0), (NOT p0)]
[2024-05-21 13:35:39] [INFO ] Invariant cache hit.
[2024-05-21 13:35:39] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-21 13:35:39] [INFO ] [Real]Absence check using state equation in 2 ms returned sat
[2024-05-21 13:35:39] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 13:35:39] [INFO ] [Nat]Absence check using 2 positive place invariants in 0 ms returned sat
[2024-05-21 13:35:39] [INFO ] [Nat]Absence check using state equation in 2 ms returned sat
[2024-05-21 13:35:39] [INFO ] Computed and/alt/rep : 3/3/3 causal constraints (skipped 0 transitions) in 1 ms.
[2024-05-21 13:35:39] [INFO ] Added : 2 causal constraints over 1 iterations in 8 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 1 out of 5 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 5/5 places, 4/4 transitions.
Applied a total of 0 rules in 1 ms. Remains 5 /5 variables (removed 0) and now considering 4/4 (removed 0) transitions.
[2024-05-21 13:35:39] [INFO ] Invariant cache hit.
[2024-05-21 13:35:39] [INFO ] Implicit Places using invariants in 16 ms returned []
[2024-05-21 13:35:39] [INFO ] Invariant cache hit.
[2024-05-21 13:35:39] [INFO ] Implicit Places using invariants and state equation in 24 ms returned []
Implicit Place search using SMT with State Equation took 42 ms to find 0 implicit places.
[2024-05-21 13:35:39] [INFO ] Redundant transitions in 0 ms returned []
Running 3 sub problems to find dead transitions.
[2024-05-21 13:35:39] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/5 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (OVERLAPS) 4/9 variables, 5/7 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/9 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (OVERLAPS) 0/9 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 9/9 variables, and 7 constraints, problems are : Problem set: 0 solved, 3 unsolved in 29 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 5/5 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/5 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (OVERLAPS) 4/9 variables, 5/7 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/9 variables, 3/10 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/9 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 0/9 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 9/9 variables, and 10 constraints, problems are : Problem set: 0 solved, 3 unsolved in 32 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 5/5 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
After SMT, in 64ms problems are : Problem set: 0 solved, 3 unsolved
Search for dead transitions found 0 dead transitions in 64ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 114 ms. Remains : 5/5 places, 4/4 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(NOT p0), (X (NOT p0))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 2 factoid took 89 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 77 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 88 steps (0 resets) in 4 ms. (17 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0), (X (NOT p0))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0)), (F p0)]
Knowledge based reduction with 2 factoid took 163 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 60 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 67 ms :[(NOT p0), (NOT p0)]
[2024-05-21 13:35:39] [INFO ] Invariant cache hit.
[2024-05-21 13:35:39] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-21 13:35:39] [INFO ] [Real]Absence check using state equation in 2 ms returned sat
[2024-05-21 13:35:39] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 13:35:39] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-21 13:35:39] [INFO ] [Nat]Absence check using state equation in 3 ms returned sat
[2024-05-21 13:35:39] [INFO ] Computed and/alt/rep : 3/3/3 causal constraints (skipped 0 transitions) in 1 ms.
[2024-05-21 13:35:39] [INFO ] Added : 2 causal constraints over 1 iterations in 4 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 65 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 14016 reset in 90 ms.
Product exploration explored 100000 steps with 14206 reset in 124 ms.
Built C files in :
/tmp/ltsmin1084339683702191743
[2024-05-21 13:35:40] [INFO ] Computing symmetric may disable matrix : 4 transitions.
[2024-05-21 13:35:40] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 13:35:40] [INFO ] Computing symmetric may enable matrix : 4 transitions.
[2024-05-21 13:35:40] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 13:35:40] [INFO ] Computing Do-Not-Accords matrix : 4 transitions.
[2024-05-21 13:35:40] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 13:35:40] [INFO ] Built C files in 11ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1084339683702191743
Running compilation step : cd /tmp/ltsmin1084339683702191743;'/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 212 ms.
Running link step : cd /tmp/ltsmin1084339683702191743;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 40 ms.
Running LTSmin : cd /tmp/ltsmin1084339683702191743;'/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/stateBased15646129168120353972.hoa' '--buchi-type=spotba'
LTSmin run took 88 ms.
FORMULA ClientsAndServers-PT-N0010P2-LTLFireability-01 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property ClientsAndServers-PT-N0010P2-LTLFireability-01 finished in 2773 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&&X((p0&&G(p1)))))))'
Support contains 3 out of 24 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 24/24 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 22 transition count 18
Applied a total of 2 rules in 2 ms. Remains 22 /24 variables (removed 2) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 22 cols
[2024-05-21 13:35:40] [INFO ] Computed 5 invariants in 2 ms
[2024-05-21 13:35:40] [INFO ] Implicit Places using invariants in 31 ms returned [14, 19]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 32 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 20/24 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 35 ms. Remains : 20/24 places, 18/18 transitions.
Stuttering acceptance computed with spot in 175 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : ClientsAndServers-PT-N0010P2-LTLFireability-02
Product exploration explored 100000 steps with 4 reset in 164 ms.
Product exploration explored 100000 steps with 2 reset in 331 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 (AND p0 (NOT p1))), (X p0), (X (NOT (AND p0 p1))), (X (NOT p1)), (X (X p0)), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : [(X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND p0 p1))), (X (X (NOT (AND p0 p1)))), (X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 7 factoid took 260 ms. Reduced automaton from 4 states, 11 edges and 2 AP (stutter sensitive) to 4 states, 11 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 171 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p1)]
RANDOM walk for 16606 steps (5 resets) in 26 ms. (615 steps per ms) remains 0/5 properties
Knowledge obtained : [(AND p0 p1), (X (AND p0 (NOT p1))), (X p0), (X (NOT (AND p0 p1))), (X (NOT p1)), (X (X p0)), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : [(X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND p0 p1))), (X (X (NOT (AND p0 p1)))), (X (X p1)), (X (X (NOT p1))), (F (NOT p1)), (F (NOT (OR p0 p1))), (F (NOT (OR (NOT p0) p1))), (F (NOT (AND p0 p1))), (F (NOT p0))]
Knowledge based reduction with 7 factoid took 299 ms. Reduced automaton from 4 states, 11 edges and 2 AP (stutter sensitive) to 4 states, 11 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 134 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p1)]
Stuttering acceptance computed with spot in 148 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p1)]
Support contains 3 out of 20 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 20/20 places, 18/18 transitions.
Applied a total of 0 rules in 4 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:35:42] [INFO ] Computed 3 invariants in 2 ms
[2024-05-21 13:35:42] [INFO ] Implicit Places using invariants in 26 ms returned []
[2024-05-21 13:35:42] [INFO ] Invariant cache hit.
[2024-05-21 13:35:42] [INFO ] Implicit Places using invariants and state equation in 29 ms returned []
Implicit Place search using SMT with State Equation took 57 ms to find 0 implicit places.
Running 17 sub problems to find dead transitions.
[2024-05-21 13:35:42] [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 129 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 20/20 constraints, PredecessorRefiner: 17/17 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 17 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/19 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/19 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 2 (OVERLAPS) 1/20 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/20 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 4 (OVERLAPS) 18/38 variables, 20/23 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/38 variables, 17/40 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/38 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 7 (OVERLAPS) 0/38 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 17 unsolved
No progress, stopping.
After SMT solving in domain Int declared 38/38 variables, and 40 constraints, problems are : Problem set: 0 solved, 17 unsolved in 112 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 20/20 constraints, PredecessorRefiner: 17/17 constraints, Known Traps: 0/0 constraints]
After SMT, in 248ms problems are : Problem set: 0 solved, 17 unsolved
Search for dead transitions found 0 dead transitions in 249ms
Finished structural reductions in LTL mode , in 1 iterations and 310 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 p0 p1), (X (AND p0 (NOT p1))), (X p0), (X (NOT (AND p0 p1))), (X (NOT p1)), (X (X p0)), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : [(X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND p0 p1))), (X (X (NOT (AND p0 p1)))), (X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 7 factoid took 182 ms. Reduced automaton from 4 states, 11 edges and 2 AP (stutter sensitive) to 4 states, 11 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 131 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p1)]
RANDOM walk for 29255 steps (13 resets) in 30 ms. (943 steps per ms) remains 0/5 properties
Knowledge obtained : [(AND p0 p1), (X (AND p0 (NOT p1))), (X p0), (X (NOT (AND p0 p1))), (X (NOT p1)), (X (X p0)), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : [(X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND p0 p1))), (X (X (NOT (AND p0 p1)))), (X (X p1)), (X (X (NOT p1))), (F (NOT p1)), (F (NOT (OR p0 p1))), (F (NOT (OR (NOT p0) p1))), (F (NOT (AND p0 p1))), (F (NOT p0))]
Knowledge based reduction with 7 factoid took 410 ms. Reduced automaton from 4 states, 11 edges and 2 AP (stutter sensitive) to 4 states, 11 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 124 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p1)]
Stuttering acceptance computed with spot in 171 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p1)]
Stuttering acceptance computed with spot in 170 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p1)]
Product exploration explored 100000 steps with 2 reset in 140 ms.
Product exploration explored 100000 steps with 0 reset in 245 ms.
Built C files in :
/tmp/ltsmin8898725015809985382
[2024-05-21 13:35:44] [INFO ] Built C files in 3ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8898725015809985382
Running compilation step : cd /tmp/ltsmin8898725015809985382;'/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 107 ms.
Running link step : cd /tmp/ltsmin8898725015809985382;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 34 ms.
Running LTSmin : cd /tmp/ltsmin8898725015809985382;'/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/stateBased14142888767603665510.hoa' '--buchi-type=spotba'
LTSmin run took 165 ms.
FORMULA ClientsAndServers-PT-N0010P2-LTLFireability-02 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property ClientsAndServers-PT-N0010P2-LTLFireability-02 finished in 4223 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(((F(!p0)&&X(!p1))||X(G(!p1))))))'
Support contains 4 out of 24 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 24/24 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 22 transition count 18
Applied a total of 2 rules in 1 ms. Remains 22 /24 variables (removed 2) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 22 cols
[2024-05-21 13:35:44] [INFO ] Computed 5 invariants in 1 ms
[2024-05-21 13:35:44] [INFO ] Implicit Places using invariants in 31 ms returned [14]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 32 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 21/24 places, 18/18 transitions.
Applied a total of 0 rules in 0 ms. Remains 21 /21 variables (removed 0) and now considering 18/18 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 34 ms. Remains : 21/24 places, 18/18 transitions.
Stuttering acceptance computed with spot in 258 ms :[p1, p1, p1, p1, (AND p0 p1), true, p0]
Running random walk in product with property : ClientsAndServers-PT-N0010P2-LTLFireability-03
Product exploration explored 100000 steps with 23534 reset in 43 ms.
Product exploration explored 100000 steps with 23476 reset in 50 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 (NOT p1))]
False Knowledge obtained : [(X (X p0)), (X (X (NOT p0)))]
Knowledge based reduction with 1 factoid took 132 ms. Reduced automaton from 7 states, 9 edges and 2 AP (stutter sensitive) to 7 states, 9 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 214 ms :[p1, p1, p1, p1, (AND p0 p1), true, p0]
RANDOM walk for 2994 steps (1 resets) in 7 ms. (374 steps per ms) remains 0/4 properties
Knowledge obtained : [(AND p0 (NOT p1))]
False Knowledge obtained : [(X (X p0)), (X (X (NOT p0))), (F p1), (F (NOT (AND p0 (NOT p1)))), (F (NOT p0)), (F (NOT (OR (NOT p0) (NOT p1))))]
Knowledge based reduction with 1 factoid took 204 ms. Reduced automaton from 7 states, 9 edges and 2 AP (stutter sensitive) to 7 states, 9 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 230 ms :[p1, p1, p1, p1, (AND p0 p1), true, p0]
Stuttering acceptance computed with spot in 244 ms :[p1, p1, p1, p1, (AND p0 p1), true, p0]
Support contains 4 out of 21 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 21/21 places, 18/18 transitions.
Applied a total of 0 rules in 2 ms. Remains 21 /21 variables (removed 0) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 21 cols
[2024-05-21 13:35:46] [INFO ] Computed 4 invariants in 1 ms
[2024-05-21 13:35:46] [INFO ] Implicit Places using invariants in 32 ms returned []
[2024-05-21 13:35:46] [INFO ] Invariant cache hit.
[2024-05-21 13:35:46] [INFO ] Implicit Places using invariants and state equation in 26 ms returned []
Implicit Place search using SMT with State Equation took 67 ms to find 0 implicit places.
Running 17 sub problems to find dead transitions.
[2024-05-21 13:35:46] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/20 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/20 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 2 (OVERLAPS) 1/21 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/21 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 4 (OVERLAPS) 18/39 variables, 21/25 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/39 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 6 (OVERLAPS) 0/39 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 17 unsolved
No progress, stopping.
After SMT solving in domain Real declared 39/39 variables, and 25 constraints, problems are : Problem set: 0 solved, 17 unsolved in 137 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 21/21 constraints, PredecessorRefiner: 17/17 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 17 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/20 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/20 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 2 (OVERLAPS) 1/21 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/21 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 4 (OVERLAPS) 18/39 variables, 21/25 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/39 variables, 17/42 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/39 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 7 (OVERLAPS) 0/39 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 17 unsolved
No progress, stopping.
After SMT solving in domain Int declared 39/39 variables, and 42 constraints, problems are : Problem set: 0 solved, 17 unsolved in 113 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 21/21 constraints, PredecessorRefiner: 17/17 constraints, Known Traps: 0/0 constraints]
After SMT, in 259ms problems are : Problem set: 0 solved, 17 unsolved
Search for dead transitions found 0 dead transitions in 259ms
Finished structural reductions in LTL mode , in 1 iterations and 329 ms. Remains : 21/21 places, 18/18 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 (NOT p1))]
False Knowledge obtained : [(X (X p0)), (X (X (NOT p0)))]
Knowledge based reduction with 1 factoid took 141 ms. Reduced automaton from 7 states, 9 edges and 2 AP (stutter sensitive) to 7 states, 9 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 250 ms :[p1, p1, p1, p1, (AND p0 p1), true, p0]
RANDOM walk for 4380 steps (2 resets) in 10 ms. (398 steps per ms) remains 0/4 properties
Knowledge obtained : [(AND p0 (NOT p1))]
False Knowledge obtained : [(X (X p0)), (X (X (NOT p0))), (F p1), (F (NOT (AND p0 (NOT p1)))), (F (NOT p0)), (F (NOT (OR (NOT p0) (NOT p1))))]
Knowledge based reduction with 1 factoid took 237 ms. Reduced automaton from 7 states, 9 edges and 2 AP (stutter sensitive) to 7 states, 9 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 264 ms :[p1, p1, p1, p1, (AND p0 p1), true, p0]
Stuttering acceptance computed with spot in 238 ms :[p1, p1, p1, p1, (AND p0 p1), true, p0]
Stuttering acceptance computed with spot in 217 ms :[p1, p1, p1, p1, (AND p0 p1), true, p0]
Product exploration explored 100000 steps with 23553 reset in 53 ms.
Product exploration explored 100000 steps with 23539 reset in 45 ms.
Applying partial POR strategy [false, false, false, true, true, true, true]
Stuttering acceptance computed with spot in 255 ms :[p1, p1, p1, p1, (AND p0 p1), true, p0]
Support contains 4 out of 21 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 21/21 places, 18/18 transitions.
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 7 rules applied. Total rules applied 7 place count 21 transition count 18
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 3 Pre rules applied. Total rules applied 7 place count 21 transition count 18
Deduced a syphon composed of 10 places in 0 ms
Iterating global reduction 1 with 3 rules applied. Total rules applied 10 place count 21 transition count 18
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 15 place count 16 transition count 13
Deduced a syphon composed of 5 places in 0 ms
Iterating global reduction 1 with 5 rules applied. Total rules applied 20 place count 16 transition count 13
Performed 1 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 1 rules applied. Total rules applied 21 place count 16 transition count 13
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 22 place count 15 transition count 12
Deduced a syphon composed of 5 places in 0 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 23 place count 15 transition count 12
Deduced a syphon composed of 5 places in 0 ms
Applied a total of 23 rules in 9 ms. Remains 15 /21 variables (removed 6) and now considering 12/18 (removed 6) transitions.
[2024-05-21 13:35:48] [INFO ] Redundant transitions in 0 ms returned []
Running 11 sub problems to find dead transitions.
// Phase 1: matrix 12 rows 15 cols
[2024-05-21 13:35:48] [INFO ] Computed 4 invariants in 0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/14 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/14 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 2 (OVERLAPS) 1/15 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/15 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 11 unsolved
Problem TDEAD0 is UNSAT
Problem TDEAD2 is UNSAT
Problem TDEAD6 is UNSAT
Problem TDEAD7 is UNSAT
Problem TDEAD10 is UNSAT
At refinement iteration 4 (OVERLAPS) 12/27 variables, 15/19 constraints. Problems are: Problem set: 5 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/27 variables, 0/19 constraints. Problems are: Problem set: 5 solved, 6 unsolved
At refinement iteration 6 (OVERLAPS) 0/27 variables, 0/19 constraints. Problems are: Problem set: 5 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 27/27 variables, and 19 constraints, problems are : Problem set: 5 solved, 6 unsolved in 68 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 15/15 constraints, PredecessorRefiner: 11/11 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 5 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/9 variables, 0/0 constraints. Problems are: Problem set: 5 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 6/15 variables, 4/4 constraints. Problems are: Problem set: 5 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/15 variables, 0/4 constraints. Problems are: Problem set: 5 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 12/27 variables, 15/19 constraints. Problems are: Problem set: 5 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/27 variables, 6/25 constraints. Problems are: Problem set: 5 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/27 variables, 0/25 constraints. Problems are: Problem set: 5 solved, 6 unsolved
At refinement iteration 6 (OVERLAPS) 0/27 variables, 0/25 constraints. Problems are: Problem set: 5 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 27/27 variables, and 25 constraints, problems are : Problem set: 5 solved, 6 unsolved in 51 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 15/15 constraints, PredecessorRefiner: 6/11 constraints, Known Traps: 0/0 constraints]
After SMT, in 124ms problems are : Problem set: 5 solved, 6 unsolved
Search for dead transitions found 5 dead transitions in 124ms
Found 5 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 5 transitions
Dead transitions reduction (with SMT) removed 5 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 15/21 places, 7/18 transitions.
Graph (complete) has 17 edges and 15 vertex of which 10 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.0 ms
Discarding 5 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 3 ms. Remains 10 /15 variables (removed 5) and now considering 7/7 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 10/21 places, 7/18 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 144 ms. Remains : 10/21 places, 7/18 transitions.
Built C files in :
/tmp/ltsmin15231955258593451180
[2024-05-21 13:35:48] [INFO ] Built C files in 1ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15231955258593451180
Running compilation step : cd /tmp/ltsmin15231955258593451180;'/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 90 ms.
Running link step : cd /tmp/ltsmin15231955258593451180;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 31 ms.
Running LTSmin : cd /tmp/ltsmin15231955258593451180;'/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/stateBased5988048800048325171.hoa' '--buchi-type=spotba'
LTSmin run took 156 ms.
FORMULA ClientsAndServers-PT-N0010P2-LTLFireability-03 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property ClientsAndServers-PT-N0010P2-LTLFireability-03 finished in 4057 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F(p1))))'
Support contains 4 out of 24 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 24/24 places, 18/18 transitions.
Discarding 2 places :
Implicit places reduction removed 2 places
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 3 rules applied. Total rules applied 3 place count 22 transition count 17
Reduce places removed 1 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 2 rules applied. Total rules applied 5 place count 21 transition count 16
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 6 place count 20 transition count 16
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 4 Pre rules applied. Total rules applied 6 place count 20 transition count 12
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 14 place count 16 transition count 12
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 3 with 1 rules applied. Total rules applied 15 place count 15 transition count 12
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 19 place count 13 transition count 10
Applied a total of 19 rules in 4 ms. Remains 13 /24 variables (removed 11) and now considering 10/18 (removed 8) transitions.
// Phase 1: matrix 10 rows 13 cols
[2024-05-21 13:35:48] [INFO ] Computed 4 invariants in 1 ms
[2024-05-21 13:35:48] [INFO ] Implicit Places using invariants in 19 ms returned [9, 12]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 19 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 11/24 places, 10/18 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 11 transition count 8
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 9 transition count 8
Applied a total of 4 rules in 2 ms. Remains 9 /11 variables (removed 2) and now considering 8/10 (removed 2) transitions.
// Phase 1: matrix 8 rows 9 cols
[2024-05-21 13:35:48] [INFO ] Computed 2 invariants in 0 ms
[2024-05-21 13:35:48] [INFO ] Implicit Places using invariants in 16 ms returned []
[2024-05-21 13:35:48] [INFO ] Invariant cache hit.
[2024-05-21 13:35:48] [INFO ] Implicit Places using invariants and state equation in 26 ms returned []
Implicit Place search using SMT with State Equation took 43 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 9/24 places, 8/18 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 68 ms. Remains : 9/24 places, 8/18 transitions.
Stuttering acceptance computed with spot in 118 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : ClientsAndServers-PT-N0010P2-LTLFireability-05
Product exploration explored 100000 steps with 782 reset in 85 ms.
Stack based approach found an accepted trace after 444 steps with 3 reset with depth 25 and stack size 25 in 1 ms.
FORMULA ClientsAndServers-PT-N0010P2-LTLFireability-05 FALSE TECHNIQUES STACK_TEST
Treatment of property ClientsAndServers-PT-N0010P2-LTLFireability-05 finished in 283 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G(!p0))))'
Support contains 2 out of 24 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 24/24 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 22 transition count 18
Applied a total of 2 rules in 1 ms. Remains 22 /24 variables (removed 2) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 22 cols
[2024-05-21 13:35:49] [INFO ] Computed 5 invariants in 1 ms
[2024-05-21 13:35:49] [INFO ] Implicit Places using invariants in 31 ms returned [14, 19]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 35 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 20/24 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 37 ms. Remains : 20/24 places, 18/18 transitions.
Stuttering acceptance computed with spot in 116 ms :[true, p0, p0, p0]
Running random walk in product with property : ClientsAndServers-PT-N0010P2-LTLFireability-06
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA ClientsAndServers-PT-N0010P2-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ClientsAndServers-PT-N0010P2-LTLFireability-06 finished in 171 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(p0)||X(G(p1))))'
Support contains 2 out of 24 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 24/24 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 22 transition count 18
Applied a total of 2 rules in 1 ms. Remains 22 /24 variables (removed 2) and now considering 18/18 (removed 0) transitions.
[2024-05-21 13:35:49] [INFO ] Invariant cache hit.
[2024-05-21 13:35:49] [INFO ] Implicit Places using invariants in 20 ms returned [14, 19]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 21 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 20/24 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 23 ms. Remains : 20/24 places, 18/18 transitions.
Stuttering acceptance computed with spot in 178 ms :[true, (AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p1) (NOT p0)), (NOT p0)]
Running random walk in product with property : ClientsAndServers-PT-N0010P2-LTLFireability-07
Entered a terminal (fully accepting) state of product in 52 steps with 0 reset in 1 ms.
FORMULA ClientsAndServers-PT-N0010P2-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ClientsAndServers-PT-N0010P2-LTLFireability-07 finished in 215 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G((G(F(p0)) U p1))))'
Support contains 3 out of 24 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 24/24 places, 18/18 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 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 11 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 12 place count 17 transition count 13
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 12 place count 17 transition count 11
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 16 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 3 with 6 rules applied. Total rules applied 22 place count 12 transition count 8
Applied a total of 22 rules in 3 ms. Remains 12 /24 variables (removed 12) and now considering 8/18 (removed 10) transitions.
// Phase 1: matrix 8 rows 12 cols
[2024-05-21 13:35:49] [INFO ] Computed 5 invariants in 0 ms
[2024-05-21 13:35:49] [INFO ] Implicit Places using invariants in 26 ms returned [7, 11]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 26 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 10/24 places, 8/18 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 10 transition count 7
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 9 transition count 7
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 2 place count 9 transition count 6
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 4 place count 8 transition count 6
Applied a total of 4 rules in 2 ms. Remains 8 /10 variables (removed 2) and now considering 6/8 (removed 2) transitions.
// Phase 1: matrix 6 rows 8 cols
[2024-05-21 13:35:49] [INFO ] Computed 3 invariants in 0 ms
[2024-05-21 13:35:49] [INFO ] Implicit Places using invariants in 15 ms returned []
[2024-05-21 13:35:49] [INFO ] Invariant cache hit.
[2024-05-21 13:35:49] [INFO ] Implicit Places using invariants and state equation in 23 ms returned []
Implicit Place search using SMT with State Equation took 39 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 8/24 places, 6/18 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 70 ms. Remains : 8/24 places, 6/18 transitions.
Stuttering acceptance computed with spot in 178 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p1)]
Running random walk in product with property : ClientsAndServers-PT-N0010P2-LTLFireability-08
Product exploration explored 100000 steps with 5912 reset in 74 ms.
Product exploration explored 100000 steps with 6531 reset in 90 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 (AND (NOT p1) (NOT p0))), (X (NOT (AND p1 (NOT p0)))), (X (NOT p0)), (X (NOT p1)), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 94 ms. Reduced automaton from 4 states, 10 edges and 2 AP (stutter insensitive) to 4 states, 10 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 187 ms :[(NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1)]
RANDOM walk for 256 steps (0 resets) in 5 ms. (42 steps per ms) remains 0/4 properties
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (AND (NOT p1) (NOT p0))), (X (NOT (AND p1 (NOT p0)))), (X (NOT p0)), (X (NOT p1)), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : [(F p1), (F (NOT (OR p0 (NOT p1)))), (F p0), (F (NOT (AND (NOT p0) (NOT p1))))]
Knowledge based reduction with 9 factoid took 234 ms. Reduced automaton from 4 states, 10 edges and 2 AP (stutter insensitive) to 4 states, 10 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 170 ms :[(NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1)]
Stuttering acceptance computed with spot in 134 ms :[(NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1)]
[2024-05-21 13:35:50] [INFO ] Invariant cache hit.
[2024-05-21 13:35:50] [INFO ] [Real]Absence check using 3 positive place invariants in 0 ms returned sat
[2024-05-21 13:35:50] [INFO ] [Real]Absence check using state equation in 5 ms returned sat
[2024-05-21 13:35:50] [INFO ] Computed and/alt/rep : 5/6/5 causal constraints (skipped 0 transitions) in 1 ms.
[2024-05-21 13:35:50] [INFO ] Added : 1 causal constraints over 1 iterations in 3 ms. Result :sat
Could not prove EG (NOT p1)
Support contains 3 out of 8 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 8/8 places, 6/6 transitions.
Applied a total of 0 rules in 0 ms. Remains 8 /8 variables (removed 0) and now considering 6/6 (removed 0) transitions.
[2024-05-21 13:35:50] [INFO ] Invariant cache hit.
[2024-05-21 13:35:50] [INFO ] Implicit Places using invariants in 18 ms returned []
[2024-05-21 13:35:50] [INFO ] Invariant cache hit.
[2024-05-21 13:35:50] [INFO ] Implicit Places using invariants and state equation in 27 ms returned []
Implicit Place search using SMT with State Equation took 47 ms to find 0 implicit places.
[2024-05-21 13:35:50] [INFO ] Redundant transitions in 0 ms returned []
Running 5 sub problems to find dead transitions.
[2024-05-21 13:35:50] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/8 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (OVERLAPS) 6/14 variables, 8/11 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/14 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (OVERLAPS) 0/14 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 14/14 variables, and 11 constraints, problems are : Problem set: 0 solved, 5 unsolved in 33 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 8/8 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 5 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/8 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (OVERLAPS) 6/14 variables, 8/11 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/14 variables, 5/16 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/14 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 0/14 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Int declared 14/14 variables, and 16 constraints, problems are : Problem set: 0 solved, 5 unsolved in 35 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 8/8 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints]
After SMT, in 70ms problems are : Problem set: 0 solved, 5 unsolved
Search for dead transitions found 0 dead transitions in 70ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 121 ms. Remains : 8/8 places, 6/6 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT (AND (NOT p0) p1))), (X (AND (NOT p0) (NOT p1))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT (AND (NOT p0) p1)))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 106 ms. Reduced automaton from 4 states, 10 edges and 2 AP (stutter insensitive) to 4 states, 10 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 160 ms :[(NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1)]
RANDOM walk for 256 steps (0 resets) in 5 ms. (42 steps per ms) remains 0/4 properties
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT (AND (NOT p0) p1))), (X (AND (NOT p0) (NOT p1))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT (AND (NOT p0) p1)))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : [(F p1), (F (NOT (OR p0 (NOT p1)))), (F p0), (F (NOT (AND (NOT p0) (NOT p1))))]
Knowledge based reduction with 9 factoid took 236 ms. Reduced automaton from 4 states, 10 edges and 2 AP (stutter insensitive) to 4 states, 10 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 160 ms :[(NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1)]
Stuttering acceptance computed with spot in 162 ms :[(NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1)]
[2024-05-21 13:35:51] [INFO ] Invariant cache hit.
[2024-05-21 13:35:51] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-21 13:35:51] [INFO ] [Real]Absence check using state equation in 4 ms returned sat
[2024-05-21 13:35:51] [INFO ] Computed and/alt/rep : 5/6/5 causal constraints (skipped 0 transitions) in 1 ms.
[2024-05-21 13:35:51] [INFO ] Added : 1 causal constraints over 1 iterations in 5 ms. Result :sat
Could not prove EG (NOT p1)
Stuttering acceptance computed with spot in 169 ms :[(NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1)]
Product exploration explored 100000 steps with 6758 reset in 75 ms.
Product exploration explored 100000 steps with 7098 reset in 87 ms.
Built C files in :
/tmp/ltsmin1866356695937810454
[2024-05-21 13:35:52] [INFO ] Computing symmetric may disable matrix : 6 transitions.
[2024-05-21 13:35:52] [INFO ] Computation of Complete disable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 13:35:52] [INFO ] Computing symmetric may enable matrix : 6 transitions.
[2024-05-21 13:35:52] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 13:35:52] [INFO ] Computing Do-Not-Accords matrix : 6 transitions.
[2024-05-21 13:35:52] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 13:35:52] [INFO ] Built C files in 5ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1866356695937810454
Running compilation step : cd /tmp/ltsmin1866356695937810454;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 92 ms.
Running link step : cd /tmp/ltsmin1866356695937810454;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 34 ms.
Running LTSmin : cd /tmp/ltsmin1866356695937810454;'/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/stateBased7441704871080963221.hoa' '--buchi-type=spotba'
LTSmin run took 116 ms.
FORMULA ClientsAndServers-PT-N0010P2-LTLFireability-08 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property ClientsAndServers-PT-N0010P2-LTLFireability-08 finished in 2927 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 2 out of 24 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 24/24 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 22 transition count 18
Applied a total of 2 rules in 1 ms. Remains 22 /24 variables (removed 2) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 22 cols
[2024-05-21 13:35:52] [INFO ] Computed 5 invariants in 3 ms
[2024-05-21 13:35:52] [INFO ] Implicit Places using invariants in 30 ms returned [14]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 31 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 21/24 places, 18/18 transitions.
Applied a total of 0 rules in 1 ms. Remains 21 /21 variables (removed 0) and now considering 18/18 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 33 ms. Remains : 21/24 places, 18/18 transitions.
Stuttering acceptance computed with spot in 72 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ClientsAndServers-PT-N0010P2-LTLFireability-09
Product exploration explored 100000 steps with 1092 reset in 182 ms.
Product exploration explored 100000 steps with 1080 reset in 135 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 3 factoid took 71 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 54 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 2344 steps (0 resets) in 8 ms. (260 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 221 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 65 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 74 ms :[(NOT p0), (NOT p0)]
// Phase 1: matrix 18 rows 21 cols
[2024-05-21 13:35:53] [INFO ] Computed 4 invariants in 1 ms
[2024-05-21 13:35:53] [INFO ] [Real]Absence check using 4 positive place invariants in 2 ms returned sat
[2024-05-21 13:35:53] [INFO ] [Real]Absence check using state equation in 6 ms returned sat
[2024-05-21 13:35:53] [INFO ] Computed and/alt/rep : 17/18/17 causal constraints (skipped 0 transitions) in 1 ms.
[2024-05-21 13:35:53] [INFO ] Added : 15 causal constraints over 3 iterations in 13 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 2 out of 21 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 21/21 places, 18/18 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 9 transitions
Trivial Post-agglo rules discarded 9 transitions
Performed 9 trivial Post agglomeration. Transition count delta: 9
Iterating post reduction 0 with 9 rules applied. Total rules applied 9 place count 21 transition count 9
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 18 place count 12 transition count 9
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 18 place count 12 transition count 6
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 24 place count 9 transition count 6
Applied a total of 24 rules in 2 ms. Remains 9 /21 variables (removed 12) and now considering 6/18 (removed 12) transitions.
// Phase 1: matrix 6 rows 9 cols
[2024-05-21 13:35:53] [INFO ] Computed 4 invariants in 1 ms
[2024-05-21 13:35:53] [INFO ] Implicit Places using invariants in 17 ms returned []
[2024-05-21 13:35:53] [INFO ] Invariant cache hit.
[2024-05-21 13:35:53] [INFO ] Implicit Places using invariants and state equation in 28 ms returned []
Implicit Place search using SMT with State Equation took 47 ms to find 0 implicit places.
[2024-05-21 13:35:53] [INFO ] Redundant transitions in 0 ms returned []
Running 5 sub problems to find dead transitions.
[2024-05-21 13:35:53] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/8 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (OVERLAPS) 1/9 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/9 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (OVERLAPS) 6/15 variables, 9/13 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/15 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (OVERLAPS) 0/15 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 15/15 variables, and 13 constraints, problems are : Problem set: 0 solved, 5 unsolved in 43 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 9/9 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 5 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/8 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (OVERLAPS) 1/9 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/9 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (OVERLAPS) 6/15 variables, 9/13 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/15 variables, 5/18 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/15 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (OVERLAPS) 0/15 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Int declared 15/15 variables, and 18 constraints, problems are : Problem set: 0 solved, 5 unsolved in 65 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 9/9 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints]
After SMT, in 110ms problems are : Problem set: 0 solved, 5 unsolved
Search for dead transitions found 0 dead transitions in 111ms
Starting structural reductions in SI_LTL mode, iteration 1 : 9/21 places, 6/18 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 165 ms. Remains : 9/21 places, 6/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 (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 70 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 66 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 678 steps (1 resets) in 4 ms. (135 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 84 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 76 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 58 ms :[(NOT p0), (NOT p0)]
[2024-05-21 13:35:54] [INFO ] Invariant cache hit.
[2024-05-21 13:35:54] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2024-05-21 13:35:54] [INFO ] [Real]Absence check using state equation in 2 ms returned sat
[2024-05-21 13:35:54] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 13:35:54] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2024-05-21 13:35:54] [INFO ] [Nat]Absence check using state equation in 3 ms returned sat
[2024-05-21 13:35:54] [INFO ] Computed and/alt/rep : 5/6/5 causal constraints (skipped 0 transitions) in 1 ms.
[2024-05-21 13:35:54] [INFO ] Added : 3 causal constraints over 1 iterations in 4 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 71 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 7394 reset in 69 ms.
Product exploration explored 100000 steps with 7382 reset in 60 ms.
Built C files in :
/tmp/ltsmin8420437229046285368
[2024-05-21 13:35:54] [INFO ] Computing symmetric may disable matrix : 6 transitions.
[2024-05-21 13:35:54] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 13:35:54] [INFO ] Computing symmetric may enable matrix : 6 transitions.
[2024-05-21 13:35:54] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 13:35:54] [INFO ] Computing Do-Not-Accords matrix : 6 transitions.
[2024-05-21 13:35:54] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 13:35:54] [INFO ] Built C files in 2ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8420437229046285368
Running compilation step : cd /tmp/ltsmin8420437229046285368;'/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/ltsmin8420437229046285368;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 31 ms.
Running LTSmin : cd /tmp/ltsmin8420437229046285368;'/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/stateBased5915295964075834738.hoa' '--buchi-type=spotba'
LTSmin run took 192 ms.
FORMULA ClientsAndServers-PT-N0010P2-LTLFireability-09 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property ClientsAndServers-PT-N0010P2-LTLFireability-09 finished in 2157 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(p1)&&p0)))'
Support contains 4 out of 24 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 24/24 places, 18/18 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 23 transition count 18
Applied a total of 1 rules in 1 ms. Remains 23 /24 variables (removed 1) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 23 cols
[2024-05-21 13:35:54] [INFO ] Computed 6 invariants in 1 ms
[2024-05-21 13:35:54] [INFO ] Implicit Places using invariants in 82 ms returned [14, 19]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 82 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 21/24 places, 18/18 transitions.
Applied a total of 0 rules in 1 ms. Remains 21 /21 variables (removed 0) and now considering 18/18 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 84 ms. Remains : 21/24 places, 18/18 transitions.
Stuttering acceptance computed with spot in 125 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), true]
Running random walk in product with property : ClientsAndServers-PT-N0010P2-LTLFireability-10
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA ClientsAndServers-PT-N0010P2-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ClientsAndServers-PT-N0010P2-LTLFireability-10 finished in 221 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0) U G(p1)))'
Support contains 4 out of 24 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 24/24 places, 18/18 transitions.
Discarding 2 places :
Implicit places reduction removed 2 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 22 transition count 14
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 10 place count 18 transition count 14
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 10 place count 18 transition count 13
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 12 place count 17 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 2 with 6 rules applied. Total rules applied 18 place count 14 transition count 10
Applied a total of 18 rules in 4 ms. Remains 14 /24 variables (removed 10) and now considering 10/18 (removed 8) transitions.
// Phase 1: matrix 10 rows 14 cols
[2024-05-21 13:35:54] [INFO ] Computed 5 invariants in 1 ms
[2024-05-21 13:35:54] [INFO ] Implicit Places using invariants in 29 ms returned [12]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 32 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 13/24 places, 10/18 transitions.
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 0 with 2 rules applied. Total rules applied 2 place count 12 transition count 9
Applied a total of 2 rules in 2 ms. Remains 12 /13 variables (removed 1) and now considering 9/10 (removed 1) transitions.
// Phase 1: matrix 9 rows 12 cols
[2024-05-21 13:35:54] [INFO ] Computed 4 invariants in 0 ms
[2024-05-21 13:35:54] [INFO ] Implicit Places using invariants in 25 ms returned [11]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 25 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 11/24 places, 9/18 transitions.
Applied a total of 0 rules in 1 ms. Remains 11 /11 variables (removed 0) and now considering 9/9 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 3 iterations and 64 ms. Remains : 11/24 places, 9/18 transitions.
Stuttering acceptance computed with spot in 64 ms :[(NOT p1), (NOT p0)]
Running random walk in product with property : ClientsAndServers-PT-N0010P2-LTLFireability-13
Product exploration explored 100000 steps with 10694 reset in 81 ms.
Stack based approach found an accepted trace after 4208 steps with 522 reset with depth 1008 and stack size 1008 in 4 ms.
FORMULA ClientsAndServers-PT-N0010P2-LTLFireability-13 FALSE TECHNIQUES STACK_TEST
Treatment of property ClientsAndServers-PT-N0010P2-LTLFireability-13 finished in 228 ms.
All properties solved by simple procedures.
Total runtime 18808 ms.

BK_STOP 1716298555171

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

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

Sequence of Actions to be Executed by the VM

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

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

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

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

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