Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2021-input.r140-tall-162089127900429.qcow2', fmt=qcow2 size=4294967296 backing_file='/data/fkordon/mcc2021-input.qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
..........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itstools
Input is Parking-PT-416, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r140-tall-162089127900429
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 492K
-rw-r--r-- 1 mcc users 12K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 119K May 10 09:43 CTLCardinality.xml
-rw-r--r-- 1 mcc users 12K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 109K May 10 09:43 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 6 14:48 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K May 6 14:48 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.1K Mar 28 16:24 LTLCardinality.txt
-rw-r--r-- 1 mcc users 22K Mar 28 16:24 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.8K Mar 28 16:24 LTLFireability.txt
-rw-r--r-- 1 mcc users 14K Mar 28 16:24 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.4K Mar 27 06:37 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 17K Mar 27 06:37 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Mar 25 07:58 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 15K Mar 25 07:58 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Mar 22 09:15 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Mar 22 09:15 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 5 16:51 equiv_col
-rw-r--r-- 1 mcc users 4 May 5 16:51 instance
-rw-r--r-- 1 mcc users 6 May 5 16:51 iscolored
-rw-r--r-- 1 mcc users 107K May 5 16:51 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 Parking-PT-416-00
FORMULA_NAME Parking-PT-416-01
FORMULA_NAME Parking-PT-416-02
FORMULA_NAME Parking-PT-416-03
FORMULA_NAME Parking-PT-416-04
FORMULA_NAME Parking-PT-416-05
FORMULA_NAME Parking-PT-416-06
FORMULA_NAME Parking-PT-416-07
FORMULA_NAME Parking-PT-416-08
FORMULA_NAME Parking-PT-416-09
FORMULA_NAME Parking-PT-416-10
FORMULA_NAME Parking-PT-416-11
FORMULA_NAME Parking-PT-416-12
FORMULA_NAME Parking-PT-416-13
FORMULA_NAME Parking-PT-416-14
FORMULA_NAME Parking-PT-416-15

=== Now, execution of the tool begins

BK_START 1620980503131

Running Version 0
[2021-05-14 08:21:44] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2021-05-14 08:21:44] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-14 08:21:44] [INFO ] Load time of PNML (sax parser for PT used): 69 ms
[2021-05-14 08:21:44] [INFO ] Transformed 305 places.
[2021-05-14 08:21:44] [INFO ] Transformed 433 transitions.
[2021-05-14 08:21:44] [INFO ] Found NUPN structural information;
[2021-05-14 08:21:44] [INFO ] Parsed PT model containing 305 places and 433 transitions in 113 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 9 ms.
Working with output stream class java.io.PrintStream
Ensure Unique test removed 176 transitions
Reduce redundant transitions removed 176 transitions.
Support contains 42 out of 305 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 305/305 places, 257/257 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 302 transition count 254
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 302 transition count 254
Applied a total of 6 rules in 58 ms. Remains 302 /305 variables (removed 3) and now considering 254/257 (removed 3) transitions.
// Phase 1: matrix 254 rows 302 cols
[2021-05-14 08:21:44] [INFO ] Computed 76 place invariants in 21 ms
[2021-05-14 08:21:45] [INFO ] Implicit Places using invariants in 292 ms returned [48, 64, 72, 88, 90, 117, 125, 133, 141, 157, 186, 194, 210, 226, 256, 264, 272, 280, 296, 298]
Discarding 20 places :
Implicit Place search using SMT only with invariants took 323 ms to find 20 implicit places.
// Phase 1: matrix 254 rows 282 cols
[2021-05-14 08:21:45] [INFO ] Computed 56 place invariants in 3 ms
[2021-05-14 08:21:45] [INFO ] Dead Transitions using invariants and state equation in 174 ms returned []
Starting structural reductions, iteration 1 : 282/305 places, 254/257 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 270 transition count 242
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 270 transition count 242
Applied a total of 24 rules in 33 ms. Remains 270 /282 variables (removed 12) and now considering 242/254 (removed 12) transitions.
// Phase 1: matrix 242 rows 270 cols
[2021-05-14 08:21:45] [INFO ] Computed 56 place invariants in 2 ms
[2021-05-14 08:21:45] [INFO ] Implicit Places using invariants in 115 ms returned []
// Phase 1: matrix 242 rows 270 cols
[2021-05-14 08:21:45] [INFO ] Computed 56 place invariants in 4 ms
[2021-05-14 08:21:45] [INFO ] State equation strengthened by 60 read => feed constraints.
[2021-05-14 08:21:45] [INFO ] Implicit Places using invariants and state equation in 265 ms returned []
Implicit Place search using SMT with State Equation took 383 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 270/305 places, 242/257 transitions.
[2021-05-14 08:21:46] [INFO ] Initial state reduction rules for LTL removed 2 formulas.
[2021-05-14 08:21:46] [INFO ] Flatten gal took : 49 ms
FORMULA Parking-PT-416-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Parking-PT-416-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Parking-PT-416-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-14 08:21:46] [INFO ] Flatten gal took : 20 ms
[2021-05-14 08:21:46] [INFO ] Input system was already deterministic with 242 transitions.
Incomplete random walk after 100000 steps, including 1280 resets, run finished after 521 ms. (steps per millisecond=191 ) properties (out of 23) seen :17
Running SMT prover for 6 properties.
// Phase 1: matrix 242 rows 270 cols
[2021-05-14 08:21:46] [INFO ] Computed 56 place invariants in 4 ms
[2021-05-14 08:21:46] [INFO ] [Real]Absence check using 56 positive place invariants in 14 ms returned sat
[2021-05-14 08:21:46] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 08:21:46] [INFO ] [Real]Absence check using state equation in 60 ms returned sat
[2021-05-14 08:21:46] [INFO ] State equation strengthened by 60 read => feed constraints.
[2021-05-14 08:21:46] [INFO ] [Real]Added 60 Read/Feed constraints in 6 ms returned sat
[2021-05-14 08:21:46] [INFO ] Solution in real domain found non-integer solution.
[2021-05-14 08:21:46] [INFO ] [Nat]Absence check using 56 positive place invariants in 20 ms returned sat
[2021-05-14 08:21:46] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-14 08:21:46] [INFO ] [Nat]Absence check using state equation in 63 ms returned sat
[2021-05-14 08:21:47] [INFO ] [Nat]Added 60 Read/Feed constraints in 7 ms returned sat
[2021-05-14 08:21:47] [INFO ] Computed and/alt/rep : 241/656/241 causal constraints (skipped 0 transitions) in 23 ms.
[2021-05-14 08:21:47] [INFO ] Deduced a trap composed of 35 places in 32 ms of which 3 ms to minimize.
[2021-05-14 08:21:47] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 67 ms
[2021-05-14 08:21:47] [INFO ] Added : 190 causal constraints over 38 iterations in 774 ms. Result :sat
[2021-05-14 08:21:47] [INFO ] [Real]Absence check using 56 positive place invariants in 10 ms returned sat
[2021-05-14 08:21:47] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 08:21:47] [INFO ] [Real]Absence check using state equation in 69 ms returned sat
[2021-05-14 08:21:47] [INFO ] [Real]Added 60 Read/Feed constraints in 7 ms returned sat
[2021-05-14 08:21:47] [INFO ] Solution in real domain found non-integer solution.
[2021-05-14 08:21:47] [INFO ] [Nat]Absence check using 56 positive place invariants in 11 ms returned sat
[2021-05-14 08:21:47] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-14 08:21:48] [INFO ] [Nat]Absence check using state equation in 89 ms returned sat
[2021-05-14 08:21:48] [INFO ] [Nat]Added 60 Read/Feed constraints in 7 ms returned sat
[2021-05-14 08:21:48] [INFO ] Computed and/alt/rep : 241/656/241 causal constraints (skipped 0 transitions) in 17 ms.
[2021-05-14 08:21:48] [INFO ] Deduced a trap composed of 32 places in 27 ms of which 2 ms to minimize.
[2021-05-14 08:21:48] [INFO ] Deduced a trap composed of 36 places in 20 ms of which 1 ms to minimize.
[2021-05-14 08:21:48] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 98 ms
[2021-05-14 08:21:48] [INFO ] Added : 189 causal constraints over 38 iterations in 756 ms. Result :sat
[2021-05-14 08:21:48] [INFO ] [Real]Absence check using 56 positive place invariants in 9 ms returned sat
[2021-05-14 08:21:48] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 08:21:48] [INFO ] [Real]Absence check using state equation in 61 ms returned sat
[2021-05-14 08:21:48] [INFO ] [Real]Added 60 Read/Feed constraints in 15 ms returned sat
[2021-05-14 08:21:48] [INFO ] Solution in real domain found non-integer solution.
[2021-05-14 08:21:49] [INFO ] [Nat]Absence check using 56 positive place invariants in 10 ms returned sat
[2021-05-14 08:21:49] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-14 08:21:49] [INFO ] [Nat]Absence check using state equation in 60 ms returned sat
[2021-05-14 08:21:49] [INFO ] [Nat]Added 60 Read/Feed constraints in 6 ms returned sat
[2021-05-14 08:21:49] [INFO ] Computed and/alt/rep : 241/656/241 causal constraints (skipped 0 transitions) in 12 ms.
[2021-05-14 08:21:49] [INFO ] Deduced a trap composed of 36 places in 16 ms of which 1 ms to minimize.
[2021-05-14 08:21:49] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 43 ms
[2021-05-14 08:21:49] [INFO ] Added : 170 causal constraints over 34 iterations in 556 ms. Result :sat
[2021-05-14 08:21:49] [INFO ] [Real]Absence check using 56 positive place invariants in 9 ms returned sat
[2021-05-14 08:21:49] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 08:21:49] [INFO ] [Real]Absence check using state equation in 59 ms returned sat
[2021-05-14 08:21:49] [INFO ] [Real]Added 60 Read/Feed constraints in 6 ms returned sat
[2021-05-14 08:21:49] [INFO ] Solution in real domain found non-integer solution.
[2021-05-14 08:21:49] [INFO ] [Nat]Absence check using 56 positive place invariants in 10 ms returned sat
[2021-05-14 08:21:49] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-14 08:21:49] [INFO ] [Nat]Absence check using state equation in 67 ms returned sat
[2021-05-14 08:21:49] [INFO ] [Nat]Added 60 Read/Feed constraints in 7 ms returned sat
[2021-05-14 08:21:49] [INFO ] Computed and/alt/rep : 241/656/241 causal constraints (skipped 0 transitions) in 16 ms.
[2021-05-14 08:21:50] [INFO ] Deduced a trap composed of 32 places in 19 ms of which 1 ms to minimize.
[2021-05-14 08:21:50] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 45 ms
[2021-05-14 08:21:50] [INFO ] Added : 193 causal constraints over 39 iterations in 650 ms. Result :sat
[2021-05-14 08:21:50] [INFO ] [Real]Absence check using 56 positive place invariants in 9 ms returned sat
[2021-05-14 08:21:50] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 08:21:50] [INFO ] [Real]Absence check using state equation in 65 ms returned sat
[2021-05-14 08:21:50] [INFO ] [Real]Added 60 Read/Feed constraints in 7 ms returned sat
[2021-05-14 08:21:50] [INFO ] Solution in real domain found non-integer solution.
[2021-05-14 08:21:50] [INFO ] [Nat]Absence check using 56 positive place invariants in 10 ms returned sat
[2021-05-14 08:21:50] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-14 08:21:50] [INFO ] [Nat]Absence check using state equation in 67 ms returned sat
[2021-05-14 08:21:50] [INFO ] [Nat]Added 60 Read/Feed constraints in 7 ms returned sat
[2021-05-14 08:21:50] [INFO ] Computed and/alt/rep : 241/656/241 causal constraints (skipped 0 transitions) in 19 ms.
[2021-05-14 08:21:51] [INFO ] Added : 173 causal constraints over 35 iterations in 522 ms. Result :sat
[2021-05-14 08:21:51] [INFO ] [Real]Absence check using 56 positive place invariants in 9 ms returned sat
[2021-05-14 08:21:51] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 08:21:51] [INFO ] [Real]Absence check using state equation in 67 ms returned sat
[2021-05-14 08:21:51] [INFO ] Solution in real domain found non-integer solution.
[2021-05-14 08:21:51] [INFO ] [Nat]Absence check using 56 positive place invariants in 9 ms returned sat
[2021-05-14 08:21:51] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-14 08:21:51] [INFO ] [Nat]Absence check using state equation in 65 ms returned sat
[2021-05-14 08:21:51] [INFO ] [Nat]Added 60 Read/Feed constraints in 7 ms returned sat
[2021-05-14 08:21:51] [INFO ] Computed and/alt/rep : 241/656/241 causal constraints (skipped 0 transitions) in 18 ms.
[2021-05-14 08:21:52] [INFO ] Deduced a trap composed of 36 places in 31 ms of which 15 ms to minimize.
[2021-05-14 08:21:52] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 70 ms
[2021-05-14 08:21:52] [INFO ] Added : 197 causal constraints over 41 iterations in 680 ms. Result :sat
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F(G(p0)))], workingDir=/home/mcc/execution]
Support contains 1 out of 270 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 270/270 places, 242/242 transitions.
Drop transitions removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 0 with 8 rules applied. Total rules applied 8 place count 270 transition count 234
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 16 place count 262 transition count 234
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 8 Pre rules applied. Total rules applied 16 place count 262 transition count 226
Deduced a syphon composed of 8 places in 1 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 2 with 16 rules applied. Total rules applied 32 place count 254 transition count 226
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 35 place count 251 transition count 223
Iterating global reduction 2 with 3 rules applied. Total rules applied 38 place count 251 transition count 223
Performed 15 Post agglomeration using F-continuation condition.Transition count delta: 15
Deduced a syphon composed of 15 places in 1 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 2 with 30 rules applied. Total rules applied 68 place count 236 transition count 208
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -3
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 70 place count 235 transition count 211
Applied a total of 70 rules in 44 ms. Remains 235 /270 variables (removed 35) and now considering 211/242 (removed 31) transitions.
// Phase 1: matrix 211 rows 235 cols
[2021-05-14 08:21:52] [INFO ] Computed 56 place invariants in 1 ms
[2021-05-14 08:21:52] [INFO ] Implicit Places using invariants in 111 ms returned [51, 126, 161, 181]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 112 ms to find 4 implicit places.
[2021-05-14 08:21:52] [INFO ] Redundant transitions in 8 ms returned []
// Phase 1: matrix 211 rows 231 cols
[2021-05-14 08:21:52] [INFO ] Computed 52 place invariants in 1 ms
[2021-05-14 08:21:52] [INFO ] Dead Transitions using invariants and state equation in 109 ms returned []
Starting structural reductions, iteration 1 : 231/270 places, 211/242 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 230 transition count 210
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 230 transition count 210
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 229 transition count 209
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -15
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 6 place count 228 transition count 224
Applied a total of 6 rules in 22 ms. Remains 228 /231 variables (removed 3) and now considering 224/211 (removed -13) transitions.
// Phase 1: matrix 224 rows 228 cols
[2021-05-14 08:21:52] [INFO ] Computed 52 place invariants in 1 ms
[2021-05-14 08:21:52] [INFO ] Implicit Places using invariants in 84 ms returned []
// Phase 1: matrix 224 rows 228 cols
[2021-05-14 08:21:52] [INFO ] Computed 52 place invariants in 7 ms
[2021-05-14 08:21:52] [INFO ] State equation strengthened by 104 read => feed constraints.
[2021-05-14 08:21:52] [INFO ] Implicit Places using invariants and state equation in 264 ms returned []
Implicit Place search using SMT with State Equation took 350 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 228/270 places, 224/242 transitions.
Stuttering acceptance computed with spot in 118 ms :[(NOT p0)]
Running random walk in product with property : Parking-PT-416-00 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=p0, acceptance={} source=0 dest: 0}]], initial=0, aps=[p0:(EQ s131 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 1329 reset in 403 ms.
Product exploration explored 100000 steps with 1320 reset in 371 ms.
Knowledge obtained : [p0]
Stuttering acceptance computed with spot in 23 ms :[(NOT p0)]
Product exploration explored 100000 steps with 1320 reset in 305 ms.
Stack based approach found an accepted trace after 82086 steps with 1097 reset with depth 60 and stack size 60 in 377 ms.
FORMULA Parking-PT-416-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Parking-PT-416-00 finished in 2329 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X((p0&&X((p0 U (G(p1)||F(p2)||G(p0)))))))], workingDir=/home/mcc/execution]
Support contains 5 out of 270 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 270/270 places, 242/242 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 267 transition count 239
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 267 transition count 239
Applied a total of 6 rules in 5 ms. Remains 267 /270 variables (removed 3) and now considering 239/242 (removed 3) transitions.
// Phase 1: matrix 239 rows 267 cols
[2021-05-14 08:21:54] [INFO ] Computed 56 place invariants in 1 ms
[2021-05-14 08:21:54] [INFO ] Implicit Places using invariants in 109 ms returned [55, 142, 182, 204]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 118 ms to find 4 implicit places.
// Phase 1: matrix 239 rows 263 cols
[2021-05-14 08:21:54] [INFO ] Computed 52 place invariants in 1 ms
[2021-05-14 08:21:54] [INFO ] Dead Transitions using invariants and state equation in 124 ms returned []
Starting structural reductions, iteration 1 : 263/270 places, 239/242 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 261 transition count 237
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 261 transition count 237
Applied a total of 4 rules in 9 ms. Remains 261 /263 variables (removed 2) and now considering 237/239 (removed 2) transitions.
// Phase 1: matrix 237 rows 261 cols
[2021-05-14 08:21:54] [INFO ] Computed 52 place invariants in 1 ms
[2021-05-14 08:21:54] [INFO ] Implicit Places using invariants in 93 ms returned []
// Phase 1: matrix 237 rows 261 cols
[2021-05-14 08:21:54] [INFO ] Computed 52 place invariants in 1 ms
[2021-05-14 08:21:55] [INFO ] State equation strengthened by 60 read => feed constraints.
[2021-05-14 08:21:55] [INFO ] Implicit Places using invariants and state equation in 263 ms returned []
Implicit Place search using SMT with State Equation took 358 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 261/270 places, 237/242 transitions.
Stuttering acceptance computed with spot in 160 ms :[true, (NOT p2), (NOT p0), (NOT p0), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1) (NOT p0))]
Running random walk in product with property : Parking-PT-416-01 automaton TGBA [mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p2), acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=(NOT p0), acceptance={} source=3 dest: 0}, { cond=p0, acceptance={} source=3 dest: 5}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=4 dest: 1}, { cond=(AND p1 (NOT p2)), acceptance={} source=4 dest: 4}], [{ cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={} source=5 dest: 1}, { cond=(AND (NOT p0) p1 (NOT p2)), acceptance={} source=5 dest: 4}, { cond=(AND p0 (NOT p2)), acceptance={} source=5 dest: 5}]], initial=2, aps=[p2:(NEQ s121 1), p0:(OR (NEQ s222 1) (NEQ s260 1)), p1:(OR (NEQ s7 1) (NEQ s73 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 33333 reset in 558 ms.
Product exploration explored 100000 steps with 33333 reset in 526 ms.
Knowledge obtained : [p2, p0, p1]
Stuttering acceptance computed with spot in 137 ms :[true, (NOT p2), (NOT p0), (NOT p0), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1) (NOT p0))]
Product exploration explored 100000 steps with 33333 reset in 474 ms.
Product exploration explored 100000 steps with 33333 reset in 521 ms.
Applying partial POR strategy [true, true, false, false, true, true]
Stuttering acceptance computed with spot in 142 ms :[true, (NOT p2), (NOT p0), (NOT p0), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1) (NOT p0))]
Support contains 5 out of 261 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 261/261 places, 237/237 transitions.
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 7 rules applied. Total rules applied 7 place count 261 transition count 237
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 7 Pre rules applied. Total rules applied 7 place count 261 transition count 237
Deduced a syphon composed of 14 places in 1 ms
Iterating global reduction 1 with 7 rules applied. Total rules applied 14 place count 261 transition count 237
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 21 place count 254 transition count 230
Deduced a syphon composed of 7 places in 1 ms
Iterating global reduction 1 with 7 rules applied. Total rules applied 28 place count 254 transition count 230
Performed 15 Post agglomeration using F-continuation condition.Transition count delta: -8
Deduced a syphon composed of 22 places in 0 ms
Iterating global reduction 1 with 15 rules applied. Total rules applied 43 place count 254 transition count 238
Deduced a syphon composed of 22 places in 0 ms
Applied a total of 43 rules in 32 ms. Remains 254 /261 variables (removed 7) and now considering 238/237 (removed -1) transitions.
[2021-05-14 08:21:58] [INFO ] Redundant transitions in 8 ms returned []
// Phase 1: matrix 238 rows 254 cols
[2021-05-14 08:21:58] [INFO ] Computed 52 place invariants in 1 ms
[2021-05-14 08:21:58] [INFO ] Dead Transitions using invariants and state equation in 134 ms returned []
Finished structural reductions, in 1 iterations. Remains : 254/261 places, 238/237 transitions.
Product exploration explored 100000 steps with 33333 reset in 1169 ms.
Product exploration explored 100000 steps with 33333 reset in 1124 ms.
[2021-05-14 08:22:00] [INFO ] Flatten gal took : 16 ms
[2021-05-14 08:22:00] [INFO ] Flatten gal took : 15 ms
[2021-05-14 08:22:00] [INFO ] Time to serialize gal into /tmp/LTL10421546061373304679.gal : 8 ms
[2021-05-14 08:22:00] [INFO ] Time to serialize properties into /tmp/LTL18086164476683887676.ltl : 1 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /tmp/LTL10421546061373304679.gal, -t, CGAL, -LTL, /tmp/LTL18086164476683887676.ltl, -c, -stutter-deadlock, --gen-order, FOLLOW], workingDir=/home/mcc/execution]

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL10421546061373304679.gal -t CGAL -LTL /tmp/LTL18086164476683887676.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((X((X(("((p255!=1)||(p304!=1))")U(((G("((p7!=1)||(p81!=1))"))||(F("(p138!=1)")))||(G("((p255!=1)||(p304!=1))")))))&&("((p255!=1)||(p304!=1))"))))
Formula 0 simplified : !X("((p255!=1)||(p304!=1))" & X("((p255!=1)||(p304!=1))" U (G"((p7!=1)||(p81!=1))" | F"(p138!=1)" | G"((p255!=1)||(p304!=1))")))
Detected timeout of ITS tools.
[2021-05-14 08:22:15] [INFO ] Flatten gal took : 14 ms
[2021-05-14 08:22:15] [INFO ] Applying decomposition
[2021-05-14 08:22:15] [INFO ] Flatten gal took : 14 ms
Converted graph to binary with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/convert-linux64, -i, /tmp/graph18147892146916871786.txt, -o, /tmp/graph18147892146916871786.bin, -w, /tmp/graph18147892146916871786.weights], workingDir=null]
Built communities with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/louvain-linux64, /tmp/graph18147892146916871786.bin, -l, -1, -v, -w, /tmp/graph18147892146916871786.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-14 08:22:15] [INFO ] Decomposing Gal with order
[2021-05-14 08:22:15] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-14 08:22:15] [INFO ] Removed a total of 24 redundant transitions.
[2021-05-14 08:22:15] [INFO ] Flatten gal took : 46 ms
[2021-05-14 08:22:15] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 10 ms.
[2021-05-14 08:22:15] [INFO ] Time to serialize gal into /tmp/LTL17838286708154616477.gal : 13 ms
[2021-05-14 08:22:15] [INFO ] Time to serialize properties into /tmp/LTL7451359826596754721.ltl : 1 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /tmp/LTL17838286708154616477.gal, -t, CGAL, -LTL, /tmp/LTL7451359826596754721.ltl, -c, -stutter-deadlock], workingDir=/home/mcc/execution]

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL17838286708154616477.gal -t CGAL -LTL /tmp/LTL7451359826596754721.ltl -c -stutter-deadlock
Read 1 LTL properties
Checking formula 0 : !((X((X(("((i12.u90.p255!=1)||(i12.u90.p304!=1))")U(((G("((i5.i3.u3.p7!=1)||(i2.u27.p81!=1))"))||(F("(i7.u43.p138!=1)")))||(G("((i12.u90.p255!=1)||(i12.u90.p304!=1))")))))&&("((i12.u90.p255!=1)||(i12.u90.p304!=1))"))))
Formula 0 simplified : !X("((i12.u90.p255!=1)||(i12.u90.p304!=1))" & X("((i12.u90.p255!=1)||(i12.u90.p304!=1))" U (G"((i5.i3.u3.p7!=1)||(i2.u27.p81!=1))" | F"(i7.u43.p138!=1)" | G"((i12.u90.p255!=1)||(i12.u90.p304!=1))")))
Reverse transition relation is NOT exact ! Due to transitions i3.u31.t57, i7.u50.t39, i10.i3.u70.t21, i12.u90.t2, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0/233/4/237
Computing Next relation with stutter on 130321 deadlock states
3 unique states visited
0 strongly connected components in search stack
2 transitions explored
3 items max in DFS search stack
16 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,0.185651,23704,1,0,16023,1695,2958,17561,385,4236,24857
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA Parking-PT-416-01 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Treatment of property Parking-PT-416-01 finished in 21372 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(G((p0&&X(X(p1))))))], workingDir=/home/mcc/execution]
Support contains 4 out of 270 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 270/270 places, 242/242 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 267 transition count 239
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 267 transition count 239
Applied a total of 6 rules in 9 ms. Remains 267 /270 variables (removed 3) and now considering 239/242 (removed 3) transitions.
// Phase 1: matrix 239 rows 267 cols
[2021-05-14 08:22:16] [INFO ] Computed 56 place invariants in 1 ms
[2021-05-14 08:22:16] [INFO ] Implicit Places using invariants in 95 ms returned [142, 182, 204]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 96 ms to find 3 implicit places.
// Phase 1: matrix 239 rows 264 cols
[2021-05-14 08:22:16] [INFO ] Computed 53 place invariants in 1 ms
[2021-05-14 08:22:16] [INFO ] Dead Transitions using invariants and state equation in 125 ms returned []
Starting structural reductions, iteration 1 : 264/270 places, 239/242 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 263 transition count 238
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 263 transition count 238
Applied a total of 2 rules in 10 ms. Remains 263 /264 variables (removed 1) and now considering 238/239 (removed 1) transitions.
// Phase 1: matrix 238 rows 263 cols
[2021-05-14 08:22:16] [INFO ] Computed 53 place invariants in 1 ms
[2021-05-14 08:22:16] [INFO ] Implicit Places using invariants in 110 ms returned []
// Phase 1: matrix 238 rows 263 cols
[2021-05-14 08:22:16] [INFO ] Computed 53 place invariants in 2 ms
[2021-05-14 08:22:16] [INFO ] State equation strengthened by 60 read => feed constraints.
[2021-05-14 08:22:16] [INFO ] Implicit Places using invariants and state equation in 263 ms returned []
Implicit Place search using SMT with State Equation took 377 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 263/270 places, 238/242 transitions.
Stuttering acceptance computed with spot in 123 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), true]
Running random walk in product with property : Parking-PT-416-02 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 3}], [{ cond=(AND p0 p1), acceptance={} source=1 dest: 1}, { cond=(OR (NOT p0) (NOT p1)), acceptance={} source=1 dest: 4}], [{ cond=p0, acceptance={} source=2 dest: 1}, { cond=(NOT p0), acceptance={} source=2 dest: 4}], [{ cond=p0, acceptance={} source=3 dest: 2}, { cond=(NOT p0), acceptance={} source=3 dest: 4}], [{ cond=true, acceptance={0} source=4 dest: 4}]], initial=0, aps=[p0:(OR (EQ s55 0) (EQ s82 0)), p1:(OR (NEQ s4 1) (NEQ s69 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA Parking-PT-416-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Parking-PT-416-02 finished in 753 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(X((G(F((!p0||G(p1))))||G(p2)))))], workingDir=/home/mcc/execution]
Support contains 4 out of 270 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 270/270 places, 242/242 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 267 transition count 239
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 267 transition count 239
Applied a total of 6 rules in 6 ms. Remains 267 /270 variables (removed 3) and now considering 239/242 (removed 3) transitions.
// Phase 1: matrix 239 rows 267 cols
[2021-05-14 08:22:16] [INFO ] Computed 56 place invariants in 2 ms
[2021-05-14 08:22:16] [INFO ] Implicit Places using invariants in 104 ms returned [55, 142, 182, 204]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 110 ms to find 4 implicit places.
// Phase 1: matrix 239 rows 263 cols
[2021-05-14 08:22:16] [INFO ] Computed 52 place invariants in 1 ms
[2021-05-14 08:22:17] [INFO ] Dead Transitions using invariants and state equation in 139 ms returned []
Starting structural reductions, iteration 1 : 263/270 places, 239/242 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 261 transition count 237
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 261 transition count 237
Applied a total of 4 rules in 9 ms. Remains 261 /263 variables (removed 2) and now considering 237/239 (removed 2) transitions.
// Phase 1: matrix 237 rows 261 cols
[2021-05-14 08:22:17] [INFO ] Computed 52 place invariants in 5 ms
[2021-05-14 08:22:17] [INFO ] Implicit Places using invariants in 94 ms returned []
// Phase 1: matrix 237 rows 261 cols
[2021-05-14 08:22:17] [INFO ] Computed 52 place invariants in 1 ms
[2021-05-14 08:22:17] [INFO ] State equation strengthened by 60 read => feed constraints.
[2021-05-14 08:22:17] [INFO ] Implicit Places using invariants and state equation in 252 ms returned []
Implicit Place search using SMT with State Equation took 348 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 261/270 places, 237/242 transitions.
Stuttering acceptance computed with spot in 143 ms :[(AND (NOT p2) (NOT p1) p0), (AND (NOT p1) p0), (AND (NOT p1) p0), (AND (NOT p2) (NOT p1) p0), (AND (NOT p2) (NOT p1) p0)]
Running random walk in product with property : Parking-PT-416-03 automaton TGBA [mat=[[{ cond=p2, acceptance={} source=0 dest: 0}, { cond=(NOT p2), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p2) (NOT p1) p0), acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p1) p0), acceptance={0} source=2 dest: 2}, { cond=(AND p1 p0), acceptance={} source=2 dest: 2}], [{ cond=true, acceptance={} source=3 dest: 0}], [{ cond=true, acceptance={} source=4 dest: 3}]], initial=4, aps=[p2:(AND (EQ s84 1) (EQ s135 1)), p1:(EQ s203 1), p0:(NEQ s121 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Stuttering criterion allowed to conclude after 76 steps with 0 reset in 0 ms.
FORMULA Parking-PT-416-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Parking-PT-416-03 finished in 772 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F((G(p0)||G(p1))))], workingDir=/home/mcc/execution]
Support contains 3 out of 270 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 270/270 places, 242/242 transitions.
Drop transitions removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 0 with 8 rules applied. Total rules applied 8 place count 270 transition count 234
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 16 place count 262 transition count 234
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 8 Pre rules applied. Total rules applied 16 place count 262 transition count 226
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 2 with 16 rules applied. Total rules applied 32 place count 254 transition count 226
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 35 place count 251 transition count 223
Iterating global reduction 2 with 3 rules applied. Total rules applied 38 place count 251 transition count 223
Performed 15 Post agglomeration using F-continuation condition.Transition count delta: 15
Deduced a syphon composed of 15 places in 0 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 2 with 30 rules applied. Total rules applied 68 place count 236 transition count 208
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -3
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 70 place count 235 transition count 211
Applied a total of 70 rules in 28 ms. Remains 235 /270 variables (removed 35) and now considering 211/242 (removed 31) transitions.
// Phase 1: matrix 211 rows 235 cols
[2021-05-14 08:22:17] [INFO ] Computed 56 place invariants in 1 ms
[2021-05-14 08:22:17] [INFO ] Implicit Places using invariants in 102 ms returned [51, 126, 161, 181]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 102 ms to find 4 implicit places.
[2021-05-14 08:22:17] [INFO ] Redundant transitions in 2 ms returned []
// Phase 1: matrix 211 rows 231 cols
[2021-05-14 08:22:17] [INFO ] Computed 52 place invariants in 1 ms
[2021-05-14 08:22:17] [INFO ] Dead Transitions using invariants and state equation in 97 ms returned []
Starting structural reductions, iteration 1 : 231/270 places, 211/242 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 230 transition count 210
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 230 transition count 210
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 229 transition count 209
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -15
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 6 place count 228 transition count 224
Applied a total of 6 rules in 19 ms. Remains 228 /231 variables (removed 3) and now considering 224/211 (removed -13) transitions.
// Phase 1: matrix 224 rows 228 cols
[2021-05-14 08:22:17] [INFO ] Computed 52 place invariants in 0 ms
[2021-05-14 08:22:17] [INFO ] Implicit Places using invariants in 96 ms returned []
// Phase 1: matrix 224 rows 228 cols
[2021-05-14 08:22:17] [INFO ] Computed 52 place invariants in 0 ms
[2021-05-14 08:22:17] [INFO ] State equation strengthened by 104 read => feed constraints.
[2021-05-14 08:22:18] [INFO ] Implicit Places using invariants and state equation in 272 ms returned []
Implicit Place search using SMT with State Equation took 370 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 228/270 places, 224/242 transitions.
Stuttering acceptance computed with spot in 28 ms :[(AND (NOT p0) (NOT p1))]
Running random walk in product with property : Parking-PT-416-04 automaton TGBA [mat=[[{ cond=(AND (NOT p0) (NOT p1)), acceptance={0, 1} source=0 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={0} source=0 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={1} source=0 dest: 0}, { cond=(AND p0 p1), acceptance={} source=0 dest: 0}]], initial=0, aps=[p0:(NEQ s28 1), p1:(OR (NEQ s83 1) (NEQ s114 1))], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 1322 reset in 362 ms.
Product exploration explored 100000 steps with 1329 reset in 390 ms.
Knowledge obtained : [p0, p1]
Stuttering acceptance computed with spot in 23 ms :[(AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 1332 reset in 330 ms.
Product exploration explored 100000 steps with 1332 reset in 361 ms.
[2021-05-14 08:22:19] [INFO ] Flatten gal took : 21 ms
[2021-05-14 08:22:19] [INFO ] Flatten gal took : 20 ms
[2021-05-14 08:22:19] [INFO ] Time to serialize gal into /tmp/LTL6801294569419136982.gal : 3 ms
[2021-05-14 08:22:19] [INFO ] Time to serialize properties into /tmp/LTL9909639098204511952.ltl : 0 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /tmp/LTL6801294569419136982.gal, -t, CGAL, -LTL, /tmp/LTL9909639098204511952.ltl, -c, -stutter-deadlock, --gen-order, FOLLOW], workingDir=/home/mcc/execution]

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL6801294569419136982.gal -t CGAL -LTL /tmp/LTL9909639098204511952.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((F((G("(p28!=1)"))||(G("((p102!=1)||(p148!=1))")))))
Formula 0 simplified : !F(G"(p28!=1)" | G"((p102!=1)||(p148!=1))")
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Computing Next relation with stutter on 130321 deadlock states
2 unique states visited
2 strongly connected components in search stack
2 transitions explored
2 items max in DFS search stack
1426 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,14.2778,465656,1,0,1675,2.36001e+06,37,1230,5704,3.14205e+06,2862
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA Parking-PT-416-04 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Detected timeout of ITS tools.
Treatment of property Parking-PT-416-04 finished in 17285 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(((!p0||X(G(p1))) U !p1))], workingDir=/home/mcc/execution]
Support contains 4 out of 270 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 270/270 places, 242/242 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 267 transition count 239
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 267 transition count 239
Applied a total of 6 rules in 5 ms. Remains 267 /270 variables (removed 3) and now considering 239/242 (removed 3) transitions.
// Phase 1: matrix 239 rows 267 cols
[2021-05-14 08:22:34] [INFO ] Computed 56 place invariants in 1 ms
[2021-05-14 08:22:34] [INFO ] Implicit Places using invariants in 119 ms returned [55, 142, 182, 204]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 121 ms to find 4 implicit places.
// Phase 1: matrix 239 rows 263 cols
[2021-05-14 08:22:34] [INFO ] Computed 52 place invariants in 1 ms
[2021-05-14 08:22:35] [INFO ] Dead Transitions using invariants and state equation in 121 ms returned []
Starting structural reductions, iteration 1 : 263/270 places, 239/242 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 261 transition count 237
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 261 transition count 237
Applied a total of 4 rules in 5 ms. Remains 261 /263 variables (removed 2) and now considering 237/239 (removed 2) transitions.
// Phase 1: matrix 237 rows 261 cols
[2021-05-14 08:22:35] [INFO ] Computed 52 place invariants in 1 ms
[2021-05-14 08:22:35] [INFO ] Implicit Places using invariants in 100 ms returned []
// Phase 1: matrix 237 rows 261 cols
[2021-05-14 08:22:35] [INFO ] Computed 52 place invariants in 1 ms
[2021-05-14 08:22:35] [INFO ] State equation strengthened by 60 read => feed constraints.
[2021-05-14 08:22:35] [INFO ] Implicit Places using invariants and state equation in 232 ms returned []
Implicit Place search using SMT with State Equation took 340 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 261/270 places, 237/242 transitions.
Stuttering acceptance computed with spot in 36 ms :[p1, true]
Running random walk in product with property : Parking-PT-416-05 automaton TGBA [mat=[[{ cond=(AND p1 (NOT p0)), acceptance={0} source=0 dest: 0}, { cond=(AND p1 p0), acceptance={0} source=0 dest: 1}], [{ cond=true, acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(OR (NEQ s203 1) (NEQ s219 1)), p0:(OR (NEQ s91 1) (NEQ s129 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Entered a terminal (fully accepting) state of product in 0 steps with 0 reset in 0 ms.
FORMULA Parking-PT-416-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Parking-PT-416-05 finished in 643 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F((X(F((p1&&F(p2))))||p0)))], workingDir=/home/mcc/execution]
Support contains 4 out of 270 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 270/270 places, 242/242 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 267 transition count 239
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 267 transition count 239
Applied a total of 6 rules in 5 ms. Remains 267 /270 variables (removed 3) and now considering 239/242 (removed 3) transitions.
// Phase 1: matrix 239 rows 267 cols
[2021-05-14 08:22:35] [INFO ] Computed 56 place invariants in 1 ms
[2021-05-14 08:22:35] [INFO ] Implicit Places using invariants in 93 ms returned [55, 142, 182, 204]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 94 ms to find 4 implicit places.
// Phase 1: matrix 239 rows 263 cols
[2021-05-14 08:22:35] [INFO ] Computed 52 place invariants in 1 ms
[2021-05-14 08:22:35] [INFO ] Dead Transitions using invariants and state equation in 103 ms returned []
Starting structural reductions, iteration 1 : 263/270 places, 239/242 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 261 transition count 237
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 261 transition count 237
Applied a total of 4 rules in 15 ms. Remains 261 /263 variables (removed 2) and now considering 237/239 (removed 2) transitions.
// Phase 1: matrix 237 rows 261 cols
[2021-05-14 08:22:35] [INFO ] Computed 52 place invariants in 1 ms
[2021-05-14 08:22:35] [INFO ] Implicit Places using invariants in 99 ms returned []
// Phase 1: matrix 237 rows 261 cols
[2021-05-14 08:22:35] [INFO ] Computed 52 place invariants in 1 ms
[2021-05-14 08:22:35] [INFO ] State equation strengthened by 60 read => feed constraints.
[2021-05-14 08:22:36] [INFO ] Implicit Places using invariants and state equation in 248 ms returned []
Implicit Place search using SMT with State Equation took 349 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 261/270 places, 237/242 transitions.
Stuttering acceptance computed with spot in 75 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : Parking-PT-416-06 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p0) p1 (NOT p2)), acceptance={0} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(OR (EQ s121 1) (AND (EQ s4 1) (EQ s67 1))), p1:(OR (AND (EQ s4 1) (EQ s67 1)) (EQ s121 1)), p2:(OR (NEQ s121 1) (NEQ s217 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Stuttering criterion allowed to conclude after 85 steps with 0 reset in 0 ms.
FORMULA Parking-PT-416-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Parking-PT-416-06 finished in 654 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G((F(p0)&&F(p1))))], workingDir=/home/mcc/execution]
Support contains 3 out of 270 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 270/270 places, 242/242 transitions.
Drop transitions removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 0 with 7 rules applied. Total rules applied 7 place count 270 transition count 235
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 14 place count 263 transition count 235
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 7 Pre rules applied. Total rules applied 14 place count 263 transition count 228
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 2 with 14 rules applied. Total rules applied 28 place count 256 transition count 228
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 31 place count 253 transition count 225
Iterating global reduction 2 with 3 rules applied. Total rules applied 34 place count 253 transition count 225
Performed 15 Post agglomeration using F-continuation condition.Transition count delta: 15
Deduced a syphon composed of 15 places in 1 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 2 with 30 rules applied. Total rules applied 64 place count 238 transition count 210
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -3
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 66 place count 237 transition count 213
Applied a total of 66 rules in 23 ms. Remains 237 /270 variables (removed 33) and now considering 213/242 (removed 29) transitions.
// Phase 1: matrix 213 rows 237 cols
[2021-05-14 08:22:36] [INFO ] Computed 56 place invariants in 1 ms
[2021-05-14 08:22:36] [INFO ] Implicit Places using invariants in 103 ms returned [51, 128, 183]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 103 ms to find 3 implicit places.
[2021-05-14 08:22:36] [INFO ] Redundant transitions in 2 ms returned []
// Phase 1: matrix 213 rows 234 cols
[2021-05-14 08:22:36] [INFO ] Computed 53 place invariants in 1 ms
[2021-05-14 08:22:36] [INFO ] Dead Transitions using invariants and state equation in 106 ms returned []
Starting structural reductions, iteration 1 : 234/270 places, 213/242 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -15
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 233 transition count 228
Applied a total of 2 rules in 10 ms. Remains 233 /234 variables (removed 1) and now considering 228/213 (removed -15) transitions.
// Phase 1: matrix 228 rows 233 cols
[2021-05-14 08:22:36] [INFO ] Computed 53 place invariants in 0 ms
[2021-05-14 08:22:36] [INFO ] Implicit Places using invariants in 98 ms returned []
// Phase 1: matrix 228 rows 233 cols
[2021-05-14 08:22:36] [INFO ] Computed 53 place invariants in 1 ms
[2021-05-14 08:22:36] [INFO ] State equation strengthened by 104 read => feed constraints.
[2021-05-14 08:22:36] [INFO ] Implicit Places using invariants and state equation in 291 ms returned []
Implicit Place search using SMT with State Equation took 391 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 233/270 places, 228/242 transitions.
Stuttering acceptance computed with spot in 71 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : Parking-PT-416-07 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(NEQ s53 1), p1:(OR (NEQ s160 1) (NEQ s179 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null][true, true, true]]
Product exploration explored 100000 steps with 5665 reset in 391 ms.
Product exploration explored 100000 steps with 5721 reset in 424 ms.
Knowledge obtained : [p0, p1]
Stuttering acceptance computed with spot in 67 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Product exploration explored 100000 steps with 5786 reset in 384 ms.
Product exploration explored 100000 steps with 5795 reset in 418 ms.
[2021-05-14 08:22:38] [INFO ] Flatten gal took : 12 ms
[2021-05-14 08:22:38] [INFO ] Flatten gal took : 12 ms
[2021-05-14 08:22:38] [INFO ] Time to serialize gal into /tmp/LTL4222667541715415269.gal : 2 ms
[2021-05-14 08:22:38] [INFO ] Time to serialize properties into /tmp/LTL15478849946983489796.ltl : 0 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /tmp/LTL4222667541715415269.gal, -t, CGAL, -LTL, /tmp/LTL15478849946983489796.ltl, -c, -stutter-deadlock, --gen-order, FOLLOW], workingDir=/home/mcc/execution]

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL4222667541715415269.gal -t CGAL -LTL /tmp/LTL15478849946983489796.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((G((F("(p60!=1)"))&&(F("((p204!=1)||(p229!=1))")))))
Formula 0 simplified : !G(F"(p60!=1)" & F"((p204!=1)||(p229!=1))")
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Computing Next relation with stutter on 130321 deadlock states
4 unique states visited
4 strongly connected components in search stack
5 transitions explored
4 items max in DFS search stack
44 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,0.468419,30208,1,0,12,63566,27,8,6201,29006,34
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA Parking-PT-416-07 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
ITS tools runner thread asked to quit. Dying gracefully.
Treatment of property Parking-PT-416-07 finished in 3045 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X((p0||F(p1))))], workingDir=/home/mcc/execution]
Support contains 3 out of 270 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 270/270 places, 242/242 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 268 transition count 240
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 268 transition count 240
Applied a total of 4 rules in 5 ms. Remains 268 /270 variables (removed 2) and now considering 240/242 (removed 2) transitions.
// Phase 1: matrix 240 rows 268 cols
[2021-05-14 08:22:39] [INFO ] Computed 56 place invariants in 1 ms
[2021-05-14 08:22:39] [INFO ] Implicit Places using invariants in 91 ms returned [55, 183, 205]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 91 ms to find 3 implicit places.
// Phase 1: matrix 240 rows 265 cols
[2021-05-14 08:22:39] [INFO ] Computed 53 place invariants in 1 ms
[2021-05-14 08:22:39] [INFO ] Dead Transitions using invariants and state equation in 118 ms returned []
Starting structural reductions, iteration 1 : 265/270 places, 240/242 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 263 transition count 238
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 263 transition count 238
Applied a total of 4 rules in 6 ms. Remains 263 /265 variables (removed 2) and now considering 238/240 (removed 2) transitions.
// Phase 1: matrix 238 rows 263 cols
[2021-05-14 08:22:39] [INFO ] Computed 53 place invariants in 1 ms
[2021-05-14 08:22:39] [INFO ] Implicit Places using invariants in 101 ms returned []
// Phase 1: matrix 238 rows 263 cols
[2021-05-14 08:22:39] [INFO ] Computed 53 place invariants in 0 ms
[2021-05-14 08:22:39] [INFO ] State equation strengthened by 60 read => feed constraints.
[2021-05-14 08:22:39] [INFO ] Implicit Places using invariants and state equation in 233 ms returned []
Implicit Place search using SMT with State Equation took 338 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 263/270 places, 238/242 transitions.
Stuttering acceptance computed with spot in 75 ms :[(AND (NOT p1) (NOT p0)), (NOT p1), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : Parking-PT-416-09 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 1}]], initial=0, aps=[p1:(EQ s63 1), p0:(AND (EQ s125 1) (EQ s141 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Stuttering criterion allowed to conclude after 61 steps with 0 reset in 0 ms.
FORMULA Parking-PT-416-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Parking-PT-416-09 finished in 644 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G(F(!p0)))], workingDir=/home/mcc/execution]
Support contains 2 out of 270 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 270/270 places, 242/242 transitions.
Drop transitions removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 0 with 8 rules applied. Total rules applied 8 place count 270 transition count 234
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 16 place count 262 transition count 234
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 8 Pre rules applied. Total rules applied 16 place count 262 transition count 226
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 2 with 16 rules applied. Total rules applied 32 place count 254 transition count 226
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 35 place count 251 transition count 223
Iterating global reduction 2 with 3 rules applied. Total rules applied 38 place count 251 transition count 223
Performed 15 Post agglomeration using F-continuation condition.Transition count delta: 15
Deduced a syphon composed of 15 places in 0 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 2 with 30 rules applied. Total rules applied 68 place count 236 transition count 208
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -3
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 70 place count 235 transition count 211
Applied a total of 70 rules in 25 ms. Remains 235 /270 variables (removed 35) and now considering 211/242 (removed 31) transitions.
// Phase 1: matrix 211 rows 235 cols
[2021-05-14 08:22:39] [INFO ] Computed 56 place invariants in 4 ms
[2021-05-14 08:22:39] [INFO ] Implicit Places using invariants in 105 ms returned [51, 126, 181]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 106 ms to find 3 implicit places.
[2021-05-14 08:22:39] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 211 rows 232 cols
[2021-05-14 08:22:39] [INFO ] Computed 53 place invariants in 1 ms
[2021-05-14 08:22:40] [INFO ] Dead Transitions using invariants and state equation in 111 ms returned []
Starting structural reductions, iteration 1 : 232/270 places, 211/242 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -15
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 231 transition count 226
Applied a total of 2 rules in 9 ms. Remains 231 /232 variables (removed 1) and now considering 226/211 (removed -15) transitions.
// Phase 1: matrix 226 rows 231 cols
[2021-05-14 08:22:40] [INFO ] Computed 53 place invariants in 1 ms
[2021-05-14 08:22:40] [INFO ] Implicit Places using invariants in 98 ms returned []
// Phase 1: matrix 226 rows 231 cols
[2021-05-14 08:22:40] [INFO ] Computed 53 place invariants in 1 ms
[2021-05-14 08:22:40] [INFO ] State equation strengthened by 104 read => feed constraints.
[2021-05-14 08:22:40] [INFO ] Implicit Places using invariants and state equation in 277 ms returned []
Implicit Place search using SMT with State Equation took 376 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 231/270 places, 226/242 transitions.
Stuttering acceptance computed with spot in 49 ms :[p0, p0]
Running random walk in product with property : Parking-PT-416-10 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=p0, acceptance={} source=0 dest: 1}], [{ cond=p0, acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (NEQ s158 1) (NEQ s177 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 87 steps with 0 reset in 1 ms.
FORMULA Parking-PT-416-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Parking-PT-416-10 finished in 693 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(G(p0)))], workingDir=/home/mcc/execution]
Support contains 2 out of 270 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 270/270 places, 242/242 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 267 transition count 239
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 267 transition count 239
Applied a total of 6 rules in 5 ms. Remains 267 /270 variables (removed 3) and now considering 239/242 (removed 3) transitions.
// Phase 1: matrix 239 rows 267 cols
[2021-05-14 08:22:40] [INFO ] Computed 56 place invariants in 1 ms
[2021-05-14 08:22:40] [INFO ] Implicit Places using invariants in 104 ms returned [55, 142, 182, 204]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 104 ms to find 4 implicit places.
// Phase 1: matrix 239 rows 263 cols
[2021-05-14 08:22:40] [INFO ] Computed 52 place invariants in 1 ms
[2021-05-14 08:22:40] [INFO ] Dead Transitions using invariants and state equation in 118 ms returned []
Starting structural reductions, iteration 1 : 263/270 places, 239/242 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 261 transition count 237
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 261 transition count 237
Applied a total of 4 rules in 5 ms. Remains 261 /263 variables (removed 2) and now considering 237/239 (removed 2) transitions.
// Phase 1: matrix 237 rows 261 cols
[2021-05-14 08:22:40] [INFO ] Computed 52 place invariants in 0 ms
[2021-05-14 08:22:40] [INFO ] Implicit Places using invariants in 98 ms returned []
// Phase 1: matrix 237 rows 261 cols
[2021-05-14 08:22:40] [INFO ] Computed 52 place invariants in 1 ms
[2021-05-14 08:22:40] [INFO ] State equation strengthened by 60 read => feed constraints.
[2021-05-14 08:22:41] [INFO ] Implicit Places using invariants and state equation in 253 ms returned []
Implicit Place search using SMT with State Equation took 352 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 261/270 places, 237/242 transitions.
Stuttering acceptance computed with spot in 56 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : Parking-PT-416-12 automaton TGBA [mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(OR (NEQ s52 1) (NEQ s82 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 118 steps with 1 reset in 0 ms.
FORMULA Parking-PT-416-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Parking-PT-416-12 finished in 650 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((F(((p1 U !p2)&&p0))||G(!p2)))], workingDir=/home/mcc/execution]
Support contains 6 out of 270 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 270/270 places, 242/242 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 0 with 7 rules applied. Total rules applied 7 place count 269 transition count 234
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 14 place count 262 transition count 234
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 7 Pre rules applied. Total rules applied 14 place count 262 transition count 227
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 2 with 14 rules applied. Total rules applied 28 place count 255 transition count 227
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 29 place count 254 transition count 226
Iterating global reduction 2 with 1 rules applied. Total rules applied 30 place count 254 transition count 226
Performed 15 Post agglomeration using F-continuation condition.Transition count delta: 15
Deduced a syphon composed of 15 places in 0 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 2 with 30 rules applied. Total rules applied 60 place count 239 transition count 211
Applied a total of 60 rules in 18 ms. Remains 239 /270 variables (removed 31) and now considering 211/242 (removed 31) transitions.
// Phase 1: matrix 211 rows 239 cols
[2021-05-14 08:22:41] [INFO ] Computed 56 place invariants in 1 ms
[2021-05-14 08:22:41] [INFO ] Implicit Places using invariants in 91 ms returned [50, 128, 163]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 92 ms to find 3 implicit places.
[2021-05-14 08:22:41] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 211 rows 236 cols
[2021-05-14 08:22:41] [INFO ] Computed 53 place invariants in 1 ms
[2021-05-14 08:22:41] [INFO ] Dead Transitions using invariants and state equation in 112 ms returned []
Starting structural reductions, iteration 1 : 236/270 places, 211/242 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 235 transition count 210
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 235 transition count 210
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 234 transition count 209
Applied a total of 4 rules in 10 ms. Remains 234 /236 variables (removed 2) and now considering 209/211 (removed 2) transitions.
// Phase 1: matrix 209 rows 234 cols
[2021-05-14 08:22:41] [INFO ] Computed 53 place invariants in 1 ms
[2021-05-14 08:22:41] [INFO ] Implicit Places using invariants in 92 ms returned []
// Phase 1: matrix 209 rows 234 cols
[2021-05-14 08:22:41] [INFO ] Computed 53 place invariants in 3 ms
[2021-05-14 08:22:41] [INFO ] Implicit Places using invariants and state equation in 164 ms returned []
Implicit Place search using SMT with State Equation took 265 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 234/270 places, 209/242 transitions.
Stuttering acceptance computed with spot in 84 ms :[p2, p2, (OR (NOT p0) p2)]
Running random walk in product with property : Parking-PT-416-13 automaton TGBA [mat=[[{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=0 dest: 0}, { cond=(AND p0 p2 p1), acceptance={} source=0 dest: 1}, { cond=(OR (AND (NOT p0) p2) (AND p2 (NOT p1))), acceptance={} source=0 dest: 2}], [{ cond=(AND p2 p1), acceptance={0} source=1 dest: 1}, { cond=(AND p2 (NOT p1)), acceptance={0} source=1 dest: 2}], [{ cond=(AND p0 p2 p1), acceptance={0} source=2 dest: 1}, { cond=(OR (NOT p0) (AND p2 (NOT p1))), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(AND (EQ s56 1) (EQ s180 1)), p2:(OR (NEQ s48 1) (NEQ s75 1)), p1:(AND (EQ s163 1) (EQ s179 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, weak, inherently-weak], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 74 steps with 0 reset in 0 ms.
FORMULA Parking-PT-416-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Parking-PT-416-13 finished in 594 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(F(((X(p0)&&G(p1))||G(p0)))))], workingDir=/home/mcc/execution]
Support contains 3 out of 270 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 270/270 places, 242/242 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 267 transition count 239
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 267 transition count 239
Applied a total of 6 rules in 5 ms. Remains 267 /270 variables (removed 3) and now considering 239/242 (removed 3) transitions.
// Phase 1: matrix 239 rows 267 cols
[2021-05-14 08:22:41] [INFO ] Computed 56 place invariants in 0 ms
[2021-05-14 08:22:41] [INFO ] Implicit Places using invariants in 107 ms returned [55, 142, 182, 204]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 108 ms to find 4 implicit places.
// Phase 1: matrix 239 rows 263 cols
[2021-05-14 08:22:41] [INFO ] Computed 52 place invariants in 4 ms
[2021-05-14 08:22:41] [INFO ] Dead Transitions using invariants and state equation in 119 ms returned []
Starting structural reductions, iteration 1 : 263/270 places, 239/242 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 261 transition count 237
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 261 transition count 237
Applied a total of 4 rules in 5 ms. Remains 261 /263 variables (removed 2) and now considering 237/239 (removed 2) transitions.
// Phase 1: matrix 237 rows 261 cols
[2021-05-14 08:22:41] [INFO ] Computed 52 place invariants in 1 ms
[2021-05-14 08:22:42] [INFO ] Implicit Places using invariants in 98 ms returned []
// Phase 1: matrix 237 rows 261 cols
[2021-05-14 08:22:42] [INFO ] Computed 52 place invariants in 1 ms
[2021-05-14 08:22:42] [INFO ] State equation strengthened by 60 read => feed constraints.
[2021-05-14 08:22:42] [INFO ] Implicit Places using invariants and state equation in 248 ms returned []
Implicit Place search using SMT with State Equation took 347 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 261/270 places, 237/242 transitions.
Stuttering acceptance computed with spot in 98 ms :[(NOT p0), (NOT p0), (AND (NOT p1) (NOT p0)), (NOT p0)]
Running random walk in product with property : Parking-PT-416-14 automaton TGBA [mat=[[{ cond=(AND (NOT p1) (NOT p0)), acceptance={0, 1} source=0 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={0} source=0 dest: 0}, { cond=(AND p1 (NOT p0)), acceptance={0, 1} source=0 dest: 1}, { cond=(AND p1 p0), acceptance={0} source=0 dest: 1}, { cond=(AND p1 (NOT p0)), acceptance={1} source=0 dest: 2}, { cond=(AND p1 p0), acceptance={} source=0 dest: 2}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0, 1} source=1 dest: 0}, { cond=(AND p1 (NOT p0)), acceptance={0, 1} source=1 dest: 1}, { cond=(AND p1 (NOT p0)), acceptance={1} source=1 dest: 2}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0, 1} source=2 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={0} source=2 dest: 0}, { cond=(AND p1 (NOT p0)), acceptance={1} source=2 dest: 2}, { cond=(AND p1 p0), acceptance={} source=2 dest: 2}], [{ cond=true, acceptance={} source=3 dest: 0}]], initial=3, aps=[p1:(NEQ s83 1), p0:(AND (NEQ s217 0) (NEQ s249 0))], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch], stateDesc=[null, null, null, null][false, false, false, false]]
Stuttering criterion allowed to conclude after 1529 steps with 19 reset in 6 ms.
FORMULA Parking-PT-416-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Parking-PT-416-14 finished in 700 ms.
All properties solved without resorting to model-checking.

BK_STOP 1620980563817

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

+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ cut -d . -f 9
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202104292328.jar
+ VERSION=0
+ echo 'Running Version 0'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data /home/mcc/execution/workspace -pnfolder /home/mcc/execution -examination LTLFireability -spotpath /home/mcc/BenchKit/bin//..//ltlfilt -z3path /home/mcc/BenchKit/bin//..//z3/bin/z3 -yices2path /home/mcc/BenchKit/bin//..//yices/bin/yices -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=/tmp/.eclipse -Xss128m -Xms40m -Xmx16000m

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="Parking-PT-416"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-4028"
echo " Executing tool itstools"
echo " Input is Parking-PT-416, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r140-tall-162089127900429"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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