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.r069-tall-171620504000193.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 greatspnxred
Input is CSRepetitions-COL-04, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r069-tall-171620504000193
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 548K
-rw-r--r-- 1 mcc users 10K Apr 12 09:27 CTLCardinality.txt
-rw-r--r-- 1 mcc users 90K Apr 12 09:27 CTLCardinality.xml
-rw-r--r-- 1 mcc users 8.3K Apr 12 09:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 69K Apr 12 09:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:42 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K May 18 16:42 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 4.4K Apr 22 14:32 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Apr 22 14:32 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.6K Apr 22 14:32 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 22 14:32 LTLFireability.xml
-rw-r--r-- 1 mcc users 14K Apr 12 09:41 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 116K Apr 12 09:41 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 14K Apr 12 09:37 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 100K Apr 12 09:37 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Apr 22 14:32 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K Apr 22 14:32 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:42 equiv_pt
-rw-r--r-- 1 mcc users 3 May 18 16:42 instance
-rw-r--r-- 1 mcc users 5 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 14K May 18 16:42 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 CSRepetitions-COL-04-CTLCardinality-2024-00
FORMULA_NAME CSRepetitions-COL-04-CTLCardinality-2024-01
FORMULA_NAME CSRepetitions-COL-04-CTLCardinality-2024-02
FORMULA_NAME CSRepetitions-COL-04-CTLCardinality-2024-03
FORMULA_NAME CSRepetitions-COL-04-CTLCardinality-2024-04
FORMULA_NAME CSRepetitions-COL-04-CTLCardinality-2024-05
FORMULA_NAME CSRepetitions-COL-04-CTLCardinality-2024-06
FORMULA_NAME CSRepetitions-COL-04-CTLCardinality-2024-07
FORMULA_NAME CSRepetitions-COL-04-CTLCardinality-2024-08
FORMULA_NAME CSRepetitions-COL-04-CTLCardinality-2024-09
FORMULA_NAME CSRepetitions-COL-04-CTLCardinality-2024-10
FORMULA_NAME CSRepetitions-COL-04-CTLCardinality-2024-11
FORMULA_NAME CSRepetitions-COL-04-CTLCardinality-2024-12
FORMULA_NAME CSRepetitions-COL-04-CTLCardinality-2024-13
FORMULA_NAME CSRepetitions-COL-04-CTLCardinality-2024-14
FORMULA_NAME CSRepetitions-COL-04-CTLCardinality-2024-15

=== Now, execution of the tool begins

BK_START 1716413571170

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=CTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=CSRepetitions-COL-04
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-22 21:32:52] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -timeout, 360, -rebuildPNML]
[2024-05-22 21:32:52] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-22 21:32:52] [INFO ] Detected file is not PT type :http://www.pnml.org/version-2009/grammar/symmetricnet
log4j:WARN No appenders could be found for logger (org.apache.axiom.locator.DefaultOMMetaFactoryLocator).
log4j:WARN Please initialize the log4j system properly.
log4j:WARN See http://logging.apache.org/log4j/1.2/faq.html#noconfig for more info.
[2024-05-22 21:32:52] [WARNING] Using fallBack plugin, rng conformance not checked
[2024-05-22 21:32:52] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 521 ms
[2024-05-22 21:32:52] [INFO ] Imported 6 HL places and 5 HL transitions for a total of 117 PT places and 176.0 transition bindings in 14 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 37 ms.
[2024-05-22 21:32:53] [INFO ] Built PT skeleton of HLPN with 6 places and 5 transitions 15 arcs in 4 ms.
[2024-05-22 21:32:53] [INFO ] Skeletonized 16 HLPN properties in 2 ms.
Computed a total of 0 stabilizing places and 1 stable transitions
Remains 16 properties that can be checked using skeleton over-approximation.
Computed a total of 0 stabilizing places and 1 stable transitions
RANDOM walk for 40013 steps (923 resets) in 1382 ms. (28 steps per ms) remains 67/92 properties
BEST_FIRST walk for 4003 steps (40 resets) in 20 ms. (190 steps per ms) remains 67/67 properties
BEST_FIRST walk for 4002 steps (56 resets) in 63 ms. (62 steps per ms) remains 67/67 properties
BEST_FIRST walk for 4004 steps (25 resets) in 52 ms. (75 steps per ms) remains 67/67 properties
BEST_FIRST walk for 4004 steps (44 resets) in 19 ms. (200 steps per ms) remains 67/67 properties
BEST_FIRST walk for 4004 steps (54 resets) in 21 ms. (182 steps per ms) remains 67/67 properties
BEST_FIRST walk for 4004 steps (56 resets) in 20 ms. (190 steps per ms) remains 67/67 properties
BEST_FIRST walk for 4014 steps (35 resets) in 34 ms. (114 steps per ms) remains 67/67 properties
BEST_FIRST walk for 4004 steps (24 resets) in 29 ms. (133 steps per ms) remains 67/67 properties
BEST_FIRST walk for 4001 steps (36 resets) in 25 ms. (153 steps per ms) remains 67/67 properties
BEST_FIRST walk for 4002 steps (25 resets) in 35 ms. (111 steps per ms) remains 67/67 properties
BEST_FIRST walk for 4004 steps (32 resets) in 36 ms. (108 steps per ms) remains 67/67 properties
BEST_FIRST walk for 4003 steps (25 resets) in 24 ms. (160 steps per ms) remains 67/67 properties
BEST_FIRST walk for 4000 steps (8 resets) in 29 ms. (133 steps per ms) remains 67/67 properties
BEST_FIRST walk for 4003 steps (26 resets) in 32 ms. (121 steps per ms) remains 67/67 properties
BEST_FIRST walk for 4009 steps (42 resets) in 21 ms. (182 steps per ms) remains 67/67 properties
BEST_FIRST walk for 4004 steps (56 resets) in 27 ms. (143 steps per ms) remains 67/67 properties
BEST_FIRST walk for 4004 steps (26 resets) in 15 ms. (250 steps per ms) remains 67/67 properties
BEST_FIRST walk for 4004 steps (9 resets) in 18 ms. (210 steps per ms) remains 67/67 properties
BEST_FIRST walk for 4004 steps (25 resets) in 12 ms. (308 steps per ms) remains 67/67 properties
BEST_FIRST walk for 4003 steps (54 resets) in 14 ms. (266 steps per ms) remains 67/67 properties
BEST_FIRST walk for 4004 steps (24 resets) in 15 ms. (250 steps per ms) remains 67/67 properties
BEST_FIRST walk for 4004 steps (24 resets) in 18 ms. (210 steps per ms) remains 67/67 properties
BEST_FIRST walk for 4000 steps (8 resets) in 23 ms. (166 steps per ms) remains 67/67 properties
BEST_FIRST walk for 4003 steps (23 resets) in 27 ms. (142 steps per ms) remains 67/67 properties
BEST_FIRST walk for 4002 steps (24 resets) in 13 ms. (285 steps per ms) remains 67/67 properties
BEST_FIRST walk for 4003 steps (25 resets) in 15 ms. (250 steps per ms) remains 67/67 properties
BEST_FIRST walk for 4003 steps (56 resets) in 19 ms. (200 steps per ms) remains 67/67 properties
BEST_FIRST walk for 4013 steps (57 resets) in 13 ms. (286 steps per ms) remains 67/67 properties
BEST_FIRST walk for 4000 steps (8 resets) in 20 ms. (190 steps per ms) remains 67/67 properties
BEST_FIRST walk for 4003 steps (38 resets) in 17 ms. (222 steps per ms) remains 67/67 properties
BEST_FIRST walk for 4003 steps (23 resets) in 14 ms. (266 steps per ms) remains 67/67 properties
BEST_FIRST walk for 4002 steps (56 resets) in 14 ms. (266 steps per ms) remains 67/67 properties
BEST_FIRST walk for 4000 steps (8 resets) in 18 ms. (210 steps per ms) remains 67/67 properties
BEST_FIRST walk for 4001 steps (25 resets) in 16 ms. (235 steps per ms) remains 67/67 properties
BEST_FIRST walk for 4000 steps (8 resets) in 22 ms. (173 steps per ms) remains 67/67 properties
BEST_FIRST walk for 4003 steps (23 resets) in 16 ms. (235 steps per ms) remains 67/67 properties
BEST_FIRST walk for 4012 steps (58 resets) in 11 ms. (334 steps per ms) remains 67/67 properties
BEST_FIRST walk for 4000 steps (8 resets) in 20 ms. (190 steps per ms) remains 67/67 properties
BEST_FIRST walk for 4000 steps (8 resets) in 20 ms. (190 steps per ms) remains 67/67 properties
BEST_FIRST walk for 4000 steps (8 resets) in 19 ms. (200 steps per ms) remains 67/67 properties
BEST_FIRST walk for 4000 steps (8 resets) in 20 ms. (190 steps per ms) remains 67/67 properties
BEST_FIRST walk for 4004 steps (8 resets) in 17 ms. (222 steps per ms) remains 67/67 properties
BEST_FIRST walk for 4002 steps (35 resets) in 25 ms. (153 steps per ms) remains 67/67 properties
BEST_FIRST walk for 4004 steps (24 resets) in 14 ms. (266 steps per ms) remains 67/67 properties
BEST_FIRST walk for 4002 steps (23 resets) in 14 ms. (266 steps per ms) remains 67/67 properties
BEST_FIRST walk for 4000 steps (8 resets) in 25 ms. (153 steps per ms) remains 67/67 properties
BEST_FIRST walk for 4007 steps (55 resets) in 14 ms. (267 steps per ms) remains 67/67 properties
BEST_FIRST walk for 4001 steps (22 resets) in 20 ms. (190 steps per ms) remains 67/67 properties
BEST_FIRST walk for 4004 steps (37 resets) in 21 ms. (182 steps per ms) remains 67/67 properties
BEST_FIRST walk for 4000 steps (8 resets) in 15 ms. (250 steps per ms) remains 67/67 properties
// Phase 1: matrix 5 rows 6 cols
[2024-05-22 21:32:54] [INFO ] Computed 2 invariants in 6 ms
[2024-05-22 21:32:54] [INFO ] State equation strengthened by 1 read => feed constraints.
Problem AtomicPropp0 is UNSAT
Problem AtomicPropp1 is UNSAT
Problem AtomicPropp3 is UNSAT
Problem AtomicPropp4 is UNSAT
Problem AtomicPropp5 is UNSAT
Problem AtomicPropp6 is UNSAT
Problem AtomicPropp8 is UNSAT
Problem AtomicPropp11 is UNSAT
Problem AtomicPropp12 is UNSAT
Problem AtomicPropp16 is UNSAT
Problem AtomicPropp17 is UNSAT
Problem AtomicPropp18 is UNSAT
Problem AtomicPropp20 is UNSAT
Problem AtomicPropp24 is UNSAT
Problem AtomicPropp36 is UNSAT
Problem AtomicPropp37 is UNSAT
Problem AtomicPropp38 is UNSAT
Problem AtomicPropp43 is UNSAT
Problem AtomicPropp46 is UNSAT
Problem AtomicPropp49 is UNSAT
Problem AtomicPropp52 is UNSAT
Problem AtomicPropp59 is UNSAT
Problem AtomicPropp64 is UNSAT
Problem AtomicPropp65 is UNSAT
Problem AtomicPropp66 is UNSAT
Problem AtomicPropp68 is UNSAT
Problem AtomicPropp69 is UNSAT
Problem AtomicPropp72 is UNSAT
Problem AtomicPropp73 is UNSAT
Problem AtomicPropp74 is UNSAT
Problem AtomicPropp75 is UNSAT
Problem AtomicPropp76 is UNSAT
Problem AtomicPropp77 is UNSAT
Problem AtomicPropp78 is UNSAT
Problem AtomicPropp80 is UNSAT
Problem AtomicPropp81 is UNSAT
Problem AtomicPropp83 is UNSAT
Problem AtomicPropp86 is UNSAT
Problem AtomicPropp87 is UNSAT
Problem AtomicPropp89 is UNSAT
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 2/2 constraints. Problems are: Problem set: 40 solved, 27 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/6 variables, 0/2 constraints. Problems are: Problem set: 40 solved, 27 unsolved
Problem AtomicPropp2 is UNSAT
Problem AtomicPropp7 is UNSAT
Problem AtomicPropp10 is UNSAT
Problem AtomicPropp13 is UNSAT
Problem AtomicPropp19 is UNSAT
Problem AtomicPropp22 is UNSAT
Problem AtomicPropp26 is UNSAT
Problem AtomicPropp27 is UNSAT
Problem AtomicPropp29 is UNSAT
Problem AtomicPropp31 is UNSAT
Problem AtomicPropp33 is UNSAT
Problem AtomicPropp40 is UNSAT
Problem AtomicPropp45 is UNSAT
Problem AtomicPropp48 is UNSAT
Problem AtomicPropp50 is UNSAT
Problem AtomicPropp51 is UNSAT
Problem AtomicPropp54 is UNSAT
Problem AtomicPropp55 is UNSAT
Problem AtomicPropp56 is UNSAT
Problem AtomicPropp57 is UNSAT
Problem AtomicPropp58 is UNSAT
Problem AtomicPropp60 is UNSAT
Problem AtomicPropp61 is UNSAT
Problem AtomicPropp62 is UNSAT
Problem AtomicPropp67 is UNSAT
Problem AtomicPropp70 is UNSAT
Problem AtomicPropp71 is UNSAT
After SMT solving in domain Real declared 11/11 variables, and 8 constraints, problems are : Problem set: 67 solved, 0 unsolved in 234 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 6/6 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 67/67 constraints, Known Traps: 0/0 constraints]
After SMT, in 296ms problems are : Problem set: 67 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Successfully simplified 67 atomic propositions for a total of 16 simplifications.
FORMULA CSRepetitions-COL-04-CTLCardinality-2024-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CSRepetitions-COL-04-CTLCardinality-2024-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CSRepetitions-COL-04-CTLCardinality-2024-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-22 21:32:54] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2024-05-22 21:32:54] [INFO ] Flatten gal took : 14 ms
[2024-05-22 21:32:54] [INFO ] Initial state reduction rules for CTL removed 5 formulas.
FORMULA CSRepetitions-COL-04-CTLCardinality-2024-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CSRepetitions-COL-04-CTLCardinality-2024-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CSRepetitions-COL-04-CTLCardinality-2024-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CSRepetitions-COL-04-CTLCardinality-2024-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CSRepetitions-COL-04-CTLCardinality-2024-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CSRepetitions-COL-04-CTLCardinality-2024-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-22 21:32:54] [INFO ] Flatten gal took : 1 ms
Transition Send_Answer forces synchronizations/join behavior on parameter c of sort Client
Symmetric sort wr.t. initial and guards and successors and join/free detected :Server
Symmetric sort wr.t. initial detected :Server
Symmetric sort wr.t. initial and guards detected :Server
Applying symmetric unfolding of full symmetric sort :Server domain size was 4
[2024-05-22 21:32:54] [INFO ] Unfolded HLPN to a Petri net with 66 places and 80 transitions 240 arcs in 10 ms.
[2024-05-22 21:32:54] [INFO ] Unfolded 7 HLPN properties in 1 ms.
Support contains 66 out of 66 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 66/66 places, 80/80 transitions.
Applied a total of 0 rules in 5 ms. Remains 66 /66 variables (removed 0) and now considering 80/80 (removed 0) transitions.
// Phase 1: matrix 80 rows 66 cols
[2024-05-22 21:32:54] [INFO ] Computed 17 invariants in 5 ms
[2024-05-22 21:32:54] [INFO ] Implicit Places using invariants in 50 ms returned []
[2024-05-22 21:32:54] [INFO ] Invariant cache hit.
[2024-05-22 21:32:54] [INFO ] State equation strengthened by 16 read => feed constraints.
[2024-05-22 21:32:54] [INFO ] Implicit Places using invariants and state equation in 76 ms returned []
Implicit Place search using SMT with State Equation took 143 ms to find 0 implicit places.
Running 64 sub problems to find dead transitions.
[2024-05-22 21:32:54] [INFO ] Invariant cache hit.
[2024-05-22 21:32:54] [INFO ] State equation strengthened by 16 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/50 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/50 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 2 (OVERLAPS) 16/66 variables, 16/17 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/66 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 4 (OVERLAPS) 80/146 variables, 66/83 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/146 variables, 16/99 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/146 variables, 0/99 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 7 (OVERLAPS) 0/146 variables, 0/99 constraints. Problems are: Problem set: 0 solved, 64 unsolved
No progress, stopping.
After SMT solving in domain Real declared 146/146 variables, and 99 constraints, problems are : Problem set: 0 solved, 64 unsolved in 1112 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, State Equation: 66/66 constraints, ReadFeed: 16/16 constraints, PredecessorRefiner: 64/64 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 64 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/50 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/50 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 2 (OVERLAPS) 16/66 variables, 16/17 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/66 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 4 (OVERLAPS) 80/146 variables, 66/83 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/146 variables, 16/99 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/146 variables, 64/163 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/146 variables, 0/163 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 8 (OVERLAPS) 0/146 variables, 0/163 constraints. Problems are: Problem set: 0 solved, 64 unsolved
No progress, stopping.
After SMT solving in domain Int declared 146/146 variables, and 163 constraints, problems are : Problem set: 0 solved, 64 unsolved in 973 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, State Equation: 66/66 constraints, ReadFeed: 16/16 constraints, PredecessorRefiner: 64/64 constraints, Known Traps: 0/0 constraints]
After SMT, in 2129ms problems are : Problem set: 0 solved, 64 unsolved
Search for dead transitions found 0 dead transitions in 2131ms
Finished structural reductions in LTL mode , in 1 iterations and 2292 ms. Remains : 66/66 places, 80/80 transitions.
Support contains 66 out of 66 places after structural reductions.
[2024-05-22 21:32:56] [INFO ] Flatten gal took : 10 ms
[2024-05-22 21:32:56] [INFO ] Flatten gal took : 9 ms
[2024-05-22 21:32:56] [INFO ] Input system was already deterministic with 80 transitions.
RANDOM walk for 40003 steps (1072 resets) in 1400 ms. (28 steps per ms) remains 22/36 properties
BEST_FIRST walk for 4000 steps (8 resets) in 25 ms. (153 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4004 steps (8 resets) in 10 ms. (364 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4004 steps (10 resets) in 14 ms. (266 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4004 steps (10 resets) in 20 ms. (190 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4003 steps (8 resets) in 14 ms. (266 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4002 steps (10 resets) in 15 ms. (250 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4004 steps (8 resets) in 18 ms. (210 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4003 steps (9 resets) in 9 ms. (400 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4004 steps (11 resets) in 10 ms. (364 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4004 steps (8 resets) in 10 ms. (364 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4004 steps (8 resets) in 17 ms. (222 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4004 steps (8 resets) in 10 ms. (364 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4004 steps (8 resets) in 9 ms. (400 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4004 steps (8 resets) in 7 ms. (500 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4004 steps (8 resets) in 9 ms. (400 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4004 steps (10 resets) in 10 ms. (364 steps per ms) remains 22/22 properties
[2024-05-22 21:32:57] [INFO ] Invariant cache hit.
[2024-05-22 21:32:57] [INFO ] State equation strengthened by 16 read => feed constraints.
Problem AtomicPropp0 is UNSAT
Problem AtomicPropp1 is UNSAT
Problem AtomicPropp15 is UNSAT
Problem AtomicPropp16 is UNSAT
Problem AtomicPropp17 is UNSAT
Problem AtomicPropp18 is UNSAT
Problem AtomicPropp27 is UNSAT
Problem AtomicPropp28 is UNSAT
Problem AtomicPropp30 is UNSAT
Problem AtomicPropp32 is UNSAT
At refinement iteration 0 (INCLUDED_ONLY) 0/66 variables, 17/17 constraints. Problems are: Problem set: 10 solved, 12 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/66 variables, 0/17 constraints. Problems are: Problem set: 10 solved, 12 unsolved
Problem AtomicPropp2 is UNSAT
Problem AtomicPropp5 is UNSAT
Problem AtomicPropp8 is UNSAT
Problem AtomicPropp10 is UNSAT
Problem AtomicPropp12 is UNSAT
Problem AtomicPropp20 is UNSAT
Problem AtomicPropp22 is UNSAT
Problem AtomicPropp23 is UNSAT
Problem AtomicPropp24 is UNSAT
Problem AtomicPropp25 is UNSAT
Problem AtomicPropp26 is UNSAT
Problem AtomicPropp29 is UNSAT
After SMT solving in domain Real declared 146/146 variables, and 83 constraints, problems are : Problem set: 22 solved, 0 unsolved in 112 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, State Equation: 66/66 constraints, ReadFeed: 0/16 constraints, PredecessorRefiner: 22/22 constraints, Known Traps: 0/0 constraints]
After SMT, in 152ms problems are : Problem set: 22 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Successfully simplified 22 atomic propositions for a total of 7 simplifications.
[2024-05-22 21:32:57] [INFO ] Flatten gal took : 15 ms
[2024-05-22 21:32:57] [INFO ] Flatten gal took : 5 ms
[2024-05-22 21:32:57] [INFO ] Input system was already deterministic with 80 transitions.
Computed a total of 0 stabilizing places and 16 stable transitions
Starting structural reductions in SI_CTL mode, iteration 0 : 66/66 places, 80/80 transitions.
Applied a total of 0 rules in 8 ms. Remains 66 /66 variables (removed 0) and now considering 80/80 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 8 ms. Remains : 66/66 places, 80/80 transitions.
[2024-05-22 21:32:57] [INFO ] Flatten gal took : 5 ms
[2024-05-22 21:32:57] [INFO ] Flatten gal took : 5 ms
[2024-05-22 21:32:57] [INFO ] Input system was already deterministic with 80 transitions.
Starting structural reductions in LTL mode, iteration 0 : 66/66 places, 80/80 transitions.
Applied a total of 0 rules in 1 ms. Remains 66 /66 variables (removed 0) and now considering 80/80 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 66/66 places, 80/80 transitions.
[2024-05-22 21:32:57] [INFO ] Flatten gal took : 4 ms
[2024-05-22 21:32:57] [INFO ] Flatten gal took : 5 ms
[2024-05-22 21:32:57] [INFO ] Input system was already deterministic with 80 transitions.
Starting structural reductions in LTL mode, iteration 0 : 66/66 places, 80/80 transitions.
Applied a total of 0 rules in 1 ms. Remains 66 /66 variables (removed 0) and now considering 80/80 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 66/66 places, 80/80 transitions.
[2024-05-22 21:32:57] [INFO ] Flatten gal took : 4 ms
[2024-05-22 21:32:57] [INFO ] Flatten gal took : 4 ms
[2024-05-22 21:32:57] [INFO ] Input system was already deterministic with 80 transitions.
Starting structural reductions in LTL mode, iteration 0 : 66/66 places, 80/80 transitions.
Applied a total of 0 rules in 2 ms. Remains 66 /66 variables (removed 0) and now considering 80/80 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2 ms. Remains : 66/66 places, 80/80 transitions.
[2024-05-22 21:32:57] [INFO ] Flatten gal took : 4 ms
[2024-05-22 21:32:57] [INFO ] Flatten gal took : 4 ms
[2024-05-22 21:32:57] [INFO ] Input system was already deterministic with 80 transitions.
Starting structural reductions in LTL mode, iteration 0 : 66/66 places, 80/80 transitions.
Applied a total of 0 rules in 1 ms. Remains 66 /66 variables (removed 0) and now considering 80/80 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 66/66 places, 80/80 transitions.
[2024-05-22 21:32:57] [INFO ] Flatten gal took : 5 ms
[2024-05-22 21:32:57] [INFO ] Flatten gal took : 4 ms
[2024-05-22 21:32:57] [INFO ] Input system was already deterministic with 80 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 66/66 places, 80/80 transitions.
Applied a total of 0 rules in 3 ms. Remains 66 /66 variables (removed 0) and now considering 80/80 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 3 ms. Remains : 66/66 places, 80/80 transitions.
[2024-05-22 21:32:57] [INFO ] Flatten gal took : 4 ms
[2024-05-22 21:32:57] [INFO ] Flatten gal took : 4 ms
[2024-05-22 21:32:57] [INFO ] Input system was already deterministic with 80 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 66/66 places, 80/80 transitions.
Applied a total of 0 rules in 2 ms. Remains 66 /66 variables (removed 0) and now considering 80/80 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 2 ms. Remains : 66/66 places, 80/80 transitions.
[2024-05-22 21:32:57] [INFO ] Flatten gal took : 4 ms
[2024-05-22 21:32:57] [INFO ] Flatten gal took : 5 ms
[2024-05-22 21:32:57] [INFO ] Input system was already deterministic with 80 transitions.
[2024-05-22 21:32:57] [INFO ] Flatten gal took : 4 ms
[2024-05-22 21:32:57] [INFO ] Flatten gal took : 5 ms
[2024-05-22 21:32:57] [INFO ] Export to MCC of 7 properties in file /home/mcc/execution/CTLCardinality.sr.xml took 2 ms.
[2024-05-22 21:32:57] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 66 places, 80 transitions and 240 arcs took 4 ms.
Total runtime 5535 ms.
There are residual formulas that ITS could not solve within timeout
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------

Running CSRepetitions-COL-04

IS_COLORED=
IS_NUPN=

LOADING PETRI NET FILE /home/mcc/execution/408/model.pnml (PNML) ...
PNML VERSION 2009, P/T NET.
COLOR CLASSES: 0
CONSTANTS: 0
PLACES: 66
TRANSITIONS: 80
COLOR VARS: 0
MEASURES: 0
LOADING TIME: [User 0.000s, Sys 0.004s]


SAVING FILE /home/mcc/execution/408/model (.net / .def) ...
EXPORT TIME: [User 0.000s, Sys 0.000s]


----------------------------------------------------------------------
GreatSPN/Meddly.
Copyright (C) 1987-2022, University of Torino, Italy.
website: https://github.com/greatspn/SOURCES

Based on MEDDLY version 0.16.0
Copyright (C) 2009, Iowa State University Research Foundation, Inc.
website: http://meddly.sourceforge.net

Process ID: 536
MODEL NAME: /home/mcc/execution/408/model
66 places, 80 transitions.

Creating all event NSFs..
Creating all event NSFs..
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Creating all event NSFs..
Split: SplitSubtract
Start RS construction.
Creating all event NSFs..
Split: SplitSubtract
Start RS construction.
Building monolithic NSF...
FORMULA CSRepetitions-COL-04-CTLCardinality-2024-09 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA CSRepetitions-COL-04-CTLCardinality-2024-06 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA CSRepetitions-COL-04-CTLCardinality-2024-05 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA CSRepetitions-COL-04-CTLCardinality-2024-13 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA CSRepetitions-COL-04-CTLCardinality-2024-11 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA CSRepetitions-COL-04-CTLCardinality-2024-02 CANNOT_COMPUTE
FORMULA CSRepetitions-COL-04-CTLCardinality-2024-15 CANNOT_COMPUTE
Ok.
EXITCODE: 0
----------------------------------------------------------------------

BK_STOP 1716414238536

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

+ 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//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination CTLCardinality -timeout 360 -rebuildPNML
MEDDLY ERROR: Insufficient memory

MEDDLY ERROR: Insufficient memory

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="CSRepetitions-COL-04"
export BK_EXAMINATION="CTLCardinality"
export BK_TOOL="greatspnxred"
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 greatspnxred"
echo " Input is CSRepetitions-COL-04, examination is CTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r069-tall-171620504000193"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/CSRepetitions-COL-04.tgz
mv CSRepetitions-COL-04 execution
cd execution
if [ "CTLCardinality" = "ReachabilityDeadlock" ] || [ "CTLCardinality" = "UpperBounds" ] || [ "CTLCardinality" = "QuasiLiveness" ] || [ "CTLCardinality" = "StableMarking" ] || [ "CTLCardinality" = "Liveness" ] || [ "CTLCardinality" = "OneSafe" ] || [ "CTLCardinality" = "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 [ "CTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "CTLCardinality" != "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 "CTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property CTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "CTLCardinality.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 '' CTLCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "CTLCardinality" = "ReachabilityDeadlock" ] || [ "CTLCardinality" = "QuasiLiveness" ] || [ "CTLCardinality" = "StableMarking" ] || [ "CTLCardinality" = "Liveness" ] || [ "CTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME CTLCardinality"
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 ;