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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 572K
-rw-r--r-- 1 mcc users 7.0K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 73K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.1K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 45K 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.8K Apr 22 14:33 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Apr 22 14:33 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K May 19 07:14 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 19 18:03 LTLFireability.xml
-rw-r--r-- 1 mcc users 17K Apr 12 23:06 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 184K Apr 12 23:06 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 12K Apr 12 23:05 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 110K Apr 12 23:05 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.1K 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-N0500P0-LTLCardinality-00
FORMULA_NAME ClientsAndServers-PT-N0500P0-LTLCardinality-01
FORMULA_NAME ClientsAndServers-PT-N0500P0-LTLCardinality-02
FORMULA_NAME ClientsAndServers-PT-N0500P0-LTLCardinality-03
FORMULA_NAME ClientsAndServers-PT-N0500P0-LTLCardinality-04
FORMULA_NAME ClientsAndServers-PT-N0500P0-LTLCardinality-05
FORMULA_NAME ClientsAndServers-PT-N0500P0-LTLCardinality-06
FORMULA_NAME ClientsAndServers-PT-N0500P0-LTLCardinality-07
FORMULA_NAME ClientsAndServers-PT-N0500P0-LTLCardinality-08
FORMULA_NAME ClientsAndServers-PT-N0500P0-LTLCardinality-09
FORMULA_NAME ClientsAndServers-PT-N0500P0-LTLCardinality-10
FORMULA_NAME ClientsAndServers-PT-N0500P0-LTLCardinality-11
FORMULA_NAME ClientsAndServers-PT-N0500P0-LTLCardinality-12
FORMULA_NAME ClientsAndServers-PT-N0500P0-LTLCardinality-13
FORMULA_NAME ClientsAndServers-PT-N0500P0-LTLCardinality-14
FORMULA_NAME ClientsAndServers-PT-N0500P0-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1716315972202

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-N0500P0
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202405141337
[2024-05-21 18:26:13] [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 18:26:13] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-21 18:26:13] [INFO ] Load time of PNML (sax parser for PT used): 30 ms
[2024-05-21 18:26:13] [INFO ] Transformed 25 places.
[2024-05-21 18:26:13] [INFO ] Transformed 18 transitions.
[2024-05-21 18:26:13] [INFO ] Parsed PT model containing 25 places and 18 transitions and 54 arcs in 119 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 15 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 4 formulas.
FORMULA ClientsAndServers-PT-N0500P0-LTLCardinality-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ClientsAndServers-PT-N0500P0-LTLCardinality-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ClientsAndServers-PT-N0500P0-LTLCardinality-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ClientsAndServers-PT-N0500P0-LTLCardinality-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 17 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 18:26:13] [INFO ] Computed 6 invariants in 9 ms
[2024-05-21 18:26:13] [INFO ] Implicit Places using invariants in 141 ms returned []
[2024-05-21 18:26:13] [INFO ] Invariant cache hit.
[2024-05-21 18:26:13] [INFO ] Implicit Places using invariants and state equation in 36 ms returned []
Implicit Place search using SMT with State Equation took 206 ms to find 0 implicit places.
Running 17 sub problems to find dead transitions.
[2024-05-21 18:26:13] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/22 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/22 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/22 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 3 (OVERLAPS) 1/23 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/23 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/23 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 6 (OVERLAPS) 18/41 variables, 23/29 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/41 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 8 (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 222 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, Generalized P Invariants (flows): 2/2 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, 2/2 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/22 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/22 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 3 (OVERLAPS) 1/23 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/23 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/23 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 6 (OVERLAPS) 18/41 variables, 23/29 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/41 variables, 17/46 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/41 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 9 (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 181 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 23/23 constraints, PredecessorRefiner: 17/17 constraints, Known Traps: 0/0 constraints]
After SMT, in 433ms problems are : Problem set: 0 solved, 17 unsolved
Search for dead transitions found 0 dead transitions in 450ms
Starting structural reductions in LTL mode, iteration 1 : 23/25 places, 18/18 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 689 ms. Remains : 23/25 places, 18/18 transitions.
Support contains 17 out of 23 places after structural reductions.
[2024-05-21 18:26:14] [INFO ] Flatten gal took : 14 ms
[2024-05-21 18:26:14] [INFO ] Flatten gal took : 4 ms
[2024-05-21 18:26:14] [INFO ] Input system was already deterministic with 18 transitions.
RANDOM walk for 48020 steps (8 resets) in 86 ms. (551 steps per ms) remains 21/22 properties
BEST_FIRST walk for 4004 steps (8 resets) in 172 ms. (23 steps per ms) remains 19/21 properties
BEST_FIRST walk for 4004 steps (8 resets) in 63 ms. (62 steps per ms) remains 13/19 properties
BEST_FIRST walk for 4004 steps (8 resets) in 67 ms. (58 steps per ms) remains 13/13 properties
BEST_FIRST walk for 4004 steps (8 resets) in 67 ms. (58 steps per ms) remains 13/13 properties
BEST_FIRST walk for 4004 steps (8 resets) in 21 ms. (182 steps per ms) remains 13/13 properties
BEST_FIRST walk for 4003 steps (8 resets) in 22 ms. (174 steps per ms) remains 13/13 properties
BEST_FIRST walk for 4003 steps (8 resets) in 31 ms. (125 steps per ms) remains 13/13 properties
BEST_FIRST walk for 4003 steps (8 resets) in 10 ms. (363 steps per ms) remains 13/13 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 13/13 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 12/13 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 12/12 properties
BEST_FIRST walk for 4002 steps (8 resets) in 15 ms. (250 steps per ms) remains 12/12 properties
BEST_FIRST walk for 4004 steps (8 resets) in 17 ms. (222 steps per ms) remains 10/12 properties
[2024-05-21 18:26:14] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/14 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 1 (OVERLAPS) 8/22 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 10 unsolved
Problem AtomicPropp6 is UNSAT
Problem AtomicPropp10 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/22 variables, 1/5 constraints. Problems are: Problem set: 2 solved, 8 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/22 variables, 0/5 constraints. Problems are: Problem set: 2 solved, 8 unsolved
At refinement iteration 4 (OVERLAPS) 1/23 variables, 1/6 constraints. Problems are: Problem set: 2 solved, 8 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/23 variables, 0/6 constraints. Problems are: Problem set: 2 solved, 8 unsolved
At refinement iteration 6 (OVERLAPS) 18/41 variables, 23/29 constraints. Problems are: Problem set: 2 solved, 8 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/41 variables, 0/29 constraints. Problems are: Problem set: 2 solved, 8 unsolved
At refinement iteration 8 (OVERLAPS) 0/41 variables, 0/29 constraints. Problems are: Problem set: 2 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Real declared 41/41 variables, and 29 constraints, problems are : Problem set: 2 solved, 8 unsolved in 85 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 23/23 constraints, PredecessorRefiner: 10/10 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 2 solved, 8 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/13 variables, 0/0 constraints. Problems are: Problem set: 2 solved, 8 unsolved
At refinement iteration 1 (OVERLAPS) 9/22 variables, 4/4 constraints. Problems are: Problem set: 2 solved, 8 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/22 variables, 1/5 constraints. Problems are: Problem set: 2 solved, 8 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/22 variables, 0/5 constraints. Problems are: Problem set: 2 solved, 8 unsolved
At refinement iteration 4 (OVERLAPS) 1/23 variables, 1/6 constraints. Problems are: Problem set: 2 solved, 8 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/23 variables, 0/6 constraints. Problems are: Problem set: 2 solved, 8 unsolved
At refinement iteration 6 (OVERLAPS) 18/41 variables, 23/29 constraints. Problems are: Problem set: 2 solved, 8 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/41 variables, 8/37 constraints. Problems are: Problem set: 2 solved, 8 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/41 variables, 0/37 constraints. Problems are: Problem set: 2 solved, 8 unsolved
At refinement iteration 9 (OVERLAPS) 0/41 variables, 0/37 constraints. Problems are: Problem set: 2 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Int declared 41/41 variables, and 37 constraints, problems are : Problem set: 2 solved, 8 unsolved in 117 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 23/23 constraints, PredecessorRefiner: 8/10 constraints, Known Traps: 0/0 constraints]
After SMT, in 208ms problems are : Problem set: 2 solved, 8 unsolved
Fused 8 Parikh solutions to 4 different solutions.
Finished Parikh walk after 13846 steps, including 0 resets, run visited all 8 properties in 292 ms. (steps per millisecond=47 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Parikh walk visited 8 properties in 297 ms.
FORMULA ClientsAndServers-PT-N0500P0-LTLCardinality-08 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 2 atomic propositions for a total of 11 simplifications.
FORMULA ClientsAndServers-PT-N0500P0-LTLCardinality-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ClientsAndServers-PT-N0500P0-LTLCardinality-07 TRUE 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' '!(X(F(p0)))'
Support contains 2 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.
[2024-05-21 18:26:15] [INFO ] Invariant cache hit.
[2024-05-21 18:26:15] [INFO ] Implicit Places using invariants in 31 ms returned [21]
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 : 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 34 ms. Remains : 22/23 places, 18/18 transitions.
Stuttering acceptance computed with spot in 179 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ClientsAndServers-PT-N0500P0-LTLCardinality-01
Product exploration explored 100000 steps with 50000 reset in 140 ms.
Product exploration explored 100000 steps with 50000 reset in 100 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 3 factoid took 19 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA ClientsAndServers-PT-N0500P0-LTLCardinality-01 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ClientsAndServers-PT-N0500P0-LTLCardinality-01 finished in 537 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 1 out of 23 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 23/23 places, 18/18 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 0 with 8 rules applied. Total rules applied 8 place count 22 transition count 11
Reduce places removed 7 places and 0 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 1 with 8 rules applied. Total rules applied 16 place count 14 transition count 11
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 16 place count 14 transition count 10
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 18 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 24 place count 10 transition count 7
Applied a total of 24 rules in 15 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 18:26:16] [INFO ] Computed 4 invariants in 0 ms
[2024-05-21 18:26:16] [INFO ] Implicit Places using invariants in 23 ms returned [7]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 25 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 9/23 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 9 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 7 transition count 5
Applied a total of 4 rules in 1 ms. Remains 7 /9 variables (removed 2) and now considering 5/7 (removed 2) transitions.
// Phase 1: matrix 5 rows 7 cols
[2024-05-21 18:26:16] [INFO ] Computed 3 invariants in 0 ms
[2024-05-21 18:26:16] [INFO ] Implicit Places using invariants in 20 ms returned []
[2024-05-21 18:26:16] [INFO ] Invariant cache hit.
[2024-05-21 18:26:16] [INFO ] Implicit Places using invariants and state equation in 24 ms returned []
Implicit Place search using SMT with State Equation took 45 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 7/23 places, 5/18 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 86 ms. Remains : 7/23 places, 5/18 transitions.
Stuttering acceptance computed with spot in 59 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ClientsAndServers-PT-N0500P0-LTLCardinality-03
Product exploration explored 100000 steps with 0 reset in 133 ms.
Stack based approach found an accepted trace after 21 steps with 0 reset with depth 22 and stack size 22 in 0 ms.
FORMULA ClientsAndServers-PT-N0500P0-LTLCardinality-03 FALSE TECHNIQUES STACK_TEST
Treatment of property ClientsAndServers-PT-N0500P0-LTLCardinality-03 finished in 294 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(G(p1)))))'
Support contains 5 out of 23 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 23/23 places, 18/18 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 22 transition count 16
Reduce places removed 2 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 4 rules applied. Total rules applied 7 place count 20 transition count 14
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 9 place count 18 transition count 14
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 9 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 3 with 2 rules applied. Total rules applied 11 place count 17 transition count 13
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 13 place count 16 transition count 12
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 15 place count 15 transition count 11
Applied a total of 15 rules in 332 ms. Remains 15 /23 variables (removed 8) and now considering 11/18 (removed 7) transitions.
// Phase 1: matrix 11 rows 15 cols
[2024-05-21 18:26:16] [INFO ] Computed 5 invariants in 1 ms
[2024-05-21 18:26:16] [INFO ] Implicit Places using invariants in 31 ms returned [5, 14]
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 : 13/23 places, 11/18 transitions.
Applied a total of 0 rules in 1 ms. Remains 13 /13 variables (removed 0) and now considering 11/11 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 365 ms. Remains : 13/23 places, 11/18 transitions.
Stuttering acceptance computed with spot in 113 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : ClientsAndServers-PT-N0500P0-LTLCardinality-04
Product exploration explored 100000 steps with 2 reset in 125 ms.
Stack based approach found an accepted trace after 53 steps with 0 reset with depth 54 and stack size 54 in 0 ms.
FORMULA ClientsAndServers-PT-N0500P0-LTLCardinality-04 FALSE TECHNIQUES STACK_TEST
Treatment of property ClientsAndServers-PT-N0500P0-LTLCardinality-04 finished in 622 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(X(F((G((p1&&F(G(p1))))&&p0))))))'
Support contains 2 out of 23 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 23/23 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 22 transition count 18
Applied a total of 1 rules in 1 ms. Remains 22 /23 variables (removed 1) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 22 cols
[2024-05-21 18:26:17] [INFO ] Computed 5 invariants in 2 ms
[2024-05-21 18:26:17] [INFO ] Implicit Places using invariants in 38 ms returned [14, 20]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 38 ms to find 2 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 40 ms. Remains : 20/23 places, 18/18 transitions.
Stuttering acceptance computed with spot in 204 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p1)]
Running random walk in product with property : ClientsAndServers-PT-N0500P0-LTLCardinality-06
Product exploration explored 100000 steps with 0 reset in 133 ms.
Product exploration explored 100000 steps with 0 reset in 221 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)]
False Knowledge obtained : []
Knowledge based reduction with 1 factoid took 83 ms. Reduced automaton from 5 states, 7 edges and 2 AP (stutter sensitive) to 5 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 192 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p1)]
Reduction of identical properties reduced properties to check from 4 to 2
RANDOM walk for 48020 steps (8 resets) in 42 ms. (1116 steps per ms) remains 2/2 properties
BEST_FIRST walk for 1893 steps (0 resets) in 8 ms. (210 steps per ms) remains 0/2 properties
Knowledge obtained : [(AND p0 p1)]
False Knowledge obtained : [(F (NOT p1)), (F (NOT (AND p0 p1))), (F (NOT p0)), (F (NOT (AND p0 p1)))]
Knowledge based reduction with 1 factoid took 139 ms. Reduced automaton from 5 states, 7 edges and 2 AP (stutter sensitive) to 5 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 177 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p1)]
Stuttering acceptance computed with spot in 169 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p1)]
Support contains 2 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 18:26:18] [INFO ] Computed 3 invariants in 4 ms
[2024-05-21 18:26:18] [INFO ] Implicit Places using invariants in 28 ms returned []
[2024-05-21 18:26:18] [INFO ] Invariant cache hit.
[2024-05-21 18:26:18] [INFO ] Implicit Places using invariants and state equation in 44 ms returned []
Implicit Place search using SMT with State Equation took 74 ms to find 0 implicit places.
Running 17 sub problems to find dead transitions.
[2024-05-21 18:26:18] [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 175 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 119 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 20/20 constraints, PredecessorRefiner: 17/17 constraints, Known Traps: 0/0 constraints]
After SMT, in 298ms problems are : Problem set: 0 solved, 17 unsolved
Search for dead transitions found 0 dead transitions in 299ms
Finished structural reductions in LTL mode , in 1 iterations and 375 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)]
False Knowledge obtained : []
Knowledge based reduction with 1 factoid took 84 ms. Reduced automaton from 5 states, 7 edges and 2 AP (stutter sensitive) to 5 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 225 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p1)]
Reduction of identical properties reduced properties to check from 4 to 2
RANDOM walk for 48021 steps (8 resets) in 41 ms. (1143 steps per ms) remains 2/2 properties
BEST_FIRST walk for 1447 steps (0 resets) in 6 ms. (206 steps per ms) remains 0/2 properties
Knowledge obtained : [(AND p0 p1)]
False Knowledge obtained : [(F (NOT p1)), (F (NOT (AND p0 p1))), (F (NOT p0)), (F (NOT (AND p0 p1)))]
Knowledge based reduction with 1 factoid took 159 ms. Reduced automaton from 5 states, 7 edges and 2 AP (stutter sensitive) to 5 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 172 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p1)]
Stuttering acceptance computed with spot in 210 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p1)]
Stuttering acceptance computed with spot in 195 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p1)]
Product exploration explored 100000 steps with 0 reset in 171 ms.
Product exploration explored 100000 steps with 0 reset in 170 ms.
Applying partial POR strategy [false, false, false, true, true]
Stuttering acceptance computed with spot in 179 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p1)]
Support contains 2 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 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 3 Pre rules applied. Total rules applied 7 place count 20 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 20 transition count 18
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 14 place count 16 transition count 14
Deduced a syphon composed of 6 places in 0 ms
Iterating global reduction 1 with 4 rules applied. Total rules applied 18 place count 16 transition count 14
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 7 places in 0 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 19 place count 16 transition count 14
Deduced a syphon composed of 7 places in 0 ms
Applied a total of 19 rules in 3 ms. Remains 16 /20 variables (removed 4) and now considering 14/18 (removed 4) transitions.
[2024-05-21 18:26:20] [INFO ] Redundant transitions in 1 ms returned []
Running 13 sub problems to find dead transitions.
// Phase 1: matrix 14 rows 16 cols
[2024-05-21 18:26:20] [INFO ] Computed 3 invariants in 0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/15 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/15 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 2 (OVERLAPS) 1/16 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/16 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 13 unsolved
Problem TDEAD2 is UNSAT
Problem TDEAD3 is UNSAT
Problem TDEAD5 is UNSAT
Problem TDEAD6 is UNSAT
Problem TDEAD7 is UNSAT
Problem TDEAD9 is UNSAT
Problem TDEAD11 is UNSAT
At refinement iteration 4 (OVERLAPS) 14/30 variables, 16/19 constraints. Problems are: Problem set: 7 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/30 variables, 0/19 constraints. Problems are: Problem set: 7 solved, 6 unsolved
At refinement iteration 6 (OVERLAPS) 0/30 variables, 0/19 constraints. Problems are: Problem set: 7 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 30/30 variables, and 19 constraints, problems are : Problem set: 7 solved, 6 unsolved in 83 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 16/16 constraints, PredecessorRefiner: 13/13 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 7 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 7 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 8/16 variables, 3/3 constraints. Problems are: Problem set: 7 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/16 variables, 0/3 constraints. Problems are: Problem set: 7 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 14/30 variables, 16/19 constraints. Problems are: Problem set: 7 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/30 variables, 6/25 constraints. Problems are: Problem set: 7 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/30 variables, 0/25 constraints. Problems are: Problem set: 7 solved, 6 unsolved
At refinement iteration 6 (OVERLAPS) 0/30 variables, 0/25 constraints. Problems are: Problem set: 7 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 30/30 variables, and 25 constraints, problems are : Problem set: 7 solved, 6 unsolved in 61 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 16/16 constraints, PredecessorRefiner: 6/13 constraints, Known Traps: 0/0 constraints]
After SMT, in 149ms problems are : Problem set: 7 solved, 6 unsolved
Search for dead transitions found 7 dead transitions in 149ms
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 : 16/20 places, 7/18 transitions.
Graph (complete) has 14 edges and 16 vertex of which 9 are kept as prefixes of interest. Removing 7 places using SCC suffix rule.1 ms
Discarding 7 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 4 ms. Remains 9 /16 variables (removed 7) and now considering 7/7 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 9/20 places, 7/18 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 164 ms. Remains : 9/20 places, 7/18 transitions.
Built C files in :
/tmp/ltsmin14906162559442351183
[2024-05-21 18:26:20] [INFO ] Built C files in 6ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14906162559442351183
Running compilation step : cd /tmp/ltsmin14906162559442351183;'/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 196 ms.
Running link step : cd /tmp/ltsmin14906162559442351183;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 37 ms.
Running LTSmin : cd /tmp/ltsmin14906162559442351183;'/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/stateBased2956044244764878857.hoa' '--buchi-type=spotba'
LTSmin run took 1538 ms.
FORMULA ClientsAndServers-PT-N0500P0-LTLCardinality-06 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property ClientsAndServers-PT-N0500P0-LTLCardinality-06 finished in 5564 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((F(p1)&&p0))||G(!p1))))'
Support contains 2 out of 23 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 23/23 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 22 transition count 18
Applied a total of 1 rules in 0 ms. Remains 22 /23 variables (removed 1) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 22 cols
[2024-05-21 18:26:22] [INFO ] Computed 5 invariants in 1 ms
[2024-05-21 18:26:22] [INFO ] Implicit Places using invariants in 28 ms returned [14, 20]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 30 ms to find 2 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 30 ms. Remains : 20/23 places, 18/18 transitions.
Stuttering acceptance computed with spot in 146 ms :[(OR (NOT p0) (NOT p1)), (NOT p1), (AND p1 (NOT p0)), (AND (NOT p0) p1)]
Running random walk in product with property : ClientsAndServers-PT-N0500P0-LTLCardinality-10
Product exploration explored 100000 steps with 0 reset in 152 ms.
Product exploration explored 100000 steps with 0 reset in 158 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT (AND p1 (NOT p0)))), (X (AND (NOT p1) (NOT p0))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT p0))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 10 factoid took 120 ms. Reduced automaton from 4 states, 6 edges and 2 AP (stutter sensitive) to 6 states, 15 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 233 ms :[(NOT p1), (AND p1 (NOT p0)), (AND p1 (NOT p0)), (AND p1 (NOT p0)), (AND p1 (NOT p0)), (OR (NOT p0) (NOT p1))]
Reduction of identical properties reduced properties to check from 6 to 4
RANDOM walk for 48020 steps (8 resets) in 14 ms. (3201 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (8 resets) in 105 ms. (377 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (8 resets) in 57 ms. (689 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (8 resets) in 99 ms. (400 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 96 ms. (412 steps per ms) remains 4/4 properties
Interrupted probabilistic random walk after 2997374 steps, run timeout after 3001 ms. (steps per millisecond=998 ) properties seen :3 out of 4
Probabilistic random walk after 2997374 steps, saw 1220739 distinct states, run finished after 3004 ms. (steps per millisecond=997 ) properties seen :3
// Phase 1: matrix 18 rows 20 cols
[2024-05-21 18:26:26] [INFO ] Computed 3 invariants in 1 ms
Problem apf3 is UNSAT
After SMT solving in domain Real declared 2/38 variables, and 0 constraints, problems are : Problem set: 1 solved, 0 unsolved in 13 ms.
Refiners :[Positive P Invariants (semi-flows): 0/3 constraints, State Equation: 0/20 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 16ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT (AND p1 (NOT p0)))), (X (AND (NOT p1) (NOT p0))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT p0))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT p1))), (G (OR (NOT p0) p1))]
False Knowledge obtained : [(F p0), (F (NOT (OR p0 (NOT p1)))), (F (NOT (OR (NOT p0) (NOT p1)))), (F p1), (F (NOT (AND (NOT p0) (NOT p1))))]
Knowledge based reduction with 11 factoid took 251 ms. Reduced automaton from 6 states, 15 edges and 2 AP (stutter insensitive) to 5 states, 11 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 196 ms :[(NOT p0), (AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) p1), false]
Stuttering acceptance computed with spot in 205 ms :[(NOT p0), (AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) p1), false]
Support contains 2 out of 20 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 20/20 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 20 transition count 12
Reduce places removed 6 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 8 rules applied. Total rules applied 14 place count 14 transition count 10
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 16 place count 12 transition count 10
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 4 Pre rules applied. Total rules applied 16 place count 12 transition count 6
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 24 place count 8 transition count 6
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 26 place count 7 transition count 5
Applied a total of 26 rules in 4 ms. Remains 7 /20 variables (removed 13) and now considering 5/18 (removed 13) transitions.
// Phase 1: matrix 5 rows 7 cols
[2024-05-21 18:26:27] [INFO ] Computed 3 invariants in 0 ms
[2024-05-21 18:26:27] [INFO ] Implicit Places using invariants in 24 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 SI_LTL mode, iteration 1 : 6/20 places, 5/18 transitions.
Applied a total of 0 rules in 1 ms. Remains 6 /6 variables (removed 0) and now considering 5/5 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 33 ms. Remains : 6/20 places, 5/18 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT (AND p0 p1))), (X (NOT p0)), (X (NOT (AND (NOT p0) p1))), (X (NOT p1)), (X (X (NOT (AND p0 p1)))), (X (X (NOT p0))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 110 ms. Reduced automaton from 5 states, 11 edges and 2 AP (stutter insensitive) to 5 states, 11 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 169 ms :[(NOT p0), (AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) p1), false]
Reduction of identical properties reduced properties to check from 4 to 3
RANDOM walk for 8008 steps (0 resets) in 4 ms. (1601 steps per ms) remains 0/3 properties
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT (AND p0 p1))), (X (NOT p0)), (X (NOT (AND (NOT p0) p1))), (X (NOT p1)), (X (X (NOT (AND p0 p1)))), (X (X (NOT p0))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT p1)))]
False Knowledge obtained : [(F p1), (F (NOT (OR (NOT p0) (NOT p1)))), (F (NOT (OR p0 (NOT p1)))), (F p0)]
Knowledge based reduction with 9 factoid took 226 ms. Reduced automaton from 5 states, 11 edges and 2 AP (stutter insensitive) to 5 states, 11 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 238 ms :[(NOT p0), (AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) p1), false]
Stuttering acceptance computed with spot in 220 ms :[(NOT p0), (AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) p1), false]
Stuttering acceptance computed with spot in 205 ms :[(NOT p0), (AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) p1), false]
Product exploration explored 100000 steps with 0 reset in 76 ms.
Product exploration explored 100000 steps with 0 reset in 80 ms.
Built C files in :
/tmp/ltsmin6368815107924264545
[2024-05-21 18:26:28] [INFO ] Computing symmetric may disable matrix : 5 transitions.
[2024-05-21 18:26:28] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 18:26:28] [INFO ] Computing symmetric may enable matrix : 5 transitions.
[2024-05-21 18:26:28] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 18:26:28] [INFO ] Computing Do-Not-Accords matrix : 5 transitions.
[2024-05-21 18:26:28] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 18:26:28] [INFO ] Built C files in 8ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6368815107924264545
Running compilation step : cd /tmp/ltsmin6368815107924264545;'/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/ltsmin6368815107924264545;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 36 ms.
Running LTSmin : cd /tmp/ltsmin6368815107924264545;'/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/stateBased11889460924537954595.hoa' '--buchi-type=spotba'
LTSmin run took 185 ms.
FORMULA ClientsAndServers-PT-N0500P0-LTLCardinality-10 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property ClientsAndServers-PT-N0500P0-LTLCardinality-10 finished in 6424 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 2 out of 23 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 23/23 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 22 transition count 18
Applied a total of 1 rules in 1 ms. Remains 22 /23 variables (removed 1) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 22 cols
[2024-05-21 18:26:29] [INFO ] Computed 5 invariants in 1 ms
[2024-05-21 18:26:29] [INFO ] Implicit Places using invariants in 34 ms returned [14, 20]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 36 ms to find 2 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 37 ms. Remains : 20/23 places, 18/18 transitions.
Stuttering acceptance computed with spot in 82 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : ClientsAndServers-PT-N0500P0-LTLCardinality-12
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA ClientsAndServers-PT-N0500P0-LTLCardinality-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ClientsAndServers-PT-N0500P0-LTLCardinality-12 finished in 136 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((p0||(p1&&F(p2))))))'
Support contains 4 out of 23 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 23/23 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 22 transition count 18
Applied a total of 1 rules in 1 ms. Remains 22 /23 variables (removed 1) and now considering 18/18 (removed 0) transitions.
[2024-05-21 18:26:29] [INFO ] Invariant cache hit.
[2024-05-21 18:26:29] [INFO ] Implicit Places using invariants in 32 ms returned [14, 20]
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/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 169 ms :[(NOT p2), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), true, (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1)))]
Running random walk in product with property : ClientsAndServers-PT-N0500P0-LTLCardinality-13
Product exploration explored 100000 steps with 33333 reset in 114 ms.
Product exploration explored 100000 steps with 33333 reset in 86 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 p2 (NOT p0) p1), (X (X p2)), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT p0))), (X (X p1))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 6 factoid took 21 ms. Reduced automaton from 5 states, 6 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA ClientsAndServers-PT-N0500P0-LTLCardinality-13 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ClientsAndServers-PT-N0500P0-LTLCardinality-13 finished in 441 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(X((G(F(p0)) U (p1&&G(F(!p0))))))))'
Support contains 3 out of 23 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 23/23 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 22 transition count 18
Applied a total of 1 rules in 1 ms. Remains 22 /23 variables (removed 1) and now considering 18/18 (removed 0) transitions.
[2024-05-21 18:26:29] [INFO ] Invariant cache hit.
[2024-05-21 18:26:29] [INFO ] Implicit Places using invariants in 35 ms returned [14, 20]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 36 ms to find 2 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 38 ms. Remains : 20/23 places, 18/18 transitions.
Stuttering acceptance computed with spot in 317 ms :[(OR (NOT p1) p0), (OR (NOT p1) p0), (OR (NOT p1) p0), (OR (NOT p1) p0), (NOT p0), (NOT p0), p0, p0]
Running random walk in product with property : ClientsAndServers-PT-N0500P0-LTLCardinality-14
Product exploration explored 100000 steps with 7131 reset in 70 ms.
Product exploration explored 100000 steps with 7078 reset in 80 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)]
False Knowledge obtained : []
Knowledge based reduction with 1 factoid took 76 ms. Reduced automaton from 8 states, 14 edges and 2 AP (stutter sensitive) to 8 states, 14 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 321 ms :[(OR (NOT p1) p0), (OR (NOT p1) p0), (OR (NOT p1) p0), (OR (NOT p1) p0), (NOT p0), (NOT p0), p0, p0]
RANDOM walk for 48020 steps (8 resets) in 17 ms. (2667 steps per ms) remains 4/4 properties
BEST_FIRST walk for 548 steps (0 resets) in 7 ms. (68 steps per ms) remains 0/4 properties
Knowledge obtained : [(AND p1 p0)]
False Knowledge obtained : [(F (NOT p0)), (F (NOT (AND p0 p1))), (F (NOT p1)), (F (NOT (OR p0 p1)))]
Knowledge based reduction with 1 factoid took 179 ms. Reduced automaton from 8 states, 14 edges and 2 AP (stutter sensitive) to 8 states, 14 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 530 ms :[(OR (NOT p1) p0), (OR (NOT p1) p0), (OR (NOT p1) p0), (OR (NOT p1) p0), (NOT p0), (NOT p0), p0, p0]
Stuttering acceptance computed with spot in 321 ms :[(OR (NOT p1) p0), (OR (NOT p1) p0), (OR (NOT p1) p0), (OR (NOT p1) p0), (NOT p0), (NOT p0), p0, p0]
// Phase 1: matrix 18 rows 20 cols
[2024-05-21 18:26:31] [INFO ] Computed 3 invariants in 1 ms
[2024-05-21 18:26:31] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-21 18:26:31] [INFO ] [Real]Absence check using state equation in 6 ms returned sat
[2024-05-21 18:26:31] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 18:26:31] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-21 18:26:31] [INFO ] [Nat]Absence check using state equation in 6 ms returned sat
[2024-05-21 18:26:31] [INFO ] Computed and/alt/rep : 17/17/17 causal constraints (skipped 0 transitions) in 2 ms.
[2024-05-21 18:26:31] [INFO ] Added : 3 causal constraints over 1 iterations in 7 ms. Result :sat
Could not prove EG p0
Support contains 3 out of 20 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 20/20 places, 18/18 transitions.
Applied a total of 0 rules in 0 ms. Remains 20 /20 variables (removed 0) and now considering 18/18 (removed 0) transitions.
[2024-05-21 18:26:31] [INFO ] Invariant cache hit.
[2024-05-21 18:26:31] [INFO ] Implicit Places using invariants in 58 ms returned []
[2024-05-21 18:26:31] [INFO ] Invariant cache hit.
[2024-05-21 18:26:31] [INFO ] Implicit Places using invariants and state equation in 23 ms returned []
Implicit Place search using SMT with State Equation took 83 ms to find 0 implicit places.
Running 17 sub problems to find dead transitions.
[2024-05-21 18:26:31] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/19 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/19 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 2 (OVERLAPS) 1/20 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/20 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 4 (OVERLAPS) 18/38 variables, 20/23 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/38 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 6 (OVERLAPS) 0/38 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 17 unsolved
No progress, stopping.
After SMT solving in domain Real declared 38/38 variables, and 23 constraints, problems are : Problem set: 0 solved, 17 unsolved in 147 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 124 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 279ms problems are : Problem set: 0 solved, 17 unsolved
Search for dead transitions found 0 dead transitions in 279ms
Finished structural reductions in LTL mode , in 1 iterations and 362 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 p1 p0)]
False Knowledge obtained : []
Knowledge based reduction with 1 factoid took 107 ms. Reduced automaton from 8 states, 14 edges and 2 AP (stutter sensitive) to 8 states, 14 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 332 ms :[(OR (NOT p1) p0), (OR (NOT p1) p0), (OR (NOT p1) p0), (OR (NOT p1) p0), (NOT p0), (NOT p0), p0, p0]
RANDOM walk for 48020 steps (8 resets) in 13 ms. (3430 steps per ms) remains 4/4 properties
BEST_FIRST walk for 572 steps (0 resets) in 4 ms. (114 steps per ms) remains 0/4 properties
Knowledge obtained : [(AND p1 p0)]
False Knowledge obtained : [(F (NOT p0)), (F (NOT (AND p0 p1))), (F (NOT p1)), (F (NOT (OR p0 p1)))]
Knowledge based reduction with 1 factoid took 169 ms. Reduced automaton from 8 states, 14 edges and 2 AP (stutter sensitive) to 8 states, 14 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 315 ms :[(OR (NOT p1) p0), (OR (NOT p1) p0), (OR (NOT p1) p0), (OR (NOT p1) p0), (NOT p0), (NOT p0), p0, p0]
Stuttering acceptance computed with spot in 307 ms :[(OR (NOT p1) p0), (OR (NOT p1) p0), (OR (NOT p1) p0), (OR (NOT p1) p0), (NOT p0), (NOT p0), p0, p0]
[2024-05-21 18:26:33] [INFO ] Invariant cache hit.
[2024-05-21 18:26:33] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-21 18:26:33] [INFO ] [Real]Absence check using state equation in 8 ms returned sat
[2024-05-21 18:26:33] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 18:26:33] [INFO ] [Nat]Absence check using 3 positive place invariants in 0 ms returned sat
[2024-05-21 18:26:33] [INFO ] [Nat]Absence check using state equation in 5 ms returned sat
[2024-05-21 18:26:33] [INFO ] Computed and/alt/rep : 17/17/17 causal constraints (skipped 0 transitions) in 1 ms.
[2024-05-21 18:26:33] [INFO ] Added : 3 causal constraints over 1 iterations in 4 ms. Result :sat
Could not prove EG p0
Stuttering acceptance computed with spot in 344 ms :[(OR (NOT p1) p0), (OR (NOT p1) p0), (OR (NOT p1) p0), (OR (NOT p1) p0), (NOT p0), (NOT p0), p0, p0]
Product exploration explored 100000 steps with 7131 reset in 61 ms.
Product exploration explored 100000 steps with 7138 reset in 63 ms.
Applying partial POR strategy [false, false, false, true, true, true, true, true]
Stuttering acceptance computed with spot in 319 ms :[(OR (NOT p1) p0), (OR (NOT p1) p0), (OR (NOT p1) p0), (OR (NOT p1) p0), (NOT p0), (NOT p0), p0, p0]
Support contains 3 out of 20 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 20/20 places, 18/18 transitions.
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 20 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 5 place count 20 transition count 18
Deduced a syphon composed of 8 places in 0 ms
Iterating global reduction 1 with 3 rules applied. Total rules applied 8 place count 20 transition count 18
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 11 place count 17 transition count 15
Deduced a syphon composed of 5 places in 0 ms
Iterating global reduction 1 with 3 rules applied. Total rules applied 14 place count 17 transition count 15
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 8 places in 1 ms
Iterating global reduction 1 with 3 rules applied. Total rules applied 17 place count 17 transition count 15
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 19 place count 15 transition count 13
Deduced a syphon composed of 6 places in 0 ms
Iterating global reduction 1 with 2 rules applied. Total rules applied 21 place count 15 transition count 13
Deduced a syphon composed of 6 places in 1 ms
Applied a total of 21 rules in 10 ms. Remains 15 /20 variables (removed 5) and now considering 13/18 (removed 5) transitions.
[2024-05-21 18:26:34] [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 18:26:34] [INFO ] Computed 3 invariants in 1 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 TDEAD2 is UNSAT
Problem TDEAD5 is UNSAT
Problem TDEAD6 is UNSAT
Problem TDEAD7 is UNSAT
Problem TDEAD10 is UNSAT
Problem TDEAD11 is UNSAT
At refinement iteration 4 (OVERLAPS) 13/28 variables, 15/18 constraints. Problems are: Problem set: 6 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/28 variables, 0/18 constraints. Problems are: Problem set: 6 solved, 6 unsolved
At refinement iteration 6 (OVERLAPS) 0/28 variables, 0/18 constraints. Problems are: Problem set: 6 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 28/28 variables, and 18 constraints, problems are : Problem set: 6 solved, 6 unsolved in 96 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: 6 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 6 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 7/15 variables, 3/3 constraints. Problems are: Problem set: 6 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/15 variables, 0/3 constraints. Problems are: Problem set: 6 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 13/28 variables, 15/18 constraints. Problems are: Problem set: 6 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/28 variables, 6/24 constraints. Problems are: Problem set: 6 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/28 variables, 0/24 constraints. Problems are: Problem set: 6 solved, 6 unsolved
At refinement iteration 6 (OVERLAPS) 0/28 variables, 0/24 constraints. Problems are: Problem set: 6 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 28/28 variables, and 24 constraints, problems are : Problem set: 6 solved, 6 unsolved in 55 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 15/15 constraints, PredecessorRefiner: 6/12 constraints, Known Traps: 0/0 constraints]
After SMT, in 160ms problems are : Problem set: 6 solved, 6 unsolved
Search for dead transitions found 6 dead transitions in 160ms
Found 6 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 6 transitions
Dead transitions reduction (with SMT) removed 6 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 15/20 places, 7/18 transitions.
Graph (complete) has 15 edges and 15 vertex of which 9 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.1 ms
Discarding 6 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 1 ms. Remains 9 /15 variables (removed 6) and now considering 7/7 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 9/20 places, 7/18 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 180 ms. Remains : 9/20 places, 7/18 transitions.
Built C files in :
/tmp/ltsmin7176618736135129167
[2024-05-21 18:26:34] [INFO ] Built C files in 1ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7176618736135129167
Running compilation step : cd /tmp/ltsmin7176618736135129167;'/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/ltsmin7176618736135129167;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 32 ms.
Running LTSmin : cd /tmp/ltsmin7176618736135129167;'/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/stateBased12078539609189468256.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
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 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 18:26:49] [INFO ] Computed 3 invariants in 1 ms
[2024-05-21 18:26:49] [INFO ] Implicit Places using invariants in 35 ms returned []
[2024-05-21 18:26:49] [INFO ] Invariant cache hit.
[2024-05-21 18:26:49] [INFO ] Implicit Places using invariants and state equation in 31 ms returned []
Implicit Place search using SMT with State Equation took 71 ms to find 0 implicit places.
Running 17 sub problems to find dead transitions.
[2024-05-21 18:26:49] [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 151 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 270ms problems are : Problem set: 0 solved, 17 unsolved
Search for dead transitions found 0 dead transitions in 270ms
Finished structural reductions in LTL mode , in 1 iterations and 343 ms. Remains : 20/20 places, 18/18 transitions.
Built C files in :
/tmp/ltsmin2620447535968250775
[2024-05-21 18:26:50] [INFO ] Built C files in 1ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2620447535968250775
Running compilation step : cd /tmp/ltsmin2620447535968250775;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 95 ms.
Running link step : cd /tmp/ltsmin2620447535968250775;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 33 ms.
Running LTSmin : cd /tmp/ltsmin2620447535968250775;'/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/stateBased8347320810570131248.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-21 18:27:05] [INFO ] Flatten gal took : 2 ms
[2024-05-21 18:27:05] [INFO ] Flatten gal took : 3 ms
[2024-05-21 18:27:05] [INFO ] Time to serialize gal into /tmp/LTL15484185668493258164.gal : 1 ms
[2024-05-21 18:27:05] [INFO ] Time to serialize properties into /tmp/LTL11914897566261272919.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/LTL15484185668493258164.gal' '-t' 'CGAL' '-hoa' '/tmp/aut2747624383022736927.hoa' '-atoms' '/tmp/LTL11914897566261272919.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/LTL11914897566261272919.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut2747624383022736927.hoa
Detected timeout of ITS tools.
[2024-05-21 18:27:20] [INFO ] Flatten gal took : 2 ms
[2024-05-21 18:27:20] [INFO ] Flatten gal took : 2 ms
[2024-05-21 18:27:20] [INFO ] Time to serialize gal into /tmp/LTL1465850564289941855.gal : 1 ms
[2024-05-21 18:27:20] [INFO ] Time to serialize properties into /tmp/LTL6577144652267129327.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/LTL1465850564289941855.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL6577144652267129327.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(X((G(F("(MpG<=CF)")))U(("(SpG<1)")&&(G(F("(MpG>CF)")))))))))
Formula 0 simplified : XXX(FG!"(MpG<=CF)" R (!"(SpG<1)" | FG!"(MpG>CF)"))
Detected timeout of ITS tools.
[2024-05-21 18:27:35] [INFO ] Flatten gal took : 3 ms
[2024-05-21 18:27:35] [INFO ] Applying decomposition
[2024-05-21 18:27:35] [INFO ] Flatten gal took : 2 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/graph15522909363801302594.txt' '-o' '/tmp/graph15522909363801302594.bin' '-w' '/tmp/graph15522909363801302594.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph15522909363801302594.bin' '-l' '-1' '-v' '-w' '/tmp/graph15522909363801302594.weights' '-q' '0' '-e' '0.001'
[2024-05-21 18:27:35] [INFO ] Decomposing Gal with order
[2024-05-21 18:27:35] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 18:27:35] [INFO ] Removed a total of 1 redundant transitions.
[2024-05-21 18:27:35] [INFO ] Flatten gal took : 35 ms
[2024-05-21 18:27:35] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 2 ms.
[2024-05-21 18:27:35] [INFO ] Time to serialize gal into /tmp/LTL8810843672931997118.gal : 1 ms
[2024-05-21 18:27:35] [INFO ] Time to serialize properties into /tmp/LTL17810879498590893198.ltl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL8810843672931997118.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL17810879498590893198.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((X(X(X((G(F("(gu3.MpG<=gu3.CF)")))U(("(gi1.gi0.gu5.SpG<1)")&&(G(F("(gu3.MpG>gu3.CF)")))))))))
Formula 0 simplified : XXX(FG!"(gu3.MpG<=gu3.CF)" R (!"(gi1.gi0.gu5.SpG<1)" | FG!"(gu3.MpG>gu3.CF)"))
Detected timeout of ITS tools.
Treatment of property ClientsAndServers-PT-N0500P0-LTLCardinality-14 finished in 80777 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 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 2 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 18:27:50] [INFO ] Computed 6 invariants in 2 ms
[2024-05-21 18:27:50] [INFO ] Implicit Places using invariants in 37 ms returned []
[2024-05-21 18:27:50] [INFO ] Invariant cache hit.
[2024-05-21 18:27:50] [INFO ] Implicit Places using invariants and state equation in 29 ms returned []
Implicit Place search using SMT with State Equation took 68 ms to find 0 implicit places.
Running 17 sub problems to find dead transitions.
[2024-05-21 18:27:50] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/22 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/22 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/22 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 3 (OVERLAPS) 1/23 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/23 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/23 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 6 (OVERLAPS) 18/41 variables, 23/29 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/41 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 8 (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 151 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, Generalized P Invariants (flows): 2/2 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, 2/2 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/22 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/22 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 3 (OVERLAPS) 1/23 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/23 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/23 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 6 (OVERLAPS) 18/41 variables, 23/29 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/41 variables, 17/46 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/41 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 9 (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 143 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 23/23 constraints, PredecessorRefiner: 17/17 constraints, Known Traps: 0/0 constraints]
After SMT, in 303ms problems are : Problem set: 0 solved, 17 unsolved
Search for dead transitions found 0 dead transitions in 304ms
Finished structural reductions in LTL mode , in 1 iterations and 374 ms. Remains : 23/23 places, 18/18 transitions.
Stuttering acceptance computed with spot in 112 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : ClientsAndServers-PT-N0500P0-LTLCardinality-15
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA ClientsAndServers-PT-N0500P0-LTLCardinality-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ClientsAndServers-PT-N0500P0-LTLCardinality-15 finished in 511 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X((G(F(p0)) U (p1&&G(F(!p0))))))))'
[2024-05-21 18:27:51] [INFO ] Flatten gal took : 6 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin713009694365186463
[2024-05-21 18:27:51] [INFO ] Computing symmetric may disable matrix : 18 transitions.
[2024-05-21 18:27:51] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 18:27:51] [INFO ] Computing symmetric may enable matrix : 18 transitions.
[2024-05-21 18:27:51] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 18:27:51] [INFO ] Computing Do-Not-Accords matrix : 18 transitions.
[2024-05-21 18:27:51] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 18:27:51] [INFO ] Built C files in 4ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin713009694365186463
Running compilation step : cd /tmp/ltsmin713009694365186463;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '720' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
[2024-05-21 18:27:51] [INFO ] Applying decomposition
[2024-05-21 18:27:51] [INFO ] Flatten gal took : 2 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/graph8846022010117323468.txt' '-o' '/tmp/graph8846022010117323468.bin' '-w' '/tmp/graph8846022010117323468.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph8846022010117323468.bin' '-l' '-1' '-v' '-w' '/tmp/graph8846022010117323468.weights' '-q' '0' '-e' '0.001'
[2024-05-21 18:27:51] [INFO ] Decomposing Gal with order
[2024-05-21 18:27:51] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 18:27:51] [INFO ] Removed a total of 2 redundant transitions.
[2024-05-21 18:27:51] [INFO ] Flatten gal took : 3 ms
[2024-05-21 18:27:51] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 0 ms.
[2024-05-21 18:27:51] [INFO ] Time to serialize gal into /tmp/LTLCardinality7328003825704526282.gal : 1 ms
[2024-05-21 18:27:51] [INFO ] Time to serialize properties into /tmp/LTLCardinality18435923732962457921.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/LTLCardinality7328003825704526282.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality18435923732962457921.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 1 LTL properties
Checking formula 0 : !((X(X(X((G(F("(gu2.MpG<=gu2.CF)")))U(("(gi1.gu7.SpG<1)")&&(G(F("(gu2.MpG>gu2.CF)")))))))))
Formula 0 simplified : XXX(FG!"(gu2.MpG<=gu2.CF)" R (!"(gi1.gu7.SpG<1)" | FG!"(gu2.MpG>gu2.CF)"))
Compilation finished in 109 ms.
Running link step : cd /tmp/ltsmin713009694365186463;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 28 ms.
Running LTSmin : cd /tmp/ltsmin713009694365186463;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X(X(X(([](<>((LTLAPp0==true))) U ((LTLAPp1==true)&&[](<>(!(LTLAPp0==true))))))))' '--buchi-type=spotba'
pins2lts-mc-linux64, 0.000: Registering PINS so language module
pins2lts-mc-linux64( 2/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 2/ 8), 0.001: loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 4/ 8), 0.001: loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.002: completed loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.002: LTL layer: formula: X(X(X(([](<>((LTLAPp0==true))) U ((LTLAPp1==true)&&[](<>(!(LTLAPp0==true))))))))
pins2lts-mc-linux64( 4/ 8), 0.001: completed loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.002: "X(X(X(([](<>((LTLAPp0==true))) U ((LTLAPp1==true)&&[](<>(!(LTLAPp0==true))))))))" is not a file, parsing as formula...
pins2lts-mc-linux64( 3/ 8), 0.002: library has no initializer
pins2lts-mc-linux64( 3/ 8), 0.002: loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.002: Using Spin LTL semantics
pins2lts-mc-linux64( 3/ 8), 0.002: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.003: Loading model from ./gal.so
pins2lts-mc-linux64( 0/ 8), 0.003: library has no initializer
pins2lts-mc-linux64( 0/ 8), 0.003: loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.003: completed loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.002: library has no initializer
pins2lts-mc-linux64( 5/ 8), 0.002: loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.002: completed 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( 1/ 8), 0.002: 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.003: completed loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.002: library has no initializer
pins2lts-mc-linux64( 6/ 8), 0.002: loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.003: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.014: Weak Buchi automaton detected, adding non-accepting as progress label.
pins2lts-mc-linux64( 0/ 8), 0.143: DFS-FIFO for weak LTL, using special progress label 21
pins2lts-mc-linux64( 0/ 8), 0.143: There are 22 state labels and 1 edge labels
pins2lts-mc-linux64( 0/ 8), 0.143: State length is 24, there are 32 groups
pins2lts-mc-linux64( 0/ 8), 0.143: Running dfsfifo using 8 cores
pins2lts-mc-linux64( 0/ 8), 0.143: Using a tree table with 2^27 elements
pins2lts-mc-linux64( 0/ 8), 0.143: Successor permutation: rr
pins2lts-mc-linux64( 0/ 8), 0.143: Global bits: 2, count bits: 0, local bits: 0
pins2lts-mc-linux64( 7/ 8), 0.164: ~100 levels ~960 states ~3480 transitions
pins2lts-mc-linux64( 7/ 8), 0.181: ~201 levels ~1920 states ~7120 transitions
pins2lts-mc-linux64( 7/ 8), 0.215: ~407 levels ~3840 states ~15320 transitions
pins2lts-mc-linux64( 7/ 8), 0.287: ~816 levels ~7680 states ~31352 transitions
pins2lts-mc-linux64( 7/ 8), 0.502: ~1611 levels ~15360 states ~62952 transitions
pins2lts-mc-linux64( 7/ 8), 0.901: ~3211 levels ~30720 states ~126736 transitions
pins2lts-mc-linux64( 7/ 8), 1.274: ~6025 levels ~61440 states ~190960 transitions
pins2lts-mc-linux64( 7/ 8), 1.526: ~7000 levels ~122880 states ~292112 transitions
pins2lts-mc-linux64( 7/ 8), 2.005: ~7000 levels ~245760 states ~533968 transitions
pins2lts-mc-linux64( 2/ 8), 2.735: ~6998 levels ~491520 states ~994544 transitions
pins2lts-mc-linux64( 2/ 8), 4.061: ~6998 levels ~983040 states ~1911672 transitions
pins2lts-mc-linux64( 7/ 8), 6.052: ~7000 levels ~1966080 states ~3361728 transitions
pins2lts-mc-linux64( 7/ 8), 8.603: ~7000 levels ~3932160 states ~6583736 transitions
pins2lts-mc-linux64( 7/ 8), 12.408: ~7000 levels ~7864320 states ~14438168 transitions
pins2lts-mc-linux64( 7/ 8), 19.543: ~7000 levels ~15728640 states ~30050552 transitions
pins2lts-mc-linux64( 7/ 8), 35.491: ~7000 levels ~31457280 states ~61392232 transitions
pins2lts-mc-linux64( 7/ 8), 66.016: ~7000 levels ~62914560 states ~124035328 transitions
pins2lts-mc-linux64( 7/ 8), 133.288: ~7000 levels ~125829120 states ~258032896 transitions
pins2lts-mc-linux64( 7/ 8), 155.472: Error: tree leafs table full! Change -s/--ratio.
pins2lts-mc-linux64( 0/ 8), 155.478:
pins2lts-mc-linux64( 0/ 8), 155.478: mean standard work distribution: 173.5% (states) 173.2% (transitions)
pins2lts-mc-linux64( 0/ 8), 155.478:
pins2lts-mc-linux64( 0/ 8), 155.478: Explored 32608289 states 72661715 transitions, fanout: 2.228
pins2lts-mc-linux64( 0/ 8), 155.478: Total exploration time 155.330 sec (155.300 sec minimum, 155.312 sec on average)
pins2lts-mc-linux64( 0/ 8), 155.478: States per second: 209929, Transitions per second: 467789
pins2lts-mc-linux64( 0/ 8), 155.478:
pins2lts-mc-linux64( 0/ 8), 155.478: Progress states detected: 6
pins2lts-mc-linux64( 0/ 8), 155.478: Redundant explorations: 0.1592
pins2lts-mc-linux64( 0/ 8), 155.478:
pins2lts-mc-linux64( 0/ 8), 155.478: Queue width: 8B, total height: 14010, memory: 0.11MB
pins2lts-mc-linux64( 0/ 8), 155.478: Tree memory: 504.4MB, 16.2 B/state, compr.: 16.6%
pins2lts-mc-linux64( 0/ 8), 155.478: Tree fill ratio (roots/leafs): 24.0%/99.0%
pins2lts-mc-linux64( 0/ 8), 155.478: Stored 18 string chucks using 0MB
pins2lts-mc-linux64( 0/ 8), 155.478: Total memory used for chunk indexing: 0MB
pins2lts-mc-linux64( 0/ 8), 155.478: Est. total memory use: 504.5MB (~1024.1MB paged-in)
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin713009694365186463;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X(X(X(([](<>((LTLAPp0==true))) U ((LTLAPp1==true)&&[](<>(!(LTLAPp0==true))))))))' '--buchi-type=spotba'
255
java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin713009694365186463;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X(X(X(([](<>((LTLAPp0==true))) U ((LTLAPp1==true)&&[](<>(!(LTLAPp0==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 18:44:06] [INFO ] Flatten gal took : 3 ms
[2024-05-21 18:44:06] [INFO ] Time to serialize gal into /tmp/LTLCardinality4322335693170518473.gal : 1 ms
[2024-05-21 18:44:06] [INFO ] Time to serialize properties into /tmp/LTLCardinality16858055181784426087.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/LTLCardinality4322335693170518473.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality16858055181784426087.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 1 LTL properties
Checking formula 0 : !((X(X(X((G(F("(MpG<=CF)")))U(("(SpG<1)")&&(G(F("(MpG>CF)")))))))))
Formula 0 simplified : XXX(FG!"(MpG<=CF)" R (!"(SpG<1)" | FG!"(MpG>CF)"))
Detected timeout of ITS tools.
[2024-05-21 19:04:39] [INFO ] Flatten gal took : 6 ms
[2024-05-21 19:04:39] [INFO ] Input system was already deterministic with 18 transitions.
[2024-05-21 19:04:39] [INFO ] Transformed 23 places.
[2024-05-21 19:04:39] [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 19:04:39] [INFO ] Time to serialize gal into /tmp/LTLCardinality1417430251187474283.gal : 1 ms
[2024-05-21 19:04:39] [INFO ] Time to serialize properties into /tmp/LTLCardinality16662020131852097923.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/LTLCardinality1417430251187474283.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality16662020131852097923.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 1 LTL properties
Successfully loaded order from file /home/mcc/execution/model.ord
Checking formula 0 : !((X(X(X((G(F("(MpG<=CF)")))U(("(SpG<1)")&&(G(F("(MpG>CF)")))))))))
Formula 0 simplified : XXX(FG!"(MpG<=CF)" R (!"(SpG<1)" | FG!"(MpG>CF)"))
Detected timeout of ITS tools.
Total runtime 3538518 ms.

BK_STOP 1716319511938

--------------------
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-N0500P0"
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-N0500P0, 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-171620506000507"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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