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.r329-tall-171662362200382.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 Referendum-PT-0100, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r329-tall-171662362200382
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 2.9M
-rw-r--r-- 1 mcc users 73K Apr 11 16:33 CTLCardinality.txt
-rw-r--r-- 1 mcc users 361K Apr 11 16:33 CTLCardinality.xml
-rw-r--r-- 1 mcc users 33K Apr 11 16:28 CTLFireability.txt
-rw-r--r-- 1 mcc users 254K Apr 11 16:28 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.8K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 52K Apr 23 07:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 189K Apr 23 07:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 18K Apr 23 07:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 102K Apr 23 07:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 146K Apr 11 16:50 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 748K Apr 11 16:50 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 93K Apr 11 16:39 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 690K Apr 11 16:39 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 9.9K Apr 23 07:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 25K Apr 23 07:47 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 5 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 113K May 18 16:43 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 Referendum-PT-0100-LTLCardinality-00
FORMULA_NAME Referendum-PT-0100-LTLCardinality-01
FORMULA_NAME Referendum-PT-0100-LTLCardinality-02
FORMULA_NAME Referendum-PT-0100-LTLCardinality-03
FORMULA_NAME Referendum-PT-0100-LTLCardinality-04
FORMULA_NAME Referendum-PT-0100-LTLCardinality-05
FORMULA_NAME Referendum-PT-0100-LTLCardinality-06
FORMULA_NAME Referendum-PT-0100-LTLCardinality-07
FORMULA_NAME Referendum-PT-0100-LTLCardinality-08
FORMULA_NAME Referendum-PT-0100-LTLCardinality-09
FORMULA_NAME Referendum-PT-0100-LTLCardinality-10
FORMULA_NAME Referendum-PT-0100-LTLCardinality-11
FORMULA_NAME Referendum-PT-0100-LTLCardinality-12
FORMULA_NAME Referendum-PT-0100-LTLCardinality-13
FORMULA_NAME Referendum-PT-0100-LTLCardinality-14
FORMULA_NAME Referendum-PT-0100-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1716861907807

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=Referendum-PT-0100
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202304061127
[2024-05-28 02:05:09] [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-28 02:05:09] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-28 02:05:09] [INFO ] Load time of PNML (sax parser for PT used): 55 ms
[2024-05-28 02:05:09] [INFO ] Transformed 301 places.
[2024-05-28 02:05:09] [INFO ] Transformed 201 transitions.
[2024-05-28 02:05:09] [INFO ] Found NUPN structural information;
[2024-05-28 02:05:09] [INFO ] Parsed PT model containing 301 places and 201 transitions and 501 arcs in 118 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 21 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
FORMULA Referendum-PT-0100-LTLCardinality-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Referendum-PT-0100-LTLCardinality-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Referendum-PT-0100-LTLCardinality-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Referendum-PT-0100-LTLCardinality-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Referendum-PT-0100-LTLCardinality-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Referendum-PT-0100-LTLCardinality-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Referendum-PT-0100-LTLCardinality-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 301 out of 301 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 301/301 places, 201/201 transitions.
Applied a total of 0 rules in 9 ms. Remains 301 /301 variables (removed 0) and now considering 201/201 (removed 0) transitions.
// Phase 1: matrix 201 rows 301 cols
[2024-05-28 02:05:09] [INFO ] Computed 100 invariants in 13 ms
[2024-05-28 02:05:10] [INFO ] Implicit Places using invariants in 437 ms returned []
[2024-05-28 02:05:10] [INFO ] Invariant cache hit.
[2024-05-28 02:05:10] [INFO ] Implicit Places using invariants and state equation in 154 ms returned []
Implicit Place search using SMT with State Equation took 615 ms to find 0 implicit places.
[2024-05-28 02:05:10] [INFO ] Invariant cache hit.
[2024-05-28 02:05:10] [INFO ] Dead Transitions using invariants and state equation in 145 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 771 ms. Remains : 301/301 places, 201/201 transitions.
Support contains 301 out of 301 places after structural reductions.
[2024-05-28 02:05:10] [INFO ] Flatten gal took : 40 ms
[2024-05-28 02:05:10] [INFO ] Flatten gal took : 20 ms
[2024-05-28 02:05:10] [INFO ] Input system was already deterministic with 201 transitions.
Finished random walk after 385 steps, including 3 resets, run visited all 16 properties in 30 ms. (steps per millisecond=12 )
Parikh walk visited 0 properties in 1 ms.
Computed a total of 301 stabilizing places and 201 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 301 transition count 201
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
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||F(p1))&&(F(p1)||X(p2))))))'
Support contains 201 out of 301 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 301/301 places, 201/201 transitions.
Graph (complete) has 300 edges and 301 vertex of which 201 are kept as prefixes of interest. Removing 100 places using SCC suffix rule.2 ms
Discarding 100 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 13 ms. Remains 201 /301 variables (removed 100) and now considering 201/201 (removed 0) transitions.
// Phase 1: matrix 201 rows 201 cols
[2024-05-28 02:05:11] [INFO ] Computed 0 invariants in 5 ms
[2024-05-28 02:05:11] [INFO ] Implicit Places using invariants in 44 ms returned []
[2024-05-28 02:05:11] [INFO ] Invariant cache hit.
[2024-05-28 02:05:11] [INFO ] Implicit Places using invariants and state equation in 96 ms returned []
Implicit Place search using SMT with State Equation took 143 ms to find 0 implicit places.
[2024-05-28 02:05:11] [INFO ] Redundant transitions in 6 ms returned []
[2024-05-28 02:05:11] [INFO ] Invariant cache hit.
[2024-05-28 02:05:11] [INFO ] Dead Transitions using invariants and state equation in 106 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 201/301 places, 201/201 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 276 ms. Remains : 201/301 places, 201/201 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 360 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1))), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : Referendum-PT-0100-LTLCardinality-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={} source=0 dest: 2}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={0} source=1 dest: 2}], [{ cond=(AND p0 (NOT p1) (NOT p2)), acceptance={} source=2 dest: 1}, { cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={0} source=2 dest: 1}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(GT s0 (ADD s101 s102 s103 s104 s105 s106 s107 s108 s109 s110 s111 s112 s113 s114 s115 s116 s117 s118 s119 s120 s121 s122 s123 s124 s125 s126 s127 s128...], 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 101 steps with 0 reset in 11 ms.
FORMULA Referendum-PT-0100-LTLCardinality-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Referendum-PT-0100-LTLCardinality-00 finished in 702 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)))'
Support contains 100 out of 301 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 301/301 places, 201/201 transitions.
Graph (complete) has 300 edges and 301 vertex of which 101 are kept as prefixes of interest. Removing 200 places using SCC suffix rule.2 ms
Discarding 200 places :
Also discarding 0 output transitions
Ensure Unique test removed 100 transitions
Reduce isomorphic transitions removed 100 transitions.
Iterating post reduction 0 with 100 rules applied. Total rules applied 101 place count 101 transition count 101
Applied a total of 101 rules in 12 ms. Remains 101 /301 variables (removed 200) and now considering 101/201 (removed 100) transitions.
// Phase 1: matrix 101 rows 101 cols
[2024-05-28 02:05:11] [INFO ] Computed 0 invariants in 1 ms
[2024-05-28 02:05:11] [INFO ] Implicit Places using invariants in 28 ms returned []
[2024-05-28 02:05:11] [INFO ] Invariant cache hit.
[2024-05-28 02:05:11] [INFO ] Implicit Places using invariants and state equation in 65 ms returned []
Implicit Place search using SMT with State Equation took 95 ms to find 0 implicit places.
[2024-05-28 02:05:11] [INFO ] Redundant transitions in 1 ms returned []
[2024-05-28 02:05:11] [INFO ] Invariant cache hit.
[2024-05-28 02:05:11] [INFO ] Dead Transitions using invariants and state equation in 53 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 101/301 places, 101/201 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 167 ms. Remains : 101/301 places, 101/201 transitions.
Stuttering acceptance computed with spot in 76 ms :[p0, p0]
Running random walk in product with property : Referendum-PT-0100-LTLCardinality-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=p0, acceptance={} source=0 dest: 1}], [{ cond=p0, acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(GT 2 (ADD s1 s2 s3 s4 s5 s6 s7 s8 s9 s10 s11 s12 s13 s14 s15 s16 s17 s18 s19 s20 s21 s22 s23 s24 s25 s26 s27 s28 s29 s30 s31 s32 s33 s34 s35 s36 s37 s...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 103 steps with 1 reset in 2 ms.
FORMULA Referendum-PT-0100-LTLCardinality-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Referendum-PT-0100-LTLCardinality-01 finished in 257 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)))'
Support contains 200 out of 301 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 301/301 places, 201/201 transitions.
Reduce places removed 1 places and 1 transitions.
Applied a total of 0 rules in 16 ms. Remains 300 /301 variables (removed 1) and now considering 200/201 (removed 1) transitions.
// Phase 1: matrix 200 rows 300 cols
[2024-05-28 02:05:11] [INFO ] Computed 100 invariants in 1 ms
[2024-05-28 02:05:12] [INFO ] Implicit Places using invariants in 79 ms returned []
[2024-05-28 02:05:12] [INFO ] Invariant cache hit.
[2024-05-28 02:05:12] [INFO ] Implicit Places using invariants and state equation in 117 ms returned []
Implicit Place search using SMT with State Equation took 197 ms to find 0 implicit places.
[2024-05-28 02:05:12] [INFO ] Redundant transitions in 5 ms returned []
[2024-05-28 02:05:12] [INFO ] Invariant cache hit.
[2024-05-28 02:05:12] [INFO ] Dead Transitions using invariants and state equation in 140 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 367 ms. Remains : 300/301 places, 200/201 transitions.
Stuttering acceptance computed with spot in 84 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : Referendum-PT-0100-LTLCardinality-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(LEQ (ADD s200 s201 s202 s203 s204 s205 s206 s207 s208 s209 s210 s211 s212 s213 s214 s215 s216 s217 s218 s219 s220 s221 s222 s223 s224 s225 s226 s227 s...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 417 steps with 7 reset in 11 ms.
FORMULA Referendum-PT-0100-LTLCardinality-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Referendum-PT-0100-LTLCardinality-02 finished in 476 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) U (X(G(p2))&&p1))))'
Support contains 301 out of 301 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 301/301 places, 201/201 transitions.
Applied a total of 0 rules in 2 ms. Remains 301 /301 variables (removed 0) and now considering 201/201 (removed 0) transitions.
// Phase 1: matrix 201 rows 301 cols
[2024-05-28 02:05:12] [INFO ] Computed 100 invariants in 2 ms
[2024-05-28 02:05:12] [INFO ] Implicit Places using invariants in 69 ms returned []
[2024-05-28 02:05:12] [INFO ] Invariant cache hit.
[2024-05-28 02:05:12] [INFO ] Implicit Places using invariants and state equation in 139 ms returned []
Implicit Place search using SMT with State Equation took 210 ms to find 0 implicit places.
[2024-05-28 02:05:12] [INFO ] Invariant cache hit.
[2024-05-28 02:05:12] [INFO ] Dead Transitions using invariants and state equation in 121 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 334 ms. Remains : 301/301 places, 201/201 transitions.
Stuttering acceptance computed with spot in 204 ms :[(OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2)), (NOT p0), (NOT p2), (AND (NOT p0) p1 (NOT p2))]
Running random walk in product with property : Referendum-PT-0100-LTLCardinality-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=1 dest: 2}, { cond=p1, acceptance={0} source=1 dest: 3}, { cond=(AND p1 (NOT p0)), acceptance={} source=1 dest: 4}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=3 dest: 1}, { cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={} source=3 dest: 2}, { cond=p2, acceptance={} source=3 dest: 3}, { cond=(AND p1 (NOT p2)), acceptance={0} source=3 dest: 3}, { cond=(OR (AND p1 (NOT p0)) (AND (NOT p0) p2)), acceptance={} source=3 dest: 4}], [{ cond=(AND p1 (NOT p0) (NOT p2)), acceptance={} source=4 dest: 2}]], initial=0, aps=[p1:(AND (LEQ (ADD s1 s2 s3 s4 s5 s6 s7 s8 s9 s10 s11 s12 s13 s14 s15 s16 s17 s18 s19 s20 s21 s22 s23 s24 s25 s26 s27 s28 s29 s30 s31 s32 s33 s34 s35 s36 s...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 1451 reset in 1560 ms.
Product exploration explored 100000 steps with 1450 reset in 1566 ms.
Computed a total of 301 stabilizing places and 201 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 301 transition count 201
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND (NOT p1) p0 p2), (X (NOT (AND p1 (NOT p0)))), (X (AND (NOT p1) (NOT p0))), (X (NOT p1)), (X (X (NOT p2))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (AND (NOT p1) (NOT p0) (NOT p2)))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT p0))), (X (X (NOT (OR (AND p1 (NOT p0)) (AND (NOT p0) p2))))), (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND p1 (NOT p0) (NOT p2))))), (X (X (NOT p1))), (F (OR (G p1) (G (NOT p1)))), (F (G p0)), (F (G (NOT p2)))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 17 factoid took 693 ms. Reduced automaton from 5 states, 12 edges and 3 AP (stutter sensitive) to 5 states, 13 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 183 ms :[(OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2)), (NOT p2), (AND p1 (NOT p2)), false]
Incomplete random walk after 10000 steps, including 98 resets, run finished after 172 ms. (steps per millisecond=58 ) properties (out of 5) seen :4
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 103 ms. (steps per millisecond=97 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2024-05-28 02:05:17] [INFO ] Invariant cache hit.
[2024-05-28 02:05:17] [INFO ] After 158ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-28 02:05:17] [INFO ] [Nat]Absence check using 100 positive place invariants in 18 ms returned sat
[2024-05-28 02:05:17] [INFO ] After 152ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :0
Fused 1 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p1) p0 p2), (X (NOT (AND p1 (NOT p0)))), (X (AND (NOT p1) (NOT p0))), (X (NOT p1)), (X (X (NOT p2))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (AND (NOT p1) (NOT p0) (NOT p2)))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT p0))), (X (X (NOT (OR (AND p1 (NOT p0)) (AND (NOT p0) p2))))), (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND p1 (NOT p0) (NOT p2))))), (X (X (NOT p1))), (F (OR (G p1) (G (NOT p1)))), (F (G p0)), (F (G (NOT p2))), (G (NOT (AND p1 p2)))]
False Knowledge obtained : [(F (NOT p2)), (F (AND (NOT p1) (NOT p2))), (F p1), (F (AND p1 (NOT p2)))]
Property proved to be false thanks to negative knowledge :(F (NOT p2))
Knowledge based reduction with 18 factoid took 1034 ms. Reduced automaton from 5 states, 13 edges and 2 AP (stutter insensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA Referendum-PT-0100-LTLCardinality-03 FALSE TECHNIQUES KNOWLEDGE
Treatment of property Referendum-PT-0100-LTLCardinality-03 finished in 6384 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||G(p1)))) U (p2&&(p0||X((p0||G(p1))))))))'
Support contains 301 out of 301 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 301/301 places, 201/201 transitions.
Applied a total of 0 rules in 3 ms. Remains 301 /301 variables (removed 0) and now considering 201/201 (removed 0) transitions.
[2024-05-28 02:05:18] [INFO ] Invariant cache hit.
[2024-05-28 02:05:18] [INFO ] Implicit Places using invariants in 74 ms returned []
[2024-05-28 02:05:18] [INFO ] Invariant cache hit.
[2024-05-28 02:05:18] [INFO ] Implicit Places using invariants and state equation in 120 ms returned []
Implicit Place search using SMT with State Equation took 196 ms to find 0 implicit places.
[2024-05-28 02:05:18] [INFO ] Invariant cache hit.
[2024-05-28 02:05:19] [INFO ] Dead Transitions using invariants and state equation in 126 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 326 ms. Remains : 301/301 places, 201/201 transitions.
Stuttering acceptance computed with spot in 191 ms :[(OR (NOT p2) (AND (NOT p0) (NOT p1))), (OR (NOT p2) (AND (NOT p0) (NOT p1))), (AND (NOT p1) (NOT p0)), true, (NOT p1)]
Running random walk in product with property : Referendum-PT-0100-LTLCardinality-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p2), acceptance={0} source=1 dest: 1}, { cond=(NOT p0), acceptance={0} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 3}, { cond=(AND (NOT p0) p1), acceptance={} source=2 dest: 4}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=(NOT p1), acceptance={} source=4 dest: 3}, { cond=p1, acceptance={} source=4 dest: 4}]], initial=0, aps=[p2:(LEQ s0 (ADD s101 s102 s103 s104 s105 s106 s107 s108 s109 s110 s111 s112 s113 s114 s115 s116 s117 s118 s119 s120 s121 s122 s123 s124 s125 s126 s127 s12...], 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][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA Referendum-PT-0100-LTLCardinality-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Referendum-PT-0100-LTLCardinality-04 finished in 540 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))&&(G(p1) U p2)))'
Support contains 301 out of 301 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 301/301 places, 201/201 transitions.
Applied a total of 0 rules in 2 ms. Remains 301 /301 variables (removed 0) and now considering 201/201 (removed 0) transitions.
[2024-05-28 02:05:19] [INFO ] Invariant cache hit.
[2024-05-28 02:05:19] [INFO ] Implicit Places using invariants in 76 ms returned []
[2024-05-28 02:05:19] [INFO ] Invariant cache hit.
[2024-05-28 02:05:19] [INFO ] Implicit Places using invariants and state equation in 138 ms returned []
Implicit Place search using SMT with State Equation took 215 ms to find 0 implicit places.
[2024-05-28 02:05:19] [INFO ] Invariant cache hit.
[2024-05-28 02:05:19] [INFO ] Dead Transitions using invariants and state equation in 120 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 337 ms. Remains : 301/301 places, 201/201 transitions.
Stuttering acceptance computed with spot in 189 ms :[(OR (NOT p2) (NOT p0)), true, (NOT p0), (NOT p1), (NOT p2)]
Running random walk in product with property : Referendum-PT-0100-LTLCardinality-05 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=0 dest: 1}, { cond=(OR p2 p1), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p2) p1), acceptance={} source=0 dest: 3}, { cond=(AND (NOT p2) p1), acceptance={} source=0 dest: 4}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={} source=3 dest: 1}, { cond=p1, acceptance={} source=3 dest: 3}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=4 dest: 1}, { cond=(AND (NOT p2) p1), acceptance={0} source=4 dest: 3}, { cond=(AND (NOT p2) p1), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p2:(LEQ (ADD s1 s2 s3 s4 s5 s6 s7 s8 s9 s10 s11 s12 s13 s14 s15 s16 s17 s18 s19 s20 s21 s22 s23 s24 s25 s26 s27 s28 s29 s30 s31 s32 s33 s34 s35 s36 s37 s3...], 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][false, false, false, false, false]]
Product exploration explored 100000 steps with 25059 reset in 1166 ms.
Product exploration explored 100000 steps with 25127 reset in 1148 ms.
Computed a total of 301 stabilizing places and 201 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 301 transition count 201
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND p2 (NOT p1) (NOT p0)), (X (AND (NOT p2) (NOT p1))), (X (NOT p0)), (X (NOT (AND (NOT p2) p1))), (X (NOT p1)), true, (X (X (AND (NOT p2) (NOT p1)))), (X (X (NOT (AND (NOT p2) p1)))), (X (X (NOT p1))), (F (G p2)), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0))]
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 12 factoid took 601 ms. Reduced automaton from 5 states, 11 edges and 3 AP (stutter sensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 35 ms :[(NOT p0)]
Finished random walk after 2 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=2 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p2 (NOT p1) (NOT p0)), (X (AND (NOT p2) (NOT p1))), (X (NOT p0)), (X (NOT (AND (NOT p2) p1))), (X (NOT p1)), true, (X (X (AND (NOT p2) (NOT p1)))), (X (X (NOT (AND (NOT p2) p1)))), (X (X (NOT p1))), (F (G p2)), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0)), (F p0)]
Knowledge based reduction with 12 factoid took 720 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 40 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 42 ms :[(NOT p0)]
[2024-05-28 02:05:23] [INFO ] Invariant cache hit.
Proved EG (NOT p0)
Knowledge obtained : [(AND p2 (NOT p1) (NOT p0)), (X (AND (NOT p2) (NOT p1))), (X (NOT p0)), (X (NOT (AND (NOT p2) p1))), (X (NOT p1)), true, (X (X (AND (NOT p2) (NOT p1)))), (X (X (NOT (AND (NOT p2) p1)))), (X (X (NOT p1))), (F (G p2)), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0)), (F p0), (G (NOT p0))]
Property proved to be false thanks to negative knowledge :(G (NOT p0))
Knowledge based reduction with 12 factoid took 764 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA Referendum-PT-0100-LTLCardinality-05 FALSE TECHNIQUES KNOWLEDGE
Treatment of property Referendum-PT-0100-LTLCardinality-05 finished in 5311 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)||X(((X(!p0) U ((p2&&X(!p0))||X(G(!p0))))||p1))))'
Support contains 301 out of 301 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 301/301 places, 201/201 transitions.
Applied a total of 0 rules in 3 ms. Remains 301 /301 variables (removed 0) and now considering 201/201 (removed 0) transitions.
[2024-05-28 02:05:24] [INFO ] Invariant cache hit.
[2024-05-28 02:05:24] [INFO ] Implicit Places using invariants in 73 ms returned []
[2024-05-28 02:05:24] [INFO ] Invariant cache hit.
[2024-05-28 02:05:24] [INFO ] Implicit Places using invariants and state equation in 130 ms returned []
Implicit Place search using SMT with State Equation took 205 ms to find 0 implicit places.
[2024-05-28 02:05:24] [INFO ] Invariant cache hit.
[2024-05-28 02:05:24] [INFO ] Dead Transitions using invariants and state equation in 112 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 321 ms. Remains : 301/301 places, 201/201 transitions.
Stuttering acceptance computed with spot in 305 ms :[true, p0, false, false, (AND p0 (NOT p1)), false, p0, false, (NOT p0)]
Running random walk in product with property : Referendum-PT-0100-LTLCardinality-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=p0, acceptance={} source=1 dest: 0}], [{ cond=(NOT p0), acceptance={} source=2 dest: 4}, { cond=p0, acceptance={} source=2 dest: 5}], [{ cond=p0, acceptance={} source=3 dest: 8}], [{ cond=(AND (NOT p1) p2), acceptance={} source=4 dest: 1}, { cond=(AND (NOT p1) (NOT p2)), acceptance={} source=4 dest: 6}], [{ cond=(AND (NOT p0) (NOT p1) p2), acceptance={} source=5 dest: 1}, { cond=(AND p0 (NOT p1) p2), acceptance={} source=5 dest: 3}, { cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={} source=5 dest: 6}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={} source=5 dest: 7}], [{ cond=p0, acceptance={} source=6 dest: 0}, { cond=(AND (NOT p0) p2), acceptance={} source=6 dest: 1}, { cond=(AND (NOT p0) (NOT p2)), acceptance={} source=6 dest: 6}], [{ cond=(AND (NOT p0) p2), acceptance={} source=7 dest: 1}, { cond=(AND (NOT p0) (NOT p2)), acceptance={} source=7 dest: 6}, { cond=p0, acceptance={} source=7 dest: 8}], [{ cond=(NOT p0), acceptance={} source=8 dest: 0}, { cond=p0, acceptance={} source=8 dest: 8}]], initial=2, aps=[p0:(LEQ 3 (ADD s101 s102 s103 s104 s105 s106 s107 s108 s109 s110 s111 s112 s113 s114 s115 s116 s117 s118 s119 s120 s121 s122 s123 s124 s125 s126 s127 s128...], 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, null, null, null, null, null][false, false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 1033 ms.
Product exploration explored 100000 steps with 50000 reset in 1055 ms.
Computed a total of 301 stabilizing places and 201 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 301 transition count 201
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND (NOT p0) p1 p2), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (NOT (AND p0 (NOT p1) p2))), (X (NOT (AND (NOT p1) p2))), (X (NOT (AND p0 (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p1) p2))), (X (X (NOT (AND (NOT p0) p2)))), (X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1)))), (F (G (NOT p2)))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 13 factoid took 21 ms. Reduced automaton from 9 states, 19 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA Referendum-PT-0100-LTLCardinality-07 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Referendum-PT-0100-LTLCardinality-07 finished in 2834 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&&F(p2))))))'
Support contains 5 out of 301 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 301/301 places, 201/201 transitions.
Reduce places removed 198 places and 0 transitions.
Ensure Unique test removed 98 transitions
Reduce isomorphic transitions removed 98 transitions.
Iterating post reduction 0 with 296 rules applied. Total rules applied 296 place count 103 transition count 103
Discarding 95 places :
Symmetric choice reduction at 1 with 95 rule applications. Total rules 391 place count 8 transition count 8
Iterating global reduction 1 with 95 rules applied. Total rules applied 486 place count 8 transition count 8
Applied a total of 486 rules in 13 ms. Remains 8 /301 variables (removed 293) and now considering 8/201 (removed 193) transitions.
// Phase 1: matrix 8 rows 8 cols
[2024-05-28 02:05:27] [INFO ] Computed 0 invariants in 1 ms
[2024-05-28 02:05:27] [INFO ] Implicit Places using invariants in 14 ms returned []
[2024-05-28 02:05:27] [INFO ] Invariant cache hit.
[2024-05-28 02:05:27] [INFO ] Implicit Places using invariants and state equation in 21 ms returned []
Implicit Place search using SMT with State Equation took 38 ms to find 0 implicit places.
[2024-05-28 02:05:27] [INFO ] Invariant cache hit.
[2024-05-28 02:05:27] [INFO ] Dead Transitions using invariants and state equation in 22 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 8/301 places, 8/201 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 75 ms. Remains : 8/301 places, 8/201 transitions.
Stuttering acceptance computed with spot in 121 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 : Referendum-PT-0100-LTLCardinality-11 automaton TGBA Formula[mat=[[{ cond=true, 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:(EQ s2 1), p1:(OR (EQ s7 0) (EQ s3 1)), p2:(OR (EQ s0 0) (EQ s6 1))], 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 50000 reset in 59 ms.
Product exploration explored 100000 steps with 50000 reset in 64 ms.
Computed a total of 8 stabilizing places and 8 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 8 transition count 8
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND (NOT p0) p1 (NOT p2)), (X (NOT (AND (NOT p0) p1 (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (F (G (NOT p0))), (F (OR (G p1) (G (NOT p1)))), (F (G p2))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 9 factoid took 21 ms. Reduced automaton from 3 states, 4 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA Referendum-PT-0100-LTLCardinality-11 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Referendum-PT-0100-LTLCardinality-11 finished in 375 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 301 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 301/301 places, 201/201 transitions.
Graph (complete) has 300 edges and 301 vertex of which 2 are kept as prefixes of interest. Removing 299 places using SCC suffix rule.1 ms
Discarding 299 places :
Also discarding 198 output transitions
Drop transitions removed 198 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 2 transition count 2
Applied a total of 2 rules in 6 ms. Remains 2 /301 variables (removed 299) and now considering 2/201 (removed 199) transitions.
// Phase 1: matrix 2 rows 2 cols
[2024-05-28 02:05:27] [INFO ] Computed 0 invariants in 0 ms
[2024-05-28 02:05:27] [INFO ] Implicit Places using invariants in 14 ms returned []
[2024-05-28 02:05:27] [INFO ] Invariant cache hit.
[2024-05-28 02:05:27] [INFO ] Implicit Places using invariants and state equation in 16 ms returned []
Implicit Place search using SMT with State Equation took 33 ms to find 0 implicit places.
[2024-05-28 02:05:27] [INFO ] Redundant transitions in 0 ms returned []
[2024-05-28 02:05:27] [INFO ] Invariant cache hit.
[2024-05-28 02:05:27] [INFO ] Dead Transitions using invariants and state equation in 16 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 2/301 places, 2/201 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 62 ms. Remains : 2/301 places, 2/201 transitions.
Stuttering acceptance computed with spot in 41 ms :[(NOT p0)]
Running random walk in product with property : Referendum-PT-0100-LTLCardinality-14 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (EQ s1 0) (EQ s0 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 2 steps with 0 reset in 0 ms.
FORMULA Referendum-PT-0100-LTLCardinality-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Referendum-PT-0100-LTLCardinality-14 finished in 119 ms.
All properties solved by simple procedures.
Total runtime 18702 ms.

BK_STOP 1716861929145

--------------------
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="Referendum-PT-0100"
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 Referendum-PT-0100, 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 r329-tall-171662362200382"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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