Execution Chart

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

Trace from the execution

Formatting '/mnt/tpsp/fkordon/mcc2022-input.r186-tajo-165281572600683.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2022-input.qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
.......................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itstools
Input is ResAllocation-PT-R020C002, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r186-tajo-165281572600683
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 292K
-rw-r--r-- 1 mcc users 6.3K Apr 30 02:44 CTLCardinality.txt
-rw-r--r-- 1 mcc users 63K Apr 30 02:44 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.6K Apr 30 02:44 CTLFireability.txt
-rw-r--r-- 1 mcc users 34K Apr 30 02:44 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:34 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.7K May 10 09:34 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.7K May 9 08:39 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K May 9 08:39 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K May 9 08:39 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 9 08:39 LTLFireability.xml
-rw-r--r-- 1 mcc users 1.8K May 9 08:39 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K May 9 08:39 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 10 09:34 equiv_col
-rw-r--r-- 1 mcc users 9 May 10 09:34 instance
-rw-r--r-- 1 mcc users 6 May 10 09:34 iscolored
-rw-r--r-- 1 mcc users 85K 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 ResAllocation-PT-R020C002-LTLCardinality-00
FORMULA_NAME ResAllocation-PT-R020C002-LTLCardinality-01
FORMULA_NAME ResAllocation-PT-R020C002-LTLCardinality-02
FORMULA_NAME ResAllocation-PT-R020C002-LTLCardinality-03
FORMULA_NAME ResAllocation-PT-R020C002-LTLCardinality-04
FORMULA_NAME ResAllocation-PT-R020C002-LTLCardinality-05
FORMULA_NAME ResAllocation-PT-R020C002-LTLCardinality-06
FORMULA_NAME ResAllocation-PT-R020C002-LTLCardinality-07
FORMULA_NAME ResAllocation-PT-R020C002-LTLCardinality-08
FORMULA_NAME ResAllocation-PT-R020C002-LTLCardinality-09
FORMULA_NAME ResAllocation-PT-R020C002-LTLCardinality-10
FORMULA_NAME ResAllocation-PT-R020C002-LTLCardinality-11
FORMULA_NAME ResAllocation-PT-R020C002-LTLCardinality-12
FORMULA_NAME ResAllocation-PT-R020C002-LTLCardinality-13
FORMULA_NAME ResAllocation-PT-R020C002-LTLCardinality-14
FORMULA_NAME ResAllocation-PT-R020C002-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1653088632508

Running Version 202205111006
[2022-05-20 23:17:13] [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-20 23:17:13] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-20 23:17:14] [INFO ] Load time of PNML (sax parser for PT used): 78 ms
[2022-05-20 23:17:14] [INFO ] Transformed 80 places.
[2022-05-20 23:17:14] [INFO ] Transformed 42 transitions.
[2022-05-20 23:17:14] [INFO ] Parsed PT model containing 80 places and 42 transitions in 204 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 10 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
FORMULA ResAllocation-PT-R020C002-LTLCardinality-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ResAllocation-PT-R020C002-LTLCardinality-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ResAllocation-PT-R020C002-LTLCardinality-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ResAllocation-PT-R020C002-LTLCardinality-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ResAllocation-PT-R020C002-LTLCardinality-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 36 out of 80 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 80/80 places, 42/42 transitions.
Applied a total of 0 rules in 11 ms. Remains 80 /80 variables (removed 0) and now considering 42/42 (removed 0) transitions.
// Phase 1: matrix 42 rows 80 cols
[2022-05-20 23:17:14] [INFO ] Computed 40 place invariants in 14 ms
[2022-05-20 23:17:14] [INFO ] Implicit Places using invariants in 178 ms returned [51, 53, 55, 61, 63, 65, 75, 77]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 208 ms to find 8 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 72/80 places, 42/42 transitions.
Applied a total of 0 rules in 1 ms. Remains 72 /72 variables (removed 0) and now considering 42/42 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 72/80 places, 42/42 transitions.
Support contains 36 out of 72 places after structural reductions.
[2022-05-20 23:17:14] [INFO ] Flatten gal took : 27 ms
[2022-05-20 23:17:14] [INFO ] Flatten gal took : 9 ms
[2022-05-20 23:17:14] [INFO ] Input system was already deterministic with 42 transitions.
Incomplete random walk after 10000 steps, including 86 resets, run finished after 759 ms. (steps per millisecond=13 ) properties (out of 24) seen :11
Incomplete Best-First random walk after 10000 steps, including 16 resets, run finished after 69 ms. (steps per millisecond=144 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 16 resets, run finished after 60 ms. (steps per millisecond=166 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 16 resets, run finished after 63 ms. (steps per millisecond=158 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 16 resets, run finished after 72 ms. (steps per millisecond=138 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 16 resets, run finished after 87 ms. (steps per millisecond=114 ) properties (out of 13) seen :1
Incomplete Best-First random walk after 10001 steps, including 13 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 62 ms. (steps per millisecond=161 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 110 ms. (steps per millisecond=90 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 16 resets, run finished after 81 ms. (steps per millisecond=123 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10000 steps, including 13 resets, run finished after 69 ms. (steps per millisecond=144 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 16 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 10 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 12) seen :1
Running SMT prover for 11 properties.
// Phase 1: matrix 42 rows 72 cols
[2022-05-20 23:17:16] [INFO ] Computed 32 place invariants in 1 ms
[2022-05-20 23:17:16] [INFO ] [Real]Absence check using 32 positive place invariants in 5 ms returned sat
[2022-05-20 23:17:16] [INFO ] After 92ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:10
[2022-05-20 23:17:16] [INFO ] [Nat]Absence check using 32 positive place invariants in 6 ms returned sat
[2022-05-20 23:17:16] [INFO ] After 28ms SMT Verify possible using state equation in natural domain returned unsat :8 sat :3
[2022-05-20 23:17:16] [INFO ] Deduced a trap composed of 4 places in 26 ms of which 3 ms to minimize.
[2022-05-20 23:17:16] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 32 ms
[2022-05-20 23:17:16] [INFO ] After 79ms SMT Verify possible using trap constraints in natural domain returned unsat :8 sat :3
Attempting to minimize the solution found.
Minimization took 16 ms.
[2022-05-20 23:17:16] [INFO ] After 162ms SMT Verify possible using all constraints in natural domain returned unsat :8 sat :3
Fused 11 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 5 ms.
Support contains 5 out of 72 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 72/72 places, 42/42 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 5 rules applied. Total rules applied 5 place count 69 transition count 40
Free-agglomeration rule applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 69 transition count 39
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 8 place count 67 transition count 39
Free-agglomeration rule applied 1 times.
Iterating global reduction 1 with 1 rules applied. Total rules applied 9 place count 67 transition count 38
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 10 place count 66 transition count 38
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 11 place count 66 transition count 37
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 14 place count 63 transition count 37
Free-agglomeration rule applied 1 times.
Iterating global reduction 3 with 1 rules applied. Total rules applied 15 place count 63 transition count 36
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 16 place count 62 transition count 36
Applied a total of 16 rules in 22 ms. Remains 62 /72 variables (removed 10) and now considering 36/42 (removed 6) transitions.
Finished structural reductions, in 1 iterations. Remains : 62/72 places, 36/42 transitions.
Incomplete random walk after 10000 steps, including 130 resets, run finished after 162 ms. (steps per millisecond=61 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 29 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 28 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 28 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 660798 steps, run timeout after 3001 ms. (steps per millisecond=220 ) properties seen :{}
Probabilistic random walk after 660798 steps, saw 120279 distinct states, run finished after 3006 ms. (steps per millisecond=219 ) properties seen :0
Running SMT prover for 3 properties.
// Phase 1: matrix 36 rows 62 cols
[2022-05-20 23:17:19] [INFO ] Computed 28 place invariants in 3 ms
[2022-05-20 23:17:19] [INFO ] [Real]Absence check using 28 positive place invariants in 6 ms returned sat
[2022-05-20 23:17:19] [INFO ] After 62ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2022-05-20 23:17:20] [INFO ] [Nat]Absence check using 28 positive place invariants in 5 ms returned sat
[2022-05-20 23:17:20] [INFO ] After 28ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2022-05-20 23:17:20] [INFO ] After 45ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 10 ms.
[2022-05-20 23:17:20] [INFO ] After 110ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Fused 3 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 5 ms.
Support contains 5 out of 62 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 62/62 places, 36/36 transitions.
Applied a total of 0 rules in 3 ms. Remains 62 /62 variables (removed 0) and now considering 36/36 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 62/62 places, 36/36 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 62/62 places, 36/36 transitions.
Applied a total of 0 rules in 3 ms. Remains 62 /62 variables (removed 0) and now considering 36/36 (removed 0) transitions.
// Phase 1: matrix 36 rows 62 cols
[2022-05-20 23:17:20] [INFO ] Computed 28 place invariants in 0 ms
[2022-05-20 23:17:20] [INFO ] Implicit Places using invariants in 69 ms returned [38, 40, 42, 49, 56, 58, 60]
Discarding 7 places :
Implicit Place search using SMT only with invariants took 70 ms to find 7 implicit places.
Starting structural reductions in SAFETY mode, iteration 1 : 55/62 places, 36/36 transitions.
Applied a total of 0 rules in 2 ms. Remains 55 /55 variables (removed 0) and now considering 36/36 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 55/62 places, 36/36 transitions.
Incomplete random walk after 10000 steps, including 129 resets, run finished after 230 ms. (steps per millisecond=43 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 28 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 27 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 27 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 703574 steps, run timeout after 3001 ms. (steps per millisecond=234 ) properties seen :{}
Probabilistic random walk after 703574 steps, saw 127531 distinct states, run finished after 3001 ms. (steps per millisecond=234 ) properties seen :0
Running SMT prover for 3 properties.
// Phase 1: matrix 36 rows 55 cols
[2022-05-20 23:17:23] [INFO ] Computed 21 place invariants in 0 ms
[2022-05-20 23:17:23] [INFO ] [Real]Absence check using 21 positive place invariants in 2 ms returned sat
[2022-05-20 23:17:23] [INFO ] After 29ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2022-05-20 23:17:23] [INFO ] [Nat]Absence check using 21 positive place invariants in 3 ms returned sat
[2022-05-20 23:17:23] [INFO ] After 19ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2022-05-20 23:17:23] [INFO ] After 30ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 13 ms.
[2022-05-20 23:17:23] [INFO ] After 73ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Fused 3 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 4 ms.
Support contains 5 out of 55 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 55/55 places, 36/36 transitions.
Applied a total of 0 rules in 3 ms. Remains 55 /55 variables (removed 0) and now considering 36/36 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 55/55 places, 36/36 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 55/55 places, 36/36 transitions.
Applied a total of 0 rules in 2 ms. Remains 55 /55 variables (removed 0) and now considering 36/36 (removed 0) transitions.
// Phase 1: matrix 36 rows 55 cols
[2022-05-20 23:17:23] [INFO ] Computed 21 place invariants in 1 ms
[2022-05-20 23:17:23] [INFO ] Implicit Places using invariants in 37 ms returned []
// Phase 1: matrix 36 rows 55 cols
[2022-05-20 23:17:23] [INFO ] Computed 21 place invariants in 0 ms
[2022-05-20 23:17:23] [INFO ] Implicit Places using invariants and state equation in 68 ms returned []
Implicit Place search using SMT with State Equation took 107 ms to find 0 implicit places.
[2022-05-20 23:17:23] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 36 rows 55 cols
[2022-05-20 23:17:23] [INFO ] Computed 21 place invariants in 1 ms
[2022-05-20 23:17:23] [INFO ] Dead Transitions using invariants and state equation in 31 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 55/55 places, 36/36 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 54 transition count 36
Free-agglomeration rule applied 2 times.
Iterating global reduction 1 with 2 rules applied. Total rules applied 3 place count 54 transition count 34
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 5 place count 52 transition count 34
Applied a total of 5 rules in 4 ms. Remains 52 /55 variables (removed 3) and now considering 34/36 (removed 2) transitions.
Running SMT prover for 3 properties.
// Phase 1: matrix 34 rows 52 cols
[2022-05-20 23:17:23] [INFO ] Computed 20 place invariants in 0 ms
[2022-05-20 23:17:23] [INFO ] [Real]Absence check using 20 positive place invariants in 2 ms returned sat
[2022-05-20 23:17:23] [INFO ] After 26ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2022-05-20 23:17:23] [INFO ] [Nat]Absence check using 20 positive place invariants in 2 ms returned sat
[2022-05-20 23:17:23] [INFO ] After 18ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2022-05-20 23:17:23] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 0 ms to minimize.
[2022-05-20 23:17:23] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 22 ms
[2022-05-20 23:17:23] [INFO ] After 62ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 7 ms.
[2022-05-20 23:17:23] [INFO ] After 104ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
[2022-05-20 23:17:23] [INFO ] Flatten gal took : 7 ms
[2022-05-20 23:17:23] [INFO ] Flatten gal took : 4 ms
[2022-05-20 23:17:23] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality1663692629588394618.gal : 2 ms
[2022-05-20 23:17:23] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality7739668442095888016.prop : 0 ms
Invoking ITS tools like this :cd /tmp/redAtoms16035228917802030528;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality1663692629588394618.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality7739668442095888016.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp...319
Loading property file /tmp/ReachabilityCardinality7739668442095888016.prop.
SDD proceeding with computation,3 properties remain. new max is 4
SDD size :1 after 4
SDD proceeding with computation,3 properties remain. new max is 8
SDD size :4 after 8
SDD proceeding with computation,3 properties remain. new max is 16
SDD size :8 after 32
SDD proceeding with computation,3 properties remain. new max is 32
SDD size :32 after 448
SDD proceeding with computation,3 properties remain. new max is 64
SDD size :448 after 14336
Reachability property AtomicPropp3 is true.
Reachability property AtomicPropp2 is true.
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :14336 after 33216
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :33216 after 81919
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :81919 after 210337
Reachability property AtomicPropp4 is true.
Found states matching all0 target predicate
Will report total states built up to this point. Computation was interrupted after 257 fixpoint passes
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst,458226,0.026719,4332,2,260,16,3609,6,0,245,3384,0
Total reachable state count : 458226

Verifying 3 reachability properties.
Reachability property AtomicPropp2 is true.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
AtomicPropp2,1,0.027139,4332,2,53,16,3609,7,0,254,3384,0
Reachability property AtomicPropp3 is true.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
AtomicPropp3,1,0.027437,4596,2,53,16,3609,8,0,254,3384,0
Reachability property AtomicPropp4 is true.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
AtomicPropp4,24574,0.027602,4596,2,172,16,3609,9,0,258,3384,0
FORMULA ResAllocation-PT-R020C002-LTLCardinality-06 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 8 atomic propositions for a total of 10 simplifications.
Initial state reduction rules removed 1 formulas.
FORMULA ResAllocation-PT-R020C002-LTLCardinality-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ResAllocation-PT-R020C002-LTLCardinality-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 0 stabilizing places and 0 stable transitions
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(X(X(G(p0)))))'
Support contains 4 out of 72 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 72/72 places, 42/42 transitions.
Applied a total of 0 rules in 1 ms. Remains 72 /72 variables (removed 0) and now considering 42/42 (removed 0) transitions.
// Phase 1: matrix 42 rows 72 cols
[2022-05-20 23:17:24] [INFO ] Computed 32 place invariants in 4 ms
[2022-05-20 23:17:24] [INFO ] Implicit Places using invariants in 77 ms returned [41, 43, 45, 47, 54, 56, 61, 63, 65, 71]
Discarding 10 places :
Implicit Place search using SMT only with invariants took 77 ms to find 10 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 62/72 places, 42/42 transitions.
Applied a total of 0 rules in 2 ms. Remains 62 /62 variables (removed 0) and now considering 42/42 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 62/72 places, 42/42 transitions.
Stuttering acceptance computed with spot in 297 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : ResAllocation-PT-R020C002-LTLCardinality-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}]], initial=3, aps=[p0:(AND (LEQ s43 s58) (LEQ s45 s54))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 2 ms.
FORMULA ResAllocation-PT-R020C002-LTLCardinality-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ResAllocation-PT-R020C002-LTLCardinality-02 finished in 431 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X((X(p0)&&p1)))'
Support contains 3 out of 72 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 72/72 places, 42/42 transitions.
Applied a total of 0 rules in 3 ms. Remains 72 /72 variables (removed 0) and now considering 42/42 (removed 0) transitions.
// Phase 1: matrix 42 rows 72 cols
[2022-05-20 23:17:24] [INFO ] Computed 32 place invariants in 1 ms
[2022-05-20 23:17:24] [INFO ] Implicit Places using invariants in 77 ms returned [41, 45, 47, 49, 56, 61, 63, 65, 67, 71]
Discarding 10 places :
Implicit Place search using SMT only with invariants took 78 ms to find 10 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 62/72 places, 42/42 transitions.
Applied a total of 0 rules in 2 ms. Remains 62 /62 variables (removed 0) and now considering 42/42 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 62/72 places, 42/42 transitions.
Stuttering acceptance computed with spot in 162 ms :[(NOT p0), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), true]
Running random walk in product with property : ResAllocation-PT-R020C002-LTLCardinality-03 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 3}], [{ cond=p1, acceptance={} source=1 dest: 0}, { cond=(NOT p1), acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={0} source=3 dest: 3}]], initial=2, aps=[p0:(OR (LEQ 1 s42) (GT s10 s50)), p1:(GT 1 s42)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA ResAllocation-PT-R020C002-LTLCardinality-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ResAllocation-PT-R020C002-LTLCardinality-03 finished in 256 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((p0 U p1))'
Support contains 3 out of 72 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 72/72 places, 42/42 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 5 rules applied. Total rules applied 5 place count 69 transition count 40
Applied a total of 5 rules in 9 ms. Remains 69 /72 variables (removed 3) and now considering 40/42 (removed 2) transitions.
// Phase 1: matrix 40 rows 69 cols
[2022-05-20 23:17:24] [INFO ] Computed 31 place invariants in 1 ms
[2022-05-20 23:17:24] [INFO ] Implicit Places using invariants in 57 ms returned [40, 42, 44, 46, 51, 53, 60, 62, 64, 68]
Discarding 10 places :
Implicit Place search using SMT only with invariants took 58 ms to find 10 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 59/72 places, 40/42 transitions.
Applied a total of 0 rules in 3 ms. Remains 59 /59 variables (removed 0) and now considering 40/40 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 59/72 places, 40/42 transitions.
Stuttering acceptance computed with spot in 48 ms :[true, (NOT p1)]
Running random walk in product with property : ResAllocation-PT-R020C002-LTLCardinality-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={0} source=1 dest: 1}]], initial=1, aps=[p1:(LEQ 1 s2), p0:(LEQ s36 s52)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 50673 steps with 8796 reset in 191 ms.
FORMULA ResAllocation-PT-R020C002-LTLCardinality-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ResAllocation-PT-R020C002-LTLCardinality-05 finished in 320 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 2 out of 72 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 72/72 places, 42/42 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 5 rules applied. Total rules applied 5 place count 69 transition count 40
Applied a total of 5 rules in 5 ms. Remains 69 /72 variables (removed 3) and now considering 40/42 (removed 2) transitions.
// Phase 1: matrix 40 rows 69 cols
[2022-05-20 23:17:25] [INFO ] Computed 31 place invariants in 0 ms
[2022-05-20 23:17:25] [INFO ] Implicit Places using invariants in 76 ms returned [40, 42, 44, 46, 51, 53, 58, 60, 64, 68]
Discarding 10 places :
Implicit Place search using SMT only with invariants took 78 ms to find 10 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 59/72 places, 40/42 transitions.
Applied a total of 0 rules in 4 ms. Remains 59 /59 variables (removed 0) and now considering 40/40 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 59/72 places, 40/42 transitions.
Stuttering acceptance computed with spot in 79 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ResAllocation-PT-R020C002-LTLCardinality-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(GT s21 s54)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 1666 steps with 91 reset in 5 ms.
FORMULA ResAllocation-PT-R020C002-LTLCardinality-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ResAllocation-PT-R020C002-LTLCardinality-10 finished in 194 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(G(p0))))'
Support contains 2 out of 72 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 72/72 places, 42/42 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 5 rules applied. Total rules applied 5 place count 69 transition count 40
Applied a total of 5 rules in 4 ms. Remains 69 /72 variables (removed 3) and now considering 40/42 (removed 2) transitions.
// Phase 1: matrix 40 rows 69 cols
[2022-05-20 23:17:25] [INFO ] Computed 31 place invariants in 0 ms
[2022-05-20 23:17:25] [INFO ] Implicit Places using invariants in 53 ms returned [40, 44, 46, 51, 53, 58, 60, 62, 64, 68]
Discarding 10 places :
Implicit Place search using SMT only with invariants took 54 ms to find 10 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 59/72 places, 40/42 transitions.
Applied a total of 0 rules in 2 ms. Remains 59 /59 variables (removed 0) and now considering 40/40 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 59/72 places, 40/42 transitions.
Stuttering acceptance computed with spot in 79 ms :[(NOT p0)]
Running random walk in product with property : ResAllocation-PT-R020C002-LTLCardinality-11 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(GT s46 s41)], 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 114 steps with 0 reset in 1 ms.
FORMULA ResAllocation-PT-R020C002-LTLCardinality-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ResAllocation-PT-R020C002-LTLCardinality-11 finished in 153 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X((X(p0)||F(G(F(G(p1)))))))'
Support contains 4 out of 72 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 72/72 places, 42/42 transitions.
Applied a total of 0 rules in 1 ms. Remains 72 /72 variables (removed 0) and now considering 42/42 (removed 0) transitions.
// Phase 1: matrix 42 rows 72 cols
[2022-05-20 23:17:25] [INFO ] Computed 32 place invariants in 1 ms
[2022-05-20 23:17:25] [INFO ] Implicit Places using invariants in 92 ms returned [41, 43, 45, 47, 49, 54, 56, 61, 63, 65, 67]
Discarding 11 places :
Implicit Place search using SMT only with invariants took 93 ms to find 11 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 61/72 places, 42/42 transitions.
Applied a total of 0 rules in 2 ms. Remains 61 /61 variables (removed 0) and now considering 42/42 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 61/72 places, 42/42 transitions.
Stuttering acceptance computed with spot in 132 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : ResAllocation-PT-R020C002-LTLCardinality-12 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=p1, acceptance={} source=1 dest: 1}, { cond=(NOT p1), acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 0}], [{ cond=true, acceptance={} source=3 dest: 2}]], initial=3, aps=[p0:(LEQ s60 s8), p1:(OR (LEQ 1 s27) (GT s60 s15))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Stuttering criterion allowed to conclude after 110 steps with 0 reset in 1 ms.
FORMULA ResAllocation-PT-R020C002-LTLCardinality-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ResAllocation-PT-R020C002-LTLCardinality-12 finished in 265 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0 U X(G(!p0)))))'
Support contains 2 out of 72 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 72/72 places, 42/42 transitions.
Applied a total of 0 rules in 0 ms. Remains 72 /72 variables (removed 0) and now considering 42/42 (removed 0) transitions.
// Phase 1: matrix 42 rows 72 cols
[2022-05-20 23:17:25] [INFO ] Computed 32 place invariants in 5 ms
[2022-05-20 23:17:26] [INFO ] Implicit Places using invariants in 715 ms returned [41, 43, 45, 47, 49, 54, 56, 61, 63, 65, 67, 71]
Discarding 12 places :
Implicit Place search using SMT only with invariants took 729 ms to find 12 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 60/72 places, 42/42 transitions.
Applied a total of 0 rules in 0 ms. Remains 60 /60 variables (removed 0) and now considering 42/42 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 60/72 places, 42/42 transitions.
Stuttering acceptance computed with spot in 187 ms :[p0, p0, true, p0]
Running random walk in product with property : ResAllocation-PT-R020C002-LTLCardinality-14 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 0}, { cond=p0, acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=3 dest: 0}, { cond=p0, acceptance={0} source=3 dest: 3}]], initial=1, aps=[p0:(LEQ s47 s46)], 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][false, false, false, false]]
Stuttering criterion allowed to conclude after 111 steps with 0 reset in 1 ms.
FORMULA ResAllocation-PT-R020C002-LTLCardinality-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ResAllocation-PT-R020C002-LTLCardinality-14 finished in 938 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((G(F(p0))||(G(p1)&&X(p2)&&X(p3))))))'
Support contains 7 out of 72 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 72/72 places, 42/42 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 5 rules applied. Total rules applied 5 place count 69 transition count 40
Applied a total of 5 rules in 7 ms. Remains 69 /72 variables (removed 3) and now considering 40/42 (removed 2) transitions.
// Phase 1: matrix 40 rows 69 cols
[2022-05-20 23:17:26] [INFO ] Computed 31 place invariants in 0 ms
[2022-05-20 23:17:26] [INFO ] Implicit Places using invariants in 97 ms returned [40, 42, 46, 51, 53, 58, 62, 64, 68]
Discarding 9 places :
Implicit Place search using SMT only with invariants took 99 ms to find 9 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 60/72 places, 40/42 transitions.
Applied a total of 0 rules in 4 ms. Remains 60 /60 variables (removed 0) and now considering 40/40 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 60/72 places, 40/42 transitions.
Stuttering acceptance computed with spot in 190 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p3)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p3)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p3)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : ResAllocation-PT-R020C002-LTLCardinality-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p0) p1), acceptance={} source=0 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p0) p1), acceptance={0} source=1 dest: 2}, { cond=(AND (NOT p0) p1), acceptance={} source=1 dest: 3}], [{ cond=(OR (AND (NOT p3) (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p1) (NOT p2))), acceptance={0} source=2 dest: 1}, { cond=(OR (AND (NOT p3) (NOT p0) p1) (AND (NOT p0) p1 (NOT p2))), acceptance={0} source=2 dest: 2}, { cond=(OR (AND (NOT p3) (NOT p0) p1) (AND (NOT p0) p1 (NOT p2))), acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=3 dest: 1}, { cond=(AND (NOT p0) p1), acceptance={} source=3 dest: 3}]], initial=0, aps=[p0:(LEQ s11 s4), p1:(LEQ s24 s9), p3:(LEQ s4 s42), p2:(LEQ s52 s54)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null][true, true, true, true]]
Product exploration explored 100000 steps with 31810 reset in 261 ms.
Product exploration explored 100000 steps with 32035 reset in 332 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) p1 p3 p2), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (OR (AND (NOT p3) (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p1) (NOT p2))))), (X (NOT (OR (AND (NOT p3) (NOT p0) p1) (AND (NOT p0) p1 (NOT p2))))), (X (AND (NOT p0) p1)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (OR (AND (NOT p3) (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p1) (NOT p2)))))), (X (X (NOT (OR (AND (NOT p3) (NOT p0) p1) (AND (NOT p0) p1 (NOT p2)))))), (X (X (AND (NOT p0) p1)))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 553 ms. Reduced automaton from 4 states, 11 edges and 4 AP to 4 states, 11 edges and 4 AP.
Stuttering acceptance computed with spot in 244 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p3)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p3)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p3)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p1))]
Finished random walk after 179 steps, including 1 resets, run visited all 4 properties in 19 ms. (steps per millisecond=9 )
Knowledge obtained : [(AND (NOT p0) p1 p3 p2), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (OR (AND (NOT p3) (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p1) (NOT p2))))), (X (NOT (OR (AND (NOT p3) (NOT p0) p1) (AND (NOT p0) p1 (NOT p2))))), (X (AND (NOT p0) p1)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (OR (AND (NOT p3) (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p1) (NOT p2)))))), (X (X (NOT (OR (AND (NOT p3) (NOT p0) p1) (AND (NOT p0) p1 (NOT p2)))))), (X (X (AND (NOT p0) p1)))]
False Knowledge obtained : [(F (OR (AND (NOT p3) (NOT p0) p1) (AND (NOT p2) (NOT p0) p1))), (F (AND (NOT p0) (NOT p1))), (F (OR (AND (NOT p3) (NOT p0) (NOT p1)) (AND (NOT p2) (NOT p0) (NOT p1)))), (F (NOT (AND (NOT p0) p1)))]
Knowledge based reduction with 9 factoid took 779 ms. Reduced automaton from 4 states, 11 edges and 4 AP to 4 states, 11 edges and 4 AP.
Stuttering acceptance computed with spot in 298 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p3)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p3)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p3)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 168 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p3)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p3)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p3)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p1))]
Support contains 7 out of 60 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 60/60 places, 40/40 transitions.
Applied a total of 0 rules in 2 ms. Remains 60 /60 variables (removed 0) and now considering 40/40 (removed 0) transitions.
// Phase 1: matrix 40 rows 60 cols
[2022-05-20 23:17:29] [INFO ] Computed 22 place invariants in 0 ms
[2022-05-20 23:17:29] [INFO ] Implicit Places using invariants in 46 ms returned []
// Phase 1: matrix 40 rows 60 cols
[2022-05-20 23:17:29] [INFO ] Computed 22 place invariants in 0 ms
[2022-05-20 23:17:29] [INFO ] Implicit Places using invariants and state equation in 86 ms returned []
Implicit Place search using SMT with State Equation took 134 ms to find 0 implicit places.
[2022-05-20 23:17:29] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 40 rows 60 cols
[2022-05-20 23:17:29] [INFO ] Computed 22 place invariants in 1 ms
[2022-05-20 23:17:29] [INFO ] Dead Transitions using invariants and state equation in 40 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 60/60 places, 40/40 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) p1 p3 p2), (X (NOT (OR (AND (NOT p3) (NOT p0) p1) (AND (NOT p2) (NOT p0) p1)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (OR (AND (NOT p3) (NOT p0) (NOT p1)) (AND (NOT p2) (NOT p0) (NOT p1))))), (X (AND (NOT p0) p1)), (X (X (NOT (OR (AND (NOT p3) (NOT p0) p1) (AND (NOT p2) (NOT p0) p1))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (OR (AND (NOT p3) (NOT p0) (NOT p1)) (AND (NOT p2) (NOT p0) (NOT p1)))))), (X (X (AND (NOT p0) p1)))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 331 ms. Reduced automaton from 4 states, 11 edges and 4 AP to 4 states, 11 edges and 4 AP.
Stuttering acceptance computed with spot in 190 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p3)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p3)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p3)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p1))]
Finished random walk after 621 steps, including 5 resets, run visited all 4 properties in 10 ms. (steps per millisecond=62 )
Knowledge obtained : [(AND (NOT p0) p1 p3 p2), (X (NOT (OR (AND (NOT p3) (NOT p0) p1) (AND (NOT p2) (NOT p0) p1)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (OR (AND (NOT p3) (NOT p0) (NOT p1)) (AND (NOT p2) (NOT p0) (NOT p1))))), (X (AND (NOT p0) p1)), (X (X (NOT (OR (AND (NOT p3) (NOT p0) p1) (AND (NOT p2) (NOT p0) p1))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (OR (AND (NOT p3) (NOT p0) (NOT p1)) (AND (NOT p2) (NOT p0) (NOT p1)))))), (X (X (AND (NOT p0) p1)))]
False Knowledge obtained : [(F (OR (AND (NOT p3) (NOT p0) p1) (AND (NOT p2) (NOT p0) p1))), (F (AND (NOT p0) (NOT p1))), (F (OR (AND (NOT p3) (NOT p0) (NOT p1)) (AND (NOT p2) (NOT p0) (NOT p1)))), (F (NOT (AND (NOT p0) p1)))]
Knowledge based reduction with 9 factoid took 547 ms. Reduced automaton from 4 states, 11 edges and 4 AP to 4 states, 11 edges and 4 AP.
Stuttering acceptance computed with spot in 239 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p3)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p3)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p3)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 234 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p3)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p3)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p3)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 240 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p3)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p3)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p3)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 32120 reset in 186 ms.
Product exploration explored 100000 steps with 31901 reset in 223 ms.
Built C files in :
/tmp/ltsmin13501261025450695623
[2022-05-20 23:17:32] [INFO ] Computing symmetric may disable matrix : 40 transitions.
[2022-05-20 23:17:32] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-20 23:17:32] [INFO ] Computing symmetric may enable matrix : 40 transitions.
[2022-05-20 23:17:32] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-20 23:17:32] [INFO ] Computing Do-Not-Accords matrix : 40 transitions.
[2022-05-20 23:17:32] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-20 23:17:32] [INFO ] Built C files in 20ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13501261025450695623
Running compilation step : cd /tmp/ltsmin13501261025450695623;'/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 278 ms.
Running link step : cd /tmp/ltsmin13501261025450695623;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 55 ms.
Running LTSmin : cd /tmp/ltsmin13501261025450695623;'/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/stateBased11844056952042527230.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 7 out of 60 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 60/60 places, 40/40 transitions.
Applied a total of 0 rules in 4 ms. Remains 60 /60 variables (removed 0) and now considering 40/40 (removed 0) transitions.
// Phase 1: matrix 40 rows 60 cols
[2022-05-20 23:17:47] [INFO ] Computed 22 place invariants in 0 ms
[2022-05-20 23:17:47] [INFO ] Implicit Places using invariants in 60 ms returned []
// Phase 1: matrix 40 rows 60 cols
[2022-05-20 23:17:47] [INFO ] Computed 22 place invariants in 1 ms
[2022-05-20 23:17:47] [INFO ] Implicit Places using invariants and state equation in 85 ms returned []
Implicit Place search using SMT with State Equation took 147 ms to find 0 implicit places.
[2022-05-20 23:17:47] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 40 rows 60 cols
[2022-05-20 23:17:47] [INFO ] Computed 22 place invariants in 0 ms
[2022-05-20 23:17:47] [INFO ] Dead Transitions using invariants and state equation in 41 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 60/60 places, 40/40 transitions.
Built C files in :
/tmp/ltsmin14767886910142981443
[2022-05-20 23:17:47] [INFO ] Computing symmetric may disable matrix : 40 transitions.
[2022-05-20 23:17:47] [INFO ] Computation of Complete disable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-20 23:17:47] [INFO ] Computing symmetric may enable matrix : 40 transitions.
[2022-05-20 23:17:47] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-20 23:17:47] [INFO ] Computing Do-Not-Accords matrix : 40 transitions.
[2022-05-20 23:17:47] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-20 23:17:47] [INFO ] Built C files in 4ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14767886910142981443
Running compilation step : cd /tmp/ltsmin14767886910142981443;'/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 134 ms.
Running link step : cd /tmp/ltsmin14767886910142981443;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 47 ms.
Running LTSmin : cd /tmp/ltsmin14767886910142981443;'/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/stateBased2570345744458063894.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2022-05-20 23:18:02] [INFO ] Flatten gal took : 5 ms
[2022-05-20 23:18:02] [INFO ] Flatten gal took : 8 ms
[2022-05-20 23:18:02] [INFO ] Time to serialize gal into /tmp/LTL6720820327985726229.gal : 18 ms
[2022-05-20 23:18:02] [INFO ] Time to serialize properties into /tmp/LTL5917730441792150212.ltl : 0 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/LTL6720820327985726229.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL5917730441792150212.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/LTL6720820...266
Read 1 LTL properties
Checking formula 0 : !((G(F((G(F("(r_0_5<=p_0_2)")))||(((G("(p_0_12<=r_0_4)"))&&(X("(p_1_13<=r_1_14)")))&&(X("(p_0_2<=r_1_3)")))))))
Formula 0 simplified : !GF(GF"(r_0_5<=p_0_2)" | (G"(p_0_12<=r_0_4)" & X"(p_1_13<=r_1_14)" & X"(p_0_2<=r_1_3)"))
Reverse transition relation is NOT exact ! Due to transitions t19.t20, t22.t21, Intersection with reachable at each step enabled. (destroyed/reverse/inter...177
Computing Next relation with stutter on 19 deadlock states
Detected timeout of ITS tools.
[2022-05-20 23:18:17] [INFO ] Flatten gal took : 5 ms
[2022-05-20 23:18:17] [INFO ] Applying decomposition
[2022-05-20 23:18:17] [INFO ] Flatten gal took : 3 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/graph5989929952438728920.txt' '-o' '/tmp/graph5989929952438728920.bin' '-w' '/tmp/graph5989929952438728920.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph5989929952438728920.bin' '-l' '-1' '-v' '-w' '/tmp/graph5989929952438728920.weights' '-q' '0' '-e' '0.001'
[2022-05-20 23:18:17] [INFO ] Decomposing Gal with order
[2022-05-20 23:18:17] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-20 23:18:17] [INFO ] Removed a total of 2 redundant transitions.
[2022-05-20 23:18:17] [INFO ] Flatten gal took : 48 ms
[2022-05-20 23:18:17] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 2 ms.
[2022-05-20 23:18:18] [INFO ] Time to serialize gal into /tmp/LTL1640870115892009003.gal : 2 ms
[2022-05-20 23:18:18] [INFO ] Time to serialize properties into /tmp/LTL2083269212883720373.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/LTL1640870115892009003.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL2083269212883720373.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/LTL1640870...266
Read 1 LTL properties
Checking formula 0 : !((G(F((G(F("(gu2.r_0_5<=gu2.p_0_2)")))||(((G("(gu4.p_0_12<=gu4.r_0_4)"))&&(X("(gu19.p_1_13<=gu19.r_1_14)")))&&(X("(gu2.p_0_2<=gu2.r_1...166
Formula 0 simplified : !GF(GF"(gu2.r_0_5<=gu2.p_0_2)" | (G"(gu4.p_0_12<=gu4.r_0_4)" & X"(gu19.p_1_13<=gu19.r_1_14)" & X"(gu2.p_0_2<=gu2.r_1_3)"))
Reverse transition relation is NOT exact ! Due to transitions gi3.gi0.t22_t21, gi3.gi2.gi1.t19_t20, Intersection with reachable at each step enabled. (des...197
Computing Next relation with stutter on 19 deadlock states
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin17447823625423299643
[2022-05-20 23:18:33] [INFO ] Built C files in 6ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17447823625423299643
Running compilation step : cd /tmp/ltsmin17447823625423299643;'/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 120 ms.
Running link step : cd /tmp/ltsmin17447823625423299643;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 25 ms.
Running LTSmin : cd /tmp/ltsmin17447823625423299643;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '[](<>(([](<>((LTLAPp0==true)))||([]((LTLAPp1==true))&&X((LTLAPp2==true))&&X((LTLAPp3==true))))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property ResAllocation-PT-R020C002-LTLCardinality-15 finished in 81435 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((G(F(p0))||(G(p1)&&X(p2)&&X(p3))))))'
[2022-05-20 23:18:48] [INFO ] Flatten gal took : 11 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin17426100126923915677
[2022-05-20 23:18:48] [INFO ] Computing symmetric may disable matrix : 42 transitions.
[2022-05-20 23:18:48] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-20 23:18:48] [INFO ] Applying decomposition
[2022-05-20 23:18:48] [INFO ] Computing symmetric may enable matrix : 42 transitions.
[2022-05-20 23:18:48] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-20 23:18:48] [INFO ] Computing Do-Not-Accords matrix : 42 transitions.
[2022-05-20 23:18:48] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-20 23:18:48] [INFO ] Built C files in 7ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17426100126923915677
Running compilation step : cd /tmp/ltsmin17426100126923915677;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '720' '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'
[2022-05-20 23:18:48] [INFO ] Flatten gal took : 10 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/graph17602259237352994929.txt' '-o' '/tmp/graph17602259237352994929.bin' '-w' '/tmp/graph17602259237352994929.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph17602259237352994929.bin' '-l' '-1' '-v' '-w' '/tmp/graph17602259237352994929.weights' '-q' '0' '-e' '0.001'
[2022-05-20 23:18:48] [INFO ] Decomposing Gal with order
[2022-05-20 23:18:48] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-20 23:18:48] [INFO ] Removed a total of 2 redundant transitions.
[2022-05-20 23:18:48] [INFO ] Flatten gal took : 27 ms
[2022-05-20 23:18:48] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 2 ms.
[2022-05-20 23:18:48] [INFO ] Time to serialize gal into /tmp/LTLCardinality17353312097147877636.gal : 9 ms
[2022-05-20 23:18:48] [INFO ] Time to serialize properties into /tmp/LTLCardinality10141328420718805427.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/LTLCardinality17353312097147877636.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality10141328420718805427.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/LTLCardina...290
Read 1 LTL properties
Checking formula 0 : !((G(F((G(F("(gu20.r_0_5<=gu20.p_0_2)")))||(((G("(gu9.p_0_12<=gu9.r_0_4)"))&&(X("(gu24.p_1_13<=gu24.r_1_14)")))&&(X("(gu20.p_0_2<=gu20...170
Formula 0 simplified : !GF(GF"(gu20.r_0_5<=gu20.p_0_2)" | (G"(gu9.p_0_12<=gu9.r_0_4)" & X"(gu24.p_1_13<=gu24.r_1_14)" & X"(gu20.p_0_2<=gu20.r_1_3)"))
Compilation finished in 172 ms.
Running link step : cd /tmp/ltsmin17426100126923915677;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 24 ms.
Running LTSmin : cd /tmp/ltsmin17426100126923915677;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '[](<>(([](<>((LTLAPp0==true)))||([]((LTLAPp1==true))&&X((LTLAPp2==true))&&X((LTLAPp3==true))))))' '--buchi-type=spotba'
Reverse transition relation is NOT exact ! Due to transitions gi0.gi0.t21, gi0.gi1.gi1.gi1.gu16.t20, Intersection with reachable at each step enabled. (de...198
Computing Next relation with stutter on 19 deadlock states
LTSmin run took 76239 ms.
FORMULA ResAllocation-PT-R020C002-LTLCardinality-15 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
ITS tools runner thread asked to quit. Dying gracefully.
Total runtime 171076 ms.

BK_STOP 1653088805022

--------------------
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="ResAllocation-PT-R020C002"
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 ResAllocation-PT-R020C002, 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 r186-tajo-165281572600683"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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