Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/data/fkordon/mcc2021-input.r083-tall-162048875100236.qcow2', fmt=qcow2 size=4294967296 backing_file='/data/fkordon/mcc2021-input.qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
..........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itstools
Input is DiscoveryGPU-PT-06a, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r083-tall-162048875100236
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 384K
-rw-r--r-- 1 mcc users 12K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 120K May 5 16:58 CTLCardinality.xml
-rw-r--r-- 1 mcc users 8.8K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 84K May 5 16:58 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 6 14:48 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K May 6 14:48 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.2K Mar 28 16:03 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Mar 28 16:03 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.9K Mar 28 16:03 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Mar 28 16:03 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.4K Mar 23 10:20 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 18K Mar 23 10:20 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.9K Mar 22 17:58 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 19K Mar 22 17:58 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Mar 22 09:11 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Mar 22 09:11 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 5 16:51 equiv_col
-rw-r--r-- 1 mcc users 4 May 5 16:51 instance
-rw-r--r-- 1 mcc users 6 May 5 16:51 iscolored
-rw-r--r-- 1 mcc users 22K May 5 16:51 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 DiscoveryGPU-PT-06a-00
FORMULA_NAME DiscoveryGPU-PT-06a-01
FORMULA_NAME DiscoveryGPU-PT-06a-02
FORMULA_NAME DiscoveryGPU-PT-06a-03
FORMULA_NAME DiscoveryGPU-PT-06a-04
FORMULA_NAME DiscoveryGPU-PT-06a-05
FORMULA_NAME DiscoveryGPU-PT-06a-06
FORMULA_NAME DiscoveryGPU-PT-06a-07
FORMULA_NAME DiscoveryGPU-PT-06a-08
FORMULA_NAME DiscoveryGPU-PT-06a-09
FORMULA_NAME DiscoveryGPU-PT-06a-10
FORMULA_NAME DiscoveryGPU-PT-06a-11
FORMULA_NAME DiscoveryGPU-PT-06a-12
FORMULA_NAME DiscoveryGPU-PT-06a-13
FORMULA_NAME DiscoveryGPU-PT-06a-14
FORMULA_NAME DiscoveryGPU-PT-06a-15

=== Now, execution of the tool begins

BK_START 1620571443065

Running Version 0
[2021-05-09 14:44:05] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2021-05-09 14:44:05] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-09 14:44:05] [INFO ] Load time of PNML (sax parser for PT used): 40 ms
[2021-05-09 14:44:05] [INFO ] Transformed 63 places.
[2021-05-09 14:44:05] [INFO ] Transformed 85 transitions.
[2021-05-09 14:44:05] [INFO ] Found NUPN structural information;
[2021-05-09 14:44:05] [INFO ] Parsed PT model containing 63 places and 85 transitions in 108 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 10 ms.
Working with output stream class java.io.PrintStream
[2021-05-09 14:44:05] [INFO ] Initial state test concluded for 3 properties.
FORMULA DiscoveryGPU-PT-06a-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DiscoveryGPU-PT-06a-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DiscoveryGPU-PT-06a-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DiscoveryGPU-PT-06a-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DiscoveryGPU-PT-06a-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 23 out of 63 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 63/63 places, 85/85 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 61 transition count 83
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 61 transition count 83
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 6 place count 59 transition count 81
Iterating global reduction 0 with 2 rules applied. Total rules applied 8 place count 59 transition count 81
Drop transitions removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 0 with 6 rules applied. Total rules applied 14 place count 59 transition count 75
Applied a total of 14 rules in 31 ms. Remains 59 /63 variables (removed 4) and now considering 75/85 (removed 10) transitions.
// Phase 1: matrix 75 rows 59 cols
[2021-05-09 14:44:05] [INFO ] Computed 2 place invariants in 6 ms
[2021-05-09 14:44:05] [INFO ] Implicit Places using invariants in 99 ms returned []
// Phase 1: matrix 75 rows 59 cols
[2021-05-09 14:44:05] [INFO ] Computed 2 place invariants in 2 ms
[2021-05-09 14:44:05] [INFO ] State equation strengthened by 46 read => feed constraints.
[2021-05-09 14:44:05] [INFO ] Implicit Places using invariants and state equation in 81 ms returned []
Implicit Place search using SMT with State Equation took 207 ms to find 0 implicit places.
// Phase 1: matrix 75 rows 59 cols
[2021-05-09 14:44:05] [INFO ] Computed 2 place invariants in 1 ms
[2021-05-09 14:44:05] [INFO ] Dead Transitions using invariants and state equation in 67 ms returned []
Finished structural reductions, in 1 iterations. Remains : 59/63 places, 75/85 transitions.
[2021-05-09 14:44:05] [INFO ] Initial state reduction rules for LTL removed 2 formulas.
[2021-05-09 14:44:05] [INFO ] Flatten gal took : 41 ms
FORMULA DiscoveryGPU-PT-06a-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DiscoveryGPU-PT-06a-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-09 14:44:05] [INFO ] Flatten gal took : 9 ms
[2021-05-09 14:44:05] [INFO ] Input system was already deterministic with 75 transitions.
Incomplete random walk after 100000 steps, including 1528 resets, run finished after 299 ms. (steps per millisecond=334 ) properties (out of 16) seen :15
Running SMT prover for 1 properties.
// Phase 1: matrix 75 rows 59 cols
[2021-05-09 14:44:06] [INFO ] Computed 2 place invariants in 1 ms
[2021-05-09 14:44:06] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2021-05-09 14:44:06] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 14:44:06] [INFO ] [Real]Absence check using state equation in 20 ms returned sat
[2021-05-09 14:44:06] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 14:44:06] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2021-05-09 14:44:06] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 14:44:06] [INFO ] [Nat]Absence check using state equation in 27 ms returned unsat
Successfully simplified 1 atomic propositions for a total of 9 simplifications.
[2021-05-09 14:44:06] [INFO ] Initial state test concluded for 1 properties.
FORMULA DiscoveryGPU-PT-06a-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((p0 U X((G(p1)||G(p2)))))], workingDir=/home/mcc/execution]
Support contains 6 out of 59 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 59/59 places, 75/75 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 55 transition count 71
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 55 transition count 71
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 10 place count 53 transition count 69
Iterating global reduction 0 with 2 rules applied. Total rules applied 12 place count 53 transition count 69
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 14 place count 51 transition count 67
Iterating global reduction 0 with 2 rules applied. Total rules applied 16 place count 51 transition count 67
Applied a total of 16 rules in 9 ms. Remains 51 /59 variables (removed 8) and now considering 67/75 (removed 8) transitions.
// Phase 1: matrix 67 rows 51 cols
[2021-05-09 14:44:06] [INFO ] Computed 2 place invariants in 0 ms
[2021-05-09 14:44:06] [INFO ] Implicit Places using invariants in 53 ms returned []
// Phase 1: matrix 67 rows 51 cols
[2021-05-09 14:44:06] [INFO ] Computed 2 place invariants in 1 ms
[2021-05-09 14:44:06] [INFO ] State equation strengthened by 44 read => feed constraints.
[2021-05-09 14:44:06] [INFO ] Implicit Places using invariants and state equation in 102 ms returned [50]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 158 ms to find 1 implicit places.
// Phase 1: matrix 67 rows 50 cols
[2021-05-09 14:44:06] [INFO ] Computed 1 place invariants in 2 ms
[2021-05-09 14:44:06] [INFO ] Dead Transitions using invariants and state equation in 49 ms returned []
Starting structural reductions, iteration 1 : 50/59 places, 67/75 transitions.
Applied a total of 0 rules in 1 ms. Remains 50 /50 variables (removed 0) and now considering 67/67 (removed 0) transitions.
// Phase 1: matrix 67 rows 50 cols
[2021-05-09 14:44:06] [INFO ] Computed 1 place invariants in 1 ms
[2021-05-09 14:44:06] [INFO ] Dead Transitions using invariants and state equation in 51 ms returned []
Finished structural reductions, in 2 iterations. Remains : 50/59 places, 67/75 transitions.
Stuttering acceptance computed with spot in 264 ms :[(AND (NOT p2) (NOT p1)), (AND (NOT p1) (NOT p2)), true, (NOT p1), (NOT p2)]
Running random walk in product with property : DiscoveryGPU-PT-06a-00 automaton TGBA [mat=[[{ cond=(AND p1 p2), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p2)), acceptance={} source=0 dest: 2}, { cond=(AND p1 (NOT p2)), acceptance={} source=0 dest: 3}, { cond=(AND (NOT p1) p2), acceptance={} source=0 dest: 4}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={0, 1} source=1 dest: 1}, { cond=(AND p0 (NOT p1) p2), acceptance={0} source=1 dest: 1}, { cond=(AND p0 p1 (NOT p2)), acceptance={1} source=1 dest: 1}, { cond=(AND p0 p1 p2), acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={0, 1} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={} source=3 dest: 2}, { cond=p1, acceptance={} source=3 dest: 3}], [{ cond=(NOT p2), acceptance={} source=4 dest: 2}, { cond=p2, acceptance={} source=4 dest: 4}]], initial=1, aps=[p1:(AND (EQ s41 0) (EQ s19 1)), p2:(OR (EQ s30 0) (EQ s12 1)), p0:(OR (EQ s32 0) (EQ s6 1))], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2503 steps with 36 reset in 43 ms.
FORMULA DiscoveryGPU-PT-06a-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-06a-00 finished in 616 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(X(G(p0))))], workingDir=/home/mcc/execution]
Support contains 1 out of 59 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 59/59 places, 75/75 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 54 transition count 70
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 54 transition count 70
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 13 place count 51 transition count 67
Iterating global reduction 0 with 3 rules applied. Total rules applied 16 place count 51 transition count 67
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 19 place count 48 transition count 64
Iterating global reduction 0 with 3 rules applied. Total rules applied 22 place count 48 transition count 64
Applied a total of 22 rules in 7 ms. Remains 48 /59 variables (removed 11) and now considering 64/75 (removed 11) transitions.
// Phase 1: matrix 64 rows 48 cols
[2021-05-09 14:44:06] [INFO ] Computed 2 place invariants in 0 ms
[2021-05-09 14:44:06] [INFO ] Implicit Places using invariants in 32 ms returned []
// Phase 1: matrix 64 rows 48 cols
[2021-05-09 14:44:06] [INFO ] Computed 2 place invariants in 1 ms
[2021-05-09 14:44:06] [INFO ] State equation strengthened by 43 read => feed constraints.
[2021-05-09 14:44:07] [INFO ] Implicit Places using invariants and state equation in 75 ms returned [47]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 111 ms to find 1 implicit places.
// Phase 1: matrix 64 rows 47 cols
[2021-05-09 14:44:07] [INFO ] Computed 1 place invariants in 1 ms
[2021-05-09 14:44:07] [INFO ] Dead Transitions using invariants and state equation in 32 ms returned []
Starting structural reductions, iteration 1 : 47/59 places, 64/75 transitions.
Applied a total of 0 rules in 4 ms. Remains 47 /47 variables (removed 0) and now considering 64/64 (removed 0) transitions.
// Phase 1: matrix 64 rows 47 cols
[2021-05-09 14:44:07] [INFO ] Computed 1 place invariants in 0 ms
[2021-05-09 14:44:07] [INFO ] Dead Transitions using invariants and state equation in 27 ms returned []
Finished structural reductions, in 2 iterations. Remains : 47/59 places, 64/75 transitions.
Stuttering acceptance computed with spot in 78 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : DiscoveryGPU-PT-06a-03 automaton TGBA [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:(EQ s5 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, 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 DiscoveryGPU-PT-06a-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-06a-03 finished in 273 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F(p0))], workingDir=/home/mcc/execution]
Support contains 2 out of 59 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 59/59 places, 75/75 transitions.
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 3 Pre rules applied. Total rules applied 0 place count 59 transition count 72
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 6 place count 56 transition count 72
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 10 place count 52 transition count 68
Iterating global reduction 0 with 4 rules applied. Total rules applied 14 place count 52 transition count 68
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 17 place count 49 transition count 65
Iterating global reduction 0 with 3 rules applied. Total rules applied 20 place count 49 transition count 65
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 24 place count 47 transition count 63
Applied a total of 24 rules in 19 ms. Remains 47 /59 variables (removed 12) and now considering 63/75 (removed 12) transitions.
// Phase 1: matrix 63 rows 47 cols
[2021-05-09 14:44:07] [INFO ] Computed 2 place invariants in 0 ms
[2021-05-09 14:44:07] [INFO ] Implicit Places using invariants in 23 ms returned []
// Phase 1: matrix 63 rows 47 cols
[2021-05-09 14:44:07] [INFO ] Computed 2 place invariants in 0 ms
[2021-05-09 14:44:07] [INFO ] State equation strengthened by 43 read => feed constraints.
[2021-05-09 14:44:07] [INFO ] Implicit Places using invariants and state equation in 50 ms returned []
Implicit Place search using SMT with State Equation took 75 ms to find 0 implicit places.
[2021-05-09 14:44:07] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 63 rows 47 cols
[2021-05-09 14:44:07] [INFO ] Computed 2 place invariants in 1 ms
[2021-05-09 14:44:07] [INFO ] Dead Transitions using invariants and state equation in 63 ms returned []
Finished structural reductions, in 1 iterations. Remains : 47/59 places, 63/75 transitions.
Stuttering acceptance computed with spot in 24 ms :[(NOT p0)]
Running random walk in product with property : DiscoveryGPU-PT-06a-05 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (EQ s16 0) (EQ s46 1))], 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 244 ms.
Product exploration explored 100000 steps with 50000 reset in 250 ms.
Knowledge obtained : [(NOT p0)]
Stuttering acceptance computed with spot in 30 ms :[(NOT p0)]
Product exploration explored 100000 steps with 50000 reset in 182 ms.
Product exploration explored 100000 steps with 50000 reset in 266 ms.
[2021-05-09 14:44:08] [INFO ] Flatten gal took : 9 ms
[2021-05-09 14:44:08] [INFO ] Flatten gal took : 4 ms
[2021-05-09 14:44:08] [INFO ] Time to serialize gal into /tmp/LTL8440094889036602341.gal : 7 ms
[2021-05-09 14:44:08] [INFO ] Time to serialize properties into /tmp/LTL10120782732361948860.ltl : 0 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /tmp/LTL8440094889036602341.gal, -t, CGAL, -LTL, /tmp/LTL10120782732361948860.ltl, -c, -stutter-deadlock, --gen-order, FOLLOW], workingDir=/home/mcc/execution]

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL8440094889036602341.gal -t CGAL -LTL /tmp/LTL10120782732361948860.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((F("((p23==0)&&(p62==1))")))
Formula 0 simplified : !F"((p23==0)&&(p62==1))"
Reverse transition relation is NOT exact ! Due to transitions t10, t22, t26, t29, t65, t66, t68, t70, t72, t74, t16.t61.t71, t20.t13, t24.t13, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0/50/13/63
Computing Next relation with stutter on 1 deadlock states
1 unique states visited
0 strongly connected components in search stack
0 transitions explored
1 items max in DFS search stack
13 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,0.153206,20636,1,0,96,23760,152,63,1443,29472,143
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA DiscoveryGPU-PT-06a-05 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Treatment of property DiscoveryGPU-PT-06a-05 finished in 1436 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F(G(p0)))], workingDir=/home/mcc/execution]
Support contains 2 out of 59 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 59/59 places, 75/75 transitions.
Reduce places removed 1 places and 1 transitions.
Reduce places removed 2 places and 0 transitions.
Graph (trivial) has 59 edges and 56 vertex of which 22 / 56 are part of one of the 11 SCC in 1 ms
Free SCC test removed 11 places
Drop transitions removed 18 transitions
Trivial Post-agglo rules discarded 18 transitions
Performed 18 trivial Post agglomeration. Transition count delta: 18
Iterating post reduction 0 with 21 rules applied. Total rules applied 21 place count 45 transition count 56
Reduce places removed 18 places and 0 transitions.
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 1 with 29 rules applied. Total rules applied 50 place count 27 transition count 45
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 53 place count 24 transition count 39
Iterating global reduction 2 with 3 rules applied. Total rules applied 56 place count 24 transition count 39
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 58 place count 22 transition count 35
Iterating global reduction 2 with 2 rules applied. Total rules applied 60 place count 22 transition count 35
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 62 place count 20 transition count 31
Iterating global reduction 2 with 2 rules applied. Total rules applied 64 place count 20 transition count 31
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 66 place count 18 transition count 29
Iterating global reduction 2 with 2 rules applied. Total rules applied 68 place count 18 transition count 29
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 74 place count 15 transition count 26
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 76 place count 13 transition count 22
Iterating global reduction 2 with 2 rules applied. Total rules applied 78 place count 13 transition count 22
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 79 place count 12 transition count 19
Iterating global reduction 2 with 1 rules applied. Total rules applied 80 place count 12 transition count 19
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 81 place count 11 transition count 18
Iterating global reduction 2 with 1 rules applied. Total rules applied 82 place count 11 transition count 18
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 83 place count 11 transition count 17
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 84 place count 10 transition count 16
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 85 place count 9 transition count 15
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 86 place count 8 transition count 14
Applied a total of 86 rules in 12 ms. Remains 8 /59 variables (removed 51) and now considering 14/75 (removed 61) transitions.
[2021-05-09 14:44:08] [INFO ] Flow matrix only has 11 transitions (discarded 3 similar events)
// Phase 1: matrix 11 rows 8 cols
[2021-05-09 14:44:08] [INFO ] Computed 0 place invariants in 0 ms
[2021-05-09 14:44:08] [INFO ] Implicit Places using invariants in 14 ms returned []
[2021-05-09 14:44:08] [INFO ] Flow matrix only has 11 transitions (discarded 3 similar events)
// Phase 1: matrix 11 rows 8 cols
[2021-05-09 14:44:08] [INFO ] Computed 0 place invariants in 0 ms
[2021-05-09 14:44:08] [INFO ] State equation strengthened by 1 read => feed constraints.
[2021-05-09 14:44:08] [INFO ] Implicit Places using invariants and state equation in 11 ms returned []
Implicit Place search using SMT with State Equation took 26 ms to find 0 implicit places.
[2021-05-09 14:44:08] [INFO ] Redundant transitions in 0 ms returned []
[2021-05-09 14:44:08] [INFO ] Flow matrix only has 11 transitions (discarded 3 similar events)
// Phase 1: matrix 11 rows 8 cols
[2021-05-09 14:44:08] [INFO ] Computed 0 place invariants in 0 ms
[2021-05-09 14:44:08] [INFO ] Dead Transitions using invariants and state equation in 13 ms returned []
Finished structural reductions, in 1 iterations. Remains : 8/59 places, 14/75 transitions.
Stuttering acceptance computed with spot in 23 ms :[(NOT p0)]
Running random walk in product with property : DiscoveryGPU-PT-06a-07 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=p0, acceptance={} source=0 dest: 0}]], initial=0, aps=[p0:(OR (EQ s2 0) (EQ s6 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 5 steps with 0 reset in 0 ms.
FORMULA DiscoveryGPU-PT-06a-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-06a-07 finished in 93 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(F((X(F(p1))&&p0))))], workingDir=/home/mcc/execution]
Support contains 2 out of 59 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 59/59 places, 75/75 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 55 transition count 71
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 55 transition count 71
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 11 place count 52 transition count 68
Iterating global reduction 0 with 3 rules applied. Total rules applied 14 place count 52 transition count 68
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 17 place count 49 transition count 65
Iterating global reduction 0 with 3 rules applied. Total rules applied 20 place count 49 transition count 65
Applied a total of 20 rules in 6 ms. Remains 49 /59 variables (removed 10) and now considering 65/75 (removed 10) transitions.
// Phase 1: matrix 65 rows 49 cols
[2021-05-09 14:44:08] [INFO ] Computed 2 place invariants in 0 ms
[2021-05-09 14:44:08] [INFO ] Implicit Places using invariants in 19 ms returned []
// Phase 1: matrix 65 rows 49 cols
[2021-05-09 14:44:08] [INFO ] Computed 2 place invariants in 0 ms
[2021-05-09 14:44:08] [INFO ] State equation strengthened by 43 read => feed constraints.
[2021-05-09 14:44:08] [INFO ] Implicit Places using invariants and state equation in 71 ms returned [48]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 91 ms to find 1 implicit places.
// Phase 1: matrix 65 rows 48 cols
[2021-05-09 14:44:08] [INFO ] Computed 1 place invariants in 1 ms
[2021-05-09 14:44:08] [INFO ] Dead Transitions using invariants and state equation in 50 ms returned []
Starting structural reductions, iteration 1 : 48/59 places, 65/75 transitions.
Applied a total of 0 rules in 1 ms. Remains 48 /48 variables (removed 0) and now considering 65/65 (removed 0) transitions.
// Phase 1: matrix 65 rows 48 cols
[2021-05-09 14:44:08] [INFO ] Computed 1 place invariants in 1 ms
[2021-05-09 14:44:08] [INFO ] Dead Transitions using invariants and state equation in 41 ms returned []
Finished structural reductions, in 2 iterations. Remains : 48/59 places, 65/75 transitions.
Stuttering acceptance computed with spot in 79 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0))]
Running random walk in product with property : DiscoveryGPU-PT-06a-09 automaton TGBA [mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=p0, acceptance={0} source=2 dest: 0}, { cond=(NOT p0), acceptance={0} source=2 dest: 2}]], initial=1, aps=[p1:(OR (EQ s11 0) (EQ s16 1)), p0:(AND (EQ s16 0) (EQ s11 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Stuttering criterion allowed to conclude after 102 steps with 1 reset in 0 ms.
FORMULA DiscoveryGPU-PT-06a-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-06a-09 finished in 284 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G((F(p0)&&F(G(p1)))))], workingDir=/home/mcc/execution]
Support contains 3 out of 59 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 59/59 places, 75/75 transitions.
Reduce places removed 1 places and 1 transitions.
Reduce places removed 2 places and 0 transitions.
Graph (trivial) has 57 edges and 56 vertex of which 20 / 56 are part of one of the 10 SCC in 0 ms
Free SCC test removed 10 places
Drop transitions removed 16 transitions
Trivial Post-agglo rules discarded 16 transitions
Performed 16 trivial Post agglomeration. Transition count delta: 16
Iterating post reduction 0 with 19 rules applied. Total rules applied 19 place count 46 transition count 58
Reduce places removed 16 places and 0 transitions.
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 27 rules applied. Total rules applied 46 place count 30 transition count 47
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 47 place count 29 transition count 47
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 48 place count 28 transition count 45
Iterating global reduction 3 with 1 rules applied. Total rules applied 49 place count 28 transition count 45
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 50 place count 27 transition count 43
Iterating global reduction 3 with 1 rules applied. Total rules applied 51 place count 27 transition count 43
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 52 place count 26 transition count 41
Iterating global reduction 3 with 1 rules applied. Total rules applied 53 place count 26 transition count 41
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 54 place count 25 transition count 40
Iterating global reduction 3 with 1 rules applied. Total rules applied 55 place count 25 transition count 40
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 10 rules applied. Total rules applied 65 place count 20 transition count 35
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 67 place count 18 transition count 31
Iterating global reduction 3 with 2 rules applied. Total rules applied 69 place count 18 transition count 31
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 70 place count 17 transition count 28
Iterating global reduction 3 with 1 rules applied. Total rules applied 71 place count 17 transition count 28
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 72 place count 16 transition count 27
Iterating global reduction 3 with 1 rules applied. Total rules applied 73 place count 16 transition count 27
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 74 place count 16 transition count 26
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 75 place count 15 transition count 25
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 76 place count 14 transition count 24
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 77 place count 13 transition count 23
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 78 place count 12 transition count 22
Applied a total of 78 rules in 10 ms. Remains 12 /59 variables (removed 47) and now considering 22/75 (removed 53) transitions.
[2021-05-09 14:44:08] [INFO ] Flow matrix only has 17 transitions (discarded 5 similar events)
// Phase 1: matrix 17 rows 12 cols
[2021-05-09 14:44:08] [INFO ] Computed 0 place invariants in 0 ms
[2021-05-09 14:44:08] [INFO ] Implicit Places using invariants in 6 ms returned []
[2021-05-09 14:44:08] [INFO ] Flow matrix only has 17 transitions (discarded 5 similar events)
// Phase 1: matrix 17 rows 12 cols
[2021-05-09 14:44:08] [INFO ] Computed 0 place invariants in 0 ms
[2021-05-09 14:44:09] [INFO ] State equation strengthened by 1 read => feed constraints.
[2021-05-09 14:44:09] [INFO ] Implicit Places using invariants and state equation in 25 ms returned []
Implicit Place search using SMT with State Equation took 31 ms to find 0 implicit places.
[2021-05-09 14:44:09] [INFO ] Redundant transitions in 0 ms returned []
[2021-05-09 14:44:09] [INFO ] Flow matrix only has 17 transitions (discarded 5 similar events)
// Phase 1: matrix 17 rows 12 cols
[2021-05-09 14:44:09] [INFO ] Computed 0 place invariants in 1 ms
[2021-05-09 14:44:09] [INFO ] Dead Transitions using invariants and state equation in 13 ms returned []
Finished structural reductions, in 1 iterations. Remains : 12/59 places, 22/75 transitions.
Stuttering acceptance computed with spot in 72 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : DiscoveryGPU-PT-06a-10 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}, { cond=p1, acceptance={} source=2 dest: 2}]], initial=0, aps=[p0:(OR (EQ s4 0) (EQ s10 1)), p1:(EQ s0 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA DiscoveryGPU-PT-06a-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-06a-10 finished in 143 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G((p0||X(G((G(p2)||p1))))))], workingDir=/home/mcc/execution]
Support contains 3 out of 59 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 59/59 places, 75/75 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 54 transition count 70
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 54 transition count 70
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 13 place count 51 transition count 67
Iterating global reduction 0 with 3 rules applied. Total rules applied 16 place count 51 transition count 67
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 19 place count 48 transition count 64
Iterating global reduction 0 with 3 rules applied. Total rules applied 22 place count 48 transition count 64
Applied a total of 22 rules in 4 ms. Remains 48 /59 variables (removed 11) and now considering 64/75 (removed 11) transitions.
// Phase 1: matrix 64 rows 48 cols
[2021-05-09 14:44:09] [INFO ] Computed 2 place invariants in 1 ms
[2021-05-09 14:44:09] [INFO ] Implicit Places using invariants in 24 ms returned []
// Phase 1: matrix 64 rows 48 cols
[2021-05-09 14:44:09] [INFO ] Computed 2 place invariants in 1 ms
[2021-05-09 14:44:09] [INFO ] State equation strengthened by 43 read => feed constraints.
[2021-05-09 14:44:09] [INFO ] Implicit Places using invariants and state equation in 65 ms returned [47]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 91 ms to find 1 implicit places.
// Phase 1: matrix 64 rows 47 cols
[2021-05-09 14:44:09] [INFO ] Computed 1 place invariants in 2 ms
[2021-05-09 14:44:09] [INFO ] Dead Transitions using invariants and state equation in 28 ms returned []
Starting structural reductions, iteration 1 : 47/59 places, 64/75 transitions.
Applied a total of 0 rules in 1 ms. Remains 47 /47 variables (removed 0) and now considering 64/64 (removed 0) transitions.
// Phase 1: matrix 64 rows 47 cols
[2021-05-09 14:44:09] [INFO ] Computed 1 place invariants in 1 ms
[2021-05-09 14:44:09] [INFO ] Dead Transitions using invariants and state equation in 29 ms returned []
Finished structural reductions, in 2 iterations. Remains : 47/59 places, 64/75 transitions.
Stuttering acceptance computed with spot in 166 ms :[(AND (NOT p0) (NOT p2) (NOT p1)), (NOT p2), (AND (NOT p2) (NOT p1)), true]
Running random walk in product with property : DiscoveryGPU-PT-06a-12 automaton TGBA [mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 2}], [{ cond=p2, acceptance={} source=1 dest: 1}, { cond=(NOT p2), acceptance={} source=1 dest: 3}], [{ cond=(AND (NOT p1) p2), acceptance={} source=2 dest: 1}, { cond=p1, acceptance={} source=2 dest: 2}, { cond=(AND (NOT p1) (NOT p2)), acceptance={} source=2 dest: 3}], [{ cond=true, acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(AND (EQ s36 0) (EQ s9 1)), p2:(OR (EQ s19 0) (EQ s36 1)), p1:(OR (EQ s9 0) (EQ s36 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 146 steps with 2 reset in 0 ms.
FORMULA DiscoveryGPU-PT-06a-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-06a-12 finished in 335 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(X((F(p1)&&p0))))], workingDir=/home/mcc/execution]
Support contains 2 out of 59 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 59/59 places, 75/75 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 54 transition count 70
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 54 transition count 70
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 13 place count 51 transition count 67
Iterating global reduction 0 with 3 rules applied. Total rules applied 16 place count 51 transition count 67
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 19 place count 48 transition count 64
Iterating global reduction 0 with 3 rules applied. Total rules applied 22 place count 48 transition count 64
Applied a total of 22 rules in 4 ms. Remains 48 /59 variables (removed 11) and now considering 64/75 (removed 11) transitions.
// Phase 1: matrix 64 rows 48 cols
[2021-05-09 14:44:09] [INFO ] Computed 2 place invariants in 0 ms
[2021-05-09 14:44:09] [INFO ] Implicit Places using invariants in 26 ms returned []
// Phase 1: matrix 64 rows 48 cols
[2021-05-09 14:44:09] [INFO ] Computed 2 place invariants in 1 ms
[2021-05-09 14:44:09] [INFO ] State equation strengthened by 43 read => feed constraints.
[2021-05-09 14:44:09] [INFO ] Implicit Places using invariants and state equation in 41 ms returned [47]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 68 ms to find 1 implicit places.
// Phase 1: matrix 64 rows 47 cols
[2021-05-09 14:44:09] [INFO ] Computed 1 place invariants in 1 ms
[2021-05-09 14:44:09] [INFO ] Dead Transitions using invariants and state equation in 27 ms returned []
Starting structural reductions, iteration 1 : 47/59 places, 64/75 transitions.
Applied a total of 0 rules in 1 ms. Remains 47 /47 variables (removed 0) and now considering 64/64 (removed 0) transitions.
// Phase 1: matrix 64 rows 47 cols
[2021-05-09 14:44:09] [INFO ] Computed 1 place invariants in 1 ms
[2021-05-09 14:44:09] [INFO ] Dead Transitions using invariants and state equation in 43 ms returned []
Finished structural reductions, in 2 iterations. Remains : 47/59 places, 64/75 transitions.
Stuttering acceptance computed with spot in 109 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0)), true, (OR (NOT p1) (NOT p0))]
Running random walk in product with property : DiscoveryGPU-PT-06a-14 automaton TGBA [mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 0}, { cond=(NOT p0), acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=true, acceptance={} source=4 dest: 2}]], initial=4, aps=[p1:(OR (EQ s33 0) (EQ s18 1)), p0:(AND (EQ s18 0) (EQ s33 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 1 ms.
FORMULA DiscoveryGPU-PT-06a-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-06a-14 finished in 266 ms.
All properties solved without resorting to model-checking.

BK_STOP 1620571450586

--------------------
content from stderr:

+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution LTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ cut -d . -f 9
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202104292328.jar
+ VERSION=0
+ echo 'Running Version 0'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data /home/mcc/execution/workspace -pnfolder /home/mcc/execution -examination LTLCardinality -spotpath /home/mcc/BenchKit/bin//..//ltlfilt -z3path /home/mcc/BenchKit/bin//..//z3/bin/z3 -yices2path /home/mcc/BenchKit/bin//..//yices/bin/yices -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=/tmp/.eclipse -Xss128m -Xms40m -Xmx16000m

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="DiscoveryGPU-PT-06a"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="itstools"
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-4028"
echo " Executing tool itstools"
echo " Input is DiscoveryGPU-PT-06a, 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 r083-tall-162048875100236"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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