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.r025-smll-171620166400355.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 AutonomousCar-PT-09b, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r025-smll-171620166400355
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.3M
-rw-r--r-- 1 mcc users 7.2K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 79K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.7K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 52K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.5K May 19 07:06 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K May 19 15:27 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K May 19 07:12 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K May 19 17:53 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Apr 12 18:09 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 136K Apr 12 18:09 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.9K Apr 12 18:08 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 55K Apr 12 18:08 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 22 14:29 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 22 14:29 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 4 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 865K 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 AutonomousCar-PT-09b-LTLCardinality-00
FORMULA_NAME AutonomousCar-PT-09b-LTLCardinality-01
FORMULA_NAME AutonomousCar-PT-09b-LTLCardinality-02
FORMULA_NAME AutonomousCar-PT-09b-LTLCardinality-03
FORMULA_NAME AutonomousCar-PT-09b-LTLCardinality-04
FORMULA_NAME AutonomousCar-PT-09b-LTLCardinality-05
FORMULA_NAME AutonomousCar-PT-09b-LTLCardinality-06
FORMULA_NAME AutonomousCar-PT-09b-LTLCardinality-07
FORMULA_NAME AutonomousCar-PT-09b-LTLCardinality-08
FORMULA_NAME AutonomousCar-PT-09b-LTLCardinality-09
FORMULA_NAME AutonomousCar-PT-09b-LTLCardinality-10
FORMULA_NAME AutonomousCar-PT-09b-LTLCardinality-11
FORMULA_NAME AutonomousCar-PT-09b-LTLCardinality-12
FORMULA_NAME AutonomousCar-PT-09b-LTLCardinality-13
FORMULA_NAME AutonomousCar-PT-09b-LTLCardinality-14
FORMULA_NAME AutonomousCar-PT-09b-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1716358387427

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=AutonomousCar-PT-09b
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-22 06:13:09] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2024-05-22 06:13:09] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-22 06:13:10] [INFO ] Load time of PNML (sax parser for PT used): 558 ms
[2024-05-22 06:13:10] [INFO ] Transformed 391 places.
[2024-05-22 06:13:10] [INFO ] Transformed 1554 transitions.
[2024-05-22 06:13:10] [INFO ] Found NUPN structural information;
[2024-05-22 06:13:10] [INFO ] Parsed PT model containing 391 places and 1554 transitions and 16243 arcs in 840 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 27 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 7 formulas.
FORMULA AutonomousCar-PT-09b-LTLCardinality-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutonomousCar-PT-09b-LTLCardinality-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutonomousCar-PT-09b-LTLCardinality-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutonomousCar-PT-09b-LTLCardinality-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutonomousCar-PT-09b-LTLCardinality-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutonomousCar-PT-09b-LTLCardinality-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutonomousCar-PT-09b-LTLCardinality-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutonomousCar-PT-09b-LTLCardinality-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutonomousCar-PT-09b-LTLCardinality-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutonomousCar-PT-09b-LTLCardinality-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 20 out of 391 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 391/391 places, 1554/1554 transitions.
Discarding 52 places :
Symmetric choice reduction at 0 with 52 rule applications. Total rules 52 place count 339 transition count 1502
Iterating global reduction 0 with 52 rules applied. Total rules applied 104 place count 339 transition count 1502
Ensure Unique test removed 324 transitions
Reduce isomorphic transitions removed 324 transitions.
Iterating post reduction 0 with 324 rules applied. Total rules applied 428 place count 339 transition count 1178
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 439 place count 328 transition count 1167
Iterating global reduction 1 with 11 rules applied. Total rules applied 450 place count 328 transition count 1167
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 451 place count 327 transition count 1166
Iterating global reduction 1 with 1 rules applied. Total rules applied 452 place count 327 transition count 1166
Applied a total of 452 rules in 344 ms. Remains 327 /391 variables (removed 64) and now considering 1166/1554 (removed 388) transitions.
// Phase 1: matrix 1166 rows 327 cols
[2024-05-22 06:13:11] [INFO ] Computed 14 invariants in 41 ms
[2024-05-22 06:13:12] [INFO ] Implicit Places using invariants in 1130 ms returned []
[2024-05-22 06:13:12] [INFO ] Invariant cache hit.
[2024-05-22 06:13:13] [INFO ] Implicit Places using invariants and state equation in 1296 ms returned []
Implicit Place search using SMT with State Equation took 2481 ms to find 0 implicit places.
Running 1165 sub problems to find dead transitions.
[2024-05-22 06:13:13] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/326 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1165 unsolved
At refinement iteration 1 (OVERLAPS) 1/327 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1165 unsolved
[2024-05-22 06:13:57] [INFO ] Deduced a trap composed of 18 places in 1188 ms of which 86 ms to minimize.
[2024-05-22 06:13:58] [INFO ] Deduced a trap composed of 24 places in 1022 ms of which 5 ms to minimize.
[2024-05-22 06:13:58] [INFO ] Deduced a trap composed of 45 places in 833 ms of which 3 ms to minimize.
[2024-05-22 06:13:59] [INFO ] Deduced a trap composed of 45 places in 651 ms of which 5 ms to minimize.
[2024-05-22 06:14:00] [INFO ] Deduced a trap composed of 41 places in 993 ms of which 5 ms to minimize.
[2024-05-22 06:14:01] [INFO ] Deduced a trap composed of 42 places in 1033 ms of which 5 ms to minimize.
[2024-05-22 06:14:02] [INFO ] Deduced a trap composed of 70 places in 999 ms of which 5 ms to minimize.
[2024-05-22 06:14:03] [INFO ] Deduced a trap composed of 64 places in 668 ms of which 5 ms to minimize.
SMT process timed out in 49694ms, After SMT, problems are : Problem set: 0 solved, 1165 unsolved
Search for dead transitions found 0 dead transitions in 49769ms
Starting structural reductions in LTL mode, iteration 1 : 327/391 places, 1166/1554 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 52652 ms. Remains : 327/391 places, 1166/1554 transitions.
Support contains 20 out of 327 places after structural reductions.
[2024-05-22 06:14:04] [INFO ] Flatten gal took : 350 ms
[2024-05-22 06:14:04] [INFO ] Flatten gal took : 167 ms
[2024-05-22 06:14:04] [INFO ] Input system was already deterministic with 1166 transitions.
RANDOM walk for 40000 steps (330 resets) in 2768 ms. (14 steps per ms) remains 4/12 properties
BEST_FIRST walk for 40003 steps (51 resets) in 182 ms. (218 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (50 resets) in 243 ms. (163 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (48 resets) in 156 ms. (254 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (49 resets) in 114 ms. (347 steps per ms) remains 4/4 properties
[2024-05-22 06:14:05] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 169/177 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/177 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 150/327 variables, 7/14 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/327 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 1166/1493 variables, 327/341 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1493 variables, 0/341 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 0/1493 variables, 0/341 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1493/1493 variables, and 341 constraints, problems are : Problem set: 0 solved, 4 unsolved in 877 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, State Equation: 327/327 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 169/177 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/177 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 150/327 variables, 7/14 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-22 06:14:07] [INFO ] Deduced a trap composed of 31 places in 852 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/327 variables, 1/15 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/327 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (OVERLAPS) 1166/1493 variables, 327/342 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1493 variables, 4/346 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-22 06:14:09] [INFO ] Deduced a trap composed of 32 places in 569 ms of which 2 ms to minimize.
[2024-05-22 06:14:09] [INFO ] Deduced a trap composed of 32 places in 579 ms of which 3 ms to minimize.
[2024-05-22 06:14:10] [INFO ] Deduced a trap composed of 33 places in 898 ms of which 4 ms to minimize.
[2024-05-22 06:14:11] [INFO ] Deduced a trap composed of 32 places in 946 ms of which 5 ms to minimize.
[2024-05-22 06:14:12] [INFO ] Deduced a trap composed of 32 places in 902 ms of which 5 ms to minimize.
SMT process timed out in 6576ms, After SMT, problems are : Problem set: 0 solved, 4 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 8 out of 327 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 327/327 places, 1166/1166 transitions.
Graph (trivial) has 299 edges and 327 vertex of which 4 / 327 are part of one of the 2 SCC in 7 ms
Free SCC test removed 2 places
Drop transitions (Empty/Sink Transition effects.) removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Graph (complete) has 1588 edges and 325 vertex of which 323 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.42 ms
Discarding 2 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 116 transitions
Trivial Post-agglo rules discarded 116 transitions
Performed 116 trivial Post agglomeration. Transition count delta: 116
Iterating post reduction 0 with 118 rules applied. Total rules applied 120 place count 323 transition count 1044
Reduce places removed 116 places and 0 transitions.
Ensure Unique test removed 19 transitions
Reduce isomorphic transitions removed 19 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 27 transitions
Trivial Post-agglo rules discarded 27 transitions
Performed 27 trivial Post agglomeration. Transition count delta: 27
Iterating post reduction 1 with 162 rules applied. Total rules applied 282 place count 207 transition count 998
Reduce places removed 27 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 28 rules applied. Total rules applied 310 place count 180 transition count 997
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 311 place count 179 transition count 997
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 8 Pre rules applied. Total rules applied 311 place count 179 transition count 989
Deduced a syphon composed of 8 places in 2 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 4 with 16 rules applied. Total rules applied 327 place count 171 transition count 989
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 328 place count 170 transition count 988
Iterating global reduction 4 with 1 rules applied. Total rules applied 329 place count 170 transition count 988
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 330 place count 169 transition count 979
Iterating global reduction 4 with 1 rules applied. Total rules applied 331 place count 169 transition count 979
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 4 with 2 rules applied. Total rules applied 333 place count 169 transition count 977
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 334 place count 168 transition count 977
Performed 71 Post agglomeration using F-continuation condition.Transition count delta: 71
Deduced a syphon composed of 71 places in 1 ms
Reduce places removed 71 places and 0 transitions.
Iterating global reduction 6 with 142 rules applied. Total rules applied 476 place count 97 transition count 906
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 477 place count 97 transition count 905
Discarding 17 places :
Symmetric choice reduction at 7 with 17 rule applications. Total rules 494 place count 80 transition count 752
Iterating global reduction 7 with 17 rules applied. Total rules applied 511 place count 80 transition count 752
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 7 with 8 rules applied. Total rules applied 519 place count 80 transition count 744
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 521 place count 79 transition count 743
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 8 with 2 rules applied. Total rules applied 523 place count 79 transition count 741
Free-agglomeration rule applied 10 times.
Iterating global reduction 8 with 10 rules applied. Total rules applied 533 place count 79 transition count 731
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 8 with 10 rules applied. Total rules applied 543 place count 69 transition count 731
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 9 with 1 rules applied. Total rules applied 544 place count 69 transition count 730
Partial Free-agglomeration rule applied 2 times.
Drop transitions (Partial Free agglomeration) removed 2 transitions
Iterating global reduction 9 with 2 rules applied. Total rules applied 546 place count 69 transition count 730
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 9 with 1 rules applied. Total rules applied 547 place count 68 transition count 729
Applied a total of 547 rules in 963 ms. Remains 68 /327 variables (removed 259) and now considering 729/1166 (removed 437) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 965 ms. Remains : 68/327 places, 729/1166 transitions.
RANDOM walk for 920 steps (18 resets) in 29 ms. (30 steps per ms) remains 0/4 properties
Computed a total of 49 stabilizing places and 50 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' '!(X(F(p0)))'
Support contains 2 out of 327 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 327/327 places, 1166/1166 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 321 transition count 1160
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 321 transition count 1160
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 320 transition count 1159
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 320 transition count 1159
Applied a total of 14 rules in 25 ms. Remains 320 /327 variables (removed 7) and now considering 1159/1166 (removed 7) transitions.
// Phase 1: matrix 1159 rows 320 cols
[2024-05-22 06:14:13] [INFO ] Computed 14 invariants in 11 ms
[2024-05-22 06:14:14] [INFO ] Implicit Places using invariants in 442 ms returned []
[2024-05-22 06:14:14] [INFO ] Invariant cache hit.
[2024-05-22 06:14:15] [INFO ] Implicit Places using invariants and state equation in 912 ms returned []
Implicit Place search using SMT with State Equation took 1357 ms to find 0 implicit places.
Running 1158 sub problems to find dead transitions.
[2024-05-22 06:14:15] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/319 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1158 unsolved
At refinement iteration 1 (OVERLAPS) 1/320 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1158 unsolved
[2024-05-22 06:14:54] [INFO ] Deduced a trap composed of 18 places in 767 ms of which 3 ms to minimize.
[2024-05-22 06:14:55] [INFO ] Deduced a trap composed of 21 places in 723 ms of which 4 ms to minimize.
[2024-05-22 06:14:56] [INFO ] Deduced a trap composed of 70 places in 854 ms of which 5 ms to minimize.
[2024-05-22 06:14:56] [INFO ] Deduced a trap composed of 28 places in 732 ms of which 3 ms to minimize.
[2024-05-22 06:14:57] [INFO ] Deduced a trap composed of 23 places in 763 ms of which 3 ms to minimize.
[2024-05-22 06:14:58] [INFO ] Deduced a trap composed of 21 places in 338 ms of which 2 ms to minimize.
[2024-05-22 06:14:58] [INFO ] Deduced a trap composed of 14 places in 673 ms of which 3 ms to minimize.
[2024-05-22 06:15:00] [INFO ] Deduced a trap composed of 27 places in 757 ms of which 4 ms to minimize.
[2024-05-22 06:15:00] [INFO ] Deduced a trap composed of 45 places in 691 ms of which 3 ms to minimize.
[2024-05-22 06:15:01] [INFO ] Deduced a trap composed of 44 places in 694 ms of which 3 ms to minimize.
[2024-05-22 06:15:02] [INFO ] Deduced a trap composed of 44 places in 687 ms of which 4 ms to minimize.
[2024-05-22 06:15:02] [INFO ] Deduced a trap composed of 46 places in 697 ms of which 3 ms to minimize.
[2024-05-22 06:15:03] [INFO ] Deduced a trap composed of 48 places in 724 ms of which 3 ms to minimize.
SMT process timed out in 48569ms, After SMT, problems are : Problem set: 0 solved, 1158 unsolved
Search for dead transitions found 0 dead transitions in 48589ms
Starting structural reductions in LTL mode, iteration 1 : 320/327 places, 1159/1166 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 49977 ms. Remains : 320/327 places, 1159/1166 transitions.
Stuttering acceptance computed with spot in 314 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : AutonomousCar-PT-09b-LTLCardinality-05
Product exploration explored 100000 steps with 50000 reset in 532 ms.
Product exploration explored 100000 steps with 50000 reset in 358 ms.
Computed a total of 48 stabilizing places and 49 stable transitions
Computed a total of 48 stabilizing places and 49 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 20 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA AutonomousCar-PT-09b-LTLCardinality-05 TRUE TECHNIQUES KNOWLEDGE
Treatment of property AutonomousCar-PT-09b-LTLCardinality-05 finished in 51311 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((X(F(p1))||p0))))'
Support contains 5 out of 327 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 327/327 places, 1166/1166 transitions.
Graph (trivial) has 303 edges and 327 vertex of which 4 / 327 are part of one of the 2 SCC in 1 ms
Free SCC test removed 2 places
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 115 transitions
Trivial Post-agglo rules discarded 115 transitions
Performed 115 trivial Post agglomeration. Transition count delta: 115
Iterating post reduction 0 with 115 rules applied. Total rules applied 116 place count 324 transition count 1048
Reduce places removed 115 places and 0 transitions.
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 18 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 26 transitions
Trivial Post-agglo rules discarded 26 transitions
Performed 26 trivial Post agglomeration. Transition count delta: 26
Iterating post reduction 1 with 159 rules applied. Total rules applied 275 place count 209 transition count 1004
Reduce places removed 26 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 27 rules applied. Total rules applied 302 place count 183 transition count 1003
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 303 place count 182 transition count 1003
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 8 Pre rules applied. Total rules applied 303 place count 182 transition count 995
Deduced a syphon composed of 8 places in 2 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 4 with 16 rules applied. Total rules applied 319 place count 174 transition count 995
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 322 place count 171 transition count 992
Iterating global reduction 4 with 3 rules applied. Total rules applied 325 place count 171 transition count 992
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 325 place count 171 transition count 991
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 327 place count 170 transition count 991
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 328 place count 169 transition count 982
Iterating global reduction 4 with 1 rules applied. Total rules applied 329 place count 169 transition count 982
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 4 with 2 rules applied. Total rules applied 331 place count 169 transition count 980
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 332 place count 168 transition count 980
Performed 73 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 73 places in 1 ms
Reduce places removed 73 places and 0 transitions.
Iterating global reduction 6 with 146 rules applied. Total rules applied 478 place count 95 transition count 906
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 479 place count 95 transition count 905
Discarding 17 places :
Symmetric choice reduction at 7 with 17 rule applications. Total rules 496 place count 78 transition count 752
Iterating global reduction 7 with 17 rules applied. Total rules applied 513 place count 78 transition count 752
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 7 with 8 rules applied. Total rules applied 521 place count 78 transition count 744
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 8 with 4 rules applied. Total rules applied 525 place count 76 transition count 742
Partial Post-agglomeration rule applied 2 times.
Drop transitions (Partial Post agglomeration) removed 2 transitions
Iterating global reduction 8 with 2 rules applied. Total rules applied 527 place count 76 transition count 742
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 529 place count 74 transition count 740
Applied a total of 529 rules in 421 ms. Remains 74 /327 variables (removed 253) and now considering 740/1166 (removed 426) transitions.
// Phase 1: matrix 740 rows 74 cols
[2024-05-22 06:15:05] [INFO ] Computed 13 invariants in 10 ms
[2024-05-22 06:15:05] [INFO ] Implicit Places using invariants in 382 ms returned []
[2024-05-22 06:15:05] [INFO ] Invariant cache hit.
[2024-05-22 06:15:06] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-22 06:15:06] [INFO ] Implicit Places using invariants and state equation in 588 ms returned [69, 73]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 983 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 72/327 places, 740/1166 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 71 transition count 739
Applied a total of 2 rules in 61 ms. Remains 71 /72 variables (removed 1) and now considering 739/740 (removed 1) transitions.
// Phase 1: matrix 739 rows 71 cols
[2024-05-22 06:15:06] [INFO ] Computed 11 invariants in 7 ms
[2024-05-22 06:15:06] [INFO ] Implicit Places using invariants in 361 ms returned []
[2024-05-22 06:15:06] [INFO ] Invariant cache hit.
[2024-05-22 06:15:07] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-22 06:15:07] [INFO ] Implicit Places using invariants and state equation in 597 ms returned []
Implicit Place search using SMT with State Equation took 959 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 71/327 places, 739/1166 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 2434 ms. Remains : 71/327 places, 739/1166 transitions.
Stuttering acceptance computed with spot in 78 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : AutonomousCar-PT-09b-LTLCardinality-07
Product exploration explored 100000 steps with 1284 reset in 475 ms.
Product exploration explored 100000 steps with 896 reset in 476 ms.
Computed a total of 1 stabilizing places and 2 stable transitions
Computed a total of 1 stabilizing places and 2 stable transitions
Knowledge obtained : [(AND p0 (NOT p1)), (X (AND p0 (NOT p1))), (X p0), (X (NOT p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (AND p0 (NOT p1)))), (X (X p0)), (X (X (NOT p1))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 112 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 75 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
RANDOM walk for 33312 steps (1916 resets) in 643 ms. (51 steps per ms) remains 0/4 properties
Knowledge obtained : [(AND p0 (NOT p1)), (X (AND p0 (NOT p1))), (X p0), (X (NOT p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (AND p0 (NOT p1)))), (X (X p0)), (X (X (NOT p1))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : [(F p1), (F (NOT (AND p0 (NOT p1)))), (F (NOT (OR p0 p1))), (F (NOT p0))]
Knowledge based reduction with 9 factoid took 223 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 70 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 67 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 5 out of 71 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 71/71 places, 739/739 transitions.
Applied a total of 0 rules in 44 ms. Remains 71 /71 variables (removed 0) and now considering 739/739 (removed 0) transitions.
[2024-05-22 06:15:09] [INFO ] Invariant cache hit.
[2024-05-22 06:15:09] [INFO ] Implicit Places using invariants in 342 ms returned []
[2024-05-22 06:15:09] [INFO ] Invariant cache hit.
[2024-05-22 06:15:09] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-22 06:15:10] [INFO ] Implicit Places using invariants and state equation in 583 ms returned []
Implicit Place search using SMT with State Equation took 933 ms to find 0 implicit places.
[2024-05-22 06:15:10] [INFO ] Redundant transitions in 67 ms returned [562]
Found 1 redundant transitions using SMT.
Drop transitions (Redundant Transitions using SMT with State Equation) removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
Running 736 sub problems to find dead transitions.
// Phase 1: matrix 738 rows 71 cols
[2024-05-22 06:15:10] [INFO ] Computed 11 invariants in 9 ms
[2024-05-22 06:15:10] [INFO ] State equation strengthened by 1 read => feed constraints.
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------

Running AutonomousCar-PT-09b

IS_COLORED=
IS_NUPN=1

LOADING model.pnml ...
MODEL CLASS: P/T NET WITH NUPN EXTENSION
PLACES: 391
TRANSITIONS: 1554
CONSTANTS: 0
TEMPLATE VARS: 0
ARCS: 16243
NUPN UNITS: 27
LOADING TIME: 1.324

SAVING AS /home/mcc/execution/model.(net/def) ...
exportGspn useExt=true
SAVING TIME: 0.131
SAVING NAME MAP FILE /home/mcc/execution/model.id2name ...
SAVING NUPN UNITS AS FILE /home/mcc/execution/model.nu ...
TOTAL TIME: 2.142
OK.
----------------------------------------------------------------------
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: 791
MODEL NAME: /home/mcc/execution/model
391 places, 1554 transitions.

Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Building monolithic NSF...
FORMULA AutonomousCar-PT-09b-LTLCardinality-02 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA AutonomousCar-PT-09b-LTLCardinality-01 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA AutonomousCar-PT-09b-LTLCardinality-05 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA AutonomousCar-PT-09b-LTLCardinality-04 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA AutonomousCar-PT-09b-LTLCardinality-00 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA AutonomousCar-PT-09b-LTLCardinality-09 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA AutonomousCar-PT-09b-LTLCardinality-12 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA AutonomousCar-PT-09b-LTLCardinality-14 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA AutonomousCar-PT-09b-LTLCardinality-11 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA AutonomousCar-PT-09b-LTLCardinality-13 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA AutonomousCar-PT-09b-LTLCardinality-06 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA AutonomousCar-PT-09b-LTLCardinality-08 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA AutonomousCar-PT-09b-LTLCardinality-15 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA AutonomousCar-PT-09b-LTLCardinality-03 CANNOT_COMPUTE
FORMULA AutonomousCar-PT-09b-LTLCardinality-07 CANNOT_COMPUTE
FORMULA AutonomousCar-PT-09b-LTLCardinality-10 CANNOT_COMPUTE
Ok.
EXITCODE: 0
----------------------------------------------------------------------

BK_STOP 1716359378390

--------------------
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
MEDDLY ERROR: Insufficient memory

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="AutonomousCar-PT-09b"
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 AutonomousCar-PT-09b, 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 r025-smll-171620166400355"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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