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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 496K
-rw-r--r-- 1 mcc users 7.2K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 80K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.5K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 51K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:42 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K May 18 16:42 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.7K Apr 22 14:33 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K 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:01 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Apr 12 23:09 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 128K Apr 12 23:09 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.7K Apr 12 23:09 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 89K 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.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-N0020P0-LTLCardinality-00
FORMULA_NAME ClientsAndServers-PT-N0020P0-LTLCardinality-01
FORMULA_NAME ClientsAndServers-PT-N0020P0-LTLCardinality-02
FORMULA_NAME ClientsAndServers-PT-N0020P0-LTLCardinality-03
FORMULA_NAME ClientsAndServers-PT-N0020P0-LTLCardinality-04
FORMULA_NAME ClientsAndServers-PT-N0020P0-LTLCardinality-05
FORMULA_NAME ClientsAndServers-PT-N0020P0-LTLCardinality-06
FORMULA_NAME ClientsAndServers-PT-N0020P0-LTLCardinality-07
FORMULA_NAME ClientsAndServers-PT-N0020P0-LTLCardinality-08
FORMULA_NAME ClientsAndServers-PT-N0020P0-LTLCardinality-09
FORMULA_NAME ClientsAndServers-PT-N0020P0-LTLCardinality-10
FORMULA_NAME ClientsAndServers-PT-N0020P0-LTLCardinality-11
FORMULA_NAME ClientsAndServers-PT-N0020P0-LTLCardinality-12
FORMULA_NAME ClientsAndServers-PT-N0020P0-LTLCardinality-13
FORMULA_NAME ClientsAndServers-PT-N0020P0-LTLCardinality-14
FORMULA_NAME ClientsAndServers-PT-N0020P0-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1716253256012

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-N0020P0
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202304061127
[2024-05-21 01:00:57] [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 01:00:57] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-21 01:00:57] [INFO ] Load time of PNML (sax parser for PT used): 22 ms
[2024-05-21 01:00:57] [INFO ] Transformed 25 places.
[2024-05-21 01:00:57] [INFO ] Transformed 18 transitions.
[2024-05-21 01:00:57] [INFO ] Parsed PT model containing 25 places and 18 transitions and 54 arcs in 80 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 10 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 7 formulas.
FORMULA ClientsAndServers-PT-N0020P0-LTLCardinality-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ClientsAndServers-PT-N0020P0-LTLCardinality-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ClientsAndServers-PT-N0020P0-LTLCardinality-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ClientsAndServers-PT-N0020P0-LTLCardinality-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ClientsAndServers-PT-N0020P0-LTLCardinality-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ClientsAndServers-PT-N0020P0-LTLCardinality-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ClientsAndServers-PT-N0020P0-LTLCardinality-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 19 out of 25 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 25/25 places, 18/18 transitions.
Discarding 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 99 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 01:00:58] [INFO ] Computed 6 invariants in 13 ms
[2024-05-21 01:00:58] [INFO ] Implicit Places using invariants in 131 ms returned [14]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 263 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 22/25 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 363 ms. Remains : 22/25 places, 18/18 transitions.
Support contains 19 out of 22 places after structural reductions.
[2024-05-21 01:00:58] [INFO ] Flatten gal took : 31 ms
[2024-05-21 01:00:58] [INFO ] Flatten gal took : 3 ms
[2024-05-21 01:00:58] [INFO ] Input system was already deterministic with 18 transitions.
Finished random walk after 3886 steps, including 3 resets, run visited all 23 properties in 28 ms. (steps per millisecond=138 )
Parikh walk visited 0 properties in 0 ms.
FORMULA ClientsAndServers-PT-N0020P0-LTLCardinality-09 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 0 stabilizing places and 0 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((p0||G(p1)))))'
Support contains 2 out of 22 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 22/22 places, 18/18 transitions.
Discarding 2 places :
Implicit places reduction removed 2 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 8 rules applied. Total rules applied 8 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 16 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 18 place count 12 transition count 10
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 18 place count 12 transition count 7
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 24 place count 9 transition count 7
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 28 place count 7 transition count 5
Applied a total of 28 rules in 8 ms. Remains 7 /22 variables (removed 15) and now considering 5/18 (removed 13) transitions.
// Phase 1: matrix 5 rows 7 cols
[2024-05-21 01:00:58] [INFO ] Computed 3 invariants in 1 ms
[2024-05-21 01:00:58] [INFO ] Implicit Places using invariants in 52 ms returned [6]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 63 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 6/22 places, 5/18 transitions.
Applied a total of 0 rules in 4 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 77 ms. Remains : 6/22 places, 5/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 216 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : ClientsAndServers-PT-N0020P0-LTLCardinality-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}], [{ cond=(AND p1 (NOT p0)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(LEQ 1 s3), p0:(LEQ 2 s1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 2267 reset in 200 ms.
Stack based approach found an accepted trace after 90 steps with 3 reset with depth 11 and stack size 11 in 0 ms.
FORMULA ClientsAndServers-PT-N0020P0-LTLCardinality-00 FALSE TECHNIQUES STACK_TEST
Treatment of property ClientsAndServers-PT-N0020P0-LTLCardinality-00 finished in 542 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((F(p0)||(!p1 U (G(!p1)||(!p1&&G(p2)))))))'
Support contains 5 out of 22 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 22/22 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 20 transition count 18
Applied a total of 2 rules in 3 ms. Remains 20 /22 variables (removed 2) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 20 cols
[2024-05-21 01:00:59] [INFO ] Computed 3 invariants in 1 ms
[2024-05-21 01:00:59] [INFO ] Implicit Places using invariants in 44 ms returned []
[2024-05-21 01:00:59] [INFO ] Invariant cache hit.
[2024-05-21 01:00:59] [INFO ] Implicit Places using invariants and state equation in 30 ms returned []
Implicit Place search using SMT with State Equation took 75 ms to find 0 implicit places.
[2024-05-21 01:00:59] [INFO ] Invariant cache hit.
[2024-05-21 01:00:59] [INFO ] Dead Transitions using invariants and state equation in 32 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 20/22 places, 18/18 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 112 ms. Remains : 20/22 places, 18/18 transitions.
Stuttering acceptance computed with spot in 355 ms :[(NOT p0), (AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) p1 (NOT p2)), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : ClientsAndServers-PT-N0020P0-LTLCardinality-01 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) p1), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p0) p2 (NOT p1)), acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p0) (NOT p2) p1), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={} source=3 dest: 2}, { cond=(AND (NOT p0) p2 (NOT p1)), acceptance={} source=3 dest: 3}, { cond=(AND (NOT p0) p2 p1), acceptance={} source=3 dest: 4}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=4 dest: 0}, { cond=(AND (NOT p0) p2), acceptance={} source=4 dest: 4}]], initial=1, aps=[p0:(LEQ 2 s4), p1:(AND (GT s12 s5) (LEQ 1 s11)), p2:(GT 3 s17)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 426 reset in 179 ms.
Product exploration explored 100000 steps with 431 reset in 175 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) p2), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND (NOT p0) (NOT p2) (NOT p1)))), (X (AND (NOT p0) p2 (NOT p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND (NOT p0) p2 p1)))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p2) p1)))), (X (X (AND (NOT p0) p2 (NOT p1)))), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 10 factoid took 135 ms. Reduced automaton from 5 states, 11 edges and 3 AP (stutter sensitive) to 5 states, 11 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 236 ms :[(NOT p0), (AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) p1 (NOT p2)), (AND (NOT p0) (NOT p2))]
Incomplete random walk after 10030 steps, including 5 resets, run finished after 16 ms. (steps per millisecond=626 ) properties (out of 8) seen :7
Finished Best-First random walk after 1476 steps, including 0 resets, run visited all 1 properties in 4 ms. (steps per millisecond=369 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND (NOT p0) (NOT p1) p2), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND (NOT p0) (NOT p2) (NOT p1)))), (X (AND (NOT p0) p2 (NOT p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND (NOT p0) p2 p1)))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p2) p1)))), (X (X (AND (NOT p0) p2 (NOT p1)))), (X (X (NOT p0)))]
False Knowledge obtained : [(F (AND (NOT p0) p1 (NOT p2))), (F (NOT (AND (NOT p0) (NOT p1) p2))), (F (AND (NOT p0) (NOT p2))), (F (AND (NOT p0) p1 p2)), (F p0), (F (AND (NOT p0) (NOT p1) (NOT p2))), (F (AND (NOT p0) p1)), (F (NOT (AND (NOT p0) p2)))]
Knowledge based reduction with 10 factoid took 377 ms. Reduced automaton from 5 states, 11 edges and 3 AP (stutter sensitive) to 5 states, 11 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 188 ms :[(NOT p0), (AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) p1 (NOT p2)), (AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 205 ms :[(NOT p0), (AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) p1 (NOT p2)), (AND (NOT p0) (NOT p2))]
Support contains 5 out of 20 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 20/20 places, 18/18 transitions.
Applied a total of 0 rules in 1 ms. Remains 20 /20 variables (removed 0) and now considering 18/18 (removed 0) transitions.
[2024-05-21 01:01:01] [INFO ] Invariant cache hit.
[2024-05-21 01:01:01] [INFO ] Implicit Places using invariants in 25 ms returned []
[2024-05-21 01:01:01] [INFO ] Invariant cache hit.
[2024-05-21 01:01:01] [INFO ] Implicit Places using invariants and state equation in 33 ms returned []
Implicit Place search using SMT with State Equation took 60 ms to find 0 implicit places.
[2024-05-21 01:01:01] [INFO ] Invariant cache hit.
[2024-05-21 01:01:01] [INFO ] Dead Transitions using invariants and state equation in 28 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 90 ms. Remains : 20/20 places, 18/18 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1) p2), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (AND (NOT p0) (NOT p1) p2)), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X (NOT (AND (NOT p0) p1 p2)))), (X (X (AND (NOT p0) (NOT p1) p2))), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 10 factoid took 134 ms. Reduced automaton from 5 states, 11 edges and 3 AP (stutter sensitive) to 5 states, 11 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 220 ms :[(NOT p0), (AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) p1 (NOT p2)), (AND (NOT p0) (NOT p2))]
Incomplete random walk after 10030 steps, including 6 resets, run finished after 15 ms. (steps per millisecond=668 ) properties (out of 8) seen :7
Finished Best-First random walk after 969 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=484 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND (NOT p0) (NOT p1) p2), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (AND (NOT p0) (NOT p1) p2)), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X (NOT (AND (NOT p0) p1 p2)))), (X (X (AND (NOT p0) (NOT p1) p2))), (X (X (NOT p0)))]
False Knowledge obtained : [(F (AND (NOT p0) p1 (NOT p2))), (F (NOT (AND (NOT p0) (NOT p1) p2))), (F (AND (NOT p0) (NOT p2))), (F (AND (NOT p0) p1 p2)), (F p0), (F (AND (NOT p0) (NOT p1) (NOT p2))), (F (AND (NOT p0) p1)), (F (NOT (AND (NOT p0) p2)))]
Knowledge based reduction with 10 factoid took 362 ms. Reduced automaton from 5 states, 11 edges and 3 AP (stutter sensitive) to 5 states, 11 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 210 ms :[(NOT p0), (AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) p1 (NOT p2)), (AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 229 ms :[(NOT p0), (AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) p1 (NOT p2)), (AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 189 ms :[(NOT p0), (AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) p1 (NOT p2)), (AND (NOT p0) (NOT p2))]
Product exploration explored 100000 steps with 437 reset in 156 ms.
Product exploration explored 100000 steps with 426 reset in 258 ms.
Applying partial POR strategy [true, false, true, true, true]
Stuttering acceptance computed with spot in 236 ms :[(NOT p0), (AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) p1 (NOT p2)), (AND (NOT p0) (NOT p2))]
Support contains 5 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 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 10 place count 18 transition count 16
Deduced a syphon composed of 6 places in 0 ms
Iterating global reduction 1 with 2 rules applied. Total rules applied 12 place count 18 transition count 16
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 13 place count 18 transition count 16
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 14 place count 17 transition count 15
Deduced a syphon composed of 6 places in 0 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 15 place count 17 transition count 15
Deduced a syphon composed of 6 places in 0 ms
Applied a total of 15 rules in 10 ms. Remains 17 /20 variables (removed 3) and now considering 15/18 (removed 3) transitions.
[2024-05-21 01:01:03] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 15 rows 17 cols
[2024-05-21 01:01:03] [INFO ] Computed 3 invariants in 2 ms
[2024-05-21 01:01:03] [INFO ] Dead Transitions using invariants and state equation in 35 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 17/20 places, 15/18 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 58 ms. Remains : 17/20 places, 15/18 transitions.
Built C files in :
/tmp/ltsmin9019383820761604329
[2024-05-21 01:01:03] [INFO ] Built C files in 2ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9019383820761604329
Running compilation step : cd /tmp/ltsmin9019383820761604329;'/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 184 ms.
Running link step : cd /tmp/ltsmin9019383820761604329;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 45 ms.
Running LTSmin : cd /tmp/ltsmin9019383820761604329;'/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/stateBased5929249770345528751.hoa' '--buchi-type=spotba'
LTSmin run took 4314 ms.
FORMULA ClientsAndServers-PT-N0020P0-LTLCardinality-01 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property ClientsAndServers-PT-N0020P0-LTLCardinality-01 finished in 8974 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(F((p0&&(p1 U (p2||G(p1)))))))'
Support contains 3 out of 22 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 22/22 places, 18/18 transitions.
Discarding 2 places :
Implicit places reduction removed 2 places
Drop transitions removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 0 with 9 rules applied. Total rules applied 9 place count 20 transition count 11
Reduce places removed 7 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 8 rules applied. Total rules applied 17 place count 13 transition count 10
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 18 place count 12 transition count 10
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 18 place count 12 transition count 9
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 20 place count 11 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 24 place count 9 transition count 7
Applied a total of 24 rules in 12 ms. Remains 9 /22 variables (removed 13) and now considering 7/18 (removed 11) transitions.
// Phase 1: matrix 7 rows 9 cols
[2024-05-21 01:01:08] [INFO ] Computed 3 invariants in 1 ms
[2024-05-21 01:01:08] [INFO ] Implicit Places using invariants in 41 ms returned [8]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 42 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 8/22 places, 7/18 transitions.
Applied a total of 0 rules in 0 ms. Remains 8 /8 variables (removed 0) and now considering 7/7 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 55 ms. Remains : 8/22 places, 7/18 transitions.
Stuttering acceptance computed with spot in 130 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : ClientsAndServers-PT-N0020P0-LTLCardinality-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(OR (NOT p0) (AND (NOT p2) (NOT p1))), acceptance={} source=0 dest: 1}], [{ cond=(OR (NOT p0) (AND (NOT p2) (NOT p1))), acceptance={0} source=1 dest: 1}, { cond=(AND p0 (NOT p2) p1), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=2 dest: 1}, { cond=(AND (NOT p2) p1), acceptance={} source=2 dest: 2}]], initial=0, aps=[p0:(GT 1 s4), p2:(AND (GT 1 s1) (GT 2 s7)), p1:(GT 1 s1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 36187 steps with 36 reset in 35 ms.
FORMULA ClientsAndServers-PT-N0020P0-LTLCardinality-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ClientsAndServers-PT-N0020P0-LTLCardinality-02 finished in 244 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(F(p0)) U (p0||G(F(p1))))))'
Support contains 2 out of 22 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 22/22 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 20 transition count 18
Applied a total of 2 rules in 2 ms. Remains 20 /22 variables (removed 2) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 20 cols
[2024-05-21 01:01:08] [INFO ] Computed 3 invariants in 1 ms
[2024-05-21 01:01:08] [INFO ] Implicit Places using invariants in 46 ms returned []
[2024-05-21 01:01:08] [INFO ] Invariant cache hit.
[2024-05-21 01:01:08] [INFO ] Implicit Places using invariants and state equation in 39 ms returned []
Implicit Place search using SMT with State Equation took 87 ms to find 0 implicit places.
[2024-05-21 01:01:08] [INFO ] Invariant cache hit.
[2024-05-21 01:01:08] [INFO ] Dead Transitions using invariants and state equation in 47 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 20/22 places, 18/18 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 137 ms. Remains : 20/22 places, 18/18 transitions.
Stuttering acceptance computed with spot in 230 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : ClientsAndServers-PT-N0020P0-LTLCardinality-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 2}, { cond=(NOT p0), acceptance={} source=1 dest: 5}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 4}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=3 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=4 dest: 3}, { cond=(NOT p1), acceptance={} source=4 dest: 4}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=5 dest: 3}, { cond=true, acceptance={} source=5 dest: 5}]], initial=0, aps=[p0:(LEQ s13 s7), p1:(GT 2 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 50000 reset in 83 ms.
Product exploration explored 100000 steps with 50000 reset in 83 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), true, (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 6 factoid took 14 ms. Reduced automaton from 6 states, 11 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA ClientsAndServers-PT-N0020P0-LTLCardinality-05 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ClientsAndServers-PT-N0020P0-LTLCardinality-05 finished in 574 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) U (p1||G(p2))) U (p3 U X(X(p2)))))'
Support contains 4 out of 22 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 22/22 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 20 transition count 18
Applied a total of 2 rules in 1 ms. Remains 20 /22 variables (removed 2) and now considering 18/18 (removed 0) transitions.
[2024-05-21 01:01:09] [INFO ] Invariant cache hit.
[2024-05-21 01:01:09] [INFO ] Implicit Places using invariants in 28 ms returned []
[2024-05-21 01:01:09] [INFO ] Invariant cache hit.
[2024-05-21 01:01:09] [INFO ] Implicit Places using invariants and state equation in 33 ms returned []
Implicit Place search using SMT with State Equation took 63 ms to find 0 implicit places.
[2024-05-21 01:01:09] [INFO ] Invariant cache hit.
[2024-05-21 01:01:09] [INFO ] Dead Transitions using invariants and state equation in 31 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 20/22 places, 18/18 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 96 ms. Remains : 20/22 places, 18/18 transitions.
Stuttering acceptance computed with spot in 731 ms :[(NOT p2), (AND (NOT p0) p1 (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p2), (AND (NOT p0) p1 (NOT p2)), (AND (NOT p0) p1 (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p2), (AND (NOT p0) p1 (NOT p2)), (NOT p0), (AND (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : ClientsAndServers-PT-N0020P0-LTLCardinality-08 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p3) (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p3) (NOT p1)), acceptance={} source=0 dest: 2}, { cond=true, acceptance={} source=0 dest: 3}, { cond=(AND p3 (NOT p1) (NOT p2) (NOT p0)), acceptance={} source=0 dest: 4}, { cond=(AND p3 (NOT p1) p2 (NOT p0)), acceptance={} source=0 dest: 5}], [{ cond=(AND p1 (NOT p0)), acceptance={} source=1 dest: 6}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=2 dest: 6}, { cond=(NOT p1), acceptance={} source=2 dest: 7}], [{ cond=(AND (NOT p3) (NOT p1) (NOT p0)), acceptance={} source=3 dest: 8}, { cond=(AND (NOT p3) (NOT p1)), acceptance={} source=3 dest: 9}, { cond=true, acceptance={} source=3 dest: 10}, { cond=(AND p3 (NOT p1) (NOT p0)), acceptance={} source=3 dest: 11}], [{ cond=(AND (NOT p3) p1 (NOT p0)), acceptance={} source=4 dest: 8}, { cond=(OR (AND p3 p1 (NOT p0)) (AND p3 p2 (NOT p0))), acceptance={} source=4 dest: 11}], [{ cond=(AND (NOT p3) p1 (NOT p0)), acceptance={} source=5 dest: 8}, { cond=(AND p3 p1 (NOT p0)), acceptance={} source=5 dest: 11}], [{ cond=(AND (NOT p2) (NOT p0)), acceptance={} source=6 dest: 12}], [{ cond=(AND (NOT p1) (NOT p2) (NOT p0)), acceptance={} source=7 dest: 12}, { cond=(AND (NOT p1) (NOT p2)), acceptance={} source=7 dest: 13}], [{ cond=(AND (NOT p2) (NOT p0)), acceptance={} source=8 dest: 6}], [{ cond=(AND (NOT p1) (NOT p2) (NOT p0)), acceptance={} source=9 dest: 6}, { cond=(AND (NOT p1) (NOT p2)), acceptance={} source=9 dest: 7}], [{ cond=(AND (NOT p3) (NOT p1) (NOT p2) (NOT p0)), acceptance={} source=10 dest: 8}, { cond=(AND (NOT p3) (NOT p1) (NOT p2)), acceptance={} source=10 dest: 9}, { cond=(NOT p2), acceptance={0} source=10 dest: 10}, { cond=(AND p3 (NOT p1) (NOT p2) (NOT p0)), acceptance={} source=10 dest: 11}], [{ cond=(AND (NOT p3) p1 (NOT p2) (NOT p0)), acceptance={} source=11 dest: 8}, { cond=(AND p3 p1 (NOT p2) (NOT p0)), acceptance={0} source=11 dest: 11}], [{ cond=(NOT p0), acceptance={0} source=12 dest: 12}], [{ cond=(AND (NOT p1) (NOT p2) (NOT p0)), acceptance={} source=13 dest: 12}, { cond=(AND (NOT p1) p2), acceptance={} source=13 dest: 13}, { cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=13 dest: 13}, { cond=(AND (NOT p1) p2 (NOT p0)), acceptance={} source=13 dest: 14}], [{ cond=(AND (NOT p2) (NOT p0)), acceptance={} source=14 dest: 12}, { cond=(AND p2 (NOT p0)), acceptance={} source=14 dest: 14}]], initial=0, aps=[p3:(LEQ 3 s11), p1:(LEQ 2 s18), p0:(LEQ 2 s6), p2:(LEQ 1 s1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 1084 reset in 108 ms.
Product exploration explored 100000 steps with 1111 reset in 127 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 p3) (NOT p1) (NOT p0) (NOT p2)), (X (AND (NOT p3) (NOT p1))), (X (NOT (AND p3 p1 (NOT p0)))), (X (NOT (AND p3 (NOT p1) (NOT p0)))), (X (NOT (AND p1 (NOT p0)))), (X (NOT (AND (NOT p3) p1 (NOT p0)))), (X (NOT p1)), (X (AND (NOT p1) (NOT p0))), (X (AND (NOT p3) (NOT p1) (NOT p0))), (X (NOT (OR (AND p3 p1 (NOT p0)) (AND p3 p2 (NOT p0))))), (X (X (AND (NOT p3) (NOT p1) (NOT p2) (NOT p0)))), (X (X (AND (NOT p2) (NOT p0)))), (X (X (NOT (AND (NOT p3) p1 (NOT p2) (NOT p0))))), (X (X (NOT p2))), (X (X (AND (NOT p1) (NOT p2)))), (X (X (AND (NOT p3) (NOT p1) (NOT p2)))), (X (X (NOT (AND p3 p1 (NOT p2) (NOT p0))))), (X (X (NOT (AND p3 (NOT p1) (NOT p2) (NOT p0))))), (X (X (AND (NOT p1) (NOT p2) (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 19 factoid took 152 ms. Reduced automaton from 15 states, 35 edges and 4 AP (stutter sensitive) to 11 states, 23 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 542 ms :[(NOT p2), (NOT p2), (AND (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p2), (AND (NOT p0) p1 (NOT p2)), (NOT p0), (AND (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p2))]
Incomplete random walk after 10032 steps, including 5 resets, run finished after 18 ms. (steps per millisecond=557 ) properties (out of 13) seen :12
Finished Best-First random walk after 311 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=311 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND (NOT p3) (NOT p1) (NOT p0) (NOT p2)), (X (AND (NOT p3) (NOT p1))), (X (NOT (AND p3 p1 (NOT p0)))), (X (NOT (AND p3 (NOT p1) (NOT p0)))), (X (NOT (AND p1 (NOT p0)))), (X (NOT (AND (NOT p3) p1 (NOT p0)))), (X (NOT p1)), (X (AND (NOT p1) (NOT p0))), (X (AND (NOT p3) (NOT p1) (NOT p0))), (X (NOT (OR (AND p3 p1 (NOT p0)) (AND p3 p2 (NOT p0))))), (X (X (AND (NOT p3) (NOT p1) (NOT p2) (NOT p0)))), (X (X (AND (NOT p2) (NOT p0)))), (X (X (NOT (AND (NOT p3) p1 (NOT p2) (NOT p0))))), (X (X (NOT p2))), (X (X (AND (NOT p1) (NOT p2)))), (X (X (AND (NOT p3) (NOT p1) (NOT p2)))), (X (X (NOT (AND p3 p1 (NOT p2) (NOT p0))))), (X (X (NOT (AND p3 (NOT p1) (NOT p2) (NOT p0))))), (X (X (AND (NOT p1) (NOT p2) (NOT p0))))]
False Knowledge obtained : [(F (AND (NOT p0) p1 p3 (NOT p2))), (F (AND (NOT p0) p1 (NOT p3) (NOT p2))), (F p0), (F (NOT (AND (NOT p1) (NOT p3) (NOT p2)))), (F (NOT (AND (NOT p0) (NOT p1) (NOT p3) (NOT p2)))), (F (AND (NOT p0) (NOT p1) p3 (NOT p2))), (F (AND (NOT p0) p2)), (F p2), (F (NOT (AND (NOT p0) (NOT p2)))), (F (NOT (AND (NOT p1) (NOT p2)))), (F (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (F (AND (NOT p0) (NOT p1) p2)), (F (AND (NOT p1) p2))]
Knowledge based reduction with 19 factoid took 558 ms. Reduced automaton from 11 states, 23 edges and 4 AP (stutter sensitive) to 11 states, 23 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 514 ms :[(NOT p2), (NOT p2), (AND (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p2), (AND (NOT p0) p1 (NOT p2)), (NOT p0), (AND (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 500 ms :[(NOT p2), (NOT p2), (AND (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p2), (AND (NOT p0) p1 (NOT p2)), (NOT p0), (AND (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p2))]
[2024-05-21 01:01:12] [INFO ] Invariant cache hit.
[2024-05-21 01:01:12] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2024-05-21 01:01:12] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-21 01:01:12] [INFO ] [Real]Absence check using state equation in 6 ms returned sat
[2024-05-21 01:01:12] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 01:01:12] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-21 01:01:12] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-21 01:01:12] [INFO ] [Nat]Absence check using state equation in 8 ms returned sat
[2024-05-21 01:01:12] [INFO ] Computed and/alt/rep : 17/17/17 causal constraints (skipped 0 transitions) in 1 ms.
[2024-05-21 01:01:12] [INFO ] Added : 13 causal constraints over 3 iterations in 18 ms. Result :sat
Could not prove EG (NOT p2)
Support contains 4 out of 20 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 20/20 places, 18/18 transitions.
Applied a total of 0 rules in 1 ms. Remains 20 /20 variables (removed 0) and now considering 18/18 (removed 0) transitions.
[2024-05-21 01:01:12] [INFO ] Invariant cache hit.
[2024-05-21 01:01:12] [INFO ] Implicit Places using invariants in 21 ms returned []
[2024-05-21 01:01:12] [INFO ] Invariant cache hit.
[2024-05-21 01:01:12] [INFO ] Implicit Places using invariants and state equation in 37 ms returned []
Implicit Place search using SMT with State Equation took 60 ms to find 0 implicit places.
[2024-05-21 01:01:12] [INFO ] Invariant cache hit.
[2024-05-21 01:01:12] [INFO ] Dead Transitions using invariants and state equation in 45 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 107 ms. Remains : 20/20 places, 18/18 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p2) (NOT p1) (NOT p3)), (X (X (AND (NOT p0) (NOT p1) (NOT p2)))), (X (X (AND (NOT p1) (NOT p3) (NOT p2)))), (X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT p2))), (X (X (AND (NOT p1) (NOT p2)))), (X (X (AND (NOT p0) (NOT p1) (NOT p3) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p1) p3 (NOT p2)))))]
False Knowledge obtained : []
Knowledge based reduction with 8 factoid took 114 ms. Reduced automaton from 11 states, 23 edges and 4 AP (stutter sensitive) to 11 states, 23 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 520 ms :[(NOT p2), (NOT p2), (AND (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p2), (AND (NOT p0) p1 (NOT p2)), (NOT p0), (AND (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p2))]
Incomplete random walk after 10032 steps, including 5 resets, run finished after 15 ms. (steps per millisecond=668 ) properties (out of 13) seen :12
Finished Best-First random walk after 432 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=216 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND (NOT p0) (NOT p2) (NOT p1) (NOT p3)), (X (X (AND (NOT p0) (NOT p1) (NOT p2)))), (X (X (AND (NOT p1) (NOT p3) (NOT p2)))), (X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT p2))), (X (X (AND (NOT p1) (NOT p2)))), (X (X (AND (NOT p0) (NOT p1) (NOT p3) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p1) p3 (NOT p2)))))]
False Knowledge obtained : [(F (AND (NOT p0) p1 (NOT p2) p3)), (F (AND (NOT p0) p1 (NOT p2) (NOT p3))), (F p0), (F (NOT (AND (NOT p1) (NOT p2) (NOT p3)))), (F (NOT (AND (NOT p0) (NOT p1) (NOT p2) (NOT p3)))), (F (AND (NOT p0) (NOT p1) (NOT p2) p3)), (F (AND (NOT p0) p2)), (F p2), (F (NOT (AND (NOT p0) (NOT p2)))), (F (NOT (AND (NOT p1) (NOT p2)))), (F (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (F (AND (NOT p0) (NOT p1) p2)), (F (AND (NOT p1) p2))]
Knowledge based reduction with 8 factoid took 454 ms. Reduced automaton from 11 states, 23 edges and 4 AP (stutter sensitive) to 11 states, 23 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 524 ms :[(NOT p2), (NOT p2), (AND (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p2), (AND (NOT p0) p1 (NOT p2)), (NOT p0), (AND (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 488 ms :[(NOT p2), (NOT p2), (AND (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p2), (AND (NOT p0) p1 (NOT p2)), (NOT p0), (AND (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p2))]
[2024-05-21 01:01:14] [INFO ] Invariant cache hit.
[2024-05-21 01:01:14] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-21 01:01:14] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-21 01:01:14] [INFO ] [Real]Absence check using state equation in 11 ms returned sat
[2024-05-21 01:01:14] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 01:01:14] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-21 01:01:14] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-21 01:01:14] [INFO ] [Nat]Absence check using state equation in 5 ms returned sat
[2024-05-21 01:01:14] [INFO ] Computed and/alt/rep : 17/17/17 causal constraints (skipped 0 transitions) in 9 ms.
[2024-05-21 01:01:14] [INFO ] Added : 13 causal constraints over 3 iterations in 24 ms. Result :sat
Could not prove EG (NOT p2)
Stuttering acceptance computed with spot in 604 ms :[(NOT p2), (NOT p2), (AND (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p2), (AND (NOT p0) p1 (NOT p2)), (NOT p0), (AND (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p2))]
Product exploration explored 100000 steps with 765 reset in 93 ms.
Stack based approach found an accepted trace after 3871 steps with 30 reset with depth 59 and stack size 59 in 4 ms.
FORMULA ClientsAndServers-PT-N0020P0-LTLCardinality-08 FALSE TECHNIQUES STACK_TEST
Treatment of property ClientsAndServers-PT-N0020P0-LTLCardinality-08 finished in 6655 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&&X((p0 U (p1||G(p0))))) U (G((p0&&X((p0 U (p1||G(p0))))))||(p0&&X((p0 U (p1||G(p0))))&&G(!p2))))))'
Support contains 5 out of 22 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 22/22 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 21 transition count 18
Applied a total of 1 rules in 2 ms. Remains 21 /22 variables (removed 1) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 21 cols
[2024-05-21 01:01:15] [INFO ] Computed 4 invariants in 0 ms
[2024-05-21 01:01:15] [INFO ] Implicit Places using invariants in 33 ms returned []
[2024-05-21 01:01:15] [INFO ] Invariant cache hit.
[2024-05-21 01:01:15] [INFO ] Implicit Places using invariants and state equation in 38 ms returned []
Implicit Place search using SMT with State Equation took 73 ms to find 0 implicit places.
[2024-05-21 01:01:15] [INFO ] Invariant cache hit.
[2024-05-21 01:01:15] [INFO ] Dead Transitions using invariants and state equation in 38 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 21/22 places, 18/18 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 114 ms. Remains : 21/22 places, 18/18 transitions.
Stuttering acceptance computed with spot in 256 ms :[true, (NOT p0), p2, (AND (NOT p0) p2), (NOT p0), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) p2))]
Running random walk in product with property : ClientsAndServers-PT-N0020P0-LTLCardinality-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 4}], [{ cond=p2, acceptance={} source=2 dest: 0}, { cond=(NOT p2), acceptance={} source=2 dest: 2}], [{ cond=(AND (NOT p0) p2), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p0) (NOT p2)), acceptance={} source=3 dest: 2}, { cond=(AND p0 (NOT p2)), acceptance={} source=3 dest: 3}, { cond=(AND p0 p2), acceptance={} source=3 dest: 4}], [{ cond=(NOT p0), acceptance={} source=4 dest: 0}, { cond=(AND p0 p2), acceptance={} source=4 dest: 4}, { cond=(AND p0 (NOT p2)), acceptance={} source=4 dest: 5}], [{ cond=(OR (AND (NOT p0) p2) (AND (NOT p0) (NOT p1))), acceptance={} source=5 dest: 0}, { cond=(AND (NOT p0) (NOT p2) p1), acceptance={} source=5 dest: 2}, { cond=(AND p0 (NOT p2) p1), acceptance={} source=5 dest: 3}, { cond=(AND p0 p2), acceptance={} source=5 dest: 4}, { cond=(AND p0 (NOT p2) (NOT p1)), acceptance={} source=5 dest: 5}]], initial=1, aps=[p2:(OR (AND (LEQ 3 s5) (LEQ s9 s8)) (LEQ 3 s19)), p0:(LEQ 3 s19), p1:(GT 3 s2)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, 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-N0020P0-LTLCardinality-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ClientsAndServers-PT-N0020P0-LTLCardinality-10 finished in 395 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 22 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 22/22 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 21 transition count 18
Applied a total of 1 rules in 1 ms. Remains 21 /22 variables (removed 1) and now considering 18/18 (removed 0) transitions.
[2024-05-21 01:01:16] [INFO ] Invariant cache hit.
[2024-05-21 01:01:16] [INFO ] Implicit Places using invariants in 30 ms returned []
[2024-05-21 01:01:16] [INFO ] Invariant cache hit.
[2024-05-21 01:01:16] [INFO ] Implicit Places using invariants and state equation in 25 ms returned []
Implicit Place search using SMT with State Equation took 57 ms to find 0 implicit places.
[2024-05-21 01:01:16] [INFO ] Invariant cache hit.
[2024-05-21 01:01:16] [INFO ] Dead Transitions using invariants and state equation in 33 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 21/22 places, 18/18 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 93 ms. Remains : 21/22 places, 18/18 transitions.
Stuttering acceptance computed with spot in 109 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : ClientsAndServers-PT-N0020P0-LTLCardinality-14 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:(OR (LEQ 3 s1) (GT 3 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][false, false, false]]
Product exploration explored 100000 steps with 33333 reset in 92 ms.
Product exploration explored 100000 steps with 33333 reset in 97 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 (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 2 factoid took 20 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA ClientsAndServers-PT-N0020P0-LTLCardinality-14 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ClientsAndServers-PT-N0020P0-LTLCardinality-14 finished in 428 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||X(F((F(p2)&&p1))))))'
Support contains 3 out of 22 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 22/22 places, 18/18 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 21 transition count 18
Applied a total of 1 rules in 3 ms. Remains 21 /22 variables (removed 1) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 21 cols
[2024-05-21 01:01:16] [INFO ] Computed 4 invariants in 2 ms
[2024-05-21 01:01:16] [INFO ] Implicit Places using invariants in 31 ms returned []
[2024-05-21 01:01:16] [INFO ] Invariant cache hit.
[2024-05-21 01:01:16] [INFO ] Implicit Places using invariants and state equation in 31 ms returned []
Implicit Place search using SMT with State Equation took 65 ms to find 0 implicit places.
[2024-05-21 01:01:16] [INFO ] Invariant cache hit.
[2024-05-21 01:01:16] [INFO ] Dead Transitions using invariants and state equation in 28 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 21/22 places, 18/18 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 98 ms. Remains : 21/22 places, 18/18 transitions.
Stuttering acceptance computed with spot in 127 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : ClientsAndServers-PT-N0020P0-LTLCardinality-15 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p0) p1 (NOT p2)), acceptance={0} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(AND (LEQ 3 s0) (LEQ 1 s16)), p1:(AND (LEQ 3 s0) (LEQ 1 s16)), p2:(GT 3 s1)], 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 15057 reset in 73 ms.
Product exploration explored 100000 steps with 15051 reset in 97 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) p2), (X (NOT (AND (NOT p0) p1 (NOT p2)))), (X (AND (NOT p0) (NOT p1))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (AND (NOT p0) (NOT p1))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 6 factoid took 120 ms. Reduced automaton from 3 states, 4 edges and 3 AP (stutter sensitive) to 9 states, 27 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 385 ms :[(AND (NOT p0) (NOT p2)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2)))]
Incomplete random walk after 10031 steps, including 5 resets, run finished after 22 ms. (steps per millisecond=455 ) properties (out of 8) seen :3
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 5) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 4) seen :0
Running SMT prover for 4 properties.
[2024-05-21 01:01:17] [INFO ] Invariant cache hit.
[2024-05-21 01:01:17] [INFO ] After 16ms SMT Verify possible using all constraints in real domain returned unsat :4 sat :0
Fused 4 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 4 invariant AP formulas.
Knowledge obtained : [(AND (NOT p0) (NOT p1) p2), (X (NOT (AND (NOT p0) p1 (NOT p2)))), (X (AND (NOT p0) (NOT p1))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (AND (NOT p0) (NOT p1)))), (G (NOT (AND p0 (NOT p1) p2))), (G (NOT (AND (NOT p0) p1 (NOT p2)))), (G (NOT (AND p0 (NOT p1) (NOT p2)))), (G (NOT (AND (NOT p0) p1 p2)))]
False Knowledge obtained : [(F (AND p0 p1 (NOT p2))), (F (AND p0 p1 p2)), (F (AND (NOT p0) (NOT p2))), (F (NOT (AND (NOT p0) (NOT p1))))]
Knowledge based reduction with 10 factoid took 256 ms. Reduced automaton from 9 states, 27 edges and 3 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 30 ms :[(NOT p1)]
Stuttering acceptance computed with spot in 30 ms :[(NOT p1)]
[2024-05-21 01:01:17] [INFO ] Invariant cache hit.
[2024-05-21 01:01:18] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-21 01:01:18] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-21 01:01:18] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-21 01:01:18] [INFO ] [Real]Absence check using state equation in 12 ms returned sat
[2024-05-21 01:01:18] [INFO ] Computed and/alt/rep : 17/18/17 causal constraints (skipped 0 transitions) in 1 ms.
[2024-05-21 01:01:18] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 01:01:18] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-21 01:01:18] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-21 01:01:18] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-21 01:01:18] [INFO ] [Nat]Absence check using state equation in 6 ms returned sat
[2024-05-21 01:01:18] [INFO ] Computed and/alt/rep : 17/18/17 causal constraints (skipped 0 transitions) in 1 ms.
[2024-05-21 01:01:18] [INFO ] Added : 9 causal constraints over 2 iterations in 9 ms. Result :sat
Could not prove EG (NOT p1)
Support contains 2 out of 21 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 21/21 places, 18/18 transitions.
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 21 transition count 15
Reduce places removed 3 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 1 with 6 rules applied. Total rules applied 9 place count 18 transition count 12
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 12 place count 15 transition count 12
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 12 place count 15 transition count 9
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 18 place count 12 transition count 9
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 20 place count 11 transition count 8
Applied a total of 20 rules in 4 ms. Remains 11 /21 variables (removed 10) and now considering 8/18 (removed 10) transitions.
// Phase 1: matrix 8 rows 11 cols
[2024-05-21 01:01:18] [INFO ] Computed 4 invariants in 0 ms
[2024-05-21 01:01:18] [INFO ] Implicit Places using invariants in 21 ms returned [10]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 22 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 10/21 places, 8/18 transitions.
Applied a total of 0 rules in 1 ms. Remains 10 /10 variables (removed 0) and now considering 8/8 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 28 ms. Remains : 10/21 places, 8/18 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(NOT p1), (X (NOT p1))]
False Knowledge obtained : [(X (X (NOT p1))), (X (X p1))]
Knowledge based reduction with 2 factoid took 92 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 p1)]
Finished random walk after 42 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=42 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(NOT p1), (X (NOT p1))]
False Knowledge obtained : [(X (X (NOT p1))), (X (X p1)), (F p1)]
Knowledge based reduction with 2 factoid took 140 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 p1)]
Stuttering acceptance computed with spot in 45 ms :[(NOT p1)]
// Phase 1: matrix 8 rows 10 cols
[2024-05-21 01:01:18] [INFO ] Computed 3 invariants in 0 ms
[2024-05-21 01:01:18] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-21 01:01:18] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-21 01:01:18] [INFO ] [Real]Absence check using state equation in 4 ms returned sat
[2024-05-21 01:01:18] [INFO ] Computed and/alt/rep : 7/8/7 causal constraints (skipped 0 transitions) in 1 ms.
[2024-05-21 01:01:18] [INFO ] Added : 3 causal constraints over 1 iterations in 5 ms. Result :sat
Could not prove EG (NOT p1)
Stuttering acceptance computed with spot in 45 ms :[(NOT p1)]
Product exploration explored 100000 steps with 25016 reset in 54 ms.
Product exploration explored 100000 steps with 25019 reset in 53 ms.
Built C files in :
/tmp/ltsmin4738858005914826720
[2024-05-21 01:01:18] [INFO ] Computing symmetric may disable matrix : 8 transitions.
[2024-05-21 01:01:18] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 01:01:18] [INFO ] Computing symmetric may enable matrix : 8 transitions.
[2024-05-21 01:01:18] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 01:01:18] [INFO ] Computing Do-Not-Accords matrix : 8 transitions.
[2024-05-21 01:01:18] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 01:01:18] [INFO ] Built C files in 2ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4738858005914826720
Running compilation step : cd /tmp/ltsmin4738858005914826720;'/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 87 ms.
Running link step : cd /tmp/ltsmin4738858005914826720;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 30 ms.
Running LTSmin : cd /tmp/ltsmin4738858005914826720;'/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/stateBased14708364937656292043.hoa' '--buchi-type=spotba'
LTSmin run took 58 ms.
FORMULA ClientsAndServers-PT-N0020P0-LTLCardinality-15 TRUE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property ClientsAndServers-PT-N0020P0-LTLCardinality-15 finished in 2362 ms.
All properties solved by simple procedures.
Total runtime 21361 ms.

BK_STOP 1716253279965

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

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