Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2024-input.r312-tall-171662339500859.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool itstools
Input is ResAllocation-PT-R015C002, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r312-tall-171662339500859
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 564K
-rw-r--r-- 1 mcc users 7.1K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 74K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.5K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 60K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.7K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.9K Apr 23 07:48 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Apr 23 07:48 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Apr 23 07:48 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 23 07:48 LTLFireability.xml
-rw-r--r-- 1 mcc users 14K Apr 11 23:32 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 142K Apr 11 23:32 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.9K Apr 11 23:30 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 84K Apr 11 23:30 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Apr 23 07:48 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Apr 23 07:48 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 9 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 64K May 18 16:43 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME ResAllocation-PT-R015C002-LTLCardinality-00
FORMULA_NAME ResAllocation-PT-R015C002-LTLCardinality-01
FORMULA_NAME ResAllocation-PT-R015C002-LTLCardinality-02
FORMULA_NAME ResAllocation-PT-R015C002-LTLCardinality-03
FORMULA_NAME ResAllocation-PT-R015C002-LTLCardinality-04
FORMULA_NAME ResAllocation-PT-R015C002-LTLCardinality-05
FORMULA_NAME ResAllocation-PT-R015C002-LTLCardinality-06
FORMULA_NAME ResAllocation-PT-R015C002-LTLCardinality-07
FORMULA_NAME ResAllocation-PT-R015C002-LTLCardinality-08
FORMULA_NAME ResAllocation-PT-R015C002-LTLCardinality-09
FORMULA_NAME ResAllocation-PT-R015C002-LTLCardinality-10
FORMULA_NAME ResAllocation-PT-R015C002-LTLCardinality-11
FORMULA_NAME ResAllocation-PT-R015C002-LTLCardinality-12
FORMULA_NAME ResAllocation-PT-R015C002-LTLCardinality-13
FORMULA_NAME ResAllocation-PT-R015C002-LTLCardinality-14
FORMULA_NAME ResAllocation-PT-R015C002-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1716718479212

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ResAllocation-PT-R015C002
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202405141337
[2024-05-26 10:14:40] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-26 10:14:40] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-26 10:14:40] [INFO ] Load time of PNML (sax parser for PT used): 62 ms
[2024-05-26 10:14:40] [INFO ] Transformed 60 places.
[2024-05-26 10:14:40] [INFO ] Transformed 32 transitions.
[2024-05-26 10:14:40] [INFO ] Found NUPN structural information;
[2024-05-26 10:14:40] [INFO ] Parsed PT model containing 60 places and 32 transitions and 150 arcs in 157 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 2 formulas.
FORMULA ResAllocation-PT-R015C002-LTLCardinality-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ResAllocation-PT-R015C002-LTLCardinality-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ResAllocation-PT-R015C002-LTLCardinality-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ResAllocation-PT-R015C002-LTLCardinality-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ResAllocation-PT-R015C002-LTLCardinality-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ResAllocation-PT-R015C002-LTLCardinality-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ResAllocation-PT-R015C002-LTLCardinality-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ResAllocation-PT-R015C002-LTLCardinality-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 26 out of 60 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 60/60 places, 32/32 transitions.
Applied a total of 0 rules in 10 ms. Remains 60 /60 variables (removed 0) and now considering 32/32 (removed 0) transitions.
// Phase 1: matrix 32 rows 60 cols
[2024-05-26 10:14:40] [INFO ] Computed 30 invariants in 8 ms
[2024-05-26 10:14:40] [INFO ] Implicit Places using invariants in 200 ms returned [33, 35, 37, 39, 45, 47, 51, 53, 59]
Discarding 9 places :
Implicit Place search using SMT only with invariants took 236 ms to find 9 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 51/60 places, 32/32 transitions.
Applied a total of 0 rules in 1 ms. Remains 51 /51 variables (removed 0) and now considering 32/32 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 264 ms. Remains : 51/60 places, 32/32 transitions.
Support contains 26 out of 51 places after structural reductions.
[2024-05-26 10:14:41] [INFO ] Flatten gal took : 20 ms
[2024-05-26 10:14:41] [INFO ] Flatten gal took : 7 ms
[2024-05-26 10:14:41] [INFO ] Input system was already deterministic with 32 transitions.
RANDOM walk for 40000 steps (584 resets) in 840 ms. (47 steps per ms) remains 2/17 properties
BEST_FIRST walk for 40003 steps (100 resets) in 224 ms. (177 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (101 resets) in 115 ms. (344 steps per ms) remains 2/2 properties
// Phase 1: matrix 32 rows 51 cols
[2024-05-26 10:14:41] [INFO ] Computed 21 invariants in 2 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/4 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (OVERLAPS) 7/11 variables, 5/9 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/11 variables, 7/16 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/11 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 10/21 variables, 11/27 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/21 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 16/37 variables, 10/37 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/37 variables, 10/47 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/37 variables, 4/51 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/37 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 10/47 variables, 6/57 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/47 variables, 6/63 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/47 variables, 2/65 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/47 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 10/57 variables, 6/71 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/57 variables, 6/77 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/57 variables, 2/79 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/57 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (OVERLAPS) 12/69 variables, 8/87 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/69 variables, 8/95 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/69 variables, 4/99 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/69 variables, 0/99 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 23 (OVERLAPS) 11/80 variables, 7/106 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/80 variables, 7/113 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/80 variables, 3/116 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/80 variables, 0/116 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 27 (OVERLAPS) 3/83 variables, 3/119 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/83 variables, 3/122 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/83 variables, 1/123 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/83 variables, 0/123 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 31 (OVERLAPS) 0/83 variables, 0/123 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 83/83 variables, and 123 constraints, problems are : Problem set: 0 solved, 2 unsolved in 179 ms.
Refiners :[Domain max(s): 51/51 constraints, Positive P Invariants (semi-flows): 21/21 constraints, State Equation: 51/51 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/4 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (OVERLAPS) 7/11 variables, 5/9 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/11 variables, 7/16 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/11 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 10/21 variables, 11/27 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/21 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 16/37 variables, 10/37 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/37 variables, 10/47 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/37 variables, 4/51 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/37 variables, 2/53 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/37 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 10/47 variables, 6/59 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/47 variables, 6/65 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/47 variables, 2/67 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-26 10:14:41] [INFO ] Deduced a trap composed of 4 places in 28 ms of which 7 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/47 variables, 1/68 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/47 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 10/57 variables, 6/74 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/57 variables, 6/80 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/57 variables, 2/82 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/57 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (OVERLAPS) 12/69 variables, 8/90 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/69 variables, 8/98 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/69 variables, 4/102 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/69 variables, 0/102 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 25 (OVERLAPS) 11/80 variables, 7/109 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/80 variables, 7/116 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/80 variables, 3/119 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/80 variables, 0/119 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 29 (OVERLAPS) 3/83 variables, 3/122 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/83 variables, 3/125 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 31 (INCLUDED_ONLY) 0/83 variables, 1/126 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/83 variables, 0/126 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 33 (OVERLAPS) 0/83 variables, 0/126 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 83/83 variables, and 126 constraints, problems are : Problem set: 0 solved, 2 unsolved in 177 ms.
Refiners :[Domain max(s): 51/51 constraints, Positive P Invariants (semi-flows): 21/21 constraints, State Equation: 51/51 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 1/1 constraints]
After SMT, in 384ms problems are : Problem set: 0 solved, 2 unsolved
Parikh walk visited 1 properties in 28 ms.
Support contains 2 out of 51 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 51/51 places, 32/32 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 48 transition count 30
Free-agglomeration rule applied 2 times.
Iterating global reduction 0 with 2 rules applied. Total rules applied 7 place count 48 transition count 28
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 11 place count 44 transition count 28
Free-agglomeration rule applied 1 times.
Iterating global reduction 1 with 1 rules applied. Total rules applied 12 place count 44 transition count 27
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 13 place count 43 transition count 27
Applied a total of 13 rules in 27 ms. Remains 43 /51 variables (removed 8) and now considering 27/32 (removed 5) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 28 ms. Remains : 43/51 places, 27/32 transitions.
RANDOM walk for 34854 steps (754 resets) in 297 ms. (116 steps per ms) remains 0/1 properties
FORMULA ResAllocation-PT-R015C002-LTLCardinality-03 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 0 stabilizing places and 0 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 2 out of 51 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 51/51 places, 32/32 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 50 transition count 31
Applied a total of 2 rules in 5 ms. Remains 50 /51 variables (removed 1) and now considering 31/32 (removed 1) transitions.
// Phase 1: matrix 31 rows 50 cols
[2024-05-26 10:14:42] [INFO ] Computed 21 invariants in 2 ms
[2024-05-26 10:14:42] [INFO ] Implicit Places using invariants in 54 ms returned [36, 38, 42, 46, 48]
Discarding 5 places :
Implicit Place search using SMT only with invariants took 55 ms to find 5 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 45/51 places, 31/32 transitions.
Applied a total of 0 rules in 2 ms. Remains 45 /45 variables (removed 0) and now considering 31/31 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 62 ms. Remains : 45/51 places, 31/32 transitions.
Stuttering acceptance computed with spot in 126 ms :[(NOT p0)]
Running random walk in product with property : ResAllocation-PT-R015C002-LTLCardinality-01
Stuttering criterion allowed to conclude after 66 steps with 0 reset in 2 ms.
FORMULA ResAllocation-PT-R015C002-LTLCardinality-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ResAllocation-PT-R015C002-LTLCardinality-01 finished in 242 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)&&X((p1&&X(G(p2))))))'
Support contains 3 out of 51 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 51/51 places, 32/32 transitions.
Applied a total of 0 rules in 1 ms. Remains 51 /51 variables (removed 0) and now considering 32/32 (removed 0) transitions.
// Phase 1: matrix 32 rows 51 cols
[2024-05-26 10:14:42] [INFO ] Computed 21 invariants in 0 ms
[2024-05-26 10:14:42] [INFO ] Implicit Places using invariants in 57 ms returned [31, 37, 39, 43, 47, 49]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 59 ms to find 6 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 45/51 places, 32/32 transitions.
Applied a total of 0 rules in 1 ms. Remains 45 /45 variables (removed 0) and now considering 32/32 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 61 ms. Remains : 45/51 places, 32/32 transitions.
Stuttering acceptance computed with spot in 308 ms :[(OR (NOT p1) (NOT p2) (NOT p0)), (NOT p0), (OR (NOT p1) (NOT p2)), true, (NOT p2)]
Running random walk in product with property : ResAllocation-PT-R015C002-LTLCardinality-04
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA ResAllocation-PT-R015C002-LTLCardinality-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ResAllocation-PT-R015C002-LTLCardinality-04 finished in 384 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 2 out of 51 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 51/51 places, 32/32 transitions.
Applied a total of 0 rules in 5 ms. Remains 51 /51 variables (removed 0) and now considering 32/32 (removed 0) transitions.
[2024-05-26 10:14:42] [INFO ] Invariant cache hit.
[2024-05-26 10:14:42] [INFO ] Implicit Places using invariants in 48 ms returned [31, 37, 39, 43, 47, 49]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 49 ms to find 6 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 45/51 places, 32/32 transitions.
Applied a total of 0 rules in 1 ms. Remains 45 /45 variables (removed 0) and now considering 32/32 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 55 ms. Remains : 45/51 places, 32/32 transitions.
Stuttering acceptance computed with spot in 63 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ResAllocation-PT-R015C002-LTLCardinality-06
Product exploration explored 100000 steps with 50000 reset in 160 ms.
Product exploration explored 100000 steps with 50000 reset in 138 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 : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 3 factoid took 32 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA ResAllocation-PT-R015C002-LTLCardinality-06 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ResAllocation-PT-R015C002-LTLCardinality-06 finished in 481 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((X(p0)||(X(p1)&&G(p2)))))'
Support contains 6 out of 51 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 51/51 places, 32/32 transitions.
Applied a total of 0 rules in 1 ms. Remains 51 /51 variables (removed 0) and now considering 32/32 (removed 0) transitions.
[2024-05-26 10:14:43] [INFO ] Invariant cache hit.
[2024-05-26 10:14:43] [INFO ] Implicit Places using invariants in 68 ms returned [31, 37, 39, 43, 47]
Discarding 5 places :
Implicit Place search using SMT only with invariants took 69 ms to find 5 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 46/51 places, 32/32 transitions.
Applied a total of 0 rules in 0 ms. Remains 46 /46 variables (removed 0) and now considering 32/32 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 70 ms. Remains : 46/51 places, 32/32 transitions.
Stuttering acceptance computed with spot in 215 ms :[true, (NOT p0), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (NOT p2)]
Running random walk in product with property : ResAllocation-PT-R015C002-LTLCardinality-11
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA ResAllocation-PT-R015C002-LTLCardinality-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ResAllocation-PT-R015C002-LTLCardinality-11 finished in 303 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(X(F(G((X(X((p0 U p1))) U p2))))))'
Support contains 5 out of 51 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 51/51 places, 32/32 transitions.
Applied a total of 0 rules in 9 ms. Remains 51 /51 variables (removed 0) and now considering 32/32 (removed 0) transitions.
[2024-05-26 10:14:43] [INFO ] Invariant cache hit.
[2024-05-26 10:14:43] [INFO ] Implicit Places using invariants in 80 ms returned [31, 37, 43, 49]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 81 ms to find 4 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 47/51 places, 32/32 transitions.
Applied a total of 0 rules in 0 ms. Remains 47 /47 variables (removed 0) and now considering 32/32 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 90 ms. Remains : 47/51 places, 32/32 transitions.
Stuttering acceptance computed with spot in 166 ms :[(NOT p2), (NOT p2), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : ResAllocation-PT-R015C002-LTLCardinality-13
Product exploration explored 100000 steps with 7671 reset in 262 ms.
Product exploration explored 100000 steps with 7745 reset in 166 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 p2 (NOT p1) p0), (X (X (AND (NOT p1) p0))), (X (X (NOT (AND (NOT p2) (NOT p1) (NOT p0))))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X p0)), (X (X (NOT p1)))]
False Knowledge obtained : [(X (NOT p2)), (X p2), (X (X (AND (NOT p2) (NOT p1) p0))), (X (X (NOT (AND (NOT p2) (NOT p1) p0)))), (X (X (NOT p2))), (X (X p2))]
Knowledge based reduction with 6 factoid took 292 ms. Reduced automaton from 4 states, 11 edges and 3 AP (stutter sensitive) to 4 states, 11 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 172 ms :[(NOT p2), (NOT p2), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
RANDOM walk for 4102 steps (57 resets) in 28 ms. (141 steps per ms) remains 0/7 properties
Knowledge obtained : [(AND p2 (NOT p1) p0), (X (X (AND (NOT p1) p0))), (X (X (NOT (AND (NOT p2) (NOT p1) (NOT p0))))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X p0)), (X (X (NOT p1)))]
False Knowledge obtained : [(X (NOT p2)), (X p2), (X (X (AND (NOT p2) (NOT p1) p0))), (X (X (NOT (AND (NOT p2) (NOT p1) p0)))), (X (X (NOT p2))), (X (X p2)), (F (NOT p2)), (F (NOT (AND p0 (NOT p1)))), (F p1), (F (NOT p0)), (F (NOT (OR p0 p1))), (F (NOT (OR (NOT p0) p1 p2))), (F (NOT (OR p0 p1 p2)))]
Knowledge based reduction with 6 factoid took 480 ms. Reduced automaton from 4 states, 11 edges and 3 AP (stutter sensitive) to 4 states, 11 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 182 ms :[(NOT p2), (NOT p2), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 169 ms :[(NOT p2), (NOT p2), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Support contains 5 out of 47 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 47/47 places, 32/32 transitions.
Applied a total of 0 rules in 1 ms. Remains 47 /47 variables (removed 0) and now considering 32/32 (removed 0) transitions.
// Phase 1: matrix 32 rows 47 cols
[2024-05-26 10:14:45] [INFO ] Computed 17 invariants in 1 ms
[2024-05-26 10:14:45] [INFO ] Implicit Places using invariants in 67 ms returned []
[2024-05-26 10:14:45] [INFO ] Invariant cache hit.
[2024-05-26 10:14:45] [INFO ] Implicit Places using invariants and state equation in 92 ms returned []
Implicit Place search using SMT with State Equation took 161 ms to find 0 implicit places.
Running 30 sub problems to find dead transitions.
[2024-05-26 10:14:45] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/47 variables, 47/47 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/47 variables, 17/64 constraints. Problems are: Problem set: 0 solved, 30 unsolved
[2024-05-26 10:14:46] [INFO ] Deduced a trap composed of 4 places in 29 ms of which 2 ms to minimize.
[2024-05-26 10:14:46] [INFO ] Deduced a trap composed of 4 places in 35 ms of which 2 ms to minimize.
[2024-05-26 10:14:46] [INFO ] Deduced a trap composed of 4 places in 36 ms of which 1 ms to minimize.
[2024-05-26 10:14:46] [INFO ] Deduced a trap composed of 4 places in 34 ms of which 1 ms to minimize.
[2024-05-26 10:14:46] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 0 ms to minimize.
[2024-05-26 10:14:46] [INFO ] Deduced a trap composed of 4 places in 29 ms of which 1 ms to minimize.
[2024-05-26 10:14:46] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 1 ms to minimize.
[2024-05-26 10:14:46] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 1 ms to minimize.
[2024-05-26 10:14:46] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 0 ms to minimize.
[2024-05-26 10:14:46] [INFO ] Deduced a trap composed of 4 places in 22 ms of which 1 ms to minimize.
[2024-05-26 10:14:46] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 1 ms to minimize.
[2024-05-26 10:14:46] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 0 ms to minimize.
[2024-05-26 10:14:46] [INFO ] Deduced a trap composed of 4 places in 22 ms of which 1 ms to minimize.
[2024-05-26 10:14:46] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/47 variables, 14/78 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/47 variables, 0/78 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 4 (OVERLAPS) 32/79 variables, 47/125 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/79 variables, 0/125 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 6 (OVERLAPS) 0/79 variables, 0/125 constraints. Problems are: Problem set: 0 solved, 30 unsolved
No progress, stopping.
After SMT solving in domain Real declared 79/79 variables, and 125 constraints, problems are : Problem set: 0 solved, 30 unsolved in 842 ms.
Refiners :[Domain max(s): 47/47 constraints, Positive P Invariants (semi-flows): 17/17 constraints, State Equation: 47/47 constraints, PredecessorRefiner: 30/30 constraints, Known Traps: 14/14 constraints]
Escalating to Integer solving :Problem set: 0 solved, 30 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/47 variables, 47/47 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/47 variables, 17/64 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/47 variables, 14/78 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/47 variables, 0/78 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 4 (OVERLAPS) 32/79 variables, 47/125 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/79 variables, 30/155 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/79 variables, 0/155 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 7 (OVERLAPS) 0/79 variables, 0/155 constraints. Problems are: Problem set: 0 solved, 30 unsolved
No progress, stopping.
After SMT solving in domain Int declared 79/79 variables, and 155 constraints, problems are : Problem set: 0 solved, 30 unsolved in 473 ms.
Refiners :[Domain max(s): 47/47 constraints, Positive P Invariants (semi-flows): 17/17 constraints, State Equation: 47/47 constraints, PredecessorRefiner: 30/30 constraints, Known Traps: 14/14 constraints]
After SMT, in 1328ms problems are : Problem set: 0 solved, 30 unsolved
Search for dead transitions found 0 dead transitions in 1329ms
Finished structural reductions in LTL mode , in 1 iterations and 1494 ms. Remains : 47/47 places, 32/32 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 p2 p0 (NOT p1)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (AND p0 (NOT p1)))), (X (X p0)), (X (X (NOT p1)))]
False Knowledge obtained : [(X (NOT p2)), (X p2), (X (X (AND p0 (NOT p1) (NOT p2)))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X (NOT p2))), (X (X p2))]
Knowledge based reduction with 6 factoid took 321 ms. Reduced automaton from 4 states, 11 edges and 3 AP (stutter sensitive) to 4 states, 11 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 168 ms :[(NOT p2), (NOT p2), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
RANDOM walk for 2696 steps (38 resets) in 39 ms. (67 steps per ms) remains 0/7 properties
Knowledge obtained : [(AND p2 p0 (NOT p1)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (AND p0 (NOT p1)))), (X (X p0)), (X (X (NOT p1)))]
False Knowledge obtained : [(X (NOT p2)), (X p2), (X (X (AND p0 (NOT p1) (NOT p2)))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X (NOT p2))), (X (X p2)), (F (NOT p2)), (F (NOT (AND p0 (NOT p1)))), (F p1), (F (NOT p0)), (F (NOT (OR p0 p1))), (F (NOT (OR (NOT p0) p1 p2))), (F (NOT (OR p0 p1 p2)))]
Knowledge based reduction with 6 factoid took 491 ms. Reduced automaton from 4 states, 11 edges and 3 AP (stutter sensitive) to 4 states, 11 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 161 ms :[(NOT p2), (NOT p2), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 161 ms :[(NOT p2), (NOT p2), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 203 ms :[(NOT p2), (NOT p2), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Product exploration explored 100000 steps with 7539 reset in 121 ms.
Product exploration explored 100000 steps with 7479 reset in 187 ms.
Built C files in :
/tmp/ltsmin8146572534845975705
[2024-05-26 10:14:49] [INFO ] Built C files in 10ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8146572534845975705
Running compilation step : cd /tmp/ltsmin8146572534845975705;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 235 ms.
Running link step : cd /tmp/ltsmin8146572534845975705;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 42 ms.
Running LTSmin : cd /tmp/ltsmin8146572534845975705;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased11160179039187497363.hoa' '--buchi-type=spotba'
LTSmin run took 2214 ms.
FORMULA ResAllocation-PT-R015C002-LTLCardinality-13 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property ResAllocation-PT-R015C002-LTLCardinality-13 finished in 8166 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 2 out of 51 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 51/51 places, 32/32 transitions.
Applied a total of 0 rules in 3 ms. Remains 51 /51 variables (removed 0) and now considering 32/32 (removed 0) transitions.
// Phase 1: matrix 32 rows 51 cols
[2024-05-26 10:14:51] [INFO ] Computed 21 invariants in 1 ms
[2024-05-26 10:14:51] [INFO ] Implicit Places using invariants in 54 ms returned [31, 39, 43, 47, 49]
Discarding 5 places :
Implicit Place search using SMT only with invariants took 55 ms to find 5 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 46/51 places, 32/32 transitions.
Applied a total of 0 rules in 1 ms. Remains 46 /46 variables (removed 0) and now considering 32/32 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 59 ms. Remains : 46/51 places, 32/32 transitions.
Stuttering acceptance computed with spot in 82 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : ResAllocation-PT-R015C002-LTLCardinality-14
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA ResAllocation-PT-R015C002-LTLCardinality-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ResAllocation-PT-R015C002-LTLCardinality-14 finished in 163 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(p0)&&(G(F(!p1))||(F(!p1)&&F(!p2))))))'
Support contains 5 out of 51 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 51/51 places, 32/32 transitions.
Applied a total of 0 rules in 2 ms. Remains 51 /51 variables (removed 0) and now considering 32/32 (removed 0) transitions.
[2024-05-26 10:14:52] [INFO ] Invariant cache hit.
[2024-05-26 10:14:52] [INFO ] Implicit Places using invariants in 47 ms returned [31, 37, 39, 43, 47]
Discarding 5 places :
Implicit Place search using SMT only with invariants took 47 ms to find 5 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 46/51 places, 32/32 transitions.
Applied a total of 0 rules in 1 ms. Remains 46 /46 variables (removed 0) and now considering 32/32 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 51 ms. Remains : 46/51 places, 32/32 transitions.
Stuttering acceptance computed with spot in 402 ms :[(OR (NOT p0) p1), (OR (NOT p0) p1), (NOT p0), p1, (AND p2 p1), (AND p1 p2)]
Running random walk in product with property : ResAllocation-PT-R015C002-LTLCardinality-15
Stuttering criterion allowed to conclude after 6209 steps with 819 reset in 12 ms.
FORMULA ResAllocation-PT-R015C002-LTLCardinality-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ResAllocation-PT-R015C002-LTLCardinality-15 finished in 495 ms.
All properties solved by simple procedures.
Total runtime 12153 ms.

BK_STOP 1716718492547

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

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="ResAllocation-PT-R015C002"
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-5568"
echo " Executing tool itstools"
echo " Input is ResAllocation-PT-R015C002, 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 r312-tall-171662339500859"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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