fond
Model Checking Contest 2024
14th edition, Geneva, Switzerland, June 25, 2024
Execution of r113-smll-171624274000003
Last Updated
July 7, 2024

About the Execution of GreatSPN+red for DLCflexbar-PT-2a

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
363.516 46526.00 72439.00 442.60 TTTTFFTFFFFFTFTF normal

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.r113-smll-171624274000003.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 DLCflexbar-PT-2a, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r113-smll-171624274000003
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.1M
-rw-r--r-- 1 mcc users 7.8K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 91K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.6K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 50K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:42 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.4K May 18 16:42 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.5K Apr 22 14:37 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Apr 22 14:37 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Apr 22 14:37 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Apr 22 14:37 LTLFireability.xml
-rw-r--r-- 1 mcc users 14K Apr 12 19:43 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 158K Apr 12 19:43 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.0K Apr 12 18:05 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 76K Apr 12 18:05 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 22 14:37 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Apr 22 14:37 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 3 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 545K 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 DLCflexbar-PT-2a-LTLCardinality-00
FORMULA_NAME DLCflexbar-PT-2a-LTLCardinality-01
FORMULA_NAME DLCflexbar-PT-2a-LTLCardinality-02
FORMULA_NAME DLCflexbar-PT-2a-LTLCardinality-03
FORMULA_NAME DLCflexbar-PT-2a-LTLCardinality-04
FORMULA_NAME DLCflexbar-PT-2a-LTLCardinality-05
FORMULA_NAME DLCflexbar-PT-2a-LTLCardinality-06
FORMULA_NAME DLCflexbar-PT-2a-LTLCardinality-07
FORMULA_NAME DLCflexbar-PT-2a-LTLCardinality-08
FORMULA_NAME DLCflexbar-PT-2a-LTLCardinality-09
FORMULA_NAME DLCflexbar-PT-2a-LTLCardinality-10
FORMULA_NAME DLCflexbar-PT-2a-LTLCardinality-11
FORMULA_NAME DLCflexbar-PT-2a-LTLCardinality-12
FORMULA_NAME DLCflexbar-PT-2a-LTLCardinality-13
FORMULA_NAME DLCflexbar-PT-2a-LTLCardinality-14
FORMULA_NAME DLCflexbar-PT-2a-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1716294083897

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=DLCflexbar-PT-2a
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-21 12:21:26] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2024-05-21 12:21:26] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-21 12:21:27] [INFO ] Load time of PNML (sax parser for PT used): 600 ms
[2024-05-21 12:21:27] [INFO ] Transformed 353 places.
[2024-05-21 12:21:27] [INFO ] Transformed 2169 transitions.
[2024-05-21 12:21:27] [INFO ] Found NUPN structural information;
[2024-05-21 12:21:27] [INFO ] Parsed PT model containing 353 places and 2169 transitions and 8205 arcs in 879 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 27 ms.
Working with output stream class java.io.PrintStream
Ensure Unique test removed 264 transitions
Reduce redundant transitions removed 264 transitions.
Initial state reduction rules removed 1 formulas.
FORMULA DLCflexbar-PT-2a-LTLCardinality-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DLCflexbar-PT-2a-LTLCardinality-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DLCflexbar-PT-2a-LTLCardinality-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DLCflexbar-PT-2a-LTLCardinality-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DLCflexbar-PT-2a-LTLCardinality-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DLCflexbar-PT-2a-LTLCardinality-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DLCflexbar-PT-2a-LTLCardinality-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DLCflexbar-PT-2a-LTLCardinality-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DLCflexbar-PT-2a-LTLCardinality-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DLCflexbar-PT-2a-LTLCardinality-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 20 out of 353 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 353/353 places, 1905/1905 transitions.
Discarding 42 places :
Symmetric choice reduction at 0 with 42 rule applications. Total rules 42 place count 311 transition count 1555
Iterating global reduction 0 with 42 rules applied. Total rules applied 84 place count 311 transition count 1555
Ensure Unique test removed 17 transitions
Reduce isomorphic transitions removed 17 transitions.
Iterating post reduction 0 with 17 rules applied. Total rules applied 101 place count 311 transition count 1538
Drop transitions (Redundant composition of simpler transitions.) removed 459 transitions
Redundant transition composition rules discarded 459 transitions
Iterating global reduction 1 with 459 rules applied. Total rules applied 560 place count 311 transition count 1079
Applied a total of 560 rules in 171 ms. Remains 311 /353 variables (removed 42) and now considering 1079/1905 (removed 826) transitions.
[2024-05-21 12:21:27] [INFO ] Flow matrix only has 207 transitions (discarded 872 similar events)
// Phase 1: matrix 207 rows 311 cols
[2024-05-21 12:21:27] [INFO ] Computed 196 invariants in 23 ms
[2024-05-21 12:21:30] [INFO ] Implicit Places using invariants in 2220 ms returned [139, 140, 141, 142, 143, 144, 145, 146, 147, 149, 150, 151, 152, 153, 154, 155, 156, 157, 158, 159, 160, 161, 162, 163, 164, 166, 167, 168, 169, 170, 171, 172, 173, 174, 175, 176, 177, 178, 179, 180, 182, 183, 184, 185, 186, 187, 188, 189, 190, 191, 192, 193, 194, 195, 196, 197, 198, 199, 200, 201, 202, 204, 205, 206, 207, 208, 209, 210, 211, 212, 213, 214, 215, 216, 217, 218, 219, 221, 222, 223, 224, 225, 226, 227, 228, 229, 230, 231, 232, 233, 234, 235, 236, 237, 238, 239, 240, 241, 242, 243, 244, 246, 247, 248, 249, 250, 251, 252, 253, 254, 255, 256, 257, 258, 259, 260, 261, 262, 263, 265, 266, 267, 268, 269, 270, 271, 272, 273, 274, 275, 276, 277, 278, 279, 280, 281, 282, 283, 284, 285, 286, 287, 288, 289, 290, 291, 292, 293, 294, 295, 296, 297, 298, 299, 300, 302, 303, 304, 305, 306, 307, 308, 310]
Discarding 163 places :
Ensure Unique test removed 764 transitions
Reduce isomorphic transitions removed 764 transitions.
Implicit Place search using SMT only with invariants took 2310 ms to find 163 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 148/353 places, 315/1905 transitions.
Drop transitions (Redundant composition of simpler transitions.) removed 47 transitions
Redundant transition composition rules discarded 47 transitions
Iterating global reduction 0 with 47 rules applied. Total rules applied 47 place count 148 transition count 268
Applied a total of 47 rules in 10 ms. Remains 148 /148 variables (removed 0) and now considering 268/315 (removed 47) transitions.
[2024-05-21 12:21:30] [INFO ] Flow matrix only has 207 transitions (discarded 61 similar events)
// Phase 1: matrix 207 rows 148 cols
[2024-05-21 12:21:30] [INFO ] Computed 33 invariants in 4 ms
[2024-05-21 12:21:30] [INFO ] Implicit Places using invariants in 109 ms returned []
[2024-05-21 12:21:30] [INFO ] Flow matrix only has 207 transitions (discarded 61 similar events)
[2024-05-21 12:21:30] [INFO ] Invariant cache hit.
[2024-05-21 12:21:30] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-21 12:21:30] [INFO ] Implicit Places using invariants and state equation in 244 ms returned []
Implicit Place search using SMT with State Equation took 358 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 148/353 places, 268/1905 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 2882 ms. Remains : 148/353 places, 268/1905 transitions.
Support contains 20 out of 148 places after structural reductions.
[2024-05-21 12:21:31] [INFO ] Flatten gal took : 90 ms
[2024-05-21 12:21:31] [INFO ] Flatten gal took : 35 ms
[2024-05-21 12:21:31] [INFO ] Input system was already deterministic with 268 transitions.
RANDOM walk for 40000 steps (8 resets) in 2244 ms. (17 steps per ms) remains 3/10 properties
BEST_FIRST walk for 40003 steps (8 resets) in 223 ms. (178 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (8 resets) in 171 ms. (232 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 190 ms. (209 steps per ms) remains 3/3 properties
[2024-05-21 12:21:32] [INFO ] Flow matrix only has 207 transitions (discarded 61 similar events)
[2024-05-21 12:21:32] [INFO ] Invariant cache hit.
[2024-05-21 12:21:32] [INFO ] State equation strengthened by 1 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 10/16 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/16 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 132/148 variables, 27/33 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/148 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 206/354 variables, 148/181 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/354 variables, 0/181 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 1/355 variables, 1/182 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/355 variables, 0/182 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 0/355 variables, 0/182 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 355/355 variables, and 182 constraints, problems are : Problem set: 0 solved, 3 unsolved in 296 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, State Equation: 148/148 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
Problem AtomicPropp0 is UNSAT
Problem AtomicPropp1 is UNSAT
Problem AtomicPropp2 is UNSAT
After SMT solving in domain Int declared 16/355 variables, and 6 constraints, problems are : Problem set: 3 solved, 0 unsolved in 41 ms.
Refiners :[Positive P Invariants (semi-flows): 6/33 constraints, State Equation: 0/148 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 0/3 constraints, Known Traps: 0/0 constraints]
After SMT, in 377ms problems are : Problem set: 3 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
FORMULA DLCflexbar-PT-2a-LTLCardinality-05 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 3 atomic propositions for a total of 5 simplifications.
FORMULA DLCflexbar-PT-2a-LTLCardinality-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DLCflexbar-PT-2a-LTLCardinality-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 10 stabilizing places and 1 stable transitions
Graph (complete) has 300 edges and 148 vertex of which 139 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.6 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(p1)&&p0)||(p2&&F(p3))) U p3))'
Support contains 5 out of 148 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 148/148 places, 268/268 transitions.
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 142 transition count 268
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 11 place count 137 transition count 258
Iterating global reduction 1 with 5 rules applied. Total rules applied 16 place count 137 transition count 258
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 18 place count 137 transition count 256
Applied a total of 18 rules in 36 ms. Remains 137 /148 variables (removed 11) and now considering 256/268 (removed 12) transitions.
[2024-05-21 12:21:32] [INFO ] Flow matrix only has 200 transitions (discarded 56 similar events)
// Phase 1: matrix 200 rows 137 cols
[2024-05-21 12:21:32] [INFO ] Computed 27 invariants in 2 ms
[2024-05-21 12:21:32] [INFO ] Implicit Places using invariants in 79 ms returned []
[2024-05-21 12:21:32] [INFO ] Flow matrix only has 200 transitions (discarded 56 similar events)
[2024-05-21 12:21:32] [INFO ] Invariant cache hit.
[2024-05-21 12:21:33] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-21 12:21:33] [INFO ] Implicit Places using invariants and state equation in 249 ms returned []
Implicit Place search using SMT with State Equation took 330 ms to find 0 implicit places.
Running 255 sub problems to find dead transitions.
[2024-05-21 12:21:33] [INFO ] Flow matrix only has 200 transitions (discarded 56 similar events)
[2024-05-21 12:21:33] [INFO ] Invariant cache hit.
[2024-05-21 12:21:33] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/133 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 1 (OVERLAPS) 1/134 variables, 24/24 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/134 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 3 (OVERLAPS) 3/137 variables, 3/27 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/137 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 5 (OVERLAPS) 199/336 variables, 137/164 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/336 variables, 0/164 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 7 (OVERLAPS) 1/337 variables, 1/165 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/337 variables, 0/165 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 9 (OVERLAPS) 0/337 variables, 0/165 constraints. Problems are: Problem set: 0 solved, 255 unsolved
No progress, stopping.
After SMT solving in domain Real declared 337/337 variables, and 165 constraints, problems are : Problem set: 0 solved, 255 unsolved in 19862 ms.
Refiners :[Positive P Invariants (semi-flows): 27/27 constraints, State Equation: 137/137 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 255/255 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 255 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/133 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 1 (OVERLAPS) 1/134 variables, 24/24 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/134 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 3 (OVERLAPS) 3/137 variables, 3/27 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/137 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 5 (OVERLAPS) 199/336 variables, 137/164 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/336 variables, 255/419 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/336 variables, 0/419 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 8 (OVERLAPS) 1/337 variables, 1/420 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/337 variables, 0/420 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 10 (OVERLAPS) 0/337 variables, 0/420 constraints. Problems are: Problem set: 0 solved, 255 unsolved
No progress, stopping.
After SMT solving in domain Int declared 337/337 variables, and 420 constraints, problems are : Problem set: 0 solved, 255 unsolved in 14133 ms.
Refiners :[Positive P Invariants (semi-flows): 27/27 constraints, State Equation: 137/137 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 255/255 constraints, Known Traps: 0/0 constraints]
After SMT, in 34128ms problems are : Problem set: 0 solved, 255 unsolved
Search for dead transitions found 0 dead transitions in 34151ms
Starting structural reductions in LTL mode, iteration 1 : 137/148 places, 256/268 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 34540 ms. Remains : 137/148 places, 256/268 transitions.
Stuttering acceptance computed with spot in 308 ms :[true, (NOT p3), (OR (NOT p3) (NOT p1))]
Running random walk in product with property : DLCflexbar-PT-2a-LTLCardinality-03
Product exploration explored 100000 steps with 50000 reset in 799 ms.
Product exploration explored 100000 steps with 50000 reset in 456 ms.
Computed a total of 4 stabilizing places and 1 stable transitions
Graph (complete) has 282 edges and 137 vertex of which 134 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.2 ms
Computed a total of 4 stabilizing places and 1 stable transitions
Detected a total of 4/137 stabilizing places and 1/256 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/4 atomic propositions.
Knowledge obtained : [(AND (NOT p3) (NOT p0) p2 (NOT p1)), (X (NOT p2)), (X (NOT (AND (NOT p3) p2 p1))), (X (NOT (AND (NOT p3) (NOT p0) (NOT p2)))), (X p3), (X (NOT (AND (NOT p3) p0 (NOT p2)))), (X (NOT (AND (NOT p3) p2))), (X (NOT p0)), (X (OR (AND (NOT p3) (NOT p0) (NOT p2)) (NOT p1))), (X (NOT (AND (NOT p3) p0 (NOT p2) p1))), (X (NOT p1)), (X (X (NOT p2))), (X (X (NOT (AND (NOT p3) p2 p1)))), (X (X (NOT (AND (NOT p3) (NOT p0) (NOT p2))))), (X (X p3)), (X (X (NOT (AND (NOT p3) p0 (NOT p2))))), (X (X (NOT (AND (NOT p3) p2)))), (X (X (NOT p0))), (X (X (OR (AND (NOT p3) (NOT p0) (NOT p2)) (NOT p1)))), (X (X (NOT (AND (NOT p3) p0 (NOT p2) p1)))), (X (X (NOT p1))), (F (OR (G p3) (G (NOT p3))))]
False Knowledge obtained : []
Property proved to be true thanks to conjunction of knowledge (Minato strategy)
Knowledge based reduction with 22 factoid took 189 ms. Reduced automaton from 3 states, 7 edges and 4 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA DLCflexbar-PT-2a-LTLCardinality-03 TRUE TECHNIQUES KNOWLEDGE
Treatment of property DLCflexbar-PT-2a-LTLCardinality-03 finished in 36449 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))'
Support contains 5 out of 148 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 148/148 places, 268/268 transitions.
Graph (trivial) has 255 edges and 148 vertex of which 131 / 148 are part of one of the 23 SCC in 4 ms
Free SCC test removed 108 places
Ensure Unique test removed 229 transitions
Reduce isomorphic transitions removed 229 transitions.
Graph (complete) has 71 edges and 40 vertex of which 33 are kept as prefixes of interest. Removing 7 places using SCC suffix rule.0 ms
Discarding 7 places :
Also discarding 0 output transitions
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 4 place count 33 transition count 37
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 7 place count 31 transition count 36
Discarding 20 places :
Symmetric choice reduction at 2 with 20 rule applications. Total rules 27 place count 11 transition count 16
Iterating global reduction 2 with 20 rules applied. Total rules applied 47 place count 11 transition count 16
Applied a total of 47 rules in 24 ms. Remains 11 /148 variables (removed 137) and now considering 16/268 (removed 252) transitions.
[2024-05-21 12:22:09] [INFO ] Flow matrix only has 10 transitions (discarded 6 similar events)
// Phase 1: matrix 10 rows 11 cols
[2024-05-21 12:22:09] [INFO ] Computed 6 invariants in 0 ms
[2024-05-21 12:22:09] [INFO ] Implicit Places using invariants in 27 ms returned []
[2024-05-21 12:22:09] [INFO ] Flow matrix only has 10 transitions (discarded 6 similar events)
[2024-05-21 12:22:09] [INFO ] Invariant cache hit.
[2024-05-21 12:22:09] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-21 12:22:09] [INFO ] Implicit Places using invariants and state equation in 32 ms returned []
Implicit Place search using SMT with State Equation took 60 ms to find 0 implicit places.
[2024-05-21 12:22:09] [INFO ] Redundant transitions in 0 ms returned []
Running 15 sub problems to find dead transitions.
[2024-05-21 12:22:09] [INFO ] Flow matrix only has 10 transitions (discarded 6 similar events)
[2024-05-21 12:22:09] [INFO ] Invariant cache hit.
[2024-05-21 12:22:09] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 1 (OVERLAPS) 1/9 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/9 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 3 (OVERLAPS) 2/11 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/11 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 5 (OVERLAPS) 9/20 variables, 11/17 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/20 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 7 (OVERLAPS) 1/21 variables, 1/18 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/21 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 9 (OVERLAPS) 0/21 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 15 unsolved
No progress, stopping.
After SMT solving in domain Real declared 21/21 variables, and 18 constraints, problems are : Problem set: 0 solved, 15 unsolved in 282 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 11/11 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 15/15 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 15 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 1 (OVERLAPS) 1/9 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/9 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 3 (OVERLAPS) 2/11 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/11 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 5 (OVERLAPS) 9/20 variables, 11/17 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/20 variables, 15/32 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/20 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 8 (OVERLAPS) 1/21 variables, 1/33 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/21 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 10 (OVERLAPS) 0/21 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 15 unsolved
No progress, stopping.
After SMT solving in domain Int declared 21/21 variables, and 33 constraints, problems are : Problem set: 0 solved, 15 unsolved in 281 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 11/11 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 15/15 constraints, Known Traps: 0/0 constraints]
After SMT, in 576ms problems are : Problem set: 0 solved, 15 unsolved
Search for dead transitions found 0 dead transitions in 577ms
Starting structural reductions in SI_LTL mode, iteration 1 : 11/148 places, 16/268 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 668 ms. Remains : 11/148 places, 16/268 transitions.
Stuttering acceptance computed with spot in 54 ms :[(NOT p0)]
Running random walk in product with property : DLCflexbar-PT-2a-LTLCardinality-04
Stuttering criterion allowed to conclude after 1 steps with 0 reset in 1 ms.
FORMULA DLCflexbar-PT-2a-LTLCardinality-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DLCflexbar-PT-2a-LTLCardinality-04 finished in 736 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(G(p0)))'
Support contains 2 out of 148 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 148/148 places, 268/268 transitions.
Graph (trivial) has 258 edges and 148 vertex of which 130 / 148 are part of one of the 23 SCC in 1 ms
Free SCC test removed 107 places
Ensure Unique test removed 229 transitions
Reduce isomorphic transitions removed 229 transitions.
Graph (complete) has 71 edges and 41 vertex of which 32 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.1 ms
Discarding 9 places :
Also discarding 0 output transitions
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 4 place count 32 transition count 37
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 6 place count 30 transition count 37
Discarding 22 places :
Symmetric choice reduction at 2 with 22 rule applications. Total rules 28 place count 8 transition count 14
Iterating global reduction 2 with 22 rules applied. Total rules applied 50 place count 8 transition count 14
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 2 rules applied. Total rules applied 52 place count 8 transition count 12
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 54 place count 7 transition count 11
Applied a total of 54 rules in 8 ms. Remains 7 /148 variables (removed 141) and now considering 11/268 (removed 257) transitions.
[2024-05-21 12:22:09] [INFO ] Flow matrix only has 8 transitions (discarded 3 similar events)
// Phase 1: matrix 8 rows 7 cols
[2024-05-21 12:22:09] [INFO ] Computed 3 invariants in 0 ms
[2024-05-21 12:22:09] [INFO ] Implicit Places using invariants in 27 ms returned []
[2024-05-21 12:22:09] [INFO ] Flow matrix only has 8 transitions (discarded 3 similar events)
[2024-05-21 12:22:09] [INFO ] Invariant cache hit.
[2024-05-21 12:22:09] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-21 12:22:09] [INFO ] Implicit Places using invariants and state equation in 34 ms returned []
Implicit Place search using SMT with State Equation took 63 ms to find 0 implicit places.
[2024-05-21 12:22:09] [INFO ] Redundant transitions in 0 ms returned []
Running 10 sub problems to find dead transitions.
[2024-05-21 12:22:09] [INFO ] Flow matrix only has 8 transitions (discarded 3 similar events)
[2024-05-21 12:22:09] [INFO ] Invariant cache hit.
[2024-05-21 12:22:09] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 1 (OVERLAPS) 1/7 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/7 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 3 (OVERLAPS) 7/14 variables, 7/10 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/14 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 5 (OVERLAPS) 1/15 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/15 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 7 (OVERLAPS) 0/15 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 10 unsolved
No progress, stopping.
After SMT solving in domain Real declared 15/15 variables, and 11 constraints, problems are : Problem set: 0 solved, 10 unsolved in 180 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 7/7 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 10/10 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 10 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 1 (OVERLAPS) 1/7 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/7 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 3 (OVERLAPS) 7/14 variables, 7/10 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/14 variables, 10/20 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/14 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 6 (OVERLAPS) 1/15 variables, 1/21 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/15 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 8 (OVERLAPS) 0/15 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 10 unsolved
No progress, stopping.
After SMT solving in domain Int declared 15/15 variables, and 21 constraints, problems are : Problem set: 0 solved, 10 unsolved in 194 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 7/7 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 10/10 constraints, Known Traps: 0/0 constraints]
After SMT, in 385ms problems are : Problem set: 0 solved, 10 unsolved
Search for dead transitions found 0 dead transitions in 386ms
Starting structural reductions in SI_LTL mode, iteration 1 : 7/148 places, 11/268 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 464 ms. Remains : 7/148 places, 11/268 transitions.
Stuttering acceptance computed with spot in 52 ms :[(NOT p0)]
Running random walk in product with property : DLCflexbar-PT-2a-LTLCardinality-13
Stuttering criterion allowed to conclude after 6 steps with 0 reset in 1 ms.
FORMULA DLCflexbar-PT-2a-LTLCardinality-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DLCflexbar-PT-2a-LTLCardinality-13 finished in 543 ms.
All properties solved by simple procedures.
Total runtime 43878 ms.
ITS solved all properties within timeout

BK_STOP 1716294130423

--------------------
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 LTLCardinality -timeout 360 -rebuildPNML

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="DLCflexbar-PT-2a"
export BK_EXAMINATION="LTLCardinality"
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 DLCflexbar-PT-2a, 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 r113-smll-171624274000003"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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