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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 20M
-rw-r--r-- 1 mcc users 559K Apr 12 10:46 CTLCardinality.txt
-rw-r--r-- 1 mcc users 1.9M Apr 12 10:46 CTLCardinality.xml
-rw-r--r-- 1 mcc users 699K Apr 12 10:29 CTLFireability.txt
-rw-r--r-- 1 mcc users 2.9M Apr 12 10:29 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:42 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K May 18 16:42 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 243K Apr 22 14:32 LTLCardinality.txt
-rw-r--r-- 1 mcc users 645K Apr 22 14:32 LTLCardinality.xml
-rw-r--r-- 1 mcc users 252K Apr 22 14:32 LTLFireability.txt
-rw-r--r-- 1 mcc users 779K Apr 22 14:32 LTLFireability.xml
-rw-r--r-- 1 mcc users 562K Apr 12 12:26 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 2.0M Apr 12 12:26 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 1.7M Apr 12 12:04 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 6.8M Apr 12 12:04 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 34K Apr 22 14:32 UpperBounds.txt
-rw-r--r-- 1 mcc users 67K Apr 22 14:32 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 3 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 1.2M 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 CSRepetitions-PT-10-LTLCardinality-00
FORMULA_NAME CSRepetitions-PT-10-LTLCardinality-01
FORMULA_NAME CSRepetitions-PT-10-LTLCardinality-02
FORMULA_NAME CSRepetitions-PT-10-LTLCardinality-03
FORMULA_NAME CSRepetitions-PT-10-LTLCardinality-04
FORMULA_NAME CSRepetitions-PT-10-LTLCardinality-05
FORMULA_NAME CSRepetitions-PT-10-LTLCardinality-06
FORMULA_NAME CSRepetitions-PT-10-LTLCardinality-07
FORMULA_NAME CSRepetitions-PT-10-LTLCardinality-08
FORMULA_NAME CSRepetitions-PT-10-LTLCardinality-09
FORMULA_NAME CSRepetitions-PT-10-LTLCardinality-10
FORMULA_NAME CSRepetitions-PT-10-LTLCardinality-11
FORMULA_NAME CSRepetitions-PT-10-LTLCardinality-12
FORMULA_NAME CSRepetitions-PT-10-LTLCardinality-13
FORMULA_NAME CSRepetitions-PT-10-LTLCardinality-14
FORMULA_NAME CSRepetitions-PT-10-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1716247304121

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=CSRepetitions-PT-10
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202304061127
[2024-05-20 23:21:45] [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-20 23:21:45] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-20 23:21:45] [INFO ] Load time of PNML (sax parser for PT used): 124 ms
[2024-05-20 23:21:45] [INFO ] Transformed 1311 places.
[2024-05-20 23:21:45] [INFO ] Transformed 2300 transitions.
[2024-05-20 23:21:45] [INFO ] Parsed PT model containing 1311 places and 2300 transitions and 8700 arcs in 356 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 66 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
FORMULA CSRepetitions-PT-10-LTLCardinality-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CSRepetitions-PT-10-LTLCardinality-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 1211 out of 1311 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1311/1311 places, 2300/2300 transitions.
Applied a total of 0 rules in 50 ms. Remains 1311 /1311 variables (removed 0) and now considering 2300/2300 (removed 0) transitions.
// Phase 1: matrix 2300 rows 1311 cols
[2024-05-20 23:21:46] [INFO ] Computed 110 invariants in 55 ms
[2024-05-20 23:21:46] [INFO ] Implicit Places using invariants in 352 ms returned []
[2024-05-20 23:21:46] [INFO ] Invariant cache hit.
[2024-05-20 23:21:47] [INFO ] State equation strengthened by 100 read => feed constraints.
[2024-05-20 23:21:47] [INFO ] Implicit Places using invariants and state equation in 831 ms returned []
Implicit Place search using SMT with State Equation took 1208 ms to find 0 implicit places.
[2024-05-20 23:21:47] [INFO ] Invariant cache hit.
[2024-05-20 23:21:48] [INFO ] Dead Transitions using invariants and state equation in 950 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2213 ms. Remains : 1311/1311 places, 2300/2300 transitions.
Support contains 1211 out of 1311 places after structural reductions.
[2024-05-20 23:21:48] [INFO ] Flatten gal took : 199 ms
[2024-05-20 23:21:49] [INFO ] Flatten gal took : 136 ms
[2024-05-20 23:21:49] [INFO ] Input system was already deterministic with 2300 transitions.
Incomplete random walk after 10000 steps, including 49 resets, run finished after 729 ms. (steps per millisecond=13 ) properties (out of 30) seen :19
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 11) seen :0
Running SMT prover for 11 properties.
[2024-05-20 23:21:50] [INFO ] Invariant cache hit.
[2024-05-20 23:21:50] [INFO ] After 430ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:11
[2024-05-20 23:21:51] [INFO ] [Nat]Absence check using 110 positive place invariants in 24 ms returned sat
[2024-05-20 23:21:52] [INFO ] After 703ms SMT Verify possible using state equation in natural domain returned unsat :9 sat :2
[2024-05-20 23:21:52] [INFO ] State equation strengthened by 100 read => feed constraints.
[2024-05-20 23:21:52] [INFO ] After 226ms SMT Verify possible using 100 Read/Feed constraints in natural domain returned unsat :9 sat :2
[2024-05-20 23:21:52] [INFO ] After 457ms SMT Verify possible using trap constraints in natural domain returned unsat :9 sat :2
Attempting to minimize the solution found.
Minimization took 128 ms.
[2024-05-20 23:21:52] [INFO ] After 1699ms SMT Verify possible using all constraints in natural domain returned unsat :9 sat :2
Fused 11 Parikh solutions to 2 different solutions.
Finished Parikh walk after 107 steps, including 0 resets, run visited all 2 properties in 5 ms. (steps per millisecond=21 )
Parikh walk visited 1 properties in 9 ms.
Support contains 2 out of 1311 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1311/1311 places, 2300/2300 transitions.
Drop transitions removed 100 transitions
Reduce isomorphic transitions removed 100 transitions.
Iterating post reduction 0 with 100 rules applied. Total rules applied 100 place count 1311 transition count 2200
Performed 99 Post agglomeration using F-continuation condition.Transition count delta: 99
Deduced a syphon composed of 99 places in 1 ms
Reduce places removed 198 places and 0 transitions.
Iterating global reduction 1 with 297 rules applied. Total rules applied 397 place count 1113 transition count 2101
Discarding 979 places :
Symmetric choice reduction at 1 with 979 rule applications. Total rules 1376 place count 134 transition count 1122
Iterating global reduction 1 with 979 rules applied. Total rules applied 2355 place count 134 transition count 1122
Discarding 89 places :
Symmetric choice reduction at 1 with 89 rule applications. Total rules 2444 place count 45 transition count 232
Iterating global reduction 1 with 89 rules applied. Total rules applied 2533 place count 45 transition count 232
Ensure Unique test removed 89 transitions
Reduce isomorphic transitions removed 89 transitions.
Iterating post reduction 1 with 89 rules applied. Total rules applied 2622 place count 45 transition count 143
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 2 with 20 rules applied. Total rules applied 2642 place count 35 transition count 133
Free-agglomeration rule applied 10 times.
Iterating global reduction 2 with 10 rules applied. Total rules applied 2652 place count 35 transition count 123
Reduce places removed 10 places and 0 transitions.
Drop transitions removed 99 transitions
Reduce isomorphic transitions removed 99 transitions.
Iterating post reduction 2 with 109 rules applied. Total rules applied 2761 place count 25 transition count 24
Applied a total of 2761 rules in 382 ms. Remains 25 /1311 variables (removed 1286) and now considering 24/2300 (removed 2276) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 383 ms. Remains : 25/1311 places, 24/2300 transitions.
Finished random walk after 28 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=28 )
Parikh walk visited 0 properties in 0 ms.
FORMULA CSRepetitions-PT-10-LTLCardinality-08 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 8 atomic propositions for a total of 13 simplifications.
Initial state reduction rules removed 1 formulas.
FORMULA CSRepetitions-PT-10-LTLCardinality-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 0 stabilizing places and 100 stable transitions
FORMULA CSRepetitions-PT-10-LTLCardinality-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CSRepetitions-PT-10-LTLCardinality-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
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' '!((p0 U X(p1)))'
Support contains 1011 out of 1311 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1311/1311 places, 2300/2300 transitions.
Applied a total of 0 rules in 21 ms. Remains 1311 /1311 variables (removed 0) and now considering 2300/2300 (removed 0) transitions.
[2024-05-20 23:21:53] [INFO ] Invariant cache hit.
[2024-05-20 23:21:53] [INFO ] Implicit Places using invariants in 228 ms returned []
[2024-05-20 23:21:53] [INFO ] Invariant cache hit.
[2024-05-20 23:21:54] [INFO ] State equation strengthened by 100 read => feed constraints.
[2024-05-20 23:21:54] [INFO ] Implicit Places using invariants and state equation in 1102 ms returned []
Implicit Place search using SMT with State Equation took 1333 ms to find 0 implicit places.
[2024-05-20 23:21:54] [INFO ] Invariant cache hit.
[2024-05-20 23:21:55] [INFO ] Dead Transitions using invariants and state equation in 962 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2319 ms. Remains : 1311/1311 places, 2300/2300 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 255 ms :[(NOT p1), true, (NOT p1), (NOT p1)]
Running random walk in product with property : CSRepetitions-PT-10-LTLCardinality-00 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 2}, { cond=(NOT p0), acceptance={} source=0 dest: 3}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(AND p0 (NOT p1)), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 3}], [{ cond=(NOT p1), acceptance={} source=3 dest: 1}]], initial=0, aps=[p0:(LEQ 2 (ADD s1 s2 s4 s5 s7 s9 s10 s11 s12 s13 s14 s15 s17 s18 s19 s20 s21 s22 s23 s24 s25 s26 s27 s28 s29 s30 s31 s32 s33 s34 s36 s37 s39 s40 s42 s43 s...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 3145 ms.
Product exploration explored 100000 steps with 50000 reset in 3024 ms.
Computed a total of 0 stabilizing places and 100 stable transitions
Computed a total of 0 stabilizing places and 100 stable transitions
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND p0 (NOT p1)))), (X p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), true, (X (X p1)), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 8 factoid took 27 ms. Reduced automaton from 4 states, 6 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA CSRepetitions-PT-10-LTLCardinality-00 TRUE TECHNIQUES KNOWLEDGE
Treatment of property CSRepetitions-PT-10-LTLCardinality-00 finished in 9207 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||(F(p1)&&F((!p1 U (p2||G(!p1)))))))))'
Support contains 1011 out of 1311 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1311/1311 places, 2300/2300 transitions.
Applied a total of 0 rules in 23 ms. Remains 1311 /1311 variables (removed 0) and now considering 2300/2300 (removed 0) transitions.
[2024-05-20 23:22:02] [INFO ] Invariant cache hit.
[2024-05-20 23:22:02] [INFO ] Implicit Places using invariants in 244 ms returned []
[2024-05-20 23:22:02] [INFO ] Invariant cache hit.
[2024-05-20 23:22:03] [INFO ] State equation strengthened by 100 read => feed constraints.
[2024-05-20 23:22:03] [INFO ] Implicit Places using invariants and state equation in 1029 ms returned []
Implicit Place search using SMT with State Equation took 1278 ms to find 0 implicit places.
[2024-05-20 23:22:03] [INFO ] Invariant cache hit.
[2024-05-20 23:22:04] [INFO ] Dead Transitions using invariants and state equation in 926 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2228 ms. Remains : 1311/1311 places, 2300/2300 transitions.
Stuttering acceptance computed with spot in 179 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 p1)), (AND (NOT p0) p1 (NOT p2))]
Running random walk in product with property : CSRepetitions-PT-10-LTLCardinality-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p0) (NOT p2)), acceptance={} source=1 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={} source=3 dest: 3}, { cond=(AND (NOT p0) p1 (NOT p2)), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(AND (GT 3 (ADD s1 s2 s4 s5 s7 s9 s10 s11 s12 s13 s14 s15 s17 s18 s19 s20 s21 s22 s23 s24 s25 s26 s27 s28 s29 s30 s31 s32 s33 s34 s36 s37 s39 s40 s42 s...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 3234 ms.
Product exploration explored 100000 steps with 50000 reset in 3268 ms.
Computed a total of 0 stabilizing places and 100 stable transitions
Computed a total of 0 stabilizing places and 100 stable transitions
Knowledge obtained : [(AND p0 p1 (NOT p2)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))))]
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 4 states, 6 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA CSRepetitions-PT-10-LTLCardinality-01 TRUE TECHNIQUES KNOWLEDGE
Treatment of property CSRepetitions-PT-10-LTLCardinality-01 finished in 9469 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)))'
Support contains 1 out of 1311 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1311/1311 places, 2300/2300 transitions.
Applied a total of 0 rules in 68 ms. Remains 1311 /1311 variables (removed 0) and now considering 2300/2300 (removed 0) transitions.
[2024-05-20 23:22:12] [INFO ] Invariant cache hit.
[2024-05-20 23:22:12] [INFO ] Implicit Places using invariants in 619 ms returned []
[2024-05-20 23:22:12] [INFO ] Invariant cache hit.
[2024-05-20 23:22:13] [INFO ] State equation strengthened by 100 read => feed constraints.
[2024-05-20 23:22:15] [INFO ] Implicit Places using invariants and state equation in 2496 ms returned []
Implicit Place search using SMT with State Equation took 3117 ms to find 0 implicit places.
[2024-05-20 23:22:15] [INFO ] Invariant cache hit.
[2024-05-20 23:22:16] [INFO ] Dead Transitions using invariants and state equation in 845 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4036 ms. Remains : 1311/1311 places, 2300/2300 transitions.
Stuttering acceptance computed with spot in 81 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : CSRepetitions-PT-10-LTLCardinality-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(LEQ 1 s342)], 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][false, false]]
Product exploration explored 100000 steps with 50000 reset in 1504 ms.
Product exploration explored 100000 steps with 50000 reset in 1565 ms.
Computed a total of 0 stabilizing places and 100 stable transitions
Computed a total of 0 stabilizing places and 100 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 3 factoid took 21 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA CSRepetitions-PT-10-LTLCardinality-02 TRUE TECHNIQUES KNOWLEDGE
Treatment of property CSRepetitions-PT-10-LTLCardinality-02 finished in 7273 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(G(p0))))'
Support contains 10 out of 1311 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1311/1311 places, 2300/2300 transitions.
Applied a total of 0 rules in 53 ms. Remains 1311 /1311 variables (removed 0) and now considering 2300/2300 (removed 0) transitions.
[2024-05-20 23:22:19] [INFO ] Invariant cache hit.
[2024-05-20 23:22:19] [INFO ] Implicit Places using invariants in 619 ms returned []
[2024-05-20 23:22:19] [INFO ] Invariant cache hit.
[2024-05-20 23:22:20] [INFO ] State equation strengthened by 100 read => feed constraints.
[2024-05-20 23:22:22] [INFO ] Implicit Places using invariants and state equation in 2367 ms returned []
Implicit Place search using SMT with State Equation took 2990 ms to find 0 implicit places.
[2024-05-20 23:22:22] [INFO ] Invariant cache hit.
[2024-05-20 23:22:23] [INFO ] Dead Transitions using invariants and state equation in 917 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3962 ms. Remains : 1311/1311 places, 2300/2300 transitions.
Stuttering acceptance computed with spot in 124 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : CSRepetitions-PT-10-LTLCardinality-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}]], initial=3, aps=[p0:(GT 2 (ADD s96 s180 s323 s542 s692 s975 s997 s1119 s1120 s1285))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA CSRepetitions-PT-10-LTLCardinality-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CSRepetitions-PT-10-LTLCardinality-03 finished in 4114 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)))))'
Support contains 1011 out of 1311 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1311/1311 places, 2300/2300 transitions.
Applied a total of 0 rules in 14 ms. Remains 1311 /1311 variables (removed 0) and now considering 2300/2300 (removed 0) transitions.
[2024-05-20 23:22:23] [INFO ] Invariant cache hit.
[2024-05-20 23:22:23] [INFO ] Implicit Places using invariants in 222 ms returned []
[2024-05-20 23:22:23] [INFO ] Invariant cache hit.
[2024-05-20 23:22:24] [INFO ] State equation strengthened by 100 read => feed constraints.
[2024-05-20 23:22:24] [INFO ] Implicit Places using invariants and state equation in 994 ms returned []
Implicit Place search using SMT with State Equation took 1227 ms to find 0 implicit places.
[2024-05-20 23:22:24] [INFO ] Invariant cache hit.
[2024-05-20 23:22:25] [INFO ] Dead Transitions using invariants and state equation in 903 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2145 ms. Remains : 1311/1311 places, 2300/2300 transitions.
Stuttering acceptance computed with spot in 78 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : CSRepetitions-PT-10-LTLCardinality-04 automaton TGBA Formula[mat=[[{ cond=(AND p1 (NOT p0)), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}]], initial=1, aps=[p1:(AND (GT s342 (ADD s96 s180 s323 s542 s692 s975 s997 s1119 s1120 s1285)) (GT (ADD s1 s2 s4 s5 s7 s9 s10 s11 s12 s13 s14 s15 s17 s18 s19 s20 s21 s22 s23...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 50000 reset in 1539 ms.
Product exploration explored 100000 steps with 50000 reset in 1578 ms.
Computed a total of 0 stabilizing places and 100 stable transitions
Computed a total of 0 stabilizing places and 100 stable transitions
Knowledge obtained : [(AND (NOT p1) p0), (X (NOT (AND p1 (NOT p0)))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (AND (NOT p1) (NOT p0)))))]
False Knowledge obtained : []
Property proved to be true thanks to conjunction of knowledge (Minato strategy)
Knowledge based reduction with 5 factoid took 73 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA CSRepetitions-PT-10-LTLCardinality-04 TRUE TECHNIQUES KNOWLEDGE
Treatment of property CSRepetitions-PT-10-LTLCardinality-04 finished in 5472 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(((p0&&G(p1))||(p2&&X(p3)))))'
Support contains 201 out of 1311 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1311/1311 places, 2300/2300 transitions.
Applied a total of 0 rules in 47 ms. Remains 1311 /1311 variables (removed 0) and now considering 2300/2300 (removed 0) transitions.
[2024-05-20 23:22:28] [INFO ] Invariant cache hit.
[2024-05-20 23:22:29] [INFO ] Implicit Places using invariants in 527 ms returned []
[2024-05-20 23:22:29] [INFO ] Invariant cache hit.
[2024-05-20 23:22:30] [INFO ] State equation strengthened by 100 read => feed constraints.
[2024-05-20 23:22:31] [INFO ] Implicit Places using invariants and state equation in 2187 ms returned []
Implicit Place search using SMT with State Equation took 2719 ms to find 0 implicit places.
[2024-05-20 23:22:31] [INFO ] Invariant cache hit.
[2024-05-20 23:22:32] [INFO ] Dead Transitions using invariants and state equation in 884 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3656 ms. Remains : 1311/1311 places, 2300/2300 transitions.
Stuttering acceptance computed with spot in 263 ms :[true, (NOT p3), (OR (AND (NOT p1) (NOT p3)) (AND (NOT p0) (NOT p3)) (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p1) (NOT p3)) (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p3)) (AND (NOT p0) (NOT p2))), (NOT p1), (AND (NOT p1) (NOT p3))]
Running random walk in product with property : CSRepetitions-PT-10-LTLCardinality-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p3), acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=(OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), acceptance={} source=3 dest: 0}, { cond=(OR (AND (NOT p0) p2) (AND (NOT p1) p2)), acceptance={} source=3 dest: 1}, { cond=(AND p0 p1 (NOT p2)), acceptance={} source=3 dest: 4}, { cond=(AND p0 p1 p2), acceptance={} source=3 dest: 5}], [{ cond=(NOT p1), acceptance={} source=4 dest: 0}, { cond=p1, acceptance={} source=4 dest: 4}], [{ cond=(AND (NOT p1) (NOT p3)), acceptance={} source=5 dest: 0}, { cond=(AND p1 (NOT p3)), acceptance={} source=5 dest: 4}]], initial=2, aps=[p3:(LEQ 3 (ADD s44 s70 s73 s88 s115 s124 s130 s147 s159 s161 s174 s185 s189 s226 s232 s249 s255 s264 s268 s274 s279 s281 s343 s348 s390 s397 s407 s408 s43...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 33333 reset in 2126 ms.
Product exploration explored 100000 steps with 33333 reset in 2105 ms.
Computed a total of 0 stabilizing places and 100 stable transitions
Computed a total of 0 stabilizing places and 100 stable transitions
Knowledge obtained : [(AND p3 (NOT p0) p2 p1), (X (OR (AND (NOT p0) p2) (AND (NOT p1) p2))), (X (NOT (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))))), (X (NOT (AND p0 p1 p2))), (X (NOT (AND p0 p1 (NOT p2)))), true, (X (X p3)), (X (X (NOT (AND p1 (NOT p3))))), (X (X p1)), (X (X (NOT (AND (NOT p1) (NOT p3)))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 10 factoid took 27 ms. Reduced automaton from 6 states, 11 edges and 4 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA CSRepetitions-PT-10-LTLCardinality-06 TRUE TECHNIQUES KNOWLEDGE
Treatment of property CSRepetitions-PT-10-LTLCardinality-06 finished in 8315 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 U (p1||G(p0))))))'
Support contains 1110 out of 1311 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1311/1311 places, 2300/2300 transitions.
Applied a total of 0 rules in 87 ms. Remains 1311 /1311 variables (removed 0) and now considering 2300/2300 (removed 0) transitions.
[2024-05-20 23:22:37] [INFO ] Invariant cache hit.
[2024-05-20 23:22:37] [INFO ] Implicit Places using invariants in 243 ms returned []
[2024-05-20 23:22:37] [INFO ] Invariant cache hit.
[2024-05-20 23:22:38] [INFO ] State equation strengthened by 100 read => feed constraints.
[2024-05-20 23:22:38] [INFO ] Implicit Places using invariants and state equation in 993 ms returned []
Implicit Place search using SMT with State Equation took 1240 ms to find 0 implicit places.
[2024-05-20 23:22:38] [INFO ] Redundant transitions in 163 ms returned []
[2024-05-20 23:22:38] [INFO ] Invariant cache hit.
[2024-05-20 23:22:39] [INFO ] Dead Transitions using invariants and state equation in 895 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2398 ms. Remains : 1311/1311 places, 2300/2300 transitions.
Stuttering acceptance computed with spot in 74 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : CSRepetitions-PT-10-LTLCardinality-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p1) p0), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(AND (GT (ADD s44 s70 s73 s88 s115 s124 s130 s147 s159 s161 s174 s185 s189 s226 s232 s249 s255 s264 s268 s274 s279 s281 s343 s348 s390 s397 s407 s408 s...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 408 steps with 1 reset in 21 ms.
FORMULA CSRepetitions-PT-10-LTLCardinality-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CSRepetitions-PT-10-LTLCardinality-07 finished in 2527 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((X(X(p0))&&(p1||F(p2)))))'
Support contains 6 out of 1311 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1311/1311 places, 2300/2300 transitions.
Applied a total of 0 rules in 61 ms. Remains 1311 /1311 variables (removed 0) and now considering 2300/2300 (removed 0) transitions.
[2024-05-20 23:22:39] [INFO ] Invariant cache hit.
[2024-05-20 23:22:40] [INFO ] Implicit Places using invariants in 614 ms returned []
[2024-05-20 23:22:40] [INFO ] Invariant cache hit.
[2024-05-20 23:22:41] [INFO ] State equation strengthened by 100 read => feed constraints.
[2024-05-20 23:22:42] [INFO ] Implicit Places using invariants and state equation in 2528 ms returned []
Implicit Place search using SMT with State Equation took 3149 ms to find 0 implicit places.
[2024-05-20 23:22:42] [INFO ] Invariant cache hit.
[2024-05-20 23:22:43] [INFO ] Dead Transitions using invariants and state equation in 837 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4048 ms. Remains : 1311/1311 places, 2300/2300 transitions.
Stuttering acceptance computed with spot in 167 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (NOT p2), (NOT p0), true]
Running random walk in product with property : CSRepetitions-PT-10-LTLCardinality-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=true, acceptance={} source=0 dest: 1}, { cond=(AND (NOT p1) (NOT p2)), acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=(NOT p2), acceptance={0} source=2 dest: 2}], [{ cond=(NOT p0), acceptance={} source=3 dest: 4}], [{ cond=true, acceptance={0} source=4 dest: 4}]], initial=0, aps=[p1:(LEQ s511 s226), p2:(LEQ s495 s734), p0:(AND (LEQ s342 s112) (LEQ s511 s226))], 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 4 steps with 0 reset in 0 ms.
FORMULA CSRepetitions-PT-10-LTLCardinality-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CSRepetitions-PT-10-LTLCardinality-13 finished in 4245 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(G(!p0))))'
Support contains 1 out of 1311 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1311/1311 places, 2300/2300 transitions.
Applied a total of 0 rules in 70 ms. Remains 1311 /1311 variables (removed 0) and now considering 2300/2300 (removed 0) transitions.
[2024-05-20 23:22:44] [INFO ] Invariant cache hit.
[2024-05-20 23:22:44] [INFO ] Implicit Places using invariants in 578 ms returned []
[2024-05-20 23:22:44] [INFO ] Invariant cache hit.
[2024-05-20 23:22:45] [INFO ] State equation strengthened by 100 read => feed constraints.
[2024-05-20 23:22:47] [INFO ] Implicit Places using invariants and state equation in 2472 ms returned []
Implicit Place search using SMT with State Equation took 3052 ms to find 0 implicit places.
[2024-05-20 23:22:47] [INFO ] Invariant cache hit.
[2024-05-20 23:22:47] [INFO ] Dead Transitions using invariants and state equation in 856 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3978 ms. Remains : 1311/1311 places, 2300/2300 transitions.
Stuttering acceptance computed with spot in 125 ms :[true, p0, p0, p0]
Running random walk in product with property : CSRepetitions-PT-10-LTLCardinality-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=p0, acceptance={} source=1 dest: 0}, { cond=(NOT p0), acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}]], initial=3, aps=[p0:(LEQ 2 s342)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 1 ms.
FORMULA CSRepetitions-PT-10-LTLCardinality-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CSRepetitions-PT-10-LTLCardinality-14 finished in 4126 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 1311 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1311/1311 places, 2300/2300 transitions.
Performed 99 Post agglomeration using F-continuation condition.Transition count delta: 99
Deduced a syphon composed of 99 places in 1 ms
Reduce places removed 198 places and 0 transitions.
Iterating global reduction 0 with 297 rules applied. Total rules applied 297 place count 1113 transition count 2201
Discarding 980 places :
Symmetric choice reduction at 0 with 980 rule applications. Total rules 1277 place count 133 transition count 1221
Iterating global reduction 0 with 980 rules applied. Total rules applied 2257 place count 133 transition count 1221
Discarding 90 places :
Symmetric choice reduction at 0 with 90 rule applications. Total rules 2347 place count 43 transition count 231
Iterating global reduction 0 with 90 rules applied. Total rules applied 2437 place count 43 transition count 231
Ensure Unique test removed 90 transitions
Reduce isomorphic transitions removed 90 transitions.
Iterating post reduction 0 with 90 rules applied. Total rules applied 2527 place count 43 transition count 141
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 1 with 20 rules applied. Total rules applied 2547 place count 33 transition count 131
Applied a total of 2547 rules in 116 ms. Remains 33 /1311 variables (removed 1278) and now considering 131/2300 (removed 2169) transitions.
[2024-05-20 23:22:48] [INFO ] Flow matrix only has 50 transitions (discarded 81 similar events)
// Phase 1: matrix 50 rows 33 cols
[2024-05-20 23:22:48] [INFO ] Computed 11 invariants in 1 ms
[2024-05-20 23:22:48] [INFO ] Implicit Places using invariants in 46 ms returned []
[2024-05-20 23:22:48] [INFO ] Flow matrix only has 50 transitions (discarded 81 similar events)
[2024-05-20 23:22:48] [INFO ] Invariant cache hit.
[2024-05-20 23:22:48] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-20 23:22:48] [INFO ] Implicit Places using invariants and state equation in 34 ms returned []
Implicit Place search using SMT with State Equation took 83 ms to find 0 implicit places.
[2024-05-20 23:22:48] [INFO ] Redundant transitions in 1 ms returned []
[2024-05-20 23:22:48] [INFO ] Flow matrix only has 50 transitions (discarded 81 similar events)
[2024-05-20 23:22:48] [INFO ] Invariant cache hit.
[2024-05-20 23:22:48] [INFO ] Dead Transitions using invariants and state equation in 51 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 33/1311 places, 131/2300 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 263 ms. Remains : 33/1311 places, 131/2300 transitions.
Stuttering acceptance computed with spot in 28 ms :[(NOT p0)]
Running random walk in product with property : CSRepetitions-PT-10-LTLCardinality-15 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(LEQ s8 s26)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 2169 reset in 228 ms.
Stack based approach found an accepted trace after 3 steps with 0 reset with depth 4 and stack size 4 in 0 ms.
FORMULA CSRepetitions-PT-10-LTLCardinality-15 FALSE TECHNIQUES STACK_TEST
Treatment of property CSRepetitions-PT-10-LTLCardinality-15 finished in 534 ms.
All properties solved by simple procedures.
Total runtime 63041 ms.

BK_STOP 1716247369579

--------------------
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="CSRepetitions-PT-10"
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 CSRepetitions-PT-10, 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-171620521600167"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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