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.r285-smll-171654422000132.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 Peterson-COL-3, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r285-smll-171654422000132
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 512K
-rw-r--r-- 1 mcc users 6.3K Apr 12 02:21 CTLCardinality.txt
-rw-r--r-- 1 mcc users 60K Apr 12 02:21 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.5K Apr 12 02:15 CTLFireability.txt
-rw-r--r-- 1 mcc users 47K Apr 12 02:15 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 4.3K Apr 23 07:42 LTLCardinality.txt
-rw-r--r-- 1 mcc users 29K Apr 23 07:42 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Apr 23 07:42 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 23 07:42 LTLFireability.xml
-rw-r--r-- 1 mcc users 15K Apr 12 02:33 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 144K Apr 12 02:33 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.9K Apr 12 02:28 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 69K Apr 12 02:28 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 23 07:42 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 23 07:42 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:43 equiv_pt
-rw-r--r-- 1 mcc users 2 May 18 16:43 instance
-rw-r--r-- 1 mcc users 5 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 43K 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 Peterson-COL-3-LTLCardinality-00
FORMULA_NAME Peterson-COL-3-LTLCardinality-01
FORMULA_NAME Peterson-COL-3-LTLCardinality-02
FORMULA_NAME Peterson-COL-3-LTLCardinality-03
FORMULA_NAME Peterson-COL-3-LTLCardinality-04
FORMULA_NAME Peterson-COL-3-LTLCardinality-05
FORMULA_NAME Peterson-COL-3-LTLCardinality-06
FORMULA_NAME Peterson-COL-3-LTLCardinality-07
FORMULA_NAME Peterson-COL-3-LTLCardinality-08
FORMULA_NAME Peterson-COL-3-LTLCardinality-09
FORMULA_NAME Peterson-COL-3-LTLCardinality-10
FORMULA_NAME Peterson-COL-3-LTLCardinality-11
FORMULA_NAME Peterson-COL-3-LTLCardinality-12
FORMULA_NAME Peterson-COL-3-LTLCardinality-13
FORMULA_NAME Peterson-COL-3-LTLCardinality-14
FORMULA_NAME Peterson-COL-3-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1716879380228

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=Peterson-COL-3
Not applying reductions.
Model is COL
LTLCardinality COL
Running Version 202304061127
[2024-05-28 06:56:22] [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 06:56:22] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-28 06:56:22] [INFO ] Detected file is not PT type :http://www.pnml.org/version-2009/grammar/symmetricnet
log4j:WARN No appenders could be found for logger (org.apache.axiom.locator.DefaultOMMetaFactoryLocator).
log4j:WARN Please initialize the log4j system properly.
log4j:WARN See http://logging.apache.org/log4j/1.2/faq.html#noconfig for more info.
[2024-05-28 06:56:23] [WARNING] Using fallBack plugin, rng conformance not checked
[2024-05-28 06:56:23] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 720 ms
[2024-05-28 06:56:23] [INFO ] Imported 11 HL places and 14 HL transitions for a total of 256 PT places and 396.0 transition bindings in 32 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 125 ms.
Working with output stream class java.io.PrintStream
[2024-05-28 06:56:24] [INFO ] Built PT skeleton of HLPN with 11 places and 14 transitions 42 arcs in 7 ms.
[2024-05-28 06:56:24] [INFO ] Skeletonized 16 HLPN properties in 2 ms.
Initial state reduction rules removed 4 formulas.
FORMULA Peterson-COL-3-LTLCardinality-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Peterson-COL-3-LTLCardinality-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Peterson-COL-3-LTLCardinality-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Peterson-COL-3-LTLCardinality-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 2 stabilizing places and 0 stable transitions
Remains 12 properties that can be checked using skeleton over-approximation.
Reduce places removed 2 places and 0 transitions.
FORMULA Peterson-COL-3-LTLCardinality-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 0 stabilizing places and 0 stable transitions
Finished random walk after 55 steps, including 0 resets, run visited all 20 properties in 19 ms. (steps per millisecond=2 )
Parikh walk visited 0 properties in 0 ms.
[2024-05-28 06:56:24] [INFO ] Flatten gal took : 24 ms
[2024-05-28 06:56:24] [INFO ] Initial state reduction rules for LTL removed 1 formulas.
FORMULA Peterson-COL-3-LTLCardinality-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-28 06:56:24] [INFO ] Flatten gal took : 4 ms
Domain [Process(4), Tour(3), Process(4)] of place BeginLoop breaks symmetries in sort Process
Arc [2:1*[$i, (MOD (ADD $j 1) 3)]] contains successor/predecessor on variables of sort Tour
Symmetric sort wr.t. initial and guards and successors and join/free detected :Bool
Arc [1:1*[$i, 0]] contains constants of sort Bool
Transition Ask : constants on arcs in [[1:1*[$i, 0]]] introduces in Bool(2) partition with 1 elements that refines current partition to 2 subsets.
[2024-05-28 06:56:24] [INFO ] Unfolded HLPN to a Petri net with 256 places and 356 transitions 1112 arcs in 35 ms.
[2024-05-28 06:56:24] [INFO ] Unfolded 10 HLPN properties in 0 ms.
Deduced a syphon composed of 12 places in 3 ms
Reduce places removed 12 places and 24 transitions.
Support contains 224 out of 244 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 244/244 places, 332/332 transitions.
Applied a total of 0 rules in 16 ms. Remains 244 /244 variables (removed 0) and now considering 332/332 (removed 0) transitions.
[2024-05-28 06:56:24] [INFO ] Flow matrix only has 308 transitions (discarded 24 similar events)
// Phase 1: matrix 308 rows 244 cols
[2024-05-28 06:56:24] [INFO ] Computed 15 invariants in 22 ms
[2024-05-28 06:56:24] [INFO ] Implicit Places using invariants in 371 ms returned []
[2024-05-28 06:56:24] [INFO ] Flow matrix only has 308 transitions (discarded 24 similar events)
[2024-05-28 06:56:24] [INFO ] Invariant cache hit.
[2024-05-28 06:56:24] [INFO ] State equation strengthened by 57 read => feed constraints.
[2024-05-28 06:56:25] [INFO ] Implicit Places using invariants and state equation in 357 ms returned []
Implicit Place search using SMT with State Equation took 730 ms to find 0 implicit places.
[2024-05-28 06:56:25] [INFO ] Flow matrix only has 308 transitions (discarded 24 similar events)
[2024-05-28 06:56:25] [INFO ] Invariant cache hit.
[2024-05-28 06:56:25] [INFO ] Dead Transitions using invariants and state equation in 287 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1036 ms. Remains : 244/244 places, 332/332 transitions.
Support contains 224 out of 244 places after structural reductions.
[2024-05-28 06:56:25] [INFO ] Flatten gal took : 43 ms
[2024-05-28 06:56:25] [INFO ] Flatten gal took : 31 ms
[2024-05-28 06:56:25] [INFO ] Input system was already deterministic with 332 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 351 ms. (steps per millisecond=28 ) properties (out of 19) seen :17
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 76 ms. (steps per millisecond=131 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2024-05-28 06:56:26] [INFO ] Flow matrix only has 308 transitions (discarded 24 similar events)
[2024-05-28 06:56:26] [INFO ] Invariant cache hit.
[2024-05-28 06:56:26] [INFO ] [Real]Absence check using 11 positive place invariants in 9 ms returned sat
[2024-05-28 06:56:26] [INFO ] [Real]Absence check using 11 positive and 4 generalized place invariants in 6 ms returned sat
[2024-05-28 06:56:26] [INFO ] After 335ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-28 06:56:26] [INFO ] [Nat]Absence check using 11 positive place invariants in 9 ms returned sat
[2024-05-28 06:56:26] [INFO ] [Nat]Absence check using 11 positive and 4 generalized place invariants in 4 ms returned sat
[2024-05-28 06:56:26] [INFO ] After 181ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-05-28 06:56:26] [INFO ] State equation strengthened by 57 read => feed constraints.
[2024-05-28 06:56:26] [INFO ] After 81ms SMT Verify possible using 57 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2024-05-28 06:56:26] [INFO ] Deduced a trap composed of 13 places in 125 ms of which 7 ms to minimize.
[2024-05-28 06:56:27] [INFO ] Deduced a trap composed of 16 places in 133 ms of which 2 ms to minimize.
[2024-05-28 06:56:27] [INFO ] Deduced a trap composed of 13 places in 126 ms of which 1 ms to minimize.
[2024-05-28 06:56:27] [INFO ] Deduced a trap composed of 16 places in 115 ms of which 2 ms to minimize.
[2024-05-28 06:56:27] [INFO ] Deduced a trap composed of 14 places in 123 ms of which 1 ms to minimize.
[2024-05-28 06:56:27] [INFO ] Deduced a trap composed of 38 places in 86 ms of which 1 ms to minimize.
[2024-05-28 06:56:27] [INFO ] Deduced a trap composed of 34 places in 82 ms of which 1 ms to minimize.
[2024-05-28 06:56:27] [INFO ] Deduced a trap composed of 56 places in 84 ms of which 1 ms to minimize.
[2024-05-28 06:56:27] [INFO ] Deduced a trap composed of 35 places in 82 ms of which 1 ms to minimize.
[2024-05-28 06:56:28] [INFO ] Deduced a trap composed of 35 places in 92 ms of which 0 ms to minimize.
[2024-05-28 06:56:28] [INFO ] Deduced a trap composed of 9 places in 83 ms of which 1 ms to minimize.
[2024-05-28 06:56:28] [INFO ] Deduced a trap composed of 53 places in 68 ms of which 1 ms to minimize.
[2024-05-28 06:56:28] [INFO ] Deduced a trap composed of 57 places in 85 ms of which 2 ms to minimize.
[2024-05-28 06:56:28] [INFO ] Deduced a trap composed of 34 places in 88 ms of which 2 ms to minimize.
[2024-05-28 06:56:28] [INFO ] Deduced a trap composed of 20 places in 81 ms of which 1 ms to minimize.
[2024-05-28 06:56:28] [INFO ] Deduced a trap composed of 17 places in 86 ms of which 1 ms to minimize.
[2024-05-28 06:56:28] [INFO ] Deduced a trap composed of 57 places in 65 ms of which 1 ms to minimize.
[2024-05-28 06:56:28] [INFO ] Deduced a trap composed of 49 places in 79 ms of which 0 ms to minimize.
[2024-05-28 06:56:28] [INFO ] Deduced a trap composed of 38 places in 52 ms of which 0 ms to minimize.
[2024-05-28 06:56:29] [INFO ] Deduced a trap composed of 30 places in 57 ms of which 1 ms to minimize.
[2024-05-28 06:56:29] [INFO ] Deduced a trap composed of 27 places in 53 ms of which 1 ms to minimize.
[2024-05-28 06:56:29] [INFO ] Deduced a trap composed of 56 places in 108 ms of which 2 ms to minimize.
[2024-05-28 06:56:29] [INFO ] Deduced a trap composed of 56 places in 82 ms of which 1 ms to minimize.
[2024-05-28 06:56:29] [INFO ] Deduced a trap composed of 31 places in 80 ms of which 0 ms to minimize.
[2024-05-28 06:56:29] [INFO ] Deduced a trap composed of 53 places in 64 ms of which 1 ms to minimize.
[2024-05-28 06:56:29] [INFO ] Deduced a trap composed of 53 places in 66 ms of which 0 ms to minimize.
[2024-05-28 06:56:29] [INFO ] Deduced a trap composed of 49 places in 63 ms of which 1 ms to minimize.
[2024-05-28 06:56:29] [INFO ] Deduced a trap composed of 22 places in 85 ms of which 1 ms to minimize.
[2024-05-28 06:56:29] [INFO ] Deduced a trap composed of 45 places in 61 ms of which 0 ms to minimize.
[2024-05-28 06:56:29] [INFO ] Deduced a trap composed of 45 places in 66 ms of which 0 ms to minimize.
[2024-05-28 06:56:30] [INFO ] Deduced a trap composed of 49 places in 67 ms of which 1 ms to minimize.
[2024-05-28 06:56:30] [INFO ] Deduced a trap composed of 45 places in 81 ms of which 1 ms to minimize.
[2024-05-28 06:56:30] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 32 trap constraints in 3406 ms
[2024-05-28 06:56:30] [INFO ] After 3550ms SMT Verify possible using trap constraints in natural domain returned unsat :2 sat :0
[2024-05-28 06:56:30] [INFO ] After 3859ms SMT Verify possible using all constraints in natural domain returned unsat :2 sat :0
Fused 2 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Successfully simplified 2 atomic propositions for a total of 10 simplifications.
Computed a total of 0 stabilizing places and 0 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(((p0 U p1)||G(p2))))'
Support contains 88 out of 244 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 244/244 places, 332/332 transitions.
Applied a total of 0 rules in 12 ms. Remains 244 /244 variables (removed 0) and now considering 332/332 (removed 0) transitions.
[2024-05-28 06:56:30] [INFO ] Flow matrix only has 308 transitions (discarded 24 similar events)
[2024-05-28 06:56:30] [INFO ] Invariant cache hit.
[2024-05-28 06:56:30] [INFO ] Implicit Places using invariants in 160 ms returned []
[2024-05-28 06:56:30] [INFO ] Flow matrix only has 308 transitions (discarded 24 similar events)
[2024-05-28 06:56:30] [INFO ] Invariant cache hit.
[2024-05-28 06:56:30] [INFO ] State equation strengthened by 57 read => feed constraints.
[2024-05-28 06:56:31] [INFO ] Implicit Places using invariants and state equation in 380 ms returned []
Implicit Place search using SMT with State Equation took 544 ms to find 0 implicit places.
[2024-05-28 06:56:31] [INFO ] Flow matrix only has 308 transitions (discarded 24 similar events)
[2024-05-28 06:56:31] [INFO ] Invariant cache hit.
[2024-05-28 06:56:31] [INFO ] Dead Transitions using invariants and state equation in 269 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 827 ms. Remains : 244/244 places, 332/332 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 354 ms :[true, (NOT p1), (AND (NOT p1) (NOT p2)), (NOT p2), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : Peterson-COL-3-LTLCardinality-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 4}], [{ cond=(NOT p2), acceptance={} source=3 dest: 0}, { cond=p2, acceptance={} source=3 dest: 3}], [{ cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={} source=4 dest: 0}, { cond=(AND (NOT p1) p0 (NOT p2)), acceptance={} source=4 dest: 1}, { cond=(AND (NOT p1) (NOT p0) p2), acceptance={} source=4 dest: 3}, { cond=(AND (NOT p1) p0 p2), acceptance={} source=4 dest: 4}]], initial=2, aps=[p1:(AND (LEQ (ADD s36 s37 s38 s39 s40 s41 s42 s43 s44 s45 s46 s47) (ADD s12 s13 s14 s15 s16 s17 s18 s19 s20 s21 s22 s23)) (LEQ (ADD s0 s1 s2 s3) (ADD s12 ...], 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][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 2 ms.
FORMULA Peterson-COL-3-LTLCardinality-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Peterson-COL-3-LTLCardinality-02 finished in 1265 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)))&&G((p1||X(p1)))))'
Support contains 64 out of 244 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 244/244 places, 332/332 transitions.
Applied a total of 0 rules in 13 ms. Remains 244 /244 variables (removed 0) and now considering 332/332 (removed 0) transitions.
[2024-05-28 06:56:31] [INFO ] Flow matrix only has 308 transitions (discarded 24 similar events)
[2024-05-28 06:56:31] [INFO ] Invariant cache hit.
[2024-05-28 06:56:31] [INFO ] Implicit Places using invariants in 184 ms returned [0, 1, 2, 3]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 187 ms to find 4 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 240/244 places, 332/332 transitions.
Applied a total of 0 rules in 11 ms. Remains 240 /240 variables (removed 0) and now considering 332/332 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 211 ms. Remains : 240/244 places, 332/332 transitions.
Stuttering acceptance computed with spot in 226 ms :[true, (OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : Peterson-COL-3-LTLCardinality-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p1), acceptance={} source=1 dest: 0}, { cond=p1, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=(AND p1 p0), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p1) p0), acceptance={} source=2 dest: 3}], [{ cond=(OR (NOT p1) (NOT p0)), acceptance={} source=3 dest: 0}, { cond=(AND p1 p0), acceptance={} source=3 dest: 2}], [{ cond=(NOT p1), acceptance={} source=4 dest: 1}, { cond=p1, acceptance={} source=4 dest: 5}], [{ cond=p1, acceptance={} source=5 dest: 2}, { cond=(NOT p1), acceptance={} source=5 dest: 3}]], initial=4, aps=[p1:(LEQ (ADD s44 s45 s46 s47 s48 s49 s50 s51 s52 s53 s54 s55 s56 s57 s58 s59 s60 s61 s62 s63 s64 s65 s66 s67 s68 s69 s70 s71 s72 s73 s74 s75 s76 s77 s78 s...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 25 steps with 0 reset in 2 ms.
FORMULA Peterson-COL-3-LTLCardinality-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Peterson-COL-3-LTLCardinality-03 finished in 462 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 12 out of 244 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 244/244 places, 332/332 transitions.
Drop transitions removed 96 transitions
Trivial Post-agglo rules discarded 96 transitions
Performed 96 trivial Post agglomeration. Transition count delta: 96
Iterating post reduction 0 with 96 rules applied. Total rules applied 96 place count 244 transition count 236
Reduce places removed 96 places and 0 transitions.
Iterating post reduction 1 with 96 rules applied. Total rules applied 192 place count 148 transition count 236
Performed 48 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 48 Pre rules applied. Total rules applied 192 place count 148 transition count 188
Deduced a syphon composed of 48 places in 0 ms
Reduce places removed 48 places and 0 transitions.
Iterating global reduction 2 with 96 rules applied. Total rules applied 288 place count 100 transition count 188
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: 12
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 2 with 24 rules applied. Total rules applied 312 place count 88 transition count 176
Applied a total of 312 rules in 56 ms. Remains 88 /244 variables (removed 156) and now considering 176/332 (removed 156) transitions.
[2024-05-28 06:56:32] [INFO ] Flow matrix only has 152 transitions (discarded 24 similar events)
// Phase 1: matrix 152 rows 88 cols
[2024-05-28 06:56:32] [INFO ] Computed 15 invariants in 2 ms
[2024-05-28 06:56:32] [INFO ] Implicit Places using invariants in 136 ms returned [0, 1, 2, 3]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 138 ms to find 4 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 84/244 places, 176/332 transitions.
Applied a total of 0 rules in 17 ms. Remains 84 /84 variables (removed 0) and now considering 176/176 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 214 ms. Remains : 84/244 places, 176/332 transitions.
Stuttering acceptance computed with spot in 68 ms :[(NOT p0)]
Running random walk in product with property : Peterson-COL-3-LTLCardinality-07 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 2 (ADD s24 s25 s26 s27 s28 s29 s30 s31 s32 s33 s34 s35))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 0 reset in 433 ms.
Stack based approach found an accepted trace after 17 steps with 0 reset with depth 18 and stack size 16 in 1 ms.
FORMULA Peterson-COL-3-LTLCardinality-07 FALSE TECHNIQUES STACK_TEST
Treatment of property Peterson-COL-3-LTLCardinality-07 finished in 732 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(F(p0))||G(p1))))'
Support contains 84 out of 244 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 244/244 places, 332/332 transitions.
Performed 36 Post agglomeration using F-continuation condition.Transition count delta: 36
Iterating post reduction 0 with 36 rules applied. Total rules applied 36 place count 244 transition count 296
Reduce places removed 36 places and 0 transitions.
Iterating post reduction 1 with 36 rules applied. Total rules applied 72 place count 208 transition count 296
Performed 24 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 24 Pre rules applied. Total rules applied 72 place count 208 transition count 272
Deduced a syphon composed of 24 places in 0 ms
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 2 with 48 rules applied. Total rules applied 120 place count 184 transition count 272
Applied a total of 120 rules in 22 ms. Remains 184 /244 variables (removed 60) and now considering 272/332 (removed 60) transitions.
[2024-05-28 06:56:33] [INFO ] Flow matrix only has 248 transitions (discarded 24 similar events)
// Phase 1: matrix 248 rows 184 cols
[2024-05-28 06:56:33] [INFO ] Computed 15 invariants in 3 ms
[2024-05-28 06:56:33] [INFO ] Implicit Places using invariants in 120 ms returned [0, 1, 2, 3]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 122 ms to find 4 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 180/244 places, 272/332 transitions.
Applied a total of 0 rules in 9 ms. Remains 180 /180 variables (removed 0) and now considering 272/272 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 154 ms. Remains : 180/244 places, 272/332 transitions.
Stuttering acceptance computed with spot in 86 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : Peterson-COL-3-LTLCardinality-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}], [{ cond=(AND p1 (NOT p0)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(GT 3 (ADD s96 s97 s98 s99 s100 s101 s102 s103 s104 s105 s106 s107 s108 s109 s110 s111 s112 s113 s114 s115 s116 s117 s118 s119 s120 s121 s122 s123 s124...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 119 reset in 276 ms.
Stack based approach found an accepted trace after 69506 steps with 86 reset with depth 255 and stack size 241 in 199 ms.
FORMULA Peterson-COL-3-LTLCardinality-09 FALSE TECHNIQUES STACK_TEST
Treatment of property Peterson-COL-3-LTLCardinality-09 finished in 735 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((F(p0)&&X(p1))))'
Support contains 88 out of 244 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 244/244 places, 332/332 transitions.
Applied a total of 0 rules in 4 ms. Remains 244 /244 variables (removed 0) and now considering 332/332 (removed 0) transitions.
[2024-05-28 06:56:33] [INFO ] Flow matrix only has 308 transitions (discarded 24 similar events)
// Phase 1: matrix 308 rows 244 cols
[2024-05-28 06:56:33] [INFO ] Computed 15 invariants in 3 ms
[2024-05-28 06:56:33] [INFO ] Implicit Places using invariants in 167 ms returned [0, 1, 2, 3]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 172 ms to find 4 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 240/244 places, 332/332 transitions.
Applied a total of 0 rules in 3 ms. Remains 240 /240 variables (removed 0) and now considering 332/332 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 180 ms. Remains : 240/244 places, 332/332 transitions.
Stuttering acceptance computed with spot in 147 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : Peterson-COL-3-LTLCardinality-10 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={} source=1 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 1}, { cond=(NOT p1), acceptance={} source=2 dest: 2}]], initial=0, aps=[p0:(LEQ 1 (ADD s44 s45 s46 s47 s48 s49 s50 s51 s52 s53 s54 s55 s56 s57 s58 s59 s60 s61 s62 s63 s64 s65 s66 s67 s68 s69 s70 s71 s72 s73 s74 s75 s76 s77 s78...], nbAcceptance=0, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 12100 reset in 501 ms.
Product exploration explored 100000 steps with 12163 reset in 327 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT p1)), (X (NOT p0)), (X (AND (NOT p0) (NOT p1))), (X (X (NOT p1))), (X (X (NOT p0))), (X (X (AND (NOT p0) (NOT p1))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 7 factoid took 107 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter sensitive) to 6 states, 15 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 247 ms :[(OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1), false, false, false]
Finished random walk after 37 steps, including 0 resets, run visited all 6 properties in 3 ms. (steps per millisecond=12 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT p1)), (X (NOT p0)), (X (AND (NOT p0) (NOT p1))), (X (X (NOT p1))), (X (X (NOT p0))), (X (X (AND (NOT p0) (NOT p1))))]
False Knowledge obtained : [(F (NOT (AND (NOT p1) (NOT p0)))), (F p0), (F p1), (F (AND (NOT p1) p0)), (F (AND p1 (NOT p0))), (F (AND p1 p0))]
Knowledge based reduction with 7 factoid took 363 ms. Reduced automaton from 6 states, 15 edges and 2 AP (stutter insensitive) to 6 states, 15 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 243 ms :[(OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1), false, false, false]
Stuttering acceptance computed with spot in 276 ms :[(OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1), false, false, false]
[2024-05-28 06:56:36] [INFO ] Flow matrix only has 308 transitions (discarded 24 similar events)
// Phase 1: matrix 308 rows 240 cols
[2024-05-28 06:56:36] [INFO ] Computed 11 invariants in 2 ms
[2024-05-28 06:56:36] [INFO ] [Real]Absence check using 11 positive place invariants in 8 ms returned sat
[2024-05-28 06:56:36] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-28 06:56:36] [INFO ] [Real]Absence check using state equation in 202 ms returned sat
[2024-05-28 06:56:36] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 06:56:36] [INFO ] [Nat]Absence check using 11 positive place invariants in 6 ms returned sat
[2024-05-28 06:56:36] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-28 06:56:37] [INFO ] [Nat]Absence check using state equation in 222 ms returned sat
[2024-05-28 06:56:37] [INFO ] State equation strengthened by 57 read => feed constraints.
[2024-05-28 06:56:37] [INFO ] [Nat]Added 57 Read/Feed constraints in 22 ms returned sat
[2024-05-28 06:56:37] [INFO ] Deduced a trap composed of 9 places in 124 ms of which 1 ms to minimize.
[2024-05-28 06:56:37] [INFO ] Deduced a trap composed of 38 places in 144 ms of which 1 ms to minimize.
[2024-05-28 06:56:37] [INFO ] Deduced a trap composed of 61 places in 140 ms of which 8 ms to minimize.
[2024-05-28 06:56:37] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 500 ms
[2024-05-28 06:56:37] [INFO ] Computed and/alt/rep : 283/461/283 causal constraints (skipped 21 transitions) in 55 ms.
[2024-05-28 06:56:39] [INFO ] Added : 137 causal constraints over 28 iterations in 1542 ms. Result :sat
Could not prove EG (NOT p1)
[2024-05-28 06:56:39] [INFO ] Flow matrix only has 308 transitions (discarded 24 similar events)
[2024-05-28 06:56:39] [INFO ] Invariant cache hit.
[2024-05-28 06:56:39] [INFO ] [Real]Absence check using 11 positive place invariants in 6 ms returned sat
[2024-05-28 06:56:39] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-28 06:56:39] [INFO ] [Real]Absence check using state equation in 174 ms returned sat
[2024-05-28 06:56:39] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 06:56:39] [INFO ] [Nat]Absence check using 11 positive place invariants in 6 ms returned sat
[2024-05-28 06:56:39] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-28 06:56:40] [INFO ] [Nat]Absence check using state equation in 170 ms returned sat
[2024-05-28 06:56:40] [INFO ] State equation strengthened by 57 read => feed constraints.
[2024-05-28 06:56:40] [INFO ] [Nat]Added 57 Read/Feed constraints in 21 ms returned sat
[2024-05-28 06:56:40] [INFO ] Deduced a trap composed of 13 places in 122 ms of which 1 ms to minimize.
[2024-05-28 06:56:40] [INFO ] Deduced a trap composed of 23 places in 153 ms of which 0 ms to minimize.
[2024-05-28 06:56:40] [INFO ] Deduced a trap composed of 38 places in 84 ms of which 0 ms to minimize.
[2024-05-28 06:56:40] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 431 ms
[2024-05-28 06:56:40] [INFO ] Computed and/alt/rep : 283/461/283 causal constraints (skipped 21 transitions) in 22 ms.
[2024-05-28 06:56:41] [INFO ] Added : 181 causal constraints over 37 iterations in 1200 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 88 out of 240 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 240/240 places, 332/332 transitions.
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 240 transition count 329
Reduce places removed 3 places and 0 transitions.
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: 12
Iterating post reduction 1 with 15 rules applied. Total rules applied 18 place count 237 transition count 317
Reduce places removed 12 places and 0 transitions.
Iterating post reduction 2 with 12 rules applied. Total rules applied 30 place count 225 transition count 317
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 8 Pre rules applied. Total rules applied 30 place count 225 transition count 309
Deduced a syphon composed of 8 places in 1 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 3 with 16 rules applied. Total rules applied 46 place count 217 transition count 309
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 9
Deduced a syphon composed of 9 places in 1 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 3 with 18 rules applied. Total rules applied 64 place count 208 transition count 300
Applied a total of 64 rules in 40 ms. Remains 208 /240 variables (removed 32) and now considering 300/332 (removed 32) transitions.
[2024-05-28 06:56:41] [INFO ] Flow matrix only has 276 transitions (discarded 24 similar events)
// Phase 1: matrix 276 rows 208 cols
[2024-05-28 06:56:41] [INFO ] Computed 11 invariants in 2 ms
[2024-05-28 06:56:42] [INFO ] Implicit Places using invariants in 189 ms returned []
[2024-05-28 06:56:42] [INFO ] Flow matrix only has 276 transitions (discarded 24 similar events)
[2024-05-28 06:56:42] [INFO ] Invariant cache hit.
[2024-05-28 06:56:42] [INFO ] State equation strengthened by 57 read => feed constraints.
[2024-05-28 06:56:42] [INFO ] Implicit Places using invariants and state equation in 301 ms returned []
Implicit Place search using SMT with State Equation took 517 ms to find 0 implicit places.
[2024-05-28 06:56:42] [INFO ] Redundant transitions in 20 ms returned []
[2024-05-28 06:56:42] [INFO ] Flow matrix only has 276 transitions (discarded 24 similar events)
[2024-05-28 06:56:42] [INFO ] Invariant cache hit.
[2024-05-28 06:56:42] [INFO ] Dead Transitions using invariants and state equation in 236 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 208/240 places, 300/332 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 846 ms. Remains : 208/240 places, 300/332 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT (AND (NOT p1) p0))), (X (NOT p1)), (X (NOT p0)), (X (AND (NOT p1) (NOT p0))), (X (NOT (AND p1 p0))), (X (NOT (AND p1 (NOT p0)))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT p1))), (X (X (NOT p0))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND p1 p0)))), (X (X (NOT (AND p1 (NOT p0)))))]
False Knowledge obtained : []
Knowledge based reduction with 13 factoid took 245 ms. Reduced automaton from 6 states, 15 edges and 2 AP (stutter insensitive) to 6 states, 15 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 291 ms :[(OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1), false, false, false]
Finished random walk after 20 steps, including 0 resets, run visited all 6 properties in 2 ms. (steps per millisecond=10 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT (AND (NOT p1) p0))), (X (NOT p1)), (X (NOT p0)), (X (AND (NOT p1) (NOT p0))), (X (NOT (AND p1 p0))), (X (NOT (AND p1 (NOT p0)))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT p1))), (X (X (NOT p0))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND p1 p0)))), (X (X (NOT (AND p1 (NOT p0)))))]
False Knowledge obtained : [(F (NOT (AND (NOT p1) (NOT p0)))), (F p0), (F p1), (F (AND (NOT p1) p0)), (F (AND p1 (NOT p0))), (F (AND p1 p0))]
Knowledge based reduction with 13 factoid took 522 ms. Reduced automaton from 6 states, 15 edges and 2 AP (stutter insensitive) to 6 states, 15 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 246 ms :[(OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1), false, false, false]
Stuttering acceptance computed with spot in 354 ms :[(OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1), false, false, false]
[2024-05-28 06:56:44] [INFO ] Flow matrix only has 276 transitions (discarded 24 similar events)
[2024-05-28 06:56:44] [INFO ] Invariant cache hit.
[2024-05-28 06:56:44] [INFO ] [Real]Absence check using 11 positive place invariants in 6 ms returned sat
[2024-05-28 06:56:44] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-28 06:56:44] [INFO ] [Real]Absence check using state equation in 148 ms returned sat
[2024-05-28 06:56:44] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 06:56:45] [INFO ] [Nat]Absence check using 11 positive place invariants in 6 ms returned sat
[2024-05-28 06:56:45] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-28 06:56:45] [INFO ] [Nat]Absence check using state equation in 157 ms returned sat
[2024-05-28 06:56:45] [INFO ] State equation strengthened by 57 read => feed constraints.
[2024-05-28 06:56:45] [INFO ] [Nat]Added 57 Read/Feed constraints in 20 ms returned sat
[2024-05-28 06:56:45] [INFO ] Deduced a trap composed of 15 places in 104 ms of which 1 ms to minimize.
[2024-05-28 06:56:45] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 138 ms
[2024-05-28 06:56:45] [INFO ] Computed and/alt/rep : 251/453/251 causal constraints (skipped 21 transitions) in 24 ms.
[2024-05-28 06:56:46] [INFO ] Deduced a trap composed of 34 places in 122 ms of which 1 ms to minimize.
[2024-05-28 06:56:46] [INFO ] Deduced a trap composed of 9 places in 93 ms of which 1 ms to minimize.
[2024-05-28 06:56:46] [INFO ] Deduced a trap composed of 42 places in 109 ms of which 0 ms to minimize.
[2024-05-28 06:56:46] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 421 ms
[2024-05-28 06:56:46] [INFO ] Added : 110 causal constraints over 23 iterations in 1221 ms. Result :sat
Could not prove EG (NOT p1)
[2024-05-28 06:56:46] [INFO ] Flow matrix only has 276 transitions (discarded 24 similar events)
[2024-05-28 06:56:46] [INFO ] Invariant cache hit.
[2024-05-28 06:56:46] [INFO ] [Real]Absence check using 11 positive place invariants in 6 ms returned sat
[2024-05-28 06:56:46] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-28 06:56:47] [INFO ] [Real]Absence check using state equation in 140 ms returned sat
[2024-05-28 06:56:47] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 06:56:47] [INFO ] [Nat]Absence check using 11 positive place invariants in 6 ms returned sat
[2024-05-28 06:56:47] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-28 06:56:47] [INFO ] [Nat]Absence check using state equation in 141 ms returned sat
[2024-05-28 06:56:47] [INFO ] State equation strengthened by 57 read => feed constraints.
[2024-05-28 06:56:47] [INFO ] [Nat]Added 57 Read/Feed constraints in 23 ms returned sat
[2024-05-28 06:56:47] [INFO ] Computed and/alt/rep : 251/453/251 causal constraints (skipped 21 transitions) in 22 ms.
[2024-05-28 06:56:48] [INFO ] Added : 154 causal constraints over 31 iterations in 827 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 283 ms :[(OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1), false, false, false]
Product exploration explored 100000 steps with 12433 reset in 350 ms.
Product exploration explored 100000 steps with 12405 reset in 355 ms.
Built C files in :
/tmp/ltsmin1737404673417958636
[2024-05-28 06:56:49] [INFO ] Computing symmetric may disable matrix : 300 transitions.
[2024-05-28 06:56:49] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 06:56:49] [INFO ] Computing symmetric may enable matrix : 300 transitions.
[2024-05-28 06:56:49] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 06:56:49] [INFO ] Computing Do-Not-Accords matrix : 300 transitions.
[2024-05-28 06:56:49] [INFO ] Computation of Completed DNA matrix. took 9 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 06:56:49] [INFO ] Built C files in 65ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1737404673417958636
Running compilation step : cd /tmp/ltsmin1737404673417958636;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1055 ms.
Running link step : cd /tmp/ltsmin1737404673417958636;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 49 ms.
Running LTSmin : cd /tmp/ltsmin1737404673417958636;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased1971219362643494921.hoa' '--buchi-type=spotba'
LTSmin run took 1998 ms.
FORMULA Peterson-COL-3-LTLCardinality-10 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property Peterson-COL-3-LTLCardinality-10 finished in 18965 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 8 out of 244 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 244/244 places, 332/332 transitions.
Applied a total of 0 rules in 4 ms. Remains 244 /244 variables (removed 0) and now considering 332/332 (removed 0) transitions.
[2024-05-28 06:56:52] [INFO ] Flow matrix only has 308 transitions (discarded 24 similar events)
// Phase 1: matrix 308 rows 244 cols
[2024-05-28 06:56:52] [INFO ] Computed 15 invariants in 2 ms
[2024-05-28 06:56:52] [INFO ] Implicit Places using invariants in 140 ms returned []
[2024-05-28 06:56:52] [INFO ] Flow matrix only has 308 transitions (discarded 24 similar events)
[2024-05-28 06:56:52] [INFO ] Invariant cache hit.
[2024-05-28 06:56:53] [INFO ] State equation strengthened by 57 read => feed constraints.
[2024-05-28 06:56:53] [INFO ] Implicit Places using invariants and state equation in 392 ms returned []
Implicit Place search using SMT with State Equation took 535 ms to find 0 implicit places.
[2024-05-28 06:56:53] [INFO ] Flow matrix only has 308 transitions (discarded 24 similar events)
[2024-05-28 06:56:53] [INFO ] Invariant cache hit.
[2024-05-28 06:56:53] [INFO ] Dead Transitions using invariants and state equation in 332 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 872 ms. Remains : 244/244 places, 332/332 transitions.
Stuttering acceptance computed with spot in 75 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : Peterson-COL-3-LTLCardinality-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(GT (ADD s108 s109 s110 s111) (ADD s0 s1 s2 s3))], 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 1294 reset in 162 ms.
Stack based approach found an accepted trace after 162 steps with 1 reset with depth 90 and stack size 90 in 0 ms.
FORMULA Peterson-COL-3-LTLCardinality-11 FALSE TECHNIQUES STACK_TEST
Treatment of property Peterson-COL-3-LTLCardinality-11 finished in 1126 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 4 out of 244 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 244/244 places, 332/332 transitions.
Drop transitions removed 96 transitions
Trivial Post-agglo rules discarded 96 transitions
Performed 96 trivial Post agglomeration. Transition count delta: 96
Iterating post reduction 0 with 96 rules applied. Total rules applied 96 place count 244 transition count 236
Reduce places removed 96 places and 0 transitions.
Iterating post reduction 1 with 96 rules applied. Total rules applied 192 place count 148 transition count 236
Performed 48 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 48 Pre rules applied. Total rules applied 192 place count 148 transition count 188
Deduced a syphon composed of 48 places in 0 ms
Reduce places removed 48 places and 0 transitions.
Iterating global reduction 2 with 96 rules applied. Total rules applied 288 place count 100 transition count 188
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: 12
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 2 with 24 rules applied. Total rules applied 312 place count 88 transition count 176
Applied a total of 312 rules in 20 ms. Remains 88 /244 variables (removed 156) and now considering 176/332 (removed 156) transitions.
[2024-05-28 06:56:53] [INFO ] Flow matrix only has 152 transitions (discarded 24 similar events)
// Phase 1: matrix 152 rows 88 cols
[2024-05-28 06:56:53] [INFO ] Computed 15 invariants in 1 ms
[2024-05-28 06:56:53] [INFO ] Implicit Places using invariants in 160 ms returned []
[2024-05-28 06:56:53] [INFO ] Flow matrix only has 152 transitions (discarded 24 similar events)
[2024-05-28 06:56:54] [INFO ] Invariant cache hit.
[2024-05-28 06:56:54] [INFO ] State equation strengthened by 57 read => feed constraints.
[2024-05-28 06:56:54] [INFO ] Implicit Places using invariants and state equation in 217 ms returned []
Implicit Place search using SMT with State Equation took 381 ms to find 0 implicit places.
[2024-05-28 06:56:54] [INFO ] Redundant transitions in 2 ms returned []
[2024-05-28 06:56:54] [INFO ] Flow matrix only has 152 transitions (discarded 24 similar events)
[2024-05-28 06:56:54] [INFO ] Invariant cache hit.
[2024-05-28 06:56:54] [INFO ] Dead Transitions using invariants and state equation in 135 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 88/244 places, 176/332 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 548 ms. Remains : 88/244 places, 176/332 transitions.
Stuttering acceptance computed with spot in 165 ms :[(NOT p0)]
Running random walk in product with property : Peterson-COL-3-LTLCardinality-12 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(LEQ (ADD s0 s1 s2 s3) 3)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Product exploration explored 100000 steps with 50000 reset in 197 ms.
Product exploration explored 100000 steps with 50000 reset in 211 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(NOT p0), (X p0), (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 3 factoid took 13 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA Peterson-COL-3-LTLCardinality-12 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Peterson-COL-3-LTLCardinality-12 finished in 1151 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((p0&&X(!p0))))'
Support contains 16 out of 244 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 244/244 places, 332/332 transitions.
Drop transitions removed 96 transitions
Trivial Post-agglo rules discarded 96 transitions
Performed 96 trivial Post agglomeration. Transition count delta: 96
Iterating post reduction 0 with 96 rules applied. Total rules applied 96 place count 244 transition count 236
Reduce places removed 96 places and 0 transitions.
Iterating post reduction 1 with 96 rules applied. Total rules applied 192 place count 148 transition count 236
Performed 40 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 40 Pre rules applied. Total rules applied 192 place count 148 transition count 196
Deduced a syphon composed of 40 places in 0 ms
Reduce places removed 40 places and 0 transitions.
Iterating global reduction 2 with 80 rules applied. Total rules applied 272 place count 108 transition count 196
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: 12
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 2 with 24 rules applied. Total rules applied 296 place count 96 transition count 184
Applied a total of 296 rules in 15 ms. Remains 96 /244 variables (removed 148) and now considering 184/332 (removed 148) transitions.
[2024-05-28 06:56:54] [INFO ] Flow matrix only has 160 transitions (discarded 24 similar events)
// Phase 1: matrix 160 rows 96 cols
[2024-05-28 06:56:54] [INFO ] Computed 15 invariants in 1 ms
[2024-05-28 06:56:55] [INFO ] Implicit Places using invariants in 94 ms returned []
[2024-05-28 06:56:55] [INFO ] Flow matrix only has 160 transitions (discarded 24 similar events)
[2024-05-28 06:56:55] [INFO ] Invariant cache hit.
[2024-05-28 06:56:55] [INFO ] State equation strengthened by 57 read => feed constraints.
[2024-05-28 06:56:55] [INFO ] Implicit Places using invariants and state equation in 208 ms returned []
Implicit Place search using SMT with State Equation took 316 ms to find 0 implicit places.
[2024-05-28 06:56:55] [INFO ] Redundant transitions in 1 ms returned []
[2024-05-28 06:56:55] [INFO ] Flow matrix only has 160 transitions (discarded 24 similar events)
[2024-05-28 06:56:55] [INFO ] Invariant cache hit.
[2024-05-28 06:56:55] [INFO ] Dead Transitions using invariants and state equation in 151 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 96/244 places, 184/332 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 497 ms. Remains : 96/244 places, 184/332 transitions.
Stuttering acceptance computed with spot in 73 ms :[true, p0]
Running random walk in product with property : Peterson-COL-3-LTLCardinality-13 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=p0, acceptance={0} source=0 dest: 1}], [{ cond=p0, acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(GT (ADD s12 s13 s14 s15 s16 s17 s18 s19 s20 s21 s22 s23) (ADD s0 s1 s2 s3))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 8656 reset in 214 ms.
Stack based approach found an accepted trace after 22 steps with 2 reset with depth 7 and stack size 7 in 0 ms.
FORMULA Peterson-COL-3-LTLCardinality-13 FALSE TECHNIQUES STACK_TEST
Treatment of property Peterson-COL-3-LTLCardinality-13 finished in 800 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)))&&(G(!p1)||F(G(p2)))))'
Support contains 132 out of 244 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 244/244 places, 332/332 transitions.
Applied a total of 0 rules in 2 ms. Remains 244 /244 variables (removed 0) and now considering 332/332 (removed 0) transitions.
[2024-05-28 06:56:55] [INFO ] Flow matrix only has 308 transitions (discarded 24 similar events)
// Phase 1: matrix 308 rows 244 cols
[2024-05-28 06:56:55] [INFO ] Computed 15 invariants in 2 ms
[2024-05-28 06:56:55] [INFO ] Implicit Places using invariants in 105 ms returned [0, 1, 2, 3]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 107 ms to find 4 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 240/244 places, 332/332 transitions.
Applied a total of 0 rules in 2 ms. Remains 240 /240 variables (removed 0) and now considering 332/332 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 113 ms. Remains : 240/244 places, 332/332 transitions.
Stuttering acceptance computed with spot in 212 ms :[(OR (NOT p0) (AND p1 (NOT p2))), (NOT p0), (NOT p2), (AND (NOT p2) p1), (NOT p0), true]
Running random walk in product with property : Peterson-COL-3-LTLCardinality-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}, { cond=p1, acceptance={} source=0 dest: 2}, { cond=(NOT p1), acceptance={} source=0 dest: 3}], [{ cond=true, acceptance={} source=1 dest: 4}], [{ cond=p2, acceptance={} source=2 dest: 2}, { cond=(NOT p2), acceptance={0} source=2 dest: 2}], [{ cond=p1, acceptance={} source=3 dest: 2}, { cond=(NOT p1), acceptance={} source=3 dest: 3}], [{ cond=p0, acceptance={} source=4 dest: 4}, { cond=(NOT p0), acceptance={} source=4 dest: 5}], [{ cond=true, acceptance={0} source=5 dest: 5}]], initial=0, aps=[p1:(GT 1 (ADD s192 s193 s194 s195 s196 s197 s198 s199 s200 s201 s202 s203 s204 s205 s206 s207 s208 s209 s210 s211 s212 s213 s214 s215 s216 s217 s218 s219 ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 0 reset in 271 ms.
Stack based approach found an accepted trace after 153 steps with 0 reset with depth 154 and stack size 154 in 0 ms.
FORMULA Peterson-COL-3-LTLCardinality-14 FALSE TECHNIQUES STACK_TEST
Treatment of property Peterson-COL-3-LTLCardinality-14 finished in 617 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 4 out of 244 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 244/244 places, 332/332 transitions.
Drop transitions removed 96 transitions
Trivial Post-agglo rules discarded 96 transitions
Performed 96 trivial Post agglomeration. Transition count delta: 96
Iterating post reduction 0 with 96 rules applied. Total rules applied 96 place count 244 transition count 236
Reduce places removed 96 places and 0 transitions.
Iterating post reduction 1 with 96 rules applied. Total rules applied 192 place count 148 transition count 236
Performed 48 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 48 Pre rules applied. Total rules applied 192 place count 148 transition count 188
Deduced a syphon composed of 48 places in 0 ms
Reduce places removed 48 places and 0 transitions.
Iterating global reduction 2 with 96 rules applied. Total rules applied 288 place count 100 transition count 188
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: 12
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 2 with 24 rules applied. Total rules applied 312 place count 88 transition count 176
Applied a total of 312 rules in 14 ms. Remains 88 /244 variables (removed 156) and now considering 176/332 (removed 156) transitions.
[2024-05-28 06:56:56] [INFO ] Flow matrix only has 152 transitions (discarded 24 similar events)
// Phase 1: matrix 152 rows 88 cols
[2024-05-28 06:56:56] [INFO ] Computed 15 invariants in 0 ms
[2024-05-28 06:56:56] [INFO ] Implicit Places using invariants in 96 ms returned []
[2024-05-28 06:56:56] [INFO ] Flow matrix only has 152 transitions (discarded 24 similar events)
[2024-05-28 06:56:56] [INFO ] Invariant cache hit.
[2024-05-28 06:56:56] [INFO ] State equation strengthened by 57 read => feed constraints.
[2024-05-28 06:56:56] [INFO ] Implicit Places using invariants and state equation in 188 ms returned []
Implicit Place search using SMT with State Equation took 299 ms to find 0 implicit places.
[2024-05-28 06:56:56] [INFO ] Redundant transitions in 1 ms returned []
[2024-05-28 06:56:56] [INFO ] Flow matrix only has 152 transitions (discarded 24 similar events)
[2024-05-28 06:56:56] [INFO ] Invariant cache hit.
[2024-05-28 06:56:56] [INFO ] Dead Transitions using invariants and state equation in 130 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 88/244 places, 176/332 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 452 ms. Remains : 88/244 places, 176/332 transitions.
Stuttering acceptance computed with spot in 89 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : Peterson-COL-3-LTLCardinality-15 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 3 (ADD s0 s1 s2 s3))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 0 reset in 130 ms.
Stack based approach found an accepted trace after 24 steps with 0 reset with depth 25 and stack size 25 in 0 ms.
FORMULA Peterson-COL-3-LTLCardinality-15 FALSE TECHNIQUES STACK_TEST
Treatment of property Peterson-COL-3-LTLCardinality-15 finished in 696 ms.
All properties solved by simple procedures.
Total runtime 34256 ms.

BK_STOP 1716879418313

--------------------
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="Peterson-COL-3"
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 Peterson-COL-3, 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 r285-smll-171654422000132"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/Peterson-COL-3.tgz
mv Peterson-COL-3 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 ;