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.r087-tall-171620521900307.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 gold2023
Input is ClientsAndServers-PT-N0100P0, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r087-tall-171620521900307
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 520K
-rw-r--r-- 1 mcc users 6.1K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 61K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.3K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 49K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:42 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K May 18 16:42 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.4K Apr 22 14:33 LTLCardinality.txt
-rw-r--r-- 1 mcc users 22K Apr 22 14:33 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K May 19 07:14 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 19 18:02 LTLFireability.xml
-rw-r--r-- 1 mcc users 15K Apr 12 23:10 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 169K Apr 12 23:10 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.5K Apr 12 23:09 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 86K Apr 12 23:09 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Apr 22 14:33 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Apr 22 14:33 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 8 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 9.2K May 18 16:42 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1716257002095

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=gold2023
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ClientsAndServers-PT-N0100P0
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202304061127
[2024-05-21 02:03:23] [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 02:03:23] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-21 02:03:23] [INFO ] Load time of PNML (sax parser for PT used): 22 ms
[2024-05-21 02:03:23] [INFO ] Transformed 25 places.
[2024-05-21 02:03:23] [INFO ] Transformed 18 transitions.
[2024-05-21 02:03:23] [INFO ] Parsed PT model containing 25 places and 18 transitions and 54 arcs in 78 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 8 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
FORMULA ClientsAndServers-PT-N0100P0-LTLCardinality-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ClientsAndServers-PT-N0100P0-LTLCardinality-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ClientsAndServers-PT-N0100P0-LTLCardinality-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 21 out of 25 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 25/25 places, 18/18 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 24 transition count 18
Applied a total of 1 rules in 9 ms. Remains 24 /25 variables (removed 1) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 24 cols
[2024-05-21 02:03:23] [INFO ] Computed 7 invariants in 13 ms
[2024-05-21 02:03:24] [INFO ] Implicit Places using invariants in 322 ms returned []
[2024-05-21 02:03:24] [INFO ] Invariant cache hit.
[2024-05-21 02:03:24] [INFO ] Implicit Places using invariants and state equation in 38 ms returned []
Implicit Place search using SMT with State Equation took 383 ms to find 0 implicit places.
[2024-05-21 02:03:24] [INFO ] Invariant cache hit.
[2024-05-21 02:03:24] [INFO ] Dead Transitions using invariants and state equation in 37 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 24/25 places, 18/18 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 430 ms. Remains : 24/25 places, 18/18 transitions.
Support contains 21 out of 24 places after structural reductions.
[2024-05-21 02:03:24] [INFO ] Flatten gal took : 15 ms
[2024-05-21 02:03:24] [INFO ] Flatten gal took : 4 ms
[2024-05-21 02:03:24] [INFO ] Input system was already deterministic with 18 transitions.
Support contains 20 out of 24 places (down from 21) after GAL structural reductions.
Incomplete random walk after 10043 steps, including 2 resets, run finished after 40 ms. (steps per millisecond=251 ) properties (out of 19) seen :8
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 60 ms. (steps per millisecond=166 ) properties (out of 11) seen :8
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 67 ms. (steps per millisecond=149 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
[2024-05-21 02:03:24] [INFO ] Invariant cache hit.
[2024-05-21 02:03:24] [INFO ] After 40ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2024-05-21 02:03:24] [INFO ] [Nat]Absence check using 4 positive place invariants in 2 ms returned sat
[2024-05-21 02:03:24] [INFO ] [Nat]Absence check using 4 positive and 3 generalized place invariants in 2 ms returned sat
[2024-05-21 02:03:24] [INFO ] After 46ms SMT Verify possible using all constraints in natural domain returned unsat :3 sat :0
Fused 3 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
FORMULA ClientsAndServers-PT-N0100P0-LTLCardinality-01 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 3 atomic propositions for a total of 12 simplifications.
FORMULA ClientsAndServers-PT-N0100P0-LTLCardinality-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ClientsAndServers-PT-N0100P0-LTLCardinality-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ClientsAndServers-PT-N0100P0-LTLCardinality-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 0 stabilizing places and 0 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 1 out of 24 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 24/24 places, 18/18 transitions.
Discarding 3 places :
Implicit places reduction removed 3 places
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 21 transition count 18
Applied a total of 3 rules in 1 ms. Remains 21 /24 variables (removed 3) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 21 cols
[2024-05-21 02:03:24] [INFO ] Computed 4 invariants in 2 ms
[2024-05-21 02:03:24] [INFO ] Implicit Places using invariants in 37 ms returned [14]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 38 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 20/24 places, 18/18 transitions.
Applied a total of 0 rules in 0 ms. Remains 20 /20 variables (removed 0) and now considering 18/18 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 39 ms. Remains : 20/24 places, 18/18 transitions.
ANTLR Tool version 4.9.3 used for code generation does not match the current runtime version 4.7.2ANTLR Runtime version 4.9.3 used for parser compilation does not match the current runtime version 4.7.2ANTLR Tool version 4.9.3 used for code generation does not match the current runtime version 4.7.2ANTLR Runtime version 4.9.3 used for parser compilation does not match the current runtime version 4.7.2Stuttering acceptance computed with spot in 191 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : ClientsAndServers-PT-N0100P0-LTLCardinality-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(GT 3 s18)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 219 steps with 0 reset in 7 ms.
FORMULA ClientsAndServers-PT-N0100P0-LTLCardinality-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ClientsAndServers-PT-N0100P0-LTLCardinality-03 finished in 286 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0||G(p1)||X(F(p2)))))'
Support contains 4 out of 24 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 24/24 places, 18/18 transitions.
Discarding 3 places :
Implicit places reduction removed 3 places
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 21 transition count 18
Applied a total of 3 rules in 1 ms. Remains 21 /24 variables (removed 3) and now considering 18/18 (removed 0) transitions.
[2024-05-21 02:03:25] [INFO ] Invariant cache hit.
[2024-05-21 02:03:25] [INFO ] Implicit Places using invariants in 29 ms returned [14]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 29 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 20/24 places, 18/18 transitions.
Applied a total of 0 rules in 1 ms. Remains 20 /20 variables (removed 0) and now considering 18/18 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 31 ms. Remains : 20/24 places, 18/18 transitions.
Stuttering acceptance computed with spot in 151 ms :[(NOT p2), (AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p1))]
Running random walk in product with property : ClientsAndServers-PT-N0100P0-LTLCardinality-05 automaton TGBA Formula[mat=[[{ cond=(NOT p2), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=3 dest: 0}, { cond=(AND p1 (NOT p2)), acceptance={} source=3 dest: 3}]], initial=1, aps=[p2:(GT s6 s10), p0:(GT s5 s19), p1:(GT 2 s19)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 2245 reset in 214 ms.
Product exploration explored 100000 steps with 2237 reset in 133 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p2) (NOT p0) (NOT p1)), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) p1))), (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT p2))), (X (X (NOT (AND p1 (NOT p2)))))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 182 ms. Reduced automaton from 4 states, 6 edges and 3 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 111 ms :[(NOT p2), (NOT p2), (NOT p2)]
Incomplete random walk after 10043 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=2510 ) properties (out of 1) seen :0
Finished Best-First random walk after 273 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=273 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND (NOT p2) (NOT p0) (NOT p1)), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) p1))), (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT p2))), (X (X (NOT (AND p1 (NOT p2)))))]
False Knowledge obtained : [(F p2)]
Knowledge based reduction with 6 factoid took 125 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 96 ms :[(NOT p2), (NOT p2), (NOT p2)]
Stuttering acceptance computed with spot in 109 ms :[(NOT p2), (NOT p2), (NOT p2)]
// Phase 1: matrix 18 rows 20 cols
[2024-05-21 02:03:26] [INFO ] Computed 3 invariants in 1 ms
[2024-05-21 02:03:26] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-21 02:03:26] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-21 02:03:26] [INFO ] [Real]Absence check using state equation in 6 ms returned sat
[2024-05-21 02:03:26] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 02:03:26] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned unsat
Proved EG (NOT p2)
Knowledge obtained : [(AND (NOT p2) (NOT p0) (NOT p1)), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) p1))), (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT p2))), (X (X (NOT (AND p1 (NOT p2)))))]
False Knowledge obtained : [(F p2), (G (NOT p2))]
Property proved to be false thanks to negative knowledge :(G (NOT p2))
Knowledge based reduction with 6 factoid took 128 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA ClientsAndServers-PT-N0100P0-LTLCardinality-05 FALSE TECHNIQUES KNOWLEDGE
Treatment of property ClientsAndServers-PT-N0100P0-LTLCardinality-05 finished in 1403 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 1 out of 24 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 24/24 places, 18/18 transitions.
Discarding 3 places :
Implicit places reduction removed 3 places
Drop transitions removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 0 with 9 rules applied. Total rules applied 9 place count 21 transition count 12
Reduce places removed 6 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 7 rules applied. Total rules applied 16 place count 15 transition count 11
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 17 place count 14 transition count 11
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 17 place count 14 transition count 9
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 21 place count 12 transition count 9
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 25 place count 10 transition count 7
Applied a total of 25 rules in 10 ms. Remains 10 /24 variables (removed 14) and now considering 7/18 (removed 11) transitions.
// Phase 1: matrix 7 rows 10 cols
[2024-05-21 02:03:26] [INFO ] Computed 4 invariants in 0 ms
[2024-05-21 02:03:26] [INFO ] Implicit Places using invariants in 22 ms returned [7, 9]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 24 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 8/24 places, 7/18 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 8 transition count 5
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 6 transition count 5
Applied a total of 4 rules in 1 ms. Remains 6 /8 variables (removed 2) and now considering 5/7 (removed 2) transitions.
// Phase 1: matrix 5 rows 6 cols
[2024-05-21 02:03:26] [INFO ] Computed 2 invariants in 0 ms
[2024-05-21 02:03:26] [INFO ] Implicit Places using invariants in 18 ms returned []
[2024-05-21 02:03:26] [INFO ] Invariant cache hit.
[2024-05-21 02:03:26] [INFO ] Implicit Places using invariants and state equation in 32 ms returned []
Implicit Place search using SMT with State Equation took 52 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 6/24 places, 5/18 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 87 ms. Remains : 6/24 places, 5/18 transitions.
Stuttering acceptance computed with spot in 35 ms :[(NOT p0)]
Running random walk in product with property : ClientsAndServers-PT-N0100P0-LTLCardinality-06 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(LEQ 1 s1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Product exploration explored 100000 steps with 10268 reset in 76 ms.
Product exploration explored 100000 steps with 10221 reset in 141 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 69 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 27 ms :[(NOT p0)]
Finished random walk after 1006 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=503 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 104 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 37 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 29 ms :[(NOT p0)]
[2024-05-21 02:03:27] [INFO ] Invariant cache hit.
[2024-05-21 02:03:27] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-21 02:03:27] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-21 02:03:27] [INFO ] [Real]Absence check using state equation in 18 ms returned sat
[2024-05-21 02:03:27] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 02:03:27] [INFO ] [Nat]Absence check using 2 positive place invariants in 0 ms returned sat
[2024-05-21 02:03:27] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-21 02:03:27] [INFO ] [Nat]Absence check using state equation in 3 ms returned sat
[2024-05-21 02:03:27] [INFO ] Computed and/alt/rep : 4/4/4 causal constraints (skipped 0 transitions) in 2 ms.
[2024-05-21 02:03:27] [INFO ] Added : 2 causal constraints over 1 iterations in 17 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 1 out of 6 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 6/6 places, 5/5 transitions.
Applied a total of 0 rules in 1 ms. Remains 6 /6 variables (removed 0) and now considering 5/5 (removed 0) transitions.
[2024-05-21 02:03:27] [INFO ] Invariant cache hit.
[2024-05-21 02:03:27] [INFO ] Implicit Places using invariants in 22 ms returned []
[2024-05-21 02:03:27] [INFO ] Invariant cache hit.
[2024-05-21 02:03:27] [INFO ] Implicit Places using invariants and state equation in 24 ms returned []
Implicit Place search using SMT with State Equation took 48 ms to find 0 implicit places.
[2024-05-21 02:03:27] [INFO ] Redundant transitions in 0 ms returned []
[2024-05-21 02:03:27] [INFO ] Invariant cache hit.
[2024-05-21 02:03:27] [INFO ] Dead Transitions using invariants and state equation in 20 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 74 ms. Remains : 6/6 places, 5/5 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 71 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 36 ms :[(NOT p0)]
Finished random walk after 2616 steps, including 2 resets, run visited all 1 properties in 2 ms. (steps per millisecond=1308 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 87 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 39 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 32 ms :[(NOT p0)]
[2024-05-21 02:03:27] [INFO ] Invariant cache hit.
[2024-05-21 02:03:27] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-21 02:03:27] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-21 02:03:27] [INFO ] [Real]Absence check using state equation in 2 ms returned sat
[2024-05-21 02:03:27] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 02:03:27] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-21 02:03:27] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-21 02:03:27] [INFO ] [Nat]Absence check using state equation in 3 ms returned sat
[2024-05-21 02:03:27] [INFO ] Computed and/alt/rep : 4/4/4 causal constraints (skipped 0 transitions) in 1 ms.
[2024-05-21 02:03:27] [INFO ] Added : 2 causal constraints over 1 iterations in 7 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 30 ms :[(NOT p0)]
Product exploration explored 100000 steps with 10193 reset in 60 ms.
Product exploration explored 100000 steps with 10219 reset in 62 ms.
Built C files in :
/tmp/ltsmin4426276667741979591
[2024-05-21 02:03:27] [INFO ] Computing symmetric may disable matrix : 5 transitions.
[2024-05-21 02:03:27] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 02:03:27] [INFO ] Computing symmetric may enable matrix : 5 transitions.
[2024-05-21 02:03:27] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 02:03:27] [INFO ] Computing Do-Not-Accords matrix : 5 transitions.
[2024-05-21 02:03:27] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 02:03:27] [INFO ] Built C files in 9ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4426276667741979591
Running compilation step : cd /tmp/ltsmin4426276667741979591;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 153 ms.
Running link step : cd /tmp/ltsmin4426276667741979591;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 35 ms.
Running LTSmin : cd /tmp/ltsmin4426276667741979591;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased16939042582940801385.hoa' '--buchi-type=spotba'
LTSmin run took 1782 ms.
FORMULA ClientsAndServers-PT-N0100P0-LTLCardinality-06 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property ClientsAndServers-PT-N0100P0-LTLCardinality-06 finished in 3323 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F(p0))))'
Support contains 2 out of 24 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 24/24 places, 18/18 transitions.
Discarding 3 places :
Implicit places reduction removed 3 places
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 21 transition count 18
Applied a total of 3 rules in 4 ms. Remains 21 /24 variables (removed 3) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 21 cols
[2024-05-21 02:03:29] [INFO ] Computed 4 invariants in 1 ms
[2024-05-21 02:03:29] [INFO ] Implicit Places using invariants in 34 ms returned [14]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 35 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 20/24 places, 18/18 transitions.
Applied a total of 0 rules in 0 ms. Remains 20 /20 variables (removed 0) and now considering 18/18 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 40 ms. Remains : 20/24 places, 18/18 transitions.
Stuttering acceptance computed with spot in 98 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : ClientsAndServers-PT-N0100P0-LTLCardinality-07 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 1}]], initial=2, aps=[p0:(GT s8 s0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 1 reset in 135 ms.
Product exploration explored 100000 steps with 1 reset in 142 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(NOT p0), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 87 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 121 ms :[(NOT p0), (NOT p0), (NOT p0)]
Finished random walk after 801 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=400 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(NOT p0), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 2 factoid took 92 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 233 ms :[(NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 110 ms :[(NOT p0), (NOT p0), (NOT p0)]
// Phase 1: matrix 18 rows 20 cols
[2024-05-21 02:03:30] [INFO ] Computed 3 invariants in 1 ms
[2024-05-21 02:03:31] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-21 02:03:31] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-21 02:03:31] [INFO ] [Real]Absence check using state equation in 10 ms returned sat
[2024-05-21 02:03:31] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 02:03:31] [INFO ] [Nat]Absence check using 3 positive place invariants in 0 ms returned sat
[2024-05-21 02:03:31] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-21 02:03:31] [INFO ] [Nat]Absence check using state equation in 6 ms returned sat
[2024-05-21 02:03:31] [INFO ] Computed and/alt/rep : 17/17/17 causal constraints (skipped 0 transitions) in 1 ms.
[2024-05-21 02:03:31] [INFO ] Added : 3 causal constraints over 1 iterations in 8 ms. Result :sat
Could not prove EG (NOT p0)
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 2 ms. Remains 20 /20 variables (removed 0) and now considering 18/18 (removed 0) transitions.
[2024-05-21 02:03:31] [INFO ] Invariant cache hit.
[2024-05-21 02:03:31] [INFO ] Implicit Places using invariants in 24 ms returned []
[2024-05-21 02:03:31] [INFO ] Invariant cache hit.
[2024-05-21 02:03:31] [INFO ] Implicit Places using invariants and state equation in 30 ms returned []
Implicit Place search using SMT with State Equation took 54 ms to find 0 implicit places.
[2024-05-21 02:03:31] [INFO ] Invariant cache hit.
[2024-05-21 02:03:31] [INFO ] Dead Transitions using invariants and state equation in 30 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 86 ms. Remains : 20/20 places, 18/18 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(NOT p0), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 77 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 116 ms :[(NOT p0), (NOT p0), (NOT p0)]
Finished random walk after 801 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=801 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(NOT p0), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 2 factoid took 120 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 110 ms :[(NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 106 ms :[(NOT p0), (NOT p0), (NOT p0)]
[2024-05-21 02:03:31] [INFO ] Invariant cache hit.
[2024-05-21 02:03:31] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-21 02:03:31] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-21 02:03:31] [INFO ] [Real]Absence check using state equation in 6 ms returned sat
[2024-05-21 02:03:31] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 02:03:31] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-21 02:03:31] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-21 02:03:31] [INFO ] [Nat]Absence check using state equation in 9 ms returned sat
[2024-05-21 02:03:31] [INFO ] Computed and/alt/rep : 17/17/17 causal constraints (skipped 0 transitions) in 2 ms.
[2024-05-21 02:03:31] [INFO ] Added : 3 causal constraints over 1 iterations in 7 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 109 ms :[(NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 0 reset in 117 ms.
Product exploration explored 100000 steps with 0 reset in 198 ms.
Applying partial POR strategy [true, false, false]
Stuttering acceptance computed with spot in 118 ms :[(NOT p0), (NOT p0), (NOT p0)]
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 8 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 8 rules applied. Total rules applied 8 place count 20 transition count 18
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 2 Pre rules applied. Total rules applied 8 place count 20 transition count 18
Deduced a syphon composed of 10 places in 0 ms
Iterating global reduction 1 with 2 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 3 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 9 places in 0 ms
Iterating global reduction 1 with 3 rules applied. Total rules applied 21 place count 16 transition count 14
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 23 place count 14 transition count 12
Deduced a syphon composed of 7 places in 0 ms
Iterating global reduction 1 with 2 rules applied. Total rules applied 25 place count 14 transition count 12
Deduced a syphon composed of 7 places in 0 ms
Applied a total of 25 rules in 15 ms. Remains 14 /20 variables (removed 6) and now considering 12/18 (removed 6) transitions.
[2024-05-21 02:03:32] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 12 rows 14 cols
[2024-05-21 02:03:32] [INFO ] Computed 3 invariants in 2 ms
[2024-05-21 02:03:32] [INFO ] Dead Transitions using invariants and state equation in 28 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 14/20 places, 12/18 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 53 ms. Remains : 14/20 places, 12/18 transitions.
Built C files in :
/tmp/ltsmin6154299187714812534
[2024-05-21 02:03:32] [INFO ] Built C files in 1ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6154299187714812534
Running compilation step : cd /tmp/ltsmin6154299187714812534;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 89 ms.
Running link step : cd /tmp/ltsmin6154299187714812534;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 28 ms.
Running LTSmin : cd /tmp/ltsmin6154299187714812534;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased6228655776405579644.hoa' '--buchi-type=spotba'
LTSmin run took 1722 ms.
FORMULA ClientsAndServers-PT-N0100P0-LTLCardinality-07 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property ClientsAndServers-PT-N0100P0-LTLCardinality-07 finished in 4561 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((G(p0) U (X(p1)&&F(!p1)))))'
Support contains 3 out of 24 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 24/24 places, 18/18 transitions.
Discarding 3 places :
Implicit places reduction removed 3 places
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 21 transition count 18
Applied a total of 3 rules in 2 ms. Remains 21 /24 variables (removed 3) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 21 cols
[2024-05-21 02:03:34] [INFO ] Computed 4 invariants in 1 ms
[2024-05-21 02:03:34] [INFO ] Implicit Places using invariants in 29 ms returned [14]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 30 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 20/24 places, 18/18 transitions.
Applied a total of 0 rules in 1 ms. Remains 20 /20 variables (removed 0) and now considering 18/18 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 33 ms. Remains : 20/24 places, 18/18 transitions.
Stuttering acceptance computed with spot in 197 ms :[true, (NOT p1), p1, (NOT p1), true, (NOT p0)]
Running random walk in product with property : ClientsAndServers-PT-N0100P0-LTLCardinality-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=p1, acceptance={} source=0 dest: 2}, { cond=p0, acceptance={} source=0 dest: 3}], [{ cond=(NOT p1), acceptance={} source=1 dest: 4}], [{ cond=p1, acceptance={0} source=2 dest: 2}], [{ cond=(AND (NOT p1) p0), acceptance={0} source=3 dest: 3}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=3 dest: 4}, { cond=(AND (NOT p1) p0), acceptance={0} source=3 dest: 5}], [{ cond=true, acceptance={0} source=4 dest: 4}], [{ cond=(NOT p0), acceptance={} source=5 dest: 4}, { cond=p0, acceptance={} source=5 dest: 5}]], initial=0, aps=[p0:(GT s2 s6), p1:(LEQ 2 s8)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA ClientsAndServers-PT-N0100P0-LTLCardinality-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ClientsAndServers-PT-N0100P0-LTLCardinality-09 finished in 255 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 24 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 24/24 places, 18/18 transitions.
Discarding 2 places :
Implicit places reduction removed 2 places
Drop transitions removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 22 transition count 14
Reduce places removed 4 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 5 rules applied. Total rules applied 11 place count 18 transition count 13
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 12 place count 17 transition count 13
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 12 place count 17 transition count 11
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 16 place count 15 transition count 11
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 20 place count 13 transition count 9
Applied a total of 20 rules in 9 ms. Remains 13 /24 variables (removed 11) and now considering 9/18 (removed 9) transitions.
// Phase 1: matrix 9 rows 13 cols
[2024-05-21 02:03:34] [INFO ] Computed 5 invariants in 1 ms
[2024-05-21 02:03:34] [INFO ] Implicit Places using invariants in 24 ms returned [8, 12]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 25 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 11/24 places, 9/18 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 11 transition count 8
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 10 transition count 8
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 2 place count 10 transition count 7
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 4 place count 9 transition count 7
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 3 rules applied. Total rules applied 7 place count 7 transition count 6
Applied a total of 7 rules in 5 ms. Remains 7 /11 variables (removed 4) and now considering 6/9 (removed 3) transitions.
// Phase 1: matrix 6 rows 7 cols
[2024-05-21 02:03:34] [INFO ] Computed 2 invariants in 0 ms
[2024-05-21 02:03:34] [INFO ] Implicit Places using invariants in 19 ms returned []
[2024-05-21 02:03:34] [INFO ] Invariant cache hit.
[2024-05-21 02:03:34] [INFO ] Implicit Places using invariants and state equation in 21 ms returned []
Implicit Place search using SMT with State Equation took 43 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 7/24 places, 6/18 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 82 ms. Remains : 7/24 places, 6/18 transitions.
Stuttering acceptance computed with spot in 37 ms :[(NOT p0)]
Running random walk in product with property : ClientsAndServers-PT-N0100P0-LTLCardinality-10 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(LEQ s6 s5)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 0 reset in 119 ms.
Stack based approach found an accepted trace after 55 steps with 0 reset with depth 56 and stack size 56 in 1 ms.
FORMULA ClientsAndServers-PT-N0100P0-LTLCardinality-10 FALSE TECHNIQUES STACK_TEST
Treatment of property ClientsAndServers-PT-N0100P0-LTLCardinality-10 finished in 255 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((p0 U !p1))))'
Support contains 3 out of 24 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 24/24 places, 18/18 transitions.
Discarding 3 places :
Implicit places reduction removed 3 places
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 21 transition count 18
Applied a total of 3 rules in 1 ms. Remains 21 /24 variables (removed 3) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 21 cols
[2024-05-21 02:03:34] [INFO ] Computed 4 invariants in 1 ms
[2024-05-21 02:03:34] [INFO ] Implicit Places using invariants in 25 ms returned [14]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 26 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 20/24 places, 18/18 transitions.
Applied a total of 0 rules in 1 ms. Remains 20 /20 variables (removed 0) and now considering 18/18 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 28 ms. Remains : 20/24 places, 18/18 transitions.
Stuttering acceptance computed with spot in 130 ms :[p1, p1, true, p1]
Running random walk in product with property : ClientsAndServers-PT-N0100P0-LTLCardinality-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(OR (NOT p1) p0), acceptance={} source=1 dest: 1}, { cond=(AND p1 (NOT p0)), acceptance={} source=1 dest: 2}, { cond=(AND p1 p0), acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(AND p1 (NOT p0)), acceptance={0} source=3 dest: 2}, { cond=(AND p1 p0), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p1:(GT 2 s19), p0:(LEQ s4 s16)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 0 reset in 136 ms.
Product exploration explored 100000 steps with 0 reset in 155 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p1) p0), (X (NOT (AND p1 (NOT p0)))), (X (NOT (AND p1 p0))), (X (OR (NOT p1) p0)), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (AND p1 p0)))), true, (X (X (OR (NOT p1) p0)))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 8 factoid took 85 ms. Reduced automaton from 4 states, 7 edges and 2 AP (stutter sensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 80 ms :[p1, true, p1]
Incomplete random walk after 10043 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=1434 ) properties (out of 3) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 18 rows 20 cols
[2024-05-21 02:03:35] [INFO ] Computed 3 invariants in 1 ms
[2024-05-21 02:03:35] [INFO ] After 17ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-21 02:03:35] [INFO ] [Nat]Absence check using 3 positive place invariants in 0 ms returned sat
[2024-05-21 02:03:35] [INFO ] After 13ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-05-21 02:03:35] [INFO ] After 17ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 6 ms.
[2024-05-21 02:03:35] [INFO ] After 45ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Fused 2 Parikh solutions to 1 different solutions.
Finished Parikh walk after 822 steps, including 0 resets, run visited all 2 properties in 9 ms. (steps per millisecond=91 )
Parikh walk visited 2 properties in 8 ms.
Knowledge obtained : [(AND (NOT p1) p0), (X (NOT (AND p1 (NOT p0)))), (X (NOT (AND p1 p0))), (X (OR (NOT p1) p0)), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (AND p1 p0)))), true, (X (X (OR (NOT p1) p0)))]
False Knowledge obtained : [(F (NOT (OR p0 (NOT p1)))), (F (AND p0 p1)), (F (AND (NOT p0) p1))]
Property proved to be false thanks to negative knowledge :(F (NOT (OR p0 (NOT p1))))
Knowledge based reduction with 8 factoid took 233 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA ClientsAndServers-PT-N0100P0-LTLCardinality-12 FALSE TECHNIQUES KNOWLEDGE
Treatment of property ClientsAndServers-PT-N0100P0-LTLCardinality-12 finished in 1011 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 1 out of 24 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 24/24 places, 18/18 transitions.
Discarding 3 places :
Implicit places reduction removed 3 places
Drop transitions removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 0 with 9 rules applied. Total rules applied 9 place count 21 transition count 12
Reduce places removed 6 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 7 rules applied. Total rules applied 16 place count 15 transition count 11
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 17 place count 14 transition count 11
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 17 place count 14 transition count 9
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 21 place count 12 transition count 9
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
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 29 place count 8 transition count 5
Applied a total of 29 rules in 7 ms. Remains 8 /24 variables (removed 16) and now considering 5/18 (removed 13) transitions.
// Phase 1: matrix 5 rows 8 cols
[2024-05-21 02:03:35] [INFO ] Computed 4 invariants in 1 ms
[2024-05-21 02:03:35] [INFO ] Implicit Places using invariants in 24 ms returned [5, 7]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 25 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 6/24 places, 5/18 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 6 transition count 4
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 5 transition count 4
Applied a total of 2 rules in 2 ms. Remains 5 /6 variables (removed 1) and now considering 4/5 (removed 1) transitions.
// Phase 1: matrix 4 rows 5 cols
[2024-05-21 02:03:35] [INFO ] Computed 2 invariants in 0 ms
[2024-05-21 02:03:35] [INFO ] Implicit Places using invariants in 15 ms returned []
[2024-05-21 02:03:35] [INFO ] Invariant cache hit.
[2024-05-21 02:03:36] [INFO ] Implicit Places using invariants and state equation in 23 ms returned []
Implicit Place search using SMT with State Equation took 40 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 5/24 places, 4/18 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 76 ms. Remains : 5/24 places, 4/18 transitions.
Stuttering acceptance computed with spot in 36 ms :[(NOT p0)]
Running random walk in product with property : ClientsAndServers-PT-N0100P0-LTLCardinality-13 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(GT 3 s3)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 0 reset in 47 ms.
Stack based approach found an accepted trace after 12 steps with 0 reset with depth 13 and stack size 13 in 0 ms.
FORMULA ClientsAndServers-PT-N0100P0-LTLCardinality-13 FALSE TECHNIQUES STACK_TEST
Treatment of property ClientsAndServers-PT-N0100P0-LTLCardinality-13 finished in 171 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(!p0)||(!p0&&F(((p1&&X(F(p2)))||G(F(p2)))))))'
Support contains 5 out of 24 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 24/24 places, 18/18 transitions.
Discarding 2 places :
Implicit places reduction removed 2 places
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 22 transition count 18
Applied a total of 2 rules in 1 ms. Remains 22 /24 variables (removed 2) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 22 cols
[2024-05-21 02:03:36] [INFO ] Computed 5 invariants in 1 ms
[2024-05-21 02:03:36] [INFO ] Implicit Places using invariants in 36 ms returned [14]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 37 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 21/24 places, 18/18 transitions.
Applied a total of 0 rules in 0 ms. Remains 21 /21 variables (removed 0) and now considering 18/18 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 40 ms. Remains : 21/24 places, 18/18 transitions.
Stuttering acceptance computed with spot in 221 ms :[p0, true, (AND (NOT p2) p0), (AND p0 (NOT p2)), (NOT p2), (NOT p2)]
Running random walk in product with property : ClientsAndServers-PT-N0100P0-LTLCardinality-15 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 1}, { cond=(AND (NOT p0) p1), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 3}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=2 dest: 2}, { cond=(AND p0 (NOT p2)), acceptance={} source=2 dest: 4}], [{ cond=(AND (NOT p0) p1), acceptance={} source=3 dest: 2}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 3}, { cond=(OR (AND p0 (NOT p2)) (AND p0 p1)), acceptance={} source=3 dest: 4}, { cond=(AND p0 (NOT p1)), acceptance={} source=3 dest: 5}], [{ cond=(NOT p2), acceptance={0} source=4 dest: 4}], [{ cond=(OR (NOT p2) p1), acceptance={} source=5 dest: 4}, { cond=(NOT p1), acceptance={} source=5 dest: 5}]], initial=0, aps=[p0:(OR (LEQ s14 s16) (LEQ s20 s9)), p1:(GT s20 s9), p2:(GT s9 s13)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 827 reset in 132 ms.
Product exploration explored 100000 steps with 811 reset in 152 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) p1 (NOT p2)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 (NOT p1)))), (X (NOT (OR (AND p0 (NOT p2)) (AND p0 p1)))), (X (AND (NOT p0) (NOT p2))), (X (NOT (AND p0 (NOT p2)))), (X (AND (NOT p0) p1)), true, (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT p2))), (X (X (NOT (OR (AND p0 (NOT p2)) (AND p0 p1))))), (X (X p1)), (X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (OR (NOT p2) p1))), (X (X (AND (NOT p0) p1)))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 17 factoid took 159 ms. Reduced automaton from 6 states, 13 edges and 3 AP (stutter sensitive) to 5 states, 13 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 188 ms :[(AND (NOT p2) p0), (AND (NOT p2) p0), (AND (NOT p2) p0), (AND (NOT p2) p0), (NOT p2)]
Incomplete random walk after 10043 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=772 ) properties (out of 5) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=2000 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
// Phase 1: matrix 18 rows 21 cols
[2024-05-21 02:03:37] [INFO ] Computed 4 invariants in 0 ms
[2024-05-21 02:03:37] [INFO ] After 39ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2024-05-21 02:03:37] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-21 02:03:37] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-21 02:03:37] [INFO ] After 10ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2024-05-21 02:03:37] [INFO ] After 18ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 7 ms.
[2024-05-21 02:03:37] [INFO ] After 63ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Finished Parikh walk after 5967 steps, including 0 resets, run visited all 3 properties in 20 ms. (steps per millisecond=298 )
Parikh walk visited 3 properties in 19 ms.
Knowledge obtained : [(AND (NOT p0) p1 (NOT p2)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 (NOT p1)))), (X (NOT (OR (AND p0 (NOT p2)) (AND p0 p1)))), (X (AND (NOT p0) (NOT p2))), (X (NOT (AND p0 (NOT p2)))), (X (AND (NOT p0) p1)), true, (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT p2))), (X (X (NOT (OR (AND p0 (NOT p2)) (AND p0 p1))))), (X (X p1)), (X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (OR (NOT p2) p1))), (X (X (AND (NOT p0) p1)))]
False Knowledge obtained : [(F p2), (F (AND p0 p2)), (F (AND (NOT p0) p2)), (F (AND p0 (NOT p2))), (F (NOT (AND (NOT p0) (NOT p2))))]
Knowledge based reduction with 17 factoid took 361 ms. Reduced automaton from 5 states, 13 edges and 2 AP (stutter insensitive) to 5 states, 13 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 166 ms :[(AND (NOT p2) p0), (AND (NOT p2) p0), (AND (NOT p2) p0), (AND (NOT p2) p0), (NOT p2)]
Stuttering acceptance computed with spot in 165 ms :[(AND (NOT p2) p0), (AND (NOT p2) p0), (AND (NOT p2) p0), (AND (NOT p2) p0), (NOT p2)]
Support contains 5 out of 21 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 21/21 places, 18/18 transitions.
Drop transitions 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 21 transition count 16
Reduce places removed 2 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 1 with 5 rules applied. Total rules applied 7 place count 19 transition count 13
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 10 place count 16 transition count 13
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 10 place count 16 transition count 12
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 12 place count 15 transition count 12
Applied a total of 12 rules in 6 ms. Remains 15 /21 variables (removed 6) and now considering 12/18 (removed 6) transitions.
// Phase 1: matrix 12 rows 15 cols
[2024-05-21 02:03:37] [INFO ] Computed 4 invariants in 0 ms
[2024-05-21 02:03:37] [INFO ] Implicit Places using invariants in 21 ms returned []
[2024-05-21 02:03:37] [INFO ] Invariant cache hit.
[2024-05-21 02:03:37] [INFO ] Implicit Places using invariants and state equation in 27 ms returned []
Implicit Place search using SMT with State Equation took 49 ms to find 0 implicit places.
[2024-05-21 02:03:37] [INFO ] Redundant transitions in 0 ms returned []
[2024-05-21 02:03:37] [INFO ] Invariant cache hit.
[2024-05-21 02:03:38] [INFO ] Dead Transitions using invariants and state equation in 20 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 15/21 places, 12/18 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 93 ms. Remains : 15/21 places, 12/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 p2)), (X (NOT p2)), (X (NOT (AND (NOT p0) p2))), (X (AND (NOT p0) (NOT p2))), (X (NOT (AND p0 (NOT p2)))), (X (NOT (AND p0 p2))), (X (X (NOT p2))), (X (X (NOT (AND (NOT p0) p2)))), (X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT (AND p0 p2))))]
False Knowledge obtained : []
Knowledge based reduction with 11 factoid took 97 ms. Reduced automaton from 5 states, 13 edges and 2 AP (stutter insensitive) to 5 states, 13 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 166 ms :[(AND (NOT p2) p0), (AND (NOT p2) p0), (AND (NOT p2) p0), (AND (NOT p2) p0), (NOT p2)]
Incomplete random walk after 10043 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=5021 ) properties (out of 5) seen :4
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=2000 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2024-05-21 02:03:38] [INFO ] Invariant cache hit.
[2024-05-21 02:03:38] [INFO ] After 32ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-21 02:03:38] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-21 02:03:38] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-21 02:03:38] [INFO ] After 5ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-21 02:03:38] [INFO ] After 9ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 3 ms.
[2024-05-21 02:03:38] [INFO ] After 33ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished Parikh walk after 36 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=36 )
Parikh walk visited 1 properties in 1 ms.
Knowledge obtained : [(AND (NOT p0) (NOT p2)), (X (NOT p2)), (X (NOT (AND (NOT p0) p2))), (X (AND (NOT p0) (NOT p2))), (X (NOT (AND p0 (NOT p2)))), (X (NOT (AND p0 p2))), (X (X (NOT p2))), (X (X (NOT (AND (NOT p0) p2)))), (X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT (AND p0 p2))))]
False Knowledge obtained : [(F p2), (F (AND p0 p2)), (F (AND (NOT p0) p2)), (F (AND p0 (NOT p2))), (F (NOT (AND (NOT p0) (NOT p2))))]
Knowledge based reduction with 11 factoid took 235 ms. Reduced automaton from 5 states, 13 edges and 2 AP (stutter insensitive) to 5 states, 13 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 169 ms :[(AND (NOT p2) p0), (AND (NOT p2) p0), (AND (NOT p2) p0), (AND (NOT p2) p0), (NOT p2)]
Stuttering acceptance computed with spot in 159 ms :[(AND (NOT p2) p0), (AND (NOT p2) p0), (AND (NOT p2) p0), (AND (NOT p2) p0), (NOT p2)]
Stuttering acceptance computed with spot in 149 ms :[(AND (NOT p2) p0), (AND (NOT p2) p0), (AND (NOT p2) p0), (AND (NOT p2) p0), (NOT p2)]
Product exploration explored 100000 steps with 1835 reset in 120 ms.
Product exploration explored 100000 steps with 1831 reset in 127 ms.
Built C files in :
/tmp/ltsmin10296837658555609735
[2024-05-21 02:03:39] [INFO ] Computing symmetric may disable matrix : 12 transitions.
[2024-05-21 02:03:39] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 02:03:39] [INFO ] Computing symmetric may enable matrix : 12 transitions.
[2024-05-21 02:03:39] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 02:03:39] [INFO ] Computing Do-Not-Accords matrix : 12 transitions.
[2024-05-21 02:03:39] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 02:03:39] [INFO ] Built C files in 8ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10296837658555609735
Running compilation step : cd /tmp/ltsmin10296837658555609735;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 80 ms.
Running link step : cd /tmp/ltsmin10296837658555609735;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 29 ms.
Running LTSmin : cd /tmp/ltsmin10296837658555609735;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased13460521574086931530.hoa' '--buchi-type=spotba'
LTSmin run took 441 ms.
FORMULA ClientsAndServers-PT-N0100P0-LTLCardinality-15 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property ClientsAndServers-PT-N0100P0-LTLCardinality-15 finished in 3849 ms.
All properties solved by simple procedures.
Total runtime 16457 ms.

BK_STOP 1716257020928

--------------------
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.202304061127.jar
+ VERSION=202304061127
+ echo 'Running Version 202304061127'
+ /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-N0100P0"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="gold2023"
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 gold2023"
echo " Input is ClientsAndServers-PT-N0100P0, 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 r087-tall-171620521900307"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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