fond
Model Checking Contest 2022
12th edition, Bergen, Norway, June 21, 2022
Execution of r096-smll-165260576100339
Last Updated
Jun 22, 2022

About the Execution of ITS-Tools for GPUForwardProgress-PT-12b

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
1568.455 68527.00 180215.00 525.10 TFFFFFFFFFTFFFFT normal

Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2022-input.r096-smll-165260576100339.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2022-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itstools
Input is GPUForwardProgress-PT-12b, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r096-smll-165260576100339
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 268K
-rw-r--r-- 1 mcc users 6.1K Apr 29 12:45 CTLCardinality.txt
-rw-r--r-- 1 mcc users 63K Apr 29 12:45 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.3K Apr 29 12:44 CTLFireability.txt
-rw-r--r-- 1 mcc users 50K Apr 29 12:44 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.6K May 9 07:55 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K May 9 07:55 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K May 9 07:55 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K May 9 07:55 LTLFireability.xml
-rw-r--r-- 1 mcc users 1.7K May 9 07:55 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K May 9 07:55 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 10 09:34 equiv_col
-rw-r--r-- 1 mcc users 4 May 10 09:34 instance
-rw-r--r-- 1 mcc users 6 May 10 09:34 iscolored
-rw-r--r-- 1 mcc users 65K May 10 09:34 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 GPUForwardProgress-PT-12b-LTLCardinality-00
FORMULA_NAME GPUForwardProgress-PT-12b-LTLCardinality-01
FORMULA_NAME GPUForwardProgress-PT-12b-LTLCardinality-02
FORMULA_NAME GPUForwardProgress-PT-12b-LTLCardinality-03
FORMULA_NAME GPUForwardProgress-PT-12b-LTLCardinality-04
FORMULA_NAME GPUForwardProgress-PT-12b-LTLCardinality-05
FORMULA_NAME GPUForwardProgress-PT-12b-LTLCardinality-06
FORMULA_NAME GPUForwardProgress-PT-12b-LTLCardinality-07
FORMULA_NAME GPUForwardProgress-PT-12b-LTLCardinality-08
FORMULA_NAME GPUForwardProgress-PT-12b-LTLCardinality-09
FORMULA_NAME GPUForwardProgress-PT-12b-LTLCardinality-10
FORMULA_NAME GPUForwardProgress-PT-12b-LTLCardinality-11
FORMULA_NAME GPUForwardProgress-PT-12b-LTLCardinality-12
FORMULA_NAME GPUForwardProgress-PT-12b-LTLCardinality-13
FORMULA_NAME GPUForwardProgress-PT-12b-LTLCardinality-14
FORMULA_NAME GPUForwardProgress-PT-12b-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1652722719137

Running Version 202205111006
[2022-05-16 17:38:41] [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]
[2022-05-16 17:38:41] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-16 17:38:41] [INFO ] Load time of PNML (sax parser for PT used): 173 ms
[2022-05-16 17:38:41] [INFO ] Transformed 264 places.
[2022-05-16 17:38:41] [INFO ] Transformed 277 transitions.
[2022-05-16 17:38:41] [INFO ] Found NUPN structural information;
[2022-05-16 17:38:41] [INFO ] Parsed PT model containing 264 places and 277 transitions in 359 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 17 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
Initial state reduction rules removed 2 formulas.
FORMULA GPUForwardProgress-PT-12b-LTLCardinality-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA GPUForwardProgress-PT-12b-LTLCardinality-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA GPUForwardProgress-PT-12b-LTLCardinality-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA GPUForwardProgress-PT-12b-LTLCardinality-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA GPUForwardProgress-PT-12b-LTLCardinality-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA GPUForwardProgress-PT-12b-LTLCardinality-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA GPUForwardProgress-PT-12b-LTLCardinality-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA GPUForwardProgress-PT-12b-LTLCardinality-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 22 out of 264 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 264/264 places, 277/277 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 263 transition count 277
Discarding 25 places :
Symmetric choice reduction at 1 with 25 rule applications. Total rules 26 place count 238 transition count 252
Iterating global reduction 1 with 25 rules applied. Total rules applied 51 place count 238 transition count 252
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 62 place count 227 transition count 241
Iterating global reduction 1 with 11 rules applied. Total rules applied 73 place count 227 transition count 241
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 82 place count 227 transition count 232
Applied a total of 82 rules in 93 ms. Remains 227 /264 variables (removed 37) and now considering 232/277 (removed 45) transitions.
// Phase 1: matrix 232 rows 227 cols
[2022-05-16 17:38:41] [INFO ] Computed 13 place invariants in 34 ms
[2022-05-16 17:38:42] [INFO ] Implicit Places using invariants in 383 ms returned []
// Phase 1: matrix 232 rows 227 cols
[2022-05-16 17:38:42] [INFO ] Computed 13 place invariants in 12 ms
[2022-05-16 17:38:42] [INFO ] Implicit Places using invariants and state equation in 438 ms returned []
Implicit Place search using SMT with State Equation took 867 ms to find 0 implicit places.
// Phase 1: matrix 232 rows 227 cols
[2022-05-16 17:38:42] [INFO ] Computed 13 place invariants in 3 ms
[2022-05-16 17:38:43] [INFO ] Dead Transitions using invariants and state equation in 319 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 227/264 places, 232/277 transitions.
Finished structural reductions, in 1 iterations. Remains : 227/264 places, 232/277 transitions.
Support contains 22 out of 227 places after structural reductions.
[2022-05-16 17:38:43] [INFO ] Flatten gal took : 76 ms
[2022-05-16 17:38:43] [INFO ] Flatten gal took : 31 ms
[2022-05-16 17:38:43] [INFO ] Input system was already deterministic with 232 transitions.
Incomplete random walk after 10000 steps, including 91 resets, run finished after 686 ms. (steps per millisecond=14 ) properties (out of 12) seen :9
Incomplete Best-First random walk after 10001 steps, including 13 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 12 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 3) seen :1
Running SMT prover for 2 properties.
// Phase 1: matrix 232 rows 227 cols
[2022-05-16 17:38:44] [INFO ] Computed 13 place invariants in 3 ms
[2022-05-16 17:38:44] [INFO ] After 121ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2022-05-16 17:38:44] [INFO ] [Nat]Absence check using 0 positive and 13 generalized place invariants in 8 ms returned sat
[2022-05-16 17:38:44] [INFO ] After 124ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :1
[2022-05-16 17:38:44] [INFO ] After 162ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :1
Attempting to minimize the solution found.
Minimization took 24 ms.
[2022-05-16 17:38:44] [INFO ] After 301ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :1
Fused 2 Parikh solutions to 1 different solutions.
Finished Parikh walk after 58 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=29 )
Parikh walk visited 1 properties in 4 ms.
FORMULA GPUForwardProgress-PT-12b-LTLCardinality-12 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
FORMULA GPUForwardProgress-PT-12b-LTLCardinality-04 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 1 atomic propositions for a total of 6 simplifications.
Computed a total of 43 stabilizing places and 43 stable transitions
Graph (complete) has 349 edges and 227 vertex of which 211 are kept as prefixes of interest. Removing 16 places using SCC suffix rule.10 ms
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((F(p0)||G(p1)))))'
Support contains 4 out of 227 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 227/227 places, 232/232 transitions.
Graph (trivial) has 184 edges and 227 vertex of which 6 / 227 are part of one of the 1 SCC in 4 ms
Free SCC test removed 5 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Graph (complete) has 343 edges and 222 vertex of which 206 are kept as prefixes of interest. Removing 16 places using SCC suffix rule.2 ms
Discarding 16 places :
Also discarding 3 output transitions
Drop transitions removed 3 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 98 transitions
Trivial Post-agglo rules discarded 98 transitions
Performed 98 trivial Post agglomeration. Transition count delta: 98
Iterating post reduction 0 with 98 rules applied. Total rules applied 100 place count 205 transition count 124
Reduce places removed 98 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 1 with 104 rules applied. Total rules applied 204 place count 107 transition count 118
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 207 place count 104 transition count 118
Performed 28 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 28 Pre rules applied. Total rules applied 207 place count 104 transition count 90
Deduced a syphon composed of 28 places in 0 ms
Reduce places removed 28 places and 0 transitions.
Iterating global reduction 3 with 56 rules applied. Total rules applied 263 place count 76 transition count 90
Discarding 11 places :
Symmetric choice reduction at 3 with 11 rule applications. Total rules 274 place count 65 transition count 79
Iterating global reduction 3 with 11 rules applied. Total rules applied 285 place count 65 transition count 79
Performed 38 Post agglomeration using F-continuation condition.Transition count delta: 38
Deduced a syphon composed of 38 places in 0 ms
Reduce places removed 38 places and 0 transitions.
Iterating global reduction 3 with 76 rules applied. Total rules applied 361 place count 27 transition count 41
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 362 place count 27 transition count 40
Discarding 9 places :
Symmetric choice reduction at 4 with 9 rule applications. Total rules 371 place count 18 transition count 23
Iterating global reduction 4 with 9 rules applied. Total rules applied 380 place count 18 transition count 23
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 382 place count 17 transition count 22
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 383 place count 16 transition count 21
Applied a total of 383 rules in 61 ms. Remains 16 /227 variables (removed 211) and now considering 21/232 (removed 211) transitions.
// Phase 1: matrix 21 rows 16 cols
[2022-05-16 17:38:45] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-16 17:38:45] [INFO ] Implicit Places using invariants in 45 ms returned []
// Phase 1: matrix 21 rows 16 cols
[2022-05-16 17:38:45] [INFO ] Computed 0 place invariants in 1 ms
[2022-05-16 17:38:45] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-16 17:38:45] [INFO ] Implicit Places using invariants and state equation in 42 ms returned []
Implicit Place search using SMT with State Equation took 89 ms to find 0 implicit places.
[2022-05-16 17:38:45] [INFO ] Redundant transitions in 12 ms returned []
// Phase 1: matrix 21 rows 16 cols
[2022-05-16 17:38:45] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-16 17:38:45] [INFO ] Dead Transitions using invariants and state equation in 28 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 16/227 places, 21/232 transitions.
Finished structural reductions, in 1 iterations. Remains : 16/227 places, 21/232 transitions.
Stuttering acceptance computed with spot in 246 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : GPUForwardProgress-PT-12b-LTLCardinality-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}], [{ cond=(AND p1 (NOT p0)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(OR (EQ s3 0) (EQ s6 1)), p0:(OR (EQ s11 0) (EQ s8 1))], 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 5790 reset in 438 ms.
Product exploration explored 100000 steps with 5714 reset in 236 ms.
Computed a total of 2 stabilizing places and 2 stable transitions
Computed a total of 2 stabilizing places and 2 stable transitions
Knowledge obtained : [(AND p1 p0), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND p1 (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND p1 (NOT p0)))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 199 ms. Reduced automaton from 2 states, 4 edges and 2 AP to 2 states, 4 edges and 2 AP.
Stuttering acceptance computed with spot in 74 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Finished random walk after 46 steps, including 3 resets, run visited all 2 properties in 3 ms. (steps per millisecond=15 )
Knowledge obtained : [(AND p1 p0), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND p1 (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND p1 (NOT p0)))))]
False Knowledge obtained : [(F (AND (NOT p0) (NOT p1))), (F (AND (NOT p0) p1))]
Knowledge based reduction with 5 factoid took 242 ms. Reduced automaton from 2 states, 4 edges and 2 AP to 2 states, 4 edges and 2 AP.
Stuttering acceptance computed with spot in 69 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 74 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 4 out of 16 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 16/16 places, 21/21 transitions.
Applied a total of 0 rules in 2 ms. Remains 16 /16 variables (removed 0) and now considering 21/21 (removed 0) transitions.
// Phase 1: matrix 21 rows 16 cols
[2022-05-16 17:38:46] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-16 17:38:46] [INFO ] Implicit Places using invariants in 27 ms returned []
// Phase 1: matrix 21 rows 16 cols
[2022-05-16 17:38:46] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-16 17:38:46] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-16 17:38:46] [INFO ] Implicit Places using invariants and state equation in 45 ms returned []
Implicit Place search using SMT with State Equation took 74 ms to find 0 implicit places.
[2022-05-16 17:38:46] [INFO ] Redundant transitions in 14 ms returned []
// Phase 1: matrix 21 rows 16 cols
[2022-05-16 17:38:46] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-16 17:38:46] [INFO ] Dead Transitions using invariants and state equation in 31 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 16/16 places, 21/21 transitions.
Computed a total of 2 stabilizing places and 2 stable transitions
Computed a total of 2 stabilizing places and 2 stable transitions
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) p1))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 213 ms. Reduced automaton from 2 states, 4 edges and 2 AP to 2 states, 4 edges and 2 AP.
Stuttering acceptance computed with spot in 78 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Finished random walk after 614 steps, including 34 resets, run visited all 2 properties in 11 ms. (steps per millisecond=55 )
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) p1))))]
False Knowledge obtained : [(F (AND (NOT p0) (NOT p1))), (F (AND (NOT p0) p1))]
Knowledge based reduction with 5 factoid took 268 ms. Reduced automaton from 2 states, 4 edges and 2 AP to 2 states, 4 edges and 2 AP.
Stuttering acceptance computed with spot in 87 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 132 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 86 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 5762 reset in 264 ms.
Product exploration explored 100000 steps with 5802 reset in 470 ms.
Built C files in :
/tmp/ltsmin17651579894837341233
[2022-05-16 17:38:48] [INFO ] Computing symmetric may disable matrix : 21 transitions.
[2022-05-16 17:38:48] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 17:38:48] [INFO ] Computing symmetric may enable matrix : 21 transitions.
[2022-05-16 17:38:48] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 17:38:48] [INFO ] Computing Do-Not-Accords matrix : 21 transitions.
[2022-05-16 17:38:48] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 17:38:48] [INFO ] Built C files in 19ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17651579894837341233
Running compilation step : cd /tmp/ltsmin17651579894837341233;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 322 ms.
Running link step : cd /tmp/ltsmin17651579894837341233;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 47 ms.
Running LTSmin : cd /tmp/ltsmin17651579894837341233;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased11996016997232845723.hoa' '--buchi-type=spotba'
LTSmin run took 695 ms.
FORMULA GPUForwardProgress-PT-12b-LTLCardinality-00 TRUE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property GPUForwardProgress-PT-12b-LTLCardinality-00 finished in 4787 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 227 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 227/227 places, 232/232 transitions.
Graph (trivial) has 191 edges and 227 vertex of which 6 / 227 are part of one of the 1 SCC in 5 ms
Free SCC test removed 5 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 108 transitions
Trivial Post-agglo rules discarded 108 transitions
Performed 108 trivial Post agglomeration. Transition count delta: 108
Iterating post reduction 0 with 108 rules applied. Total rules applied 109 place count 221 transition count 117
Reduce places removed 108 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 111 rules applied. Total rules applied 220 place count 113 transition count 114
Performed 28 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 28 Pre rules applied. Total rules applied 220 place count 113 transition count 86
Deduced a syphon composed of 28 places in 0 ms
Reduce places removed 28 places and 0 transitions.
Iterating global reduction 2 with 56 rules applied. Total rules applied 276 place count 85 transition count 86
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 277 place count 84 transition count 85
Iterating global reduction 2 with 1 rules applied. Total rules applied 278 place count 84 transition count 85
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 278 place count 84 transition count 84
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 280 place count 83 transition count 84
Performed 36 Post agglomeration using F-continuation condition.Transition count delta: 36
Deduced a syphon composed of 36 places in 0 ms
Reduce places removed 36 places and 0 transitions.
Iterating global reduction 2 with 72 rules applied. Total rules applied 352 place count 47 transition count 48
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 353 place count 47 transition count 47
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 354 place count 46 transition count 46
Iterating global reduction 3 with 1 rules applied. Total rules applied 355 place count 46 transition count 46
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -9
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 359 place count 44 transition count 55
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 360 place count 44 transition count 55
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 361 place count 43 transition count 54
Applied a total of 361 rules in 56 ms. Remains 43 /227 variables (removed 184) and now considering 54/232 (removed 178) transitions.
[2022-05-16 17:38:49] [INFO ] Flow matrix only has 43 transitions (discarded 11 similar events)
// Phase 1: matrix 43 rows 43 cols
[2022-05-16 17:38:49] [INFO ] Computed 13 place invariants in 1 ms
[2022-05-16 17:38:49] [INFO ] Implicit Places using invariants in 81 ms returned []
[2022-05-16 17:38:49] [INFO ] Flow matrix only has 43 transitions (discarded 11 similar events)
// Phase 1: matrix 43 rows 43 cols
[2022-05-16 17:38:49] [INFO ] Computed 13 place invariants in 1 ms
[2022-05-16 17:38:49] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-16 17:38:49] [INFO ] Implicit Places using invariants and state equation in 102 ms returned []
Implicit Place search using SMT with State Equation took 185 ms to find 0 implicit places.
[2022-05-16 17:38:50] [INFO ] Redundant transitions in 2 ms returned []
[2022-05-16 17:38:50] [INFO ] Flow matrix only has 43 transitions (discarded 11 similar events)
// Phase 1: matrix 43 rows 43 cols
[2022-05-16 17:38:50] [INFO ] Computed 13 place invariants in 18 ms
[2022-05-16 17:38:50] [INFO ] Dead Transitions using invariants and state equation in 81 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 43/227 places, 54/232 transitions.
Finished structural reductions, in 1 iterations. Remains : 43/227 places, 54/232 transitions.
Stuttering acceptance computed with spot in 35 ms :[(NOT p0)]
Running random walk in product with property : GPUForwardProgress-PT-12b-LTLCardinality-01 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (NEQ s33 0) (NEQ s9 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 1 steps with 0 reset in 0 ms.
FORMULA GPUForwardProgress-PT-12b-LTLCardinality-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPUForwardProgress-PT-12b-LTLCardinality-01 finished in 383 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(X(p0))&&F(p1))))'
Support contains 4 out of 227 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 227/227 places, 232/232 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 222 transition count 227
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 222 transition count 227
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 13 place count 219 transition count 224
Iterating global reduction 0 with 3 rules applied. Total rules applied 16 place count 219 transition count 224
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 18 place count 219 transition count 222
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 19 place count 218 transition count 221
Iterating global reduction 1 with 1 rules applied. Total rules applied 20 place count 218 transition count 221
Applied a total of 20 rules in 38 ms. Remains 218 /227 variables (removed 9) and now considering 221/232 (removed 11) transitions.
// Phase 1: matrix 221 rows 218 cols
[2022-05-16 17:38:50] [INFO ] Computed 13 place invariants in 2 ms
[2022-05-16 17:38:50] [INFO ] Implicit Places using invariants in 125 ms returned []
// Phase 1: matrix 221 rows 218 cols
[2022-05-16 17:38:50] [INFO ] Computed 13 place invariants in 2 ms
[2022-05-16 17:38:50] [INFO ] Implicit Places using invariants and state equation in 246 ms returned []
Implicit Place search using SMT with State Equation took 382 ms to find 0 implicit places.
// Phase 1: matrix 221 rows 218 cols
[2022-05-16 17:38:50] [INFO ] Computed 13 place invariants in 4 ms
[2022-05-16 17:38:50] [INFO ] Dead Transitions using invariants and state equation in 220 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 218/227 places, 221/232 transitions.
Finished structural reductions, in 1 iterations. Remains : 218/227 places, 221/232 transitions.
Stuttering acceptance computed with spot in 220 ms :[(NOT p0), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), true, (OR (NOT p1) (NOT p0))]
Running random walk in product with property : GPUForwardProgress-PT-12b-LTLCardinality-02 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 3}], [{ cond=p1, acceptance={} source=1 dest: 0}, { cond=(NOT p1), acceptance={} source=1 dest: 2}], [{ cond=(AND p1 p0), acceptance={0} source=2 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={0} source=2 dest: 2}, { cond=(NOT p0), acceptance={0} source=2 dest: 3}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=true, acceptance={} source=4 dest: 1}]], initial=4, aps=[p0:(OR (EQ s161 0) (EQ s172 1)), p1:(AND (EQ s29 0) (EQ s174 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, 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 56 steps with 0 reset in 1 ms.
FORMULA GPUForwardProgress-PT-12b-LTLCardinality-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPUForwardProgress-PT-12b-LTLCardinality-02 finished in 886 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 2 out of 227 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 227/227 places, 232/232 transitions.
Graph (trivial) has 192 edges and 227 vertex of which 6 / 227 are part of one of the 1 SCC in 1 ms
Free SCC test removed 5 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Graph (complete) has 343 edges and 222 vertex of which 206 are kept as prefixes of interest. Removing 16 places using SCC suffix rule.2 ms
Discarding 16 places :
Also discarding 3 output transitions
Drop transitions removed 3 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 107 transitions
Trivial Post-agglo rules discarded 107 transitions
Performed 107 trivial Post agglomeration. Transition count delta: 107
Iterating post reduction 0 with 107 rules applied. Total rules applied 109 place count 205 transition count 115
Reduce places removed 107 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 110 rules applied. Total rules applied 219 place count 98 transition count 112
Performed 27 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 27 Pre rules applied. Total rules applied 219 place count 98 transition count 85
Deduced a syphon composed of 27 places in 0 ms
Reduce places removed 27 places and 0 transitions.
Iterating global reduction 2 with 54 rules applied. Total rules applied 273 place count 71 transition count 85
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 285 place count 59 transition count 73
Iterating global reduction 2 with 12 rules applied. Total rules applied 297 place count 59 transition count 73
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 297 place count 59 transition count 72
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 299 place count 58 transition count 72
Performed 36 Post agglomeration using F-continuation condition.Transition count delta: 36
Deduced a syphon composed of 36 places in 0 ms
Reduce places removed 36 places and 0 transitions.
Iterating global reduction 2 with 72 rules applied. Total rules applied 371 place count 22 transition count 36
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 372 place count 22 transition count 35
Discarding 11 places :
Symmetric choice reduction at 3 with 11 rule applications. Total rules 383 place count 11 transition count 14
Iterating global reduction 3 with 11 rules applied. Total rules applied 394 place count 11 transition count 14
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 396 place count 10 transition count 13
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 397 place count 9 transition count 12
Applied a total of 397 rules in 48 ms. Remains 9 /227 variables (removed 218) and now considering 12/232 (removed 220) transitions.
// Phase 1: matrix 12 rows 9 cols
[2022-05-16 17:38:51] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-16 17:38:51] [INFO ] Implicit Places using invariants in 24 ms returned []
// Phase 1: matrix 12 rows 9 cols
[2022-05-16 17:38:51] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-16 17:38:51] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-16 17:38:51] [INFO ] Implicit Places using invariants and state equation in 28 ms returned []
Implicit Place search using SMT with State Equation took 54 ms to find 0 implicit places.
[2022-05-16 17:38:51] [INFO ] Redundant transitions in 12 ms returned []
// Phase 1: matrix 12 rows 9 cols
[2022-05-16 17:38:51] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-16 17:38:51] [INFO ] Dead Transitions using invariants and state equation in 25 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 9/227 places, 12/232 transitions.
Finished structural reductions, in 1 iterations. Remains : 9/227 places, 12/232 transitions.
Stuttering acceptance computed with spot in 43 ms :[(NOT p0)]
Running random walk in product with property : GPUForwardProgress-PT-12b-LTLCardinality-07 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (NEQ s1 0) (NEQ s4 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]]
Stuttering criterion allowed to conclude after 3 steps with 1 reset in 0 ms.
FORMULA GPUForwardProgress-PT-12b-LTLCardinality-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPUForwardProgress-PT-12b-LTLCardinality-07 finished in 206 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((X(p0)&&p1))))'
Support contains 4 out of 227 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 227/227 places, 232/232 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 223 transition count 228
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 223 transition count 228
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 11 place count 220 transition count 225
Iterating global reduction 0 with 3 rules applied. Total rules applied 14 place count 220 transition count 225
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 16 place count 220 transition count 223
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 17 place count 219 transition count 222
Iterating global reduction 1 with 1 rules applied. Total rules applied 18 place count 219 transition count 222
Applied a total of 18 rules in 34 ms. Remains 219 /227 variables (removed 8) and now considering 222/232 (removed 10) transitions.
// Phase 1: matrix 222 rows 219 cols
[2022-05-16 17:38:51] [INFO ] Computed 13 place invariants in 1 ms
[2022-05-16 17:38:51] [INFO ] Implicit Places using invariants in 105 ms returned []
// Phase 1: matrix 222 rows 219 cols
[2022-05-16 17:38:51] [INFO ] Computed 13 place invariants in 1 ms
[2022-05-16 17:38:51] [INFO ] Implicit Places using invariants and state equation in 247 ms returned []
Implicit Place search using SMT with State Equation took 372 ms to find 0 implicit places.
// Phase 1: matrix 222 rows 219 cols
[2022-05-16 17:38:51] [INFO ] Computed 13 place invariants in 2 ms
[2022-05-16 17:38:51] [INFO ] Dead Transitions using invariants and state equation in 221 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 219/227 places, 222/232 transitions.
Finished structural reductions, in 1 iterations. Remains : 219/227 places, 222/232 transitions.
Stuttering acceptance computed with spot in 165 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p0)]
Running random walk in product with property : GPUForwardProgress-PT-12b-LTLCardinality-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 1}, { cond=p1, acceptance={} source=0 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}, { cond=p1, acceptance={0} source=1 dest: 2}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=2 dest: 1}, { cond=(AND p1 (NOT p0)), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p1:(OR (EQ s216 0) (EQ s66 1)), p0:(OR (EQ s61 0) (EQ s86 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 33357 reset in 390 ms.
Product exploration explored 100000 steps with 33412 reset in 400 ms.
Computed a total of 40 stabilizing places and 40 stable transitions
Graph (complete) has 339 edges and 219 vertex of which 203 are kept as prefixes of interest. Removing 16 places using SCC suffix rule.9 ms
Computed a total of 40 stabilizing places and 40 stable transitions
Knowledge obtained : [(AND p1 p0), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND p1 (NOT p0)))), (X p1), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND p1 (NOT p0))))), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 420 ms. Reduced automaton from 3 states, 7 edges and 2 AP to 3 states, 7 edges and 2 AP.
Stuttering acceptance computed with spot in 131 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p0)]
Incomplete random walk after 10000 steps, including 90 resets, run finished after 191 ms. (steps per millisecond=52 ) properties (out of 3) seen :1
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 13 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 222 rows 219 cols
[2022-05-16 17:38:53] [INFO ] Computed 13 place invariants in 4 ms
[2022-05-16 17:38:53] [INFO ] After 108ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2022-05-16 17:38:53] [INFO ] [Nat]Absence check using 0 positive and 13 generalized place invariants in 10 ms returned sat
[2022-05-16 17:38:54] [INFO ] After 177ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2022-05-16 17:38:54] [INFO ] After 242ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 54 ms.
[2022-05-16 17:38:54] [INFO ] After 396ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Finished Parikh walk after 60 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=60 )
Parikh walk visited 2 properties in 5 ms.
Knowledge obtained : [(AND p1 p0), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND p1 (NOT p0)))), (X p1), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND p1 (NOT p0))))), (X (X p1))]
False Knowledge obtained : [(F (NOT p1)), (F (AND (NOT p0) p1)), (F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 7 factoid took 493 ms. Reduced automaton from 3 states, 7 edges and 2 AP to 3 states, 7 edges and 2 AP.
Stuttering acceptance computed with spot in 145 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p0)]
Stuttering acceptance computed with spot in 137 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p0)]
Support contains 4 out of 219 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 219/219 places, 222/222 transitions.
Applied a total of 0 rules in 8 ms. Remains 219 /219 variables (removed 0) and now considering 222/222 (removed 0) transitions.
// Phase 1: matrix 222 rows 219 cols
[2022-05-16 17:38:55] [INFO ] Computed 13 place invariants in 2 ms
[2022-05-16 17:38:55] [INFO ] Implicit Places using invariants in 132 ms returned []
// Phase 1: matrix 222 rows 219 cols
[2022-05-16 17:38:55] [INFO ] Computed 13 place invariants in 3 ms
[2022-05-16 17:38:55] [INFO ] Implicit Places using invariants and state equation in 279 ms returned []
Implicit Place search using SMT with State Equation took 418 ms to find 0 implicit places.
// Phase 1: matrix 222 rows 219 cols
[2022-05-16 17:38:55] [INFO ] Computed 13 place invariants in 1 ms
[2022-05-16 17:38:55] [INFO ] Dead Transitions using invariants and state equation in 206 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 219/219 places, 222/222 transitions.
Computed a total of 40 stabilizing places and 40 stable transitions
Graph (complete) has 339 edges and 219 vertex of which 203 are kept as prefixes of interest. Removing 16 places using SCC suffix rule.5 ms
Computed a total of 40 stabilizing places and 40 stable transitions
Knowledge obtained : [(AND p1 p0), (X (NOT (AND (NOT p0) (NOT p1)))), (X p1), (X (NOT (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p1)), (X (X (NOT (AND (NOT p0) p1))))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 304 ms. Reduced automaton from 3 states, 7 edges and 2 AP to 3 states, 7 edges and 2 AP.
Stuttering acceptance computed with spot in 119 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p0)]
Incomplete random walk after 10000 steps, including 91 resets, run finished after 140 ms. (steps per millisecond=71 ) properties (out of 3) seen :1
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 14 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 222 rows 219 cols
[2022-05-16 17:38:56] [INFO ] Computed 13 place invariants in 2 ms
[2022-05-16 17:38:56] [INFO ] After 91ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2022-05-16 17:38:56] [INFO ] [Nat]Absence check using 0 positive and 13 generalized place invariants in 12 ms returned sat
[2022-05-16 17:38:56] [INFO ] After 175ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2022-05-16 17:38:56] [INFO ] After 230ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 35 ms.
[2022-05-16 17:38:56] [INFO ] After 386ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Finished Parikh walk after 62 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=62 )
Parikh walk visited 2 properties in 4 ms.
Knowledge obtained : [(AND p1 p0), (X (NOT (AND (NOT p0) (NOT p1)))), (X p1), (X (NOT (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p1)), (X (X (NOT (AND (NOT p0) p1))))]
False Knowledge obtained : [(F (NOT p1)), (F (AND (NOT p0) p1)), (F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 7 factoid took 362 ms. Reduced automaton from 3 states, 7 edges and 2 AP to 3 states, 7 edges and 2 AP.
Stuttering acceptance computed with spot in 122 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p0)]
Stuttering acceptance computed with spot in 106 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p0)]
Stuttering acceptance computed with spot in 113 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p0)]
Product exploration explored 100000 steps with 33257 reset in 385 ms.
Product exploration explored 100000 steps with 33284 reset in 345 ms.
Built C files in :
/tmp/ltsmin11995994322342737305
[2022-05-16 17:38:58] [INFO ] Built C files in 16ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11995994322342737305
Running compilation step : cd /tmp/ltsmin11995994322342737305;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 489 ms.
Running link step : cd /tmp/ltsmin11995994322342737305;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 27 ms.
Running LTSmin : cd /tmp/ltsmin11995994322342737305;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased18137994595458861688.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 4 out of 219 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 219/219 places, 222/222 transitions.
Applied a total of 0 rules in 4 ms. Remains 219 /219 variables (removed 0) and now considering 222/222 (removed 0) transitions.
// Phase 1: matrix 222 rows 219 cols
[2022-05-16 17:39:13] [INFO ] Computed 13 place invariants in 2 ms
[2022-05-16 17:39:13] [INFO ] Implicit Places using invariants in 108 ms returned []
// Phase 1: matrix 222 rows 219 cols
[2022-05-16 17:39:13] [INFO ] Computed 13 place invariants in 1 ms
[2022-05-16 17:39:13] [INFO ] Implicit Places using invariants and state equation in 199 ms returned []
Implicit Place search using SMT with State Equation took 309 ms to find 0 implicit places.
// Phase 1: matrix 222 rows 219 cols
[2022-05-16 17:39:13] [INFO ] Computed 13 place invariants in 2 ms
[2022-05-16 17:39:14] [INFO ] Dead Transitions using invariants and state equation in 164 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 219/219 places, 222/222 transitions.
Built C files in :
/tmp/ltsmin6480876314897261407
[2022-05-16 17:39:14] [INFO ] Built C files in 8ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6480876314897261407
Running compilation step : cd /tmp/ltsmin6480876314897261407;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 504 ms.
Running link step : cd /tmp/ltsmin6480876314897261407;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 43 ms.
Running LTSmin : cd /tmp/ltsmin6480876314897261407;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased14436781113089480533.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2022-05-16 17:39:29] [INFO ] Flatten gal took : 20 ms
[2022-05-16 17:39:29] [INFO ] Flatten gal took : 17 ms
[2022-05-16 17:39:29] [INFO ] Time to serialize gal into /tmp/LTL10386646393808427278.gal : 6 ms
[2022-05-16 17:39:29] [INFO ] Time to serialize properties into /tmp/LTL17014943090581615643.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL10386646393808427278.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL17014943090581615643.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL1038664...268
Read 1 LTL properties
Checking formula 0 : !((G(F((X("((p70==0)||(p97==1))"))&&("((p259==0)||(p75==1))")))))
Formula 0 simplified : !GF("((p259==0)||(p75==1))" & X"((p70==0)||(p97==1))")
Detected timeout of ITS tools.
[2022-05-16 17:39:44] [INFO ] Flatten gal took : 25 ms
[2022-05-16 17:39:44] [INFO ] Applying decomposition
[2022-05-16 17:39:44] [INFO ] Flatten gal took : 24 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph7735958793865198970.txt' '-o' '/tmp/graph7735958793865198970.bin' '-w' '/tmp/graph7735958793865198970.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph7735958793865198970.bin' '-l' '-1' '-v' '-w' '/tmp/graph7735958793865198970.weights' '-q' '0' '-e' '0.001'
[2022-05-16 17:39:44] [INFO ] Decomposing Gal with order
[2022-05-16 17:39:44] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-16 17:39:44] [INFO ] Removed a total of 61 redundant transitions.
[2022-05-16 17:39:44] [INFO ] Flatten gal took : 122 ms
[2022-05-16 17:39:45] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 9 ms.
[2022-05-16 17:39:45] [INFO ] Time to serialize gal into /tmp/LTL13741189769545780641.gal : 14 ms
[2022-05-16 17:39:45] [INFO ] Time to serialize properties into /tmp/LTL2760734863391442482.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL13741189769545780641.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL2760734863391442482.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL1374118...246
Read 1 LTL properties
Checking formula 0 : !((G(F((X("((i3.i2.u31.p70==0)||(i4.i1.u35.p97==1))"))&&("((i12.u89.p259==0)||(i3.i0.u28.p75==1))")))))
Formula 0 simplified : !GF("((i12.u89.p259==0)||(i3.i0.u28.p75==1))" & X"((i3.i2.u31.p70==0)||(i4.i1.u35.p97==1))")
Reverse transition relation is NOT exact ! Due to transitions t2, t206, i0.t201, i0.i1.u10.t194, i1.t188, i1.i2.t178, i2.t171, i2.i0.t164, i3.i2.t147, i3.i...515
Computing Next relation with stutter on 1.05879e+06 deadlock states
105 unique states visited
105 strongly connected components in search stack
106 transitions explored
105 items max in DFS search stack
144 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,1.47842,48220,1,0,67588,319,2816,117101,153,962,116202
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA GPUForwardProgress-PT-12b-LTLCardinality-11 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Treatment of property GPUForwardProgress-PT-12b-LTLCardinality-11 finished in 55458 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(X(p0)))'
Support contains 1 out of 227 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 227/227 places, 232/232 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 221 transition count 226
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 221 transition count 226
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 16 place count 217 transition count 222
Iterating global reduction 0 with 4 rules applied. Total rules applied 20 place count 217 transition count 222
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 23 place count 217 transition count 219
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 24 place count 216 transition count 218
Iterating global reduction 1 with 1 rules applied. Total rules applied 25 place count 216 transition count 218
Applied a total of 25 rules in 13 ms. Remains 216 /227 variables (removed 11) and now considering 218/232 (removed 14) transitions.
// Phase 1: matrix 218 rows 216 cols
[2022-05-16 17:39:46] [INFO ] Computed 13 place invariants in 2 ms
[2022-05-16 17:39:46] [INFO ] Implicit Places using invariants in 140 ms returned []
// Phase 1: matrix 218 rows 216 cols
[2022-05-16 17:39:46] [INFO ] Computed 13 place invariants in 3 ms
[2022-05-16 17:39:47] [INFO ] Implicit Places using invariants and state equation in 326 ms returned []
Implicit Place search using SMT with State Equation took 469 ms to find 0 implicit places.
// Phase 1: matrix 218 rows 216 cols
[2022-05-16 17:39:47] [INFO ] Computed 13 place invariants in 1 ms
[2022-05-16 17:39:47] [INFO ] Dead Transitions using invariants and state equation in 244 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 216/227 places, 218/232 transitions.
Finished structural reductions, in 1 iterations. Remains : 216/227 places, 218/232 transitions.
Stuttering acceptance computed with spot in 91 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : GPUForwardProgress-PT-12b-LTLCardinality-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(EQ s103 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 30 steps with 0 reset in 1 ms.
FORMULA GPUForwardProgress-PT-12b-LTLCardinality-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPUForwardProgress-PT-12b-LTLCardinality-14 finished in 835 ms.
All properties solved by simple procedures.
Total runtime 66308 ms.

BK_STOP 1652722787664

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

+ export LANG=C
+ LANG=C
+ 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
+ export PYTHONPATH=/usr/lib/python3.9/site-packages/
+ PYTHONPATH=/usr/lib/python3.9/site-packages/
+ export LD_LIBRARY_PATH=/usr/local/lib:
+ LD_LIBRARY_PATH=/usr/local/lib:
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202205111006.jar
+ VERSION=202205111006
+ echo 'Running Version 202205111006'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data @none -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=@none -Xss128m -Xms40m -Xmx8192m

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="GPUForwardProgress-PT-12b"
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 GPUForwardProgress-PT-12b, 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 r096-smll-165260576100339"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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