Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 248K
-rw-r--r-- 1 mcc users 5.2K Apr 30 05:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 51K Apr 30 05:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.4K Apr 30 05:51 CTLFireability.txt
-rw-r--r-- 1 mcc users 38K Apr 30 05:51 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:34 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K May 10 09:34 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.7K May 9 08:23 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K May 9 08:23 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K May 9 08:23 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K May 9 08:23 LTLFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 9 08:23 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K May 9 08:23 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 10 09:34 equiv_col
-rw-r--r-- 1 mcc users 4 May 10 09:34 instance
-rw-r--r-- 1 mcc users 6 May 10 09:34 iscolored
-rw-r--r-- 1 mcc users 49K May 10 09:34 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-208-LTLFireability-00
FORMULA_NAME Parking-PT-208-LTLFireability-01
FORMULA_NAME Parking-PT-208-LTLFireability-02
FORMULA_NAME Parking-PT-208-LTLFireability-03
FORMULA_NAME Parking-PT-208-LTLFireability-04
FORMULA_NAME Parking-PT-208-LTLFireability-05
FORMULA_NAME Parking-PT-208-LTLFireability-06
FORMULA_NAME Parking-PT-208-LTLFireability-07
FORMULA_NAME Parking-PT-208-LTLFireability-08
FORMULA_NAME Parking-PT-208-LTLFireability-09
FORMULA_NAME Parking-PT-208-LTLFireability-10
FORMULA_NAME Parking-PT-208-LTLFireability-11
FORMULA_NAME Parking-PT-208-LTLFireability-12
FORMULA_NAME Parking-PT-208-LTLFireability-13
FORMULA_NAME Parking-PT-208-LTLFireability-14
FORMULA_NAME Parking-PT-208-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1653051399826

Running Version 202205111006
[2022-05-20 12:56:42] [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]
[2022-05-20 12:56:42] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-20 12:56:42] [INFO ] Load time of PNML (sax parser for PT used): 176 ms
[2022-05-20 12:56:42] [INFO ] Transformed 137 places.
[2022-05-20 12:56:42] [INFO ] Transformed 201 transitions.
[2022-05-20 12:56:42] [INFO ] Found NUPN structural information;
[2022-05-20 12:56:42] [INFO ] Parsed PT model containing 137 places and 201 transitions in 428 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 22 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 5 formulas.
Ensure Unique test removed 84 transitions
Reduce redundant transitions removed 84 transitions.
FORMULA Parking-PT-208-LTLFireability-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Parking-PT-208-LTLFireability-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Parking-PT-208-LTLFireability-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Parking-PT-208-LTLFireability-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Parking-PT-208-LTLFireability-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 29 out of 137 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 137/137 places, 117/117 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 136 transition count 116
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 136 transition count 116
Applied a total of 2 rules in 49 ms. Remains 136 /137 variables (removed 1) and now considering 116/117 (removed 1) transitions.
// Phase 1: matrix 116 rows 136 cols
[2022-05-20 12:56:43] [INFO ] Computed 34 place invariants in 17 ms
[2022-05-20 12:56:43] [INFO ] Implicit Places using invariants in 452 ms returned [28, 36, 44, 64, 94, 102, 110, 118, 130]
Discarding 9 places :
Implicit Place search using SMT only with invariants took 529 ms to find 9 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 127/137 places, 116/117 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 122 transition count 111
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 122 transition count 111
Applied a total of 10 rules in 21 ms. Remains 122 /127 variables (removed 5) and now considering 111/116 (removed 5) transitions.
// Phase 1: matrix 111 rows 122 cols
[2022-05-20 12:56:43] [INFO ] Computed 25 place invariants in 4 ms
[2022-05-20 12:56:43] [INFO ] Implicit Places using invariants in 170 ms returned []
// Phase 1: matrix 111 rows 122 cols
[2022-05-20 12:56:43] [INFO ] Computed 25 place invariants in 17 ms
[2022-05-20 12:56:44] [INFO ] State equation strengthened by 26 read => feed constraints.
[2022-05-20 12:56:44] [INFO ] Implicit Places using invariants and state equation in 368 ms returned []
Implicit Place search using SMT with State Equation took 540 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 122/137 places, 111/117 transitions.
Finished structural reductions, in 2 iterations. Remains : 122/137 places, 111/117 transitions.
Support contains 29 out of 122 places after structural reductions.
[2022-05-20 12:56:44] [INFO ] Flatten gal took : 77 ms
[2022-05-20 12:56:44] [INFO ] Flatten gal took : 34 ms
[2022-05-20 12:56:44] [INFO ] Input system was already deterministic with 111 transitions.
Support contains 28 out of 122 places (down from 29) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 288 resets, run finished after 877 ms. (steps per millisecond=11 ) properties (out of 21) seen :16
Incomplete Best-First random walk after 10001 steps, including 25 resets, run finished after 82 ms. (steps per millisecond=121 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 24 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 5) seen :1
Incomplete Best-First random walk after 10001 steps, including 26 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 26 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 26 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 4) seen :0
Running SMT prover for 4 properties.
// Phase 1: matrix 111 rows 122 cols
[2022-05-20 12:56:46] [INFO ] Computed 25 place invariants in 2 ms
[2022-05-20 12:56:46] [INFO ] [Real]Absence check using 25 positive place invariants in 9 ms returned sat
[2022-05-20 12:56:46] [INFO ] After 218ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2022-05-20 12:56:46] [INFO ] [Nat]Absence check using 25 positive place invariants in 13 ms returned sat
[2022-05-20 12:56:46] [INFO ] After 154ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2022-05-20 12:56:46] [INFO ] State equation strengthened by 26 read => feed constraints.
[2022-05-20 12:56:46] [INFO ] After 67ms SMT Verify possible using 26 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2022-05-20 12:56:46] [INFO ] After 194ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 84 ms.
[2022-05-20 12:56:46] [INFO ] After 548ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Parikh walk visited 3 properties in 15 ms.
Support contains 2 out of 122 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 122/122 places, 111/111 transitions.
Drop transitions removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 122 transition count 107
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 8 place count 118 transition count 107
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 8 place count 118 transition count 103
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 16 place count 114 transition count 103
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 18 place count 112 transition count 101
Iterating global reduction 2 with 2 rules applied. Total rules applied 20 place count 112 transition count 101
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 32 place count 106 transition count 95
Free-agglomeration rule applied 20 times.
Iterating global reduction 2 with 20 rules applied. Total rules applied 52 place count 106 transition count 75
Reduce places removed 20 places and 0 transitions.
Graph (complete) has 165 edges and 86 vertex of which 44 are kept as prefixes of interest. Removing 42 places using SCC suffix rule.3 ms
Discarding 42 places :
Also discarding 35 output transitions
Drop transitions removed 35 transitions
Iterating post reduction 2 with 21 rules applied. Total rules applied 73 place count 44 transition count 40
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 75 place count 44 transition count 38
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 76 place count 43 transition count 37
Reduce places removed 11 places and 0 transitions.
Drop transitions removed 18 transitions
Trivial Post-agglo rules discarded 18 transitions
Performed 18 trivial Post agglomeration. Transition count delta: 18
Iterating post reduction 4 with 29 rules applied. Total rules applied 105 place count 32 transition count 19
Reduce places removed 18 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 5 with 24 rules applied. Total rules applied 129 place count 14 transition count 13
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 6 with 4 rules applied. Total rules applied 133 place count 10 transition count 13
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 2 Pre rules applied. Total rules applied 133 place count 10 transition count 11
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 7 with 4 rules applied. Total rules applied 137 place count 8 transition count 11
Discarding 3 places :
Symmetric choice reduction at 7 with 3 rule applications. Total rules 140 place count 5 transition count 8
Iterating global reduction 7 with 3 rules applied. Total rules applied 143 place count 5 transition count 8
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 7 with 3 rules applied. Total rules applied 146 place count 5 transition count 5
Applied a total of 146 rules in 58 ms. Remains 5 /122 variables (removed 117) and now considering 5/111 (removed 106) transitions.
Finished structural reductions, in 1 iterations. Remains : 5/122 places, 5/111 transitions.
Finished random walk after 2 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=1 )
Computed a total of 1 stabilizing places and 1 stable transitions
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 2 out of 122 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 122/122 places, 111/111 transitions.
Drop transitions removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 122 transition count 107
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 8 place count 118 transition count 107
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 8 place count 118 transition count 103
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 16 place count 114 transition count 103
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 19 place count 111 transition count 100
Iterating global reduction 2 with 3 rules applied. Total rules applied 22 place count 111 transition count 100
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 32 place count 106 transition count 95
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 34 place count 105 transition count 98
Applied a total of 34 rules in 32 ms. Remains 105 /122 variables (removed 17) and now considering 98/111 (removed 13) transitions.
// Phase 1: matrix 98 rows 105 cols
[2022-05-20 12:56:47] [INFO ] Computed 25 place invariants in 2 ms
[2022-05-20 12:56:47] [INFO ] Implicit Places using invariants in 139 ms returned [41, 53, 102]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 140 ms to find 3 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 102/122 places, 98/111 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 101 transition count 97
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 101 transition count 97
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
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 4 place count 100 transition count 96
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 99 transition count 111
Applied a total of 6 rules in 29 ms. Remains 99 /102 variables (removed 3) and now considering 111/98 (removed -13) transitions.
// Phase 1: matrix 111 rows 99 cols
[2022-05-20 12:56:47] [INFO ] Computed 22 place invariants in 2 ms
[2022-05-20 12:56:47] [INFO ] Implicit Places using invariants in 134 ms returned []
// Phase 1: matrix 111 rows 99 cols
[2022-05-20 12:56:47] [INFO ] Computed 22 place invariants in 8 ms
[2022-05-20 12:56:47] [INFO ] State equation strengthened by 52 read => feed constraints.
[2022-05-20 12:56:47] [INFO ] Implicit Places using invariants and state equation in 275 ms returned []
Implicit Place search using SMT with State Equation took 413 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 99/122 places, 111/111 transitions.
Finished structural reductions, in 2 iterations. Remains : 99/122 places, 111/111 transitions.
Stuttering acceptance computed with spot in 343 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : Parking-PT-208-LTLFireability-02 automaton TGBA Formula[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:(OR (NEQ s33 1) (NEQ s52 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]]
Product exploration explored 100000 steps with 3061 reset in 854 ms.
Product exploration explored 100000 steps with 3068 reset in 406 ms.
Computed a total of 1 stabilizing places and 5 stable transitions
Computed a total of 1 stabilizing places and 5 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 109 ms. Reduced automaton from 2 states, 3 edges and 1 AP to 2 states, 3 edges and 1 AP.
Stuttering acceptance computed with spot in 67 ms :[(NOT p0), (NOT p0)]
Finished random walk after 455 steps, including 13 resets, run visited all 1 properties in 4 ms. (steps per millisecond=113 )
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 137 ms. Reduced automaton from 2 states, 3 edges and 1 AP to 2 states, 3 edges and 1 AP.
Stuttering acceptance computed with spot in 73 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 94 ms :[(NOT p0), (NOT p0)]
Support contains 2 out of 99 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 99/99 places, 111/111 transitions.
Applied a total of 0 rules in 10 ms. Remains 99 /99 variables (removed 0) and now considering 111/111 (removed 0) transitions.
// Phase 1: matrix 111 rows 99 cols
[2022-05-20 12:56:49] [INFO ] Computed 22 place invariants in 2 ms
[2022-05-20 12:56:50] [INFO ] Implicit Places using invariants in 141 ms returned []
// Phase 1: matrix 111 rows 99 cols
[2022-05-20 12:56:50] [INFO ] Computed 22 place invariants in 2 ms
[2022-05-20 12:56:50] [INFO ] State equation strengthened by 52 read => feed constraints.
[2022-05-20 12:56:50] [INFO ] Implicit Places using invariants and state equation in 247 ms returned []
Implicit Place search using SMT with State Equation took 391 ms to find 0 implicit places.
[2022-05-20 12:56:50] [INFO ] Redundant transitions in 4 ms returned []
// Phase 1: matrix 111 rows 99 cols
[2022-05-20 12:56:50] [INFO ] Computed 22 place invariants in 2 ms
[2022-05-20 12:56:50] [INFO ] Dead Transitions using invariants and state equation in 140 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 99/99 places, 111/111 transitions.
Computed a total of 1 stabilizing places and 5 stable transitions
Computed a total of 1 stabilizing places and 5 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 160 ms. Reduced automaton from 2 states, 3 edges and 1 AP to 2 states, 3 edges and 1 AP.
Stuttering acceptance computed with spot in 94 ms :[(NOT p0), (NOT p0)]
Finished random walk after 527 steps, including 16 resets, run visited all 1 properties in 3 ms. (steps per millisecond=175 )
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 136 ms. Reduced automaton from 2 states, 3 edges and 1 AP to 2 states, 3 edges and 1 AP.
Stuttering acceptance computed with spot in 64 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 64 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 62 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 3071 reset in 199 ms.
Product exploration explored 100000 steps with 3083 reset in 619 ms.
Built C files in :
/tmp/ltsmin13745317946399382079
[2022-05-20 12:56:51] [INFO ] Computing symmetric may disable matrix : 111 transitions.
[2022-05-20 12:56:51] [INFO ] Computation of Complete disable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-20 12:56:51] [INFO ] Computing symmetric may enable matrix : 111 transitions.
[2022-05-20 12:56:51] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-20 12:56:52] [INFO ] Computing Do-Not-Accords matrix : 111 transitions.
[2022-05-20 12:56:52] [INFO ] Computation of Completed DNA matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-20 12:56:52] [INFO ] Built C files in 40ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13745317946399382079
Running compilation step : cd /tmp/ltsmin13745317946399382079;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 543 ms.
Running link step : cd /tmp/ltsmin13745317946399382079;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 64 ms.
Running LTSmin : cd /tmp/ltsmin13745317946399382079;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased5736023503249366971.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 2 out of 99 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 99/99 places, 111/111 transitions.
Applied a total of 0 rules in 7 ms. Remains 99 /99 variables (removed 0) and now considering 111/111 (removed 0) transitions.
// Phase 1: matrix 111 rows 99 cols
[2022-05-20 12:57:07] [INFO ] Computed 22 place invariants in 5 ms
[2022-05-20 12:57:07] [INFO ] Implicit Places using invariants in 123 ms returned []
// Phase 1: matrix 111 rows 99 cols
[2022-05-20 12:57:07] [INFO ] Computed 22 place invariants in 8 ms
[2022-05-20 12:57:07] [INFO ] State equation strengthened by 52 read => feed constraints.
[2022-05-20 12:57:07] [INFO ] Implicit Places using invariants and state equation in 204 ms returned []
Implicit Place search using SMT with State Equation took 335 ms to find 0 implicit places.
[2022-05-20 12:57:07] [INFO ] Redundant transitions in 5 ms returned []
// Phase 1: matrix 111 rows 99 cols
[2022-05-20 12:57:07] [INFO ] Computed 22 place invariants in 1 ms
[2022-05-20 12:57:07] [INFO ] Dead Transitions using invariants and state equation in 131 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 99/99 places, 111/111 transitions.
Built C files in :
/tmp/ltsmin11554822071359864540
[2022-05-20 12:57:07] [INFO ] Computing symmetric may disable matrix : 111 transitions.
[2022-05-20 12:57:07] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-20 12:57:07] [INFO ] Computing symmetric may enable matrix : 111 transitions.
[2022-05-20 12:57:07] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-20 12:57:07] [INFO ] Computing Do-Not-Accords matrix : 111 transitions.
[2022-05-20 12:57:07] [INFO ] Computation of Completed DNA matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-20 12:57:07] [INFO ] Built C files in 27ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11554822071359864540
Running compilation step : cd /tmp/ltsmin11554822071359864540;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 489 ms.
Running link step : cd /tmp/ltsmin11554822071359864540;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 40 ms.
Running LTSmin : cd /tmp/ltsmin11554822071359864540;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased7654405154287825556.hoa' '--buchi-type=spotba'
LTSmin run took 8020 ms.
FORMULA Parking-PT-208-LTLFireability-02 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property Parking-PT-208-LTLFireability-02 finished in 29010 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((F(X(G(p0)))&&(X(p1)||F(p2))))'
Support contains 4 out of 122 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 122/122 places, 111/111 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 119 transition count 108
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 119 transition count 108
Applied a total of 6 rules in 4 ms. Remains 119 /122 variables (removed 3) and now considering 108/111 (removed 3) transitions.
// Phase 1: matrix 108 rows 119 cols
[2022-05-20 12:57:16] [INFO ] Computed 25 place invariants in 1 ms
[2022-05-20 12:57:16] [INFO ] Implicit Places using invariants in 89 ms returned [47, 59, 115]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 90 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 116/122 places, 108/111 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 115 transition count 107
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 115 transition count 107
Applied a total of 2 rules in 5 ms. Remains 115 /116 variables (removed 1) and now considering 107/108 (removed 1) transitions.
// Phase 1: matrix 107 rows 115 cols
[2022-05-20 12:57:16] [INFO ] Computed 22 place invariants in 1 ms
[2022-05-20 12:57:16] [INFO ] Implicit Places using invariants in 113 ms returned []
// Phase 1: matrix 107 rows 115 cols
[2022-05-20 12:57:16] [INFO ] Computed 22 place invariants in 3 ms
[2022-05-20 12:57:16] [INFO ] State equation strengthened by 26 read => feed constraints.
[2022-05-20 12:57:16] [INFO ] Implicit Places using invariants and state equation in 259 ms returned []
Implicit Place search using SMT with State Equation took 374 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 115/122 places, 107/111 transitions.
Finished structural reductions, in 2 iterations. Remains : 115/122 places, 107/111 transitions.
Stuttering acceptance computed with spot in 250 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (AND (NOT p2) (NOT p1)), (NOT p2)]
Running random walk in product with property : Parking-PT-208-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}, { cond=(NOT p2), acceptance={} source=0 dest: 2}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=2 dest: 3}], [{ cond=(NOT p2), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p2:(EQ s97 0), p0:(AND (EQ s71 1) (EQ s104 1)), p1:(EQ s59 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Stuttering criterion allowed to conclude after 35 steps with 0 reset in 0 ms.
FORMULA Parking-PT-208-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Parking-PT-208-LTLFireability-03 finished in 745 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F(p0))))'
Support contains 2 out of 122 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 122/122 places, 111/111 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 119 transition count 108
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 119 transition count 108
Applied a total of 6 rules in 14 ms. Remains 119 /122 variables (removed 3) and now considering 108/111 (removed 3) transitions.
// Phase 1: matrix 108 rows 119 cols
[2022-05-20 12:57:16] [INFO ] Computed 25 place invariants in 1 ms
[2022-05-20 12:57:17] [INFO ] Implicit Places using invariants in 90 ms returned [47, 59, 115]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 91 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 116/122 places, 108/111 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 115 transition count 107
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 115 transition count 107
Applied a total of 2 rules in 4 ms. Remains 115 /116 variables (removed 1) and now considering 107/108 (removed 1) transitions.
// Phase 1: matrix 107 rows 115 cols
[2022-05-20 12:57:17] [INFO ] Computed 22 place invariants in 3 ms
[2022-05-20 12:57:17] [INFO ] Implicit Places using invariants in 86 ms returned []
// Phase 1: matrix 107 rows 115 cols
[2022-05-20 12:57:17] [INFO ] Computed 22 place invariants in 4 ms
[2022-05-20 12:57:17] [INFO ] State equation strengthened by 26 read => feed constraints.
[2022-05-20 12:57:17] [INFO ] Implicit Places using invariants and state equation in 150 ms returned []
Implicit Place search using SMT with State Equation took 240 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 115/122 places, 107/111 transitions.
Finished structural reductions, in 2 iterations. Remains : 115/122 places, 107/111 transitions.
Stuttering acceptance computed with spot in 116 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : Parking-PT-208-LTLFireability-06 automaton TGBA Formula[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 s70 1) (EQ s94 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Stuttering criterion allowed to conclude after 40 steps with 0 reset in 1 ms.
FORMULA Parking-PT-208-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Parking-PT-208-LTLFireability-06 finished in 483 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((G((F(p0) U !F((p1 U p2)))) U p1))'
Support contains 5 out of 122 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 122/122 places, 111/111 transitions.
Drop transitions removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 122 transition count 107
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 8 place count 118 transition count 107
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 8 place count 118 transition count 103
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 16 place count 114 transition count 103
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 19 place count 111 transition count 100
Iterating global reduction 2 with 3 rules applied. Total rules applied 22 place count 111 transition count 100
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 30 place count 107 transition count 96
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 32 place count 106 transition count 99
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 33 place count 106 transition count 99
Applied a total of 33 rules in 37 ms. Remains 106 /122 variables (removed 16) and now considering 99/111 (removed 12) transitions.
// Phase 1: matrix 99 rows 106 cols
[2022-05-20 12:57:17] [INFO ] Computed 25 place invariants in 1 ms
[2022-05-20 12:57:17] [INFO ] Implicit Places using invariants in 158 ms returned [42, 54, 102]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 159 ms to find 3 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 103/122 places, 99/111 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 102 transition count 98
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 102 transition count 98
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 101 transition count 97
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 100 transition count 112
Applied a total of 6 rules in 42 ms. Remains 100 /103 variables (removed 3) and now considering 112/99 (removed -13) transitions.
// Phase 1: matrix 112 rows 100 cols
[2022-05-20 12:57:17] [INFO ] Computed 22 place invariants in 1 ms
[2022-05-20 12:57:17] [INFO ] Implicit Places using invariants in 107 ms returned []
// Phase 1: matrix 112 rows 100 cols
[2022-05-20 12:57:17] [INFO ] Computed 22 place invariants in 2 ms
[2022-05-20 12:57:17] [INFO ] State equation strengthened by 52 read => feed constraints.
[2022-05-20 12:57:18] [INFO ] Implicit Places using invariants and state equation in 276 ms returned []
Implicit Place search using SMT with State Equation took 387 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 100/122 places, 112/111 transitions.
Finished structural reductions, in 2 iterations. Remains : 100/122 places, 112/111 transitions.
Stuttering acceptance computed with spot in 155 ms :[(NOT p1), (NOT p0), p2]
Running random walk in product with property : Parking-PT-208-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p1) p2 (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=(AND p2 (NOT p0)), acceptance={} source=2 dest: 1}, { cond=(NOT p2), acceptance={} source=2 dest: 2}, { cond=p2, acceptance={0} source=2 dest: 2}]], initial=0, aps=[p1:(AND (EQ s66 1) (EQ s83 1)), p2:(EQ s99 1), p0:(AND (EQ s6 1) (EQ s21 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 34 steps with 0 reset in 0 ms.
FORMULA Parking-PT-208-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Parking-PT-208-LTLFireability-07 finished in 812 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(((F(p0)||X(G(p1)))&&((p2 U p3)||p1))))'
Support contains 6 out of 122 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 122/122 places, 111/111 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 119 transition count 108
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 119 transition count 108
Applied a total of 6 rules in 6 ms. Remains 119 /122 variables (removed 3) and now considering 108/111 (removed 3) transitions.
// Phase 1: matrix 108 rows 119 cols
[2022-05-20 12:57:18] [INFO ] Computed 25 place invariants in 1 ms
[2022-05-20 12:57:18] [INFO ] Implicit Places using invariants in 159 ms returned [59, 115]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 160 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 117/122 places, 108/111 transitions.
Applied a total of 0 rules in 6 ms. Remains 117 /117 variables (removed 0) and now considering 108/108 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 117/122 places, 108/111 transitions.
Stuttering acceptance computed with spot in 324 ms :[(OR (AND (NOT p1) (NOT p3)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p1) (NOT p3)) (AND (NOT p0) (NOT p1))), true, (NOT p3), (AND (NOT p0) (NOT p1)), (NOT p0)]
Running random walk in product with property : Parking-PT-208-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p1) (NOT p3) (NOT p2)), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p1) (NOT p3) p2), acceptance={} source=1 dest: 3}, { cond=(OR (AND (NOT p0) p1) (AND (NOT p0) p3) (AND (NOT p0) p2)), acceptance={} source=1 dest: 4}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(AND (NOT p3) (NOT p2)), acceptance={0} source=3 dest: 2}, { cond=(AND (NOT p3) p2), acceptance={0} source=3 dest: 3}], [{ cond=(AND (NOT p0) p1), acceptance={} source=4 dest: 4}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=4 dest: 5}], [{ cond=(NOT p0), acceptance={0} source=5 dest: 5}]], initial=0, aps=[p1:(EQ s43 1), p3:(AND (EQ s15 1) (EQ s39 1)), p2:(EQ s6 1), p0:(AND (EQ s47 1) (EQ s58 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 6 steps with 0 reset in 1 ms.
FORMULA Parking-PT-208-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Parking-PT-208-LTLFireability-08 finished in 531 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 1 out of 122 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 122/122 places, 111/111 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 121 transition count 106
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 8 place count 117 transition count 106
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 8 place count 117 transition count 102
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 16 place count 113 transition count 102
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 19 place count 110 transition count 99
Iterating global reduction 2 with 3 rules applied. Total rules applied 22 place count 110 transition count 99
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 32 place count 105 transition count 94
Applied a total of 32 rules in 24 ms. Remains 105 /122 variables (removed 17) and now considering 94/111 (removed 17) transitions.
// Phase 1: matrix 94 rows 105 cols
[2022-05-20 12:57:18] [INFO ] Computed 25 place invariants in 1 ms
[2022-05-20 12:57:18] [INFO ] Implicit Places using invariants in 148 ms returned [40, 52, 102]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 151 ms to find 3 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 102/122 places, 94/111 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 101 transition count 93
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 101 transition count 93
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 6 place count 99 transition count 91
Applied a total of 6 rules in 16 ms. Remains 99 /102 variables (removed 3) and now considering 91/94 (removed 3) transitions.
// Phase 1: matrix 91 rows 99 cols
[2022-05-20 12:57:18] [INFO ] Computed 22 place invariants in 1 ms
[2022-05-20 12:57:19] [INFO ] Implicit Places using invariants in 140 ms returned []
// Phase 1: matrix 91 rows 99 cols
[2022-05-20 12:57:19] [INFO ] Computed 22 place invariants in 0 ms
[2022-05-20 12:57:19] [INFO ] Implicit Places using invariants and state equation in 170 ms returned []
Implicit Place search using SMT with State Equation took 312 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 99/122 places, 91/111 transitions.
Finished structural reductions, in 2 iterations. Remains : 99/122 places, 91/111 transitions.
Stuttering acceptance computed with spot in 46 ms :[(NOT p0)]
Running random walk in product with property : Parking-PT-208-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(NEQ s69 1)], 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 3065 reset in 342 ms.
Product exploration explored 100000 steps with 3056 reset in 444 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 140 ms. Reduced automaton from 1 states, 2 edges and 1 AP to 1 states, 2 edges and 1 AP.
Stuttering acceptance computed with spot in 46 ms :[(NOT p0)]
Finished random walk after 1010 steps, including 30 resets, run visited all 1 properties in 5 ms. (steps per millisecond=202 )
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 156 ms. Reduced automaton from 1 states, 2 edges and 1 AP to 1 states, 2 edges and 1 AP.
Stuttering acceptance computed with spot in 40 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 39 ms :[(NOT p0)]
Support contains 1 out of 99 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 99/99 places, 91/91 transitions.
Applied a total of 0 rules in 5 ms. Remains 99 /99 variables (removed 0) and now considering 91/91 (removed 0) transitions.
// Phase 1: matrix 91 rows 99 cols
[2022-05-20 12:57:20] [INFO ] Computed 22 place invariants in 1 ms
[2022-05-20 12:57:20] [INFO ] Implicit Places using invariants in 102 ms returned []
// Phase 1: matrix 91 rows 99 cols
[2022-05-20 12:57:20] [INFO ] Computed 22 place invariants in 1 ms
[2022-05-20 12:57:20] [INFO ] Implicit Places using invariants and state equation in 199 ms returned []
Implicit Place search using SMT with State Equation took 303 ms to find 0 implicit places.
[2022-05-20 12:57:20] [INFO ] Redundant transitions in 3 ms returned []
// Phase 1: matrix 91 rows 99 cols
[2022-05-20 12:57:20] [INFO ] Computed 22 place invariants in 1 ms
[2022-05-20 12:57:21] [INFO ] Dead Transitions using invariants and state equation in 148 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 99/99 places, 91/91 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 147 ms. Reduced automaton from 1 states, 2 edges and 1 AP to 1 states, 2 edges and 1 AP.
Stuttering acceptance computed with spot in 45 ms :[(NOT p0)]
Finished random walk after 213 steps, including 6 resets, run visited all 1 properties in 2 ms. (steps per millisecond=106 )
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 170 ms. Reduced automaton from 1 states, 2 edges and 1 AP to 1 states, 2 edges and 1 AP.
Stuttering acceptance computed with spot in 45 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 45 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 44 ms :[(NOT p0)]
Product exploration explored 100000 steps with 3060 reset in 294 ms.
Product exploration explored 100000 steps with 3067 reset in 342 ms.
Built C files in :
/tmp/ltsmin1288174334197447590
[2022-05-20 12:57:22] [INFO ] Computing symmetric may disable matrix : 91 transitions.
[2022-05-20 12:57:22] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-20 12:57:22] [INFO ] Computing symmetric may enable matrix : 91 transitions.
[2022-05-20 12:57:22] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-20 12:57:22] [INFO ] Computing Do-Not-Accords matrix : 91 transitions.
[2022-05-20 12:57:22] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-20 12:57:22] [INFO ] Built C files in 14ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1288174334197447590
Running compilation step : cd /tmp/ltsmin1288174334197447590;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 291 ms.
Running link step : cd /tmp/ltsmin1288174334197447590;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 25 ms.
Running LTSmin : cd /tmp/ltsmin1288174334197447590;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased12102918114539869438.hoa' '--buchi-type=spotba'
LTSmin run took 2286 ms.
FORMULA Parking-PT-208-LTLFireability-09 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property Parking-PT-208-LTLFireability-09 finished in 6111 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 1 out of 122 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 122/122 places, 111/111 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 121 transition count 107
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 6 place count 118 transition count 107
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 6 place count 118 transition count 104
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 12 place count 115 transition count 104
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 15 place count 112 transition count 101
Iterating global reduction 2 with 3 rules applied. Total rules applied 18 place count 112 transition count 101
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 30 place count 106 transition count 95
Applied a total of 30 rules in 10 ms. Remains 106 /122 variables (removed 16) and now considering 95/111 (removed 16) transitions.
// Phase 1: matrix 95 rows 106 cols
[2022-05-20 12:57:24] [INFO ] Computed 25 place invariants in 1 ms
[2022-05-20 12:57:24] [INFO ] Implicit Places using invariants in 85 ms returned [42, 54, 103]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 86 ms to find 3 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 103/122 places, 95/111 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 102 transition count 94
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 102 transition count 94
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 6 place count 100 transition count 92
Applied a total of 6 rules in 6 ms. Remains 100 /103 variables (removed 3) and now considering 92/95 (removed 3) transitions.
// Phase 1: matrix 92 rows 100 cols
[2022-05-20 12:57:24] [INFO ] Computed 22 place invariants in 0 ms
[2022-05-20 12:57:25] [INFO ] Implicit Places using invariants in 81 ms returned []
// Phase 1: matrix 92 rows 100 cols
[2022-05-20 12:57:25] [INFO ] Computed 22 place invariants in 0 ms
[2022-05-20 12:57:25] [INFO ] Implicit Places using invariants and state equation in 130 ms returned []
Implicit Place search using SMT with State Equation took 214 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 100/122 places, 92/111 transitions.
Finished structural reductions, in 2 iterations. Remains : 100/122 places, 92/111 transitions.
Stuttering acceptance computed with spot in 31 ms :[(NOT p0)]
Running random walk in product with property : Parking-PT-208-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(EQ s32 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 30 steps with 0 reset in 0 ms.
FORMULA Parking-PT-208-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Parking-PT-208-LTLFireability-11 finished in 358 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(G(X(X(F(X(p0))))))))'
Support contains 1 out of 122 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 122/122 places, 111/111 transitions.
Drop transitions removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 122 transition count 107
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 8 place count 118 transition count 107
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 8 place count 118 transition count 103
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 16 place count 114 transition count 103
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 19 place count 111 transition count 100
Iterating global reduction 2 with 3 rules applied. Total rules applied 22 place count 111 transition count 100
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 34 place count 105 transition count 94
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 36 place count 104 transition count 97
Applied a total of 36 rules in 11 ms. Remains 104 /122 variables (removed 18) and now considering 97/111 (removed 14) transitions.
// Phase 1: matrix 97 rows 104 cols
[2022-05-20 12:57:25] [INFO ] Computed 25 place invariants in 1 ms
[2022-05-20 12:57:25] [INFO ] Implicit Places using invariants in 88 ms returned [41, 53, 101]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 89 ms to find 3 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 101/122 places, 97/111 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 100 transition count 96
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 100 transition count 96
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 99 transition count 95
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 98 transition count 110
Applied a total of 6 rules in 11 ms. Remains 98 /101 variables (removed 3) and now considering 110/97 (removed -13) transitions.
// Phase 1: matrix 110 rows 98 cols
[2022-05-20 12:57:25] [INFO ] Computed 22 place invariants in 1 ms
[2022-05-20 12:57:25] [INFO ] Implicit Places using invariants in 141 ms returned []
// Phase 1: matrix 110 rows 98 cols
[2022-05-20 12:57:25] [INFO ] Computed 22 place invariants in 1 ms
[2022-05-20 12:57:25] [INFO ] State equation strengthened by 58 read => feed constraints.
[2022-05-20 12:57:25] [INFO ] Implicit Places using invariants and state equation in 275 ms returned []
Implicit Place search using SMT with State Equation took 418 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 98/122 places, 110/111 transitions.
Finished structural reductions, in 2 iterations. Remains : 98/122 places, 110/111 transitions.
Stuttering acceptance computed with spot in 96 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : Parking-PT-208-LTLFireability-12 automaton TGBA Formula[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:(EQ s53 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 102 steps with 4 reset in 1 ms.
FORMULA Parking-PT-208-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Parking-PT-208-LTLFireability-12 finished in 638 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(X(G((p0 U !X((G(p1)||p1)))))))'
Support contains 3 out of 122 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 122/122 places, 111/111 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 120 transition count 109
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 120 transition count 109
Applied a total of 4 rules in 7 ms. Remains 120 /122 variables (removed 2) and now considering 109/111 (removed 2) transitions.
// Phase 1: matrix 109 rows 120 cols
[2022-05-20 12:57:25] [INFO ] Computed 25 place invariants in 2 ms
[2022-05-20 12:57:26] [INFO ] Implicit Places using invariants in 171 ms returned [48, 116]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 173 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 118/122 places, 109/111 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 117 transition count 108
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 117 transition count 108
Applied a total of 2 rules in 3 ms. Remains 117 /118 variables (removed 1) and now considering 108/109 (removed 1) transitions.
// Phase 1: matrix 108 rows 117 cols
[2022-05-20 12:57:26] [INFO ] Computed 23 place invariants in 1 ms
[2022-05-20 12:57:26] [INFO ] Implicit Places using invariants in 146 ms returned []
// Phase 1: matrix 108 rows 117 cols
[2022-05-20 12:57:26] [INFO ] Computed 23 place invariants in 2 ms
[2022-05-20 12:57:26] [INFO ] State equation strengthened by 26 read => feed constraints.
[2022-05-20 12:57:26] [INFO ] Implicit Places using invariants and state equation in 256 ms returned []
Implicit Place search using SMT with State Equation took 404 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 117/122 places, 108/111 transitions.
Finished structural reductions, in 2 iterations. Remains : 117/122 places, 108/111 transitions.
Stuttering acceptance computed with spot in 148 ms :[p1, p1, p1]
Running random walk in product with property : Parking-PT-208-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 1}, { cond=p0, acceptance={0} source=0 dest: 2}], [{ cond=p1, acceptance={} source=1 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={0} source=1 dest: 1}, { cond=(AND p0 p1), acceptance={0} source=1 dest: 2}], [{ cond=(AND (NOT p0) p1), acceptance={0} source=2 dest: 1}, { cond=(AND p0 p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(EQ s94 1), p1:(AND (EQ s34 1) (EQ s58 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 33399 reset in 652 ms.
Product exploration explored 100000 steps with 33285 reset in 428 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT (AND p0 p1))), (X (NOT (AND (NOT p0) p1))), (X (NOT p1)), true, (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 422 ms. Reduced automaton from 3 states, 8 edges and 2 AP to 3 states, 8 edges and 2 AP.
Stuttering acceptance computed with spot in 147 ms :[p1, p1, p1]
Incomplete random walk after 10000 steps, including 292 resets, run finished after 262 ms. (steps per millisecond=38 ) properties (out of 4) seen :1
Incomplete Best-First random walk after 10001 steps, including 26 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 26 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 26 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
// Phase 1: matrix 108 rows 117 cols
[2022-05-20 12:57:28] [INFO ] Computed 23 place invariants in 1 ms
[2022-05-20 12:57:28] [INFO ] [Real]Absence check using 23 positive place invariants in 13 ms returned sat
[2022-05-20 12:57:28] [INFO ] After 104ms SMT Verify possible using state equation in real domain returned unsat :0 sat :2 real:1
[2022-05-20 12:57:28] [INFO ] State equation strengthened by 26 read => feed constraints.
[2022-05-20 12:57:28] [INFO ] After 36ms SMT Verify possible using 26 Read/Feed constraints in real domain returned unsat :0 sat :2 real:1
[2022-05-20 12:57:28] [INFO ] After 75ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :2 real:1
Attempting to minimize the solution found.
Minimization took 26 ms.
[2022-05-20 12:57:28] [INFO ] After 301ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :1 real:2
[2022-05-20 12:57:29] [INFO ] [Nat]Absence check using 23 positive place invariants in 11 ms returned sat
[2022-05-20 12:57:29] [INFO ] After 105ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2022-05-20 12:57:29] [INFO ] After 51ms SMT Verify possible using 26 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2022-05-20 12:57:29] [INFO ] After 111ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 39 ms.
[2022-05-20 12:57:29] [INFO ] After 346ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Finished Parikh walk after 41 steps, including 1 resets, run visited all 3 properties in 1 ms. (steps per millisecond=41 )
Parikh walk visited 3 properties in 1 ms.
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT (AND p0 p1))), (X (NOT (AND (NOT p0) p1))), (X (NOT p1)), true, (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : [(F (AND p0 p1)), (F p0), (F (AND (NOT p0) p1)), (F p1)]
Knowledge based reduction with 9 factoid took 507 ms. Reduced automaton from 3 states, 8 edges and 2 AP to 3 states, 8 edges and 2 AP.
Stuttering acceptance computed with spot in 104 ms :[p1, p1, p1]
Stuttering acceptance computed with spot in 103 ms :[p1, p1, p1]
Support contains 3 out of 117 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 117/117 places, 108/108 transitions.
Applied a total of 0 rules in 1 ms. Remains 117 /117 variables (removed 0) and now considering 108/108 (removed 0) transitions.
// Phase 1: matrix 108 rows 117 cols
[2022-05-20 12:57:30] [INFO ] Computed 23 place invariants in 0 ms
[2022-05-20 12:57:30] [INFO ] Implicit Places using invariants in 83 ms returned []
// Phase 1: matrix 108 rows 117 cols
[2022-05-20 12:57:30] [INFO ] Computed 23 place invariants in 0 ms
[2022-05-20 12:57:30] [INFO ] State equation strengthened by 26 read => feed constraints.
[2022-05-20 12:57:30] [INFO ] Implicit Places using invariants and state equation in 153 ms returned []
Implicit Place search using SMT with State Equation took 237 ms to find 0 implicit places.
// Phase 1: matrix 108 rows 117 cols
[2022-05-20 12:57:30] [INFO ] Computed 23 place invariants in 0 ms
[2022-05-20 12:57:30] [INFO ] Dead Transitions using invariants and state equation in 114 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 117/117 places, 108/108 transitions.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT (AND p0 p1))), (X (NOT (AND (NOT p0) p1))), (X (NOT p1)), true, (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 512 ms. Reduced automaton from 3 states, 8 edges and 2 AP to 3 states, 8 edges and 2 AP.
Stuttering acceptance computed with spot in 161 ms :[p1, p1, p1]
Incomplete random walk after 10000 steps, including 293 resets, run finished after 296 ms. (steps per millisecond=33 ) properties (out of 4) seen :1
Incomplete Best-First random walk after 10001 steps, including 25 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 27 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 25 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
// Phase 1: matrix 108 rows 117 cols
[2022-05-20 12:57:31] [INFO ] Computed 23 place invariants in 1 ms
[2022-05-20 12:57:31] [INFO ] [Real]Absence check using 23 positive place invariants in 6 ms returned sat
[2022-05-20 12:57:31] [INFO ] After 58ms SMT Verify possible using state equation in real domain returned unsat :0 sat :2 real:1
[2022-05-20 12:57:31] [INFO ] State equation strengthened by 26 read => feed constraints.
[2022-05-20 12:57:31] [INFO ] After 21ms SMT Verify possible using 26 Read/Feed constraints in real domain returned unsat :0 sat :2 real:1
[2022-05-20 12:57:31] [INFO ] After 46ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :2 real:1
Attempting to minimize the solution found.
Minimization took 15 ms.
[2022-05-20 12:57:31] [INFO ] After 176ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :1 real:2
[2022-05-20 12:57:31] [INFO ] [Nat]Absence check using 23 positive place invariants in 8 ms returned sat
[2022-05-20 12:57:31] [INFO ] After 71ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2022-05-20 12:57:31] [INFO ] After 38ms SMT Verify possible using 26 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2022-05-20 12:57:31] [INFO ] After 80ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 26 ms.
[2022-05-20 12:57:31] [INFO ] After 243ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Finished Parikh walk after 21 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=21 )
Parikh walk visited 3 properties in 1 ms.
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT (AND p0 p1))), (X (NOT (AND (NOT p0) p1))), (X (NOT p1)), true, (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : [(F (AND p0 p1)), (F p0), (F (AND (NOT p0) p1)), (F p1)]
Knowledge based reduction with 9 factoid took 435 ms. Reduced automaton from 3 states, 8 edges and 2 AP to 3 states, 8 edges and 2 AP.
Stuttering acceptance computed with spot in 106 ms :[p1, p1, p1]
Stuttering acceptance computed with spot in 106 ms :[p1, p1, p1]
Stuttering acceptance computed with spot in 108 ms :[p1, p1, p1]
Product exploration explored 100000 steps with 33349 reset in 518 ms.
Product exploration explored 100000 steps with 33309 reset in 465 ms.
Built C files in :
/tmp/ltsmin13334238882463311866
[2022-05-20 12:57:33] [INFO ] Built C files in 7ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13334238882463311866
Running compilation step : cd /tmp/ltsmin13334238882463311866;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 420 ms.
Running link step : cd /tmp/ltsmin13334238882463311866;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 42 ms.
Running LTSmin : cd /tmp/ltsmin13334238882463311866;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased15037254134616298226.hoa' '--buchi-type=spotba'
LTSmin run took 9360 ms.
FORMULA Parking-PT-208-LTLFireability-13 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property Parking-PT-208-LTLFireability-13 finished in 17884 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((X((G(p0)||p1))&&(X(p2) U !(X(p4)&&p3))))'
Support contains 9 out of 122 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 122/122 places, 111/111 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 120 transition count 109
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 120 transition count 109
Applied a total of 4 rules in 2 ms. Remains 120 /122 variables (removed 2) and now considering 109/111 (removed 2) transitions.
// Phase 1: matrix 109 rows 120 cols
[2022-05-20 12:57:43] [INFO ] Computed 25 place invariants in 1 ms
[2022-05-20 12:57:43] [INFO ] Implicit Places using invariants in 110 ms returned [47, 59]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 114 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 118/122 places, 109/111 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 117 transition count 108
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 117 transition count 108
Applied a total of 2 rules in 4 ms. Remains 117 /118 variables (removed 1) and now considering 108/109 (removed 1) transitions.
// Phase 1: matrix 108 rows 117 cols
[2022-05-20 12:57:43] [INFO ] Computed 23 place invariants in 1 ms
[2022-05-20 12:57:44] [INFO ] Implicit Places using invariants in 134 ms returned []
// Phase 1: matrix 108 rows 117 cols
[2022-05-20 12:57:44] [INFO ] Computed 23 place invariants in 1 ms
[2022-05-20 12:57:44] [INFO ] State equation strengthened by 26 read => feed constraints.
[2022-05-20 12:57:44] [INFO ] Implicit Places using invariants and state equation in 245 ms returned []
Implicit Place search using SMT with State Equation took 381 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 117/122 places, 108/111 transitions.
Finished structural reductions, in 2 iterations. Remains : 117/122 places, 108/111 transitions.
Stuttering acceptance computed with spot in 257 ms :[(OR (AND (NOT p0) (NOT p1)) (AND p3 p4)), (AND (NOT p0) (NOT p1)), (OR (AND (NOT p2) p4) (AND p3 p4)), true, (NOT p0)]
Running random walk in product with property : Parking-PT-208-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}, { cond=p3, acceptance={} source=0 dest: 2}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=1 dest: 3}, { cond=(AND (NOT p1) p0), acceptance={} source=1 dest: 4}], [{ cond=(AND p3 p2 p4), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p2) p4), acceptance={0} source=2 dest: 3}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=(NOT p0), acceptance={} source=4 dest: 3}, { cond=p0, acceptance={} source=4 dest: 4}]], initial=0, aps=[p3:(AND (EQ s99 1) (EQ s116 1)), p1:(AND (EQ s71 1) (EQ s105 1)), p0:(OR (EQ s101 0) (EQ s113 0)), p2:(EQ s85 1), p4:(AND (EQ s70 1) (EQ s94 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 2897 reset in 330 ms.
Product exploration explored 100000 steps with 2912 reset in 369 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND (NOT p3) (NOT p1) p0 (NOT p2) (NOT p4)), (X (AND (NOT p1) p0)), (X (NOT (AND (NOT p2) p4))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND p3 p2 p4))), true, (X (X (NOT (AND (NOT p2) p4)))), (X (X p0)), (X (X (NOT (AND p3 p2 p4))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 9 factoid took 514 ms. Reduced automaton from 5 states, 9 edges and 5 AP to 3 states, 4 edges and 1 AP.
Stuttering acceptance computed with spot in 104 ms :[true, (NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 292 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 26 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1534479 steps, run timeout after 3001 ms. (steps per millisecond=511 ) properties seen :{}
Probabilistic random walk after 1534479 steps, saw 193568 distinct states, run finished after 3007 ms. (steps per millisecond=510 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 108 rows 117 cols
[2022-05-20 12:57:48] [INFO ] Computed 23 place invariants in 1 ms
[2022-05-20 12:57:48] [INFO ] After 32ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-20 12:57:48] [INFO ] [Nat]Absence check using 23 positive place invariants in 8 ms returned sat
[2022-05-20 12:57:49] [INFO ] After 53ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-20 12:57:49] [INFO ] State equation strengthened by 26 read => feed constraints.
[2022-05-20 12:57:49] [INFO ] After 12ms SMT Verify possible using 26 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-05-20 12:57:49] [INFO ] After 24ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 7 ms.
[2022-05-20 12:57:49] [INFO ] After 131ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 0 ms.
Support contains 2 out of 117 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 117/117 places, 108/108 transitions.
Drop transitions removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 117 transition count 104
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 8 place count 113 transition count 104
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 8 place count 113 transition count 100
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 16 place count 109 transition count 100
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
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 30 place count 102 transition count 93
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -19
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 32 place count 101 transition count 112
Free-agglomeration rule applied 20 times.
Iterating global reduction 2 with 20 rules applied. Total rules applied 52 place count 101 transition count 92
Reduce places removed 20 places and 0 transitions.
Graph (complete) has 195 edges and 81 vertex of which 44 are kept as prefixes of interest. Removing 37 places using SCC suffix rule.0 ms
Discarding 37 places :
Also discarding 44 output transitions
Drop transitions removed 44 transitions
Iterating post reduction 2 with 21 rules applied. Total rules applied 73 place count 44 transition count 48
Drop transitions removed 6 transitions
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 3 with 10 rules applied. Total rules applied 83 place count 44 transition count 38
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 84 place count 43 transition count 37
Reduce places removed 11 places and 0 transitions.
Drop transitions removed 18 transitions
Trivial Post-agglo rules discarded 18 transitions
Performed 18 trivial Post agglomeration. Transition count delta: 18
Iterating post reduction 4 with 29 rules applied. Total rules applied 113 place count 32 transition count 19
Reduce places removed 18 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 5 with 24 rules applied. Total rules applied 137 place count 14 transition count 13
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 6 with 4 rules applied. Total rules applied 141 place count 10 transition count 13
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 2 Pre rules applied. Total rules applied 141 place count 10 transition count 11
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 7 with 4 rules applied. Total rules applied 145 place count 8 transition count 11
Discarding 3 places :
Symmetric choice reduction at 7 with 3 rule applications. Total rules 148 place count 5 transition count 8
Iterating global reduction 7 with 3 rules applied. Total rules applied 151 place count 5 transition count 8
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 7 with 3 rules applied. Total rules applied 154 place count 5 transition count 5
Applied a total of 154 rules in 20 ms. Remains 5 /117 variables (removed 112) and now considering 5/108 (removed 103) transitions.
Finished structural reductions, in 1 iterations. Remains : 5/117 places, 5/108 transitions.
Finished random walk after 6 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=6 )
Knowledge obtained : [(AND (NOT p3) (NOT p1) p0 (NOT p2) (NOT p4)), (X (AND (NOT p1) p0)), (X (NOT (AND (NOT p2) p4))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND p3 p2 p4))), true, (X (X (NOT (AND (NOT p2) p4)))), (X (X p0)), (X (X (NOT (AND p3 p2 p4))))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 9 factoid took 396 ms. Reduced automaton from 3 states, 4 edges and 1 AP to 3 states, 4 edges and 1 AP.
Stuttering acceptance computed with spot in 109 ms :[true, (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 109 ms :[true, (NOT p0), (NOT p0)]
Support contains 2 out of 117 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 117/117 places, 108/108 transitions.
Applied a total of 0 rules in 1 ms. Remains 117 /117 variables (removed 0) and now considering 108/108 (removed 0) transitions.
// Phase 1: matrix 108 rows 117 cols
[2022-05-20 12:57:49] [INFO ] Computed 23 place invariants in 1 ms
[2022-05-20 12:57:49] [INFO ] Implicit Places using invariants in 122 ms returned []
// Phase 1: matrix 108 rows 117 cols
[2022-05-20 12:57:49] [INFO ] Computed 23 place invariants in 1 ms
[2022-05-20 12:57:50] [INFO ] State equation strengthened by 26 read => feed constraints.
[2022-05-20 12:57:50] [INFO ] Implicit Places using invariants and state equation in 242 ms returned []
Implicit Place search using SMT with State Equation took 367 ms to find 0 implicit places.
// Phase 1: matrix 108 rows 117 cols
[2022-05-20 12:57:50] [INFO ] Computed 23 place invariants in 1 ms
[2022-05-20 12:57:50] [INFO ] Dead Transitions using invariants and state equation in 151 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 117/117 places, 108/108 transitions.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [p0, (X p0), true, (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 206 ms. Reduced automaton from 3 states, 4 edges and 1 AP to 3 states, 4 edges and 1 AP.
Stuttering acceptance computed with spot in 114 ms :[true, (NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 289 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 26 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1790674 steps, run timeout after 3001 ms. (steps per millisecond=596 ) properties seen :{}
Probabilistic random walk after 1790674 steps, saw 225597 distinct states, run finished after 3001 ms. (steps per millisecond=596 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 108 rows 117 cols
[2022-05-20 12:57:53] [INFO ] Computed 23 place invariants in 0 ms
[2022-05-20 12:57:53] [INFO ] After 30ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-20 12:57:53] [INFO ] [Nat]Absence check using 23 positive place invariants in 8 ms returned sat
[2022-05-20 12:57:53] [INFO ] After 54ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-20 12:57:53] [INFO ] State equation strengthened by 26 read => feed constraints.
[2022-05-20 12:57:53] [INFO ] After 11ms SMT Verify possible using 26 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-05-20 12:57:53] [INFO ] After 24ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 9 ms.
[2022-05-20 12:57:53] [INFO ] After 135ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 0 ms.
Support contains 2 out of 117 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 117/117 places, 108/108 transitions.
Drop transitions removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 117 transition count 104
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 8 place count 113 transition count 104
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 8 place count 113 transition count 100
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 16 place count 109 transition count 100
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
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 30 place count 102 transition count 93
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -19
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 32 place count 101 transition count 112
Free-agglomeration rule applied 20 times.
Iterating global reduction 2 with 20 rules applied. Total rules applied 52 place count 101 transition count 92
Reduce places removed 20 places and 0 transitions.
Graph (complete) has 195 edges and 81 vertex of which 44 are kept as prefixes of interest. Removing 37 places using SCC suffix rule.0 ms
Discarding 37 places :
Also discarding 44 output transitions
Drop transitions removed 44 transitions
Iterating post reduction 2 with 21 rules applied. Total rules applied 73 place count 44 transition count 48
Drop transitions removed 6 transitions
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 3 with 10 rules applied. Total rules applied 83 place count 44 transition count 38
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 84 place count 43 transition count 37
Reduce places removed 11 places and 0 transitions.
Drop transitions removed 18 transitions
Trivial Post-agglo rules discarded 18 transitions
Performed 18 trivial Post agglomeration. Transition count delta: 18
Iterating post reduction 4 with 29 rules applied. Total rules applied 113 place count 32 transition count 19
Reduce places removed 18 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 5 with 24 rules applied. Total rules applied 137 place count 14 transition count 13
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 6 with 4 rules applied. Total rules applied 141 place count 10 transition count 13
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 2 Pre rules applied. Total rules applied 141 place count 10 transition count 11
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 7 with 4 rules applied. Total rules applied 145 place count 8 transition count 11
Discarding 3 places :
Symmetric choice reduction at 7 with 3 rule applications. Total rules 148 place count 5 transition count 8
Iterating global reduction 7 with 3 rules applied. Total rules applied 151 place count 5 transition count 8
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 7 with 3 rules applied. Total rules applied 154 place count 5 transition count 5
Applied a total of 154 rules in 14 ms. Remains 5 /117 variables (removed 112) and now considering 5/108 (removed 103) transitions.
Finished structural reductions, in 1 iterations. Remains : 5/117 places, 5/108 transitions.
Finished random walk after 6 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=6 )
Knowledge obtained : [p0, (X p0), true, (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 4 factoid took 221 ms. Reduced automaton from 3 states, 4 edges and 1 AP to 3 states, 4 edges and 1 AP.
Stuttering acceptance computed with spot in 109 ms :[true, (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 109 ms :[true, (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 109 ms :[true, (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 2918 reset in 318 ms.
Product exploration explored 100000 steps with 2899 reset in 361 ms.
Applying partial POR strategy [true, false, true]
Stuttering acceptance computed with spot in 111 ms :[true, (NOT p0), (NOT p0)]
Support contains 2 out of 117 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 117/117 places, 108/108 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 117 transition count 108
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 4 Pre rules applied. Total rules applied 4 place count 117 transition count 108
Deduced a syphon composed of 8 places in 0 ms
Iterating global reduction 1 with 4 rules applied. Total rules applied 8 place count 117 transition count 108
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 12 place count 113 transition count 104
Deduced a syphon composed of 4 places in 0 ms
Iterating global reduction 1 with 4 rules applied. Total rules applied 16 place count 113 transition count 104
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: -4
Deduced a syphon composed of 11 places in 0 ms
Iterating global reduction 1 with 7 rules applied. Total rules applied 23 place count 113 transition count 108
Deduced a syphon composed of 11 places in 0 ms
Applied a total of 23 rules in 35 ms. Remains 113 /117 variables (removed 4) and now considering 108/108 (removed 0) transitions.
[2022-05-20 12:57:55] [INFO ] Redundant transitions in 4 ms returned []
// Phase 1: matrix 108 rows 113 cols
[2022-05-20 12:57:55] [INFO ] Computed 23 place invariants in 1 ms
[2022-05-20 12:57:55] [INFO ] Dead Transitions using invariants and state equation in 152 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 113/117 places, 108/108 transitions.
Finished structural reductions, in 1 iterations. Remains : 113/117 places, 108/108 transitions.
Product exploration explored 100000 steps with 2965 reset in 474 ms.
Product exploration explored 100000 steps with 2976 reset in 472 ms.
Built C files in :
/tmp/ltsmin16738968873995746684
[2022-05-20 12:57:56] [INFO ] Built C files in 2ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16738968873995746684
Running compilation step : cd /tmp/ltsmin16738968873995746684;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 272 ms.
Running link step : cd /tmp/ltsmin16738968873995746684;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 26 ms.
Running LTSmin : cd /tmp/ltsmin16738968873995746684;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased8960809191171541885.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 2 out of 117 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 117/117 places, 108/108 transitions.
Applied a total of 0 rules in 1 ms. Remains 117 /117 variables (removed 0) and now considering 108/108 (removed 0) transitions.
// Phase 1: matrix 108 rows 117 cols
[2022-05-20 12:58:11] [INFO ] Computed 23 place invariants in 2 ms
[2022-05-20 12:58:11] [INFO ] Implicit Places using invariants in 80 ms returned []
// Phase 1: matrix 108 rows 117 cols
[2022-05-20 12:58:11] [INFO ] Computed 23 place invariants in 0 ms
[2022-05-20 12:58:11] [INFO ] State equation strengthened by 26 read => feed constraints.
[2022-05-20 12:58:11] [INFO ] Implicit Places using invariants and state equation in 164 ms returned []
Implicit Place search using SMT with State Equation took 250 ms to find 0 implicit places.
// Phase 1: matrix 108 rows 117 cols
[2022-05-20 12:58:11] [INFO ] Computed 23 place invariants in 1 ms
[2022-05-20 12:58:11] [INFO ] Dead Transitions using invariants and state equation in 132 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 117/117 places, 108/108 transitions.
Built C files in :
/tmp/ltsmin2051482856279652995
[2022-05-20 12:58:12] [INFO ] Built C files in 3ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2051482856279652995
Running compilation step : cd /tmp/ltsmin2051482856279652995;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 412 ms.
Running link step : cd /tmp/ltsmin2051482856279652995;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 38 ms.
Running LTSmin : cd /tmp/ltsmin2051482856279652995;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased3525602926911130288.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2022-05-20 12:58:27] [INFO ] Flatten gal took : 14 ms
[2022-05-20 12:58:27] [INFO ] Flatten gal took : 12 ms
[2022-05-20 12:58:27] [INFO ] Time to serialize gal into /tmp/LTL15757222662595812111.gal : 4 ms
[2022-05-20 12:58:27] [INFO ] Time to serialize properties into /tmp/LTL13813047503642292391.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL15757222662595812111.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL13813047503642292391.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL1575722...268
Read 1 LTL properties
Checking formula 0 : !(((X((G("((p119==0)||(p132==0))"))||("((p82==1)&&(p123==1))")))&&((X("(p98==1)"))U(!(((X("((p81==1)&&(p109==1))"))&&("(p116==1)"))&&(...172
Formula 0 simplified : !(X("((p82==1)&&(p123==1))" | G"((p119==0)||(p132==0))") & (X"(p98==1)" U !("(p116==1)" & "(p136==1)" & X"((p81==1)&&(p109==1))")))
Reverse transition relation is NOT exact ! Due to transitions t2, t21, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/tota...170
Computing Next relation with stutter on 289 deadlock states
5 unique states visited
5 strongly connected components in search stack
5 transitions explored
5 items max in DFS search stack
177 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,1.81107,71260,1,0,353,259744,260,276,3609,342807,582
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA Parking-PT-208-LTLFireability-14 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Treatment of property Parking-PT-208-LTLFireability-14 finished in 45549 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0) U (!F(p1)||F(p0))))'
Support contains 3 out of 122 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 122/122 places, 111/111 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 121 transition count 106
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 8 place count 117 transition count 106
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 8 place count 117 transition count 102
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 16 place count 113 transition count 102
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 19 place count 110 transition count 99
Iterating global reduction 2 with 3 rules applied. Total rules applied 22 place count 110 transition count 99
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 32 place count 105 transition count 94
Applied a total of 32 rules in 14 ms. Remains 105 /122 variables (removed 17) and now considering 94/111 (removed 17) transitions.
// Phase 1: matrix 94 rows 105 cols
[2022-05-20 12:58:29] [INFO ] Computed 25 place invariants in 1 ms
[2022-05-20 12:58:29] [INFO ] Implicit Places using invariants in 110 ms returned [41, 53, 102]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 112 ms to find 3 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 102/122 places, 94/111 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 101 transition count 93
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 101 transition count 93
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 6 place count 99 transition count 91
Applied a total of 6 rules in 11 ms. Remains 99 /102 variables (removed 3) and now considering 91/94 (removed 3) transitions.
// Phase 1: matrix 91 rows 99 cols
[2022-05-20 12:58:29] [INFO ] Computed 22 place invariants in 1 ms
[2022-05-20 12:58:29] [INFO ] Implicit Places using invariants in 120 ms returned []
// Phase 1: matrix 91 rows 99 cols
[2022-05-20 12:58:29] [INFO ] Computed 22 place invariants in 1 ms
[2022-05-20 12:58:29] [INFO ] Implicit Places using invariants and state equation in 194 ms returned []
Implicit Place search using SMT with State Equation took 322 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 99/122 places, 91/111 transitions.
Finished structural reductions, in 2 iterations. Remains : 99/122 places, 91/111 transitions.
Stuttering acceptance computed with spot in 85 ms :[(NOT p0), (AND (NOT p0) p1)]
Running random walk in product with property : Parking-PT-208-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=(AND p1 (NOT p0)), acceptance={} source=1 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=1 dest: 1}]], initial=1, aps=[p0:(AND (EQ s14 1) (EQ s34 1)), p1:(EQ s27 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 946 steps with 30 reset in 3 ms.
FORMULA Parking-PT-208-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Parking-PT-208-LTLFireability-15 finished in 569 ms.
All properties solved by simple procedures.
Total runtime 107503 ms.

BK_STOP 1653051510012

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

+ export LANG=C
+ LANG=C
+ 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
+ export PYTHONPATH=/usr/lib/python3.9/site-packages/
+ PYTHONPATH=/usr/lib/python3.9/site-packages/
+ export LD_LIBRARY_PATH=/usr/local/lib:
+ LD_LIBRARY_PATH=/usr/local/lib:
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202205111006.jar
+ VERSION=202205111006
+ echo 'Running Version 202205111006'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data @none -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=@none -Xss128m -Xms40m -Xmx8192m

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-208"
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-208, 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 r150-smll-165276998700308"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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