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.r468-smll-171620167400306.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 ltsminxred
Input is AutonomousCar-PT-06b, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r468-smll-171620167400306
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 632K
-rw-r--r-- 1 mcc users 7.8K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 88K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.3K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 61K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.5K Apr 22 14:29 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Apr 22 14:29 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K May 19 07:12 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K May 19 17:52 LTLFireability.xml
-rw-r--r-- 1 mcc users 7.7K Apr 12 18:07 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 75K Apr 12 18:07 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.4K Apr 12 18:06 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 71K Apr 12 18:06 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 228K 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-06b-CTLFireability-2024-00
FORMULA_NAME AutonomousCar-PT-06b-CTLFireability-2024-01
FORMULA_NAME AutonomousCar-PT-06b-CTLFireability-2024-02
FORMULA_NAME AutonomousCar-PT-06b-CTLFireability-2024-03
FORMULA_NAME AutonomousCar-PT-06b-CTLFireability-2024-04
FORMULA_NAME AutonomousCar-PT-06b-CTLFireability-2024-05
FORMULA_NAME AutonomousCar-PT-06b-CTLFireability-2024-06
FORMULA_NAME AutonomousCar-PT-06b-CTLFireability-2024-07
FORMULA_NAME AutonomousCar-PT-06b-CTLFireability-2024-08
FORMULA_NAME AutonomousCar-PT-06b-CTLFireability-2024-09
FORMULA_NAME AutonomousCar-PT-06b-CTLFireability-2024-10
FORMULA_NAME AutonomousCar-PT-06b-CTLFireability-2024-11
FORMULA_NAME AutonomousCar-PT-06b-CTLFireability-2023-12
FORMULA_NAME AutonomousCar-PT-06b-CTLFireability-2023-13
FORMULA_NAME AutonomousCar-PT-06b-CTLFireability-2023-14
FORMULA_NAME AutonomousCar-PT-06b-CTLFireability-2023-15

=== Now, execution of the tool begins

BK_START 1717213609459

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=CTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=AutonomousCar-PT-06b
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 03:46:51] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -timeout, 360, -rebuildPNML]
[2024-06-01 03:46:51] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 03:46:51] [INFO ] Load time of PNML (sax parser for PT used): 170 ms
[2024-06-01 03:46:51] [INFO ] Transformed 289 places.
[2024-06-01 03:46:51] [INFO ] Transformed 644 transitions.
[2024-06-01 03:46:51] [INFO ] Found NUPN structural information;
[2024-06-01 03:46:51] [INFO ] Parsed PT model containing 289 places and 644 transitions and 3812 arcs in 344 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 23 ms.
Support contains 98 out of 289 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 289/289 places, 644/644 transitions.
Discarding 35 places :
Symmetric choice reduction at 0 with 35 rule applications. Total rules 35 place count 254 transition count 609
Iterating global reduction 0 with 35 rules applied. Total rules applied 70 place count 254 transition count 609
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 73 place count 251 transition count 606
Iterating global reduction 0 with 3 rules applied. Total rules applied 76 place count 251 transition count 606
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 77 place count 250 transition count 605
Iterating global reduction 0 with 1 rules applied. Total rules applied 78 place count 250 transition count 605
Applied a total of 78 rules in 121 ms. Remains 250 /289 variables (removed 39) and now considering 605/644 (removed 39) transitions.
// Phase 1: matrix 605 rows 250 cols
[2024-06-01 03:46:52] [INFO ] Computed 11 invariants in 30 ms
[2024-06-01 03:46:52] [INFO ] Implicit Places using invariants in 494 ms returned []
[2024-06-01 03:46:52] [INFO ] Invariant cache hit.
[2024-06-01 03:46:53] [INFO ] Implicit Places using invariants and state equation in 647 ms returned []
Implicit Place search using SMT with State Equation took 1350 ms to find 0 implicit places.
Running 604 sub problems to find dead transitions.
[2024-06-01 03:46:53] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/249 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 604 unsolved
At refinement iteration 1 (OVERLAPS) 1/250 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 604 unsolved
[2024-06-01 03:47:07] [INFO ] Deduced a trap composed of 52 places in 518 ms of which 54 ms to minimize.
[2024-06-01 03:47:08] [INFO ] Deduced a trap composed of 31 places in 340 ms of which 5 ms to minimize.
[2024-06-01 03:47:08] [INFO ] Deduced a trap composed of 47 places in 398 ms of which 5 ms to minimize.
[2024-06-01 03:47:09] [INFO ] Deduced a trap composed of 23 places in 319 ms of which 4 ms to minimize.
[2024-06-01 03:47:09] [INFO ] Deduced a trap composed of 21 places in 307 ms of which 5 ms to minimize.
[2024-06-01 03:47:09] [INFO ] Deduced a trap composed of 32 places in 215 ms of which 3 ms to minimize.
[2024-06-01 03:47:09] [INFO ] Deduced a trap composed of 31 places in 238 ms of which 7 ms to minimize.
[2024-06-01 03:47:10] [INFO ] Deduced a trap composed of 25 places in 308 ms of which 3 ms to minimize.
[2024-06-01 03:47:10] [INFO ] Deduced a trap composed of 23 places in 297 ms of which 4 ms to minimize.
[2024-06-01 03:47:10] [INFO ] Deduced a trap composed of 31 places in 238 ms of which 3 ms to minimize.
[2024-06-01 03:47:11] [INFO ] Deduced a trap composed of 26 places in 275 ms of which 3 ms to minimize.
[2024-06-01 03:47:11] [INFO ] Deduced a trap composed of 31 places in 249 ms of which 3 ms to minimize.
[2024-06-01 03:47:11] [INFO ] Deduced a trap composed of 43 places in 330 ms of which 3 ms to minimize.
[2024-06-01 03:47:12] [INFO ] Deduced a trap composed of 31 places in 269 ms of which 4 ms to minimize.
[2024-06-01 03:47:12] [INFO ] Deduced a trap composed of 35 places in 395 ms of which 7 ms to minimize.
[2024-06-01 03:47:13] [INFO ] Deduced a trap composed of 37 places in 382 ms of which 5 ms to minimize.
[2024-06-01 03:47:13] [INFO ] Deduced a trap composed of 43 places in 343 ms of which 4 ms to minimize.
[2024-06-01 03:47:13] [INFO ] Deduced a trap composed of 43 places in 301 ms of which 3 ms to minimize.
[2024-06-01 03:47:14] [INFO ] Deduced a trap composed of 43 places in 265 ms of which 3 ms to minimize.
[2024-06-01 03:47:14] [INFO ] Deduced a trap composed of 27 places in 304 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/250 variables, 20/31 constraints. Problems are: Problem set: 0 solved, 604 unsolved
[2024-06-01 03:47:15] [INFO ] Deduced a trap composed of 46 places in 348 ms of which 4 ms to minimize.
[2024-06-01 03:47:16] [INFO ] Deduced a trap composed of 36 places in 381 ms of which 4 ms to minimize.
[2024-06-01 03:47:16] [INFO ] Deduced a trap composed of 46 places in 347 ms of which 4 ms to minimize.
[2024-06-01 03:47:16] [INFO ] Deduced a trap composed of 43 places in 360 ms of which 4 ms to minimize.
[2024-06-01 03:47:17] [INFO ] Deduced a trap composed of 40 places in 384 ms of which 4 ms to minimize.
[2024-06-01 03:47:17] [INFO ] Deduced a trap composed of 14 places in 382 ms of which 4 ms to minimize.
[2024-06-01 03:47:18] [INFO ] Deduced a trap composed of 31 places in 341 ms of which 4 ms to minimize.
[2024-06-01 03:47:18] [INFO ] Deduced a trap composed of 41 places in 279 ms of which 4 ms to minimize.
[2024-06-01 03:47:19] [INFO ] Deduced a trap composed of 40 places in 302 ms of which 4 ms to minimize.
[2024-06-01 03:47:19] [INFO ] Deduced a trap composed of 49 places in 335 ms of which 4 ms to minimize.
[2024-06-01 03:47:19] [INFO ] Deduced a trap composed of 50 places in 338 ms of which 4 ms to minimize.
[2024-06-01 03:47:20] [INFO ] Deduced a trap composed of 44 places in 312 ms of which 4 ms to minimize.
[2024-06-01 03:47:20] [INFO ] Deduced a trap composed of 31 places in 324 ms of which 3 ms to minimize.
[2024-06-01 03:47:21] [INFO ] Deduced a trap composed of 48 places in 323 ms of which 7 ms to minimize.
[2024-06-01 03:47:21] [INFO ] Deduced a trap composed of 34 places in 306 ms of which 11 ms to minimize.
[2024-06-01 03:47:21] [INFO ] Deduced a trap composed of 43 places in 254 ms of which 3 ms to minimize.
[2024-06-01 03:47:22] [INFO ] Deduced a trap composed of 41 places in 253 ms of which 4 ms to minimize.
[2024-06-01 03:47:22] [INFO ] Deduced a trap composed of 44 places in 273 ms of which 4 ms to minimize.
[2024-06-01 03:47:22] [INFO ] Deduced a trap composed of 44 places in 235 ms of which 4 ms to minimize.
[2024-06-01 03:47:23] [INFO ] Deduced a trap composed of 40 places in 217 ms of which 3 ms to minimize.
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 0.0)
(s2 0.0)
(s3 0.0)
(s4 0.0)
(s5 1.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 0.0)
(s11 0.0)
(s12 0.0)
(s13 0.0)
(s14 1.0)
(s15 0.0)
(s16 0.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 3 (INCLUDED_ONLY) 0/250 variables, 20/51 constraints. Problems are: Problem set: 0 solved, 604 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 250/855 variables, and 51 constraints, problems are : Problem set: 0 solved, 604 unsolved in 30066 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 0/250 constraints, PredecessorRefiner: 604/604 constraints, Known Traps: 40/40 constraints]
Escalating to Integer solving :Problem set: 0 solved, 604 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/249 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 604 unsolved
At refinement iteration 1 (OVERLAPS) 1/250 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 604 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/250 variables, 40/51 constraints. Problems are: Problem set: 0 solved, 604 unsolved
[2024-06-01 03:47:34] [INFO ] Deduced a trap composed of 42 places in 357 ms of which 4 ms to minimize.
[2024-06-01 03:47:34] [INFO ] Deduced a trap composed of 44 places in 325 ms of which 4 ms to minimize.
[2024-06-01 03:47:34] [INFO ] Deduced a trap composed of 43 places in 307 ms of which 4 ms to minimize.
[2024-06-01 03:47:35] [INFO ] Deduced a trap composed of 39 places in 278 ms of which 3 ms to minimize.
[2024-06-01 03:47:35] [INFO ] Deduced a trap composed of 19 places in 370 ms of which 3 ms to minimize.
[2024-06-01 03:47:36] [INFO ] Deduced a trap composed of 45 places in 205 ms of which 3 ms to minimize.
[2024-06-01 03:47:37] [INFO ] Deduced a trap composed of 45 places in 251 ms of which 4 ms to minimize.
[2024-06-01 03:47:37] [INFO ] Deduced a trap composed of 44 places in 150 ms of which 2 ms to minimize.
[2024-06-01 03:47:37] [INFO ] Deduced a trap composed of 41 places in 142 ms of which 2 ms to minimize.
[2024-06-01 03:47:37] [INFO ] Deduced a trap composed of 32 places in 126 ms of which 2 ms to minimize.
[2024-06-01 03:47:37] [INFO ] Deduced a trap composed of 32 places in 148 ms of which 3 ms to minimize.
[2024-06-01 03:47:38] [INFO ] Deduced a trap composed of 45 places in 223 ms of which 3 ms to minimize.
[2024-06-01 03:47:38] [INFO ] Deduced a trap composed of 42 places in 217 ms of which 3 ms to minimize.
[2024-06-01 03:47:38] [INFO ] Deduced a trap composed of 41 places in 239 ms of which 3 ms to minimize.
[2024-06-01 03:47:38] [INFO ] Deduced a trap composed of 44 places in 223 ms of which 3 ms to minimize.
[2024-06-01 03:47:39] [INFO ] Deduced a trap composed of 45 places in 222 ms of which 5 ms to minimize.
[2024-06-01 03:47:39] [INFO ] Deduced a trap composed of 42 places in 282 ms of which 11 ms to minimize.
[2024-06-01 03:47:40] [INFO ] Deduced a trap composed of 42 places in 203 ms of which 3 ms to minimize.
[2024-06-01 03:47:40] [INFO ] Deduced a trap composed of 41 places in 256 ms of which 3 ms to minimize.
[2024-06-01 03:47:40] [INFO ] Deduced a trap composed of 44 places in 210 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/250 variables, 20/71 constraints. Problems are: Problem set: 0 solved, 604 unsolved
[2024-06-01 03:47:41] [INFO ] Deduced a trap composed of 38 places in 287 ms of which 4 ms to minimize.
[2024-06-01 03:47:42] [INFO ] Deduced a trap composed of 41 places in 275 ms of which 4 ms to minimize.
[2024-06-01 03:47:42] [INFO ] Deduced a trap composed of 28 places in 288 ms of which 3 ms to minimize.
[2024-06-01 03:47:44] [INFO ] Deduced a trap composed of 40 places in 167 ms of which 4 ms to minimize.
[2024-06-01 03:47:44] [INFO ] Deduced a trap composed of 42 places in 163 ms of which 2 ms to minimize.
[2024-06-01 03:47:44] [INFO ] Deduced a trap composed of 44 places in 151 ms of which 2 ms to minimize.
[2024-06-01 03:47:45] [INFO ] Deduced a trap composed of 11 places in 324 ms of which 3 ms to minimize.
[2024-06-01 03:47:45] [INFO ] Deduced a trap composed of 6 places in 311 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/250 variables, 8/79 constraints. Problems are: Problem set: 0 solved, 604 unsolved
[2024-06-01 03:47:51] [INFO ] Deduced a trap composed of 21 places in 443 ms of which 4 ms to minimize.
[2024-06-01 03:47:52] [INFO ] Deduced a trap composed of 42 places in 341 ms of which 4 ms to minimize.
[2024-06-01 03:47:52] [INFO ] Deduced a trap composed of 29 places in 340 ms of which 3 ms to minimize.
[2024-06-01 03:47:53] [INFO ] Deduced a trap composed of 25 places in 414 ms of which 4 ms to minimize.
[2024-06-01 03:47:53] [INFO ] Deduced a trap composed of 44 places in 386 ms of which 4 ms to minimize.
[2024-06-01 03:47:56] [INFO ] Deduced a trap composed of 12 places in 243 ms of which 3 ms to minimize.
Error getting values : (error "ParserException while parsing response: ((s0 0)
(s1 0)
(s2 0)
(s3 0)
(s4 0)
(s5 1)
(s6 0)
(s7 0)
(s8 0)
(s9 0)
(s10 0)
(s11 0)
(s12 0)
(s13 1)
(s14 0)
(s15 0)
(s16 0)
(s17 0)
(s18 0)
(s19 0)
(s20 0)
(s21 0)
(s22 0)
(s23 0)
(s24 0)
(s25 0)
(s26 0)
(s27 0)
(s28 0)
(s29 0)
(s30 0)
(s31 0)
(s32 0)
(s33 1)
(s34 0)
(s35 0)
(s36 0)
(s37 0)
(s38 0)
(s39 0)
(s40 0)
(s41 0)
(s42 0)
(s43 0)
(s44 0)
(s45 0)
(s46 0)
(s47 0)
(s48 0)
(s49 0)
(s50 0)
(s51 0)
(s52 0)
(s53 0)
(s54 0)
(s55 0)
(s56 0)
(s57 0)
(s58 0)
(s59 1)
(s60 0)
(s61 0)
(s62 0)
(s63 0)
(s64 0)
(s65 0)
(s66 0)
(s67 0)
(s68 0)
(s69 0)
(s70 0)
(s71 0)
(s72 0)
(s73 0)
(s74 0)
(s75 0)
(s76 0)
(s77 0)
(s78 0)
(s79 0)
(s80 0)
(s81 0)
(s82 0)
(s83 0)
(s84 0)
(s85 0)
(s86 0)
(s87 0)
(s88 0)
(s89 0)
(s90 0)
(s91 0)
(s92 0)
(s93 0)
(s94 0)
(s95 0)
(s96 0)
(s97 0)
(s98 0)
(s99 0)
(s100 0)
(s101 0)
(s102 0)
(s103 0)
(s104 0)
(s105 0)
(s106 0)
(s107 0)
(s108 1)
(s109 0)
(s110 0)
(s111 0)
(s112 0)
(s113 0)
(s114 0)
(s115 0)
(s116 0)
(s117 0)
(s118 0)
(s119 0)
(s120 0)
(s121 0)
(s122 0)
(s123 0)
(s124 0)
(s125 0)
(s126 0)
(s127 0)
(s128 0)
(s129 0)
(s130 0)
(s131 1)
(s132 0)
(s133 0)
(s134 0)
(s135 0)
(s136 0)
(s137 0)timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 250/855 variables, and 85 constraints, problems are : Problem set: 0 solved, 604 unsolved in 30039 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 0/250 constraints, PredecessorRefiner: 0/604 constraints, Known Traps: 74/74 constraints]
After SMT, in 63671ms problems are : Problem set: 0 solved, 604 unsolved
Search for dead transitions found 0 dead transitions in 63760ms
Starting structural reductions in LTL mode, iteration 1 : 250/289 places, 605/644 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 65282 ms. Remains : 250/289 places, 605/644 transitions.
Support contains 98 out of 250 places after structural reductions.
[2024-06-01 03:47:57] [INFO ] Flatten gal took : 150 ms
[2024-06-01 03:47:57] [INFO ] Flatten gal took : 78 ms
[2024-06-01 03:47:58] [INFO ] Input system was already deterministic with 605 transitions.
Support contains 95 out of 250 places (down from 98) after GAL structural reductions.
RANDOM walk for 40000 steps (72 resets) in 3176 ms. (12 steps per ms) remains 41/91 properties
BEST_FIRST walk for 4003 steps (8 resets) in 69 ms. (57 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4001 steps (9 resets) in 63 ms. (62 steps per ms) remains 40/41 properties
BEST_FIRST walk for 4004 steps (8 resets) in 25 ms. (154 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4004 steps (8 resets) in 61 ms. (64 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4004 steps (8 resets) in 39 ms. (100 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4004 steps (8 resets) in 48 ms. (81 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4003 steps (8 resets) in 75 ms. (52 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4004 steps (8 resets) in 31 ms. (125 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4003 steps (10 resets) in 40 ms. (97 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4004 steps (8 resets) in 40 ms. (97 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4002 steps (8 resets) in 31 ms. (125 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4003 steps (8 resets) in 32 ms. (121 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4004 steps (8 resets) in 39 ms. (100 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4004 steps (8 resets) in 29 ms. (133 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4003 steps (9 resets) in 35 ms. (111 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4003 steps (8 resets) in 34 ms. (114 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4003 steps (8 resets) in 31 ms. (125 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4004 steps (8 resets) in 29 ms. (133 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4003 steps (8 resets) in 45 ms. (87 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4003 steps (8 resets) in 24 ms. (160 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4002 steps (9 resets) in 53 ms. (74 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4003 steps (8 resets) in 17 ms. (222 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4004 steps (8 resets) in 26 ms. (148 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4003 steps (8 resets) in 18 ms. (210 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4003 steps (8 resets) in 46 ms. (85 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4003 steps (8 resets) in 19 ms. (200 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4004 steps (8 resets) in 34 ms. (114 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4004 steps (8 resets) in 18 ms. (210 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4003 steps (8 resets) in 20 ms. (190 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4003 steps (8 resets) in 30 ms. (129 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4002 steps (8 resets) in 18 ms. (210 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4004 steps (8 resets) in 59 ms. (66 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4004 steps (8 resets) in 34 ms. (114 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4002 steps (8 resets) in 37 ms. (105 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4004 steps (8 resets) in 40 ms. (97 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4004 steps (9 resets) in 24 ms. (160 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4004 steps (8 resets) in 19 ms. (200 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4004 steps (8 resets) in 20 ms. (190 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4004 steps (8 resets) in 23 ms. (166 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4004 steps (8 resets) in 33 ms. (117 steps per ms) remains 40/40 properties
[2024-06-01 03:47:59] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/50 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 40 unsolved
Problem AtomicPropp22 is UNSAT
Problem AtomicPropp48 is UNSAT
Problem AtomicPropp68 is UNSAT
Problem AtomicPropp76 is UNSAT
Problem AtomicPropp77 is UNSAT
Problem AtomicPropp84 is UNSAT
Problem AtomicPropp85 is UNSAT
At refinement iteration 1 (OVERLAPS) 200/250 variables, 11/11 constraints. Problems are: Problem set: 7 solved, 33 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/250 variables, 0/11 constraints. Problems are: Problem set: 7 solved, 33 unsolved
Problem AtomicPropp75 is UNSAT
At refinement iteration 3 (OVERLAPS) 605/855 variables, 250/261 constraints. Problems are: Problem set: 8 solved, 32 unsolved
[2024-06-01 03:48:02] [INFO ] Deduced a trap composed of 31 places in 318 ms of which 4 ms to minimize.
Problem AtomicPropp53 is UNSAT
[2024-06-01 03:48:02] [INFO ] Deduced a trap composed of 32 places in 326 ms of which 4 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/855 variables, 2/263 constraints. Problems are: Problem set: 9 solved, 31 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/855 variables, 0/263 constraints. Problems are: Problem set: 9 solved, 31 unsolved
At refinement iteration 6 (OVERLAPS) 0/855 variables, 0/263 constraints. Problems are: Problem set: 9 solved, 31 unsolved
No progress, stopping.
After SMT solving in domain Real declared 855/855 variables, and 263 constraints, problems are : Problem set: 9 solved, 31 unsolved in 3445 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 250/250 constraints, PredecessorRefiner: 40/40 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 9 solved, 31 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/44 variables, 0/0 constraints. Problems are: Problem set: 9 solved, 31 unsolved
Problem AtomicPropp3 is UNSAT
At refinement iteration 1 (OVERLAPS) 206/250 variables, 11/11 constraints. Problems are: Problem set: 10 solved, 30 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/250 variables, 2/13 constraints. Problems are: Problem set: 10 solved, 30 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/250 variables, 0/13 constraints. Problems are: Problem set: 10 solved, 30 unsolved
At refinement iteration 4 (OVERLAPS) 605/855 variables, 250/263 constraints. Problems are: Problem set: 10 solved, 30 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/855 variables, 30/293 constraints. Problems are: Problem set: 10 solved, 30 unsolved
[2024-06-01 03:48:06] [INFO ] Deduced a trap composed of 22 places in 104 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/855 variables, 1/294 constraints. Problems are: Problem set: 10 solved, 30 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 855/855 variables, and 294 constraints, problems are : Problem set: 10 solved, 30 unsolved in 5010 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 250/250 constraints, PredecessorRefiner: 30/40 constraints, Known Traps: 3/3 constraints]
After SMT, in 9150ms problems are : Problem set: 10 solved, 30 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 43 out of 250 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 250/250 places, 605/605 transitions.
Graph (trivial) has 176 edges and 250 vertex of which 4 / 250 are part of one of the 2 SCC in 6 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 917 edges and 248 vertex of which 245 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.10 ms
Discarding 3 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 81 transitions
Trivial Post-agglo rules discarded 81 transitions
Performed 81 trivial Post agglomeration. Transition count delta: 81
Iterating post reduction 0 with 83 rules applied. Total rules applied 85 place count 245 transition count 517
Reduce places removed 81 places and 0 transitions.
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 21 transitions
Trivial Post-agglo rules discarded 21 transitions
Performed 21 trivial Post agglomeration. Transition count delta: 21
Iterating post reduction 1 with 117 rules applied. Total rules applied 202 place count 164 transition count 481
Reduce places removed 21 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 2 with 23 rules applied. Total rules applied 225 place count 143 transition count 479
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 227 place count 141 transition count 479
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 7 Pre rules applied. Total rules applied 227 place count 141 transition count 472
Deduced a syphon composed of 7 places in 3 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 4 with 14 rules applied. Total rules applied 241 place count 134 transition count 472
Discarding 9 places :
Symmetric choice reduction at 4 with 9 rule applications. Total rules 250 place count 125 transition count 463
Iterating global reduction 4 with 9 rules applied. Total rules applied 259 place count 125 transition count 463
Ensure Unique test removed 144 transitions
Reduce isomorphic transitions removed 144 transitions.
Iterating post reduction 4 with 144 rules applied. Total rules applied 403 place count 125 transition count 319
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 404 place count 124 transition count 318
Iterating global reduction 5 with 1 rules applied. Total rules applied 405 place count 124 transition count 318
Performed 25 Post agglomeration using F-continuation condition.Transition count delta: 25
Deduced a syphon composed of 25 places in 0 ms
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 5 with 50 rules applied. Total rules applied 455 place count 99 transition count 293
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 5 with 2 rules applied. Total rules applied 457 place count 99 transition count 291
Free-agglomeration rule applied 15 times.
Iterating global reduction 5 with 15 rules applied. Total rules applied 472 place count 99 transition count 276
Reduce places removed 15 places and 0 transitions.
Iterating post reduction 5 with 15 rules applied. Total rules applied 487 place count 84 transition count 276
Partial Free-agglomeration rule applied 4 times.
Drop transitions (Partial Free agglomeration) removed 4 transitions
Iterating global reduction 6 with 4 rules applied. Total rules applied 491 place count 84 transition count 276
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 492 place count 83 transition count 269
Iterating global reduction 6 with 1 rules applied. Total rules applied 493 place count 83 transition count 269
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 494 place count 82 transition count 268
Applied a total of 494 rules in 297 ms. Remains 82 /250 variables (removed 168) and now considering 268/605 (removed 337) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 298 ms. Remains : 82/250 places, 268/605 transitions.
RANDOM walk for 40000 steps (1498 resets) in 827 ms. (48 steps per ms) remains 15/30 properties
BEST_FIRST walk for 4004 steps (18 resets) in 30 ms. (129 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (16 resets) in 20 ms. (190 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4003 steps (18 resets) in 26 ms. (148 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4003 steps (16 resets) in 14 ms. (266 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4003 steps (18 resets) in 16 ms. (235 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (19 resets) in 13 ms. (286 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4003 steps (20 resets) in 11 ms. (333 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (19 resets) in 22 ms. (174 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (18 resets) in 9 ms. (400 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (20 resets) in 24 ms. (160 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4002 steps (14 resets) in 22 ms. (174 steps per ms) remains 13/15 properties
BEST_FIRST walk for 4003 steps (15 resets) in 10 ms. (363 steps per ms) remains 13/13 properties
BEST_FIRST walk for 4004 steps (15 resets) in 17 ms. (222 steps per ms) remains 12/13 properties
// Phase 1: matrix 268 rows 82 cols
[2024-06-01 03:48:09] [INFO ] Computed 11 invariants in 3 ms
[2024-06-01 03:48:09] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/20 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 1 (OVERLAPS) 46/66 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/66 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 3 (OVERLAPS) 255/321 variables, 66/74 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/321 variables, 0/74 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 5 (OVERLAPS) 23/344 variables, 12/86 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/344 variables, 1/87 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/344 variables, 1/88 constraints. Problems are: Problem set: 0 solved, 12 unsolved
[2024-06-01 03:48:10] [INFO ] Deduced a trap composed of 7 places in 132 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/344 variables, 1/89 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/344 variables, 0/89 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 10 (OVERLAPS) 4/348 variables, 2/91 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/348 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 12 (OVERLAPS) 2/350 variables, 4/95 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/350 variables, 0/95 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 14 (OVERLAPS) 0/350 variables, 0/95 constraints. Problems are: Problem set: 0 solved, 12 unsolved
No progress, stopping.
After SMT solving in domain Real declared 350/350 variables, and 95 constraints, problems are : Problem set: 0 solved, 12 unsolved in 1308 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 82/82 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 12/12 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 12 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/20 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 1 (OVERLAPS) 46/66 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/66 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 3 (OVERLAPS) 255/321 variables, 66/74 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/321 variables, 0/74 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 5 (OVERLAPS) 23/344 variables, 12/86 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/344 variables, 1/87 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/344 variables, 1/88 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/344 variables, 12/100 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/344 variables, 1/101 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/344 variables, 0/101 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 11 (OVERLAPS) 4/348 variables, 2/103 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/348 variables, 0/103 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 13 (OVERLAPS) 2/350 variables, 4/107 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/350 variables, 0/107 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 15 (OVERLAPS) 0/350 variables, 0/107 constraints. Problems are: Problem set: 0 solved, 12 unsolved
No progress, stopping.
After SMT solving in domain Int declared 350/350 variables, and 107 constraints, problems are : Problem set: 0 solved, 12 unsolved in 3307 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 82/82 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 12/12 constraints, Known Traps: 1/1 constraints]
After SMT, in 4707ms problems are : Problem set: 0 solved, 12 unsolved
Parikh walk visited 0 properties in 5337 ms.
Support contains 20 out of 82 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 82/82 places, 268/268 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 82 transition count 263
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 10 place count 77 transition count 263
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 10 place count 77 transition count 261
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 14 place count 75 transition count 261
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 15 place count 74 transition count 260
Iterating global reduction 2 with 1 rules applied. Total rules applied 16 place count 74 transition count 260
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 28 place count 68 transition count 254
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 40 place count 62 transition count 248
Free-agglomeration rule applied 7 times.
Iterating global reduction 2 with 7 rules applied. Total rules applied 47 place count 62 transition count 241
Reduce places removed 7 places and 0 transitions.
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 2 with 13 rules applied. Total rules applied 60 place count 55 transition count 235
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 61 place count 55 transition count 235
Applied a total of 61 rules in 55 ms. Remains 55 /82 variables (removed 27) and now considering 235/268 (removed 33) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 55 ms. Remains : 55/82 places, 235/268 transitions.
RANDOM walk for 40000 steps (1536 resets) in 529 ms. (75 steps per ms) remains 3/12 properties
BEST_FIRST walk for 40003 steps (268 resets) in 84 ms. (470 steps per ms) remains 2/3 properties
BEST_FIRST walk for 40004 steps (258 resets) in 63 ms. (625 steps per ms) remains 1/2 properties
BEST_FIRST walk for 9005 steps (58 resets) in 26 ms. (333 steps per ms) remains 0/1 properties
Successfully simplified 10 atomic propositions for a total of 16 simplifications.
[2024-06-01 03:48:20] [INFO ] Flatten gal took : 84 ms
[2024-06-01 03:48:20] [INFO ] Flatten gal took : 71 ms
[2024-06-01 03:48:20] [INFO ] Input system was already deterministic with 605 transitions.
Support contains 87 out of 250 places (down from 88) after GAL structural reductions.
Computed a total of 45 stabilizing places and 46 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 250/250 places, 605/605 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 239 transition count 594
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 239 transition count 594
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 23 place count 238 transition count 593
Iterating global reduction 0 with 1 rules applied. Total rules applied 24 place count 238 transition count 593
Applied a total of 24 rules in 25 ms. Remains 238 /250 variables (removed 12) and now considering 593/605 (removed 12) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 26 ms. Remains : 238/250 places, 593/605 transitions.
[2024-06-01 03:48:20] [INFO ] Flatten gal took : 42 ms
[2024-06-01 03:48:20] [INFO ] Flatten gal took : 44 ms
[2024-06-01 03:48:20] [INFO ] Input system was already deterministic with 593 transitions.
Starting structural reductions in LTL mode, iteration 0 : 250/250 places, 605/605 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 239 transition count 594
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 239 transition count 594
Ensure Unique test removed 144 transitions
Reduce isomorphic transitions removed 144 transitions.
Iterating post reduction 0 with 144 rules applied. Total rules applied 166 place count 239 transition count 450
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 167 place count 238 transition count 449
Iterating global reduction 1 with 1 rules applied. Total rules applied 168 place count 238 transition count 449
Applied a total of 168 rules in 16 ms. Remains 238 /250 variables (removed 12) and now considering 449/605 (removed 156) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 17 ms. Remains : 238/250 places, 449/605 transitions.
[2024-06-01 03:48:20] [INFO ] Flatten gal took : 26 ms
[2024-06-01 03:48:20] [INFO ] Flatten gal took : 27 ms
[2024-06-01 03:48:20] [INFO ] Input system was already deterministic with 449 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 250/250 places, 605/605 transitions.
Graph (trivial) has 234 edges and 250 vertex of which 4 / 250 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 98 transitions
Trivial Post-agglo rules discarded 98 transitions
Performed 98 trivial Post agglomeration. Transition count delta: 98
Iterating post reduction 0 with 98 rules applied. Total rules applied 99 place count 247 transition count 504
Reduce places removed 98 places and 0 transitions.
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 22 transitions
Trivial Post-agglo rules discarded 22 transitions
Performed 22 trivial Post agglomeration. Transition count delta: 22
Iterating post reduction 1 with 136 rules applied. Total rules applied 235 place count 149 transition count 466
Reduce places removed 22 places and 0 transitions.
Iterating post reduction 2 with 22 rules applied. Total rules applied 257 place count 127 transition count 466
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 6 Pre rules applied. Total rules applied 257 place count 127 transition count 460
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 3 with 12 rules applied. Total rules applied 269 place count 121 transition count 460
Discarding 11 places :
Symmetric choice reduction at 3 with 11 rule applications. Total rules 280 place count 110 transition count 449
Iterating global reduction 3 with 11 rules applied. Total rules applied 291 place count 110 transition count 449
Ensure Unique test removed 144 transitions
Reduce isomorphic transitions removed 144 transitions.
Iterating post reduction 3 with 144 rules applied. Total rules applied 435 place count 110 transition count 305
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 435 place count 110 transition count 304
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 437 place count 109 transition count 304
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 440 place count 106 transition count 291
Iterating global reduction 4 with 3 rules applied. Total rules applied 443 place count 106 transition count 291
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 4 with 4 rules applied. Total rules applied 447 place count 106 transition count 287
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 449 place count 104 transition count 287
Performed 36 Post agglomeration using F-continuation condition.Transition count delta: 36
Deduced a syphon composed of 36 places in 1 ms
Reduce places removed 36 places and 0 transitions.
Iterating global reduction 6 with 72 rules applied. Total rules applied 521 place count 68 transition count 251
Discarding 9 places :
Symmetric choice reduction at 6 with 9 rule applications. Total rules 530 place count 59 transition count 192
Iterating global reduction 6 with 9 rules applied. Total rules applied 539 place count 59 transition count 192
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 6 with 8 rules applied. Total rules applied 547 place count 59 transition count 184
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 7 with 4 rules applied. Total rules applied 551 place count 55 transition count 184
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 8 with 1 rules applied. Total rules applied 552 place count 55 transition count 183
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 8 with 1 rules applied. Total rules applied 553 place count 54 transition count 182
Applied a total of 553 rules in 94 ms. Remains 54 /250 variables (removed 196) and now considering 182/605 (removed 423) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 94 ms. Remains : 54/250 places, 182/605 transitions.
[2024-06-01 03:48:20] [INFO ] Flatten gal took : 17 ms
[2024-06-01 03:48:20] [INFO ] Flatten gal took : 18 ms
[2024-06-01 03:48:20] [INFO ] Input system was already deterministic with 182 transitions.
Starting structural reductions in LTL mode, iteration 0 : 250/250 places, 605/605 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 236 transition count 591
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 236 transition count 591
Ensure Unique test removed 144 transitions
Reduce isomorphic transitions removed 144 transitions.
Iterating post reduction 0 with 144 rules applied. Total rules applied 172 place count 236 transition count 447
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 173 place count 235 transition count 446
Iterating global reduction 1 with 1 rules applied. Total rules applied 174 place count 235 transition count 446
Applied a total of 174 rules in 21 ms. Remains 235 /250 variables (removed 15) and now considering 446/605 (removed 159) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 21 ms. Remains : 235/250 places, 446/605 transitions.
[2024-06-01 03:48:21] [INFO ] Flatten gal took : 24 ms
[2024-06-01 03:48:21] [INFO ] Flatten gal took : 26 ms
[2024-06-01 03:48:21] [INFO ] Input system was already deterministic with 446 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 250/250 places, 605/605 transitions.
Graph (trivial) has 216 edges and 250 vertex of which 4 / 250 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 97 transitions
Trivial Post-agglo rules discarded 97 transitions
Performed 97 trivial Post agglomeration. Transition count delta: 97
Iterating post reduction 0 with 97 rules applied. Total rules applied 98 place count 247 transition count 505
Reduce places removed 97 places and 0 transitions.
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 22 transitions
Trivial Post-agglo rules discarded 22 transitions
Performed 22 trivial Post agglomeration. Transition count delta: 22
Iterating post reduction 1 with 135 rules applied. Total rules applied 233 place count 150 transition count 467
Reduce places removed 22 places and 0 transitions.
Iterating post reduction 2 with 22 rules applied. Total rules applied 255 place count 128 transition count 467
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 6 Pre rules applied. Total rules applied 255 place count 128 transition count 461
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 3 with 12 rules applied. Total rules applied 267 place count 122 transition count 461
Discarding 11 places :
Symmetric choice reduction at 3 with 11 rule applications. Total rules 278 place count 111 transition count 450
Iterating global reduction 3 with 11 rules applied. Total rules applied 289 place count 111 transition count 450
Ensure Unique test removed 144 transitions
Reduce isomorphic transitions removed 144 transitions.
Iterating post reduction 3 with 144 rules applied. Total rules applied 433 place count 111 transition count 306
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 435 place count 109 transition count 299
Iterating global reduction 4 with 2 rules applied. Total rules applied 437 place count 109 transition count 299
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 439 place count 109 transition count 297
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 440 place count 108 transition count 297
Performed 30 Post agglomeration using F-continuation condition.Transition count delta: 30
Deduced a syphon composed of 30 places in 1 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 6 with 60 rules applied. Total rules applied 500 place count 78 transition count 267
Discarding 6 places :
Symmetric choice reduction at 6 with 6 rule applications. Total rules 506 place count 72 transition count 228
Iterating global reduction 6 with 6 rules applied. Total rules applied 512 place count 72 transition count 228
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 6 with 6 rules applied. Total rules applied 518 place count 72 transition count 222
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 7 with 3 rules applied. Total rules applied 521 place count 69 transition count 222
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 8 with 1 rules applied. Total rules applied 522 place count 69 transition count 221
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 524 place count 69 transition count 221
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 526 place count 67 transition count 219
Applied a total of 526 rules in 83 ms. Remains 67 /250 variables (removed 183) and now considering 219/605 (removed 386) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 83 ms. Remains : 67/250 places, 219/605 transitions.
[2024-06-01 03:48:21] [INFO ] Flatten gal took : 20 ms
[2024-06-01 03:48:21] [INFO ] Flatten gal took : 20 ms
[2024-06-01 03:48:21] [INFO ] Input system was already deterministic with 219 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 250/250 places, 605/605 transitions.
Graph (trivial) has 236 edges and 250 vertex of which 4 / 250 are part of one of the 2 SCC in 0 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 98 transitions
Trivial Post-agglo rules discarded 98 transitions
Performed 98 trivial Post agglomeration. Transition count delta: 98
Iterating post reduction 0 with 98 rules applied. Total rules applied 99 place count 247 transition count 504
Reduce places removed 98 places and 0 transitions.
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 21 transitions
Trivial Post-agglo rules discarded 21 transitions
Performed 21 trivial Post agglomeration. Transition count delta: 21
Iterating post reduction 1 with 134 rules applied. Total rules applied 233 place count 149 transition count 468
Reduce places removed 21 places and 0 transitions.
Iterating post reduction 2 with 21 rules applied. Total rules applied 254 place count 128 transition count 468
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 5 Pre rules applied. Total rules applied 254 place count 128 transition count 463
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 10 rules applied. Total rules applied 264 place count 123 transition count 463
Discarding 10 places :
Symmetric choice reduction at 3 with 10 rule applications. Total rules 274 place count 113 transition count 453
Iterating global reduction 3 with 10 rules applied. Total rules applied 284 place count 113 transition count 453
Ensure Unique test removed 144 transitions
Reduce isomorphic transitions removed 144 transitions.
Iterating post reduction 3 with 144 rules applied. Total rules applied 428 place count 113 transition count 309
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 428 place count 113 transition count 307
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 432 place count 111 transition count 307
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 435 place count 108 transition count 294
Iterating global reduction 4 with 3 rules applied. Total rules applied 438 place count 108 transition count 294
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 4 with 4 rules applied. Total rules applied 442 place count 108 transition count 290
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 444 place count 106 transition count 290
Performed 38 Post agglomeration using F-continuation condition.Transition count delta: 38
Deduced a syphon composed of 38 places in 0 ms
Reduce places removed 38 places and 0 transitions.
Iterating global reduction 6 with 76 rules applied. Total rules applied 520 place count 68 transition count 252
Discarding 10 places :
Symmetric choice reduction at 6 with 10 rule applications. Total rules 530 place count 58 transition count 186
Iterating global reduction 6 with 10 rules applied. Total rules applied 540 place count 58 transition count 186
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 6 with 8 rules applied. Total rules applied 548 place count 58 transition count 178
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 7 with 4 rules applied. Total rules applied 552 place count 54 transition count 178
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 8 with 1 rules applied. Total rules applied 553 place count 54 transition count 177
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 555 place count 52 transition count 175
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 556 place count 51 transition count 175
Applied a total of 556 rules in 63 ms. Remains 51 /250 variables (removed 199) and now considering 175/605 (removed 430) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 64 ms. Remains : 51/250 places, 175/605 transitions.
[2024-06-01 03:48:21] [INFO ] Flatten gal took : 14 ms
[2024-06-01 03:48:21] [INFO ] Flatten gal took : 14 ms
[2024-06-01 03:48:21] [INFO ] Input system was already deterministic with 175 transitions.
RANDOM walk for 126 steps (6 resets) in 4 ms. (25 steps per ms) remains 0/1 properties
FORMULA AutonomousCar-PT-06b-CTLFireability-2024-05 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Starting structural reductions in LTL mode, iteration 0 : 250/250 places, 605/605 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 236 transition count 591
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 236 transition count 591
Ensure Unique test removed 144 transitions
Reduce isomorphic transitions removed 144 transitions.
Iterating post reduction 0 with 144 rules applied. Total rules applied 172 place count 236 transition count 447
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 173 place count 235 transition count 446
Iterating global reduction 1 with 1 rules applied. Total rules applied 174 place count 235 transition count 446
Applied a total of 174 rules in 17 ms. Remains 235 /250 variables (removed 15) and now considering 446/605 (removed 159) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 18 ms. Remains : 235/250 places, 446/605 transitions.
[2024-06-01 03:48:21] [INFO ] Flatten gal took : 21 ms
[2024-06-01 03:48:21] [INFO ] Flatten gal took : 23 ms
[2024-06-01 03:48:21] [INFO ] Input system was already deterministic with 446 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 250/250 places, 605/605 transitions.
Graph (trivial) has 217 edges and 250 vertex of which 4 / 250 are part of one of the 2 SCC in 0 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 95 transitions
Trivial Post-agglo rules discarded 95 transitions
Performed 95 trivial Post agglomeration. Transition count delta: 95
Iterating post reduction 0 with 95 rules applied. Total rules applied 96 place count 247 transition count 507
Reduce places removed 95 places and 0 transitions.
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 20 transitions
Trivial Post-agglo rules discarded 20 transitions
Performed 20 trivial Post agglomeration. Transition count delta: 20
Iterating post reduction 1 with 130 rules applied. Total rules applied 226 place count 152 transition count 472
Reduce places removed 20 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 21 rules applied. Total rules applied 247 place count 132 transition count 471
Reduce places removed 1 places and 0 transitions.
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 3 with 3 rules applied. Total rules applied 250 place count 131 transition count 469
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 251 place count 130 transition count 469
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 5 Pre rules applied. Total rules applied 251 place count 130 transition count 464
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 5 with 10 rules applied. Total rules applied 261 place count 125 transition count 464
Discarding 10 places :
Symmetric choice reduction at 5 with 10 rule applications. Total rules 271 place count 115 transition count 454
Iterating global reduction 5 with 10 rules applied. Total rules applied 281 place count 115 transition count 454
Ensure Unique test removed 144 transitions
Reduce isomorphic transitions removed 144 transitions.
Iterating post reduction 5 with 144 rules applied. Total rules applied 425 place count 115 transition count 310
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 1 Pre rules applied. Total rules applied 425 place count 115 transition count 309
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 427 place count 114 transition count 309
Discarding 3 places :
Symmetric choice reduction at 6 with 3 rule applications. Total rules 430 place count 111 transition count 296
Iterating global reduction 6 with 3 rules applied. Total rules applied 433 place count 111 transition count 296
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 6 with 4 rules applied. Total rules applied 437 place count 111 transition count 292
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 7 with 2 rules applied. Total rules applied 439 place count 109 transition count 292
Performed 32 Post agglomeration using F-continuation condition.Transition count delta: 32
Deduced a syphon composed of 32 places in 1 ms
Reduce places removed 32 places and 0 transitions.
Iterating global reduction 8 with 64 rules applied. Total rules applied 503 place count 77 transition count 260
Discarding 7 places :
Symmetric choice reduction at 8 with 7 rule applications. Total rules 510 place count 70 transition count 215
Iterating global reduction 8 with 7 rules applied. Total rules applied 517 place count 70 transition count 215
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 8 with 6 rules applied. Total rules applied 523 place count 70 transition count 209
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 9 with 3 rules applied. Total rules applied 526 place count 67 transition count 209
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 10 with 1 rules applied. Total rules applied 527 place count 67 transition count 208
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 10 with 2 rules applied. Total rules applied 529 place count 65 transition count 206
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 10 with 1 rules applied. Total rules applied 530 place count 64 transition count 206
Applied a total of 530 rules in 73 ms. Remains 64 /250 variables (removed 186) and now considering 206/605 (removed 399) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 73 ms. Remains : 64/250 places, 206/605 transitions.
[2024-06-01 03:48:21] [INFO ] Flatten gal took : 14 ms
[2024-06-01 03:48:21] [INFO ] Flatten gal took : 15 ms
[2024-06-01 03:48:21] [INFO ] Input system was already deterministic with 206 transitions.
Starting structural reductions in LTL mode, iteration 0 : 250/250 places, 605/605 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 238 transition count 593
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 238 transition count 593
Ensure Unique test removed 144 transitions
Reduce isomorphic transitions removed 144 transitions.
Iterating post reduction 0 with 144 rules applied. Total rules applied 168 place count 238 transition count 449
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 169 place count 237 transition count 448
Iterating global reduction 1 with 1 rules applied. Total rules applied 170 place count 237 transition count 448
Applied a total of 170 rules in 16 ms. Remains 237 /250 variables (removed 13) and now considering 448/605 (removed 157) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 16 ms. Remains : 237/250 places, 448/605 transitions.
[2024-06-01 03:48:21] [INFO ] Flatten gal took : 21 ms
[2024-06-01 03:48:21] [INFO ] Flatten gal took : 24 ms
[2024-06-01 03:48:21] [INFO ] Input system was already deterministic with 448 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 250/250 places, 605/605 transitions.
Graph (trivial) has 217 edges and 250 vertex of which 4 / 250 are part of one of the 2 SCC in 0 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 97 transitions
Trivial Post-agglo rules discarded 97 transitions
Performed 97 trivial Post agglomeration. Transition count delta: 97
Iterating post reduction 0 with 97 rules applied. Total rules applied 98 place count 247 transition count 505
Reduce places removed 97 places and 0 transitions.
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 22 transitions
Trivial Post-agglo rules discarded 22 transitions
Performed 22 trivial Post agglomeration. Transition count delta: 22
Iterating post reduction 1 with 135 rules applied. Total rules applied 233 place count 150 transition count 467
Reduce places removed 22 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 23 rules applied. Total rules applied 256 place count 128 transition count 466
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 257 place count 127 transition count 466
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 6 Pre rules applied. Total rules applied 257 place count 127 transition count 460
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 4 with 12 rules applied. Total rules applied 269 place count 121 transition count 460
Discarding 11 places :
Symmetric choice reduction at 4 with 11 rule applications. Total rules 280 place count 110 transition count 449
Iterating global reduction 4 with 11 rules applied. Total rules applied 291 place count 110 transition count 449
Ensure Unique test removed 144 transitions
Reduce isomorphic transitions removed 144 transitions.
Iterating post reduction 4 with 144 rules applied. Total rules applied 435 place count 110 transition count 305
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 438 place count 107 transition count 292
Iterating global reduction 5 with 3 rules applied. Total rules applied 441 place count 107 transition count 292
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 5 with 4 rules applied. Total rules applied 445 place count 107 transition count 288
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 6 with 2 rules applied. Total rules applied 447 place count 105 transition count 288
Performed 31 Post agglomeration using F-continuation condition.Transition count delta: 31
Deduced a syphon composed of 31 places in 0 ms
Reduce places removed 31 places and 0 transitions.
Iterating global reduction 7 with 62 rules applied. Total rules applied 509 place count 74 transition count 257
Discarding 6 places :
Symmetric choice reduction at 7 with 6 rule applications. Total rules 515 place count 68 transition count 218
Iterating global reduction 7 with 6 rules applied. Total rules applied 521 place count 68 transition count 218
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 7 with 5 rules applied. Total rules applied 526 place count 68 transition count 213
Reduce places removed 2 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 8 with 3 rules applied. Total rules applied 529 place count 66 transition count 212
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 9 with 1 rules applied. Total rules applied 530 place count 65 transition count 212
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 10 with 1 rules applied. Total rules applied 531 place count 65 transition count 211
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 10 with 1 rules applied. Total rules applied 532 place count 65 transition count 211
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 10 with 2 rules applied. Total rules applied 534 place count 63 transition count 209
Applied a total of 534 rules in 60 ms. Remains 63 /250 variables (removed 187) and now considering 209/605 (removed 396) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 60 ms. Remains : 63/250 places, 209/605 transitions.
[2024-06-01 03:48:21] [INFO ] Flatten gal took : 17 ms
[2024-06-01 03:48:21] [INFO ] Flatten gal took : 18 ms
[2024-06-01 03:48:22] [INFO ] Input system was already deterministic with 209 transitions.
Starting structural reductions in LTL mode, iteration 0 : 250/250 places, 605/605 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 236 transition count 591
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 236 transition count 591
Ensure Unique test removed 144 transitions
Reduce isomorphic transitions removed 144 transitions.
Iterating post reduction 0 with 144 rules applied. Total rules applied 172 place count 236 transition count 447
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 173 place count 235 transition count 446
Iterating global reduction 1 with 1 rules applied. Total rules applied 174 place count 235 transition count 446
Applied a total of 174 rules in 15 ms. Remains 235 /250 variables (removed 15) and now considering 446/605 (removed 159) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 16 ms. Remains : 235/250 places, 446/605 transitions.
[2024-06-01 03:48:22] [INFO ] Flatten gal took : 21 ms
[2024-06-01 03:48:22] [INFO ] Flatten gal took : 23 ms
[2024-06-01 03:48:22] [INFO ] Input system was already deterministic with 446 transitions.
Starting structural reductions in LTL mode, iteration 0 : 250/250 places, 605/605 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 238 transition count 593
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 238 transition count 593
Ensure Unique test removed 144 transitions
Reduce isomorphic transitions removed 144 transitions.
Iterating post reduction 0 with 144 rules applied. Total rules applied 168 place count 238 transition count 449
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 169 place count 237 transition count 448
Iterating global reduction 1 with 1 rules applied. Total rules applied 170 place count 237 transition count 448
Applied a total of 170 rules in 16 ms. Remains 237 /250 variables (removed 13) and now considering 448/605 (removed 157) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 16 ms. Remains : 237/250 places, 448/605 transitions.
[2024-06-01 03:48:22] [INFO ] Flatten gal took : 24 ms
[2024-06-01 03:48:22] [INFO ] Flatten gal took : 23 ms
[2024-06-01 03:48:22] [INFO ] Input system was already deterministic with 448 transitions.
Starting structural reductions in LTL mode, iteration 0 : 250/250 places, 605/605 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 237 transition count 592
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 237 transition count 592
Ensure Unique test removed 144 transitions
Reduce isomorphic transitions removed 144 transitions.
Iterating post reduction 0 with 144 rules applied. Total rules applied 170 place count 237 transition count 448
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 171 place count 236 transition count 447
Iterating global reduction 1 with 1 rules applied. Total rules applied 172 place count 236 transition count 447
Applied a total of 172 rules in 15 ms. Remains 236 /250 variables (removed 14) and now considering 447/605 (removed 158) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 15 ms. Remains : 236/250 places, 447/605 transitions.
[2024-06-01 03:48:22] [INFO ] Flatten gal took : 21 ms
[2024-06-01 03:48:22] [INFO ] Flatten gal took : 23 ms
[2024-06-01 03:48:22] [INFO ] Input system was already deterministic with 447 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 250/250 places, 605/605 transitions.
Graph (trivial) has 235 edges and 250 vertex of which 4 / 250 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 99 transitions
Trivial Post-agglo rules discarded 99 transitions
Performed 99 trivial Post agglomeration. Transition count delta: 99
Iterating post reduction 0 with 99 rules applied. Total rules applied 100 place count 247 transition count 503
Reduce places removed 99 places and 0 transitions.
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 22 transitions
Trivial Post-agglo rules discarded 22 transitions
Performed 22 trivial Post agglomeration. Transition count delta: 22
Iterating post reduction 1 with 137 rules applied. Total rules applied 237 place count 148 transition count 465
Reduce places removed 22 places and 0 transitions.
Iterating post reduction 2 with 22 rules applied. Total rules applied 259 place count 126 transition count 465
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 5 Pre rules applied. Total rules applied 259 place count 126 transition count 460
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 10 rules applied. Total rules applied 269 place count 121 transition count 460
Discarding 11 places :
Symmetric choice reduction at 3 with 11 rule applications. Total rules 280 place count 110 transition count 449
Iterating global reduction 3 with 11 rules applied. Total rules applied 291 place count 110 transition count 449
Ensure Unique test removed 144 transitions
Reduce isomorphic transitions removed 144 transitions.
Iterating post reduction 3 with 144 rules applied. Total rules applied 435 place count 110 transition count 305
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 435 place count 110 transition count 304
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 437 place count 109 transition count 304
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 440 place count 106 transition count 291
Iterating global reduction 4 with 3 rules applied. Total rules applied 443 place count 106 transition count 291
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 4 with 4 rules applied. Total rules applied 447 place count 106 transition count 287
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 449 place count 104 transition count 287
Performed 37 Post agglomeration using F-continuation condition.Transition count delta: 37
Deduced a syphon composed of 37 places in 0 ms
Reduce places removed 37 places and 0 transitions.
Iterating global reduction 6 with 74 rules applied. Total rules applied 523 place count 67 transition count 250
Discarding 9 places :
Symmetric choice reduction at 6 with 9 rule applications. Total rules 532 place count 58 transition count 190
Iterating global reduction 6 with 9 rules applied. Total rules applied 541 place count 58 transition count 190
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 6 with 6 rules applied. Total rules applied 547 place count 58 transition count 184
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 7 with 3 rules applied. Total rules applied 550 place count 55 transition count 184
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 8 with 1 rules applied. Total rules applied 551 place count 55 transition count 183
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 8 with 1 rules applied. Total rules applied 552 place count 55 transition count 183
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 554 place count 53 transition count 181
Applied a total of 554 rules in 55 ms. Remains 53 /250 variables (removed 197) and now considering 181/605 (removed 424) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 55 ms. Remains : 53/250 places, 181/605 transitions.
[2024-06-01 03:48:22] [INFO ] Flatten gal took : 14 ms
[2024-06-01 03:48:22] [INFO ] Flatten gal took : 15 ms
[2024-06-01 03:48:22] [INFO ] Input system was already deterministic with 181 transitions.
RANDOM walk for 5141 steps (309 resets) in 75 ms. (67 steps per ms) remains 0/1 properties
FORMULA AutonomousCar-PT-06b-CTLFireability-2023-13 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Starting structural reductions in LTL mode, iteration 0 : 250/250 places, 605/605 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 237 transition count 592
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 237 transition count 592
Ensure Unique test removed 144 transitions
Reduce isomorphic transitions removed 144 transitions.
Iterating post reduction 0 with 144 rules applied. Total rules applied 170 place count 237 transition count 448
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 171 place count 236 transition count 447
Iterating global reduction 1 with 1 rules applied. Total rules applied 172 place count 236 transition count 447
Applied a total of 172 rules in 15 ms. Remains 236 /250 variables (removed 14) and now considering 447/605 (removed 158) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 15 ms. Remains : 236/250 places, 447/605 transitions.
[2024-06-01 03:48:22] [INFO ] Flatten gal took : 19 ms
[2024-06-01 03:48:22] [INFO ] Flatten gal took : 20 ms
[2024-06-01 03:48:22] [INFO ] Input system was already deterministic with 447 transitions.
Starting structural reductions in LTL mode, iteration 0 : 250/250 places, 605/605 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 237 transition count 592
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 237 transition count 592
Ensure Unique test removed 144 transitions
Reduce isomorphic transitions removed 144 transitions.
Iterating post reduction 0 with 144 rules applied. Total rules applied 170 place count 237 transition count 448
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 171 place count 236 transition count 447
Iterating global reduction 1 with 1 rules applied. Total rules applied 172 place count 236 transition count 447
Applied a total of 172 rules in 15 ms. Remains 236 /250 variables (removed 14) and now considering 447/605 (removed 158) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 15 ms. Remains : 236/250 places, 447/605 transitions.
[2024-06-01 03:48:22] [INFO ] Flatten gal took : 19 ms
[2024-06-01 03:48:22] [INFO ] Flatten gal took : 19 ms
[2024-06-01 03:48:22] [INFO ] Input system was already deterministic with 447 transitions.
[2024-06-01 03:48:22] [INFO ] Flatten gal took : 27 ms
[2024-06-01 03:48:22] [INFO ] Flatten gal took : 25 ms
[2024-06-01 03:48:22] [INFO ] Export to MCC of 14 properties in file /home/mcc/execution/CTLFireability.sr.xml took 21 ms.
[2024-06-01 03:48:22] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 250 places, 605 transitions and 3734 arcs took 8 ms.
Total runtime 91612 ms.
There are residual formulas that ITS could not solve within timeout
Usage: pnml2lts-sym [-gvqh] [--order=]
[--mu-opt] [--saturation=]
[--sat-granularity=] [--save-sat-levels]
[--guidance=] [-d|--deadlock]
[--action=] [-i|--invariant=STRING] [-n|--no-exit]
[--trace=] [--type=]
[--mu=.mu] [--ctl-star=.ctl]
[--ctl=.ctl] [--ltl=.ltl] [--dot=STRING]
[--save-levels=STRING] [--pg-solve] [--attr=]
[--saturating-attractor] [--write-strategy=.spg]
[--check-strategy] [--interactive-play] [--player]
[--pg-write=.spg] [--no-matrix] [--noack=<1|2>]
[--edge-label=] [--labels] [-m|--matrix]
[--mucalc=.mcf|] [-c|--cache]
[--allow-undefined-edges] [--allow-undefined-values]
[-p|--por= (default: heur)]
[--weak=[valmari] (default: uses stronger left-commutativity)]
[--leap] [-r|--regroup=<(T,)+>] [--sloan-w1=] [--sloan-w2=]
[--cw-max-cols=] [--cw-max-rows=] [--col-ins=<(C.C',)+>]
[--mh-timeout=] [--row-perm=<(R,)+>] [--col-perm=<(C,)+>]
[--graph-metrics] [--regroup-exit] [--regroup-time]
[-g|--pins-guards] [--vset=] [--ldd32-step=]
[--ldd32-cache=] [--ldd-step=] [--ldd-cache=]
[--cache-ratio=] [--max-increase=]
[--min-free-nodes=] [--fdd-bits=]
[--fdd-reorder=]
[--vset-cache-diff=] [--no-soundness-check] [--precise]
[--next-union] [--peak-nodes] [--maxsum=]
[--block-size=] [--cluster-size=] [-v] [-q]
[--debug=] [--stats] [--where] [--when]
[--timeout=INT] [--version] [-h|--help] [--usage]
[OPTIONS] []
Could not compute solution for formula : AutonomousCar-PT-06b-CTLFireability-2024-00
Could not compute solution for formula : AutonomousCar-PT-06b-CTLFireability-2024-01
Could not compute solution for formula : AutonomousCar-PT-06b-CTLFireability-2024-02
Could not compute solution for formula : AutonomousCar-PT-06b-CTLFireability-2024-03
Could not compute solution for formula : AutonomousCar-PT-06b-CTLFireability-2024-04
Could not compute solution for formula : AutonomousCar-PT-06b-CTLFireability-2024-06
Could not compute solution for formula : AutonomousCar-PT-06b-CTLFireability-2024-07
Could not compute solution for formula : AutonomousCar-PT-06b-CTLFireability-2024-08
Could not compute solution for formula : AutonomousCar-PT-06b-CTLFireability-2024-09
Could not compute solution for formula : AutonomousCar-PT-06b-CTLFireability-2024-10
Could not compute solution for formula : AutonomousCar-PT-06b-CTLFireability-2024-11
Could not compute solution for formula : AutonomousCar-PT-06b-CTLFireability-2023-12
Could not compute solution for formula : AutonomousCar-PT-06b-CTLFireability-2023-14
Could not compute solution for formula : AutonomousCar-PT-06b-CTLFireability-2023-15

BK_STOP 1717213703619

--------------------
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 CTLFireability -timeout 360 -rebuildPNML
mcc2024
ctl formula name AutonomousCar-PT-06b-CTLFireability-2024-00
ctl formula formula --ctl=/tmp/776/ctl_0_
ctl formula name AutonomousCar-PT-06b-CTLFireability-2024-01
ctl formula formula --ctl=/tmp/776/ctl_1_
ctl formula name AutonomousCar-PT-06b-CTLFireability-2024-02
ctl formula formula --ctl=/tmp/776/ctl_2_
ctl formula name AutonomousCar-PT-06b-CTLFireability-2024-03
ctl formula formula --ctl=/tmp/776/ctl_3_
ctl formula name AutonomousCar-PT-06b-CTLFireability-2024-04
ctl formula formula --ctl=/tmp/776/ctl_4_
ctl formula name AutonomousCar-PT-06b-CTLFireability-2024-06
ctl formula formula --ctl=/tmp/776/ctl_5_
ctl formula name AutonomousCar-PT-06b-CTLFireability-2024-07
ctl formula formula --ctl=/tmp/776/ctl_6_
ctl formula name AutonomousCar-PT-06b-CTLFireability-2024-08
ctl formula formula --ctl=/tmp/776/ctl_7_
ctl formula name AutonomousCar-PT-06b-CTLFireability-2024-09
ctl formula formula --ctl=/tmp/776/ctl_8_
ctl formula name AutonomousCar-PT-06b-CTLFireability-2024-10
ctl formula formula --ctl=/tmp/776/ctl_9_
ctl formula name AutonomousCar-PT-06b-CTLFireability-2024-11
ctl formula formula --ctl=/tmp/776/ctl_10_
ctl formula name AutonomousCar-PT-06b-CTLFireability-2023-12
ctl formula formula --ctl=/tmp/776/ctl_11_
ctl formula name AutonomousCar-PT-06b-CTLFireability-2023-14
ctl formula formula --ctl=/tmp/776/ctl_12_
ctl formula name AutonomousCar-PT-06b-CTLFireability-2023-15
ctl formula formula --ctl=/tmp/776/ctl_13_
pnml2lts-sym, ** error **: unknown vector set implementation lddmc

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-06b"
export BK_EXAMINATION="CTLFireability"
export BK_TOOL="ltsminxred"
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 ltsminxred"
echo " Input is AutonomousCar-PT-06b, examination is CTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r468-smll-171620167400306"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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