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-162089127900453.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-864, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r140-tall-162089127900453
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 808K
-rw-r--r-- 1 mcc users 12K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 108K May 10 09:43 CTLCardinality.xml
-rw-r--r-- 1 mcc users 13K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 112K 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.2K Mar 28 16:24 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Mar 28 16:24 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K Mar 28 16:24 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Mar 28 16:24 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.4K Mar 27 06:58 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 17K Mar 27 06:58 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.6K Mar 25 08:15 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 16K Mar 25 08:15 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 427K 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-864-00
FORMULA_NAME Parking-PT-864-01
FORMULA_NAME Parking-PT-864-02
FORMULA_NAME Parking-PT-864-03
FORMULA_NAME Parking-PT-864-04
FORMULA_NAME Parking-PT-864-05
FORMULA_NAME Parking-PT-864-06
FORMULA_NAME Parking-PT-864-07
FORMULA_NAME Parking-PT-864-08
FORMULA_NAME Parking-PT-864-09
FORMULA_NAME Parking-PT-864-10
FORMULA_NAME Parking-PT-864-11
FORMULA_NAME Parking-PT-864-12
FORMULA_NAME Parking-PT-864-13
FORMULA_NAME Parking-PT-864-14
FORMULA_NAME Parking-PT-864-15

=== Now, execution of the tool begins

BK_START 1620984212135

Running Version 0
[2021-05-14 09:23:33] [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 09:23:33] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-14 09:23:33] [INFO ] Load time of PNML (sax parser for PT used): 109 ms
[2021-05-14 09:23:33] [INFO ] Transformed 1185 places.
[2021-05-14 09:23:33] [INFO ] Transformed 1697 transitions.
[2021-05-14 09:23:33] [INFO ] Found NUPN structural information;
[2021-05-14 09:23:33] [INFO ] Parsed PT model containing 1185 places and 1697 transitions in 155 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 9 ms.
Working with output stream class java.io.PrintStream
[2021-05-14 09:23:33] [INFO ] Initial state test concluded for 2 properties.
Ensure Unique test removed 688 transitions
Reduce redundant transitions removed 688 transitions.
FORMULA Parking-PT-864-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 44 out of 1185 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 1185/1185 places, 1009/1009 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 1178 transition count 1002
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 1178 transition count 1002
Applied a total of 14 rules in 181 ms. Remains 1178 /1185 variables (removed 7) and now considering 1002/1009 (removed 7) transitions.
// Phase 1: matrix 1002 rows 1178 cols
[2021-05-14 09:23:34] [INFO ] Computed 280 place invariants in 49 ms
[2021-05-14 09:23:34] [INFO ] Implicit Places using invariants in 746 ms returned [152, 160, 168, 176, 184, 192, 200, 208, 240, 242, 285, 293, 301, 309, 317, 325, 333, 341, 373, 375, 418, 426, 434, 442, 450, 458, 466, 474, 506, 508, 551, 559, 567, 575, 583, 591, 599, 607, 639, 641, 684, 692, 700, 708, 716, 724, 732, 740, 772, 774, 817, 825, 833, 841, 849, 857, 865, 873, 905, 907, 950, 958, 966, 974, 982, 990, 998, 1006, 1038, 1040, 1084, 1092, 1100, 1108, 1116, 1124, 1132, 1140, 1172]
Discarding 79 places :
Implicit Place search using SMT only with invariants took 775 ms to find 79 implicit places.
// Phase 1: matrix 1002 rows 1099 cols
[2021-05-14 09:23:34] [INFO ] Computed 201 place invariants in 6 ms
[2021-05-14 09:23:35] [INFO ] Dead Transitions using invariants and state equation in 480 ms returned []
Starting structural reductions, iteration 1 : 1099/1185 places, 1002/1009 transitions.
Discarding 63 places :
Symmetric choice reduction at 0 with 63 rule applications. Total rules 63 place count 1036 transition count 939
Iterating global reduction 0 with 63 rules applied. Total rules applied 126 place count 1036 transition count 939
Applied a total of 126 rules in 122 ms. Remains 1036 /1099 variables (removed 63) and now considering 939/1002 (removed 63) transitions.
// Phase 1: matrix 939 rows 1036 cols
[2021-05-14 09:23:35] [INFO ] Computed 201 place invariants in 3 ms
[2021-05-14 09:23:35] [INFO ] Implicit Places using invariants in 360 ms returned []
// Phase 1: matrix 939 rows 1036 cols
[2021-05-14 09:23:35] [INFO ] Computed 201 place invariants in 3 ms
[2021-05-14 09:23:36] [INFO ] State equation strengthened by 248 read => feed constraints.
[2021-05-14 09:23:38] [INFO ] Implicit Places using invariants and state equation in 2248 ms returned []
Implicit Place search using SMT with State Equation took 2611 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 1036/1185 places, 939/1009 transitions.
[2021-05-14 09:23:38] [INFO ] Initial state reduction rules for LTL removed 4 formulas.
[2021-05-14 09:23:38] [INFO ] Flatten gal took : 123 ms
FORMULA Parking-PT-864-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Parking-PT-864-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Parking-PT-864-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Parking-PT-864-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-14 09:23:38] [INFO ] Flatten gal took : 67 ms
[2021-05-14 09:23:38] [INFO ] Input system was already deterministic with 939 transitions.
Incomplete random walk after 100000 steps, including 388 resets, run finished after 1192 ms. (steps per millisecond=83 ) properties (out of 25) seen :20
Running SMT prover for 5 properties.
// Phase 1: matrix 939 rows 1036 cols
[2021-05-14 09:23:39] [INFO ] Computed 201 place invariants in 3 ms
[2021-05-14 09:23:39] [INFO ] [Real]Absence check using 201 positive place invariants in 34 ms returned sat
[2021-05-14 09:23:39] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 09:23:40] [INFO ] [Real]Absence check using state equation in 270 ms returned sat
[2021-05-14 09:23:40] [INFO ] State equation strengthened by 248 read => feed constraints.
[2021-05-14 09:23:40] [INFO ] [Real]Added 248 Read/Feed constraints in 23 ms returned sat
[2021-05-14 09:23:40] [INFO ] Solution in real domain found non-integer solution.
[2021-05-14 09:23:40] [INFO ] [Nat]Absence check using 201 positive place invariants in 35 ms returned sat
[2021-05-14 09:23:40] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-14 09:23:40] [INFO ] [Nat]Absence check using state equation in 268 ms returned sat
[2021-05-14 09:23:40] [INFO ] [Nat]Added 248 Read/Feed constraints in 29 ms returned sat
[2021-05-14 09:23:40] [INFO ] Computed and/alt/rep : 936/2621/936 causal constraints (skipped 2 transitions) in 43 ms.
[2021-05-14 09:23:49] [INFO ] Deduced a trap composed of 67 places in 70 ms of which 3 ms to minimize.
[2021-05-14 09:23:49] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 184 ms
[2021-05-14 09:23:50] [INFO ] Added : 782 causal constraints over 157 iterations in 9200 ms. Result :sat
[2021-05-14 09:23:50] [INFO ] [Real]Absence check using 201 positive place invariants in 44 ms returned sat
[2021-05-14 09:23:50] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 09:23:50] [INFO ] [Real]Absence check using state equation in 296 ms returned sat
[2021-05-14 09:23:50] [INFO ] [Real]Added 248 Read/Feed constraints in 26 ms returned sat
[2021-05-14 09:23:50] [INFO ] Solution in real domain found non-integer solution.
[2021-05-14 09:23:50] [INFO ] [Nat]Absence check using 201 positive place invariants in 34 ms returned sat
[2021-05-14 09:23:50] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-14 09:23:50] [INFO ] [Nat]Absence check using state equation in 286 ms returned sat
[2021-05-14 09:23:51] [INFO ] [Nat]Added 248 Read/Feed constraints in 24 ms returned sat
[2021-05-14 09:23:51] [INFO ] Computed and/alt/rep : 936/2621/936 causal constraints (skipped 2 transitions) in 47 ms.
[2021-05-14 09:23:59] [INFO ] Added : 778 causal constraints over 156 iterations in 8921 ms. Result :sat
[2021-05-14 09:24:00] [INFO ] [Real]Absence check using 201 positive place invariants in 36 ms returned sat
[2021-05-14 09:24:00] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 09:24:00] [INFO ] [Real]Absence check using state equation in 299 ms returned sat
[2021-05-14 09:24:00] [INFO ] [Real]Added 248 Read/Feed constraints in 26 ms returned sat
[2021-05-14 09:24:00] [INFO ] Solution in real domain found non-integer solution.
[2021-05-14 09:24:00] [INFO ] [Nat]Absence check using 201 positive place invariants in 36 ms returned sat
[2021-05-14 09:24:00] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-14 09:24:00] [INFO ] [Nat]Absence check using state equation in 269 ms returned sat
[2021-05-14 09:24:00] [INFO ] [Nat]Added 248 Read/Feed constraints in 24 ms returned sat
[2021-05-14 09:24:01] [INFO ] Computed and/alt/rep : 936/2621/936 causal constraints (skipped 2 transitions) in 38 ms.
[2021-05-14 09:24:09] [INFO ] Added : 753 causal constraints over 151 iterations in 8491 ms. Result :sat
[2021-05-14 09:24:09] [INFO ] [Real]Absence check using 201 positive place invariants in 34 ms returned sat
[2021-05-14 09:24:09] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 09:24:09] [INFO ] [Real]Absence check using state equation in 260 ms returned sat
[2021-05-14 09:24:09] [INFO ] [Real]Added 248 Read/Feed constraints in 24 ms returned sat
[2021-05-14 09:24:09] [INFO ] Solution in real domain found non-integer solution.
[2021-05-14 09:24:10] [INFO ] [Nat]Absence check using 201 positive place invariants in 39 ms returned sat
[2021-05-14 09:24:10] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-14 09:24:10] [INFO ] [Nat]Absence check using state equation in 263 ms returned sat
[2021-05-14 09:24:10] [INFO ] [Nat]Added 248 Read/Feed constraints in 24 ms returned sat
[2021-05-14 09:24:10] [INFO ] Computed and/alt/rep : 936/2621/936 causal constraints (skipped 2 transitions) in 44 ms.
[2021-05-14 09:24:19] [INFO ] Added : 765 causal constraints over 153 iterations in 8649 ms. Result :sat
[2021-05-14 09:24:19] [INFO ] [Real]Absence check using 201 positive place invariants in 34 ms returned sat
[2021-05-14 09:24:19] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 09:24:19] [INFO ] [Real]Absence check using state equation in 303 ms returned sat
[2021-05-14 09:24:19] [INFO ] [Real]Added 248 Read/Feed constraints in 27 ms returned sat
[2021-05-14 09:24:19] [INFO ] Solution in real domain found non-integer solution.
[2021-05-14 09:24:19] [INFO ] [Nat]Absence check using 201 positive place invariants in 37 ms returned sat
[2021-05-14 09:24:19] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-14 09:24:20] [INFO ] [Nat]Absence check using state equation in 304 ms returned sat
[2021-05-14 09:24:20] [INFO ] [Nat]Added 248 Read/Feed constraints in 26 ms returned sat
[2021-05-14 09:24:20] [INFO ] Computed and/alt/rep : 936/2621/936 causal constraints (skipped 2 transitions) in 54 ms.
[2021-05-14 09:24:28] [INFO ] Deduced a trap composed of 67 places in 43 ms of which 2 ms to minimize.
[2021-05-14 09:24:28] [INFO ] Deduced a trap composed of 67 places in 28 ms of which 1 ms to minimize.
[2021-05-14 09:24:28] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 259 ms
[2021-05-14 09:24:28] [INFO ] Added : 699 causal constraints over 140 iterations in 8414 ms. Result :sat
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((p0 U (G(p0)||(F(G((p2 U p3)))&&p1))))], workingDir=/home/mcc/execution]
Support contains 4 out of 1036 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 1036/1036 places, 939/939 transitions.
Drop transitions removed 31 transitions
Trivial Post-agglo rules discarded 31 transitions
Performed 31 trivial Post agglomeration. Transition count delta: 31
Iterating post reduction 0 with 31 rules applied. Total rules applied 31 place count 1036 transition count 908
Reduce places removed 31 places and 0 transitions.
Iterating post reduction 1 with 31 rules applied. Total rules applied 62 place count 1005 transition count 908
Performed 31 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 31 Pre rules applied. Total rules applied 62 place count 1005 transition count 877
Deduced a syphon composed of 31 places in 1 ms
Reduce places removed 31 places and 0 transitions.
Iterating global reduction 2 with 62 rules applied. Total rules applied 124 place count 974 transition count 877
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 125 place count 973 transition count 876
Iterating global reduction 2 with 1 rules applied. Total rules applied 126 place count 973 transition count 876
Performed 47 Post agglomeration using F-continuation condition.Transition count delta: 47
Deduced a syphon composed of 47 places in 1 ms
Reduce places removed 47 places and 0 transitions.
Iterating global reduction 2 with 94 rules applied. Total rules applied 220 place count 926 transition count 829
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -7
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 222 place count 925 transition count 836
Applied a total of 222 rules in 235 ms. Remains 925 /1036 variables (removed 111) and now considering 836/939 (removed 103) transitions.
// Phase 1: matrix 836 rows 925 cols
[2021-05-14 09:24:28] [INFO ] Computed 201 place invariants in 3 ms
[2021-05-14 09:24:29] [INFO ] Implicit Places using invariants in 415 ms returned [922]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 417 ms to find 1 implicit places.
[2021-05-14 09:24:29] [INFO ] Redundant transitions in 48 ms returned []
// Phase 1: matrix 836 rows 924 cols
[2021-05-14 09:24:29] [INFO ] Computed 200 place invariants in 3 ms
[2021-05-14 09:24:29] [INFO ] Dead Transitions using invariants and state equation in 382 ms returned []
Starting structural reductions, iteration 1 : 924/1036 places, 836/939 transitions.
Applied a total of 0 rules in 52 ms. Remains 924 /924 variables (removed 0) and now considering 836/836 (removed 0) transitions.
[2021-05-14 09:24:29] [INFO ] Redundant transitions in 8 ms returned []
// Phase 1: matrix 836 rows 924 cols
[2021-05-14 09:24:29] [INFO ] Computed 200 place invariants in 3 ms
[2021-05-14 09:24:30] [INFO ] Dead Transitions using invariants and state equation in 386 ms returned []
Finished structural reductions, in 2 iterations. Remains : 924/1036 places, 836/939 transitions.
Stuttering acceptance computed with spot in 272 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p3))), true, (NOT p3), (AND (NOT p0) (NOT p3)), (NOT p3)]
Running random walk in product with property : Parking-PT-864-01 automaton TGBA [mat=[[{ cond=(AND (NOT p1) p0), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(AND p1 (NOT p0)), acceptance={} source=0 dest: 2}, { cond=(AND p1 p0), acceptance={} source=0 dest: 3}, { cond=(AND p1 (NOT p3) p2 (NOT p0)), acceptance={} source=0 dest: 4}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p3) (NOT p2)), acceptance={0} source=2 dest: 2}, { cond=(OR p3 p2), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p3) p2), acceptance={0} source=2 dest: 4}], [{ cond=(NOT p0), acceptance={} source=3 dest: 2}, { cond=p0, acceptance={} source=3 dest: 3}, { cond=(AND (NOT p3) p2 (NOT p0)), acceptance={} source=3 dest: 4}], [{ cond=(AND (NOT p3) (NOT p2)), acceptance={0} source=4 dest: 2}, { cond=(AND (NOT p3) p2), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p1:(AND (NEQ s179 1) (NEQ s828 1)), p0:(AND (NEQ s179 1) (NEQ s828 1)), p3:(EQ s433 1), p2:(EQ s820 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null, null][true, true, true, true, true]]
Stuttering criterion allowed to conclude after 338 steps with 0 reset in 13 ms.
FORMULA Parking-PT-864-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Parking-PT-864-01 finished in 1869 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((p0 U G((X(p2)&&p1))))], workingDir=/home/mcc/execution]
Support contains 6 out of 1036 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 1036/1036 places, 939/939 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 1034 transition count 937
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 1034 transition count 937
Applied a total of 4 rules in 51 ms. Remains 1034 /1036 variables (removed 2) and now considering 937/939 (removed 2) transitions.
// Phase 1: matrix 937 rows 1034 cols
[2021-05-14 09:24:30] [INFO ] Computed 201 place invariants in 3 ms
[2021-05-14 09:24:30] [INFO ] Implicit Places using invariants in 378 ms returned [1030]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 379 ms to find 1 implicit places.
// Phase 1: matrix 937 rows 1033 cols
[2021-05-14 09:24:30] [INFO ] Computed 200 place invariants in 2 ms
[2021-05-14 09:24:31] [INFO ] Dead Transitions using invariants and state equation in 456 ms returned []
Starting structural reductions, iteration 1 : 1033/1036 places, 937/939 transitions.
Applied a total of 0 rules in 31 ms. Remains 1033 /1033 variables (removed 0) and now considering 937/937 (removed 0) transitions.
// Phase 1: matrix 937 rows 1033 cols
[2021-05-14 09:24:31] [INFO ] Computed 200 place invariants in 3 ms
[2021-05-14 09:24:31] [INFO ] Dead Transitions using invariants and state equation in 447 ms returned []
Finished structural reductions, in 2 iterations. Remains : 1033/1036 places, 937/939 transitions.
Stuttering acceptance computed with spot in 90 ms :[(OR (NOT p2) (NOT p1)), true, (OR (NOT p1) (NOT p2)), (NOT p2)]
Running random walk in product with property : Parking-PT-864-02 automaton TGBA [mat=[[{ cond=(AND (NOT p1) p0), acceptance={0} source=0 dest: 0}, { cond=(AND p1 p0), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(AND p1 (NOT p0)), acceptance={} source=0 dest: 2}, { cond=(AND p1 p0), acceptance={0} source=0 dest: 3}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(OR (NOT p1) (NOT p2)), acceptance={} source=2 dest: 1}, { cond=(AND p1 p2), acceptance={} source=2 dest: 2}], [{ cond=(AND (NOT p1) p0 (NOT p2)), acceptance={0} source=3 dest: 0}, { cond=(AND p1 p0 (NOT p2)), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={} source=3 dest: 1}, { cond=(AND p1 (NOT p0) (NOT p2)), acceptance={} source=3 dest: 2}, { cond=(AND p1 p0 (NOT p2)), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p1:(AND (NEQ s402 1) (EQ s229 0)), p0:(AND (EQ s600 1) (EQ s667 1)), p2:(AND (OR (NEQ s600 1) (NEQ s667 1)) (EQ s730 1) (EQ s802 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA Parking-PT-864-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Parking-PT-864-02 finished in 1472 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((X(p0)&&(F(p1)||G(p2))))], workingDir=/home/mcc/execution]
Support contains 4 out of 1036 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 1036/1036 places, 939/939 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 1034 transition count 937
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 1034 transition count 937
Applied a total of 4 rules in 40 ms. Remains 1034 /1036 variables (removed 2) and now considering 937/939 (removed 2) transitions.
// Phase 1: matrix 937 rows 1034 cols
[2021-05-14 09:24:31] [INFO ] Computed 201 place invariants in 7 ms
[2021-05-14 09:24:32] [INFO ] Implicit Places using invariants in 385 ms returned [1030]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 404 ms to find 1 implicit places.
// Phase 1: matrix 937 rows 1033 cols
[2021-05-14 09:24:32] [INFO ] Computed 200 place invariants in 2 ms
[2021-05-14 09:24:32] [INFO ] Dead Transitions using invariants and state equation in 453 ms returned []
Starting structural reductions, iteration 1 : 1033/1036 places, 937/939 transitions.
Applied a total of 0 rules in 22 ms. Remains 1033 /1033 variables (removed 0) and now considering 937/937 (removed 0) transitions.
// Phase 1: matrix 937 rows 1033 cols
[2021-05-14 09:24:32] [INFO ] Computed 200 place invariants in 3 ms
[2021-05-14 09:24:33] [INFO ] Dead Transitions using invariants and state equation in 433 ms returned []
Finished structural reductions, in 2 iterations. Remains : 1033/1036 places, 937/939 transitions.
Stuttering acceptance computed with spot in 549 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (NOT p1), (AND (NOT p1) (NOT p2)), true]
Running random walk in product with property : Parking-PT-864-04 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}, { cond=(AND (NOT p1) (NOT p2)), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p1) p2), acceptance={} source=0 dest: 3}], [{ cond=(NOT p0), acceptance={} source=1 dest: 4}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=3 dest: 2}, { cond=(AND (NOT p1) p2), acceptance={} source=3 dest: 3}], [{ cond=true, acceptance={0} source=4 dest: 4}]], initial=0, aps=[p1:(AND (EQ s839 1) (EQ s917 1)), p2:(EQ s995 1), p0:(NEQ s421 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Stuttering criterion allowed to conclude after 237 steps with 0 reset in 4 ms.
FORMULA Parking-PT-864-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Parking-PT-864-04 finished in 1917 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G((F(p0)&&F((p1||G(p2))))))], workingDir=/home/mcc/execution]
Support contains 3 out of 1036 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 1036/1036 places, 939/939 transitions.
Drop transitions removed 32 transitions
Trivial Post-agglo rules discarded 32 transitions
Performed 32 trivial Post agglomeration. Transition count delta: 32
Iterating post reduction 0 with 32 rules applied. Total rules applied 32 place count 1036 transition count 907
Reduce places removed 32 places and 0 transitions.
Iterating post reduction 1 with 32 rules applied. Total rules applied 64 place count 1004 transition count 907
Performed 32 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 32 Pre rules applied. Total rules applied 64 place count 1004 transition count 875
Deduced a syphon composed of 32 places in 0 ms
Reduce places removed 32 places and 0 transitions.
Iterating global reduction 2 with 64 rules applied. Total rules applied 128 place count 972 transition count 875
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 130 place count 970 transition count 873
Iterating global reduction 2 with 2 rules applied. Total rules applied 132 place count 970 transition count 873
Performed 47 Post agglomeration using F-continuation condition.Transition count delta: 47
Deduced a syphon composed of 47 places in 0 ms
Reduce places removed 47 places and 0 transitions.
Iterating global reduction 2 with 94 rules applied. Total rules applied 226 place count 923 transition count 826
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -7
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 228 place count 922 transition count 833
Applied a total of 228 rules in 131 ms. Remains 922 /1036 variables (removed 114) and now considering 833/939 (removed 106) transitions.
// Phase 1: matrix 833 rows 922 cols
[2021-05-14 09:24:33] [INFO ] Computed 201 place invariants in 3 ms
[2021-05-14 09:24:34] [INFO ] Implicit Places using invariants in 373 ms returned [919]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 374 ms to find 1 implicit places.
[2021-05-14 09:24:34] [INFO ] Redundant transitions in 6 ms returned []
// Phase 1: matrix 833 rows 921 cols
[2021-05-14 09:24:34] [INFO ] Computed 200 place invariants in 3 ms
[2021-05-14 09:24:34] [INFO ] Dead Transitions using invariants and state equation in 433 ms returned []
Starting structural reductions, iteration 1 : 921/1036 places, 833/939 transitions.
Applied a total of 0 rules in 36 ms. Remains 921 /921 variables (removed 0) and now considering 833/833 (removed 0) transitions.
[2021-05-14 09:24:34] [INFO ] Redundant transitions in 6 ms returned []
// Phase 1: matrix 833 rows 921 cols
[2021-05-14 09:24:34] [INFO ] Computed 200 place invariants in 3 ms
[2021-05-14 09:24:35] [INFO ] Dead Transitions using invariants and state equation in 389 ms returned []
Finished structural reductions, in 2 iterations. Remains : 921/1036 places, 833/939 transitions.
Stuttering acceptance computed with spot in 77 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : Parking-PT-864-05 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p1) (NOT p2)), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p1) p2), acceptance={} source=2 dest: 2}]], initial=0, aps=[p0:(OR (AND (EQ s338 1) (EQ s395 1)) (EQ s237 1)), p1:(AND (EQ s338 1) (EQ s395 1)), p2:(EQ s237 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 252 steps with 0 reset in 4 ms.
FORMULA Parking-PT-864-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Parking-PT-864-05 finished in 1478 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(X(G(p0))))], workingDir=/home/mcc/execution]
Support contains 2 out of 1036 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 1036/1036 places, 939/939 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 1035 transition count 938
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 1035 transition count 938
Applied a total of 2 rules in 52 ms. Remains 1035 /1036 variables (removed 1) and now considering 938/939 (removed 1) transitions.
// Phase 1: matrix 938 rows 1035 cols
[2021-05-14 09:24:35] [INFO ] Computed 201 place invariants in 2 ms
[2021-05-14 09:24:35] [INFO ] Implicit Places using invariants in 378 ms returned []
// Phase 1: matrix 938 rows 1035 cols
[2021-05-14 09:24:35] [INFO ] Computed 201 place invariants in 3 ms
[2021-05-14 09:24:36] [INFO ] State equation strengthened by 248 read => feed constraints.
[2021-05-14 09:24:37] [INFO ] Implicit Places using invariants and state equation in 2244 ms returned []
Implicit Place search using SMT with State Equation took 2623 ms to find 0 implicit places.
// Phase 1: matrix 938 rows 1035 cols
[2021-05-14 09:24:37] [INFO ] Computed 201 place invariants in 2 ms
[2021-05-14 09:24:38] [INFO ] Dead Transitions using invariants and state equation in 441 ms returned []
Finished structural reductions, in 1 iterations. Remains : 1035/1036 places, 938/939 transitions.
Stuttering acceptance computed with spot in 390 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : Parking-PT-864-06 automaton TGBA [mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}]], initial=3, aps=[p0:(OR (NEQ s993 1) (NEQ s1031 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][false, false, false, false]]
Product exploration explored 100000 steps with 390 reset in 995 ms.
Product exploration explored 100000 steps with 388 reset in 1052 ms.
Knowledge obtained : [p0]
Stuttering acceptance computed with spot in 90 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 389 reset in 927 ms.
Product exploration explored 100000 steps with 388 reset in 1045 ms.
Applying partial POR strategy [true, true, false, false]
Stuttering acceptance computed with spot in 73 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Support contains 2 out of 1035 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 1035/1035 places, 938/938 transitions.
Performed 32 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 32 rules applied. Total rules applied 32 place count 1035 transition count 938
Performed 32 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 32 Pre rules applied. Total rules applied 32 place count 1035 transition count 938
Deduced a syphon composed of 64 places in 0 ms
Iterating global reduction 1 with 32 rules applied. Total rules applied 64 place count 1035 transition count 938
Discarding 32 places :
Symmetric choice reduction at 1 with 32 rule applications. Total rules 96 place count 1003 transition count 906
Deduced a syphon composed of 32 places in 0 ms
Iterating global reduction 1 with 32 rules applied. Total rules applied 128 place count 1003 transition count 906
Performed 47 Post agglomeration using F-continuation condition.Transition count delta: -32
Deduced a syphon composed of 79 places in 1 ms
Iterating global reduction 1 with 47 rules applied. Total rules applied 175 place count 1003 transition count 938
Deduced a syphon composed of 79 places in 0 ms
Applied a total of 175 rules in 234 ms. Remains 1003 /1035 variables (removed 32) and now considering 938/938 (removed 0) transitions.
[2021-05-14 09:24:43] [INFO ] Redundant transitions in 7 ms returned []
// Phase 1: matrix 938 rows 1003 cols
[2021-05-14 09:24:43] [INFO ] Computed 201 place invariants in 3 ms
[2021-05-14 09:24:43] [INFO ] Dead Transitions using invariants and state equation in 482 ms returned []
Finished structural reductions, in 1 iterations. Remains : 1003/1035 places, 938/938 transitions.
Product exploration explored 100000 steps with 393 reset in 1005 ms.
Entered a terminal (fully accepting) state of product in 80636 steps with 317 reset in 805 ms.
FORMULA Parking-PT-864-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Parking-PT-864-06 finished in 10376 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(G(p0)))], workingDir=/home/mcc/execution]
Support contains 1 out of 1036 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 1036/1036 places, 939/939 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 1034 transition count 937
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 1034 transition count 937
Applied a total of 4 rules in 48 ms. Remains 1034 /1036 variables (removed 2) and now considering 937/939 (removed 2) transitions.
// Phase 1: matrix 937 rows 1034 cols
[2021-05-14 09:24:45] [INFO ] Computed 201 place invariants in 2 ms
[2021-05-14 09:24:46] [INFO ] Implicit Places using invariants in 384 ms returned [1030]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 385 ms to find 1 implicit places.
// Phase 1: matrix 937 rows 1033 cols
[2021-05-14 09:24:46] [INFO ] Computed 200 place invariants in 3 ms
[2021-05-14 09:24:46] [INFO ] Dead Transitions using invariants and state equation in 442 ms returned []
Starting structural reductions, iteration 1 : 1033/1036 places, 937/939 transitions.
Applied a total of 0 rules in 28 ms. Remains 1033 /1033 variables (removed 0) and now considering 937/937 (removed 0) transitions.
// Phase 1: matrix 937 rows 1033 cols
[2021-05-14 09:24:46] [INFO ] Computed 200 place invariants in 2 ms
[2021-05-14 09:24:47] [INFO ] Dead Transitions using invariants and state equation in 426 ms returned []
Finished structural reductions, in 2 iterations. Remains : 1033/1036 places, 937/939 transitions.
Stuttering acceptance computed with spot in 65 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : Parking-PT-864-08 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:(EQ s414 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 1 steps with 0 reset in 0 ms.
FORMULA Parking-PT-864-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Parking-PT-864-08 finished in 1405 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(F((G(p0)||(p0&&F(G(p1)))))))], workingDir=/home/mcc/execution]
Support contains 3 out of 1036 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 1036/1036 places, 939/939 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 1034 transition count 937
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 1034 transition count 937
Applied a total of 4 rules in 55 ms. Remains 1034 /1036 variables (removed 2) and now considering 937/939 (removed 2) transitions.
// Phase 1: matrix 937 rows 1034 cols
[2021-05-14 09:24:47] [INFO ] Computed 201 place invariants in 2 ms
[2021-05-14 09:24:47] [INFO ] Implicit Places using invariants in 385 ms returned [1030]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 389 ms to find 1 implicit places.
// Phase 1: matrix 937 rows 1033 cols
[2021-05-14 09:24:47] [INFO ] Computed 200 place invariants in 2 ms
[2021-05-14 09:24:47] [INFO ] Dead Transitions using invariants and state equation in 432 ms returned []
Starting structural reductions, iteration 1 : 1033/1036 places, 937/939 transitions.
Applied a total of 0 rules in 26 ms. Remains 1033 /1033 variables (removed 0) and now considering 937/937 (removed 0) transitions.
// Phase 1: matrix 937 rows 1033 cols
[2021-05-14 09:24:47] [INFO ] Computed 200 place invariants in 2 ms
[2021-05-14 09:24:48] [INFO ] Dead Transitions using invariants and state equation in 454 ms returned []
Finished structural reductions, in 2 iterations. Remains : 1033/1036 places, 937/939 transitions.
Stuttering acceptance computed with spot in 86 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (NOT p0), (NOT p0)]
Running random walk in product with property : Parking-PT-864-10 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}, { cond=(NOT p0), acceptance={} source=0 dest: 2}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0, 1} source=1 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={0} source=1 dest: 1}, { cond=(AND p1 (NOT p0)), acceptance={1} source=1 dest: 1}, { cond=(AND p1 p0), acceptance={} source=1 dest: 1}], [{ cond=(NOT p0), acceptance={0, 1} source=2 dest: 2}], [{ cond=true, acceptance={} source=3 dest: 0}]], initial=3, aps=[p0:(OR (NEQ s40 1) (NEQ s192 1) (NEQ s227 1)), p1:(EQ s40 0)], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 388 reset in 878 ms.
Product exploration explored 100000 steps with 391 reset in 1040 ms.
Knowledge obtained : [p0, p1]
Stuttering acceptance computed with spot in 96 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 389 reset in 858 ms.
Product exploration explored 100000 steps with 389 reset in 955 ms.
Applying partial POR strategy [true, true, true, false]
Stuttering acceptance computed with spot in 89 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (NOT p0), (NOT p0)]
Support contains 3 out of 1033 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 1033/1033 places, 937/937 transitions.
Performed 32 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 32 rules applied. Total rules applied 32 place count 1033 transition count 937
Performed 32 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 32 Pre rules applied. Total rules applied 32 place count 1033 transition count 937
Deduced a syphon composed of 64 places in 0 ms
Iterating global reduction 1 with 32 rules applied. Total rules applied 64 place count 1033 transition count 937
Discarding 32 places :
Symmetric choice reduction at 1 with 32 rule applications. Total rules 96 place count 1001 transition count 905
Deduced a syphon composed of 32 places in 0 ms
Iterating global reduction 1 with 32 rules applied. Total rules applied 128 place count 1001 transition count 905
Performed 47 Post agglomeration using F-continuation condition.Transition count delta: -32
Deduced a syphon composed of 79 places in 0 ms
Iterating global reduction 1 with 47 rules applied. Total rules applied 175 place count 1001 transition count 937
Deduced a syphon composed of 79 places in 0 ms
Applied a total of 175 rules in 108 ms. Remains 1001 /1033 variables (removed 32) and now considering 937/937 (removed 0) transitions.
[2021-05-14 09:24:52] [INFO ] Redundant transitions in 8 ms returned []
// Phase 1: matrix 937 rows 1001 cols
[2021-05-14 09:24:52] [INFO ] Computed 200 place invariants in 2 ms
[2021-05-14 09:24:53] [INFO ] Dead Transitions using invariants and state equation in 419 ms returned []
Finished structural reductions, in 1 iterations. Remains : 1001/1033 places, 937/937 transitions.
Product exploration explored 100000 steps with 395 reset in 936 ms.
Product exploration explored 100000 steps with 392 reset in 1002 ms.
[2021-05-14 09:24:55] [INFO ] Flatten gal took : 55 ms
[2021-05-14 09:24:55] [INFO ] Flatten gal took : 66 ms
[2021-05-14 09:24:55] [INFO ] Time to serialize gal into /tmp/LTL17911679020817686460.gal : 19 ms
[2021-05-14 09:24:55] [INFO ] Time to serialize properties into /tmp/LTL629068406314434276.ltl : 7 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/LTL17911679020817686460.gal, -t, CGAL, -LTL, /tmp/LTL629068406314434276.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/LTL17911679020817686460.gal -t CGAL -LTL /tmp/LTL629068406314434276.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((X(F((G("(((p40!=1)||(p206!=1))||(p246!=1))"))||((F(G("(p40==0)")))&&("(((p40!=1)||(p206!=1))||(p246!=1))"))))))
Formula 0 simplified : !XF(G"(((p40!=1)||(p206!=1))||(p246!=1))" | ("(((p40!=1)||(p206!=1))||(p246!=1))" & FG"(p40==0)"))
Detected timeout of ITS tools.
[2021-05-14 09:25:10] [INFO ] Flatten gal took : 44 ms
[2021-05-14 09:25:10] [INFO ] Applying decomposition
[2021-05-14 09:25:10] [INFO ] Flatten gal took : 38 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/graph237072288045219865.txt, -o, /tmp/graph237072288045219865.bin, -w, /tmp/graph237072288045219865.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/graph237072288045219865.bin, -l, -1, -v, -w, /tmp/graph237072288045219865.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-14 09:25:10] [INFO ] Decomposing Gal with order
[2021-05-14 09:25:10] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-14 09:25:10] [INFO ] Removed a total of 119 redundant transitions.
[2021-05-14 09:25:10] [INFO ] Flatten gal took : 96 ms
[2021-05-14 09:25:10] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 18 ms.
[2021-05-14 09:25:10] [INFO ] Time to serialize gal into /tmp/LTL8329741008926799036.gal : 13 ms
[2021-05-14 09:25:10] [INFO ] Time to serialize properties into /tmp/LTL4600302976421721074.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/LTL8329741008926799036.gal, -t, CGAL, -LTL, /tmp/LTL4600302976421721074.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/LTL8329741008926799036.gal -t CGAL -LTL /tmp/LTL4600302976421721074.ltl -c -stutter-deadlock
Read 1 LTL properties
Checking formula 0 : !((X(F((G("(((i5.u19.p40!=1)||(i0.u80.p206!=1))||(i0.u94.p246!=1))"))||((F(G("(i5.u19.p40==0)")))&&("(((i5.u19.p40!=1)||(i0.u80.p206!=1))||(i0.u94.p246!=1))"))))))
Formula 0 simplified : !XF(G"(((i5.u19.p40!=1)||(i0.u80.p206!=1))||(i0.u94.p246!=1))" | ("(((i5.u19.p40!=1)||(i0.u80.p206!=1))||(i0.u94.p246!=1))" & FG"(i5.u19.p40==0)"))
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin4974186297680834771
[2021-05-14 09:25:25] [INFO ] Built C files in 28ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4974186297680834771
Running compilation step : CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/include/, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/tmp/ltsmin4974186297680834771]
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/include/, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/tmp/ltsmin4974186297680834771] killed by timeout after 1 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/include/, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/tmp/ltsmin4974186297680834771] killed by timeout after 1 SECONDS
at fr.lip6.move.gal.application.LTSminRunner$1.run(LTSminRunner.java:79)
at java.base/java.lang.Thread.run(Thread.java:834)
Treatment of property Parking-PT-864-10 finished in 39807 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(X(F(p0))))], workingDir=/home/mcc/execution]
Support contains 2 out of 1036 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 1036/1036 places, 939/939 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 1034 transition count 937
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 1034 transition count 937
Applied a total of 4 rules in 60 ms. Remains 1034 /1036 variables (removed 2) and now considering 937/939 (removed 2) transitions.
// Phase 1: matrix 937 rows 1034 cols
[2021-05-14 09:25:26] [INFO ] Computed 201 place invariants in 2 ms
[2021-05-14 09:25:27] [INFO ] Implicit Places using invariants in 579 ms returned [1030]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 580 ms to find 1 implicit places.
// Phase 1: matrix 937 rows 1033 cols
[2021-05-14 09:25:27] [INFO ] Computed 200 place invariants in 3 ms
[2021-05-14 09:25:27] [INFO ] Dead Transitions using invariants and state equation in 433 ms returned []
Starting structural reductions, iteration 1 : 1033/1036 places, 937/939 transitions.
Applied a total of 0 rules in 25 ms. Remains 1033 /1033 variables (removed 0) and now considering 937/937 (removed 0) transitions.
// Phase 1: matrix 937 rows 1033 cols
[2021-05-14 09:25:28] [INFO ] Computed 200 place invariants in 10 ms
[2021-05-14 09:25:28] [INFO ] Dead Transitions using invariants and state equation in 443 ms returned []
Finished structural reductions, in 2 iterations. Remains : 1033/1036 places, 937/939 transitions.
Stuttering acceptance computed with spot in 82 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : Parking-PT-864-12 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 1}]], initial=2, aps=[p0:(AND (EQ s235 1) (EQ s317 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 222 steps with 0 reset in 2 ms.
FORMULA Parking-PT-864-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Parking-PT-864-12 finished in 1648 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G((p0&&(p1 U (p2||G(p1))))))], workingDir=/home/mcc/execution]
Support contains 3 out of 1036 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 1036/1036 places, 939/939 transitions.
Drop transitions removed 32 transitions
Trivial Post-agglo rules discarded 32 transitions
Performed 32 trivial Post agglomeration. Transition count delta: 32
Iterating post reduction 0 with 32 rules applied. Total rules applied 32 place count 1036 transition count 907
Reduce places removed 32 places and 0 transitions.
Iterating post reduction 1 with 32 rules applied. Total rules applied 64 place count 1004 transition count 907
Performed 32 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 32 Pre rules applied. Total rules applied 64 place count 1004 transition count 875
Deduced a syphon composed of 32 places in 1 ms
Reduce places removed 32 places and 0 transitions.
Iterating global reduction 2 with 64 rules applied. Total rules applied 128 place count 972 transition count 875
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 130 place count 970 transition count 873
Iterating global reduction 2 with 2 rules applied. Total rules applied 132 place count 970 transition count 873
Performed 46 Post agglomeration using F-continuation condition.Transition count delta: 46
Deduced a syphon composed of 46 places in 1 ms
Reduce places removed 46 places and 0 transitions.
Iterating global reduction 2 with 92 rules applied. Total rules applied 224 place count 924 transition count 827
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -7
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 226 place count 923 transition count 834
Applied a total of 226 rules in 134 ms. Remains 923 /1036 variables (removed 113) and now considering 834/939 (removed 105) transitions.
// Phase 1: matrix 834 rows 923 cols
[2021-05-14 09:25:28] [INFO ] Computed 201 place invariants in 2 ms
[2021-05-14 09:25:29] [INFO ] Implicit Places using invariants in 342 ms returned [920]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 343 ms to find 1 implicit places.
[2021-05-14 09:25:29] [INFO ] Redundant transitions in 6 ms returned []
// Phase 1: matrix 834 rows 922 cols
[2021-05-14 09:25:29] [INFO ] Computed 200 place invariants in 2 ms
[2021-05-14 09:25:29] [INFO ] Dead Transitions using invariants and state equation in 419 ms returned []
Starting structural reductions, iteration 1 : 922/1036 places, 834/939 transitions.
Applied a total of 0 rules in 28 ms. Remains 922 /922 variables (removed 0) and now considering 834/834 (removed 0) transitions.
[2021-05-14 09:25:29] [INFO ] Redundant transitions in 6 ms returned []
// Phase 1: matrix 834 rows 922 cols
[2021-05-14 09:25:29] [INFO ] Computed 200 place invariants in 2 ms
[2021-05-14 09:25:29] [INFO ] Dead Transitions using invariants and state equation in 389 ms returned []
Finished structural reductions, in 2 iterations. Remains : 922/1036 places, 834/939 transitions.
Stuttering acceptance computed with spot in 38 ms :[true, (OR (NOT p0) (AND (NOT p1) (NOT p2)))]
Running random walk in product with property : Parking-PT-864-13 automaton TGBA [mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(OR (NOT p0) (AND (NOT p2) (NOT p1))), acceptance={} source=1 dest: 0}, { cond=(OR (AND p0 p2) (AND p0 p1)), acceptance={} source=1 dest: 1}]], initial=1, aps=[p0:(OR (NEQ s116 1) (NEQ s644 1)), p2:(AND (NEQ s116 1) (NEQ s116 1) (NEQ s152 1)), p1:(AND (NEQ s116 1) (NEQ s152 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA Parking-PT-864-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Parking-PT-864-13 finished in 1411 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(((p0 U (F(p2)||p1)) U G(p3)))], workingDir=/home/mcc/execution]
Support contains 5 out of 1036 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 1036/1036 places, 939/939 transitions.
Drop transitions removed 32 transitions
Trivial Post-agglo rules discarded 32 transitions
Performed 32 trivial Post agglomeration. Transition count delta: 32
Iterating post reduction 0 with 32 rules applied. Total rules applied 32 place count 1036 transition count 907
Reduce places removed 32 places and 0 transitions.
Iterating post reduction 1 with 32 rules applied. Total rules applied 64 place count 1004 transition count 907
Performed 32 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 32 Pre rules applied. Total rules applied 64 place count 1004 transition count 875
Deduced a syphon composed of 32 places in 0 ms
Reduce places removed 32 places and 0 transitions.
Iterating global reduction 2 with 64 rules applied. Total rules applied 128 place count 972 transition count 875
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 130 place count 970 transition count 873
Iterating global reduction 2 with 2 rules applied. Total rules applied 132 place count 970 transition count 873
Performed 47 Post agglomeration using F-continuation condition.Transition count delta: 47
Deduced a syphon composed of 47 places in 0 ms
Reduce places removed 47 places and 0 transitions.
Iterating global reduction 2 with 94 rules applied. Total rules applied 226 place count 923 transition count 826
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -7
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 228 place count 922 transition count 833
Applied a total of 228 rules in 138 ms. Remains 922 /1036 variables (removed 114) and now considering 833/939 (removed 106) transitions.
// Phase 1: matrix 833 rows 922 cols
[2021-05-14 09:25:30] [INFO ] Computed 201 place invariants in 3 ms
[2021-05-14 09:25:30] [INFO ] Implicit Places using invariants in 372 ms returned [919]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 374 ms to find 1 implicit places.
[2021-05-14 09:25:30] [INFO ] Redundant transitions in 6 ms returned []
// Phase 1: matrix 833 rows 921 cols
[2021-05-14 09:25:30] [INFO ] Computed 200 place invariants in 2 ms
[2021-05-14 09:25:30] [INFO ] Dead Transitions using invariants and state equation in 441 ms returned []
Starting structural reductions, iteration 1 : 921/1036 places, 833/939 transitions.
Applied a total of 0 rules in 27 ms. Remains 921 /921 variables (removed 0) and now considering 833/833 (removed 0) transitions.
[2021-05-14 09:25:30] [INFO ] Redundant transitions in 6 ms returned []
// Phase 1: matrix 833 rows 921 cols
[2021-05-14 09:25:30] [INFO ] Computed 200 place invariants in 3 ms
[2021-05-14 09:25:31] [INFO ] Dead Transitions using invariants and state equation in 390 ms returned []
Finished structural reductions, in 2 iterations. Remains : 921/1036 places, 833/939 transitions.
Stuttering acceptance computed with spot in 129 ms :[(NOT p3), (NOT p2), (AND (NOT p1) (NOT p2)), (OR (AND p0 (NOT p2) (NOT p3)) (AND p1 (NOT p2) (NOT p3)))]
Running random walk in product with property : Parking-PT-864-14 automaton TGBA [mat=[[{ cond=(NOT p3), acceptance={0} source=0 dest: 0}, { cond=p3, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p3) (NOT p1) (NOT p2) (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p3) (NOT p1) (NOT p2) p0), acceptance={} source=0 dest: 2}, { cond=(AND p3 (NOT p1) (NOT p2) (NOT p0)), acceptance={} source=0 dest: 3}], [{ cond=(NOT p2), acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p1) (NOT p2) (NOT p0)), acceptance={} source=2 dest: 1}, { cond=(AND (NOT p1) (NOT p2) p0), acceptance={0} source=2 dest: 2}], [{ cond=(OR (AND (NOT p3) p1 (NOT p2)) (AND (NOT p3) (NOT p2) p0)), acceptance={} source=3 dest: 1}, { cond=(OR (AND p3 p1 (NOT p2)) (AND p3 (NOT p2) p0)), acceptance={} source=3 dest: 3}]], initial=0, aps=[p3:(AND (EQ s117 1) (EQ s204 1)), p1:(OR (EQ s117 0) (EQ s204 0)), p2:(NEQ s334 1), p0:(AND (EQ s640 1) (EQ s677 1) (EQ s117 1) (EQ s204 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null][true, true, true, true]]
Stuttering criterion allowed to conclude after 230 steps with 0 reset in 3 ms.
FORMULA Parking-PT-864-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Parking-PT-864-14 finished in 1536 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G(F(p0)))], workingDir=/home/mcc/execution]
Support contains 1 out of 1036 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 1036/1036 places, 939/939 transitions.
Drop transitions removed 32 transitions
Trivial Post-agglo rules discarded 32 transitions
Performed 32 trivial Post agglomeration. Transition count delta: 32
Iterating post reduction 0 with 32 rules applied. Total rules applied 32 place count 1036 transition count 907
Reduce places removed 32 places and 0 transitions.
Iterating post reduction 1 with 32 rules applied. Total rules applied 64 place count 1004 transition count 907
Performed 32 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 32 Pre rules applied. Total rules applied 64 place count 1004 transition count 875
Deduced a syphon composed of 32 places in 0 ms
Reduce places removed 32 places and 0 transitions.
Iterating global reduction 2 with 64 rules applied. Total rules applied 128 place count 972 transition count 875
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 130 place count 970 transition count 873
Iterating global reduction 2 with 2 rules applied. Total rules applied 132 place count 970 transition count 873
Performed 47 Post agglomeration using F-continuation condition.Transition count delta: 47
Deduced a syphon composed of 47 places in 1 ms
Reduce places removed 47 places and 0 transitions.
Iterating global reduction 2 with 94 rules applied. Total rules applied 226 place count 923 transition count 826
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -7
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 228 place count 922 transition count 833
Applied a total of 228 rules in 129 ms. Remains 922 /1036 variables (removed 114) and now considering 833/939 (removed 106) transitions.
// Phase 1: matrix 833 rows 922 cols
[2021-05-14 09:25:31] [INFO ] Computed 201 place invariants in 2 ms
[2021-05-14 09:25:31] [INFO ] Implicit Places using invariants in 363 ms returned [919]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 365 ms to find 1 implicit places.
[2021-05-14 09:25:31] [INFO ] Redundant transitions in 5 ms returned []
// Phase 1: matrix 833 rows 921 cols
[2021-05-14 09:25:31] [INFO ] Computed 200 place invariants in 2 ms
[2021-05-14 09:25:32] [INFO ] Dead Transitions using invariants and state equation in 404 ms returned []
Starting structural reductions, iteration 1 : 921/1036 places, 833/939 transitions.
Applied a total of 0 rules in 27 ms. Remains 921 /921 variables (removed 0) and now considering 833/833 (removed 0) transitions.
[2021-05-14 09:25:32] [INFO ] Redundant transitions in 6 ms returned []
// Phase 1: matrix 833 rows 921 cols
[2021-05-14 09:25:32] [INFO ] Computed 200 place invariants in 2 ms
[2021-05-14 09:25:32] [INFO ] Dead Transitions using invariants and state equation in 440 ms returned []
Finished structural reductions, in 2 iterations. Remains : 921/1036 places, 833/939 transitions.
Stuttering acceptance computed with spot in 48 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : Parking-PT-864-15 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(NEQ s821 0)], 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 232 steps with 0 reset in 2 ms.
FORMULA Parking-PT-864-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Parking-PT-864-15 finished in 1447 ms.
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin13063794049833544412
[2021-05-14 09:25:32] [INFO ] Computing symmetric may disable matrix : 939 transitions.
[2021-05-14 09:25:32] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2021-05-14 09:25:32] [INFO ] Computing symmetric may enable matrix : 939 transitions.
[2021-05-14 09:25:32] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2021-05-14 09:25:32] [INFO ] Applying decomposition
[2021-05-14 09:25:32] [INFO ] Flatten gal took : 40 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/graph16005871042474522054.txt, -o, /tmp/graph16005871042474522054.bin, -w, /tmp/graph16005871042474522054.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/graph16005871042474522054.bin, -l, -1, -v, -w, /tmp/graph16005871042474522054.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-14 09:25:33] [INFO ] Computing Do-Not-Accords matrix : 939 transitions.
[2021-05-14 09:25:33] [INFO ] Decomposing Gal with order
[2021-05-14 09:25:33] [INFO ] Computation of Completed DNA matrix. took 32 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2021-05-14 09:25:33] [INFO ] Built C files in 172ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13063794049833544412
Running compilation step : CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/include/, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/tmp/ltsmin13063794049833544412]
[2021-05-14 09:25:33] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-14 09:25:33] [INFO ] Removed a total of 116 redundant transitions.
[2021-05-14 09:25:33] [INFO ] Flatten gal took : 86 ms
[2021-05-14 09:25:33] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 16 ms.
[2021-05-14 09:25:33] [INFO ] Time to serialize gal into /tmp/LTLFireability2171361350944224878.gal : 9 ms
[2021-05-14 09:25:33] [INFO ] Time to serialize properties into /tmp/LTLFireability11039555047777576608.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/LTLFireability2171361350944224878.gal, -t, CGAL, -LTL, /tmp/LTLFireability11039555047777576608.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/LTLFireability2171361350944224878.gal -t CGAL -LTL /tmp/LTLFireability11039555047777576608.ltl -c -stutter-deadlock
Read 1 LTL properties
Checking formula 0 : !((X(F((!("(((i0.i0.i1.u19.p40==1)&&(i4.u80.p206==1))&&(i4.u95.p246==1))"))U(((!("(((i0.i0.i1.u19.p40==1)&&(i4.u80.p206==1))&&(i4.u95.p246==1))"))&&(F(G("(i0.i0.i1.u19.p40==0)"))))||(G(!("(((i0.i0.i1.u19.p40==1)&&(i4.u80.p206==1))&&(i4.u95.p246==1))"))))))))
Formula 0 simplified : !XF(!"(((i0.i0.i1.u19.p40==1)&&(i4.u80.p206==1))&&(i4.u95.p246==1))" U ((!"(((i0.i0.i1.u19.p40==1)&&(i4.u80.p206==1))&&(i4.u95.p246==1))" & FG"(i0.i0.i1.u19.p40==0)") | G!"(((i0.i0.i1.u19.p40==1)&&(i4.u80.p206==1))&&(i4.u95.p246==1))"))
Reverse transition relation is NOT exact ! Due to transitions i3.t1337, i3.t1334, i3.t1332, i3.t1331, i3.t1328, i3.t1325, i3.t1323, i3.t1320, i3.u330.t114, i3.u330.t116, i4.u95.t776, i5.u134.t666, i7.u173.t556, i9.u214.t446, i11.u253.t336, i12.u292.t226, i15.u371.t6, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0/922/17/939
Computing Next relation with stutter on 5.35201e+12 deadlock states
Compilation finished in 7404 ms.
Running link step : CommandLine [args=[gcc, -shared, -o, gal.so, model.o], workingDir=/tmp/ltsmin13063794049833544412]
Link finished in 73 ms.
Running LTSmin : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/pins2lts-mc-linux64, ./gal.so, --threads=8, --when, --ltl, X(<>(([]((LTLAPp0==true))||((LTLAPp0==true)&&<>([]((LTLAPp1==true))))))), --buchi-type=spotba], workingDir=/tmp/ltsmin13063794049833544412]
WARNING : LTSmin timed out (>327 s) on command CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/pins2lts-mc-linux64, ./gal.so, --threads=8, --when, --ltl, X(<>(([]((LTLAPp0==true))||((LTLAPp0==true)&&<>([]((LTLAPp1==true))))))), --buchi-type=spotba], workingDir=/tmp/ltsmin13063794049833544412]
Retrying LTSmin with larger timeout 2616 s
Running LTSmin : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/pins2lts-mc-linux64, ./gal.so, --threads=8, --when, --ltl, X(<>(([]((LTLAPp0==true))||((LTLAPp0==true)&&<>([]((LTLAPp1==true))))))), --buchi-type=spotba], workingDir=/tmp/ltsmin13063794049833544412]
Detected timeout of ITS tools.
[2021-05-14 09:46:12] [INFO ] Applying decomposition
[2021-05-14 09:46:12] [INFO ] Flatten gal took : 83 ms
[2021-05-14 09:46:12] [INFO ] Decomposing Gal with order
[2021-05-14 09:46:12] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-14 09:46:13] [INFO ] Removed a total of 262 redundant transitions.
[2021-05-14 09:46:13] [INFO ] Flatten gal took : 190 ms
[2021-05-14 09:46:13] [INFO ] Fuse similar labels procedure discarded/fused a total of 16 labels/synchronizations in 48 ms.
[2021-05-14 09:46:13] [INFO ] Time to serialize gal into /tmp/LTLFireability14635311775878670567.gal : 6 ms
[2021-05-14 09:46:13] [INFO ] Time to serialize properties into /tmp/LTLFireability423290325176014626.ltl : 2 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/LTLFireability14635311775878670567.gal, -t, CGAL, -LTL, /tmp/LTLFireability423290325176014626.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/LTLFireability14635311775878670567.gal -t CGAL -LTL /tmp/LTLFireability423290325176014626.ltl -c -stutter-deadlock
Read 1 LTL properties
Checking formula 0 : !((X(F((!("(((u20.p40==1)&&(u80.p206==1))&&(u83.p246==1))"))U(((!("(((u20.p40==1)&&(u80.p206==1))&&(u83.p246==1))"))&&(F(G("(u20.p40==0)"))))||(G(!("(((u20.p40==1)&&(u80.p206==1))&&(u83.p246==1))"))))))))
Formula 0 simplified : !XF(!"(((u20.p40==1)&&(u80.p206==1))&&(u83.p246==1))" U ((!"(((u20.p40==1)&&(u80.p206==1))&&(u83.p246==1))" & FG"(u20.p40==0)") | G!"(((u20.p40==1)&&(u80.p206==1))&&(u83.p246==1))"))
Reverse transition relation is NOT exact ! Due to transitions t1320, t1323, t1325, t1328, t1331, t1332, t1334, t1337, u83.t776, u110.t666, u137.t556, u164.t446, u191.t336, u218.t226, u245.t114, u245.t116, u272.t6, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0/914/17/931
Computing Next relation with stutter on 5.35201e+12 deadlock states
Detected timeout of ITS tools.
[2021-05-14 10:06:52] [INFO ] Flatten gal took : 64 ms
[2021-05-14 10:06:52] [INFO ] Input system was already deterministic with 939 transitions.
[2021-05-14 10:06:52] [INFO ] Transformed 1036 places.
[2021-05-14 10:06:52] [INFO ] Transformed 939 transitions.
Running greatSPN : CommandLine [args=[/home/mcc/BenchKit/bin//..//greatspn//bin/pinvar, /home/mcc/execution/gspn], workingDir=/home/mcc/execution]
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Running greatSPN : CommandLine [args=[/home/mcc/BenchKit/bin//..//greatspn//bin/RGMEDD2, /home/mcc/execution/gspn, -META, -varord-only], workingDir=/home/mcc/execution]
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2021-05-14 10:07:04] [INFO ] Time to serialize gal into /tmp/LTLFireability17488169664918863726.gal : 4 ms
[2021-05-14 10:07:04] [INFO ] Time to serialize properties into /tmp/LTLFireability6929624371331132322.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/LTLFireability17488169664918863726.gal, -t, CGAL, -LTL, /tmp/LTLFireability6929624371331132322.ltl, -c, -stutter-deadlock, --load-order, /home/mcc/execution/model.ord, --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/LTLFireability17488169664918863726.gal -t CGAL -LTL /tmp/LTLFireability6929624371331132322.ltl -c -stutter-deadlock --load-order /home/mcc/execution/model.ord --gen-order FOLLOW
Read 1 LTL properties
Successfully loaded order from file /home/mcc/execution/model.ord
Checking formula 0 : !((X(F((!("(((p40==1)&&(p206==1))&&(p246==1))"))U(((!("(((p40==1)&&(p206==1))&&(p246==1))"))&&(F(G("(p40==0)"))))||(G(!("(((p40==1)&&(p206==1))&&(p246==1))"))))))))
Formula 0 simplified : !XF(!"(((p40==1)&&(p206==1))&&(p246==1))" U ((!"(((p40==1)&&(p206==1))&&(p246==1))" & FG"(p40==0)") | G!"(((p40==1)&&(p206==1))&&(p246==1))"))
WARNING : LTSmin timed out (>2616 s) on command CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/pins2lts-mc-linux64, ./gal.so, --threads=8, --when, --ltl, X(<>(([]((LTLAPp0==true))||((LTLAPp0==true)&&<>([]((LTLAPp1==true))))))), --buchi-type=spotba], workingDir=/tmp/ltsmin13063794049833544412]

BK_TIME_CONFINEMENT_REACHED

--------------------
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-864"
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-864, 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-162089127900453"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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